Live data from Hacker News

100% Compression Using Pi

github.com

21–30 of 34 posts

Re: 100% Compression Using Pi

#22
post #16
post #9

1. There is no proof that pi is a normal number. 2. The index of the position takes up space.

1. Well, here's to hoping. 2. He addressed this - you store the index in pi as well. If the index of the index is too big, you can store that too... indices all the way down!

You then have to store how many levels down the real, as opposed to index, data is. If you have looped enough to have reached an index that is small, the depth count will on average be so large that it takes about as much space as your original data.

Re: 100% Compression Using Pi

#24
Here's an idea for data storage inspired by this project: 1. Encode the data into a floating number R 2. Take a steel rod, assuming its length is L, make a mark on the rod at the distance of L*R from one end To read the data, just measure the location of the mark and back out R. Not as genius but isn't it still great? :)

Re: 100% Compression Using Pi

#25
post #19
post #12

It's not a good compression algorithm because the offset into pi will require more digits to represent than the data you are trying to compress in the first place. Quite a lot more considering the law of big numbers. So ultimately this algorithm is going to expand the size of your data by some enormous factor.

No, you just have to store the offset as well. And the offset for the offset. Then you just have to keep track of the number of offset cycles you've gone through - and you can store this as well. Keep doing this until you have a number that is smaller than your file... might take a while, but it would be very elegant.

considering the first offset is much, much larger than the file you started with. the offset to the offset is just going to increase in size with each iteration.
Post reply on HN