In the comp.programming newsgroup animadversions were cast upon the claims of crackpots to be able to compress random files. This is what Guy Macon had to say about the possibility. -RH

All it would take is one working program to prove the ability to compress any/most random data.

(I say any/most because existing compression schemes can compress *some* random data. This is a direct consequence of the fact that if a random number has a zero probability of coming up all zeros, it isn’t random.)

It turns out that I have such a program, and it achieves well over 99% compression on all data, including random. Several independent witnesses have seen and verified that the compression works as I claim it does.

I still have one tiny little bug in the decompression routine. For some reason it always outputs a series of ones. I will, no doubt, have that final bug fixed in a matter of a few days.

I have a strong motivation to find that last little bug; I used my compression code on all of my important data and deleted the uncompressed versions. If anyone else wishes to do the same, I will be glad to send them a copy of the compression code, with decompression code to, no doubt, follow shortly as soon as it is debugged.

BTW, this code is based on my earlier work on an algorithm that stops 100% of all Spam with perfect accuracy. That one also has a minor bug that stops all other email, but again, as soon as I fix that One Last Bug it should be good to go.

I hope this helps.

Guy went on to write:

Did I tell you about my spellchecker that correctly flags all spelling errors without ever missing one? As soon as I fix one minor bug (for some odd reason it flags *every* word as a spelling error) I can release the code. How hard can it be to fix a tiny little bug like that?

Speaking of spellcheckers, did you know that the word “Gullible” is not found in any English dictionary or online spellchecker?