Let's crack Sloot algorithm - infinite "compression"

[WhatIsIt]

You are very right,


this is not easy task, and it involves lots of brainstorming, for sure.

But is very interesting.

[nix85]

My thought was,



once we convert sequence into pairs of coordinates,

we read coordinates as number again and second iteration goes.

We write number of iterations into one long integer.



Can you try to explain how would you do it, just to see where I could be wrong?


Lets presume that we can write more numbers with coordinates than the number sequence really is.

its not about writing the number of iterations...like i said, look for decoder side, how will decoder know at which iteration to pick coordinates.

there is no way to avoid the spacer and this is where this idea dies.

[WhatIsIt]

Damn,


It was starting to get fun!

[WhatIsIt]

Anyway, good topic Nix,



Regards.

[nix85]

yea, sooner or later someone will crack it. hopefully they'll share it, if not no prob, we got quite bandwidth these days