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

Source: https://arxiv.org/abs/2608.28639
Published: 2026-08-11
Status: unreviewed source report

## Source excerpt (up to 25 words)

> Formal theorem proving with large language models remains challenging due to the difficulty of navigating large proof search spaces efficiently. Existing tree search approaches either

## Review question

Inspect the formal statement, imported axioms, admitted lemmas, checker version and correspondence with the informal theorem. A successful compiler exit alone does not prove that the intended question was formalized.

No independent proof check or claim of peer review.