arXiv Computation and Language September 10, 2026 By Burak S. Akbudak, Zeynel A. Ulu\c{s}an, Can S. Erer, G\"ozde G\"ul \c{S}ahin

TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs

Read the original on arXiv Computation and Language →

TreeThink is an open‑source Python library that provides modular, fully asynchronous tree search for neural theorem proving. It integrates established tree‑search methods with vLLM inference pipelines and supports a range of node evaluation techniques, from lightweight heuristics to neural evaluators. The library connects directly to the REPL servers of Lean 4, Rocq, and Isabelle/HOL, enabling real‑time verification and proof‑state extraction, and it has been evaluated on miniF2F and MATH500, achieving up to an 8.0× wall‑clock speedup from asynchronous execution.

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 Computation and Language.

llms

arXiv AI

Jun 16

Mask-Proof: An LLM-based Automated Data Curation Pipeline on Mathematical Proofs

arXiv:2606. 15258v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly capable of mathematical problem solving and can even assist with research-level proofs, yet we still lack a scalable and reproducible way to measure step-level reasoning in long proofs across diverse sources.

By Jierui Zhang, Siyuan Tan, Xinhang Li, Longzhuangzhi Lin, Dailin Li, Chengfeng Gu, Xinping Li, Yaxian Hao, Shengjia Liang, Yuxiang Ren, Wenhao Liu

llms benchmarks

arXiv AI

Sep 1

Reward-Oracle MCTS for Formal Theorem Proving: Sample-Efficient Search and the Need for Kernel-Level Proof Auditing

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

llms benchmarks

arXiv Machine Learning

Sep 23

VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean

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...

By Yutong Xin, Qiaochu Chen, Greg Durrett, I\c{s}il Dillig

llms benchmarks

arXiv Machine Learning

Jun 19

Pseudo-Formalization for Automatic Proof Verification

arXiv:2605. 20531v2 Announce Type: replace-cross Abstract: Reliable verification of proofs remains a bottleneck for training and evaluating AI systems on hard mathematical reasoning.

By Slim Barkallah, Luke Bailey, Kaiyue Wen, Mohammed Abouzaid, Tengyu Ma

llms benchmarks

arXiv Machine Learning

Jun 25

Discovering New Theorems via LLMs with In-Context Proof Learning in Lean

arXiv:2509. 14274v3 Announce Type: replace Abstract: Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving.

By Kazumi Kasaura, Naoto Onda, Yuta Oriike, Masaya Taniguchi, Akiyoshi Sannai, Sho Sonoda

llms

arXiv AI

Jun 12

Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation

arXiv:2606. 12594v1 Announce Type: new Abstract: Modern Lean theorem provers achieve strong performance only with substantial training and inference compute, driven in part by scarce verified proof data and the long reasoning traces of formal proof search, making both supervised fine-tuning (SFT) and sampling expensive.

By Joshua Ong Jun Leang, Zheng Zhao, Mihaela C\u{a}t\u{a}lina Stoian, Qiyuan Xu, Haonan Li, Wenda Li, Shay B. Cohen, Eleonora Giunchiglia

diffusion fine-tuning efficiency benchmarks

One email a morning, machine-written

Related stories

Mask-Proof: An LLM-based Automated Data Curation Pipeline on Mathematical Proofs

Reward-Oracle MCTS for Formal Theorem Proving: Sample-Efficient Search and the Need for Kernel-Level Proof Auditing

VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean

Pseudo-Formalization for Automatic Proof Verification

Discovering New Theorems via LLMs with In-Context Proof Learning in Lean

Pythagoras-Prover: Advancing Efficient Formal Proving via Augmented Lean Formalisation