Do you know "Bailey–Borwein–Plouffe" formula?

As ipfs is storing in less than 256kB, we could consider it like π sequences…

Found it from GitHub - philipl/pifs: πfs - the data-free filesystem!

Bailey–Borwein–Plouffe formula

I wonder if this formula could be useful for ipfs ?
What do you think ?

Looks to me that to me that looking things would be fast thanks to BBP, but it doesn’t look like there is a simple way to compress the data, meaning a way to discover at which Pi’s digit your file starts.

I see 2 problems:

  1. How do you find that your 256kB of data in particular are actually at the Nth position? I suspect that they will be veeeeery far in Pi’s digit, so very long to compute the “compressed” data
  2. If I’m right, I suspect the index in Pi will be so large for any large file, that it could be larger than the file itself. My intuition is that someone even already proved that.

I’m happy to be proven wrong, though!