Published onOctober 5, 2026ReferenceWhy a One-Lookup-Per-Byte Loop Can Still Be Latency-BoundA DFA inner loop looks tiny, yet every next transition depends on the previous one. I explain dependency chains, cache locality, and why fewer instructions need not mean huge speedups.