{"id":141,"date":"2012-03-31T19:12:02","date_gmt":"2012-04-01T03:12:02","guid":{"rendered":"http:\/\/intr.overt.org\/blog\/?p=141"},"modified":"2012-03-31T19:12:02","modified_gmt":"2012-04-01T03:12:02","slug":"%cf%80fs-the-filesystem-of-the-future","status":"publish","type":"post","link":"https:\/\/blog.intr.overt.org\/?p=141","title":{"rendered":"\u03c0fs: The Filesystem of the Future!"},"content":{"rendered":"

I’m very pleased to announce that after eight years of research and development, I can present the world’s most revolutionary filesystem: \u03c0fs<\/a>!<\/p>\n

What is \u03c0fs?<\/h2>\n

\u03c0fs is a revolutionary new file system that, instead of wasting space storing your data on your hard drive, stores your data in \u03c0! You’ll never run out of space again – \u03c0 holds every file that could possibly exist, so why put your files anywhere else?! They said 100% compression was impossible? You’re looking at it!<\/p>\n

What does \u03c0 have to do with my data?<\/h2>\n

\u03c0 (or pi) is one of the most important constants in mathematics and has a variety of interesting properties (which you can read about at wikipedia<\/a>)<\/p>\n

One of the properties that \u03c0 is conjectured to have is that it is normal<\/em>, which is to say that its digits are all distributed evenly, with the implication that it is a disjunctive sequence<\/em>, meaning that all possible finite sequences of digits will be present somewhere in it. If we consider \u03c0 in base 16 (hexadecimal) , it is trivial to see that if this conjecture is true, then all possible finite files must exist within \u03c0. The first record of this observation dates back to 2001<\/a>.<\/p>\n

From here, it is a small leap to see that if \u03c0 contains all possible files, why are we wasting exabytes of space storing those files, when we could just look them up in \u03c0!<\/p>\n

Every file that could possible exist?<\/h2>\n

That’s right! Every file you’ve ever created, or anyone else has created or will create! Copyright infringement? It’s just a few digits of \u03c0! They were always there!<\/p>\n

But how do I look up my data in \u03c0?<\/h2>\n

As long as you know the index into \u03c0 of your file and its length, its a simple task to extract the file using the Bailey\u2013Borwein\u2013Plouffe formula<\/a> Similarly, you can use the formula to initially find the index of your file<\/p>\n

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

In this implementation, to maximise performance, we consider each individual byte of the file separately, and look it up in \u03c0.<\/p>\n

So I’ve looked up my bytes in \u03c0, but how do I remember where they are?<\/h2>\n

Well, you’ve obviously got to write them down somewhere; you could use a piece of paper, but remember all that storage space we saved by moving our data into \u03c0? Why don’t we store our file locations there!?! Even better, the location of our files in \u03c0 is metadata and as we all know<\/a> metadata is becoming more and more important in everything we do. Doesn’t it feel great to have generated so much metadata? Why waste time with old fashioned data when you can just deal with metadata, and lots of it!<\/p>\n

Yeah, but what happens if lose my file locations?<\/h2>\n

No problem, the locations are just metadata! Your files are still there, sitting in \u03c0 – they’re never going away, are they?<\/p>\n

Why is this thing so slow? It took me five minutes to store a 400 line text file!<\/h2>\n

Well, this is just an initial prototype, and don’t worry, there’s always Moore’s law!<\/p>\n

Where do we go from here?<\/h2>\n

There’s lots of potential for the future!<\/p>\n