One slot. Four states.
fold(n) = (n + H) mod 4, H = 2^N mod 4.
Sixteen remainders, four states 0/1/3/3. The script recomputes every
remainder from the rule; it does not read them from a texture.
LIT
This page recomputes all 16 remainders with the rule
fold(n) = (n + 2^N) mod 4 starting from 0; the 4th fold
lands on 3 and stays (fixed point), not on 0. The ring is closed as a
verification of the arithmetic, not as a return to the start.
AMBER
The model of "one slot, four folds" is a symbolic framing. The arithmetic is checked here; the slot itself is not measured.
proving…
Seal sha256(name|slug|blurb):