11–17 of 17 posts
[1] https://en.wikipedia.org/wiki/KGB_Archiver [2] https://en.wikipedia.org/wiki/PAQ6
We just to joke at NetApp that the Oil and Gas industry had the best compression algorithm, it could compress 100TB of seismic imaging data into a single bit {oil / no-oil } :-) I created a theoretical compressor which I haven't yet been able to implement which uses the fact that every sequence of bits appears in pi somewhere, so my compressor would just return the digit offset and the length of data. I keep looking…
We just to joke at NetApp that the Oil and Gas industry had the best compression algorithm, it could compress 100TB of seismic imaging data into a single bit {oil / no-oil } :-) I created a theoretical compressor which I haven't yet been able to implement which uses the fact that every sequence of bits appears in pi somewhere, so my compressor would just return the digit offset and the length of data. I keep looking…
P.s. As the author states in issue #2, "the release date of pifs is an important part of understanding what's going on" ;)
We just to joke at NetApp that the Oil and Gas industry had the best compression algorithm, it could compress 100TB of seismic imaging data into a single bit {oil / no-oil } :-) I created a theoretical compressor which I haven't yet been able to implement which uses the fact that every sequence of bits appears in pi somewhere, so my compressor would just return the digit offset and the length of data. I keep looking…
After having experimented a bit in high school with ideas for compression algorithms like this, I can tell you that one of the problems you'd run into is that you may have to look so deep into pi that the offset may actually take the same number of bits (or even more bits) than the sequence you're trying to find.
We just to joke at NetApp that the Oil and Gas industry had the best compression algorithm, it could compress 100TB of seismic imaging data into a single bit {oil / no-oil } :-) I created a theoretical compressor which I haven't yet been able to implement which uses the fact that every sequence of bits appears in pi somewhere, so my compressor would just return the digit offset and the length of data. I keep looking…
You might find PiFs interesting: https://github.com/philipl/pifs P.s. As the author states in issue #2, "the release date of pifs is an important part of understanding what's going on" ;)
We just to joke at NetApp that the Oil and Gas industry had the best compression algorithm, it could compress 100TB of seismic imaging data into a single bit {oil / no-oil } :-) I created a theoretical compressor which I haven't yet been able to implement which uses the fact that every sequence of bits appears in pi somewhere, so my compressor would just return the digit offset and the length of data. I keep looking…
I don't think that's completely true yet, it's just incredibly likely. I don't mean you can't build the thing, you just can't quite prove it accepts all input; it could work in practice before it works in theory.
Re: what komon said, if the offset dwarfs the input, perhaps you could find the offset of the offset, so on and so forth, keeping track of the # of indirections (until that number exceeds the input).
Earlier quoted context omitted.
You might find PiFs interesting: https://github.com/philipl/pifs P.s. As the author states in issue #2, "the release date of pifs is an important part of understanding what's going on" ;)
I really like that one too :-) Apparently there was a scam to sell a data set of all the US social security numbers, and the "decompressor" was just computing progressive digits of pi and printing them in xxx-yy-zzzz formatting.
https://blort.org/~kgasso/images/how-to-catch-script-kiddies...
