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.
Amazon Warehouse Deals ! Now even more Deep Discounts ! Check out these great prices on slightly used or just opened once only items.I always buy my gadgets via these great Warehouse deals ! Highly recommended ! Many thanks for supporting OverUnity.com this way.

User Menu

Tesla Paper

Free Energy Book

Get paid

Donations

Please Donate for the Forum.
Many thanks.
Regards, Stefan.(Admin)

A-Ads

Powerbox

Smartbox

3D Solar

3D Solar Panels

DC2DC converter

Micro JouleThief

FireMatch

FireMatch

CCKnife

CCKnife

CCTool

CCTool

Magpi Magazine

Magpi Magazine Free Rasberry Pi Magazine

Battery Recondition

Battery Recondition

Arduino

Ultracaps

YT Subscribe

Gravity Machines

Tesla-Ebook

Magnet Secrets

Lindemann Video

Navigation

Products

Products

WaterMotor kit

Statistics

  • *Total Members: 83885
  • *Latest: geovat

  • *Total Posts: 522973
  • *Total Topics: 15572
  • *Online Today: 44
  • *Most Online: 103
(December 19, 2006, 11:27:19 PM)
  • *Users: 3
  • *Guests: 11
  • *Total: 14

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

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #30 on: July 21, 2020, 03:15:36 AM »
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
« Last Edit: July 21, 2020, 06:08:32 AM by nix85 »

Free Energy | searching for free energy and discussing free energy


Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #31 on: July 21, 2020, 06:06:36 AM »
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.

Offline WhatIsIt

  • Hero Member
  • *****
  • Posts: 643
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #32 on: July 22, 2020, 08:26:37 PM »
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.


Free Energy | searching for free energy and discussing free energy

Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #32 on: July 22, 2020, 08:26:37 PM »
Sponsored links:




Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #33 on: July 23, 2020, 12:26:40 AM »
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
« Last Edit: July 23, 2020, 06:02:56 AM by nix85 »

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #34 on: July 23, 2020, 05:31:51 AM »
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"#)=#=)")=#$/(&/(

Free Energy | searching for free energy and discussing free energy

Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #34 on: July 23, 2020, 05:31:51 AM »
Sponsored links:




Offline WhatIsIt

  • Hero Member
  • *****
  • Posts: 643
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #35 on: July 23, 2020, 07:02:52 AM »
Yes, I am trying to see.that analog connection Sloot talked about.

Because all this things we talked can be done in digital form without use of analog.

Maybe he found the way to read correctly very dense analog data.

In that time analog to digital conversion was not so advanced like today.

We have to consider that it was long time ago.

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #36 on: July 23, 2020, 07:21:24 AM »
but what would reading it correctly give him, nothing really

that analog signal must in some way contain a whole movie or whatever

and how are you gonna create a signal that contains a whole movie with 4 or 8kb code

lossless 1min of sound requires like few megbytes, not to mention a whole movie

i believe it can be done in digital and i dont see how he did it, if he did, in analog



Free Energy | searching for free energy and discussing free energy

Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #36 on: July 23, 2020, 07:21:24 AM »
Sponsored links:




Offline WhatIsIt

  • Hero Member
  • *****
  • Posts: 643
    • At The End It Will Matter!
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #37 on: July 23, 2020, 07:29:59 AM »
That analog part is really unclear.

Connection?

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #38 on: July 23, 2020, 08:03:04 AM »
there is this information entropy wall, there must be a way around it

Free Energy | searching for free energy and discussing free energy

Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #38 on: July 23, 2020, 08:03:04 AM »
3D Solar Panels

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #39 on: July 23, 2020, 08:44:55 AM »
...
« Last Edit: July 23, 2020, 11:08:00 AM by nix85 »

Offline lancaIV

  • elite_member
  • Hero Member
  • ******
  • Posts: 3789
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #40 on: July 23, 2020, 11:56:56 AM »
(S)cryptology
Icon/-ography

Codex
Key: en-/de-coder

Information
Writer
Reader
Storage
You are thinking in quantum computering ,similar our cerebral neuronal programing,in best/perfect case ! 8)

Patrick Flanagan " neurophone" !
Prof.Naoki Ikeda RFe204 grains : 1000x times faster than silicium transistors ,Tbit velocity

To holographic "Tesa-film/foil" like storage ,medium : "gel,glue-like"(haemoglobin)

Phillip Morris Prize :  compression system
Ex-G.D.R. : invention MP3 logic  structure

Opto-electric

Free Energy | searching for free energy and discussing free energy

Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #40 on: July 23, 2020, 11:56:56 AM »
3D Solar Panels

Offline nix85

  • Sr. Member
  • ****
  • Posts: 400
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #41 on: July 23, 2020, 12:06:23 PM »
more like quantum healing :)

Offline lancaIV

  • elite_member
  • Hero Member
  • ******
  • Posts: 3789
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #42 on: July 23, 2020, 12:11:12 PM »
For this I think for Bernhard Shaw a right quantum good old translucent  " glass h/w- uiskey" was enough to become healed ! ::)
One problem : "artificial information" can become "awaked" and get an "Eigen-life/demand"

                           Learning and growing (child to adult) "KIND" :artificial life

How much decision freedom and self-command degree the quantum operator get ?

What for me seems logical not for you/other has to be ,at first without basic knowledge and experience,logical !
What for you/other seems logical for me ,without your/others their  knowledge,experience and reazons ,has to be logical !
 
            No! Means No! ,The Quantum program demands : member from the anti-cybersex-#metoo-coalition  ;D

Offline triangle

  • Jr. Member
  • **
  • Posts: 55
Re: Let's crack Sloot algorithm - infinite "compression"
« Reply #43 on: July 23, 2020, 01:09:32 PM »
Jan Sloot was a intelligent man that wanted not more then leave there family a good inheritance, he succeeded as his materials are bought with the help of Abn Amro bank after he past away.

This all concept came in the 90ties after the memory card was introduced by Toshiba in the late 80ties.

That time we didnt knew better then that pc,s had big harddisks, but we didnt taught of the possibilities with the memory cards where you could actually save a movie from a low quality on.

In my opinion he copied the links to the saved files on his floppy disk with a command that directly loaded the movie, and hiding the memory card under the mainboard  when he demostrated and opened the computer indeed nobody could see or detect a big harddisk ( know that computers was quit new that time and we didnt know all the possibilities)

If you copy a hyperlink from a movie that is saved on your D: harddrive and you copy the link on your desktops C: to start the movie in D: drive you see that it contains several kb,s same as demonstrated by Jan Sloot.

I think he was smart enough to connect and replace the big hard drive for a memory card that could be hide anywhere between the boards, and therefor there is no algorithm to crop files in de way he demonstrated.

Just my opinion,!



 

OneLink