Timeline for Huffman encoding of hashes
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25, 2019 at 12:01 | comment | added | Paul Uszak | Actually, any decent compression algorithm will compress hexadecimal MD5s perfectly. By perfectly I mean to ~the theoretical entropy of the file. You'll get a 50% reduction due to byte occupancy. So you don't really need to do anything manually as per your last para., other than gzip it. | |
| May 23, 2015 at 10:41 | vote | accept | user3231622 | ||
| May 23, 2015 at 10:39 | vote | accept | user3231622 | ||
| May 23, 2015 at 10:41 | |||||
| May 23, 2015 at 10:24 | comment | added | user991 | How about a base-256 encoding? $\:$ (aka, not encoded at all) $\;\;\;\;$ | |
| May 23, 2015 at 10:22 | comment | added | Richie Frame | @RickyDemer I have a Base128 encoder I wrote years ago that can get it down to 19! | |
| May 23, 2015 at 10:19 | comment | added | user991 | They can be encoded with just 20 characters. $\;$ | |
| May 23, 2015 at 10:14 | history | answered | Richie Frame | CC BY-SA 3.0 |