Jump-Table Boundary Sweep
Algorithms & DataThree colors draw the same machine trajectory on top of itself. Divergent dispatch would split the stroke and increment the disagreement counter.
Self-running — no controller input required.
Verify fidelity checks the recorded result against 0xC199.
Source jtedge.cjtedge.h in wbniv/llvm-mos-65816
What you see
Three colors draw the same machine trajectory on top of itself. Divergent dispatch would split the stroke and increment the disagreement counter.
What is checked
The compiler uses its small-table strategy through 128 destinations and its large-table strategy above that boundary. All three dispatchers must produce identical state sequences.
Compiler stress-test #152. The downloadable ROM and browser player use the same verified artifact.