Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Virtually Infinite Compression

Name: Anonymous 2014-01-04 3:16

http://www.cyborg.co/shadow/

Shadow, the driving engine of Spectrocable and Stealth Wireless, is the world’s most advanced compression system. By using a probability basis of the chance that the binary code will be aligned in a certain way, Shadow is able to compress a 7 gigabyte Full HD movie into a mere kilobyte, without losing one bit of quality. This great innovation turned out to be the work of the most advanced compression algorithm ever made.
Shadow is able to compress the entire Library of Congress into your flash drive, and the compression is real time. Thanks to its advanced proprietary systems, Shadow can be used over and over, allowing for virtually infinite compression. With great compression ratio, Shadow allows for the shrinking of any file without any loss of quality whatsoever.

Name: Anonymous 2014-01-04 9:02

Check the other thread and my 2 faggot.

Name: Anonymous 2014-01-04 17:07

Sounds fake.

Name: Anonymous 2014-01-04 19:47

Bullshit.

Name: Anonymous 2014-01-05 0:24

>>4
>le pedophile sage

Name: Anonymous 2014-01-05 18:02

>le pedophile sage

Name: Anonymous 2014-01-06 10:00

looks like fake chinese site 馬鹿外人

Name: Anonymous 2014-01-06 10:59

Name: Anonymous 2014-01-06 12:53

>>7
Fuck off, weeaboo.

Name: Anonymous 2014-01-06 14:42

>>9
Fuck off, outsider

Name: Anonymous 2014-02-08 8:16

check 'em

Name: Anonymous 2014-02-08 21:01

there always was going to be problems doing a 7gig file in realtime... is that usb3 speed or?
that would be um, ~7000 mB @ 400mB/sec, so 20 seconds?

Name: Anonymous 2014-02-08 21:11

Any compression algorithm that takes as input a string of bits and returns a string of bits can be re-applied infinite times? =)

Name: Anonymous 2014-02-08 22:20

>>13
it can
the result though...

Name: Anonymous 2014-02-09 4:50

can be worse than not compressing at all ^^

you need an algorithm that outputs optimal inputs (and still compresses)?

Name: Anonymous 2014-02-09 6:07

and/or is optimized for random input =)

i wonder how good it is relying on the birthday paradox...
"in a group of 23 people there are 23*22 / 2 = 253 pairs.."

23 bytes? (not counting any overlap ?! ) ^^ for an 8 bit pair?
=D 6.5 bytes with two-bit steps? (8 + 2*22 bits / 4x overlap) @ 50% and 64.75 bytes for 100%

50% for a 10 bit pair @ 13.5 bytes ? // 100% @ 257 bytes.. (10+2*1023 bits)

100% 16 bit pair at ~16K // 50% 32 bit pair at ~16K?

100% 64 bit pair at 1073741831.75 bytes =o (1GB + 62 bits )
50% 128 bit pair
25% 256 bit pair?

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List