#verifier

2 articles

01 ·Large Language Models·★ MEMBER·PAPER·9 min read Paper Explained: Beyond Solver Verdicts — When the Solver Says Yes but the Translation Is Wrong An LLM translates a problem into logic and Z3 solves it. This paper names the failure where the solver's verdict is right but the translation is wrong (VPU), and distills Z3's equivalence check into a Yes/No next-token verifier called GenV. Explained from zero. 02 ·Large Language Models·FREE·PAPER·13 min read Test-Time Scaling — How Models Get Better by Thinking Longer The same model scores higher when you let it think longer. This article builds the idea from scratch: chain-of-thought as purchased compute steps, self-consistency by majority vote, verifiers that pick the winner, and o1-style models that learned the thinking itself — and what it means for compute to shift from training to inference.