Formalize Once, Edit the Rest: Efficient Lean-Based Answer Selection for Math Reasoning
- company arXiv
- lab Lean
- location cs.CL
- model BASE
- model LEANSCRIBE
- product CatalyzeX Code Finder
- product DagsHub
- product alphaXiv
A new pipeline called BASE reduces the computational cost of using the Lean proof assistant to verify mathematical reasoning by roughly a factor of five, while simultaneously improving answer-selection accuracy, according to a paper posted to arXiv on 14 June 2026 [1][2]. The approach, described by researchers as a “base-and-edit” pipeline, formalizes only a single base candidate per problem in Lean and then derives the remaining statements by editing the answer expression in place [1][2]. Lean is a proof assistant and functional programming language based on the calculus of constructions with inductive types, developed as a free and open-source project [4]. It allows machine-checkable verification of reasoning outputs, which is useful for tasks such as selecting the best answer from K sampled candidates during test-time scaling [2]. Existing methods that use Lean for answer selection call an autoformalization model to generate a formal statement for each candidate independently, which incurs significant computational cost [2]. BASE instead trains a rewriter model called LEANSCRIBE to localize the answer within the base formalization and produce a reusable edit function for the remaining K−1 candidates [1][2]. The paper reports that this design cuts autoformalizer calls by about 5x at K=8, and the reduction is expected to grow as K increases [1][2]. The researchers evaluated BASE across four benchmarks and three solvers, covering 12 distinct dataset-and-solver configurations [1][2]. They state that BASE achieves a Pareto improvement—higher selection accuracy and lower formalization cost—on all 12 configurations [1][2]. Code for the pipeline has been made available on GitHub [1][2]. The work arrives as large language models are increasingly deployed for mathematical reasoning, where formal verification tools such as Lean offer a way to check outputs with rigorous, machine-readable proofs [2]. The history of formal methods in mathematics stretches back to ancient civilizations’ contributions to astronomy and geometry, but the modern integration of proof assistants with neural reasoning systems represents a more recent development [3].
research-papermodel-releaseproduct-launchtool-release
Background sources we checked (5)
- arxiv.org ↗ With large language models (LLMs) increasingly applied to mathematical reasoning, formal proof assistants such as Lean can be leveraged to verify reasoning outputs with machine-checkable rigor, enabling use cases such as answer selection in test-time scaling with K sampled candid…
- en.wikipedia.org ↗ The history of science covers the development of science from ancient times to the present. It encompasses all three major branches of science: natural, social, and formal. Protoscience, early sciences, and natural philosophies such as alchemy and astrology that existed during th…
- en.wikipedia.org ↗ Lean is a proof assistant and a functional programming language. It is based on the calculus of constructions with inductive types. It is a free and open-source software project hosted on GitHub. Development is currently supported by the nonprofit Lean Focused Research Organizati…
- en.wikipedia.org ↗ The prolific mathematician Paul Erdős and his various collaborators made many famous mathematical conjectures, over a wide field of subjects, and in many cases Erdős offered monetary rewards for solving them. The unsolved problems are commonly known as Erdős problems.…
- en.wikipedia.org ↗ This list covers all known stars, white dwarfs, brown dwarfs, and sub-brown dwarfs/rogue planets within 20 light-years (6.13 parsecs) of the Sun. So far, 133 such objects have been found. Only 22 are bright enough to be visible without a telescope, for which the star's visible li…