OpenAI Blog
Sep 7, 2020
GamePad: A learning environment for theorem proving
Related stories
arXiv Machine Learning
Jun 25
Discovering New Theorems via LLMs with In-Context Proof Learning in Lean
arXiv:2509. 14274v3 Announce Type: replace Abstract: Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving.
arXiv AI
Jun 30
Self-Supervised Theorem Discovery in a Formal Axiomatic System
arXiv:2606. 28747v1 Announce Type: new Abstract: Recent artificial intelligence (AI) systems have shown remarkable progress in mathematical reasoning.
arXiv AI
Jul 17
MathCoPilot: An Interactive System for Human-AI Symbiotic Paradigm of Mathematical Research
arXiv:2607. 14582v1 Announce Type: new Abstract: Existing LLM-based theorem provers have achieved impressive results on formal mathematics benchmarks, yet they remain confined to acting as autonomous agents that prove a stated proposition.
arXiv AI
Jul 13
OpenProver: Agentic and Interactive Theorem Proving with Lean 4
arXiv:2607. 09217v1 Announce Type: new Abstract: In this system paper, we present OpenProver, an open-source system for LLM-driven automated theorem proving (ATP) with integrated Lean 4 formal verification.
arXiv AI
Jun 30
LAMP: Lean-based Agentic framework with MCP and Proof Repair
arXiv:2606. 28841v1 Announce Type: cross Abstract: Large language models are increasingly capable of mathematical reasoning, but the proofs they generate are often unreliable and hard to verify.
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.
Hugging Face Trending Papers
Jun 8
TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics
LLMs have recently achieved strong results on formal proving benchmarks. However, existing evaluations remain heavily concentrated on competition-style problems and often fail to capture how models behave on longer, more dependency-rich mathematical developments.
arXiv Machine Learning
Jun 2
A Theoretical Framework for Self-Play Theorem Proving Algorithms
arXiv:2606. 01861v1 Announce Type: new Abstract: Self-play, a type of training algorithm that enables a model to self-improve, has recently shown promising empirical results in the context of formal theorem proving using Large Language Models (LLMs).
arXiv AI
5d ago
VALG: An Agentic System for ML Theory Research
arXiv:2608. 13060v1 Announce Type: new Abstract: Machine learning theory studies learning procedures through mathematical setups in which the data model, training protocol, oracle access, loss, metric, and randomness define the phenomenon that a theorem is meant to explain.
arXiv AI
Jun 12
Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation
arXiv:2606. 12594v1 Announce Type: new Abstract: Modern Lean theorem provers achieve strong performance only with substantial training and inference compute, driven in part by scarce verified proof data and the long reasoning traces of formal proof search, making both supervised fine-tuning (SFT) and sampling expensive.
arXiv Machine Learning
Jun 25
MINIF2F-DAFNY: LLM-Guided Mathematical Theorem Proving via Auto-Active Verification
arXiv:2512. 10187v3 Announce Type: replace Abstract: LLMs excel at reasoning, but validating their steps remains challenging.