VERITAS routes syntax errors, type mismatches, and partial goal states back into proof search via Best-of-N + critic-guided MCTS, replacing binary pass/fail collapse with iterative negative-example conditioning.
June 23, 2026
Summary
Formal verification tooling wastes verifier output by treating it as pass/fail; recovering this signal cuts through lemma-name guessing and exposes when unguided sampling fails, directly improving theorem-solving rates on hard combinatorics problems.
Why it matters
Formal verification tooling wastes verifier output by treating it as pass/fail; recovering this signal cuts through lemma-name guessing and exposes when unguided sampling fails, directly improving theorem-solving rates on hard combinatorics problems.
Implementation verdict
Replaces naive Best-of-N sampling with two-phase protocol (Phase 1: Best-of-N, Phase 2: MCTS + critic on Phase 1 failures). Requires verifier integration and MCTS implementation; artifacts on GitHub. Worth testing now if you build formal proof assistants or LLM-guided verification, but maturity limited to miniF2F and a new 55-theorem benchmark.
Sources
Dev Signal
Get briefs like this in your inbox — free, 3x a week.
100+ sources compressed into one 4-minute read. Ranked, cited, implementation-ready.