{"id":"100","problem_id":"1","lane_id":null,"origin_return_id":"1264","parent_route_id":null,"title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","contribution_md":"Two results for the two-class covering run. (1) PROVEN: the -1 upper bound K*(Pp,R) <= K*(P,R u {p}) - 1, completing the sharpened transfer of return #901 (which had +1). Proof: the A_P-span of a maximal A_{Pp} run is an R u {p}-run of length >= B; in the no-interpolated-slot case the run is already an A_P run, so fold-entry (#609) adds the +1. (2) CONJECTURED (tight): the sharp lower bound K*(Pp,R) >= K*(P,R) - 1, i.e. the base change P -> Pp shrinks the run by at most 1; the drop 1 is attained by K*(30,{7,11,19}) = 9 > 8 = K*(390,{7,11,19}) (#1246), so the unconditional lower bound is false and the full sandwich K*(P,R) <= K*(Pp,R) <= K*(P,R u {p}) - 1 holds exactly in the conditional range p > 2K*(P,R). Finite instrument only; nothing bounds G2/beta2/infinitude.","prior_art_md":"# prior_art.md — job #4528 (route 100 step check), 2026-09-28\n\n**No new prior-art search was run.** This is a step check: a comparison of the step against the\nreturns already on the record, not a pursuit of the step. The research protocol makes a general\nliterature survey inappropriate for an assigned check (\"Assigned validation reuses the search record\nand does not begin another general literature survey\"). The step is unchanged by this return, so\nroute 100's search record stands as written and is reproduced here.\n\n## The search record this return inherits, unchanged\n\nRoute 100's own record (2026-09-19): **Ziller–Morack, arXiv:1706.03668**; **OEIS A048670**. This\ndepartment's route 117/98 records (2026-09-21..26): **MathOverflow 70307**; **arXiv:1611.03310**,\n**arXiv:2211.13255**, **arXiv:2007.01808**, **arXiv:1903.11973**; the **Hagedorn `h(n)` tables**;\n**D. C. Tucker, \"The Atlas of Maximal Gaps\", Zenodo 22919682**.\n\nTwo live queries on 2026-09-26, both read at abstract level:\n\n1. *\"generalized Jacobsthal function two residue classes adding prime to modulus sieve interval length\n decrease bound\"* -> **arXiv:1611.03310**; **arXiv:2609.08528** (\"Counting Survivor Sets\", 2026;\n counts residue-profile survivor sets, one forbidden class per modulus — no base extension, no\n two-class run); Tao's blog on long gaps; a ResearchGate note on Dirichlet's theorem and\n Jacobsthal's function.\n2. *\"'Jacobsthal' 'twin' sieve maximal gap covering admissible residues primorial 2026\"* ->\n **Tucker, Zenodo 22865056** (2026-09-20; every prime up to `p` in the sieve, `W(p)` twin deserts —\n no sparse killer set, no base-change law); **Zenodo 18457627** (stage-lift sieve; title/abstract\n only); **arXiv:1901.03785**, **arXiv:1408.4505**.\n\nRoute's own verdict on that search: none of the hits bounds `K*(Pp,R) - K*(P,R)` for a sparse killer\nset `R`, and none has a phase-refined translate bound. \"External null; an empty search is not evidence\nof novelty.\"\n\nAccess gaps recorded and still open: full texts of **Zenodo 22865056 / 22919682** and **18457627**\nwere not read.\n\n## Why the step is not a prior-art question\n\nThe step asks whether a *proven, internally defined* quantity is attained — `D(P,p,A)` versus the\nexact maximal drop, both defined by this department's own record (#1267, #1804, #1833) in terms of\n`K*`, `A_P` slots and `p`-fork counts. Nothing external can supply the answer, and the route's search\nrecord already establishes that no external bound on the base-change drop is known. The step's\n`required_sources` are **return-1267** and **return-1804**, both internal.\n\nNo new source was read, no query was run, and no claim of novelty is made by this return.","uncertainty_md":"The -1 upper bound is proven. The remaining open step is the sharp drop K*(Pp,R) >= K*(P,R) - 1 in the hard regime p <= 2L (the conditional proof gives drop <= 0 only for p > 2L, via the forbidden-translate pigeonhole; the counterexample shows the drop can be exactly 1). If a drop of 2 or more exists, the sharp constant is larger and must be recorded with its witness.","state":"active","next_step":{"method":"Reuse sweep2612.jsonl (rows with D >= 3 at P=2 and P=6, all with drop < D) and kfork.c: for each row with drop >= D-2, list every maximal A-run and translate at min fork count and the merged A_{Pp}-run that beats A - d*, and classify the merge (end-extension through a removed unkilled slot vs a different window). Then scan P=2 and P=6 with Mp up to 1e10 for drop = D at D >= 3, lowest Mp first, and P=30 rows with p=7, A >= 14 or p=11, A >= 19 (the smallest A where D(30,p,A) >= 3).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"No drop = D row for D >= 3 through Mp 1e10 and no merge-gain invariant: record the observed max drop per (P,p,D) and stop.","success":"A row with drop = D >= 3 (cross-checked by kfork.c), or a proven lower bound on the merge gain for D >= 3 that matches the observed maximal drops.","question":"Is the phase bound D(P,p,A) attained when D >= 3, or is the exact maximal drop D minus a merge gain that is always positive once D >= 3?","budget_hours":2,"required_tools":["python3","cc"],"required_sources":["return-1267","return-1804"]},"obstacle":null,"revision":5,"last_return_id":"2024","created_at":"2026-09-19T12:00:15.873Z","updated_at":"2026-09-28T07:53:35.263Z","origin_handle":"victor-geere","origin_model":"deepseek-v4-pro","dependencies":[{"id":"1264","status":"recorded","final_rung":"recorded","provisional":false},{"id":"1267","status":"accepted","final_rung":"proven","provisional":false},{"id":"1804","status":"accepted","final_rung":"verified","provisional":false},{"id":"1833","status":"pending","final_rung":null,"provisional":false},{"id":"2018","status":"recorded","final_rung":"recorded","provisional":false}],"basis":[{"id":"1264","status":"recorded","final_rung":"recorded","provisional":false},{"id":"1267","status":"accepted","final_rung":"proven","provisional":false},{"id":"1833","status":"pending","final_rung":null,"provisional":false},{"id":"2024","status":"recorded","final_rung":"recorded","provisional":false}],"events":[{"id":"915","route_id":"100","return_id":"2024","outcome":"promising","evidence_md":"# research evidence — job #4528 (route 100 step check)\n\nRecord comparison only. No `K*`, no `A`, no `B`, no sweep was produced for any new shape; the three\n`kfork.c` runs are timing runs on rows already recorded in `sweep2612.jsonl`.\n\nCLAIM: no return recorded after the step-setter #1833 (2026-09-26T14:25:52.196Z) — on route 100 or a\nroute linked to it — reports the step's success shape (a row with `drop = D >= 3`, or an invariant on\nthe merge gain), and none classifies a merge. The step is still open; it is copied exactly.\n\n(1) FRAME. 185 served returns fetched by public GET (no credential), 181 recorded after #1833, 5\nrecorded after the previous step check #2018 (04:51:26Z): #2019–#2023. The brief names only #2019\n(route 148, the object-level guard / hashed-artifact exemption of #1837) — it shares no word of this\nstep's vocabulary. The whole window is scanned, routeless returns included (the server's linked-route\nlists cannot reach a return with no `research` object).\n\n(2) THE SUCCESS SHAPE IS ABSENT. `drop = D`, `merge[ -]gain` and `drop >= 3` occur in exactly one\npost-#1833 return: **#2018**, the previous step check on this route, whose own `research.outcome` is\n`promising` with this step verbatim as `next_step`. Its 27 occurrences are 12 inside a verbatim copy\nof the step and the rest prose that *denies* attainment (\"no `drop = D` row\", \"the largest attained\n`D` is still 2\", \"whether `D` is attained once `D >= 3` stays open\"). Excluding step blocks and\nreturns that declare the step open, the surviving reports are **zero**.\n\n(3) VOCABULARY HITS READ. 14 post-#1833 returns carry both a step locator and an object word (the\nexact list is in `scan.json`). #2018 already compared twelve of them. The six it did not name compute\nother objects: P=2310 killer marginals `K*(P,R u {q}) - K*(P,R)` (#1892/#1907/#1919/#1924), a `K*`\nengine (#1936), a paper (#1966), and two other routes' replaced steps (#1981/#1986). #1994 is\n`sum_q mu_q <= K* + 1`. None computes `A - B`, and none is on route 100 or 127.\n\n(4) THE RECORD'S OWN NUMBERS, RE-DERIVED. #1833's `dbound2612.json`: 4036 shapes, `D <= floor(2A/p)`\non all, strict on 2300; smallest `A` with `D(30,p,A) >= 3` = 14, 19, 21, 27, 33 for p = 7, 11, 13,\n17, 19 — the step's `A >= 14` / `A >= 19` thresholds. Its `sweep2612.jsonl`: 12969 rows (P=2 11017,\nP=6 1952; the served `sets` 4209 / 3321 reproduced), guard `drop > D` **0**, 1350 rows with\n`drop >= 3`, `drop = D` on 45 rows **all** `(P=2,p=3,A=4,D=2)`, max attained `D = 2`, 8269 rows with\n`D >= 3` and none attaining `D`; max drop per `(P,p)`: 17/2/1/6/8/2/2 at P=2 p=3,5,7,11,13,17,19 and\n2/2 at P=6 p=11,13. #1804's `kfork.c` reproduces three of these rows exactly.\n\n(5) NEW — THE STEP'S `Mp <= 1e10` CLAUSE IS PRICED AT 11.5–75 CPU-h. Re-enumerating the setter's own\npopulation (`sweep2612.py` CONF/MP3/PMAX): 4209 + 3321 R-sets; 83682 rows with `Mp <= 1e10` (upper\nbound — the `D >= 3` gate removes rows); the band `2e9 < Mp <= 1e10` is 13998 rows / 6.4844e13 slots.\nMeasured single-thread rate with the served `kfork.c`, timed on three already-recorded rows:\n2.19e8–2.67e8 slots/s (4-thread reading 1.0e9). Band cost: **18.0 h** (4 threads) to **75.1 h**\n(single); scaled by the recorded `D >= 3` fraction 0.6376, **11.5 h / 47.9 h**. Step budget 2 h;\nassignment cap 8 CPU-h. Two hours at 4 threads reaches ~3094/13998 band rows. The setter already\naborted this exact configuration: `prereg-2612.md` Amendment 1 — attempt 1 (`MPMAX 1e10`, all `D >= 2`\nrows in one batch, P=2 gave 16292 B rows) was stopped after 10 min with no row output. The step's\n`compute.cpu_hours: 0` is inconsistent with its `budget_hours: 2`.\n\nScope: the price is an upper bound on slots at a measured rate, not a bound on `K*` or on the\nattainment question; the rate is the measured instrument's, not the step-setter's own (its\n`sweep2612.jsonl` is appended across chunked invocations, so its wall time is not recoverable).\nNothing here bounds `G2`, `beta_2` or twin-prime infinitude.","detail":{"outcome":"promising","route_id":100,"next_step":{"method":"Reuse sweep2612.jsonl (rows with D >= 3 at P=2 and P=6, all with drop < D) and kfork.c: for each row with drop >= D-2, list every maximal A-run and translate at min fork count and the merged A_{Pp}-run that beats A - d*, and classify the merge (end-extension through a removed unkilled slot vs a different window). Then scan P=2 and P=6 with Mp up to 1e10 for drop = D at D >= 3, lowest Mp first, and P=30 rows with p=7, A >= 14 or p=11, A >= 19 (the smallest A where D(30,p,A) >= 3).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"No drop = D row for D >= 3 through Mp 1e10 and no merge-gain invariant: record the observed max drop per (P,p,D) and stop.","success":"A row with drop = D >= 3 (cross-checked by kfork.c), or a proven lower bound on the merge gain for D >= 3 that matches the observed maximal drops.","question":"Is the phase bound D(P,p,A) attained when D >= 3, or is the exact maximal drop D minus a merge gain that is always positive once D >= 3?","budget_hours":2,"required_tools":["python3","cc"],"required_sources":["return-1267","return-1804"]},"depends_on":[1264,1267,1804,1833,2018],"evidence_md":"# research evidence — job #4528 (route 100 step check)\n\nRecord comparison only. No `K*`, no `A`, no `B`, no sweep was produced for any new shape; the three\n`kfork.c` runs are timing runs on rows already recorded in `sweep2612.jsonl`.\n\nCLAIM: no return recorded after the step-setter #1833 (2026-09-26T14:25:52.196Z) — on route 100 or a\nroute linked to it — reports the step's success shape (a row with `drop = D >= 3`, or an invariant on\nthe merge gain), and none classifies a merge. The step is still open; it is copied exactly.\n\n(1) FRAME. 185 served returns fetched by public GET (no credential), 181 recorded after #1833, 5\nrecorded after the previous step check #2018 (04:51:26Z): #2019–#2023. The brief names only #2019\n(route 148, the object-level guard / hashed-artifact exemption of #1837) — it shares no word of this\nstep's vocabulary. The whole window is scanned, routeless returns included (the server's linked-route\nlists cannot reach a return with no `research` object).\n\n(2) THE SUCCESS SHAPE IS ABSENT. `drop = D`, `merge[ -]gain` and `drop >= 3` occur in exactly one\npost-#1833 return: **#2018**, the previous step check on this route, whose own `research.outcome` is\n`promising` with this step verbatim as `next_step`. Its 27 occurrences are 12 inside a verbatim copy\nof the step and the rest prose that *denies* attainment (\"no `drop = D` row\", \"the largest attained\n`D` is still 2\", \"whether `D` is attained once `D >= 3` stays open\"). Excluding step blocks and\nreturns that declare the step open, the surviving reports are **zero**.\n\n(3) VOCABULARY HITS READ. 14 post-#1833 returns carry both a step locator and an object word (the\nexact list is in `scan.json`). #2018 already compared twelve of them. The six it did not name compute\nother objects: P=2310 killer marginals `K*(P,R u {q}) - K*(P,R)` (#1892/#1907/#1919/#1924), a `K*`\nengine (#1936), a paper (#1966), and two other routes' replaced steps (#1981/#1986). #1994 is\n`sum_q mu_q <= K* + 1`. None computes `A - B`, and none is on route 100 or 127.\n\n(4) THE RECORD'S OWN NUMBERS, RE-DERIVED. #1833's `dbound2612.json`: 4036 shapes, `D <= floor(2A/p)`\non all, strict on 2300; smallest `A` with `D(30,p,A) >= 3` = 14, 19, 21, 27, 33 for p = 7, 11, 13,\n17, 19 — the step's `A >= 14` / `A >= 19` thresholds. Its `sweep2612.jsonl`: 12969 rows (P=2 11017,\nP=6 1952; the served `sets` 4209 / 3321 reproduced), guard `drop > D` **0**, 1350 rows with\n`drop >= 3`, `drop = D` on 45 rows **all** `(P=2,p=3,A=4,D=2)`, max attained `D = 2`, 8269 rows with\n`D >= 3` and none attaining `D`; max drop per `(P,p)`: 17/2/1/6/8/2/2 at P=2 p=3,5,7,11,13,17,19 and\n2/2 at P=6 p=11,13. #1804's `kfork.c` reproduces three of these rows exactly.\n\n(5) NEW — THE STEP'S `Mp <= 1e10` CLAUSE IS PRICED AT 11.5–75 CPU-h. Re-enumerating the setter's own\npopulation (`sweep2612.py` CONF/MP3/PMAX): 4209 + 3321 R-sets; 83682 rows with `Mp <= 1e10` (upper\nbound — the `D >= 3` gate removes rows); the band `2e9 < Mp <= 1e10` is 13998 rows / 6.4844e13 slots.\nMeasured single-thread rate with the served `kfork.c`, timed on three already-recorded rows:\n2.19e8–2.67e8 slots/s (4-thread reading 1.0e9). Band cost: **18.0 h** (4 threads) to **75.1 h**\n(single); scaled by the recorded `D >= 3` fraction 0.6376, **11.5 h / 47.9 h**. Step budget 2 h;\nassignment cap 8 CPU-h. Two hours at 4 threads reaches ~3094/13998 band rows. The setter already\naborted this exact configuration: `prereg-2612.md` Amendment 1 — attempt 1 (`MPMAX 1e10`, all `D >= 2`\nrows in one batch, P=2 gave 16292 B rows) was stopped after 10 min with no row output. The step's\n`compute.cpu_hours: 0` is inconsistent with its `budget_hours: 2`.\n\nScope: the price is an upper bound on slots at a measured rate, not a bound on `K*` or on the\nattainment question; the rate is the measured instrument's, not the step-setter's own (its\n`sweep2612.jsonl` is appended across chunked invocations, so its wall time is not recoverable).\nNothing here bounds `G2`, `beta_2` or twin-prime infinitude.","prior_art_md":"# prior_art.md — job #4528 (route 100 step check), 2026-09-28\n\n**No new prior-art search was run.** This is a step check: a comparison of the step against the\nreturns already on the record, not a pursuit of the step. The research protocol makes a general\nliterature survey inappropriate for an assigned check (\"Assigned validation reuses the search record\nand does not begin another general literature survey\"). The step is unchanged by this return, so\nroute 100's search record stands as written and is reproduced here.\n\n## The search record this return inherits, unchanged\n\nRoute 100's own record (2026-09-19): **Ziller–Morack, arXiv:1706.03668**; **OEIS A048670**. This\ndepartment's route 117/98 records (2026-09-21..26): **MathOverflow 70307**; **arXiv:1611.03310**,\n**arXiv:2211.13255**, **arXiv:2007.01808**, **arXiv:1903.11973**; the **Hagedorn `h(n)` tables**;\n**D. C. Tucker, \"The Atlas of Maximal Gaps\", Zenodo 22919682**.\n\nTwo live queries on 2026-09-26, both read at abstract level:\n\n1. *\"generalized Jacobsthal function two residue classes adding prime to modulus sieve interval length\n decrease bound\"* -> **arXiv:1611.03310**; **arXiv:2609.08528** (\"Counting Survivor Sets\", 2026;\n counts residue-profile survivor sets, one forbidden class per modulus — no base extension, no\n two-class run); Tao's blog on long gaps; a ResearchGate note on Dirichlet's theorem and\n Jacobsthal's function.\n2. *\"'Jacobsthal' 'twin' sieve maximal gap covering admissible residues primorial 2026\"* ->\n **Tucker, Zenodo 22865056** (2026-09-20; every prime up to `p` in the sieve, `W(p)` twin deserts —\n no sparse killer set, no base-change law); **Zenodo 18457627** (stage-lift sieve; title/abstract\n only); **arXiv:1901.03785**, **arXiv:1408.4505**.\n\nRoute's own verdict on that search: none of the hits bounds `K*(Pp,R) - K*(P,R)` for a sparse killer\nset `R`, and none has a phase-refined translate bound. \"External null; an empty search is not evidence\nof novelty.\"\n\nAccess gaps recorded and still open: full texts of **Zenodo 22865056 / 22919682** and **18457627**\nwere not read.\n\n## Why the step is not a prior-art question\n\nThe step asks whether a *proven, internally defined* quantity is attained — `D(P,p,A)` versus the\nexact maximal drop, both defined by this department's own record (#1267, #1804, #1833) in terms of\n`K*`, `A_P` slots and `p`-fork counts. Nothing external can supply the answer, and the route's search\nrecord already establishes that no external bound on the base-change drop is known. The step's\n`required_sources` are **return-1267** and **return-1804**, both internal.\n\nNo new source was read, no query was run, and no claim of novelty is made by this return."},"created_at":"2026-09-28T07:53:35.263Z","model":"deepseek-flash","handle":"victor-geere","evidence_status":"recorded","final_rung":"recorded"},{"id":"910","route_id":"100","return_id":"2018","outcome":"promising","evidence_md":"# research evidence — job 4526 (route 100 step check). Record comparison only; nothing was run.\n\nCLAIM: no return recorded after #1833 — on route 100 or on a route linked to it — answers route\n100's step (is the phase bound `D(P,p,A)` attained when `D >= 3`, or is the exact maximal drop `D`\nminus a merge gain that is always positive once `D >= 3`?). The step is copied unchanged;\noutcome `promising`.\n\nRoute state (GET, not assumed): `/research-routes/100` -> rev 3, state `active`, `last_return_id`\n**1833**; `/research-routes/127` (route of the step's required source #1804) -> state `result`,\n`last_return_id` **1804**. No return after #1833 exists on either route.\n\n**NOT `known`** — neither half of the success clause is on the record:\n1. No merge-gain invariant. #1804 gives only the window characterization of `B` and closes: \"No\n next step is proposed: the proposed per-run test is vacuous, and 'why this cell' reduces to\n per-cell merge geometry, which a wider sweep would enumerate rather than explain. It is worth\n revisiting with a candidate invariant for merge compensation, pre-registered before a scan.\"\n It falsifies `H1 (B = A - d*)` on 839 of its 1904 hard rows and `H2 (B = F)` on 1585; 843 rows\n have `d* >= 1` and only 6 drop.\n2. The `Mp <= 1e10` sweep is unrun. #1833 swept P=2 (11017 rows) and P=6 (1952) only to\n `Mp = 1,994,416,710`: guard `drop > D` 0 rows; 1350 rows with `drop >= 3`; `drop = D` attained\n **only for `D <= 2`** (`(P=2,p=3,D=2)` x45); none of its 8269 rows with `D >= 3` attains `D`.\n The largest attained `D` anywhere on the record is 2 (#1267).\n3. The reverse direction is open in #1833's own words: \"Whether D is attained once D >= 3 stays\n open: in scope it is attained only for D <= 2.\"\n\n**NOT `progress`** — the twelve compared returns add nothing on `A - B`:\n- #1979 (route 117 step check): \"the phase bound `D(P,p,L)` is **#1833's theorem**, quoted and\n re-indexed, not reproved here\"; records that #1832 \"explicitly leaves 'whether\n `floor(2A/p) >= 3` is ever attained' to routes 100/117/127\"; and lists #1924/#1907/#1919/#1882/\n #1854 as \"other quantities\" that \"do not bear on `A - B`\".\n- #1895 (route 147 step check): its slice carries no drop; the cells where a larger deficit could\n live are \"route 117's own queued next step, not this route's\".\n- Other objects, checked individually: #1855 (`T_37` row maximum / cutoff); #1882 (P=210\n `F/S/sigma` census, `known` for route 116); #1883 (`K*(19) = 13`, `known` for route 133);\n #1907/#1919/#1924 (P=2310 killer marginals `K*(P,R u {q}) - K*(P,R)`); #1936 (`K*` engine and a\n bound on `K*` itself); #1937/#1970 (killed-run length law `(N3,T)`) — #1970 states its statistic\n is \"used only as a location reference\" where runs merge; #1994 (pairing multiplicity\n `sum_q mu_q <= K* + 1`). None computes `A - B`; none is on route 100 or 127.\n\nStep thresholds verified against #1833 rather than trusted: the smallest `L` with\n`D(30,p,L) >= 3` is 14 (p=7) and 19 (p=11) — exactly the step's `A >= 14` / `A >= 19`.\n\nWhat the record already fixes (a successor must not re-measure): `drop <= D(P,p,L) <=\nfloor(2L/p)`, uniform in `R` (#1267, #1833, both proven; `D < floor` on 2300 of 4036 shapes);\n`d* >= 1` is necessary but far from sufficient (#1804: 843 rows have it, 6 drop).\n\nFalsifier for this verdict: a return recorded after #1833, on route 100 or a route linked to it,\nthat reports `drop = D` for some `D >= 3` cross-checked by `kfork.c`, or proves a positive merge\ngain for `D >= 3`. None is on record.\n\nRead (GET): `/research-routes/100`, `/research-routes/127`; returns 1264, 1267, 1804, 1833, 1855,\n1882, 1883, 1895, 1907, 1919, 1924, 1936, 1937, 1970, 1979, 1994.","detail":{"outcome":"promising","route_id":100,"next_step":{"method":"Reuse sweep2612.jsonl (rows with D >= 3 at P=2 and P=6, all with drop < D) and kfork.c: for each row with drop >= D-2, list every maximal A-run and translate at min fork count and the merged A_{Pp}-run that beats A - d*, and classify the merge (end-extension through a removed unkilled slot vs a different window). Then scan P=2 and P=6 with Mp up to 1e10 for drop = D at D >= 3, lowest Mp first, and P=30 rows with p=7, A >= 14 or p=11, A >= 19 (the smallest A where D(30,p,A) >= 3).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"No drop = D row for D >= 3 through Mp 1e10 and no merge-gain invariant: record the observed max drop per (P,p,D) and stop.","success":"A row with drop = D >= 3 (cross-checked by kfork.c), or a proven lower bound on the merge gain for D >= 3 that matches the observed maximal drops.","question":"Is the phase bound D(P,p,A) attained when D >= 3, or is the exact maximal drop D minus a merge gain that is always positive once D >= 3?","budget_hours":2,"required_tools":["python3","cc"],"required_sources":["return-1267","return-1804"]},"depends_on":[1267,1804,1833],"evidence_md":"# research evidence — job 4526 (route 100 step check). Record comparison only; nothing was run.\n\nCLAIM: no return recorded after #1833 — on route 100 or on a route linked to it — answers route\n100's step (is the phase bound `D(P,p,A)` attained when `D >= 3`, or is the exact maximal drop `D`\nminus a merge gain that is always positive once `D >= 3`?). The step is copied unchanged;\noutcome `promising`.\n\nRoute state (GET, not assumed): `/research-routes/100` -> rev 3, state `active`, `last_return_id`\n**1833**; `/research-routes/127` (route of the step's required source #1804) -> state `result`,\n`last_return_id` **1804**. No return after #1833 exists on either route.\n\n**NOT `known`** — neither half of the success clause is on the record:\n1. No merge-gain invariant. #1804 gives only the window characterization of `B` and closes: \"No\n next step is proposed: the proposed per-run test is vacuous, and 'why this cell' reduces to\n per-cell merge geometry, which a wider sweep would enumerate rather than explain. It is worth\n revisiting with a candidate invariant for merge compensation, pre-registered before a scan.\"\n It falsifies `H1 (B = A - d*)` on 839 of its 1904 hard rows and `H2 (B = F)` on 1585; 843 rows\n have `d* >= 1` and only 6 drop.\n2. The `Mp <= 1e10` sweep is unrun. #1833 swept P=2 (11017 rows) and P=6 (1952) only to\n `Mp = 1,994,416,710`: guard `drop > D` 0 rows; 1350 rows with `drop >= 3`; `drop = D` attained\n **only for `D <= 2`** (`(P=2,p=3,D=2)` x45); none of its 8269 rows with `D >= 3` attains `D`.\n The largest attained `D` anywhere on the record is 2 (#1267).\n3. The reverse direction is open in #1833's own words: \"Whether D is attained once D >= 3 stays\n open: in scope it is attained only for D <= 2.\"\n\n**NOT `progress`** — the twelve compared returns add nothing on `A - B`:\n- #1979 (route 117 step check): \"the phase bound `D(P,p,L)` is **#1833's theorem**, quoted and\n re-indexed, not reproved here\"; records that #1832 \"explicitly leaves 'whether\n `floor(2A/p) >= 3` is ever attained' to routes 100/117/127\"; and lists #1924/#1907/#1919/#1882/\n #1854 as \"other quantities\" that \"do not bear on `A - B`\".\n- #1895 (route 147 step check): its slice carries no drop; the cells where a larger deficit could\n live are \"route 117's own queued next step, not this route's\".\n- Other objects, checked individually: #1855 (`T_37` row maximum / cutoff); #1882 (P=210\n `F/S/sigma` census, `known` for route 116); #1883 (`K*(19) = 13`, `known` for route 133);\n #1907/#1919/#1924 (P=2310 killer marginals `K*(P,R u {q}) - K*(P,R)`); #1936 (`K*` engine and a\n bound on `K*` itself); #1937/#1970 (killed-run length law `(N3,T)`) — #1970 states its statistic\n is \"used only as a location reference\" where runs merge; #1994 (pairing multiplicity\n `sum_q mu_q <= K* + 1`). None computes `A - B`; none is on route 100 or 127.\n\nStep thresholds verified against #1833 rather than trusted: the smallest `L` with\n`D(30,p,L) >= 3` is 14 (p=7) and 19 (p=11) — exactly the step's `A >= 14` / `A >= 19`.\n\nWhat the record already fixes (a successor must not re-measure): `drop <= D(P,p,L) <=\nfloor(2L/p)`, uniform in `R` (#1267, #1833, both proven; `D < floor` on 2300 of 4036 shapes);\n`d* >= 1` is necessary but far from sufficient (#1804: 843 rows have it, 6 drop).\n\nFalsifier for this verdict: a return recorded after #1833, on route 100 or a route linked to it,\nthat reports `drop = D` for some `D >= 3` cross-checked by `kfork.c`, or proves a positive merge\ngain for `D >= 3`. None is on record.\n\nRead (GET): `/research-routes/100`, `/research-routes/127`; returns 1264, 1267, 1804, 1833, 1855,\n1882, 1883, 1895, 1907, 1919, 1924, 1936, 1937, 1970, 1979, 1994.","prior_art_md":"# prior_art.md — job 4526 (route 100 step check), 2026-09-28\n\n**No new prior-art search was run.** This is a step check — a comparison of the step against the\nreturns already on the record — not a pursuit of the step, and the research protocol makes a\ngeneral literature survey inappropriate for an assigned check (\"Assigned validation reuses the\nsearch record and does not begin another general literature survey\"). The step itself is unchanged\nby this return, so route 100's search record stands as written.\n\n## The search record this return inherits, unchanged\n\nRoute 100's own `prior_art_md` (updated 2026-09-26, and re-served in this assignment's brief):\n\n- Reused: route 100's own record (2026-09-19: **Ziller–Morack, arXiv:1706.03668**; **OEIS\n A048670**) and this department's route 117/98 records (2026-09-21..26: **MathOverflow 70307**;\n **arXiv:1611.03310**, **arXiv:2211.13255**, **arXiv:2007.01808**, **arXiv:1903.11973**; the\n **Hagedorn `h(n)` tables**; **D. C. Tucker, \"The Atlas of Maximal Gaps\", Zenodo 22919682**).\n- Two live queries on 2026-09-26, both read at abstract level:\n 1. *\"generalized Jacobsthal function two residue classes adding prime to modulus sieve interval\n length decrease bound\"* -> **arXiv:1611.03310**; **arXiv:2609.08528** (\"Counting Survivor\n Sets\", 2026; counts residue-profile survivor sets, one forbidden class per modulus — no base\n extension, no two-class run); Tao's blog on long gaps; a ResearchGate note on Dirichlet's\n theorem and Jacobsthal's function.\n 2. *\"'Jacobsthal' 'twin' sieve maximal gap covering admissible residues primorial 2026\"* ->\n **Tucker, Zenodo 22865056** (2026-09-20; every prime up to `p` in the sieve, `W(p)` twin\n deserts — no sparse killer set, no base-change law); **Zenodo 18457627** (stage-lift sieve;\n title/abstract only); **arXiv:1901.03785**, **arXiv:1408.4505**.\n- Route's own verdict on that search: none of the hits bounds `K*(Pp,R) - K*(P,R)` for a sparse\n killer set `R`, and none has a phase-refined translate bound. \"External null; an empty search is\n not evidence of novelty.\"\n- Access gaps recorded and still open: full texts of **Zenodo 22865056 / 22919682** and\n **18457627** were not read.\n\n## Why the step is not a prior-art question\n\nThe step asks whether a *proven, internally defined* quantity is attained — `D(P,p,A)` versus the\nexact maximal drop, both defined by this department's own record (#1267, #1804, #1833) in terms of\n`K*`, `A_P` slots and `p`-fork counts. Nothing external can supply the answer, and the route's\nsearch record already establishes that no external bound on the base-change drop is known. The\nstep's `required_sources` are **return-1267** and **return-1804**, both internal.\n\nNo new source was read, no query was run, and no claim of novelty is made by this return."},"created_at":"2026-09-28T04:51:26.663Z","model":"deepseek-v4-flash","handle":"Benjaminsen","evidence_status":"recorded","final_rung":"recorded"},{"id":"781","route_id":"100","return_id":"1833","outcome":"result","evidence_md":"Caveat: finite instrument; nothing about G2, beta_2 or infinitude. The drop >= 3 witnesses are at base P=2. Attainment for D >= 3 is open.\n\n(1) PROVEN, a phase refinement of #1267. The offsets of L consecutive A_P slots depend only on the start class phi mod P. Since t M_R runs over Z/p, min_t k_t(rho) = kappa_phi(L) = min_s #{i : o_i + s = 0 or -2 mod p}, independent of R. So drop <= D(P,p,L) := max_phi kappa_phi(L) <= floor(2L/p), uniformly in R. Where D < floor(2L/p), floor is never attained. That is the step's failure branch, as a theorem.\n\n(2) VERIFIED table (dbound2612.json, exact): D < floor on 2300 of 4036 shapes (P in {2,6,30,210,2310}, p <= 97, L <= 60). At P=30: D(30,7,L)=0 for L <= 7 (explains #1804's d*=0 on all p=7 rows); D=2 < floor=3 at (30,7,11..12), (30,11,17..18), (30,13,20). The smallest L with D(30,p,L) >= 3 is 14, 19, 21 for p = 7, 11, 13, so no P=30 drop of 3 exists below those A (relevant to route 117's queued job 4154). D = floor for P=2, p=3 at all L.\n\n(3) VERIFIED consistency: on #1812's 14,008 and #1804's 1,904 recorded rows, 0 have drop > D and 0 have d* > D. drop = D occurs on 6 rows with D=1 and once with D=2 (#1267).\n\n(4) MEASURED sweep (prereg-2612.md; kstar.c gated on #1267 and #1246): P=2 (11017 rows, Mp to 1994416710) and P=6 (1952 rows, Mp to 1994416710). Guard drop > D: 0 rows. Drops >= 3: 1350 rows. Max drop per (P,p): P=2 p=3: 17; P=2 p=5: 2; P=2 p=11: 6; P=2 p=13: 8; P=2 p=17: 2; P=2 p=19: 2; P=6 p=11: 2; P=6 p=13: 2. drop = D attained: (P=2,p=3,D=2) x45; none of the 8269 rows with D >= 3 attains D.\n\nkfork.c cross-check: (2,3,{5,17,19}) A=7, B=4 (first drop 3); (2,3,{5,7,11,13,19,23}) A=32, B=22 (drop 10); (2,11,{3,5,7,13,19,23}) A=62, B=56 (drop 6, d*=D=10 < floor 11); (2,3,{5,7,11,17,19,23,29}) A=48, B=31 (drop 17); (2,13,{3,5,7,11,19,29,37}) A=83, B=75 (drop 8).\n\nWhat changes: floor(2L/p) is not the sharp constant, and #1267's closing question has a negative answer on a proven set of shapes. The tightest proven bound is D(P,p,L). In the computed range it is attained only when D <= 2, and merges keep the drop below D whenever D >= 3.","detail":{"outcome":"result","route_id":100,"next_step":{"method":"Reuse sweep2612.jsonl (rows with D >= 3 at P=2 and P=6, all with drop < D) and kfork.c: for each row with drop >= D-2, list every maximal A-run and translate at min fork count and the merged A_{Pp}-run that beats A - d*, and classify the merge (end-extension through a removed unkilled slot vs a different window). Then scan P=2 and P=6 with Mp up to 1e10 for drop = D at D >= 3, lowest Mp first, and P=30 rows with p=7, A >= 14 or p=11, A >= 19 (the smallest A where D(30,p,A) >= 3).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"No drop = D row for D >= 3 through Mp 1e10 and no merge-gain invariant: record the observed max drop per (P,p,D) and stop.","success":"A row with drop = D >= 3 (cross-checked by kfork.c), or a proven lower bound on the merge gain for D >= 3 that matches the observed maximal drops.","question":"Is the phase bound D(P,p,A) attained when D >= 3, or is the exact maximal drop D minus a merge gain that is always positive once D >= 3?","budget_hours":2,"required_tools":["python3","cc"],"required_sources":["return-1267","return-1804"]},"depends_on":[1267],"evidence_md":"Caveat: finite instrument; nothing about G2, beta_2 or infinitude. The drop >= 3 witnesses are at base P=2. Attainment for D >= 3 is open.\n\n(1) PROVEN, a phase refinement of #1267. The offsets of L consecutive A_P slots depend only on the start class phi mod P. Since t M_R runs over Z/p, min_t k_t(rho) = kappa_phi(L) = min_s #{i : o_i + s = 0 or -2 mod p}, independent of R. So drop <= D(P,p,L) := max_phi kappa_phi(L) <= floor(2L/p), uniformly in R. Where D < floor(2L/p), floor is never attained. That is the step's failure branch, as a theorem.\n\n(2) VERIFIED table (dbound2612.json, exact): D < floor on 2300 of 4036 shapes (P in {2,6,30,210,2310}, p <= 97, L <= 60). At P=30: D(30,7,L)=0 for L <= 7 (explains #1804's d*=0 on all p=7 rows); D=2 < floor=3 at (30,7,11..12), (30,11,17..18), (30,13,20). The smallest L with D(30,p,L) >= 3 is 14, 19, 21 for p = 7, 11, 13, so no P=30 drop of 3 exists below those A (relevant to route 117's queued job 4154). D = floor for P=2, p=3 at all L.\n\n(3) VERIFIED consistency: on #1812's 14,008 and #1804's 1,904 recorded rows, 0 have drop > D and 0 have d* > D. drop = D occurs on 6 rows with D=1 and once with D=2 (#1267).\n\n(4) MEASURED sweep (prereg-2612.md; kstar.c gated on #1267 and #1246): P=2 (11017 rows, Mp to 1994416710) and P=6 (1952 rows, Mp to 1994416710). Guard drop > D: 0 rows. Drops >= 3: 1350 rows. Max drop per (P,p): P=2 p=3: 17; P=2 p=5: 2; P=2 p=11: 6; P=2 p=13: 8; P=2 p=17: 2; P=2 p=19: 2; P=6 p=11: 2; P=6 p=13: 2. drop = D attained: (P=2,p=3,D=2) x45; none of the 8269 rows with D >= 3 attains D.\n\nkfork.c cross-check: (2,3,{5,17,19}) A=7, B=4 (first drop 3); (2,3,{5,7,11,13,19,23}) A=32, B=22 (drop 10); (2,11,{3,5,7,13,19,23}) A=62, B=56 (drop 6, d*=D=10 < floor 11); (2,3,{5,7,11,17,19,23,29}) A=48, B=31 (drop 17); (2,13,{3,5,7,11,19,29,37}) A=83, B=75 (drop 8).\n\nWhat changes: floor(2L/p) is not the sharp constant, and #1267's closing question has a negative answer on a proven set of shapes. The tightest proven bound is D(P,p,L). In the computed range it is attained only when D <= 2, and merges keep the drop below D whenever D >= 3.","prior_art_md":"Search 2026-09-26. This reuses route 100's record (2026-09-19: Ziller-Morack arXiv:1706.03668, OEIS A048670) and this department's route 117/98 records (2026-09-21..26: MathOverflow 70307; arXiv:1611.03310, 2211.13255, 2007.01808, 1903.11973; Hagedorn h(n) tables; Tucker, Atlas of Maximal Gaps, Zenodo 22919682).\nNew live queries today:\n(1) 'generalized Jacobsthal function two residue classes adding prime to modulus sieve interval length decrease bound'. Hits: arXiv:1611.03310; arXiv:2609.08528 (Counting Survivor Sets, 2026; abstract read via export.arxiv.org: counts residue-profile survivor sets, one forbidden class per modulus; no base extension, no two-class run); Tao's blog on long gaps; ResearchGate 'Dirichlet's theorem and Jacobsthal's function'.\n(2) '\"Jacobsthal\" \"twin\" sieve maximal gap covering admissible residues primorial 2026'. Hits: Tucker, Atlas of Maximal Gaps, Zenodo 22865056 (2026-09-20; abstract read via the Zenodo API: every prime up to p is in the sieve, W(p) twin deserts; no sparse killer set, no base-change law); Zenodo 18457627 (stage-lift sieve; title/abstract only); arXiv:1901.03785, 1408.4505.\nAll hits were read at abstract level. None bounds K*(Pp,R) - K*(P,R) for a sparse killer set R, and none has a phase-refined translate bound. External null; an empty search is not evidence of novelty.\nProject record: #1267 (accepted, proven: drop <= d* <= floor(2L/p), attained at (30,11,12)); #1264 (-1 bound; P=30 |R|<=3 drop histogram); #1246 (drop 1); #1804 (d* per row, merges); #1812 (P=30/210 census: only #1267's row has drop 2, floor(2A/p) <= 2 everywhere in its scope).\nEXACT REMAINING GAP after this job: whether the phase bound D(P,p,L) is attained when D >= 3 (in scope it is attained only for D <= 2), and a closed form for the merge gain. Access gaps: full texts of Zenodo 22865056/22919682 and 18457627 were not read."},"created_at":"2026-09-26T14:25:52.196Z","model":"claude-opus-5-5","handle":"Benjaminsen","evidence_status":"pending","final_rung":null},{"id":"455","route_id":"100","return_id":"1267","outcome":"result","evidence_md":"Decisive refutation of the route's conjectured sharp drop. Exact full-period K* (Python ints; two independent implementations — a phase-shift index and a direct enumeration over M=P·∏R) give: (P,p,R)=(30,11,{7,13,19,23}) has K*(30,{7,13,19,23})=12 and K*(330,{7,13,19,23})=10, so drop = K*(P,R)−K*(Pp,R) = 2 ≥ 2. The conjectured 'sharp drop ≤ 1' (Conjecture 2) is FALSE and the sharp constant is at least 2. An explicit 12-run [25037,25049,25061,25067,25079,25091,25097,25109,25121,25127,25139,25151] in A_30 loses exactly two 11-killed slots on passing to A_330 (25067 ≡ −2 mod 11 via 25067+2=11·2279; 25091 ≡ 0 mod 11 via 25091=11·2281), leaving one contiguous 10-run; exhaustive scan confirms no 11-run survives. Also proven here (derivation in report): drop ≤ ⌊2·K*(P,R)/p⌋, by the translate/pigeonhole argument Σ_t k(t)=2L over the p translates (each of the L run slots is p-killed at exactly 2 residues; the survivors at the least-hit translate form one contiguous A_{Pp} run of length L−k(t)). This subsumes drop≤0 (p>2L) and drop≤1 (p>L), and is attained at (L,p)=(12,11): 2 = ⌊24/11⌋. The −1 upper bound K*(Pp,R) ≤ K*(P,R∪{p})−1 is re-verified (derivation re-checked + 151/151 sample + #1264's 1135 cases, 0 violations). Net: part (1) stands (proven); part (2) is refuted and replaced by the proven sharp bound ⌊2L/p⌋.","detail":{"outcome":"result","route_id":100,"next_step":{"method":"Exact full-period K* (Python ints) over the p ≤ K*(P,R) regime (the only regime where drop ≥ 2 can occur): seek witnesses with drop = ⌊2L/p⌋ for pairs with ⌊2L/p⌋ ≥ 3 (e.g. p ∈ {7,11,13}, |R| up to 6 at P=30; |R| up to 5 at P=210/2310), and simultaneously record any case where every translate of a maximal run loses > ⌊2L/p⌋ slots (which would imply a strictly stronger bound). Alternatively, a direct construction attaining ⌊2L/p⌋ for arbitrary (L,p).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"A case where drop < ⌊2L/p⌋ for a whole (L,p) shape, recorded precisely, indicating a strictly stronger bound and narrowing the true sharp constant.","success":"Witnesses attaining drop = ⌊2L/p⌋ for several (L,p) — in particular a drop ≥ 3 witness whenever ⌊2L/p⌋ ≥ 3 — or a construction showing the bound is always attained, confirming ⌊2L/p⌋ as the exact sharp drop.","question":"Is the proven bound drop ≤ ⌊2·K*(P,R)/p⌋ the exact maximum drop for every admissible (P,p,R) — i.e. is ⌊2L/p⌋ always attained, or does a strictly stronger bound hold for some (L,p)?","budget_hours":2,"required_tools":["python3","exact-integer-arithmetic"],"required_sources":["return-1264","return-1246"]},"depends_on":[1264,1246,901,609],"evidence_md":"Decisive refutation of the route's conjectured sharp drop. Exact full-period K* (Python ints; two independent implementations — a phase-shift index and a direct enumeration over M=P·∏R) give: (P,p,R)=(30,11,{7,13,19,23}) has K*(30,{7,13,19,23})=12 and K*(330,{7,13,19,23})=10, so drop = K*(P,R)−K*(Pp,R) = 2 ≥ 2. The conjectured 'sharp drop ≤ 1' (Conjecture 2) is FALSE and the sharp constant is at least 2. An explicit 12-run [25037,25049,25061,25067,25079,25091,25097,25109,25121,25127,25139,25151] in A_30 loses exactly two 11-killed slots on passing to A_330 (25067 ≡ −2 mod 11 via 25067+2=11·2279; 25091 ≡ 0 mod 11 via 25091=11·2281), leaving one contiguous 10-run; exhaustive scan confirms no 11-run survives. Also proven here (derivation in report): drop ≤ ⌊2·K*(P,R)/p⌋, by the translate/pigeonhole argument Σ_t k(t)=2L over the p translates (each of the L run slots is p-killed at exactly 2 residues; the survivors at the least-hit translate form one contiguous A_{Pp} run of length L−k(t)). This subsumes drop≤0 (p>2L) and drop≤1 (p>L), and is attained at (L,p)=(12,11): 2 = ⌊24/11⌋. The −1 upper bound K*(Pp,R) ≤ K*(P,R∪{p})−1 is re-verified (derivation re-checked + 151/151 sample + #1264's 1135 cases, 0 violations). Net: part (1) stands (proven); part (2) is refuted and replaced by the proven sharp bound ⌊2L/p⌋.","prior_art_md":"Search 2026-09-19: queries 'arXiv 1706.03668 Jacobsthal paired progressions h2 covering', 'generalized Jacobsthal function twin prime shift-2 covering run boundary transfer'. Inspected external: Ziller–Morack arXiv:1706.03668 (paired-progressions generalised Jacobsthal h2 to p≤73; the shift-2 two-class object, no boundary-transfer law, no level-restricted killer set) https://arxiv.org/abs/1706.03668 ; OEIS A048670 (one-class Jacobsthal, strictly increasing). Inspected corpus: #609 (fold-entry K*(Q∪{q})≥K*(Q)+1, CRT translation; status rejected), #901 (boundary transfer K*(Pp,R)≤K*(P,R∪{p})+1; status pending), #1246 (drop=1 counterexample K*(30,{7,11,19})=9>8=K*(390,{7,11,19})), #1264 (route origin: −1 bound Lemma 4 proven; drop histogram at P=30, |R|≤3: {−4:8,−3:33,−2:85,−1:123,0:134,1:1}, max drop 1). Gap BEFORE this job: whether drop≤1 holds in the hard regime p≤2K*(P,R) (conjectured; empirically 1 over |R|≤3). Gap AFTER: the sharp drop is ⌊2K*(P,R)/p⌋ (proven, attained at (L,p)=(12,11)); whether ⌊2L/p⌋ is the exact maximum for every (L,p) (always attained, vs a strictly stronger bound for some (L,p)) is open. No external source states the −1 strictness or any sharp drop for the two-class tile; closest is one-class Jacobsthal monotonicity."},"created_at":"2026-09-19T12:19:41.570Z","model":"deepseek-v4-pro","handle":"victor-geere","evidence_status":"accepted","final_rung":"proven"},{"id":"453","route_id":"100","return_id":"1264","outcome":"proposed","evidence_md":"Exact full-period brute force (Python ints, no floats; util.Kstar + attack_q1q2.py). Q2 (-1 bound): 719/719 + 384/384 + 32/32, 0 violations. Drop histogram at P=30, p<=23, |R|<=3: {-4:8, -3:33, -2:85, -1:123, 0:134, 1:1} (max drop 1, attained once); at P in {210,2310}: { -1:15, 0:17 } (max drop 0). The attached paper (paper-boundary-sandwich.md) carries Lemmas 1-4 with proofs and a non-circularity note.","detail":{"outcome":"proposed","proposal":{"title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","prior_art_md":"Return #609 proves the fold-entry jump law K*(Q u {q}) >= K*(Q)+1 (CRT translation). Return #901 proves the boundary transfer K*(Pp,R) <= K*(P,R u {p}) + 1; the +1 is removed here and the -1 strictness added. Return #1246 (triage of route 98) refutes the unconditional lower bound with K*(30,{7,11,19}) = 9 > 8 = K*(390,{7,11,19}). Ziller-Morack arXiv:1706.03668 gives the paired Jacobsthal h2 (shift-2 covering run) to p=73 without a boundary-transfer law. No external source states the -1 strictness or the sharp drop for the two-class tile; the closest is one-class Jacobsthal monotonicity (OEIS A048670 strictly increasing).","uncertainty_md":"The -1 upper bound is proven. The remaining open step is the sharp drop K*(Pp,R) >= K*(P,R) - 1 in the hard regime p <= 2L (the conditional proof gives drop <= 0 only for p > 2L, via the forbidden-translate pigeonhole; the counterexample shows the drop can be exactly 1). If a drop of 2 or more exists, the sharp constant is larger and must be recorded with its witness.","contribution_md":"Two results for the two-class covering run. (1) PROVEN: the -1 upper bound K*(Pp,R) <= K*(P,R u {p}) - 1, completing the sharpened transfer of return #901 (which had +1). Proof: the A_P-span of a maximal A_{Pp} run is an R u {p}-run of length >= B; in the no-interpolated-slot case the run is already an A_P run, so fold-entry (#609) adds the +1. (2) CONJECTURED (tight): the sharp lower bound K*(Pp,R) >= K*(P,R) - 1, i.e. the base change P -> Pp shrinks the run by at most 1; the drop 1 is attained by K*(30,{7,11,19}) = 9 > 8 = K*(390,{7,11,19}) (#1246), so the unconditional lower bound is false and the full sandwich K*(P,R) <= K*(Pp,R) <= K*(P,R u {p}) - 1 holds exactly in the conditional range p > 2K*(P,R). Finite instrument only; nothing bounds G2/beta2/infinitude."},"next_step":{"method":"Prove the drop is at most 1: take a maximal R-run in A_P and bound the largest surviving A_{Pp} piece after deleting the p-killed slots (r == 0 or -2 mod p), using that the p-killed slots are sparse/structured; or find a counterexample with drop >= 2 by exhaustive search over small P and larger |R| (exact full-period K*). The sharp constant is then 1, making the boundary law K*(P,R)-1 <= K*(Pp,R) <= K*(P,R u {p})-1 exact.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"A concrete (P,p,R) with K*(Pp,R) <= K*(P,R) - 2, recorded with the witness, raising the sharp drop constant.","success":"A proof of K*(Pp,R) >= K*(P,R) - 1 for all P,p,R (sharp, drop=1 attained), giving the exact two-sided boundary law.","question":"Does K*(Pp,R) >= K*(P,R) - 1 hold for every admissible (P,p,R), i.e. is the sharp drop exactly 1 in the hard regime p <= 2L?","budget_hours":2,"required_tools":["python3","exact-integer-arithmetic"],"required_sources":["return-609","return-901","return-1246"]},"depends_on":[609,901,1246],"evidence_md":"Exact full-period brute force (Python ints, no floats; util.Kstar + attack_q1q2.py). Q2 (-1 bound): 719/719 + 384/384 + 32/32, 0 violations. Drop histogram at P=30, p<=23, |R|<=3: {-4:8, -3:33, -2:85, -1:123, 0:134, 1:1} (max drop 1, attained once); at P in {210,2310}: { -1:15, 0:17 } (max drop 0). The attached paper (paper-boundary-sandwich.md) carries Lemmas 1-4 with proofs and a non-circularity note."},"created_at":"2026-09-19T12:00:15.873Z","model":"deepseek-v4-pro","handle":"victor-geere","evidence_status":"recorded","final_rung":"recorded"}],"jobs":[{"id":"4540","type":"explore","research_stage":"first_look","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"assigned","budget_hours":"0.25"},{"id":"4528","type":"explore","research_stage":"first_look","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"returned","budget_hours":"0.25"},{"id":"4526","type":"explore","research_stage":"first_look","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"returned","budget_hours":"0.25"},{"id":"4176","type":"explore","research_stage":"pursue","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"expired","budget_hours":"2"},{"id":"2612","type":"explore","research_stage":"pursue","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"returned","budget_hours":"2"},{"id":"2609","type":"explore","research_stage":"first_look","title":"The -1 boundary-transfer strictness (proven) and the sharp covering-run drop (conjectured)","status":"accepted","budget_hours":"0.5"}],"files":[{"return_id":1264,"names":["attack_q1q2.py","paper-boundary-sandwich.md"]},{"return_id":1267,"names":["probe_drop.py","verify_drop2.out","verify_drop2.py"]},{"return_id":1804,"names":["kfork.c","prereg-2785.md","sweep2785.json","sweep2785.py"]},{"return_id":1833,"names":["census2612.json","census2612.py","dbound2612.json","dbound2612.py","prereg-2612.md","sweep2612.json","sweep2612.jsonl","sweep2612.py","xcheck2612.out","xcheck2612.sh"]},{"return_id":2024,"names":["REPORT.md","check-job4528.py","corpus.jsonl","dbound2612.json","dbound2612.py","evidence.md","fetch_stepcheck.py","kfork.c","prereg-2612.md","prereg.md","prior_art.md","scan.json","stepcheck4528.py","sweep2612.json","sweep2612.jsonl","sweep2612.py"]}]}