A new paper introduces 'h1', a simple harness designed to test if scaling test-time compute can match human-designed workflows in formal theorem proving. The harness interfaces with the Lean 4 programming language and uses verifier feedback and self-reflection. Results show h1 achieves state-of-the-art performance on benchmarks like PutnamBench and FormalConjectures100-Solved, even matching or surpassing specialized workflows like Goedel-Architect and AlphaProof Nexus. AI
IMPACT Suggests that scaling compute with simple agentic loops can rival complex, human-designed workflows in formal mathematics.
RANK_REASON The cluster describes a research paper detailing a new method for automated theorem proving. [lever_c_demoted from research: ic=1 ai=1.0]
- AlphaProof Nexus
- AxProverBase
- Claude Code
- FATE-X
- FormalConjectures
- FormalConjectures100-Solved
- Goedel-Architect
- Lean 4 Programming Language
- PutnamBench
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →