arXiv:2606. 05632v1 Announce Type: new Abstract: Within the past few years, the ability of Large Language Models (LLMs) to generate formal mathematical proofs has improved drastically.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2606. 17581v1 Announce Type: cross Abstract: We present a dependent-type-based prover designed around the way LLMs (and humans) tend to write mathematics, complementing existing systems such as Lean and Rocq.
arXiv:2602.18307v2 Announce Type: replace-cross Abstract: Large language models have achieved striking results in interactive theorem proving, particularly in Lean. However, most benchmarks for LLM-b...
arXiv:2608. 00004v1 Announce Type: cross Abstract: Grading natural-language mathematical proofs is a recurring cost in evaluating math-reasoning systems, and frontier LLM judges are expensive.
The paper introduces a compiler-guided adaptive proof search framework for Lean 4 theorem proving, addressing the challenge of context-dependent proofs in real-world projects. It balances exploration and exploitation by generating diverse starting points via dual-model generation and resampling when stagnation occurs, while refining promising states using compiler-grounded pairwise comparison. Experiments on seven Lean 4 projects from miniCTX‑v2 demonstrate that the method improves average pass rates by 12.8 percentage points within a pass@32 budget and reduces LLM calls by 21.9 % compared to pass@k baselines.
arXiv:2606. 09450v1 Announce Type: new Abstract: LLMs have recently achieved strong results on formal proving benchmarks.
arXiv:2602. 09464v2 Announce Type: replace-cross Abstract: Vericoding refers to the generation of formally verified code from rigorous specifications.