News for hackers. Stuff that matters.
Re:The $5000 Compression Challenge by piannucci on Saturday March 07, 2015 @10:06PM (#9164332)
Sorry, but no. There are far more files with a given hash than just the one, if the file is longer than the hash. And having multiple hashes doesn't help until the hashes exceed the length of the file.
Re:The $5000 Compression Challenge by compbio on Saturday March 07, 2015 @11:28PM (#9164533)
Chances of getting a collision is higher than getting a good solution, but having multiple hashes does help in increasing the chance at a good solution. With a hash 1 bit less than the length of the file, we put two pigeons inside one hole, and have a 50% chance at picking the right pigeon. The fewer/smaller hashes, the more we get "sorry, but no".
Re:The $5000 Compression Challenge by Someone on Sunday March 08, 2015 @05:33AM (#9165130)
It's easier to just drop the final F bits from the N-bit input stream and, at decompression time, guess what they are than to go through this exercise of generating hashes that have N-F bits in total and hunt for bit streams having those hashes.
Re:The $5000 Compression Challenge by m_mueller on Sunday March 08, 2015 @04:55AM (#9165050)
Also, I guess the hash algorithm could be specifically tested to work for this particular solution, couldn't it (although only after having spent the $100 of course)?. The problem I guess is to have a script that takes up less space than for the hash to still work without a collision for the particular data. Even with the smallest possible program or script, this probably isn't going to work then.