Context
Even moduli admit a smaller access-optimal presentation than the uniform 2m-state construction.
Hypotheses and scope
- The modulus m is even and at least two.
Proof or evidence
The controller tracks terminal position on an m-cycle when the combined terminal-descent/height parity is odd, and uses two hopeless parity states otherwise. Exact invariants prove the trace, and balanced-distance bounds give cost 2(m-1) for even m at least four, with cost four at m=2.
Verification notes
The construction was reverse-engineered independently from the modulus-four witness and checked by exact balanced-product equivalence and entry distances.
Limitations
- The construction is a state upper bound, not a general minimum-state theorem.
- The proposed even/odd minimum-state law remains open.
Notes
This is a constructive state upper bound, not a general state-minimality result. The proposed even/odd minimum-state law remains open.