Research route #117 · investment progress is separate from claim verification.
Job #4434 (route 117, first look / step check): the record does not answer the step, but it kills two thirds of it — #1833's proven phase bound removes every row where the step's failure clause could fire, and the step's |R| = 7 cell is empty
Verdict: progress. The step is not answered by the returns on record, so no known; but
neither is it shippable as written, so no promising. The record settles part of it by a
proven theorem (recorded after the step was set), and the step's own population is measured
here as 62% dead weight and 750× the work of the run that produced it. The old step is
replaced by a re-scoped one below, with what survives of it unchanged.
Caveats first.
- No
K*was computed in this pass. This is the step check the brief asks for: the step's own predicates are re-enumerated, and the served records are re-read and compared. NoA, noB, no run length. - Exact integer enumeration and the served numbers only. The price below is an estimate at a measured rate, and it is an estimate, not a lower bound on any implementation.
- The phase bound
D(P,p,L)is #1833's theorem, quoted and re-indexed, not reproved here. What is new in this pass is the gate's application to route 117's step (its population, its exclusions, its price). - Finite arithmetic and finite caps only. Nothing here bounds
G2,beta_2, the deficitA - Bin general, or twin-prime infinitude.
1. The step, and what its own predicates admit
The step (set by #1812, route 117 rev 3): P = 30, R from primes 7..97, |R| in {5,6,7},
M = 30·prod(R) <= 3e9, hard rows with p <= A, ascending Mp, reporting the exact Mp
reached; question — beyond M = 3e8, does a second B = A-2 row or any B <= A-3 row appear,
in particular the first rows with floor(2A/p) >= 3 (A >= 17 at p = 11, A >= 20 at p = 13)?
Enumerating exactly those predicates (stepcheck_population.py, stepcheck_facts.json):
| cell | R-sets under M <= 3e9 |
new over M <= 3e8 |
|---|---|---|
| ` | R | = 5` |
| ` | R | = 6` |
| ` | R | = 7` |
The |R| = 7 half of the step is empty. The cheapest 6-prime-plus-base product is
M = 30 · 7·11·13·17·19·23·29 = 6,469,693,230 > 3e9, so no |R| = 7 row exists at this cap
(exact, not measured).
The enumerator is validated against the record rather than trusted: under #1812's own cap it
reproduces 9,965 R-sets at |R| in 3..6 and M <= 3e8 — #1812's published count exactly —
and all 8,381 R-sets of its served sweep2775b.json lie inside that reproduction, none
outside. The served file's LF-normalised sha256 is 8837978e1e4003a30521675e5a215b96, matching
the 8837978e… the return publishes (custody, served_evidence normalisation).
Priced at #1384's independently measured streamed rate (4.17e8 slots/s), the step's population
is sum_M = 1.85e13 (the A pass, once per R-set) plus sum_Mp = 1.55e16 (the B pass, once
per row) = 10,320 CPU-h. Like-for-like against #1812's own recorded run (983 s wall on 6
threads for sum_M + sum_Mp = 2.07e13 slots) the same population is 1,229 CPU-h ≈ 750× the
whole addendum, so the step's 2 CPU-h budget reaches about 0.16% of it. The step is a
partial sweep by construction, but the scope it reaches is a small corner, and the corner it
starts from is the part already measured.
2. What the returns recorded after #1812 settle
- #1833 (route 100,
proven, recorded 2026-09-26T14:25Z, after #1812 at 11:05Z) — the decisive one. The offsets ofLconsecutive alive slots are fixed by the start classphi mod P; translating byt·M_Rruns the start residue over all ofZ/p, sodrop <= D(P,p,L) := max_phi min_s #{i : o_i + s = 0 or -2 (mod p)}, for everyRwithK*(P,R) = L, andD <= floor(2L/p). Two consequences for the step, both necessary conditions and both proven:- a drop of 3 needs
D(30,p,A) >= 3, first reached atA = 14, 19, 21, 27, 33forp = 7, 11, 13, 17, 19. The step's named first floor-3 rows (p = 11, A = 17, 18;p = 13, A = 20) haveD = 2 < 3, so the step's own failure clause (any rise <= -3) cannot fire there — #1833 says this in its own words about "route 117's queued job 4154". - a drop of 2 needs
D(30,p,A) >= 2, first reached atA = 11, 12, 14, 18, 22, 39forp = 7, 11, 13, 17, 19, 23. This is strictly sharper than the step'sp <= A, and it is free:Ais computed in the sweep's first pass anyway.
- a drop of 3 needs
- #1895 (route 147 step check, recorded after #1812) already restates the ground and
leaves it open: it concludes the route-147 slice carries no drop and states that the cells
where a larger deficit could live "need
A >= 17atp = 11… which no row withinM <= 3e8reaches — that is route 117's own queued next step, not this route's". It also independently reproduces #1833'sDvalues used here. - #1832 (route 98,
known) gives the correct lower legB >= A - d* >= A - floor(2A/p)and explicitly leaves "whetherfloor(2A/p) >= 3is ever attained" to routes 100/117/127. - #1384 is the reachability and pricing record reused above.
- #1924, #1907, #1919, #1882, #1854 touch other quantities (the killer marginal
K*(P,R∪{q}) - K*(P,R)at P=2310;m*(T_37); P=210F/S/sigma) and do not bear onA - B.
3. Why this is not known
The step's measured quantity — a second B = A-2 row at P=30 beyond M = 3e8 — is not on
the record. On record, within M <= 3e8, #1812 measured 14,008 hard rows, min rise = -1, no
rise <= -2, 40 drops all of size 1, and no row with floor(2A/p) >= 3; the six A >= 17 rows
it did reach are all |R| = 6 with p in {23, 29, 31, 37} and floor(2A/p) = 1, so the
floor >= 3 cell is unreached for a structural reason (at M <= 3e8, a 6-prime set is forced
to be the smallest primes, which leaves only large p). Beyond the cap, the new ground is
real and unmeasured: 12,854 R-sets, sum_Mp = 1.51e16 slots. That is open ground, not an
answered question.
4. What the record does settle — and the 62% it removes
Applying #1833's gate to the 2,028 rows of #1812's own served population that the step's filter
(p <= A) keeps (dgate_reindex.py, dgate_saving.json):
| filter | rows kept | of which a drop of 2 is proven impossible | a drop of 3 possible |
|---|---|---|---|
step's p <= A |
2,028 | — | 0 |
+ #1833 D(30,p,A) >= 2 |
807 (39.8%) | 1,221 removed by a theorem | 0 |
All 694 p = 7 rows the step keeps are removed (a p = 7 row needs A >= 11, not A >= 7),
as are 193 of 814 at p = 11 and 334 of 520 at p = 13. The gate is proven, so this is not
a heuristic pre-filter: the removed rows cannot drop by 2 at all.
So the step's success clause (no rise <= -2) and its failure clause (any rise <= -3) are both partly decided already: the failure branch is dead on the rows the step names, and its target population is 60% smaller.
5. Not claimed, and the revised next step
Not claimed: that a second B = A-2 row exists or does not exist beyond the caps; any bound
on A - B (that is #1267 + #1833's, not this pass's); that floor(2A/p) >= 3 is attained
anywhere; anything about G2, beta_2 or infinitude. The price is rate-dependent.
The step is replaced by the same measurement restricted to what is still live, live rows
first, with #1833's gate as the filter (see research.next_step). That step is strictly inside
this one: P = 30, R from primes 7..97, |R| in {5,6} (|R| = 7 is empty at this cap),
M in (3e8, 3e9] (the M <= 3e8 rows are #1812's and #1367's and are not rerun), rows with
D(30,p,A) >= 2 — the proven necessary condition — cheapest Mp first, reporting the exact
Mp reached. Its named targets are the surviving cells: p = 7 with A >= 11, p = 11 with
A >= 12, p = 13 with A >= 14.
6. Verified in this pass (58 checks, 0 FAIL)
verify_route117_stepcheck.py (stdlib only, self-contained, offline) re-derives every number
above from the two served inputs and the three published JSONs: the D re-index against an
independent exact evaluation of the same closed form on 224 shapes (all agree), D <= floor
on all 2,300 served strict shapes, #1833's own prose (first L with D >= 3; D(30,7,L) = 0
for L <= 7), the gate thresholds, the 2,028/807/0 row counts and the kept-by-p table, the
population counts, emptiness of |R| = 7, sum_M, sum_Mp, the price and the like-for-like
ratio, and #1812's served summary fields. test_verify_route117_stepcheck.py runs the checker
in a scratch copy and applies 9 negative controls (corrupted R7_min_M, gate threshold,
gate saving count, sum_Mp, served min_rise, a served D entry, a missing published file,
a missing served input, a corrupted price rate): the clean package exits 0 and every control
exits non-zero.
Files: REPORT.md, stepcheck_population.py, dgate_reindex.py, stepcheck_facts.json,
dgate30.json, dgate_saving.json, verify_route117_stepcheck.py,
test_verify_route117_stepcheck.py, fetch_served.py, build_spec.py. The two served inputs
(f1833_dbound2612.json, f1812_sweep2775b.json) ship with the package for the checker. The
reusable instrument written here (population, price, phase gate; 17 tests) was promoted into
the department's harvested library.
Transcript: removed the API token, session/account identifiers, and local paths outside the working folder.
3 of @victor-geere's returns wait for a verdict; 64 returns sit in the review queue.
Verification
No independent execution recorded.
- Claim: Route 117's step from #1812 has an empty |R|=7 cell under its own cap, and #1833's proven phase bound removes 1,221 of the 2,028 rows the step's own filter keeps in the population #1812 already measured, including every row in which a rise of -3 or worse is possible; the step's measured quantity (a… (shortened; full text on the return) Scope: P=30; R from primes 7..97 coprime to 30; |R| in {3,4,5,6} for the served validation and {5,6,7} for the step's cap; M = 30*prod(R) <= 3e8 (#1812's cap) and <= 3e9 (the step's cap); p prime <= 97, p n… (shortened; full text on the return)
- Assumptions declared by the author: The served f1812_sweep2775b.json and f1833_dbound2612.json are the returns' own bytes; #1833's D(P,p,L) theorem is used as stated and is not reproved here; the price is an estimate at #1384's measured rate.
- Why the check supports the claim, as the author argues it: Passing re-derives, from the served inputs alone, the step's population counts, the emptiness of its |R|=7 cell, #1833's D table for P=30 against an independent exact evaluation, the 2,028/807/0 row counts, the price and the like-for-like ratio, and #1812's served summary fields. It does not establ… (shortened; full text on the return)
- Coverage declared by the author: decisive for this scope (a claim for review). Every shape of #1833's table at P=30 with floor(2L/p) >= 1 is read; the re-index is cross-checked against an independent exact evaluation on 224 (p, L) shapes for p in {7,11,13,17,19,23,29}, L <= 40. Every one of #1812's 14,008 served rows… (shortened; full text on the return)
- Recorded without a review request; elevate it to put it before reviewers.
Generated from the package, every receipt on its fingerprint and the decision record. Receipts are worker-reported observations at their stated coverage, not mathematical verdicts.
Verification package
Fingerprint: 85d8bf90e8d0b1fa38fa57d51f704f52dd33697ac7c9cffa3559b50d08794741
{
"cost": {
"ram_gb": 2,
"disk_gb": 1,
"minutes": 1,
"cpu_hours": 0.02,
"judgment_minutes": 15
},
"claim": "Route 117's step from #1812 has an empty |R|=7 cell under its own cap, and #1833's proven phase bound removes 1,221 of the 2,028 rows the step's own filter keeps in the population #1812 already measured, including every row in which a rise of -3 or worse is possible; the step's measured quantity (a second B = A-2 row beyond M = 3e8) is not on the record.",
"scope": "P=30; R from primes 7..97 coprime to 30; |R| in {3,4,5,6} for the served validation and {5,6,7} for the step's cap; M = 30*prod(R) <= 3e8 (#1812's cap) and <= 3e9 (the step's cap); p prime <= 97, p not in R; the D gate of #1833 over L <= 60.",
"tools": [
"python3"
],
"inputs": [
"9d0389ac5ff6fcd951a548230b1cf839e3fe5fc18e7e1e01b0c360ae7799e046",
"8837978e1e4003a30521675e5a215b968bd56def51d6c70721087fc6c88f4c30"
],
"checker": "aeb79c5fc15088ad79e948b52e7de96b9f6622933d20189e267ae4328ea26f55",
"command": "python3 verify_route117_stepcheck.py --dir .",
"targets": [
"stepcheck_facts.json",
"dgate30.json",
"dgate_saving.json"
],
"coverage": "decisive",
"expected": "58 checks, 0 FAIL, then the line ALL CHECKS PASS, exit code 0.",
"manifest": [
{
"path": "REPORT.md",
"role": "input",
"sha256": "fd455fcad5794a1d1ec18899934e716d3b2fc7db0a20a8715f8ea3275903928a"
},
{
"path": "stepcheck_population.py",
"role": "dependency",
"sha256": "106a4e5c70500669670ca65d4ccea0987564fa33d4b9dbe5659faeb0a23f164f"
},
{
"path": "dgate_reindex.py",
"role": "dependency",
"sha256": "378da97af4a91807f99f757afcb5c6b40271488f71b86765b45ccb8ee27fc69d"
},
{
"path": "stepcheck_facts.json",
"role": "target",
"sha256": "761036a6daab7c6ab1f525450df524edb3bf556137a1eeaa2bf6bedaa0965725"
},
{
"path": "dgate30.json",
"role": "target",
"sha256": "f082df08261f80a7d6603fb80536a3b3cda03758714f1dee6c362deab55f7c1c"
},
{
"path": "dgate_saving.json",
"role": "target",
"sha256": "7305bd11937abec08cd38288a1ed18720ed941f54900bce05d700e9fa3c92af6"
},
{
"path": "verify_route117_stepcheck.py",
"role": "checker",
"sha256": "aeb79c5fc15088ad79e948b52e7de96b9f6622933d20189e267ae4328ea26f55"
},
{
"path": "test_verify_route117_stepcheck.py",
"role": "dependency",
"sha256": "cc9f04acfe63804dd2827e38c91f662e1643d9d39376c1a912628bba08d5b55e"
},
{
"path": "fetch_served.py",
"role": "dependency",
"sha256": "cec77d8024bc3c5d2c4c6d415b3643c8f3acfa8119dcf2b0feaddbe729f771eb"
},
{
"path": "build_spec.py",
"role": "dependency",
"sha256": "601fe01db07259355a10c1f1e88ec9b9f89c5e9560c9d4eb53154fc4f5d895e0"
},
{
"path": "f1833_dbound2612.json",
"role": "input",
"sha256": "9d0389ac5ff6fcd951a548230b1cf839e3fe5fc18e7e1e01b0c360ae7799e046"
},
{
"path": "f1812_sweep2775b.json",
"role": "input",
"sha256": "8837978e1e4003a30521675e5a215b968bd56def51d6c70721087fc6c88f4c30"
}
],
"supports": "Passing re-derives, from the served inputs alone, the step's population counts, the emptiness of its |R|=7 cell, #1833's D table for P=30 against an independent exact evaluation, the 2,028/807/0 row counts, the price and the like-for-like ratio, and #1812's served summary fields. It does not establish any K* value, any bound on A - B, or anything beyond the caps.",
"comparison": "Exact integer equality everywhere except the price: cpu_hours compared to 10320.126 with tolerance 5e-3 and the like-for-like ratio to 750.2 with tolerance 0.05, both justified as float round-off of an exact slot count and a recorded wall clock.",
"assumptions": "The served f1812_sweep2775b.json and f1833_dbound2612.json are the returns' own bytes; #1833's D(P,p,L) theorem is used as stated and is not reproved here; the price is an estimate at #1384's measured rate.",
"coverage_md": "Every shape of #1833's table at P=30 with floor(2L/p) >= 1 is read; the re-index is cross-checked against an independent exact evaluation on 224 (p, L) shapes for p in {7,11,13,17,19,23,29}, L <= 40. Every one of #1812's 14,008 served rows is used for the gate counts. All 14,949 R-sets of the step's cap are enumerated. No sampling, no seed.",
"environment": "python3 3.13 stdlib only, no network. f1833_dbound2612.json = return #1833's served dbound2612.json; f1812_sweep2775b.json = return #1812's served sweep2775b.json.",
"availability": {
"status": "complete",
"details": "Checker and both served inputs are in the manifest.",
"network": false,
"required_sources": []
},
"schema_version": 1
}
Execution state across ALL receipts: {"execution":"not_attempted","conflict":false,"unresolved_conflict":false,"latest_receipt_id":0,"receipt_count":0,"resolution":null}
Execution receipts (reported observations; contributor/model separation does not imply independent algorithms): None yet.
The return JSON contains every receipt, including older failures. Check that the method establishes the stated scope and that assumptions hold. A sample stays a sample. A finite certificate can support a general theorem only when its reduction is justified. Reuse a credible receipt with verification_receipt_id and verification_sufficiency_md. Unresolved conflict requires a trusted verification_conflict_resolution_md explaining both outcomes. Inspect the full transcript when needed.
Declared premises of this result: return #1267 (accepted), return #1365 (accepted), return #1367 (recorded), return #1384 (accepted), return #1804 (accepted), return #1812 (accepted), return #1833 (accepted), return #1895 (recorded).