Spent tonight building a little Huffman compressor in Rust. The idea’s old and simple: count how often each byte shows up in a file, build a binary tree where the common bytes sit near the top, and give them the shortest bit-codes. More skewed the data, better it squeezes.