arXiv Computation and Language

StochBench: A Domain-Specific Benchmark for Stochastic Processes in Lean

StochBench is a new Lean 4 benchmark comprising 450 graduate‑level stochastic‑process problems, each linked to its natural‑language source. It covers a wide range of topics—finite and countable Markov chains, renewal processes, random walks, martingales, stopping times, queues, Brownian motion, stochastic calculus, weak convergence, and Poisson and continuous‑time Markov processes—addressing a field underrepresented in Mathlib. An Opus 4.8‑based agent achieved a 34.9% proof rate (157/450) within a 15‑minute per‑problem limit, demonstrating the benchmark’s difficulty for advanced provers.

arXiv AI
Jun 16

SorryDB: Can AI Provers Complete Real-World Lean Theorems?

arXiv:2603. 02668v2 Announce Type: replace Abstract: We present SorryDB, a dynamically-updating benchmark of open Lean tasks drawn from 78 real world formalization projects on GitHub.

By Austin Letson, Leopoldo Sarra, Auguste Poiroux, Oliver Dressler, Paul Lezeau, Dhyan Aranha, Frederick Pu, Aaron Hill, Miguel Corredera Hidalgo, Julian Berman, George Tsoukalas, Lenny Taelman
arXiv Machine Learning
5d ago

h1: A Taste of the Bitter Lesson in Automated Theorem Proving

The paper introduces h1, a simple agentic loop that interfaces a language model with Lean 4, avoiding complex human-designed workflows. h1 achieves state‑of‑the‑art performance on benchmarks such as PutnamBench, FATE‑X, and FormalConjectures100‑Solved, solving eight open problems and matching or surpassing specialized systems like Goedel‑Architect and AlphaProof Nexus. Experiments show that an efficient Lean interface is crucial for cost and success, suggesting that future evaluations should prioritize execution feedback over elaborate workflows.

By Skander Moalla, Ahmad Rammal, Niket Patel, Remi Munos, Julia Kempe
arXiv AI
Jun 3

LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks

arXiv:2606. 03303v1 Announce Type: new Abstract: Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean.

By Po-Nien Kung, Linfeng Song, Dawsen Hwang, Jinsung Yoon, Chun-Liang Li, Simone Severini, Mirek Ol\v{s}\'ak, Edward Lockhart, Quoc V Le, Burak Gokturk, Thang Luong, Tomas Pfister, Nanyun Peng
arXiv AI
4d ago

Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physics

Ax-Prover is a multi‑agent framework that uses Large Language Models (LLMs) combined with Lean tools via the Model Context Protocol (MCP) to generate formally correct proofs in mathematics and quantum physics. It can operate autonomously or collaboratively with human experts, and its performance on public math benchmarks and new Lean benchmarks in abstract algebra and quantum theory shows it is competitive with state‑of‑the‑art provers and often outperforms them. The system also demonstrated practical assistant capabilities by helping a mathematician formalize a complex cryptography theorem.

By Benjamin Breen, Marco Del Tredici, Jacob McCarran, Javier Aspuru Mijares, Weichen Winston Yin, Kfir Sulimany, Jacob M. Taylor, Frank H. L. Koppens, Dirk Englund
Hugging Face Trending Papers
Jul 13

AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification

Large language models (LLMs) have achieved remarkable performance on high-school and olympiad-style mathematics, yet their capabilities on advanced mathematics remain poorly understood. Existing benchmarks, however, fall short in both scope and evaluation granularity: they provide limited disciplinary coverage and often rely on final-answer correctness or coarse judgments, leaving the validity of the reasoning process inadequately assessed.