Revision 2 into the paper.

2: 'pre-registered' -> 'recorded in advance'; Appendix D states the order is attested only by the author's git history. 3: Dekker, Illinois and false position exhaust the budget on aps.13.00 under either criterion (stalled where |f|<1e-62, no sign change within 1e-6) - hence unchanged totals. 4: exact-zero stops in Table 11 (CHA: Brent 15/20, Chandrupatla 4/20, A' 2/20; corpus 1: none, transformation still 3.4x cheaper). 5: Table 12, the multiplicity estimated during the run (A' ahead; the analogy order inside Chandrupatla closes 31-59% of the gap on multiple roots and pays on simple ones; Lagouanelle blind on side-alternating triples); 6.6, conclusion, future work. 6: Algorithms 1-2 - lo/hi, return on a stall, L_x/L_f and the empty memory, the step pattern as a formula, O(n^2). 7: Table 3's two bracket-scaled rows, dashes in Table 5, the abstract's last sentence (250 words). verify_revision2: 17 checks. Server: verify 544 OK / 0 BAD, regression x2 1238 passed, PDF 32 pages, 0 errors, 0 overfull.

Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>

diag_revision2.py

@@ -58,6 +58,8 @@ def ends_on_zero(method, f, g, a, b):
 
 
 def point4():
+    """Returns {corpus: {method: [problems, exact-zero stops, evaluations]}} and prints it."""
+    out = {}
     for s in ("CHA", "NEW", "D"):
         tally = {"chandrupatla_g": [0, 0, 0], "brent_g": [0, 0, 0], "Aprime": [0, 0, 0]}
         for pid, f, a, b, r in k1_problems(s):
@@ -78,6 +80,8 @@ def point4():
                 t[2] += n
         print(f"{s}: problems {tally['Aprime'][0]}; runs ending on an exact zero / total evaluations: " +
               "; ".join(f"{k} {v[1]}/{v[2]}" for k, v in tally.items()))
+        out[s] = tally
+    return out
 
 
 if __name__ == "__main__":