July 2026 · paper-1-freeze-21-g7f29ce9
A deployed reasoning system’s output should not be an answer; it should be a decision.
A deployed reasoning system’s output should not be an answer; it should be a decision. We present a system that reads algebra-in-words into typed factor graphs, solves them exactly, and emits one of four decisions — certify, answer, flag, or abstain — through decision machinery that is entirely zero-parameter: no gradient flows through any component that produces a verdict. Behind a four-link chain of custody (input register, rendering invariance, lineage invariance, truth), the system certifies 912 of 1,500 held-out problems at measured 1.0000 precision — a zero-numerator bound, reported as such. The trained footprint is 8.0M parameters against a 506M-parameter frozen trunk slice; verification adds zero. On foreign benchmark prose the same channel initially certified garbage at 2% precision. We report this at full strength, because the zero-parameter recognition gate it forced now refuses 100% of that text: certification is distribution-bounded, and the bound is measured, gated, and published. A three-book hand-annotation campaign moved the reading frontier until its yield curve measurably saturated. Everything was built under registered predictions with mechanized verdicts across fourteen model generations; the complete ledger ships as supplementary material, and the paper closes with a falsifiable prediction about its own instrument’s aging.

Guided by Primes (Paper II — the abstraction ladder) and The Shadow of Intelligence (essay). This site is the canonical home; the byline is the byline.