Structured Hints for Sample-Efficient Lean Theorem Proving

Zachary Burton
1/22/2026
cs.AI

No confident code implementation found for this paper.

Abstract

State-of-the-art neural theorem provers like DeepSeek-Prover-V1.5 combine large language models with reinforcement learning, achieving impressive results through sophisticated training. We ask: do these highly-trained models still benefit from simple structural guidance at inference time? We evaluate a lightweight intervention -- a fixed prompt schedule over 15 common tactic skeletons -- on the miniF2F benchmark. This simple approach yields 21.7% pass@16 compared to 15.2% for standard sampling from the same model, a 43% relative improvement using the same number of samples (k=16) and same maximum generation length (1024 tokens). Our results suggest that even capable RL-trained provers underutilize structural priors available in the tactic language, and that simple inference-time guidance remains a cheap, complementary boost.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{burton2026structured,
  title  = {Structured Hints for Sample-Efficient Lean Theorem Proving},
  author = {Zachary Burton},
  year   = {2026},
  eprint = {2601.16172},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.16172v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.16172.svg)](https://codeofpaper.com/paper/2601.16172)

Discussion