Language:
To browser these website, it's necessary to store cookies on your computer.
The cookies contain no personal information, they are required for program control.
the storage of cookies while browsing this website, on Login and Register.

### GDPR and DSGVO law

Storing Cookies (See : http://ec.europa.eu/ipg/basics/legal/cookies/index_en.htm ) help us to bring you our services at overunity.com . If you use this website and our services you declare yourself okay with using cookies .More Infos here:
https://overunity.com/5553/privacy-policy/
If you do not agree with storing cookies, please LEAVE this website now. From the 25th of May 2018, every existing user has to accept the GDPR agreement at first login. If a user is unwilling to accept the GDPR, he should email us and request to erase his account. Many thanks for your understanding

Custom Search

### Author Topic: Let's crack Sloot algorithm - infinite "compression"  (Read 16026 times)

#### nix85

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #45 on: July 23, 2020, 02:10:25 PM »
i dont think he was such an idiot, to try to fool CEOs of multi billion companies with a shortcut, lol.

his facial expression to me confirms he had a great discovery.

#### WhatIsIt

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #46 on: July 23, 2020, 02:12:14 PM »
Too much money was at stake, so faking is less probable.

Nix,

Random numbers are random and we can not predict sequence.

But dividing numbers will give sequences which we can predict,
because the result is always the same.

There is simple way to solve entropy.

2 small numbers divided can give up to 10 numbers before they start to repeat.

22/7 = 3.142857  with 2 small numbers which can be packed into 1 byte,
we wrote 7 numbers.

Which gives me idea.
Irrational numbers.

Pi is holding all combinations in universe never repeating.
Question is how to implement pointer to known sequence inside it?
I mean, for decoding, we dont remember sequences, but initial conditions to calculate pi from
given decimal point for the given length.

For coding we have to have pi calculated for maybe trillion decimals,
and write in table conditions from where cpu will start calculating,
but for decoding cpu just calculates pi from conditions.

So we remember conditions for calculating pi from given decimal point,
for the given length. Resulting in calculating needed sequence of x numbers.

We calculate. We dont remember sequences.

Another example is square root from 2,
same thing.
It holds all possible short and long sequences needed.

#### triangle

• Jr. Member
• Posts: 55
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #47 on: July 23, 2020, 02:19:17 PM »
i dont think he was such an idiot, to try to fool CEOs of multi billion companies with a shortcut, lol.

his facial expression to me confirms he had a great discovery.

Well, it depends how you seeing it, maybe he was a genius in fooling CEO,s

Anyways, it was my opinion, you might be right.

I wish everyone good luck to create or find the algorithm.

All his documentation is buyed, so they should have found something, however his computer box is dissapeared, i think destroyed after the family and his partner found out the reason behind.

No oil gigants could be involved, so no reason to hide if it was real.

Goid luck .

#### WhatIsIt

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #48 on: July 23, 2020, 02:24:46 PM »
Calculating holds the key.

By calculating we can create more numbers than is needed,
by writing initial conditions for calculation only.

And irrational numbers are huge containers which already holds all
possible sequences we can imagine.

#### nix85

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #49 on: July 23, 2020, 02:25:04 PM »
Too much money was at stake, so faking is less probable.

Nix,

Random numbers are random and we can not predict sequence.

But dividing numbers will give sequences which we can predict,
because the result is always the same.

There is simple way to solve entropy.

2 small numbers divided can give up to 10 numbers before they start to repeat.

22/7 = 3.142857  with 2 small numbers which can be packed into 1 byte,
we wrote 7 numbers.

Which gives me idea.
Irrational numbers.

Pi is holding all combinations in universe never repeating.
Question is how to implement pointer to known sequence inside it?
I mean, for decoding, we dont remember sequences, but initial conditions to calculate pi from
given decimal point for the given length.

For coding we have to have pi calculated for maybe trillion decimals,
and write in table conditions from where cpu will start calculating,
but for decoding cpu just calculates pi from conditions.

So we remember conditions for calculating pi from given decimal point,
for the given length. Resulting in calculating needed sequence of x numbers.

We calculate. We dont remember sequences.

Another example is square root from 2,
same thing.
It holds all possible short and long sequences needed.

eh, irrational numbers, i gave them as much thought since day 1 as i did anything so far mentioned, including making a table of calculations for all the numbers with sets of "random" numbers, and then using a certain decimal value as pointer.

but you are stuck with same issue as before, trying to fit 100 numbers in 1 digit.

this is brute force approach and not good as such

i'd say goal is not to break entropy but expand the system on both sides, find common wider reference

one of ideas i had was criss crossing or navigating pi, but that approach is so flawed i don't even need to mention

3 . 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0 2 8 8 4 1 9 7 1 6 9 3 9 9 3 7 5 1 0 5 8 2 0 9 7 4 9 4 4 5 9 2 3 0 7 8 1 6 4 0 6 2 8 6 2 0 8 9 9 8 6 2 8 0 3 4 8 2 5 3 4 2 1 1 7 0 6 7 9 8 2 1 4 8 0 8 6 5 1 3 2 8 2 3 0 6 6 4 7 0 9 3 8 4 4 6 0 9 5 5 0 5 8 2 2 3 1 7 2 5 3 5 9 4 0 8 1 2 8 4 8 1 1 1 7 4 5 0 2 8 4 1 0 2 7 0 1 9 3 8 5 2 1 1 0 5 5 5 9 6 4 4 6 2 2 9 4 8 9 5 4 9 3 0 3 8 1 9 6 4 4 2 8 8 1 0 9 7 5 6 6 5 9 3 3 4 4 6 1 2 8 4 7 5 6 4 8 2 3 3 7 8 6 7 8 3 1 6 5 2 7 1 2 0 1 9 0 9 1 4 5 6 4 8 5 6 6 9 2 3 4 6 0 3 4 8 6 1 0 4 5 4 3 2 6 6 4 8 2 1 3 3 9 3 6 0 7 2 6 0 2 4 9 1 4 1 2 7 3 7 2 4 5 8 7 0 0 6 6 0 6 3 1 5 5 8 8 1 7 4 8 8 1 5 2 0 9 2 0 9 6 2 8 2 9 2 5 4 0 9 1 7 1 5 3 6 4 3 6 7 8 9 2 5 9 0 3 6 0 0 1 1 3 3 0 5 3 0 5 4 8 8 2 0 4 6 6 5 2 1 3 8 4 1 4 6 9 5 1 9 4 1 5 1 1 6 0 9 4 3 3 0 5 7 2 7 0 3 6 5 7 5 9 5 9 1 9 5 3 0 9 2 1 8 6 1 1 7 3 8 1 9 3 2 6 1 1 7 9 3 1 0 5 1 1 8 5 4 8 0 7 4 4 6 2 3 7 9 9 6 2 7 4 9 5 6 7 3 5 1 8 8 5 7 5 2 7 2 4 8 9 1 2 2 7 9 3 8 1 8 3 0 1 1 9 4 9 1 2 9 8 3 3 6 7 3 3 6 2 4 4 0 6 5 6 6 4 3 0 8 6 0 2 1 3 9 4 9 4 6 3 9 5 2 2 4 7 3 7 1 9 0 7 0 2 1 7 9 8 6 0 9 4 3 7 0 2 7 7 0 5 3 9 2 1 7 1 7 6 2 9 3 1 7 6 7 5 2 3 8 4 6 7 4 8 1 8 4 6 7 6 6 9 4 0 5 1 3 2 0 0 0 5 6 8 1 2 7 1 4 5 2 6 3 5 6 0 8 2 7 7 8 5 7 7 1 3 4 2 7 5 7 7 8 9 6 0 9 1 7 3 6 3 7 1 7 8 7 2 1 4 6 8 4 4 0 9 0 1 2 2 4 9 5 3 4 3 0 1 4 6 5 4 9 5 8 5 3 7 1 0 5 0 7 9 2 2 7 9 6 8 9 2 5 8 9 2 3 5 4 2 0 1 9 9 5 6 1 1 2 1 2 9 0 2 1 9 6 0 8 6 4 0 3 4 4 1 8 1 5 9 8 1 3 6 2 9 7 7 4 7 7 1 3 0 9 9 6 0 5 1 8 7 0 7 2 1 1 3 4 9 9 9 9 9 9 8 3 7 2 9 7 8 0 4 9 9 5 1 0 5 9 7 3 1 7 3 2 8 1 6 0 9 6 3 1 8 5 9 5 0 2 4 4 5 9 4 5 5 3 4 6 9 0 8 3 0 2 6 4 2 5 2 2 3 0 8 2 5 3 3 4 4 6 8 5 0 3 5 2 6 1 9 3 1 1 8 8 1 7 1 0 1 0 0 0 3 1 3 7 8 3 8 7 5 2 8 8 6 5 8 7 5 3 3 2 0 8 3 8 1 4 2 0 6 1 7 1 7 7 6 6 9 1 4 7 3 0 3 5 9 8 2 5 3 4 9 0 4 2 8 7 5 5 4 6 8 7 3 1 1 5 9 5 6 2 8 6 3 8 8 2 3 5 3 7 8 7 5 9 3 7 5 1 9 5 7 7 8 1 8 5 7 7 8 0 5 3 2 1 7 1 2 2 6 8 0 6 6 1 3 0 0 1 9 2 7 8 7 6 6 1 1 1 9 5 9 0 9 2 1 6 4 2 0 1 9 8 9

#### lancaIV

• elite_member
• Hero Member
• Posts: 5031
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #50 on: July 23, 2020, 02:32:16 PM »
The best heads works for solution    : https://en.wikipedia.org/wiki/Beale_ciphers

https://en.wikipedia.org/wiki/The_Code_Book

https://en.wikipedia.org/wiki/Quantum_cryptography

https://en.wikipedia.org/wiki/Quantum_superposition  Experiments and applications

The code-key has ever to be "perfect identical" = finite stage  ! Decoding input = Encoding output

Pi and https://www.youtube.com/watch?v=io11cbrTTNg are "endless" numbers, infinite !

1      = I  Unum                 /1                          /= per or pro = in-version
10    = X/D ecem              / 10
100  = C    entum             / 100
1000=M     ile                  /  1000
........

0 = nullus or zero

#### nix85

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #51 on: July 23, 2020, 02:39:38 PM »
i used to think calculating is the key too, that was my first idea, to represent big numbers as short formulas, of course that's a bad idea

its not a problem to generate long strings of numbers, so many ways to do that. to do it in a predictable way for arbitrary values is different story

#### nix85

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #52 on: July 23, 2020, 02:56:37 PM »
when i first got into it i also gave a lot of thought to prime numbers, like indexing first say 1000 primes and breaking down superlong numbers using these and similar. blind alley.

there must be a simple workaround that allows a repatable compression, that is the only way that makes sense how he achieved 1:2 million ratio

4
34
234
1234
01234

#### WhatIsIt

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #53 on: July 23, 2020, 10:21:15 PM »
http://endlesscompression.com

#### nix85

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #54 on: July 23, 2020, 11:35:10 PM »
http://endlesscompression.com

yes, he talks a lot but does not have a solution.

to elaborate more on one of first ideas i had, how to turn 2 digit number into 1

let's say you want to compress 45

random numbers are also 2 digit and at that moment number is 56

each random number could have it's own complex mathematical formula

but let's keep it simple and say we just divide, we calculate

56/45=1.24444444444

let's say we are writing down 3rd digit after decimal point so 4

we could as well calculate 56-45=11 and write down numerical value 2 or something else, and infinity of other formulas

so on decoder side, it sees answer is 4, random number 56, it knows which operation has been performed for that random number...

so it calculates or looks in the table of precalculated values

if 45 is the only of 100 numbers that has 4 at that decimal point for that operation, then we got a score

what are the chances

let's see

56/99=0.56565656565
56/98=0.57142857142
56/97=0.57731958762
56/96=0.58333333333
56/95=0.58947368421
56/94=0.59574468085
56/93=0.60215053763
56/92=0.60869565217
56/91=0.61538461538
56/90=0.62222222222
56/89=0.62921348314
56/88=0.63636363636
56/87=0.64367816092
56/86=0.65116279069
56/85=0.65882352941
56/84=0.66666666666
56/83=0.67469879518 and ups another one, so no good

#### WhatIsIt

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #55 on: July 24, 2020, 07:40:20 PM »

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

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #56 on: July 24, 2020, 10:36:56 PM »
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

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #57 on: July 24, 2020, 11:47:08 PM »
It will come.

No secret is forewer.

#### WhatIsIt

• Hero Member
• Posts: 656
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #58 on: July 24, 2020, 11:51:16 PM »

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

• Hero Member
• Posts: 1149
##### Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #59 on: July 25, 2020, 12:01:21 AM »
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