We know exactly how much time we need to compute the nth digit of pi. But how much time do we need to find a specific string of digits? Seems like a more interesting question.
It also stimulate the imagination: what other transcendental numbers might this work with? How long do you have to search in the digits to find your string? What can you say about the size of the index (how far you searched) vs your string length? Etc. It's patterns all the way down.
Looks to me like nfs is simply transforming a binary space index into a pi-space index. Some files may compress to a smaller value than they are in binary space (if you get lucky), but make no mistake, some files will be much much larger (i.e. the files you're trying to store don't show up in pi until an index value that is a virtually infinite number of digits long).
Why is this thing so slow? It took me five minutes to store a 400 line text file!
Well, this is just an initial prototype, and don't worry, there's always Moore's law!
So I'm guessing they are quite aware of the joke, and props to them for the dedication to commit and write the code (or the other way around) :)
The library of babel could be a good "useless" backing though https://libraryofbabel.info/bookmark.cgi?hnexample
It takes the input, converts it into N, then calculates position using the N.
Thank you. I argued for a long time simply by being ignorant.
good bless ya sir.
> What will the super computers going to do in view of this discovery?
Whatever they do now. It’s not like this is what supercomputers are built for. Computations like these more are used to get confidence that the hardware works.