Skip to content

ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization

Sep 2026 · 0 citations · 53 references
Computer Science Mathematics

TL;DR

This work introduces ProofLoom, a fully automated LLM-agent system for Proof-Obligation-Driven Theory Construction, a fully automated LLM-agent system for Proof-Obligation-Driven Theory Construction that autonomously constructs the Lean model and supporting theory.

Abstract

Formalizing research-level stochastic optimization in Lean requires both an algorithm model and domain theory connecting foundational libraries to convergence proofs. Revising a model to restore provability can change the mathematical claim. We introduce ProofLoom, a fully automated LLM-agent system for Proof-Obligation-Driven Theory Construction. Given a published algorithm, target theorem, and source proof, ProofLoom autonomously constructs the Lean model and supporting theory. Open proof obligations drive the development of definitions, interfaces, lemmas, and proof plans. Signature contracts record evidence and obligations for model revisions; an independent Judge rejects unsupported assumptions and weakened conclusions. Planner expands the published argument into intermediate claims, and Audit checks whether the Lean proof follows it. Across tasks, SOptLib accumulates verified mathematics and construction experience: reusable results are extracted, generalized, and verified, while modeling decisions and failed proof routes are recorded. Later tasks retrieve these results and records and contribute new developments, forming a cycle of construction, accumulation, and reuse. On fifteen textbook and research-paper tasks, ProofLoom obtains mean human ratings of 6.3/7 and 6.4/7, compared with 4.9/7 and 5.0/7 for the strongest of six baselines. Across 33 developments, it produces 490,693 lines of algorithm-local Lean code with no sorry. The formalizations also expose 28 incorrect formulas, proof gaps, and algorithm-analysis mismatches in published sources across 22 developments, each with checked evidence.

View source

Similar papers

#artificial intelligence Review Oct 2026

FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verification

Coding agents increasingly automate Lean proof development, but successful compilation alone does not establish that a candidate proves the intended statement under acceptable assumptions. We present FORALL-LEAN-AGENT, a frontend-agnostic framework for auditable reasoning in formal mathematics and software verification...

N. Lwin · 0 citations
Preprint Sep 2026

Formal Model Construction Guided by Model-Based Proof Sketches

Proof-Sketch-Guided Formal Model Synthesis (ProGS), an autoformalization method centered on model-based proof sketches, which improves over state-of-the-art agentic formal modeling approaches in syntactic validity, deductive verifiability, and behavioral correctness.

Hong-Shu Wang, Xin-Yue Zuo, Yu-Fan Cai et al. · 0 citations
Review Sep 2026

Long-horizon autoformalization of a core theorem underlying MIP* = RE

This work completed a machine-checked Lean 4 proof of the quantum soundness of the classical low individual-degree test, a core theorem underlying MIP* = RE, and provides a verified foundation for quantum complexity.

Si-Rui Lu, Rui-Xuan Deng, David Zhu et al. · 1 citation
Review Aug 2026

Does the Proof Prove It That Way? Faithful Formalization of Elements Proofs

Pistis is introduced, an agentic, oracle-guided proof search that produces formal Lean proofs that satisfy faithfulness conditions and can accept or refute natural language proofs written by humans or AI, demonstrating that faithful formalization is useful as a proof-checking tool.

Tadd Mao, Tianjun Zhong, Dhruva Arekar et al. · 1 citation
Preprint Aug 2026

Contract-Aware Rescue of a Drifted Isabelle Development: The Double-Tank Case Study

CAPRI, a contract-aware proof-repair tool, is used to govern a reconstruction by combining Isabelle acceptance with an independent check of repository changes against machine-readable edit contracts, and the reconstruction discharged all ten scoped obligations within the original nine-theory structure.

Jim Woodcock, Gabriel Leite, Augusto Sampaio et al. · 0 citations
Preprint Sep 2026

Agentic-IC3: Enabling Semantic Proof Search in IC3 Model Checking

IC3 is a state-of-the-art algorithm for hardware model checking that proves safety properties by incrementally constructing an inductive invariant consisting of a set of lemmas. Its effectiveness depends on generalization heuristics that identify useful lemmas and guide proof search. However, many leading IC3 hardware...

Yu-Wei Fan, SooHyuk Cho, Aarti Gupta et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.