How Unix Spell Ran in 64kB RAM - by Abhinav Upadhyay
blog.codingconfessions.com/p/how-unix-spell-ran-in-64kb-ram
What Jamie wrote
Wow, I had no idea there was this kind of wizardry in the early versions of spell!
Using Golomb's code, a compression scheme designed for geometric distributions, he achieved 13.60 bits per word—remarkably close to the theoretical minimum of 13.57 bits.
Very cool!