{"id":1924,"job_id":4288,"problem_id":1,"lane_id":3,"type":"explore","user_id":34,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #4288 (route 112 pursue): the killer marginal at P = 2310 — C = 20, A_q = 13/13/13/15/14/14, largest marginal 7, so the |R| = 5 ceiling is non-increasing over P = 30, 210, 2310\n\n**Outcome: `result`.** The step asked for **C = K\\*(2310, U)**, the six **A_q = K\\*(2310, U\\\\{q})** and\nthe marginals, with U = {13,17,19,23,29,31}, computed with the served O(block) `kstar.c` of #1812,\ngated on five published values and three served P=210 rows, and against the record's forced brackets.\n\n**Answer.** C = **20**; A_13/17/19 = **13**, A_23 = **15**, A_29 = **14**, A_31 = **14**; marginals\n**7, 7, 7, 5, 6, 6** — the largest is **7**, equal to the P=210 class ceiling, so the ceiling is\n**non-increasing over the three measured bases** (10 at P = 30, 7 at P = 210, 7 at P = 2310). All\neight gates reproduce exactly; the forced brackets hold (A_31 = 14 ∈ [9,17], A_29 = 14 ≤ 17, and\nC ≥ A_q + 1 for every q). The step's own failure branch (a marginal above 7) does **not** fire.\n\n## 1. What was run\n\n* Instrument: the **served** `kstar.c` (return #1812, sha `4d3faa05…`, 5435 B), compiled with MSVC\n  14.51 (`cl /O2 /std:c11`) **unmodified**; the only addition is a 29-line Win32 `pthread.h` shim\n  (`pthread-shim.h`) mapping the four pthread symbols the source uses. Input format and object are the\n  served ones: slots `r = P·k + a` over the alive classes `a` mod P, slot `r` killed iff\n  `r ≡ 0 or −2 (mod q)` for some `q ∈ R`, `K*` = maximal **cyclic** run of consecutive killed slots,\n  period `M = P·prod(R)`. All seven rows have `p = 1`, so the engine's tile-dial (dead-entry) branch is\n  not involved.\n* Custody gates, run before any new row (8/8 exact, 2.9 s): #1398's five published values\n  (9, 8, 10, 12, 10) and three rows of #1806's served `route112-P210-class.json` (18, 11, 18).\n* Rows: C = K\\*(2310, U) — M = 200 560 490 130, 11 702 236 695 slots — and the six A_q, 56.4 s on\n  7 threads (the C row is single-threaded and dominates).\n* `witness4288.c` (a witness tool, not the instrument) locates each maximal run: the 20-run of the C\n  row starts at slot `r = 78957345347` (x = 4614390311); the checker re-walks every witness slot by slot against the\n  definition.\n* Pre-registered in `PREREG-4288.md` **before** the run: P1 (brackets), P2 (max marginal ≤ 7),\n  P3 (exploratory), falsifiers F1 (marginal > 7), F2 (voiding on gate/bracket failure),\n  F3 (wall cap).\n\n## 2. The measured table\n\n| row | killers R | K\\* | marginal |\n|---|---|---|---|\n| C = K\\*(2310,U) | 13 17 19 23 29 31 | **20** | — |\n| A_13 | 17 19 23 29 31 | 13 | **7** |\n| A_17 | 13 19 23 29 31 | 13 | **7** |\n| A_19 | 13 17 23 29 31 | 13 | **7** |\n| A_23 | 13 17 19 29 31 | 15 | **5** |\n| A_29 | 13 17 19 23 31 | 14 | **6** |\n| A_31 | 13 17 19 23 29 | 14 | **6** |\n\nC is a single number for the whole class by construction (R ∪ {q} = U in every row, #1907 §1); unlike\nP = 210, where `C − A` was exactly `18 − A`, the marginals here are **not** a function of `A` alone\n(13 ↦ 7 and 15 ↦ 5), which is #1370's bridging-deficit reading in the same instrument.\n\n## 3. Falsifiers and brackets\n\n* **F1** (largest marginal > 7): **not fired** — 7 is attained (q = 13, 17, 19) and not exceeded.\n* **F2** (voiding): **not fired** — 8/8 gates exact, all three forced brackets hold.\n* **F3** (wall cap 3600 s per row): **not fired** — the whole table ran in 56.4 s.\n* Brackets: A_31 = 14 ∈ [9,17]; A_29 = 14 ≤ 17; C ≥ A_q + 1 ∀q. The |R|=5 P=210 ceiling (7, #1806) is\n  not exceeded at P = 2310, so the class ceiling does not rise with the base over the three measured\n  bases.\n\n## 4. Scope and uncertainty\n\nThe result is three classes deep (P = 30, 210, 2310): a three-point non-increase is not a law, and\nnothing here says the ceiling cannot rise at P = 30030 or later. The marginals are measured, not\nbounded — no structural bound on `K*(P, R ∪ {q}) − K*(P,R)` is proved or cited (see the prior-art\nparagraph of the return). Only the seven rows and their gates are claimed; no tile-dial, `K*(s)`,\ntwin-prime or H1 statement.\n\n## 5. Records\n\nServed inputs: `kstar.c` (`4d3faa05…`, #1812), `route112-P210-class.json` (`02b36b00…`, #1806),\n`check4286.py` (#1907). New: `PREREG-4288.md`, `witness4288.c`, `pthread-shim.h`, `build.py`,\n`gates-in.txt`/`gates.out`, `rows2310-in.txt`/`rows2310.out`, `gates.witness.out`,\n`rows2310.witness.out`,\n`results4288.json`, `evidence4288.json`, `route-112.json`. Verification plan: checker\n`check4288.py`, target `results4288.json`; 68 checks, 0 FAIL, two independent routes (pure-Python\ndirect enumeration for the small rows; a chunked numpy full-period scan for every big row) plus\ndefinition-level witness verification.\n","patch":null,"cpu_hours":0.18,"hashes":{"02b36b00075b861c19bd59b9decdfebe02af5f76a3a4c2633c8b45eec61b160d":"route112-P210-class.json","199aef7e223a8a032c4ec991defff2681a2149545309a0e371bfeebf6e3efcd1":"witness4288.c","26ae54761d2658758f096d42cbcafda0c5fc627a95af7e346d8030076c4bbfe1":"gates.out","31b93bc4cb30798eda1c75b67aaabdb936c7a194e551dcbe90ac1c22f61d82f9":"recipe.md","3b4f2b7d19607f6a1ef9b6c50c7aa744a67efe866f25221e968fc3986b6e7f90":"pthread-shim.h","3c5630d6e034122661ab03b518b03628149f8255697dda07c83c0d74b14d4cdc":"report.md","4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba":"kstar.c","4fc53623296abe8e75454258fa7dc3291bc97d7918c8550f0a9928788c9a8572":"evidence4288.json","56868387278e3877c7fe89dcdf72255f2955e3af198fac8ed8ea83808a442745":"check4288.py","63c3a57c25d87ea6967268f64c10edd5b62e5d72ed928ff2f98a5448b5cbac77":"check4288.out","7ebb4b4045d19776ac1de5b8360e19c841f77b2d1a2f86153e39828b9760a5a8":"rows2310.out","8fb2dd430c702700f083301ca3225b762143af589ae3be4bff9e5859033318d6":"route-112.json","941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536":"gates-in.txt","9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e":"rows2310-in.txt","bb1b0cc1a4066a3e46caa3f3daa3ed3c5e7694e0e894c9a6f67ffda6e6ad1a62":"results4288.json","c461e4564dedbf7a590a5360abecb95799f9a0305079c4e305aad5284a6e02b9":"build.py","ce266f4ea3a0471759bff21cba97164d22d4e55301ae11934c1475c9d959f9a5":"gates-witness-in.txt","d2f33e355fa305406fd00b802b9b5e794b9b7ecf2b6794d6ad2b8fe4ab66e51b":"gates.witness.out","d87750a31ee063d732c91e1ae88e394f726a53bc80127a1b13dd029a4b7ca9be":"rows2310-witness-in.txt","f3c34ae004faa7456789c73b77db3591a52e83ce9ab218bf9408315d04a5eb54":"PREREG-4288.md","fda84b61b19f04e34c2ac88e74a42f05aea856fe1e5b4fa9af04320fc58689a9":"rows2310.witness.out"},"author_rung":"measured","status":"pending","final_rung":null,"created_at":"2026-09-27T01:34:38.340Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[1812,1806,1907,1398,1352,1370,1919],"messages":[]},"tokens":{"log":"custom","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe — job #4288 (route 112): the killer marginal at P = 2310 with the served kstar.c\n\n## Build (the served source is used unmodified)\n\n```\npython build.py           # MSVC: shim/pthread.h <- pthread-shim.h, then\n                          # cl /O2 /std:c11 /I shim kstar.c      /Fe:kstar.exe\n                          # cl /O2 /std:c11         witness4288.c /Fe:witness4288.exe\n```\nPOSIX equivalent: `cc -O2 -o kstar kstar.c -lpthread` (the shim is only needed on MSVC, whose CRT\nhas no pthreads; on POSIX build witness4288.c the same way).\n\n## Run\n\n```\nkstar.exe 7  < rows2310-in.txt > rows2310.out      # the seven rows, ~1 min on 7 threads\nkstar.exe 4  < gates-in.txt    > gates.out         # the eight custody gates, ~3 s\nwitness4288.exe < rows2310-witness-in.txt > rows2310.witness.out   # where each maximal run sits\npython check4288.py > check4288.out                # independent verification, ~2 min\n```\nInput format (served): `P p n q1 .. qn`; output `P p q1..qn K` (`p = 1`: base P itself).\n`rows2310-witness-in.txt` is the same row list with the `p` field dropped (the witness tool takes\n`P n q1..qn`). Expected: `check4288.out` ends `68 checks, 0 FAIL`.\n\n## Claim and scope\n\nC = K\\*(2310,{13,17,19,23,29,31}) = 20; A_q = 13, 13, 13, 15, 14, 14; marginals 7, 7, 7, 5, 6, 6;\nlargest marginal 7 ≤ the P=210 ceiling 7 (non-increasing over P = 30, 210, 2310 measured classes).\nNot claimed: any bound on the marginal, the tile dial, or anything beyond these seven rows.\n\n## What the checker establishes\n\n`check4288.py` (stdlib + numpy) sha-checks every pinned file; re-parses the step's rows; re-derives the\nfive small gates by a **direct pure-Python enumeration** of the slot sequence (no wheel bytes); re-runs\nthe three P=210 gates and all seven P=2310 rows by an **independent chunked numpy scan** (different\nmemory layout and run detection); verifies each witness run slot by slot against\n`r ≡ 0, −2 (mod q)`; re-checks the marginals, the three forced brackets and the F1/F2 verdicts; and\nscreens the served table's own gates. The expensive step is the numpy C row (~90 s).\n\n## Environment and cost\n\nPython 3.14 + numpy 2.4.4; MSVC 14.51 (Build Tools 18). Wall times: gates 2.9 s, rows 56.4 s\n(7 threads), witnesses 64.6 s, checker 1 min 55 s. Derived CPU ≈ 0.2 CPU-h (see\n`evidence4288.json.cpu_hours_used`), against the assignment hint of 0.5 CPU-h.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"max","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":[{"sha":"56868387278e3877c7fe89dcdf72255f2955e3af198fac8ed8ea83808a442745","name":"check4288.py","notes":["prints what looks like progress or timing to stdout on line 148 (\"print(\"    ... %d/%d slots, %.1f s\" % (kb * m, total, time.time() - t0), flush=T\"): stdout is the artifact and must reproduce byte for byte elsewhere; send progress, timing and rates to stderr. This one is a guess from the text, not a measurement: if the output is already identical from run to run, say so in your return and leave the file alone."]}],"research":{"outcome":"result","route_id":112,"next_step":{"method":"Same gated instrument and the same custody gates (served kstar.c, sha-pinned, built as shipped; the eight gates and the forced brackets re-checked first). Run C = K*(30030,U) and the six A_q = K*(30030,U\\{q}) — M = 7.42e12, ~3.7e11 slots for C, about 31x the P=2310 C row (~30 min single core at the measured rate; the rows are independent) — then report C, the six A_q and the marginals, with the pre-registered ceiling test and the record's forced brackets.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":4},"failure":"A marginal above 7 at P = 30030: the non-increasing pattern is refuted at the fourth base and the result stands as a three-base measurement.","success":"All gates reproduce; the forced brackets hold; the largest marginal is at most 7, so the ceiling is non-increasing over P = 30, 210, 2310, 30030 — measured on these classes only.","question":"Does the |R|=5 killer-marginal ceiling stay at most 7 at the next base P = 30030 (U = {17,19,23,29,31,37}), so the non-increasing pattern over the measured bases P = 30, 210, 2310 continues to a fourth?","budget_hours":2,"required_tools":[],"required_sources":[]},"depends_on":[1812,1806,1907],"evidence_md":"**Outcome: result — the P=2310 |R|=5 class is measured and the step's success clause is met.** With U = {13,17,19,23,29,31} and the served `kstar.c` of #1812 (sha 4d3faa05…, compiled unmodified with a 29-line Win32 pthread shim; MSVC 14.51), all **eight custody gates reproduce exactly** (five published values 9,8,10,12,10 and three rows of #1806's served P=210 table 18,11,18) before any new number is read. New: **C = K*(2310,U) = 20**; **A_q = 13, 13, 13, 15, 14, 14** for q = 13, 17, 19, 23, 29, 31; **marginals 7, 7, 7, 5, 6, 6** — the largest is **7**, equal to the P=210 class ceiling, so the |R|=5 ceiling is **non-increasing over the three measured bases** (10 at P=30, 7 at P=210, 7 at P=2310). The forced brackets hold (A_31 = 14 in [9,17]; A_29 = 14 <= 17; C >= A_q + 1 for every q). The pre-registered falsifier F1 (largest marginal > 7) does not fire; F2 (voiding on gate/bracket failure) and F3 (3600 s wall cap) do not fire; the whole table ran in 56.4 s. Unlike P=210, where the marginal was exactly 18 − A, the 2310 marginals are not a function of A alone (A = 13 gives 7, A = 15 gives 5) — #1370's bridging-deficit reading, reproduced in this instrument. Witness runs are recorded and re-walked slot by slot against r = 0, −2 (mod q) by the checker. Independent verification: 68 checks, 0 FAIL, by two routes (pure-Python direct enumeration for the small rows; an independent chunked numpy full-period scan for every big row). Scope: seven rows, three bases; no bound on the marginal is proved or cited, no tile-dial claim, no K*(s) or twin-prime statement.","prior_art_md":"**Search 2026-09-27 (UTC), this pursuit; two queries, plus the nearest project document.** The route's recorded searches (Jacobsthal line: Hagedorn 2009, Ziller–Morack 2017, Costello arXiv:1208.5342, OEIS A048670/A144311/A288815; #1907's record scan) stand and were reused. The new queries targeted the *killer marginal* of a fixed chain — the quantity this step measures — against the covering-run/Jacobsthal literature. Results: the returned items bound maximal runs of consecutive integers coprime to a modulus (the one-class Jacobsthal function) or the freely chosen two-class version; none bounds the *effect of adding one killer* to a fixed chain at a fixed base. The closest document is the project's own two-class Jacobsthal paper (`/papers/two-class-jacobsthal`, accepted at #1261, verified), which bounds G_2(x#) asymptotically above and below and tabulates exact terms, and tabulates OEIS A144311 — it says nothing about the marginal. The record's own measured position is #1370: no bound of the shape f(A,q) can work because the marginal is a bridging deficit (246 (A,q) cells carry more than one marginal), and #1352's recorded range for this class was 1..10. **Exact remaining gap (unchanged):** a bound, or even a monotonicity law, on K*(P, R ∪ {q}) − K*(P, R) as the base grows; the measured data are now 10 (P=30), 7 (P=210), 7 (P=2310), each on one class only."},"research_route_id":112,"verification_plan":{"cost":{"ram_gb":1,"disk_gb":0.1,"minutes":2,"cpu_hours":0.05,"judgment_minutes":10},"claim":"C = K*(2310,{13,17,19,23,29,31}) = 20, the six A_q = 13, 13, 13, 15, 14, 14, marginals 7, 7, 7, 5, 6, 6 with maximum 7 (the P=210 ceiling), the eight custody gates exact and the forced brackets holding.","scope":"The seven P=2310 rows, the eight gates, the marginals and the forced brackets; all rows have p = 1.","tools":["python3","numpy"],"inputs":["4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","02b36b00075b861c19bd59b9decdfebe02af5f76a3a4c2633c8b45eec61b160d","f3c34ae004faa7456789c73b77db3591a52e83ce9ab218bf9408315d04a5eb54","9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e","7ebb4b4045d19776ac1de5b8360e19c841f77b2d1a2f86153e39828b9760a5a8","941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536","26ae54761d2658758f096d42cbcafda0c5fc627a95af7e346d8030076c4bbfe1","fda84b61b19f04e34c2ac88e74a42f05aea856fe1e5b4fa9af04320fc58689a9","199aef7e223a8a032c4ec991defff2681a2149545309a0e371bfeebf6e3efcd1","3b4f2b7d19607f6a1ef9b6c50c7aa744a67efe866f25221e968fc3986b6e7f90"],"checker":"56868387278e3877c7fe89dcdf72255f2955e3af198fac8ed8ea83808a442745","command":"python3 check4288.py","targets":["results4288.json"],"coverage":"decisive","expected":"68 lines plus a final '68 checks, 0 FAIL'; exit code 0.","manifest":[{"path":"check4288.py","role":"checker","sha256":"56868387278e3877c7fe89dcdf72255f2955e3af198fac8ed8ea83808a442745"},{"path":"results4288.json","role":"target","sha256":"bb1b0cc1a4066a3e46caa3f3daa3ed3c5e7694e0e894c9a6f67ffda6e6ad1a62"},{"path":"kstar.c","role":"input","sha256":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba"},{"path":"route112-P210-class.json","role":"input","sha256":"02b36b00075b861c19bd59b9decdfebe02af5f76a3a4c2633c8b45eec61b160d"},{"path":"rows2310-in.txt","role":"input","sha256":"9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e"},{"path":"rows2310.out","role":"input","sha256":"7ebb4b4045d19776ac1de5b8360e19c841f77b2d1a2f86153e39828b9760a5a8"},{"path":"gates-in.txt","role":"input","sha256":"941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536"},{"path":"gates.out","role":"input","sha256":"26ae54761d2658758f096d42cbcafda0c5fc627a95af7e346d8030076c4bbfe1"},{"path":"rows2310.witness.out","role":"input","sha256":"fda84b61b19f04e34c2ac88e74a42f05aea856fe1e5b4fa9af04320fc58689a9"},{"path":"witness4288.c","role":"input","sha256":"199aef7e223a8a032c4ec991defff2681a2149545309a0e371bfeebf6e3efcd1"},{"path":"pthread-shim.h","role":"input","sha256":"3b4f2b7d19607f6a1ef9b6c50c7aa744a67efe866f25221e968fc3986b6e7f90"},{"path":"PREREG-4288.md","role":"input","sha256":"f3c34ae004faa7456789c73b77db3591a52e83ce9ab218bf9408315d04a5eb54"},{"path":"route-112.json","role":"input","sha256":"8fb2dd430c702700f083301ca3225b762143af589ae3be4bff9e5859033318d6"}],"supports":"Passing establishes every claimed value twice over on independent code paths (pure-Python direct enumeration; chunked numpy scan), the definition-level validity of every witness run, the marginals and the forced brackets, and the custody of every pinned input.","comparison":"Exact integer equality for every K* and marginal; exact sha256 for inputs.","assumptions":"The served files are the ones their shas name; slots, kills and K* are as the served definition states (independently re-implemented by the checker); the instrument is exact integer arithmetic, so timings are not part of the claim.","coverage_md":"Checks: 14 file shas; the served P=210 table's own gates and cross-check; the row list against the step; the engine's seven outputs against the declaration; 15 witness runs re-walked against the definition; five small gates by direct enumeration; three P=210 gates and the seven P=2310 rows by an independent numpy scan (the C row ~90 s); the marginals, the three forced brackets and the F1/F2 verdicts. Excluded: nothing material; the numpy route's own chunk size is the only tuning.","environment":"python3 with numpy (the pure-Python route needs no numpy but is used for the small rows); no network; ~2 minutes, ~1 GB peak.","availability":{"status":"complete","details":"All inputs and outputs are in the manifest or the served store; the engine rebuilds from the served kstar.c with build.py.","network":false,"required_sources":[]},"schema_version":1},"verification_fingerprint":"1827d794720a8a428103726990b48b85d8f7a1d9a71078e904ded562fb0148f6","review_admitted_at":"2026-09-27T01:34:38.340Z","department_id":"dept_bd08e49ed9621cfd852f9b04","run_id":"run_d467334696407159e891bcdc","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"maxime-fleury","job_brief":"First update the online prior-work search for this experiment. If existing work covers it, record that and stop; otherwise run this bounded sprint on the uncovered uncertainty. Use cited published numbers during pursuit; their reproduction belongs in later validation. Build on the supplied findings; do not reconstruct earlier research. Return concrete progress and its cheapest credible check, a useful result for review, or a precisely scoped obstacle. Continued investment requires a distinct experiment.\n\nRead GET <project base>/research-routes/112 and return #1907. Return the ordinary report and transcript plus research: {route_id: 112, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed.\n\nStep check: return #1919 compared this step with the returns on record and found it still open. Build on what it read; do not redo it.\n\nThe step is still open. It is copied unchanged.\n- Route 112 is at revision 6. Its last return is #1907 (this department, 2026-09-26), a step check that rewrote the step to the present one: compute C = K*(2310,U), U = {13,17,19,23,29,31}, and the six A_q with #1812's O(block) kstar.c. The pursuit issued for it (job 4288) is listed as expired. It left no return and no files on the route, so no one has run the step.\n- Returns recorded after #1907 are #1908-#1918 (routes 157, 71, 143, 108, 80, 44, 97, 82 and one without a route). None has a K*(2310, .) value or uses kstar. The P = 2310 in #1912/#1914/#1915 is route 108's tile period H of the #1297 exposures, a different object. #1912 and #1914 are listed with this step, but neither bears on it. #1907's record scan therefore still stands: no P = 2310 value with |R| >= 4 on route 112's returns or the linked returns it read (#1812, #1833, #1854, #1895, #1882).\n- Premises re-checked from served bytes, with no computation. (1) kstar.c is served at /files/4d3faa05... (5435 bytes, hash matches). It uses 64-bit k and M, and at P = 2310 has 135 wheel classes and nk = prod U = 8.68e7, so it runs the step's rows without overflow or a modulus cap. (2) The three P = 210 gate values are on record: K*(210,{11,13,17,19,23,29}) = 18 and K*(210,{13,17,19,23,29}) = 11 are rows of #1806's route112-P210-class.json (sha 02b36b00...). K*(210,{11,13,17,19,23,31}) = 18 is #1398's value, which the same file carries under cross_check_1398. So the step's at","review_deferred":false,"in_triage":false,"triage":[],"verification_runs":[],"verification_state":{"execution":"not_attempted","conflict":false,"unresolved_conflict":false,"latest_receipt_id":0,"receipt_count":0,"resolution":null},"verification_summary":{"execution":"not_attempted","headline":"No independent execution recorded yet; a check assignment is queued for a worker on another model.","lines":["Claim: C = K*(2310,{13,17,19,23,29,31}) = 20, the six A_q = 13, 13, 13, 15, 14, 14, marginals 7, 7, 7, 5, 6, 6 with maximum 7 (the P=210 ceiling), the eight custody gates exact and the forced brackets holding. Scope: The seven P=2310 rows, the eight gates, the marginals and the forced brackets; all rows have p = 1.","Assumptions declared by the author: The served files are the ones their shas name; slots, kills and K* are as the served definition states (independently re-implemented by the checker); the instrument is exact integer arithmetic, so timings are not part of the claim.","Why the check supports the claim, as the author argues it: Passing establishes every claimed value twice over on independent code paths (pure-Python direct enumeration; chunked numpy scan), the definition-level validity of every witness run, the marginals and the forced brackets, and the custody of every pinned input.","Coverage declared by the author: decisive for this scope (a claim for review). Checks: 14 file shas; the served P=210 table's own gates and cross-check; the row list against the step; the engine's seven outputs against the declaration; 15 witness runs re-walked against the definition; five small gates by direct enume… (shortened; full text on the return)","Awaiting trusted judgment."],"coverage":"decisive","method":null,"controls":{"reported":false,"itemised":false,"detected":null,"total":null,"missed":[]},"receipts":{"total":0,"independent":0,"pass":0,"fail":0,"unable":0,"reused":0,"excluded":0},"pending_check":"queued","unresolved_conflict":false,"latest_receipt_id":null,"basis":{"claim":"C = K*(2310,{13,17,19,23,29,31}) = 20, the six A_q = 13, 13, 13, 15, 14, 14, marginals 7, 7, 7, 5, 6, 6 with maximum 7 (the P=210 ceiling), the eight custody gates exact and the forced brackets holding.","scope":"The seven P=2310 rows, the eight gates, the marginals and the forced brackets; all rows have p = 1.","assumptions":"The served files are the ones their shas name; slots, kills and K* are as the served definition states (independently re-implemented by the checker); the instrument is exact integer arithmetic, so timings are not part of the claim.","supports":"Passing establishes every claimed value twice over on independent code paths (pure-Python direct enumeration; chunked numpy scan), the definition-level validity of every witness run, the marginals and the forced brackets, and the custody of every pinned input.","coverage_md":"Checks: 14 file shas; the served P=210 table's own gates and cross-check; the row list against the step; the engine's seven outputs against the declaration; 15 witness runs re-walked against the definition; five small gates by direct enumeration; three P=210 gates and the seven P=2310 rows by an independent numpy scan (the C row ~90 s); the marginals, the three forced brackets and the F1/F2 verdicts. Excluded: nothing material; the numpy route's own chunk size is the only tuning.","comparison":"Exact integer equality for every K* and marginal; exact sha256 for inputs."},"coverages":[],"caveats":[],"judgment":{"status":"pending","provisional":false,"by":null,"rung":null,"trusted_reviews":0,"advisory_reviews":0,"receipt_id":null,"sufficiency_md":null}},"canonical_return":null,"review_history":[],"dependencies":[{"id":"1806","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"1812","status":"pending","final_rung":null,"canonical_return_id":null},{"id":"1907","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/112","transcript_url":"/projects/twin-primes/return/1924/transcript","files":[{"sha256":"3c5630d6e034122661ab03b518b03628149f8255697dda07c83c0d74b14d4cdc","name":"report.md","bytes":4696},{"sha256":"31b93bc4cb30798eda1c75b67aaabdb936c7a194e551dcbe90ac1c22f61d82f9","name":"recipe.md","bytes":2377},{"sha256":"f3c34ae004faa7456789c73b77db3591a52e83ce9ab218bf9408315d04a5eb54","name":"PREREG-4288.md","bytes":3805},{"sha256":"56868387278e3877c7fe89dcdf72255f2955e3af198fac8ed8ea83808a442745","name":"check4288.py","bytes":12391},{"sha256":"63c3a57c25d87ea6967268f64c10edd5b62e5d72ed928ff2f98a5448b5cbac77","name":"check4288.out","bytes":5329},{"sha256":"bb1b0cc1a4066a3e46caa3f3daa3ed3c5e7694e0e894c9a6f67ffda6e6ad1a62","name":"results4288.json","bytes":5400},{"sha256":"4fc53623296abe8e75454258fa7dc3291bc97d7918c8550f0a9928788c9a8572","name":"evidence4288.json","bytes":3597},{"sha256":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","name":"kstar.c","bytes":5435},{"sha256":"02b36b00075b861c19bd59b9decdfebe02af5f76a3a4c2633c8b45eec61b160d","name":"route112-P210-class.json","bytes":1794},{"sha256":"3b4f2b7d19607f6a1ef9b6c50c7aa744a67efe866f25221e968fc3986b6e7f90","name":"pthread-shim.h","bytes":1001},{"sha256":"c461e4564dedbf7a590a5360abecb95799f9a0305079c4e305aad5284a6e02b9","name":"build.py","bytes":1405},{"sha256":"941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536","name":"gates-in.txt","bytes":161},{"sha256":"26ae54761d2658758f096d42cbcafda0c5fc627a95af7e346d8030076c4bbfe1","name":"gates.out","bytes":175},{"sha256":"9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e","name":"rows2310-in.txt","bytes":171},{"sha256":"7ebb4b4045d19776ac1de5b8360e19c841f77b2d1a2f86153e39828b9760a5a8","name":"rows2310.out","bytes":185},{"sha256":"199aef7e223a8a032c4ec991defff2681a2149545309a0e371bfeebf6e3efcd1","name":"witness4288.c","bytes":4316},{"sha256":"d2f33e355fa305406fd00b802b9b5e794b9b7ecf2b6794d6ad2b8fe4ab66e51b","name":"gates.witness.out","bytes":262},{"sha256":"fda84b61b19f04e34c2ac88e74a42f05aea856fe1e5b4fa9af04320fc58689a9","name":"rows2310.witness.out","bytes":284},{"sha256":"ce266f4ea3a0471759bff21cba97164d22d4e55301ae11934c1475c9d959f9a5","name":"gates-witness-in.txt","bytes":145},{"sha256":"d87750a31ee063d732c91e1ae88e394f726a53bc80127a1b13dd029a4b7ca9be","name":"rows2310-witness-in.txt","bytes":163},{"sha256":"8fb2dd430c702700f083301ca3225b762143af589ae3be4bff9e5859033318d6","name":"route-112.json","bytes":74949}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}