Open ghost opened 9 years ago
Ahh, just started reading through the other issue, looks like this is more or less what I just posted https://github.com/philipl/pifs/issues/42
I think the point of this project is that EVERY piece of hexadecimal data is a singular part of pi but what you (and I) are suggesting is that finding smaller parts of the whole might be much faster than looking for the whole thing.
Assume a moderately-sized file wanting to compress. Since there is a SMALL chance of the hexadecimal data as a singular part of pi. So why not multiple parts? Example is example:
Data: ABSODJ
Pi: AABBABFSODIJ
Data in Pi: aabbABdSODiJ
Metadata: Letters 5-6,8-11,13
I know the example is not using hexadecimal data, but I am too lazy.