Meta and NYU's Minimal h1 Loop Matches Hand-Crafted Theorem Proving and Sets PutnamBench Record

A Meta and NYU paper introduces h1, a minimal agent loop that matches hand-crafted automated theorem proving workflows and sets a new record on PutnamBench, illustrating the bitter lesson that simple scaling beats elaborate engineering.

2026-11-02 ~ 2026-11-02 · 2 related posts

• Meta and NYU paper: simple agentic loop h1 matches hand-built theorem-proving workflows — rohanpaul_ai · 2026-11-02
• h1 paper: minimal Lean loop hits SOTA on PutnamBench and solves 8 open conjectures — rohanpaul_ai · 2026-11-02