Compress 7G to 1K with epic vaporware
cyborg.co
cyborg.co
I'm assuming the known primes would be in a database somewhere, and you could just use the indices, instead of some 512-digit number.
The process could be repeatable if 'a' was too big, theoretically enabling some extreme compression.
You'd need a way to handle extremely large ints, and in the few minutes I thought about it, you'd need at least twice the original file size available for compression/decompression.
I'm also pretty sure my idea is full of shit, but there are more details than in the article.
One formulation is 2(11)+3. The primes up to 25 are 2,3,5,7,11,13,17,19,23, so we'll use the index 4 to represent the prime number 11.
To lay this out, we need to represent three numbers: 2, 4, and 3. Without the inevitable markings you'd need to delineate when numbers started and stopped, the bit string would look like 10 100 11.
Using 11 as the prime, your compression would require laying out 1010011 to represent 11001, which means it's actually anti-compression.
With really, really huge (like the aforementioned 7GB) numbers, you might see something better, sort of how there's a point with most compression methods that the header is bigger than the data being compressed.
Kinda doubting it now, though.
This times out quickly if you use too big of a number, but you can play around with integers here: http://codepad.org/4mnHI9E3
Based on what I see, it compresses poorly at the beginning and then reaches parity. At 1,000,000 (tested on my machine, not Codepad since it times out), you get one bit of profit, but 1,000,005 is at parity, suggesting that it's not very stable.
Also, this is assuming that the decompressor can make sense of the absolute smallest representation you could lay out these numbers with, which is basically not going to happen. That additional padding would destroy any potential savings you got.
The current largest prime is (2^57885161)-1, which is 17,425,170 digits, yet can be represented with much less, obviously.
Maybe adding exponents would help. aX^n + b, perhaps?
Spectrocable, his first invention to be launched and brought to market, is a new optical fiber system that uses 16 million different colors to increase data transfer speeds significantly, compared to technologies on the market today. With Spectrocable, data transfer will be instantaneous which will revolutionize the way we use the internet and share information. For example, the entire 40TB of the Library of Congress could be downloaded in less than half a second. At Techweek Los Angeles, Dupont will be demoing this technology and revealing how it works for the first time with a working prototype.
http://www.prnewswire.com/news-releases/14-year-old-inventor...
So... he solved the issue of going past the speed of light?
I think the DOD just found their MVP for the next 10 000 years for he shall sit upon a golden throne and rule mankind with that kind of intellect.
I have read about an indian student 4y ago who invented a geometrical compression algorithm that could save about 80GB onto an image, the size of an A4 document. Never heard back from him
It does work, he just slightly overestimated the maximum density :) There is an open-source implementation (http://ollydbg.de/Paperbak/) that stores ~3mb per page.
How it looks: http://www.youtube.com/watch?v=U4R18PYJaIM
Perhaps he found a way to encode data in neutrons ala Diaspora?
I love scifi and its crazy ideas.
Edit: I've once thought of a system which would allow virtually unlimited compression, the only drawback is that it would take an insane amount of time to execute.
Imagine a chess board, a 8x8 grid of alternating black and white tiles. Now you write an algorithm that performs permutations, 2 by 2, 4 by 4, etc, in a predefined order.
If you do enough permutations, at some point you're going to have all the white tiles on one side of the board, and the black ones on the other side.
You can now store your board as its size, 2 expressions representing the 2 halfs, and the number of permutations you need to reach the original state.
Looking forward to additional info on this joke/hoax!
[1] http://en.wikipedia.org/wiki/Shannon's_source_coding_theorem
They claim it's patented. Can someone find the patents?
By the way the most unrealistic promise is compression of congress library, because the data is determined.
If kind of video or audio data is not determined (it may be year of black screen or zooming in-out mandelbrot) limitless compression rates is possible.
Given the ground breaking nature of this "technology" you'd expect a "best in show award"
Also as you know radio wave is an electromagnetic wave, and therefor it travels at the speed of light. The refraction is higher in glass then air ...
no
>limitless data compression,
no
>and truly unbreakable encryption
no
Fun read though.
No comment