!!!ATENTION PLEASE!!!


короче сейчас будет важная информация про то как нас всех очень жестоко обманывают на тему сжатия данных, в принципе нас очень жестоко обманывают вообще про все, но в данном случае ограничимся только этой темой. мой пост на эту тему снесли без объяснений уже с трех площадок, вот заодно и проверим насколько Мише важны принцип свободы слова. имейте в виду Михаил, как вы поступите сейчас также поступят с вами. пост на англ:
In pure and simple term problem of compression is problem of assign boxes to pigeons. so let we have all binary, becouse computer work in binary, but it works with every other alphabet, strings size N from 00...00 up to 11..11, and we want biject this set to set of strings of smaller size. size of our set is 2^N and size of set of all strings smaller at least at one bit is 2^(N-1) + 2^(N-2) + ...+2^(1), whicht is smaller. at this point everybody wave their hand and say "see, number of pigeons is bigger than number of boxes, disperse everyone" and start doing some strange things like probabilities distribution, entropy and other statistics, but in essence problem still in pigeons and their boxes. for some reason people think becouse we have more pigeons than boxes then we cant do anything. but that wrong, we can, or we add more boxes, or we remove some pigeons.
strategy one - remowing pigeons. 2^N is bigger than 2^(N-1) + 2^(n-2) + ...+2^(1), but how much bigger? it has two strings more. so, if we remove two strings from from 2^N set then we can have bijection. example for case N=3: 000->removed, 001->0, 010->1, 011->00, 100->01, 101->10, 110- >11, 111->removed.
strategy two - add boxes. now let it be some arbitrary natural number N - maximum of bits on which we define algorithm. now constract set of all strings with sizes from 1 to N, total size of this set is equal 2^1 + 2^2 +...+2^N = 2^(N+1) - 2 - even number. and now we arbitraraly bijecti this set onto itself, ie we construct some function F(n) that take on input some element n1 of this set and then spill out another element n2 of the set, and of course reverse function G(n) which reverse this process ie G(n2) = n1. example right out wiki: strings abababababababababababababababab and 4c1j5b2p0cv4w1x8rx2y39umgw5q85s7. first one we know how to compress it easily, but second dont. so our solution is just say that second string biject to first, and then compress it.
as you can see you can in theory compress, or better say biject, any file to any size. also fucking jews kill jan sloot for this.

про баб чот

сжимаемый контент собираешься прямо в программу-распаковщик засунуть?

https://imageupload.io/ib/c80vnXjEUCM3vnx_1699863135.jpg
нет. вот таблицы для случаев N = 4 и N = 5, но очевидно что такие таблицы можно сделать для любого значения, например 8192 или 8388608 или даже 8589934592.