THE CLAIM CARD — DAUB BY VISITING
Thirty claims. Each square names one and states where it is demonstrated live — not asserted. Click a square to jump straight to the proving demo; it daubs when you go. The card is the whole argument at a glance: so inherent it's almost arbitrary — and every square is a working button.
RULES: CLICK → JUMP → THE DEMO RUNS → THE SQUARE DAUBS. LINES DON'T WIN; ONLY THE FULL HOUSE DOES.
THE SPINE — IF YOU READ NOTHING ELSE
Three commitments, none refusable: things have names, syntax is text, substitution terminates. Everything on this card is those three held at their fixed point — templates stored in the relation they render, the machine pointed at its own catalog, nothing arriving inert.
Row 1 lays the foundations. Row 2 opens every catalog family — what exists, behaves, runs, happened, connects. Row 3 runs generation and unification. Row 4 drives the universal emitter. Row 5 closes composition: read-in → callable → nested → assembled from rows → all of it 1999-possible. Row 6 goes back further still: the CPC 6128 — POKE as the primal row, the display as an address, the clock singing, one waveform under two decoders, and an operating-system dictionary copied number-for-number. The pattern was in the silicon before it was in any schema.