1 input (Wikipedia / Commons) → 3 independent observers (majority of 3 must agree) → 1 hash-chained log
cycle 0
① input — the public source
— press pulse to pull a random record —
observer A
idle
observer B
idle
observer C
idle
② consensus — majority of 3 must agree
— idle —
③ output — the append-only log (newest first)
Live: one record is fetched from Wikipedia OR Wikimedia Commons (origin=*, free-licensed, attributed above), then read independently by 3 observers. A majority (2 of 3) must agree on the digest before prim = SHA-256(agreed ‖ previous prim) is signed and chained — so one faulty observer is outvoted, and two in disagreement reject the cycle. Toggle fault to corrupt an observer and watch the quorum hold (or break). ⊻ verify re-walks the whole chain. Deterministic; no AI.