Four instructions, your four words: DIRECT (set up the claim), PIECE (recompute the
answer from raw data, piece by piece), TEST (compare your recomputation to the claim), AUDIT (emit one
bit — PASS or REFUSE). The machine never trusts the claim. It rebuilds the answer itself and checks. That's
the witness function, in silicon.
Why it's real and "photonic proc" wasn't: the photonic core had the physics in the
title and sin(t) in the math. Here the auditing is in the
mechanism — recompute, compare, emit bit — so it survives the dig-test. Ask "how does it audit?" and the
answer is in the opcodes, not the chrome. That's why this one looks like a debugger, not a glowing core.
RAW DATA being checked: [3, 1, 4, 1, 5, 9, 2, 6] — the machine recomputes the sum and audits the claim against it.
CLAIM: sum =
Program / Disassembly
Machine State
0
ACC — recomputed so far
R1 (claim)—
DIFF (acc − claim)—
PC0
VERDICT: —
Ready. Step through, or RUN. Watch ACC build up via PIECE, then TEST and AUDIT fire the bit.
The point of the whole night, executable: a claim ("the sum is 31") means nothing until an
independent process recomputes it and compares. PASS isn't "it said so" — it's "I rebuilt it from raw data and it
matched." Change the claim to a lie and AUDIT fires REFUSE, every time, because the recomputation doesn't bend to the
claim. The machine can't be talked out of the truth, because it never asked the claim — it asked the data.