Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Enhanced metadata #33

Open
ghost opened this issue Feb 20, 2015 · 1 comment
Open

Enhanced metadata #33

ghost opened this issue Feb 20, 2015 · 1 comment

Comments

@ghost
Copy link

ghost commented Feb 20, 2015

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.

@joshstrange
Copy link

Ahh, just started reading through the other issue, looks like this is more or less what I just posted #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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant