The paper introduces EasyProver, a Lean theorem prover that uses recursive agents, isolated contexts, asynchronous search, parallel tactic probing, and an elastic elaboration service. It achieves near‑saturation results on several benchmark suites, proving 669/672 PutnamBench problems, all six IMO 2026 formalizations, 597/600 NTP4VC verification conditions, and all 189 VERINA tasks. Additionally, the authors present Aegis, a pipeline that transforms competitive programming problems into harder verification tasks by generating safe Rust solutions, translating them to Lean, and producing 2,045 Rust‑Lean program pairs with 11,533 candidate specifications, enabling new benchmarks for provers and reinforcement learning.
By Debargha Ganguly, Divya Raghunathan, Dejan Jovanovi\'c, Vikash Singh, Soonho Kong, Aaron Tomb, Aman Goel, Ferhat Erata, Sam Bayless
The paper reports that all 1,325 theorems from the VeriContest benchmark—comprising 1,007 competitive‑programming problems in Rust with Verus specifications—were successfully proved using Rust‑Prover, a Lean 4‑based verifier. The authors translated each Verus specification and Rust program into Lean, then used Lean’s kernel to confirm the proofs, achieving a 70% first‑iteration success rate and completing 1,259 proofs in under 32 hours on Claude Opus 5.5. The translated Lean programs matched the original Rust outputs on 21,413 benchmark test cases, and the study also compared performance across multiple large‑language‑model settings, noting that higher reasoning effort increased cost without improving proof counts.
By Traian Serbanuta, Jun Xu, Andrei Stefanescu, Cosmin Radoi
arXiv:2608. 13522v1 Announce Type: cross Abstract: AI agents are increasingly used for programming, but do not provide any guarantee on the correctness of generated code.
By Zhe Ye, Hantao Lou, Yuechun Sun, Peiyang Song, Zhengxu Yan, Timothe Kasriel, Qingyang Zhang, Kaiyu Yang, Soonho Kong, Jingxuan He, Dawn Song
AI agents are increasingly used for programming, but do not provide any guarantee on the correctness of generated code. Verified code generation, in which an agent produces both an implementation and a machine-checked proof of its specification, offers a stronger path toward trustworthy AI-generated software.
arXiv:2603. 18334v2 Announce Type: replace-cross Abstract: As Large Language Models (LLMs) increasingly assist secure software development, their ability to meet the rigorous demands of Rust program verification remains unclear.
By Zichen Xie, Wenxi Wang
Formal verification offers the strongest guarantee of software correctness, but it does not scale: the proofs demanded by interactive theorem provers such as Coq require enormous expert effort. Large language models (LLMs) promise to generate these proofs automatically, yet existing approaches wire a fixed, human-designed proof strategy into the system and constrain the model to follow it (retrieving premises and predicting tactics one step at a time, or splitting goals by divide-and-conquer), and still prove only a fraction of their target theorems.
arXiv:2607. 06341v1 Announce Type: cross Abstract: Formal verification offers the strongest guarantee of software correctness, but it does not scale: the proofs demanded by interactive theorem provers such as Coq require enormous expert effort.
By Shuangxiang Kan, Shuanglong Kan, Sebastian Ertel
The paper introduces agentic verified optimization, where an AI agent produces a faster implementation of a program along with a machine‑checked proof that it is behaviorally equivalent to the original. The authors implement this in Lean 4, creating Aqueduct to migrate C, C++, Go, and Rust code into Lean and validate the ports via differential testing. On 189 reference functions, agents achieved 156 faster, proved rewrites, and on 17 migrated applications, 92 rewrites improved 47 of 51 scenarios, demonstrating the feasibility of verified optimization for real‑world software.
By Zhe Ye, Udaya Ghai, Zhizhen Qin, Dawn Song, Soonho Kong
arXiv:2608. 09277v1 Announce Type: new Abstract: Verified code generation asks a large language model (LLM) to generate both an executable program and a machine-checkable proof that the program meets a formal specification, promising software that is correct by construction.
By Zenan Li, Ziran Yang, Peiyang Song, Zhaoyu Li, Kaiyu Yang
Stellar Colosseum is a model‑agnostic harness designed to improve long‑horizon research in mathematics and theoretical computer science by allocating inference across multiple agents. It explores alternative strategies before constructing proofs, uses a readiness gate to decide when a route is mature enough to decompose, represents proof plans as interdependent subproblems, and routes verifier findings back to the relevant part of the argument. The workflow generates candidates in parallel, attacks them with targeted falsification, and combines candidates and critiques into a single research artifact through overlapping random‑sample tree aggregation, and has been integrated into Google Antigravity's Teamwork framework as the Long Proof pattern. Demonstrations show that, when paired with Gemini 3.1 Pro, Stellar Colosseum achieves 71.0% accuracy on the TCS‑Bench theorem‑proving benchmark and solves 218 of 222 Codeforces problems.
By Honghao Lin, David P. Woodruff, Yuan Deng, Jieming Mao, Song Zuo, Vahab Mirrokni
arXiv:2609.38269v1 Announce Type: cross
Abstract: Coding agents are increasingly asked to build software rather than patch it, yet benchmarks for from-scratch repository construction are mostly limit...
By Pei Yang, Tianyu Shi, Yuhang Yao, Wanyi Chen, Tongyun Yang, Dun Pei, Haonan Wang, Pengbin Feng, Guanxu Yu, Jingchun Huang, Zeyu Zhang, Shuhan Sun, Hao Li, Xiang Li, Jie Xiao, Xinyu Wang, Hanxin Chen, Daqi Li, Qi Jia, Hongshan Lin, Zhizhou Gu, Zijun Tian, Weizhi Du, Lynn Ai, Eric Yang
arXiv:2608.28639v1 Announce Type: new
Abstract: Formal theorem proving with large language models remains challenging due to the difficulty of navigating large proof search spaces efficiently. Existi...
By Bodla Krishna Vamshi, Haizhao Yang