SOURCE-LINKED INTELLIGENCE

Proof-Carrying Cognition: Closing the Verification Gap with Reality-Settled Reward

arXiv · AI, language, vision and robotics · article · Sep 9, 2026 · UTC

Frontier gains in language-model reasoning come from reinforcement learning on reasoning traces and are concentrated in domains with a cheap, sound verifier. We argue the field's binding constraint is the verification gap: no scalable, incorruptible reward for reasoning outside formal domains. We make four contributions. (1) Theory: in a joint-Gaussian model of best-of-N selection, verifier-gold correlation rho is the exact exchange rate between test-time compute and capability, and an unsound verifier pays a polynomial penalty N^(1/rho^2); a margin-free copula form predicts realized soundness

Read original source ↗ Open in workspace

recordType

paper

region

Global