3 ms·
I love that they ran with this far enough to get it working. We need a graph of the average number of bits to store an offset into pi versus size of stored data
by netflixandkill 5y ago
I love that they ran with this far enough to get it working. We need a graph of the average number of bits to store an offset into pi versus size of stored data.
- floren 5y agoWell, based on this sentence: > In this implementation, to maximise performance, we consider each individual byte of the file separately, and look it up in π. I'd say best-case scenario, you're looking at 1:1 offset storage size vs. stored data size :)
- k__ 5y agoHow would the location search slow down with inceased block size? And is the algorithm to do so faster on a quantum computer?
- netflixandkill 5y agothat's way worse than 1:1 unless all integers between 0 and 255 occur in the first 256 digits of pi, which I'm 99.pi% sure is not the case.
- deleted 5y ago[deleted]