Well, after some research, turned out I wasn't the first to think about it =( : https://github.com/philipl/pifs/tree/master/src

But well, the idea is to use the digits of any transcendental number as the memory. Since they're infinite, they're sure to contain every single combination of every data ever produced. Doing such would mean it might take a loot of time to find the perfect combination that represents the file you want to compress, but it would just be a simple reference that reproduces the sequence when the compressed file is run!! How small can that be!?

Some might argue and say that the index of the digit in the transcendental number that starts the sequence of your "compressed" data might be a number that is larger than your file itself! True; that is a flaw. The github project, which I posted its link above, had this idea of dividing bigger files into fragments. That increases the probability of "excavating" your data from Pi with a smaller reference, but they might be more; thus making the "compressed file", or actually the list of references and lengths of the fragments of your data within Pi, larger. Just imagine how far you would be able to compress your files or media!

What do you guys think?

But well, the idea is to use the digits of any transcendental number as the memory. Since they're infinite, they're sure to contain every single combination of every data ever produced. Doing such would mean it might take a loot of time to find the perfect combination that represents the file you want to compress, but it would just be a simple reference that reproduces the sequence when the compressed file is run!! How small can that be!?

Some might argue and say that the index of the digit in the transcendental number that starts the sequence of your "compressed" data might be a number that is larger than your file itself! True; that is a flaw. The github project, which I posted its link above, had this idea of dividing bigger files into fragments. That increases the probability of "excavating" your data from Pi with a smaller reference, but they might be more; thus making the "compressed file", or actually the list of references and lengths of the fragments of your data within Pi, larger. Just imagine how far you would be able to compress your files or media!

What do you guys think?

A-Engine: A new beat em up game engine inspired by LF2. Coming soon

A-Engine Dev Blog - Update #8: Timeout