Weekly

News about Lean, the theorem prover and programming language.

Week of Aug 27, 2026

Edition 26: 18 items published for Aug 15 to Aug 27, 2026.

Lean core

Lean FRO publishes six-month roadmap for September 2026 to February 2027

The roadmap covers lake check commands for external kernel checking, a code formatter, Nerodia (a Lean/Python FFI inspired by PyO3), and faster typeclass inference. It also covers the FRO's AI projects Tau Ceti, Hex, and Palomar, and defers investment in debugger infrastructure.

Checked against: lean-lang.org

Lean core

Sebastian Ullrich fixes reference count overflow that could enable a proof of False

A merged Lean 4 pull request freezes objects whose 32-bit reference count overflows, preventing a use-after-free in the official kernel. The new logic is validated with a transliteration of its core to Lean followed by correctness proofs in a test file. Daniel Selsam (OpenAI) reported the issue using internal models.

Checked against: lean4#14838

Lean core

SAIR Foundation and Lean FRO announce the Lean Kernel Challenge competition

The competition asks participants to improve the performance of verified computation in the Lean 4 kernel (the trusted component that checks every proof accepted by Lean) with optimized implementations and machine-checked proofs of correctness. Stage 1 pre-registration is open, with the official launch on September 15, 2026.

Checked against: @Leonard41111588 on XLinkedIn post

AI and formalization

Lean FRO and ICARM open Palomar, a registry of Lean-verified mathematics

Palomar, a public, searchable registry of machine-checked Lean formalizations incubated by the Lean FRO and ICARM, is now open for submissions, Terence Tao announced. Submitted repository snapshots are checked mechanically with the Lean tool Comparator and by a large language model, though Palomar is not a peer-reviewed journal.

Checked against: terrytao.wordpress.comLinkedIn post

AI and formalization

Vero benchmark tests AI agents on verified Lean 4 software repositories

Researchers including Kaiyu Yang, Soonho Kong, Jingxuan He, and Dawn Song introduce Vero, a benchmark of 43 multi-module instances sourced from real-world repositories, each a multi-module Lean 4 repository with predetermined API interfaces. The strongest agent fully solves only 27 of 43 instances.

First page of the paper
Image: paperswithlean.com

Checked against: arXiv:2608.13522

AI and formalization

Scott Armstrong says Lean formalization became essential to his research in 2026

Scott Armstrong wrote on X that in March, Lean formalization was not possible for his papers, and by August it had become essential and increased the efficiency of his workflow dramatically. Scott Armstrong says the papers are getting written informally and finished much faster because of the Lean formalization.

Checked against: @scottnarmstrong on X

AI and formalization

Vasily Ilin runs a collaborative Lean 4 formalization of Mazur's torsion theorem

The Vilin97/MazurTheorem repository targets the classification of rational torsion on elliptic curves, using Mazur's degree-one formal-immersion argument at the auxiliary prime 5. The project reports an integrated score of 17.2% on its 48-node, 1,000-point theorem DAG, and it accepts claims only on contracts marked open or research_open.

Checked against: Vilin97/MazurTheorem

Verification

Paul Butcher builds a complete production TodoMVC webapp in Lean 4

The repository adds passwordless sign-in, SQL migrations, OpenTelemetry traces and logs, an MCP endpoint, and deployment to AWS Lambda, built on Paul Butcher's own Lean libraries. Markup is typed and formally verified (a <div> inside a <p> is a type error), and lean-json is proved correct against the grammar of RFC 8259.

Checked against: paulbutcher/lean-todomvc-max

Lean core

Lean 4 redefines Decidable as a Bool paired with a proof

A pull request by Robin Arnez, merged on 2026-08-20, changes Decidable p to a structure containing a Bool and a proof of either p or ¬p, giving more definitional equalities and letting the decide tactic stop carrying proofs. The breaking change was possible now that the new compiler is enabled.

Checked against: lean4#8309

Lean core

Lean adds leanchecker-paranoid and lake challenge; Joachim Breitner releases inductive models

Sebastian Ullrich merged leanchecker-paranoid, a variant of leanchecker built with allocator hardening, and lake challenge, a frontend to comparator that simplifies its setup. Joachim Breitner's lean-inductive-models performs translation validation of user-defined Lean inductives into an extensional type system with a small hard-coded inductive basis.

Checked against: lean4#14885lean4#14884nomeata/lean-inductive-modelsarena.lean-lang.org

Lean core

Renaissance Philanthropy runs the CSLib Initiative to support CSLib's growth

The CSLib Initiative, a program of Renaissance Philanthropy, supports the growth of the CSLib open-source project (a focused effort on formalizing computer science in Lean) in the same way that the Mathlib Initiative supports Mathlib. Its site lists a team, a Strategic Advisory Board, and a roadmap of operational goals guiding its funding.

CSLib
Image: cslib.io

Checked against: cslib.io

Lean core

Sebastian Graf moves VERINA contracts onto programs and names verification-condition variables

Two merged Lean pull requests by Sebastian Graf state each VERINA program's requires, ensures and loop invariants on the definition itself, for all 27 programs. A second pull request names a verification condition's variables after the program (acc, x instead of b✝), so proofs no longer need rename_i.

Checked against: lean4#14759lean4#14590

Lean core

Lake now fetches dependencies as treeless partial Git clones

A merged pull request by Mac Malone makes Lake fetch dependencies as treeless partial Git clones of a single revision, minimizing the amount of data downloaded. One caveat: Git operations inside a dependency, such as a git blame triggered by a VSCode extension, can cause lazy fetches.

Checked against: lean4#14782

Lean core

Lean adds strong coinduction principles and a monotonicity_by clause for predicates

Wojciech Różowski merged a Lean pull request that generates strong_coinduct for coinductive_fixpoint predicates, strengthening coinduct, plus strong_induct for inductive_fixpoint ones. A second merged pull request adds a monotonicity_by clause so users can prove monotonicity of the underlying fixpoint functor with an explicit tactic block when automatic proof search fails.

Checked against: lean4#14855lean4#14861

Papers and events

Tim Sweeney praises the Lean team's handling of a kernel bug

Tim Sweeney called the response "an exemplary handling of a bug in the Lean theorem prover and proof verifier kernel." The bug was discovered in an AI generated proof, a contributor simplified it down to a straightforward reproduction, and the team fixed it speedily.

Checked against: @TimSweeneyEpic on X