Live data from Hacker News

The $5000 Compression Challenge (2001)

patrickcraig.co.uk

191–192 of 192 posts

Re: The $5000 Compression Challenge (2001)

#191

Earlier quoted context omitted.

If they're trying to dissuade "universal compressors" then Mike needed to ask for the algorithm first, and then generate his file. If you tell me "I bet you can't compress this file!" then I can do whatever I want to write some stupid one-off compressor to shave a byte off and take your money.

It's a limited risk. Even if the file is compressible by one byte, it's very unlikely you can figure out how to get a decompressor functioning without plenty of bytes of overhead. And even if that problem disappears, he'd still win 99.6% of the time. And you can get rid of that risk by requiring 100 bytes of shrink. Just measure the size right.

As someone else said, if the reward was a million dollars then this becomes a game theory problem.

If you have $100 in disposable income it might be worth the lark if the officiant is uncareful with their chosen text. Though odds are good he pulled it from random.org. That’s where we used to send people.

Re: The $5000 Compression Challenge (2001)

#192
post #180

Earlier quoted context omitted.

Okay, well I can respect that interpretation enough. I don't quite see it that way but I don't think I'm going to convince you. Specifically I don't think it rises to the level of violating rules on filenames. That's why I think the distinction can matter.

The rules should bar contestents from saving entropy outside the payload of the file. Whether that's in a file name or some file system data structure or in some timing side channel is insubstantial. And once you ban that , it's impossible from an information theoretic point to win the challenge.

[deleted]
Post reply on HN