Scanner benchmarks are easy to make fast by changing the work. I use a reproducible matrix for construction, chunks, matches, prefilters, cache state, and result validation.
Pattern count alone cannot predict fast string search. I show how rare bytes, short literals, prefixes, alphabet size, and candidate density shape SIMD-assisted Rust performance.