Skip to content
Review

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

Sep 2026 · 1 citation
Physics Computer Science

TL;DR

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.

Abstract

Landmark mathematical formalizations have taken specialist teams years to complete. We present FormalFlow, a system that coordinates AI proving agents under human supervision to address statement drift and proof composition in long-horizon formalization. Drawing on software engineering principles and practices, it uses a shared blueprint to guide nested planning, proving and review loops. Agents strengthen verification and review throughout formalization. We completed a machine-checked Lean 4 proof of the quantum soundness of the classical low individual-degree test, a core theorem underlying MIP* = RE. Developing the proof took 63 days; greater parallelism could further reduce this time. The final library contains 126,367 lines of Lean code, all generated by agents. The formalization corrects side conditions and intermediate errors while preserving the published final error bound under corrected assumptions. This work provides a verified foundation for quantum complexity and demonstrates a route to affordable verification of major research proofs by small teams.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness

Proof auto-formalization translates natural-language (NL) theorems and proofs into a formal language (FL) such as Lean, enabling mechanical verification. Despite rapid progress, research-level proofs often depend on concepts missing from leading proof assistant libraries (e.g., Lean's Mathlib), and successful compilati...

Prithwish Jana, Việt Bách Hoàng, Logan Luna et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Stellar Colosseum is introduced, a model-agnostic harness for allocating inference across research in mathematics and theoretical computer science that demonstrates the capabilities of Colosseum through open-ended research and evaluations on theorem-proving and competitive programming benchmarks.

Hong-Hao Lin, David P. Woodruff, Yuan Deng et al. · 2 citations · ⚡1
#artificial intelligence Preprint Sep 2026

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

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.

Fei-Ming Wang, Dai-Bo Li, Kun Yuan · 0 citations
Preprint Oct 2026

Symbolic Search Is Not Exhausted: Persistent Proof-Space Exploration in Lean4

Formal theorem proving increasingly combines learned semantic guidance with verified symbolic execution. The quality of the symbolic search substrate therefore determines how much useful mathematical structure can be accumulated, reused, and exposed under a finite inference budget. We introduce ViaLean, a Lean4 prover...

Ruoran Xu · 0 citations
Preprint Sep 2026

Rosetta: Automating First-Principles Performance Modeling Using Multi-Agent LLMs

Rosetta is presented, a multi-agent LLM pipeline that automatically generates first-principles analytical models from research paper PDFs, and four design decisions address failure modes of na\"ive LLM-based generation.

K. Sankaralingam · 0 citations
#artificial intelligence Preprint Oct 2026

VeriHarness: Scaling Agentic Verification for Long-Horizon Tasks

As LLM agents undertake increasingly complex, long-horizon tasks, verifying their outputs becomes increasingly challenging. We study how verification capability can be strengthened with a fixed base model, without access to reference answers or grading rubrics at test time. Repeated sampling yields multiple rollouts th...

Caiqi Zhang, Ru-Jun Han, Zifeng Wang et al. · 0 citations

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