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

User Menu

Custom Search

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

triangle

  • Jr. Member
  • **
  • Posts: 55
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #105 on: July 27, 2020, 12:35:38 AM »
OK,

I have a home
I have my PC
I worked for 3 years on paper, my PC...

For last week I am on the road.
I dont have my PC in my car
I did not carry laptop this time.

For a week more until I get back home,
I have phone, paper and pencil.

Are you still lost.
Maybe you just have to switch to another account and feel better, triangle.

With all respect, thank you for explaining, 1 thing you didnt explained thats your age, if you are 15 you then born in 2005, how it is possible to work on the algorithm in 2003?

I didnt asked if you have a car, house or pc, you get sloppy, small mistakes!

WhatIsIt

  • Hero Member
  • *****
  • Posts: 651
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #106 on: July 27, 2020, 12:41:33 AM »
I have more than 15.

I wrote that already in this topic.


triangle

  • Jr. Member
  • **
  • Posts: 55
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #107 on: July 27, 2020, 12:51:03 AM »
I have more than 15.
I wrote that already in this topic.

Sorry I didnt read that you was 16, my sincer apology.

If you cracked the code then I believe you had read about Han van Meegeren, same thing just other product, probably that inspired you and learned from it in how you could decode Jan Sloot algorithm!

Once again apology for saying you was 15, indeed you need to be 16 to use a car. My bad.

WhatIsIt

  • Hero Member
  • *****
  • Posts: 651
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #108 on: July 27, 2020, 12:59:32 AM »
No problem at all.

And thanks for wishing me 16 again.
Very nice from you.

Yea, I probably stole it from someone else.
I did not worked for it at all in that 3 years, and over the years.
You think that things are comming just like that,
by itself?

I am not clear what you want, you already have your FE device.
You want more?
How much more?



WhatIsIt

  • Hero Member
  • *****
  • Posts: 651
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #109 on: July 27, 2020, 01:02:27 AM »
And you have few accounts here.

What more do you want?

triangle

  • Jr. Member
  • **
  • Posts: 55
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #110 on: July 27, 2020, 01:10:14 AM »
No problem at all.

And thanks for wishing me 16 again.
Very nice from you.

Yea, I probably stole it from someone else.
I did not worked for it at all in that 3 years, and over the years.
You think that things are comming just like that,
by itself?

I am not clear what you want, you already have your FE device.
You want more?
How much more?

Nope, im not interested in this as it doesnt exist and cant be achieved.

triangle

  • Jr. Member
  • **
  • Posts: 55
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #111 on: July 27, 2020, 01:10:43 AM »
And you have few accounts here.

What more do you want?

This is all you got? Cant do better?

nix85

  • Hero Member
  • *****
  • Posts: 1431
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #112 on: July 27, 2020, 01:13:13 AM »
let's play along

you don't have to reveal your big "secret"

let's see input and output string

let's have some fun

WhatIsIt

  • Hero Member
  • *****
  • Posts: 651
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #113 on: July 27, 2020, 01:22:19 AM »
I was wrong.

It does not work.

It is impossible to do such a thing.

WhatIsIt


nix85

  • Hero Member
  • *****
  • Posts: 1431
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #114 on: July 27, 2020, 01:31:40 AM »
from simple to impossible in few posts, eh

it indeed is impossible in a way sloot and adams claimed, cause if it were true you should be able to encode next movie(s) in ending credits of the first and so on recursively to infinity

WhatIsIt

  • Hero Member
  • *****
  • Posts: 651
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #115 on: July 27, 2020, 01:36:38 AM »
I was wrong,

I see my mistake now.

nix85

  • Hero Member
  • *****
  • Posts: 1431
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #116 on: July 27, 2020, 01:59:48 AM »
dutch comment from the long version of tv report on sloot

https://www.youtube.com/watch?v=4V-qrQd87xY

i google translated it, guy claims he used to tell people to buy a new tv and then repair and sell their old tv, well, kinda common practice, that alone doesn't dismiss him as much as recursion argument

not sure what he means by death ad, is this a translation error or he implies sloot faked his death

"funny. Jan Sloot was known early on that if you offered a TV for repair, he would tell you to buy a new one because repair was too expensive. Then you bought a new TV and Jantje repaired your old TV and sold it for a lot of money. My brother-in-law was working for him at the time and I can still remember Jan Sloot calling my brother-in-law when that death ad was in the newspaper. I think Jan Sloot could think outside the box and was perfectly able to make you believe that something was possible."

nix85

  • Hero Member
  • *****
  • Posts: 1431
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #117 on: February 14, 2022, 06:39:31 PM »
Today i somehow got reminded of Sloot and been thinking about it again. I regurgitated many of the old ideas and had some new ones.

As for my idea from the first page, i knew from the moment i came up with it it is a good idea potentially great, but i instantly saw it has serious drawbacks and it turned out it has serious drawbacks as already noted back there, first drawback is it needs a spacer so decoder can tell between different iterations but that is just one ASCII symbol 8 bits worth, for example █, that is not such a big issue altho it complicates things for multistage compression a bit. Second drawback is simply the small likelihood of sequences longer than 4 digits corresponding to sequences to be encoded appearing among the random sequences. That's a bigger issue which means many iterations would have to be done to encode even just first 100 numbers which means not so efficient in the end.

It comes down to how to make the coordinates shorter than the data efficiently and that it allows for multistage compression. I already mentioned this back then, with enough computing power random stream could be found which most matches the original stream.

But i don't think this is how Sloot did it (if he did it), he stressed the term analog and said age of digital is over.



ne0

  • Newbie
  • *
  • Posts: 33
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #118 on: September 28, 2022, 07:47:21 PM »
Possible breakthrough happened during my conversation with some denier on youtube, IDEA came to me.

Quoting myself....

So if we have the same unique random number stream "playing" simultaneously with numbers to be sent, say software generates ones when random number matches the data number and zeros when it does not.

So we get 1110001100101100000101000010001000010000100010000100001001001000000100000

Notice the possible advantage here of representing a 4 bit number with a single bit, of course there would be many mismatchess too but gain is possible.

Before this is done, software should look into the database of random number streams and pick those with highest number of matches. Etc.

Since we end up with a nice pure stream of zeros and ones, of course generated streams should be converted into numbers 0-9 and further compressed in same manner which is a BIG advantage. Possibility of multiple iterations is essential to 'infinite' compression.

It's all about smartly picking data from the "random" stream and doing it many times.

Etc.... use your INTELLIGENCE. We are not trying to break the information entropy, we are finding an elegant way to work with it in a wider context.

...end of quote.

Essential part is obviously having a large enough pool of random streams to find streams with high match %.

I encourage everyone to take the idea and develop it further. I am asking for no credit or royalties. I am too focused on other things and got no time for it. This goes especially to all you young ones reading who have a spark for this.

"The numbers from 0 to 10 are thus in binary 0, 1, 10, 11, 100, 101, 110, 111, 1000, 1001, and 1010"