LIT Fibonacci numbers used here: 1, 2, 3, 5, 8, 13, 21, 34 (the second 1 is left out, so 1 is not doubled). The page enumerates every subset with no two neighbours. Each integer from 1 through 40 appears exactly once.
AMBER Zeckendorf's theorem says this for every positive integer, not only through 40. Edouard Zeckendorf published it in 1972; the finite census on this page is the part marked LIT.
MODEL The bars are those Fibonacci lengths. Lit bars are the greedy sum for the integer currently on the pedestal. Neighbours never light together.
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.
← Pick's Lattice · Twelve Laws · The Remainder Bell → · 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): 99318c830d049f2d1de8a4a0bcacb8ee865c7c426a43106e1006d6ba74102d4b