News for hackers. Stuff that matters.
Re:The $5000 Compression Challenge by thomasahle on Saturday March 07, 2015 @09:46PM (#9164264)
AFAIK, information theory requires the _Expected_ size of a 'compressed' file be at least as large as the original.

So we could create an encoding that compressed N/50 of the strings with lg(N/50)=lg(N)-lg(50) bits. That would save us lg(50) > 5 bits with 2% chance. In this game we have 50 tries (5000$/100$) so we'd be pretty sure to win.

The correct price for this game is probably closer to 200$.

Re:The $5000 Compression Challenge by Dylan16807 on Saturday March 07, 2015 @10:04PM (#9164324)
The problem is that even the most trivial linux-compatible decompressor will add a few bytes, and there's almost no chance of saving that many bytes. But sure it wouldn't hurt to require it be 100+ bytes smaller.