News for hackers. Stuff that matters.
Re:Ask HN: Looking for compression algorithm that took 6GB t... by ChuckMcM on Tuesday January 05, 2016 @05:56PM (#10846758)
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 for a source for all the digits of pi though, have yet to find it.

Re:Ask HN: Looking for compression algorithm that took 6GB t... by komon on Wednesday January 06, 2016 @03:23PM (#10853449)
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.
Re:Ask HN: Looking for compression algorithm that took 6GB t... by ChuckMcM on Wednesday January 06, 2016 @05:08PM (#10854206)
If you're up for it there is some great number theoretic work to be had in that statement :-). Given a sequence of digits X, P{X} E {Offset n .. Offset p} ? len{Offset n} > len{X}
Re:Ask HN: Looking for compression algorithm that took 6GB t... by arh68 on Wednesday January 06, 2016 @10:03PM (#10855692)
> which uses the fact that every sequence of bits appears in pi

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).

Re:Ask HN: Looking for compression algorithm that took 6GB t... by simon_acca on Wednesday January 06, 2016 @05:02PM (#10854164)
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" ;)

Re:Ask HN: Looking for compression algorithm that took 6GB t... by ChuckMcM on Wednesday January 06, 2016 @05:14PM (#10854249)
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.
Re:Ask HN: Looking for compression algorithm that took 6GB t... by DanBC on Wednesday January 06, 2016 @10:06PM (#10855705)
Or the "Hacker tool" EVERY IP ADDRESS EVER released on P2P services.

https://blort.org/~kgasso/images/how-to-catch-script-kiddies...

http://imgur.com/04sMAxd

Re:Ask HN: Looking for compression algorithm that took 6GB t... by digital_ins on Wednesday January 06, 2016 @07:52AM (#10850193)
why not just create an online API for this? Sequences that are not yet "found" would go uncompressed, and as time goes by and internet speeds get faster and computing power gets cheaper, more sequences will be "found" for reference in that API and the algorithm will keep getting better.

Alternatively, you could release a program that comes with an already long sequence of the decimal section of PI and connects regularly to the internet to download more digits (you could even run the computation & API on a google compute / amazon ec2 instance to keep costs low)