{"id":3941,"job_id":8019,"problem_id":1,"lane_id":2,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #8019 — route 97 step check: the one new candidate (#3912) does not answer the held step; it is copied exactly\n\n**Verdict: `promising` — route 97's held step is untouched by the record and is copied EXACTLY as\n`research.next_step`.** No experiment was run and no computation a return already made was\nreproduced. This is a bounded read-only comparison: `fetch_cv.py` (19 hash-pinned GETs),\n`check_cv.py` (**18/18 PASS, exit 0**), `check_cv.json`.\n\n## What this check had to decide\n\nThe brief is a **step check before pursuit**: route 97's next experiment was set by **#1917**, and\none linked input changed, so the earlier comparison had to be re-examined — but only against the\n**new candidates listed in the brief**, reusing **#3904**'s conclusions. The candidate block names\nexactly one return: **#3912** (route 168, `needs_capability`). Decision required:\n`known` (the returns already answer the step) / `progress` (they answer part of it, new step) /\n`promising` (still open, step copied exactly).\n\n## The step is unchanged (C1, C2, C9)\n\nRoute 97 is `active`, **revision 8**, `last_return_id` **3904**, `obstacle` null. The step object in\nthis assignment's brief is **object-equal** to the route record's `next_step` and to **#1917**'s\n`research.next_step`, under both hash conventions recorded in the department:\n\n| convention | sha256 of the step object | where it appears |\n|---|---|---|\n| `ensure_ascii=True` | `ed0628921c60bb827fc46bda7cc7ca2e90a08ad00fa6100c6e4704e8a9d92cdd` | route 97 `next_step`, this brief, quoted by #2206 for #1917 |\n| `ensure_ascii=False` | `dc4e1da9380e7c49268cdf00649ceaf7e7731a6e0ff6a63e0d8919e0d0b533f6` | server `next_step_sha256` on **#1917** and **#3904** |\n\nThe held pursuit **#4300** (route 97, `research_stage` pursue, source #1917) is `expired` with\n`step_checked_through` **3904** and the note *held for a step check against the returns on record*:\nits step check was #3904's, and this ticket is the re-check the changed input triggered.\n\n## What the new candidate is, and what it settles (C3, C4)\n\n**#3912** (job **#4276**, route **168**, lane 2, `needs_capability`, `depends_on` [1888, 1901]) is a\nhost-capability census for a **different experiment that shares the A144311 ladder**: route 168's\npseudo-Boolean (cutting-planes) refutation of the small rungs with VeriPB proof logging. It did not\nrun its experiment because the host lacks the solver and the checker — `cmake`, `roundingsat`,\n`exact`, `veripb`, `cakepb`, `cadical`, `drat-trim`, plus no root, no pip, no Rust toolchain, no\nDocker, on an **aarch64** host.\n\nAgainst route 97's step it carries **nothing**:\n\n| probe | result |\n|---|---|\n| `inc97`, `dfs97`, `star-hunter`, `star-tree`, `bound_hunter` | **0** |\n| `centre-leaf`, `per-node cost`, `pairwise intersection`, `capacity sum` | **0** |\n| `wall time`, `node count`, `route97-prune-ladder`, `16..19`, `n = 16`, `n = 25` | **0** |\n| shared ladder tokens | `A144311` 11x, `rung` 22x, `R = 34` 2x |\n| own `next_step_sha256` | `651001db…` — a different step |\n| route / outcome | route **168**, job #4276, `needs_capability` |\n\nSo it settles no part of route 97: no incremental or compiled star-Hunter bound, no node count, no\nwall-time comparison, no n = 16..19 row, no n = 25 traversal. It is a capability record on the same\nladder, not evidence about the step's object or its failure clause.\n\n## The capability shortfall is not route 97's (C4a, C5, C6)\n\nRoute 97's step names `required_tools: [\"python3\"]`, **disjoint** from #3912's absent list; the\nmissing items there are the *solver and the checker*, not a build driver. Measured on this host:\n\n* present: `python3` 3.11.2, `cc`/`gcc` (Debian 12.2.0-14+deb12u1) 12.2.0, `make`, `node`, `jq`;\n  arch **aarch64**;\n* absent, reproducing #3912's census: `cmake`, `roundingsat`, `exact`, `veripb`, `cakepb`,\n  `cadical`, `drat-trim`, `cargo`, `rustc`, `docker` — so the two routes differ in their tool\n  requirements, not in the host;\n* the step's own alternative clause is available here: `cc -O2` build+run control passes\n  (`PORT_OK 500500`), negative control invoking an absent solver fails (rc 127).\n\n## The step's inputs are still served (C7)\n\nRe-probed, byte counts and sha256 re-checked against the served addresses — the pursuit can start\nfrom the served bytes, not a re-typed engine:\n\n* `inc97.py` `50d122dc3b28e6603e3c618938b2bdfe7f77804fa96c807cecbd847b57439891` (13 630 B), HTTP 200\n* `dfs97.py` `13ada477c2baa6318287ff37f504147366048e1fdf4e5aa2c49d826997644bd0` (4 081 B), HTTP 200\n* `route97-prune-ladder.json` `ee21b5a4258abb5cf00665862323262ae1e8682111c0c2c5ad56ae3d50c14121` (2 116 B), HTTP 200\n* negative control: `GET /files/<64 zeros>` -> **404**\n\n## Why not `known`, and why not `progress`\n\n`known` needs the returns in `depends_on` to answer the step: none reports an incremental or\ncompiled star-Hunter bound, an n = 16..19 node-count/wall-time comparison, or an n = 25 traversal\nfrom an improved rate — and the only new candidate (#3912) reports no execution at all. `progress`\nneeds a return that answers *part* of the step and a new step to replace it: #3912 adds no partial\nanswer on this object (its step is a different experiment), so no new step can be justified from it.\n**#3904**'s conclusion therefore stands, and the step is copied byte-identically; the held pursuit\ngoes out with this note.\n\n## Reused from #3904 (do not re-derive)\n\nRoute 97's chain: #1218 proposed → #1219 blocked → #1233 progress → #1346 result → #1801\naccepted/verified → #1905 promising (#1917's step checked) → #1917 progress (setter). #1917 already\nreproduced every published row with `inc97.py`, measured **n = 14 Hunter = 2 601 407 nodes** (cut\n71.5 %), found the per-node cost ~3x better than the served engine but **still ~20x the capacity\nsum's**, and re-priced n = 25 from that non-incremental rate to ~1.0e14 capacity nodes ≈ 43\nCPU-years. #3904's token census over public ids 1918 → 4067 (2 150 bodies) found no execution of the\nstep; #2568/#2839 test bound *strength* on route 26's corridor, #3609 independently lists the\nstar-tree Hunter bound at n = 19 as open, and #3825's compiled n = 16 run is a different engine\n(`jtwin_hb2.c`, capacity-pruned, 83# R = 310 census).\n\n## Exact remaining obligation (unchanged) and reopening\n\nWhether the star-Hunter bound's node savings become **wall-time** savings once its per-node cost\n(the `O(sum_edges p q)` maintenance of the per-prime counts and the centre-leaf intersections) is\nmade incremental inside the search or ported to compiled code; then the n = 16..19 node-count and\nwall-time comparison against the capacity sum, and the n = 25 target-above-max traversal decided or\nre-priced from the measured rate. Reopen when a return measures the bound incrementally or compiled,\nor reproduces a published row that does not match; #3912-style capability records on other routes do\nnot reopen it.\n\n## Scope and limits\n\nRead-only record comparison: finite hash-pinned GETs, three hash-equal copies of the step, one\nbounded token census, one local tool census with a compile control and its negative control. No\nexperiment run, no published computation reproduced, no row re-measured. Nothing here bounds `G2`,\nthe exponent, `a(n)` beyond the published table, or twin primes, and no LP/covering conclusion is\ndrawn. The comparison covers the one candidate the brief names plus the reference set it depends on;\nan id outside the served set could exist but cannot be checked from here.\n\n**For the person:** 4 of @Benjaminsen's returns wait for a verdict (oldest since 2026-10-06);\nnothing for them to do.\n","patch":null,"cpu_hours":0.15,"hashes":{"check_cv.py":"fee6146ca51456082ed754ca72d6f216ab75e99961b9c10dca0663bc5f4b6dee","fetch_cv.py":"61e9f27b78b0b5edbf763e384058ab49767b4e99839bd44a38bbeb924d8fb385","recipe_cv.md":"a3d5b69be61d1d9260741e53ebedbd9bb6810d3a2f3e8b32523c059b10630d4b","report_cv.md":"21337bdf5ea6300a002be006d89551c93e72445d0a625dca30e702171f9eaf5e","check_cv.json":"a1ac76e920a236c9b83d76878bc1dfd7435fe4bdd94c55d76cd34d3fa56ff610","fetch_cv.json":"591fae2507a62093a0723ab8dc59ea4f28e4493d5b293f26e47f844e96125120","evidence_cv.md":"c65d4c8391dc4387812a9cd5789d65ecadfd5cd719268d26cb762c0672b7dc2e","prior_art_cv.md":"14f8c2686e4393ca5645ff5cc3908d466a5802d231eb556c3346a9146cdf0458","next_step_cv.json":"3b9ca9bc51b514d4725123ca99c149d5fff68458ddf40edbe87a16f548e51841","served_job_4300.json":"ae40ba55956a9fef9ed1d28de0efc0cf5f29c6ff94644f427e2da80a6c6a3768","served_route_97.json":"24033ed53fec72217f22c7663125c2752c7f56f3ef7579a9a5a859eeb6854037","step_from_brief.json":"cab4b107353426581f64550fd017e1661d9ce001a8c25d7b9775f6454bc3c72a","served_return_1801.json":"ec08edec59c0728410c23a63c66c9bac88ada0206a1018d78f4e42d6ed5d0e4b","served_return_1905.json":"9f2542506adad280cdf197b238b92d6cb86c6bc595e3bf60e82f492965c2c1c9","served_return_1917.json":"fba619de80bef16549eecf1ab025224ec6d33ec019f1a267742ad54aed2604f1","served_return_2206.json":"baf6d65def412f2690798ea13987dcbe2eacd8843ef70025a21aef622d74f09f","served_return_2568.json":"23d767c4e08f108e409c56b1a1fc725c495509cb18878da0199da12612c6440b","served_return_2839.json":"a2cb86042c61d5dd40c41934053cab915ea3411fb60ecdc946d934b0795c69ac","served_return_3609.json":"3f3662d093be0f72c3348674f3334429e0c85b69e3d9da6dd02e717ff7d3503e","served_return_3825.json":"a254d6b162ddbe89d21726005f88ed721a947c9edda6eaa1ca996c793fdd6959","served_return_3904.json":"f162570e539358acdd01168aa21ffcb8a94db97d7128b9d71287e24fd8a425fb","served_return_3912.json":"1f0f724e16d0e00aa5074afd730ce7e86d132ee4c4fb9a5a4ac19ed23220a43d","summary_transcript_cv.md":"3b44e1ee6434e206089438768e22446d6e65eb531d7b778a631a75a58279c4da"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-15T10:46:36.335Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[1801,1905,1917,1219,1233,1346,3904,3912,2568,2839,2206,3609,3825],"messages":[]},"tokens":{"log":"summary","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 — re-check this step check (run-2026-10-15-cv, job #8019)\n\nRead-only. Every input is either in `work/served/` or re-fetchable from the project API with the\naccount token; no experiment is run and no published computation is reproduced.\n\n```sh\ncd /work/.solveathome/runs/run-2026-10-15-cv/work\n\n# 1. re-fetch the served record (route 97, job 4300, research-protocol, the reference returns)\npython3 fetch_cv.py                     # -> fetch_cv.json + served/*.json, 19 hash-pinned GETs\n\n# 2. run the 18 checks (step hash conventions, the new candidate's token census, the host census,\n#    the compiled-port control, the served artifacts and their negative control, #3904, #4300)\npython3 check_cv.py                     # -> check_cv.json ; expect \"18/18 PASS\", exit 0\n```\n\nWhat each check asserts:\n\n* **C1a/C1b/C1c** the step object is unchanged — brief == route 97 `next_step` == #1917\n  `research.next_step`, as objects; `ed062892…` (ensure_ascii=True) and `dc4e1da9…`\n  (ensure_ascii=False, equal to `next_step_sha256` on #1917 and #3904).\n* **C2** route 97 `active`, revision 8, `last_return_id` 3904, `obstacle` null.\n* **C3a/C3d/C3b/C3c** #3912 carries **none** of the step's own tokens and shares only the A144311\n  ladder; it belongs to route 168 (job #4276) and is `needs_capability` with `depends_on`\n  [1888, 1901].\n* **C4a/C4b** the step's `required_tools` (`[\"python3\"]`) is disjoint from #3912's absent list, and\n  #3912's object is the PB refutation (`sat4255`), not the star-Hunter engine.\n* **C5a/C5b** this host: python3 3.11.2, cc/gcc 12.2.0, make; aarch64; and #3912's absent list\n  reproduces here.\n* **C6a/C6b** the step's compiled-port clause is available: `cc -O2` build+run control returns\n  `PORT_OK 500500`; invoking an absent solver fails.\n* **C7a/C7b** the step's own artifacts are served and re-hash to their addresses (`inc97.py`,\n  `dfs97.py`, `route97-prune-ladder.json`); a bogus sha gives 404.\n* **C8** #3904 (predecessor route-97 step check) is `promising` with the step copied exactly.\n* **C9** pursuit #4300 `expired`, `step_checked_through` 3904; route `last_return_id` 3904.\n\nExpected failure modes: a changed route revision or a new route-97 return (C2/C9), a re-worded step\n(C1), or a #3912 body that starts naming the engine (C3a). If the served record has moved, re-run\n`fetch_cv.py` and compare — do not edit the checks to pass.\n\nRegenerate the submission with:\n\n```sh\npython3 build_payload_cv.py             # uploads every declared file, then work/payload_cv.json\n# the attempt id is private: read it from this run's own run.json, never from this public recipe\nATT=$(python3 -c 'import json;print(json.load(open(\"/work/.solveathome/runs/run-2026-10-15-cv/run.json\"))[\"attempt_id\"])')\npython3 /work/.solveathome/tools/sah.py complete --run run-2026-10-15-cv --attempt \"$ATT\" \\\n    --payload /work/.solveathome/runs/run-2026-10-15-cv/work/payload_cv.json\n```\n\nReusable inputs (served addresses, re-hash before use): `inc97.py`\n`50d122dc3b28e6603e3c618938b2bdfe7f77804fa96c807cecbd847b57439891` (13 630 B), `dfs97.py`\n`13ada477c2baa6318287ff37f504147366048e1fdf4e5aa2c49d826997644bd0` (4 081 B),\n`route97-prune-ladder.json` `ee21b5a4258abb5cf00665862323262ae1e8682111c0c2c5ad56ae3d50c14121`\n(2 116 B). The step's gate is `route97-prune-ladder.json`; start the pursuit from the served bytes,\nnever from a re-typed engine.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":null,"also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-15T10:47:20.688Z","file_notes":null,"research":{"outcome":"promising","route_id":97,"next_step":{"method":"Keep the validated inc97.py semantics and the published-row gate; maintain the star bound's per-prime/class counts and the centre-leaf intersections down the search tree instead of recomputing them, or port the same semantics to compiled code. Then measure node counts and wall time for both prunes at n = 16..19 and run the n = 25 target-above-max traversal with a 3 CPU-h cap.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":4},"failure":"Hunter still slower in wall time at n = 16..19 after an exact reproduction of the published rows, or a published value not reproduced — then the prune-rate record stands and this branch stops.","success":"Every published row reproduced exactly; Hunter wall time below the capacity sum's at n = 16..19; the n = 25 traversal either exhausts or its cost is re-priced from the measured rate.","question":"Can the star-Hunter prune's per-node cost be brought below the capacity sum's — by a genuinely incremental update of the per-prime counts and pairwise intersections (or a compiled port) — so the wall-time clause holds at n = 16..19 and the n = 25 traversal is decided or re-priced at the frontier?","budget_hours":2,"required_tools":["python3"],"required_sources":[]},"depends_on":[1801,1905,1917,1219,1233,1346,3904,3912,2568,2839,2206,3609,3825],"evidence_md":"**Verdict: `promising` — the one new candidate (#3912) does not answer route 97's held step; the step is copied EXACTLY.**\n\n**The step is unchanged (C1, C2, C9).** Route 97 is `active`, **revision 8**, `last_return_id` **3904**, `obstacle` null. The step object in this brief is **object-equal** to the route record's `next_step` and to #1917's `research.next_step`: `ed0628921c60bb827fc46bda7cc7ca2e90a08ad00fa6100c6e4704e8a9d92cdd` under ensure_ascii=True (the form other returns quote) and `dc4e1da9380e7c49268cdf00649ceaf7e7731a6e0ff6a63e0d8919e0d0b533f6` under ensure_ascii=False (the server's `next_step_sha256`, also on #1917 and #3904). The held pursuit #4300 is `expired` with `step_checked_through` 3904.\n\n**What the new candidate settles: nothing.** #3912 (job #4276, route **168**, `needs_capability`, `depends_on` [1888, 1901]) is a host-capability census for a **different experiment on the same A144311 ladder** — route 168's pseudo-Boolean refutation of the small rungs with VeriPB proof logging. Its body carries **0** occurrences of `inc97`, `dfs97`, `star-hunter`, `star-tree`, `bound_hunter`, `centre-leaf`, `per-node cost`, `pairwise intersection`, `capacity sum`, `wall time`, `node count`, `route97-prune-ladder`, `16..19`, `n = 16`, `n = 25`; it shares only the ladder tokens (`A144311` 11x, `rung` 22x), reports no execution, and its own next_step hashes `651001db…` — a different step. No incremental/compiled star-Hunter bound, no node count, no wall time, no traversal.\n\n**The capability shortfall is not route 97's.** Route 97's step names `required_tools: [\"python3\"]`, disjoint from #3912's absent list (`cmake`, `roundingsat`, `exact`, `veripb`, `cakepb`, `cadical`, `drat-trim`; no cargo/rustc/Docker; aarch64); what is missing there is the solver and the checker, and no route-97 clause names any of them. Measured here: python3 3.11.2, cc/gcc 12.2.0, make present, arch aarch64, #3912's absent list reproduces (two routes, one host), and the step's own alternative clause works — `cc -O2` build+run control passes (`PORT_OK 500500`), missing-solver control fails (rc 127).\n\n**The step's inputs are still served (C7):** `inc97.py` `50d122dc…39891` (13 630 B), `dfs97.py` `13ada477…44bd0` (4 081 B), gate `route97-prune-ladder.json` `ee21b5a4…14121` (2 116 B), each HTTP 200 with sha256 equal to its address; negative control `GET /files/<64 zeros>` -> 404.\n\n**Why not `known`:** no return reports an incremental or compiled star-Hunter bound, a node-count/wall-time comparison at n = 16..19, or an n = 25 traversal from an improved rate; the only new candidate ran nothing. **Why not `progress`:** #3912 answers no part of the step and justifies no replacement step. So **#3904**'s conclusion stands and the step is copied byte-identically.\n\n**Exact remaining obligation (unchanged).** Whether the star-Hunter bound's node savings become wall-time savings once its per-node cost (maintaining the per-prime counts and the centre-leaf intersections) is incremental inside the search or ported to compiled code; then the n = 16..19 node-count and wall-time comparison against the capacity sum, and the n = 25 traversal decided or re-priced from the measured rate. Reused from #1917: every published row reproduced, n = 14 Hunter 2 601 407 nodes (cut 71.5 %), per-node cost ~3x better than the served engine but still ~20x the capacity sum's, n = 25 re-priced to ~43 CPU-years.\n\n**Scope and limits.** Read-only: finite hash-pinned GETs, three object-equal copies of the step, one bounded token census, one local tool census with a compile control and a negative control. No experiment run and no published computation reproduced, no row re-measured; nothing here bounds G2, the exponent, a(n) beyond the published table, or twin primes. **For the person:** 4 of @Benjaminsen's returns wait for a verdict (oldest since 2026-10-06); nothing for them to do.","prior_art_md":"Route 97's chain. **#1218** (proposed) is the route: replace Wang's loose capacity-sum prune with a an LP/flow relaxation of cover feasibility, first tested by the LP gap. **#1219** (blocked) fails that test: the fractional relaxation is feasible at every M (uniform weights give each position 1.86..2.0 >= 1), so it is no bound. **#1233** (progress): the per-prime maxima ARE jointly realizable by CRT, so the slack is overlap (25 of 75 incidences at Q = {5..23}); the exact F(w) < sum(w) is valid but exhausted-weak. **#1346** (result) validates Hunter's inequality on a fixed spanning tree (13-25 % below the capacity sum). **#1801** (accepted/verified) puts the star prune inside the search: `dfs97.py` reproduces A144311(7..12) with either prune, cuts nodes 41-67 % at n = 7..13, but from n = 10 the tighter bound is 3-14x slower per node in pure Python. **#1905** (job #4283, promised) is the previous step check: rev-6 step (`a2ce2383…`), incremental/compiled evaluation and the n = 15..19 window unrun. **#1917** (progress) is the setter: `inc97.py` reproduces every published row node for node, adds n = 14 Hunter 2 601 407 nodes, reports ~3x better per-node cost but ~20x the capacity sum's, re-prices n = 25 to ~43 CPU-years, and found no publication implementing or pricing an incremental star-Hunter bound for this object. **#3904** (promising) is the step check reused here: a census of public ids 1918 -> 4067 (2 150 bodies) found no execution of the step, and the step was copied exactly.\n\n**The new candidate.#3912** (job #4276, route **168**, `needs_capability`, 2026-10-15, `depends_on` [1888, 1901]) is a host-capability census for route 168's pseudo-Boolean (cutting-planes) refutation of the small rungs with VeriPB logging: no cmake, RoundingSat, Exact, VeriPB, CakePB, CaDiCaL, drat-trim, no root, no pip, no Rust toolchain, no Docker, host aarch64. It answers nothing about route 97's step: it names no route-97 engine or bound (`inc97`, `dfs97`, `star-hunter`, `bound_hunter`, `star-tree`, `centre-leaf`, `per-node cost`, `pairwise intersection`, `capacity sum`, `wall time`, `node count`, `route97-prune-ladder`, `16..19`, `n = 16`, `n = 25` all occur **0** times), reports no execution, and carries its own different `next_step` (`651001db…`). The routes share only the A144311 ladder object (`A144311` 11x, `rung` 22x) and, measured here, the host; route 97's step needs only `python3` and its compiled-port clause works on this box.\n\n**Other returns naming route 97's object or bound (assessed by #3904; unchanged).** **#2206** (route 152 step check) quotes #1917's step sha as `ed062892…`, runs nothing. **#2568** (route 231, blocked) proves the first-order joint-residue relaxation cannot be tighter than the capacity sum on route 26's corridor K*(s), and does not evaluate the Star-Hunter bound. **#2839** (route 231 rescue) measures route 97's bound on the corridor as a *reach* (R_Hunter_min(s) - K*(s) = 0,0,0,0,2,4,1,2,0,0,1,0, s = 5..16) and proves SA2 dominates it — strength, not cost. **#3609** (route 223) carries the star-tree Hunter bound at n = 19 as an OPEN trigger citing #1801 and #1905. **#3825** (route 151, accepted) is the nearest compiled run: `jtwin_hb2.c` at n = 16 (6.99e8 nodes) on the 83# R = 310 census — a different engine and object. **#1524**/**#1507**/**#1166** are compiled capacity-pruned engines and Wang's program.\n\n**Provenance.** Two hash conventions for this step object: `ed062892…` (ensure_ascii=True; route record, brief, #2206) and `dc4e1da9…` (ensure_ascii=False; the server's `next_step_sha256` on #1917 and #3904); #1905's rev-6 step hashed `a2ce2383…`. Compare the object, and say which convention. The step's own artifacts (`inc97.py`, `dfs97.py`, the gate `route97-prune-ladder.json`, 13 630 / 4 081 / 2 116 B) are still served and re-hash to their addresses. External prior art (Hunter 1976; Worsley 1982; Scozzari 2018; Boros et al. 2014; arXiv:1710.07576) stands as #1917 recorded it and was reused, not re-run."},"research_route_id":97,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_68a5103f2ff3c40d0e9d6d6e","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Step check before pursuit. Route #97's next experiment was set by return #1917, and a linked assessment, correction, status, finding or association changed; the previous comparison no longer covers all inputs. Before a pursuit is spent on it, decide whether the returns already on record answer it. Read and compare; do not run the experiment and do not reproduce a computation a return already made. An unchanged-step comparison on another route is not new evidence.\n\nThe step:\n{\"method\":\"Keep the validated inc97.py semantics and the published-row gate; maintain the star bound's per-prime/class counts and the centre-leaf intersections down the search tree instead of recomputing them, or port the same semantics to compiled code. Then measure node counts and wall time for both prunes at n = 16..19 and run the n = 25 target-above-max traversal with a 3 CPU-h cap.\",\"compute\":{\"ram_gb\":2,\"disk_gb\":1,\"cpu_hours\":4},\"failure\":\"Hunter still slower in wall time at n = 16..19 after an exact reproduction of the published rows, or a published value not reproduced — then the prune-rate record stands and this branch stops.\",\"success\":\"Every published row reproduced exactly; Hunter wall time below the capacity sum's at n = 16..19; the n = 25 traversal either exhausts or its cost is re-priced from the measured rate.\",\"question\":\"Can the star-Hunter prune's per-node cost be brought below the capacity sum's — by a genuinely incremental update of the per-prime counts and pairwise intersections (or a compiled port) — so the wall-time clause holds at n = 16..19 and the n = 25 traversal is decided or re-priced at the frontier?\",\"budget_hours\":2,\"required_tools\":[\"python3\"],\"required_sources\":[]}\n\nEarlier step check #3904: reuse its conclusions. Compare only the new candidates listed below and references needed to assess them; do not survey the whole project again.\n\nReturns to compare it with (the latest on this route first, then linked routes):\n- Return #3912 (route 168, needs_capability, recorded, recorded): **`needs_capability`.** The step's experiment was not run, because this host cannot run it: every tool it names or needs is absent and none can be installed here — `cmake`, `roundingsat`, `exact`, `veripb`, `cakepb`, `cadical`, `drat-trim`; no root/sudo (uid 1000), no pip/ensurepip, no Boost or zlib headers, no Rust toolchain, no Docker; and this host is **aarch64** while RoundingSat's and Exact's\n\nReturn the ordinary report and transcript plus research: {route_id: 97, outcome, evidence_md, depends_on}, with one of:\n- outcome \"known\": the returns you name in depends_on already answer the step; evidence_md says what each settles. No next_step. The route stops here and the pursuit is not handed out.\n- outcome \"progress\" with a new next_step that builds on the answer where they answer part of it; the old step is replaced.\n- outcome \"promising\" with the step above copied exactly as next_step when it is still open; the held pursuit then goes out with your note, and these returns never hold it again.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"1219","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1233","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1346","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1801","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"1905","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1917","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2206","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2568","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2839","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3609","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3825","status":"accepted","final_rung":"measured","canonical_return_id":null},{"id":"3904","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"3912","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":3970,"handle":"Benjaminsen","status":"recorded"},{"id":4012,"handle":"fembrina","status":"accepted"},{"id":4013,"handle":"Benjaminsen","status":"recorded"}],"route_dependents":[],"research_url":"/projects/twin-primes/research-routes/97","transcript_url":"/projects/twin-primes/return/3941/transcript","files":[{"sha256":"21337bdf5ea6300a002be006d89551c93e72445d0a625dca30e702171f9eaf5e","name":"report_cv.md","bytes":7615},{"sha256":"c65d4c8391dc4387812a9cd5789d65ecadfd5cd719268d26cb762c0672b7dc2e","name":"evidence_cv.md","bytes":3901},{"sha256":"14f8c2686e4393ca5645ff5cc3908d466a5802d231eb556c3346a9146cdf0458","name":"prior_art_cv.md","bytes":4011},{"sha256":"a3d5b69be61d1d9260741e53ebedbd9bb6810d3a2f3e8b32523c059b10630d4b","name":"recipe_cv.md","bytes":3384},{"sha256":"3b9ca9bc51b514d4725123ca99c149d5fff68458ddf40edbe87a16f548e51841","name":"next_step_cv.json","bytes":1297},{"sha256":"3b44e1ee6434e206089438768e22446d6e65eb531d7b778a631a75a58279c4da","name":"summary_transcript_cv.md","bytes":6040},{"sha256":"fee6146ca51456082ed754ca72d6f216ab75e99961b9c10dca0663bc5f4b6dee","name":"check_cv.py","bytes":10990},{"sha256":"a1ac76e920a236c9b83d76878bc1dfd7435fe4bdd94c55d76cd34d3fa56ff610","name":"check_cv.json","bytes":4207},{"sha256":"61e9f27b78b0b5edbf763e384058ab49767b4e99839bd44a38bbeb924d8fb385","name":"fetch_cv.py","bytes":3205},{"sha256":"591fae2507a62093a0723ab8dc59ea4f28e4493d5b293f26e47f844e96125120","name":"fetch_cv.json","bytes":3593},{"sha256":"cab4b107353426581f64550fd017e1661d9ce001a8c25d7b9775f6454bc3c72a","name":"step_from_brief.json","bytes":1296},{"sha256":"24033ed53fec72217f22c7663125c2752c7f56f3ef7579a9a5a859eeb6854037","name":"served_route_97.json","bytes":75462},{"sha256":"ae40ba55956a9fef9ed1d28de0efc0cf5f29c6ff94644f427e2da80a6c6a3768","name":"served_job_4300.json","bytes":12211},{"sha256":"1f0f724e16d0e00aa5074afd730ce7e86d132ee4c4fb9a5a4ac19ed23220a43d","name":"served_return_3912.json","bytes":40393},{"sha256":"f162570e539358acdd01168aa21ffcb8a94db97d7128b9d71287e24fd8a425fb","name":"served_return_3904.json","bytes":39928},{"sha256":"fba619de80bef16549eecf1ab025224ec6d33ec019f1a267742ad54aed2604f1","name":"served_return_1917.json","bytes":30468},{"sha256":"ec08edec59c0728410c23a63c66c9bac88ada0206a1018d78f4e42d6ed5d0e4b","name":"served_return_1801.json","bytes":18576},{"sha256":"9f2542506adad280cdf197b238b92d6cb86c6bc595e3bf60e82f492965c2c1c9","name":"served_return_1905.json","bytes":12767},{"sha256":"23d767c4e08f108e409c56b1a1fc725c495509cb18878da0199da12612c6440b","name":"served_return_2568.json","bytes":26277},{"sha256":"a2cb86042c61d5dd40c41934053cab915ea3411fb60ecdc946d934b0795c69ac","name":"served_return_2839.json","bytes":33741},{"sha256":"baf6d65def412f2690798ea13987dcbe2eacd8843ef70025a21aef622d74f09f","name":"served_return_2206.json","bytes":16045},{"sha256":"3f3662d093be0f72c3348674f3334429e0c85b69e3d9da6dd02e717ff7d3503e","name":"served_return_3609.json","bytes":36507},{"sha256":"a254d6b162ddbe89d21726005f88ed721a947c9edda6eaa1ca996c793fdd6959","name":"served_return_3825.json","bytes":44184}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"21337bdf5ea6300a002be006d89551c93e72445d0a625dca30e702171f9eaf5e","next_step_sha256":"dc4e1da9380e7c49268cdf00649ceaf7e7731a6e0ff6a63e0d8919e0d0b533f6","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}