While progress in informal mathematics has come largely from scaling the chain-of-thought and agentic reasoning of frontier language models, formal theorem proving has increasingly relied on human-des
A simple agentic loop with efficient Lean feedback achieves state-of-the-art formal theorem proving without structured workflows, showing that execution interfaces matter more than complex orchestration.
While progress in informal mathematics has come largely from scaling the chain-of-thought and agentic reasoning of frontier language models, formal theorem proving has increasingly relied on human-designed workflows around these models, such as planning, decomposition, and orchestrating specialized provers. This raises a bitter-lesson question: can a simple agentic loop that scales test-time compute match these workflows? The answer matters as formal verification must scale to keep up with frontier models producing research mathematics, yet new workflows rarely settle it, as their gains are often confounded with stronger models or more compute. We study this question with h1, a simple…
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
h1: A Taste of the Bitter Lesson in Automated Theorem Proving was first seen on Hugging Face · Daily papers on Oct 28, 2026. Since then it has appeared in 21 checks on 3 different days. Its best position was #10 of 30, reached on Oct 30, 05:28 UTC. It dropped off the list after Oct 30, 05:28 UTC.
Position on Hugging Face · Daily papers at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Hugging Face.
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Oct 30, 05:28 UTC, after 3 days of trending.
#10 on Hugging Face · Daily papers, on Oct 30, 05:28 UTC. Trendoday checks this list every 120 minutes.
It was first seen on Oct 28, 2026 and has been on the list on 3 days (21 checks) since.