Russians Invented Infinite Compression Algorithm

http://lj.rossia.org/users/sadkov/247149.html

Nikita === Mentifex === Frozen Void ... all connected...

>>2
Nostrovia, Ivan! Will you explain to our foreign friends how this Russian infinite compression works?

Here is another Russian algorithm, which too compressed any data to a single bit:
http://www.pvsm.ru/algoritmy/87831

FrozenVoid, dou you have a patent? Because these Russians are going to rip you off!!!

>>4

FrozenVoid, dou you have a patent

No, i put it in public domain.
They're using something different, some bitstring transformations however the example is very opaque.
They have to store locations of insertions in each case, which nullifies any such replacement of bitstring fragments as locations have to be >8 bits.
Edit: They seem to be using an insertion bitmap, which means they claim that reduced file+bitmap have to be smaller than original? Edited on 26/10/2018 15:47.

>>4
FrozenVoid, dou you have a patent
↵
    FrozenVoid, dou you have a patent↵

No, i put it in public domain.
 They're using something different, some bitstring transformations however the example is very opaque.↵
 They have to store locations of insertions in each case, which nullifies any such replacement of bitstring fragments as locations have to be >8 bits.
They're using something different, some bitstring transformations however the example is very opaque.↵
They have to store locations of insertions in each case, which nullifies any such replacement of bitstring fragments as locations have to be >8 bits. ↵
Edit: They seem to be using an insertion bitmap, which means they claim that reduced file+bitmap have to be smaller than original?

>>5
It doesn't make sense even for 2bit sequences.
64 bit number needs 16*2bit seqs(half of itself)
and it will be 32bits reduced and 32bit insertion bitmap, same 64bits. To gain anything there have to be more seqs than half of number.

http://lurkmore.to/%D0%90%D0%BB%D0%B5%D0%BA%D1%81%D0%B5%D0%B9_%D0%91%D0%B0%D0%B1%D1%83%D1%88%D0%BA%D0%B8%D0%BD#.D0.90.D1.80.D1.85.D0.B8.D0.B2.D0.B0.D1.82.D0.BE.D1.80

>>7
I'll give you a great idea - now divide different numbers one to another, convert the rest into avi and watch films that have not yet been released :)
"
- The result of the discussion of the Babushkinsky compression algorithm on the habr.

The young genius himself describes his invention as follows:

The archiving algorithm ™ is as follows: any file is a HEX-sequence of characters, we translate this HEX to DEC, we get a non-logical number, add the number 0 before this, we get a number from 0 to 1 with a huge number of decimal places, and then everything is simple - we select 2 such integer numbers, the quotient of which will give us the desired number in the range from 0 to 1 with the accuracy of matches to the last digit. The trouble is in the selection of numbers, which can go 2 hours, and can go 2 weeks. There are prototypes and a working program, and it all works.

Compressed movie "Click" (File deleted). The test algorithm archiving Grandma.

On March 2, 2013, the Vkontakte patient posted a link to Chris Kaspersky’s article “The Power of Reed-Solomon Codes or Information Risen from the Ashes”, after reading which, one can understand that even the “archiving” algorithm of archiving was borrowed from a half-amusing section of an article about aliens.

Based on the principle of the archiver's work, the algorithm "Grandma's Sorting" was developed, which has a unique work time O (n). The main thing is to choose the numbers that, when divided, will give the number of Babushkin, in a time shorter than the thermal death of the Universe.

>>8
basically this idea is a/b(where a>b)=0.xxx=>integer xxx is converted to file.
The idea requires that a and b have to be compactly represented or be really small(highly unlikely). Since he doesn't describe how to store such huge numbers compactly, its not even compression.

The author conducted research on randomly located data, in which the measure of chaos (entropy) is maximal. In this chaos, the author found some data structures that are more ordered (less chaotic) than others. Instead of writing articles to scientific journals and getting the Nobel Prize :) on the neck, the author decided to use the discovery for personal gain for humanity: to help create programs that can compress data (video, music, books, pictures) many times better than that is already there now. Thus, the author wants to increase the speed of the Internet by orders of magnitude, increase the electronic memory devices to almost infinity and make the information as accessible as possible anywhere in the world. As always, humanity (in any case, the most enlightened part of it in the Russian-speaking segment) responded, mainly with deaf discontent, to perfidious attempts to undermine stability and disrupt the usual course of things.