LIT Search every integer from 0 up to but not including 105. Exactly one of them, 23, leaves remainder 2 on division by 3, remainder 3 on division by 5, and remainder 2 on division by 7. The map x → (x mod 3, x mod 5, x mod 7) hits 105 different triples on that range, so the three moduli separate them.
AMBER The Chinese remainder theorem is classical (Sunzi's problem is the usual ancestor). The page does not prove the general theorem. It checks this coprime triple, 3, 5 and 7, by exhaustion.
MODEL Three rings hold 3, 5 and 7 lamps. A counter walks 0…104. When it reaches 23 the three chosen lamps are the ones the riddle names, and the bell flares.
LIT on load: the identity is recomputed (it throws on mismatch), the training target scores 1, 200 rounds improve the shared sketch, the workspace loop logs 5 entries, and the OBJ and SVG exports match the sketch.
Gallery of kept sketches:
Live workspace log:
localStorage key mayhem-twelve-laws-board. Each page writes its best shared reward.
← Zeckendorf's Ladder · Twelve Laws · Vis-Viva → · ERIS
Background wash: AMBER MODEL a field seeded from this page's seal. The viewport is a deep colour, not black, over a vivid page.
proving…
Seal sha256(name|slug|blurb): 0fce8dbd67295ddf676fc1a77bf09257e4fd8782b8f2d91013c71d6c577c9543