# Evidence — job #4540 (route 100 step check) Record comparison only. No `K*`, no `A`, no `B`, no sweep row was produced for any new shape. The instrument rate is #2024's timing of the served `kfork.c`, not re-measured here (no C compiler on PATH); its arithmetic is recomputed and attributed. **CLAIM.** The step set by #1833 is unchanged and open, and it has now been step-checked twice with the same verdict — the queue is looping on it. The record does fix the way out: the covered range answers `D >= 3` negatively, the `Mp <= 1e10` clause at P=2/P=6 is priced at 11.5–75 CPU-h against a 2 h budget, and the step's **own** P=30 branch costs 1.7 h. The step is replaced (`progress`). **(1) THE LOOP.** The step string is byte-identical in five places: the assignment brief, route 100's stored `next_step`, and the `research.next_step` of #1833 (setter, `result`), #2018 (job #4526, `promising`) and #2024 (job #4528, `promising`); canonical-JSON sha256 `5a7520c706fac016…`. Both filed `promising` with the step copied back verbatim, which is what re-serves it. **(2) THE POST-#2024 WINDOW IS COMPLETE, AND CARRIES NO ANSWER.** A public GET of ids 2028..2060 returns no record (33 absences), so #2027 is the record's top; every corpus row with id ≤ 2023 was recorded before #2024 (max `2026-09-28T07:39:06.520Z` < `07:53:35.263Z`), so the returns recorded after #2024 are **exactly #2025, #2026, #2027**, all three read in full: route 174's discover return (maxsum capacity envelopes; its `drop`/`attain` are `U_m` falling below `k`), route 148's step check (the sahdated write guard) and route 76's step check (the T_37 → 41 fusion index). None carries a step locator *and* a step object word, none quotes the step, and none contains `drop = D`, `merge gain` or `drop >= 3`. **(3) THE COVERED RANGE ANSWERS THE SUCCESS CLAUSE NEGATIVELY.** #1833's served `sweep2612.jsonl`, re-aggregated whole: 12969 rows (P=2 11017, P=6 1952); guard `drop > D` **0** hits; 1350 rows with `drop >= 3`; `drop = D` on exactly 45 rows, all `(P=2,p=3,A=4,D=2)`; max attained `D` = 2; **none of the 8269 rows with `D >= 3` attains `D`**. `dbound2612.json` re-derived whole (4036 shapes, `D <= floor(2A/p)` everywhere, strict on 2300); the step's thresholds re-derived: the smallest `A` with `D(30,p,A) >= 3` is 14, 19, 21, 27, 33 for p = 7, 11, 13, 17, 19 — and at `(30,7,14)`, `D = 3 < floor = 4`. #1804's served P=30 census (1904 hard rows, A up to 16) reaches neither target cell: 0 rows with p=7 & A ≥ 14 (A max 8), 0 with p=11 & A ≥ 19 (A max 13), max drop 2; its H1 and H2 are both falsified (839, 1585 rows). **(4) THE PRICE.** Rate 2.19e8–2.67e8 slots/s single-thread. The P=2/P=6 band `2e9 < Mp <= 1e10` is 13998 rows / 6.4844e13 slots = **18.0 h** at 4 threads, 82.3 h at 2.4e8/s — above the step's 2 h and above this assignment's 8 CPU-h; `prereg-2612.md` Amendment 1 aborted exactly that configuration after 10 min (the sweep #1833 completed was itself 3.1 h). The step's cheap first clause (merge classification of the 1327 recorded rows with `drop >= D-2`) is 3.3e10 slots = 0.04 h. The step's **P=30** branch, read with the setter's P=2 pool cap (primes 7..43) and its own two thresholds p ∈ {7,11}: 893 R-sets (ΣM = 1.07e11) and 1255 rows (ΣMp = 1.337e12) = **1.67 h**; with the setter's modulus-cap convention `M <= 2e8` added, 718 sets / 986 rows = **0.37 h**. Widening the pool to primes ≤ 47 costs 3.49 h, to ≤ 60, 10.3 h. The A gate can only remove rows, so each figure is an upper bound. **(5) VERDICT.** Not `known`: #1833, #2018 and #2024 all leave attainment for `D >= 3` open. Not `promising` again: the record answers the covered part and leaves a branch affordable. Outcome `progress`. **False if** a return recorded after #2024, on route 100 or linked to it, reports `drop = D` for some `D >= 3` cross-checked by `kfork.c`, or proves a positive merge gain for `D >= 3`. Comparison, transport, hashing and price only; nothing here bounds `G2`, `beta_2` or twin-prime infinitude.