A Tree Made of Types
A word lookup the compiler builds letter by letter, and why it lost the race.
A dictionary does not make you read every word to find one; you follow the letters. The thirty-second familiar builds that path out of the compiler's own type system, one letter at a time, so a fixed word list becomes a tree that exists only while the program compiles. It is exact, simple, and slower than a perfect hash, and the numbers say by how much.