OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Page 1 of 1

9 Replies - 2103 Views - Last Post: 24 July 2014 - 01:41 PMRate Topic: //<![CDATA[ rating = new ipb.rating( 'topic_rate_', { url: 'http://www.dreamincode.net/forums/index.php?app=forums&module=ajax&section=topics&do=rateTopic&t=325439&amp;s=7da3a10ab913e0bb78fc4b1285923ea2&md5check=' + ipb.vars['secure_hash'], cur_rating: 0, rated: 0, allow_rate: 0, multi_rate: 1, show_rate_text: true } ); //]]>

#1 Secretmapper

Reputation: 0
• Posts: 43
• Joined: 20-July 12

OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 23 July 2013 - 04:16 AM

Hello guys. I'm not really sure if this is the right board to be posting this, but I just had a good laugh with this one and I wanted to share it with you.

Quote

So I have been reading up on various compression algorithms lately. I have a very large amount of data and I was trying to figure out a way to take my 15 TB of media (currently on a RAID array) and compress it down to a portable size to be decompressed at a later time (when I have more storage hardware)
I came across hashing algorithms.
I read the specifications for MD5 and SHA-1-160 and SHA-2-384 (and 512) and I believe I understand them perfectly as I am a very intelligent person.
My question.. is.. or rather my idea which I feel is fairly new and possibly quite groundbreaking.. is to utilize these hashing algorithms as a compression method.
If I take my 15 TB of media and compute the hash, it will effectively be reduced to 128 bits (in the case of MD5).
A byte is 8 bits. A byte is generally the storage space for one regular character.
Since there are 128 bits in the digest of MD5, then there would be:
(# of bits in the digest) [Divided By] (# of bits in a byte) = #bytes in the digest.
Google Search Function's Division Function Utilization
We have 16 bytes. A byte, as I said, is a character, so we are effectively left with a digest that is indeed 16 characters.
I don't know about you. And I honestly don't because I can't know about everyone who reads this. But for me, the memorization of 16 characters is not an intractable problem.
Quite the contrary. It is certainly doable.
Upon memorization of these 16 characters I will effectively have in my head a portable form of my 15 TB of media.
I understand, that *in theory* it's possible to have two inputs result in the same hash.
In fact!
This is generally referred to as
A collision!
However my friends. This is extremely unlikely.
Considering a roughly uniform distribution of hash digests, we must inevitably be led to the conclusion.. that there is a roughly 1 in 2^128 chance of two inputs resulting in the same hash.
This means that it would take longer than the lifetime of the universe (in some universe-death-theory scenarios) to create an instance of said collision.
Effectively, I believe I have solved a serious compression problem.
I invite positive feedback Constructive praise welcome

I literally couldn't stop laughing after reading that, and the worst part is the OP is still arguing to death that he is right and everyone who is saying otherwise cannot stand to the awesomeness of his genius.

Is This A Good Question/Topic? 0

Replies To: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

#2 modi123_1

• Suitor #2

Reputation: 8937
• Posts: 33,473
• Joined: 12-June 08

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 23 July 2013 - 10:47 AM

I assume you mean this thread over at newgrounds?

http://www.newground...s/topic/1345423

#3 jon.kiparsky

• Pancakes!

Reputation: 7564
• Posts: 12,696
• Joined: 19-March 11

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 23 July 2013 - 11:23 AM

"Constructive praise welcome".

'nuff said.

#4 EllenS

Reputation: 0
• Posts: 5
• Joined: 24-July 13

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 29 July 2013 - 12:09 PM

hahaha I love the comment "My intellect is nothing compared to yours, so I am happy to concede any point made."

#5 no2pencil

• Toubabo Koomi

Reputation: 5182
• Posts: 26,880
• Joined: 10-May 07

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 29 July 2013 - 01:03 PM

[quote name='Secretmapper' date='23 July 2013 - 07:16 AM' timestamp='1374578171' post='1878430']

Quote

I have a very large amount of data and I was trying to figure out a way to take my 15 TB of media...

& I stopped reading at that.

I immediately thinking that the developer wants ...

+

#6 creativecoding

• Hash != Encryption

Reputation: 926
• Posts: 3,204
• Joined: 19-January 10

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 30 July 2013 - 05:23 PM

and to think my member title would fix these kinds of issues...

This post has been edited by creativecoding: 30 July 2013 - 05:25 PM

#7 Lieoften

Reputation: 17
• Posts: 244
• Joined: 06-January 10

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 22 September 2013 - 03:30 PM

This is possible the funniest thing i've ever read; so much of this is wrong, I can't even begin to think what this person is smoking.

#8 Cenron

Reputation: 6
• Posts: 13
• Joined: 23-May 12

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 17 July 2014 - 07:21 PM

Oh man! this is hilarious. But obviously a troll.

#9 no2pencil

• Toubabo Koomi

Reputation: 5182
• Posts: 26,880
• Joined: 10-May 07

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 17 July 2014 - 08:32 PM

Cenron, on 17 July 2014 - 10:21 PM, said:

But obviously a troll.

Says the guy digging up a year old topic...

#10 Cenron

Reputation: 6
• Posts: 13
• Joined: 23-May 12

Re: OHMIGOD I JUST FIXED A VERY SERIOUS COMPRESSION PROBLEM!

Posted 24 July 2014 - 01:41 PM

no2pencil, on 17 July 2014 - 08:32 PM, said:

Cenron, on 17 July 2014 - 10:21 PM, said:

But obviously a troll.

Says the guy digging up a year old topic...

Ha didn't realize that lol. I guess this forum doesn't get a whole lot of posts cause it was still near the top.