Let's crack Sloot algorithm - infinite "compression"

[WhatIsIt]

I been reading a lot about endless compression. EC.

You got me hooked.

I did not realize how much money it worth and EC
has its own casualties, just as FE.
Lots of people been involved over the years,
but nobody found solution.

Pointers of any kind wont do much good.
Because there must be number of pointers same as number of data chunks
they are pointing, so compression is limited or small.

Same goes for any type of hash or rainbow tables.

Another type of writing is needed,
which does not involve pointers or similar, or equations.

[nix85]

like that guy in the video said they expected 100 billion dollars turnover within 4 years.
but screw the money, greedy mindset is not worthy of it, the biggest reward is appreciation of a principle. i wouldnt compare it to fe, fe is solved in million ways, i don't know if anyone solved this after sloot

that's what i'm saying, pointers are no good, at least not pointers alone

1:2,000,000 compression must be some kind of multistage compression

how to send data without sending it, "receiver knows what can and cannot be sent"

maybe if we stare into his eyes long enough it will come to us

[WhatIsIt]

It will come.

No secret is forewer.

[WhatIsIt]

If you think about it.

It is not compression at all.

Another way for data to write itself.

Pi is holding so much data. Counter is pointing to every and each sequence.

So, it is not sequence, it is counter.

[nix85]

sure it will. sooner or later.

not compression indeed, that's why i put it in quotes

there is infinity of data all around us, not only in pi

of course, how to index it in efficient way is the missing key