A wave of plastic-free coffee pods and machines
Summary
The article is a deep dive into optimizing a word-ladder/anagram solver in Rust, tracing performance improvements from baseline to highly optimized implementations. It covers data structure choices (flat arrays, 64-bit Gödel-type identifiers, packed u128 representations) and compiler/runtime tricks (custom hash maps, ILP, vectorization) with measurable speedups.