Weekly

News about Lean, the theorem prover and programming language.

Week of May 28, 2026

Edition 17: 8 items published for May 14 to May 28, 2026.

AI and formalization

The Mathlib Initiative launches Formal Frontier for open-source AI autoformalization

Formal Frontier is a new project focused on responsible, scalable, and open-source AI-driven autoformalization of mathematics, with XTX Markets supporting it. Its initial phase covers a community autoformalization specification, open-source tooling, and autoformalized texts chosen to fill gaps in Mathlib's existing coverage.

Mathlib Initiative
Image: mathlib-initiative.org

Checked against: mathlib-initiative.org

Verification

Cajal introduces Talos, a Lean 4 framework for verifying WebAssembly modules

Talos provides a Wasm interpreter optimized for reasoning plus a WP calculus layer for proving program properties, with a proof that the num-integer crate's gcd using Stein's algorithm is correct. The early-stage project aims for full Wasm coverage by passing the official testsuite, and verification of any Rust crate that compiles to Wasm.

Checked against: leanprover.zulipchat.com

Lean core

Lean's hex aggregator bundles verified computational algebra libraries for Lean 4

The leanprover/hex repository installs the released hex libraries at a single pinned set, including HexLLL for LLL lattice reduction and HexBerlekampZassenhaus for integer polynomial factorization. Each computational library is Mathlib-free, with Mathlib correspondence proofs in a separate theory library.

Checked against: kim-em/hex

Lean core

Kim Morrison splits Lean's implicit transparency level into implicit and instances

A merged pull request by Kim Morrison separates the levels so that @[implicit_reducible] annotations no longer have the side effects @[instance_reducible] has, such as allowing type class search to see through marked declarations. The hierarchy is now none < reducible < instances < implicit < default < all, and a new with_implicit tactic is added.

Checked against: lean4#13637

Lean core

Kyle Miller replaces Lean's tactic configuration system with a faster one

A merged Lean pull request by Kyle Miller adds a tactic configuration system that supports custom configuration syntaxes, and on a simple benchmark configuration evaluation takes 6.2% of the time it used to. A separate pull request by Kyle Miller makes InfoView hovers include information about specific metavariables.

Checked against: lean4#13651lean4#13446

Lean core

Joachim Breitner adds an impossible tactic combinator to Lean

The merged pull request adds impossible by t, which uses the tactic t to prove that the current goal is impossible, closing the original goal as if sorry were used. try? gains an impossible branch that runs impossible by decide, impossible by simp, and impossible by grind in parallel.

Checked against: lean4#13771

Lean core

Leo de Moura adds a dsimp tactic for Lean's sym => mode

In a series of merged pull requests, Leo de Moura built infrastructure for a dsimp in SymM, functions for simplifying binders, reusable reduction DSimprocs (beta, zeta, zetaAll, dsimpProj, dsimpMatch), and syntax for declaring dsimp variants. The last pull request implements the dsimp tactic for interactive sym => mode.

Checked against: lean4#13857lean4#13823lean4#13824lean4#13825lean4#13854