Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

File system that stores location of file in Pi

github.com

Post reply on HN
Print view View original

1–10 of 102 posts

Re: File system that stores location of file in Pi

#4

Post by ch4ch4 »

somid3 wrote: post #2

Fascinating implementation I must admit. How does i/o performance change as the byte-length or chunks vary in size from 3 to 200 bytes?

I think it would probably take forever for the initial lookup, because the probability of matching any 3 byte sequence is higher than matching a 200 bytes sequence?

Re: File system that stores location of file in Pi

#5

Post by zaroth » 

  Now, we all know that it can take a while to find a long sequence of digits in π,
  so for practical reasons, we should break the files up into smaller chunks that
  can be more readily found.

  In this implementation, to maximise performance, we consider each individual byte
  of the file separately, and look it up in π.
Definitely worth a chuckle. Very cute idea and implementation.

Re: File system that stores location of file in Pi

#7

Post by E_Carefree »

XorNot wrote: post #6
Jack5500 wrote: post #3

This project was posted before and hasn't been updated since. I doubt that it is still in development

Its also pretty obviously an elaborate mathematics joke.

Yes, but it conceivable. It's like a code. You could securely save files with two numbers. Just a position and length.

Re: File system that stores location of file in Pi

#8

Post by bunderbunder »

I'm skeptical that this could really save any space. Just speculating here, really, but it seems like on average the amount of space needed to store the starting index of an arbitrary string of digits in pi should be greater than (or at least comparable to) the size of the string itself.

e.g., the first instance of "256" in pi starts at the 1750th digit. So in that case you're getting a 'compression' rate of -33% if we go by the count of decimal digits used.

Re: File system that stores location of file in Pi

#9

Post by zaroth »

ch4ch4 wrote: post #4
somid3 wrote: post #2

Fascinating implementation I must admit. How does i/o performance change as the byte-length or chunks vary in size from 3 to 200 bytes?

I think it would probably take forever for the initial lookup, because the probability of matching any 3 byte sequence is higher than matching a 200 bytes sequence?

Literally forever, right?

It's basically scanning a random byte-stream for a 200-byte long exact match. 200 bytes, 1600 bits, or 2^1600 different possible sequences, making the odds 1/2^1600 that any particular 200 bytes pulled out will match the bytes you are looking for.

Post reply on HN