New answers tagged compression
A cryptographic hash function will produce an output with pseudorandom properties, therefore when expressed in hexadecimal, a list of hash values will have an almost equal number of each character. Pseudorandom data will not compress, as compression looks for patterns. If you had duplicates, compression could reduce the data size. If you want to compress ...
There is some discussion here and a paper from 1996 here. I had looked at this cursorily years ago, it is not so easy. And a google search brings up some other papers. The discussion may be the way to start.
Top 50 recent answers are included