Let's crack Sloot algorithm - infinite "compression"

[nix85]

just to add, answer might be in SUPERPOSITION.

EDIT: i removed the idea of projecting multiple films one over another, that was just a side idea which would clearly not work, but i feel he used superposition in some way.

for example how much data can fit in 1 second of digital sound, 44,100 samples per second, 16 bits per sample...no matter how complex the sound is size of the file will be the same.

even with limited sound bandwidth of 50Hz-20KHz, layers of data can fit into many subbands, clearly, higher we go toward top frequency, more data per second.

if more data can be crammed this way than it takes to produce the sound, then further compression is possible.

of course sound is just an example, it would be far more efficient to use higher frequencies.

he said age of digital is over

[nix85]

i created in audacity what was supposed to be 22khz and 18khz squarewave and mixed them.

but uncompressed wav file like this would be huge and once you pack it up with so much signals you could hardly compress it further, data would become nonreadable.

not a solution, just an idea.

[WhatIsIt]

Hi Nix,

didnt forget, just reading about losseless compression methods to maybe
see what is missing.

Yes, the analog can store more, but then we must store analog somehow again.

I been on trail on maze algorithm.
The theory is simple.
You have 10*10 grid.
You start from lets say 5, 0. Bottom of grid.
Then you move up choosing right and left, and up for every step.
Every intersection on grid has rules, it writes numbers which will tell you did you turn right or left, 0 or 1.
When you reach top, lets say 7. 10, you just start from 7, 0.
It is eternal grid. No ending.
Flags, numbers on intersections are remembering from where you came.

It means that if you go backward following the same rules you will end up where you begin.

In maze you write your start position, number of steps, and end position,
and you record grid intersection numbers, flags.

So, end file length is always the same length, different number of steps and different end position.

In between there are trillions of possible combinations. Left and right, and up for every step.

It is not new idea. But what to write on interswctions to remember the way you come from?
There are few people which are working on this problem,
you will be amazed how far they come.

[nix85]

in fact, what you call endless maze is where the idea on the 1. page came from, it's one and the same thing.

i thought of all possible variations, 1 column and set of random data flowing through it left to right and a pointer jumping up and down according to instructions.

or static random data table and pointer moving by given angle, even in 3d cube like structure.

the problem is that instructions that can cover any random data are in the end longer than the data.

we need to think in simpler terms

[nix85]

the idea i liked the most from the start is that he a used complex logic pyramid

maybe he took 3 symbols on the top and using complex logic, parametrized by random data, expanded them into longer strings of symbols over and over again

what i mean is that $%) on top can expand into many different strings depending on the random input at each step and if same random input is used same long string will be generated always

and then reversed the process, using complex logic and same random numbers that are not being sent but will be generated at the other side, he compressed those long strings into shorter and shorter ones

maybe those 70mb contained not only logic but many possible patterns and random set combinations that would speed up the compression.

this, ofc, could be all digital. i dont see the need for literally analog since all is essentially analog. analog seems like blind alley cause you need huge amount of data to create complex waveforms, but logic and same random data does not.


                              $%)
                            $&$/(%/
                         $%&%$/&%//
                    $%/&()/%&=)/&)=/)/
                )/(=)#?$)=(#?)=("=($)"#(
         (/Z/&#)=(/?()"?)=UIFO#")=U(F?)="
    $%&%/(&=)/&=)(/=)(/&(/&)(/&)(/&()/&()
/&#ZUIFR()F)==F)=#/(/&Q"#)=#=)")=#$/(&/(