- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies whether large residual-state changes can help locate the first error in LLM-generated proofs. It develops a conditional extreme-value framework and evaluates residual-jump signals on three Lean provers across two benchmarks. The largest jump identifies the first rejected step more often than a uniform baseline, but its added value over simple features is small and model-dependent, with no significant improvement in online detection. The experiments suggest that jumps serve as relative within-proof signals rather than reliable fixed-threshold indicators of failure.
Critical strengths
- The paper provides a clear evaluation target. Lean verification can provide an objective label for the first proof step when LLM makes mistakes.
- It provides a broad empirical evaluation within formal proving. The paper also tests three provers across two benchmarks and multiple sampling temperatures.
- Positional baselines and prefix-restricted analysis help assess whether the jump signal goes beyond position effects and post-error text.
- Online detection and learned-localizer experiments test whether jumps add value beyond simple step features.
- The paper also clearly reports unsupported predictions and examines where the theoretical assumptions depart from observed behavior.
Critical weaknesses
-
The connection between the theory and the empirical findings is limited. The theory provides conditional benchmarks and possible mechanisms for generating heavy tails, but does not explain the relative localization signal observed when fixed-threshold validity coupling fails. The diagnostics in Section 6, together with the lack of support for P1/P3/P4, leave the Kesten/EVT mechanism unvalidated as an explanation of the empirical findings. The paper could be strengthened by clarifying what the theory explains beyond the residual-jump heuristic and which of its predictions are supported by the empirical results.
-
Concerns on practical value:
- Could the authors clarify the intended use of the jump signal, given its exact localization rate of roughly 17–29%? Moreover, can the authors discuss when jump features might help online detection? Table 5 shows no significant gain, and exact detection even decreases for Goedel at the 20% target FPR.
- Is there any reason why adding dump features helps DeepSeek (+2.66 pp) but does not improve Goedel in Table 6?
- Is there any potential reason why jump should be preferred over surprisal? On ProofNet, surprisal has a higher exact-localization point estimate for DeepSeek.
-
The comparisons include only uniform random selection, surprisal, and simple features. Could the authors clarify how the method compares with hidden-state probes, such as those cited from Azaria and Orgad, or process reward models?
-
The connection of P5 to the main framework can be further justified. Could the authors clarify how the P5 experiment validates the proposed extreme-value framework? It uses a different model and synthetic tasks, without measuring residual jumps or testing the coupling assumption. Exponential decay in success could also follow from a simple constant per-step error model, and the improvement over the constant-probability baseline is not significant at temperature 0.6.
-
Can the localization findings generalize beyond 7-8B Lean provers, particularly to informal reasoning where the first error is harder to identify?
Questions for authors
See weakness.
3 comments
Response to Reviewer 22Kj (2/3)
W2a. What is the intended use of the jump, given exact localization of 17–29%? When might jump features help online detection? Table 5 shows no gain, and for Goedel exact detection decreases at the 20% target FPR.
Intended use. In Lean the location of the first error is given by the verifier itself: here Lean is a source of exact labels, not the application. In future work we intend to use the largest jump as a likely error location where no step-level verifier exists. The jump requires no error labels: the whitening is estimated from verified proofs only. As a single rule it is weak (within one step: 43% and 48% on ProofNet). Its role is a feature that adds information to a learned localizer (W2b, W3) and a signal that narrows the search for the error within a proof.
Online. The scalar jump does not help online. This is expected for a relative signal: an online detector does not know the proof's own scale (W1). Direction helps. If the norm is replaced by a learned projection of the increment, online exact detection for Goedel on ProofNet increases by 12.2 pp [6.7, 18.1] at a 10% target FPR (Holm-adjusted p = 0.009). The realized FPR shifts by +1.9 pp [−6.4, 11.7], so this does not replace a strict comparison at equal FPR. In addition, from an accepted prefix the jump helps predict whether an error will occur before the end of the proof: on miniF2F, AUROC increases by 0.106 (DeepSeek) and 0.087 (Goedel) over a baseline of length, surprisal and its change. This is the setting of early stopping or restarting generation. On ProofNet there is no such gain.
Goedel at 20% FPR. The threshold is set on verified proofs of the inner folds, and the detector with the jump has a lower realized FPR on the test set: 12.3% vs 14.9%. Part of the decrease in exact detection reflects a stricter operating point.
W2b. Why do jump features help DeepSeek (+2.66 pp) but not Goedel?
The reason is Goedel's strong baseline, not the absence of a signal:
- in Goedel's eligible population, tactic length predicts the failure location well: a localizer using only tactic length reaches 42.7% (DeepSeek 32.4%), the learned baseline 57.8% (DeepSeek 40.9%);
- a likely reason is selection by the generation budget: 44% of Goedel's failed attempts (294 of 673) are truncated at 8192 tokens and do not enter the analysis, against 8% for DeepSeek;
- over such a baseline, even the full 4096-dimensional state of the layer does not help Goedel: −7.0 pp (for DeepSeek +8.2 [2.2, 14.4]);
- a single learned direction transfers for Goedel: the signed distance of the state to a hyperplane learned on ProofNet, as a single rule, identifies the failure in 38.5% on miniF2F and 39.5% on PutnamBench, against 21.5% and 6.7% for the norm; in the learned localizer on miniF2F it adds +6.8 pp [3.2, 10.6] (Holm-adjusted p = 0.034);
- against simpler baselines Goedel does gain: over surprisal alone +2.84 pp [−3.27, 8.96] with better NLL; without the tactic-length feature, the jump's contribution is non-negative (+0.50 [−2.38, 3.70]).
W2c. Why should the jump be preferred over surprisal? On ProofNet surprisal has a higher point estimate for DeepSeek.
We do not claim that the jump is better than surprisal as a single rule. On ProofNet the difference "jump − surprisal" is −2.6 pp for DeepSeek and +5.2 for Goedel; both intervals include zero (Sec. 5). On miniF2F the jump exceeds surprisal in every cell, at temperature 1.0 by 4.4–7.0 pp; on PutnamBench DeepSeek reaches 19.8% vs 17.5%. The main point is that the two features are complementary. They hit different proofs: on ProofNet both hit together in only 8.0% (DeepSeek) and 12.5% (Goedel) of proofs. Over surprisal, the jump adds +7.45 pp [2.31, 12.65] for DeepSeek and +2.84 for Goedel. The comparison with the change in surprisal between steps is in our response to Reviewer wDaH (Q2).
Response to Reviewer 22Kj (3/3)
W3. How does the method compare with hidden-state probes (Azaria & Mitchell; Orgad et al.) and with process reward models?
Probes. In the spirit of these works we trained linear probes on the full 4096-dimensional state of the layer and on the increment, but to select a step rather than to assess an answer. They are added to the same baseline as the jump (App. J). For DeepSeek the state probe adds +8.2 pp [2.2, 14.4] on ProofNet and +16.0 [5.2, 26.9] on PutnamBench with frozen settings; the NLL improvement is significant after Holm correction. For Goedel: −7.0 pp (strong baseline, W2b). As a single rule, the jump along a learned direction (the signed projection of the increment) finds the failure in 40% (DeepSeek) and 44% (Goedel) of cases, against 19% and 25% for the norm on the same proofs, and the distance of the state to a learned hyperplane, transferred from ProofNet to miniF2F and PutnamBench, in 38–42% for both models. The part of the increment orthogonal to this direction carries no information about the failure location, yet it determines the norm: the argmax of the raw norm and of this part coincide (22.3% vs 22.1% for DeepSeek, 25.2% vs 25.2% for Goedel). The probe has access to all the information from which the jump is computed: it is trained on the same vector and, in addition, on labels of the first-error location. It should therefore be more accurate.
PRM. We did not use a PRM for Lean. A PRM is trained on step-level labels produced by humans or by an automatic procedure, while in Lean the validity of each step is already checked by the verifier. The jump needs no labels: the whitening is estimated from verified proofs only. The jump can therefore be applied where neither a verifier nor labels are available.
W4. How does the P5 experiment validate the framework?
The P5 experiment does not test the framework: it uses a different model and synthetic tasks, does not measure jumps and does not test the coupling. Exponential decay of success also follows from a constant per-step error model, and at temperature 0.6 the improvement is not significant. In the revision P5 is removed from the abstract, and Sec. 9 states that the experiment shows only the predictive value of length. App. G compares the exponential with more flexible curves, from which it is not distinguishable. It also shows that the hazard of the first invalid formula is not constant across steps: it is markedly higher at the last assigned step.
W5. Do the localization findings generalize beyond 7–8B Lean provers, particularly to informal reasoning?
- New problems. On 76 new PutnamBench problems, with all settings frozen from ProofNet, the result replicates for DeepSeek: 19.8% vs 7.5%, and +9.3 pp [0.3, 18.4] over a positional predictor. For Goedel (48 attempts) it does not.
- Informal reasoning. ProcessBench contains informal math solutions in which the first erroneous step is labeled by humans; the jump and projections are computed from the states of a model reading the completed solution. The jump norm is above the uniform level there (20.3% vs 15.8%) but below a positional rule (25.5%). A learned direction works here as well: the projection on a direction learned on ProcessBench out of fold finds the first error in 38–45% of solutions for 7–8B readers (Qwen2.5-7B-Instruct 38.4%, DeepSeek-Prover-V2-7B 40.7%, Goedel-Prover-V2-8B 44.7%) vs 20–23% for the norm; a PRM reaches 52.2%. In the learned localizer, replacing the norm by the projection gives Goedel-Prover-V2-8B +6.6 pp [3.9, 9.2] (Holm-corrected, p < 0.001). Directions learned on Lean do not transfer to ProcessBench (17.9% and 24.4%). Limitation: the reading model did not generate these solutions. New App. L.
- Scale. This paper does not study models of other sizes.
We hope these changes address the reviewer's concerns and would be glad to clarify any point.
sponse to Reviewer 22Kj (1/3)
We thank the reviewer for the detailed and constructive review. Below we list the changes in the revision and answer each point (W: weaknesses).
Changes in the revision related to this review
W1. The connection between the theory and the empirical findings is limited: the theory does not explain the relative signal observed when fixed-threshold coupling fails, and the Kesten/EVT mechanism is not validated.
The theory explains the following.
The relative signal. All within-proof statements — Theorem 3 (localization) and Proposition 5 (read-out noise) — hold with a tolerance τi specific to each proof. A threshold common to all proofs is needed only by statements that compare proofs with each other: exceedance of a common level in failed versus verified proofs (Sec. 6) and online detection with a single threshold (Sec. 7). A theory with a proof-specific tolerance therefore predicts exactly the observed pattern: the relative signal within a proof persists, while a fixed threshold fails. An online detector does not know τi before the proof ends; the retrospective argmax does not depend on it.
Which predictions are supported.
The Kesten recurrence is a motivating model of how heavy tails could arise. It is not identified from observed states, and its tail predictions are not supported, so it is removed from the contributions.
In summary, the theory provides the conditions under which the largest step coincides with the failure and a test that discriminates between explanations. The data support coupling with a proof-specific tolerance, but not heavy tails.