{"id":1147,"job_id":2105,"problem_id":1,"lane_id":4,"type":"explore","user_id":17,"model":"claude-fable-5-1","provider":"anthropic","report_md":"# Job #2105 (pursue route 90): the route's two named experiments run to completion with the corrected engine. The exact repair at K = 5 on the widest single-hole window [227,2296) (R = 2069) is EXHAUSTED: 188,192,450 nodes over the 49 root branches, no solution, no cap touched (a complete negative, 35 min on 12 processes). The sound randomised repair drives the bar window from 9 holes to a floor of 5, never to 0. No witness: a(25) ≥ 2027 stands and the base-10 floor is unchanged\n\n**Outcome: blocked (scoped, measured obstruction): the shallow-repair branch is closed to depth 5 on its best target, the many-move regime floors at 5 holes, and no witness exists in either; the route's own failure branch, with the numbers it asked for.**\n\n## 1. Instrument and anchor\n\n`repair90c.py` (#1137, the per-offset-count engine that replaced the XOR-mask one) on the served n = 25 state (state-n25.json = the tuple of check-2043.out.json, sha 0d77773d…). One change for parallelism: `repair90c-split.py` adds `--root r`, which restricts the depth-0 candidate list (the 49 moves covering the window's single hole) to its r-th entry; nothing else is touched. Anchor: holes_at_start = 1 on [227,2296) (R = 2069); K = 1 exhaustive, 1035 moves, min_holes 1, no solution (as #1137). Split validation at K = 3: all 49 roots exhausted, node total 106178 = #1137's unsplit 106130 + 48 (the depth-0 node is counted once per root), so the split enumerates the same tree.\n\n## 2. Experiment (a): exact repair at K = 5 on the widest single-hole window\n\nAll 49 root branches (the 49 moves covering the single hole) run to exhaustion at K = 5 with node cap 2*10^8 and wall cap 7000 s per root, 12 processes in parallel: per root 3,833,597 to 4,179,794 nodes (364 to 496 s), total **188,192,450 nodes**, `all_exhausted` true, no solution. The route priced this at 4575122*43 = 1.97*10^8 nodes and about 1.9 h single-process; measured 1.88*10^8 nodes and 2088 s wall on 12 processes. So **no reassignment of at most five primes covers [227,2296)**: the widest single-hole target, worth +42 on the record, is closed at depth 5, extending #1121/#1137's depth-4 negatives by one level at the uniform branching 49, 47, 45, 43, 41.\n\n## 3. Experiment (b): the sound randomised repair on the bar window [17,2489)\n\n`minconf2105.py` imports the corrected engine's coverage class, so the semantics are #1137's; every candidate move is scored by a full count update (no incremental mask), min-conflicts with tabu tenure 6 and restarts from the best state after 400 non-improving steps. Three seeds, 600 s each:\n\n| seed | steps | restarts | best holes | recomputed from scratch | visits at the best |\n|---|---|---|---|---|---|\n| 1 | 366,242 | 912 | 6 | 6 | 330 |\n| 2 | 362,600 | 903 | **5** | 5 | 121 |\n| 3 | 353,840 | 882 | **5** | 5 | 258 |\n\nThe hole count spends most of its time at 12–16 (mode 14) and reaches 5 only in a thin tail; nothing reached 4. So the number the route asked for is **5**: with many sound moves the bar window can be driven from 9 to 5 holes, one better than the unsound record's 6 and two better than the exact depth-2 value 7, and no chain found here approaches zero. The best states are attached (minconf-bar-seed*.json) for anyone who wants to start an exact repair from a 5-hole state instead of the 9-hole record.\n\n## 4. Bonus: the public exact program in records mode\n\nWang's A144311 program (the instrument route 73 certified in #995), unchanged apart from a per-n main, run for 90 min each at n = 23, 24, 25 in its own record-improving order: the best records printed were 1187 at n = 23 (1961 s), 1211 at n = 24 (1657 s), 1289 at n = 25 (1556 s), all below the constructive record 2027 and far below the bar 2454. That order is lexicographic in the small primes' residues and is not a witness search; it is reported only to say that a straight run of the public program does not reach the constructive record 2027 in this time either, as #995's cost slope predicts.\n\n## 5. What this changes for route 90\n\n- The shallow-repair branch is now measured to its ceiling on the widest single-hole target: K = 5 exhausted on [227,2296), so a chain of at least 6 reassignments is needed even for the +42 target, and the bar (nine holes on [17,2489)) needs a chain the exact search cannot reach at the uniform branching (K = 6 is about 7.7*10^9 nodes, about 1.4 days on 12 processes at this rate; K = 9 is out of reach).\n- The many-move regime is priced: floor 5 holes on the bar window in 10 min per seed; the route's \"one hole per reassignment\" reading holds only for the first two moves, after which the landscape is flat at 12–16 holes with rare excursions to 5.\n- Nothing here produces a witness, so a(25) ≥ 2027 (from #1098) stands, the floor ln(30/11) stands, and (H-sub-pow)'s base-10 instance is undecided. The exact program's cost (#995: ≈ 5.4·10³ CPU-h at n = 25) remains the only complete route to the value.\n\nRungs: §1–§2 MEASURED, and the K = 5 verdict is a COMPLETE negative (all 49 roots exhausted, no cap touched); §3 MEASURED (the floor is a property of this search, not of the state: a better search could go lower); §4 MEASURED. Not claimed: any maximality, any value of a(25), anything about the conjecture. Files: repair90c-split.diff.txt, k5-split-summary.json, k5-root00..48.json, k1b.json, minconf2105.py, minconf-bar-seed1..3.json, records-n23/24/25.txt.\n","patch":null,"cpu_hours":0.8,"hashes":{"k1b.json":"c158c453613527774881db94c06e542390be21bc4d990c3fc568763743500e0f","k5-root00.json":"d7cb2c10478ba1e4a8bacffa94f7bd22d303287788b12481dbd5f2ae24214a64","k5-root01.json":"a50d5ebaccbb0f308fee6d826d308e017a48e3c895a658f85ea78fd6bb71b183","k5-root02.json":"8e740a98e09a9134f697cd3c8635e542dcbac28089e27753c5ff5f6442c106e7","k5-root03.json":"a6c24c49278910c506e05db9723cf3554c8c6d09dbb10b57ff7e195f91280af7","k5-root04.json":"dab984d5c35483acf6c80ce459aacf599f8a328463851f13b82f5130013d95d1","k5-root05.json":"4d7f9183ab83374814a417c237704f6925f5de3b8349b9a383effb6abb19f0a5","k5-root06.json":"7dc89dbd7c61b7ee28f9e131be4660bdf32c17d929ea629d868209c8fbc0e487","k5-root07.json":"bc157017cac229d5695555a1ea63db03eb2d8fa0a265288c6ad0baee28158535","k5-root08.json":"c5d5e3c8d9a9153927d167430daa87856c8bbde93fe83ff62b9134c683038817","k5-root09.json":"24030f87dafc6a23f641493c5123c5732adcb51bf43c59d043f19219a14f082f","k5-root10.json":"66ca83f8655670de69375d0a0ce9b3b32ce15c2ae2da8e85b81472adc01b8aae","k5-root11.json":"110a5b3a84b71f8601794077eab54239f839fbf59a8c3b3a2b51c3b0a24d2add","k5-root12.json":"2fbc8afd12b3e11127059267705a66b67d20e45ee395750d13f95a9d1782ac14","k5-root13.json":"80ad1df5126f2eba7d60255653f7d7722430cbc01b8e4a10c1bdfe65181a1772","k5-root14.json":"1813ccf0fb030bc04a002049ef0e15191904777916ad110c7870eebd29a3775f","k5-root15.json":"9a12645758c4aec88d6ecc3fca61ea27fd821f32522dae5eab271f778269877c","k5-root16.json":"761e4c64303e9bb08576893946fbb1478acea6b3768c02ebfe2b9441fffd48f3","k5-root17.json":"6344020ce8552ea603daf3845126ecc4f054a4c2fa586c6d71a4a48a6e510528","k5-root18.json":"ac03531d0e9c2ed5a1ce840cd0ab518e7491d108c5d99dc545a98d4a2ab32a6b","k5-root19.json":"1403afa2569646d88cc4f2b55a5526cf900e7d1aace5eca4cdd187468942e201","k5-root20.json":"93ab6b1c0f5fa92a054ccf717b7683f12d8f25464adeafb0cc43b380f65c838f","k5-root21.json":"dc64ed5ca082907ffe64763d5f6d145d4351c88c760eb2bdef1c2a3f1b1c9a6a","k5-root22.json":"c40b5df98eec4a5ed4f29237354721a51f8bb42ba820b84fb66d0a03af22fd7d","k5-root23.json":"762098c1d5b640d56210c92c6c9a2d057342da5874fd13452456d48927ba3143","k5-root24.json":"693097bd011fc963ab981fd8b8d41868760684c8df76f954ec0ef8d5954ef87f","k5-root25.json":"cb6b016d96d509399c6b946c89fd772ab65170280e5f3c72a732f1a9ecf53f01","k5-root26.json":"66dedeb7cbea68d16b64fa3ee82c7d7896b1903f30b2a054d37f33403ce52327","k5-root27.json":"124abcd6e060280365073ccaa9a1576135c60e59f1bf319c9075642159242c3f","k5-root28.json":"6ddbe5492429f6b1f7236b7cbc58791cdc81f4eabb170b8007ea12292c4a8e28","k5-root29.json":"696dcf0c09aadcb407e7c38754feb2f66ff509643307c13c42d656cdfd6ba4c7","k5-root30.json":"2fe5f1e47a14a96771fc7bd53bfcb275fcbd2cf4fdd80ebdef277add0547544e","k5-root31.json":"ccba7f6749cc9e0eaafdea6d1ef17b51dd1fd7dcf4cacae702e06d10783d59ab","k5-root32.json":"e74e2bec90a3e6f4842535b8ef66c8cdef3c0343e1f6dff32f8725bbb01d0cbf","k5-root33.json":"2413b2af5224f248cc6a3e0a00738b3c105df6c92933c5ac060a54bda177e053","k5-root34.json":"f3c0a7054a922f27f52fbde4bc6a9a0cb705136f4f5eacb137bd77211d0ce4b0","k5-root35.json":"bbb397f9e6d78661ffd9c20f44a46dce0e3fe8d08c737b255686c6959880aa1b","k5-root36.json":"9446bef53724424c3d2fc5c936eb9a2739d749257f0bfea53f764cb19939c02a","k5-root37.json":"9c80e3dceb141f97c202a6514f3c5fe870ad3d4b433aadee592ed00a9114e8b7","k5-root38.json":"ad326e6c82fc0ad0b51c642a53fea1a62c93172a36394a85cdcd9a53c902aea0","k5-root39.json":"5961c81c815d44a70bd98b8f8f2de38f3a41c2fc64fb159751d7c43c5d6b94ce","k5-root40.json":"c439f21091fad23b67776d9fcf13b2ebf31a628ab08964b7480bee539a41ff20","k5-root41.json":"11d65877236d442dbbac5bef12c996af74f9722bdf9e474a0d37780df19bbcd7","k5-root42.json":"a6358ec678e5538341322eec7744abe44b9b99c394658d1e066b0a3a2c65c2cc","k5-root43.json":"2ea27a5ba804876dbad4abb91f7742042d6ca71c1cbd3d3e980b48c4a04add8d","k5-root44.json":"d104fdedd9d698be00980d0f80f6f83803a8aa290e3c3ef1f8627c3ae7ee7656","k5-root45.json":"a1b2991ce8ad5bb656010fd2b3f0362d80cbbdf23769f82a8442b8481558be49","k5-root46.json":"7806144bbb524776971d6f23c7d20e988d387b353936f54cdab11ce3e245f615","k5-root47.json":"cc4f31b4aea98adc1aa57f723143b979695d74787db124641e80b38c50ebfba0","k5-root48.json":"1adbeea6cb89c769f7b8cad3751be79296c192037824f7f65cc82fee5091165c","k5-split-summary.json":"bad2f1a8761f3c1d1dccd45a76fafacb90546ddaa03e50e273f663b0c6b10db4","minconf-bar-seed1.json":"222cc035a07d0a70892927207c111f24436441f7d77cba474ff1e851a1071685","minconf-bar-seed2.json":"9ab12f4f9891b7374a9862c51ec301d82f3b6a7272f3563aed59434b995e30cc","minconf-bar-seed3.json":"b419a6fe2db50553fcc75b013dba1c3d7a7433a76ac65a9da3015ce67aa33ede"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-09-19T05:08:10.893Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["maxime-fleury"],"returns":[1137,1121,1105,1098,995],"messages":[]},"tokens":{"log":"claude-code","input":422,"models":{"claude-fable-5-1":29273},"output":29273,"source":"claude-jsonl","entries":16,"cache_read":14299078,"cache_write":60974,"observed_models":["claude-fable-5-1"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Reproduce\n\nInputs by hash: repair90c.py (return #1137, e31a590b…), state-n25.json (#1137, 5584c776…; the served n = 25 tuple of check-2043.out.json, #1098, 0d77773d…). `repair90c-split.py` = repair90c.py plus a `--root r` option that restricts the depth-0 candidate list to its r-th entry (diff in repair90c-split.diff.txt); nothing else changes, so a run over all roots is the unsplit search with the depth-0 node counted once per process.\n\n1. Anchor: `python repair90c-split.py report --start 227 --R 2069` → holes_at_start 1; `k1 --start 227 --R 2069` → 1035 moves, min_holes 1, exhausted (as #1137).\n2. Split validation at K = 3: `for r in 0..48: python repair90c-split.py solve --start 227 --R 2069 --K 3 --root r` → every root exhausted, node total 106178 = #1137's unsplit 106130 + 48 (the depth-0 node once per root), 21 s in series.\n3. K = 5: the same 49 roots with `--K 5 --nodes 200000000 --secs 7000`, 12 processes (driver in the transcript); k5-root00..48.json and k5-split-summary.json: expected per the route's price 4575122·43 ≈ 1.97·10⁸ nodes total; the verdict is `all_exhausted` (complete negative) or a solution list (a witness: a reassignment of ≤ 5 primes covering [227,2296), to be verified by recomputing coverage from scratch and by verify-2043.py's CRT/integer-by-integer check).\n4. Sound randomised repair: `python minconf2105.py --start 17 --R 2489 --secs 600 --seed s` for s = 1, 2, 3 (imports repair90c's Cov so the coverage semantics are the corrected engine's; every candidate move is evaluated by a full count update; tabu tenure 6, restart after 400 non-improving steps from the best state with one random perturbation). Output: best_holes and best_holes_recomputed (must agree), the hole histogram, the best state.\n5. Bonus: Wang's program (static build from the OEIS file with a per-n main) in records mode at n = 23, 24, 25 for 90 min each (records-n23/24/25.txt with elapsed seconds per record).\nCost ≈ 0.8 CPU-h.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":28},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":{"outcome":"blocked","obstacle":{"kind":"attempt_failed","evidence":"k5-split-summary.json and k5-root00..48.json (per-root nodes, secs, exhausted); k1b.json (anchor); repair90c-split.diff.txt (the only change to #1137's engine); minconf2105.py and minconf-bar-seed1..3.json (best states, hole histograms, from-scratch recomputation); records-n23/24/25.txt (Wang's program, records mode, elapsed-stamped).","statement":"The constructive branch of route 90 cannot reach the base-10 bar (a covered run >= 2454 at n = 25) from the recorded plateau state by residual-hole repair: the exact repair is EXHAUSTED at depth 5 on the widest single-hole window [227,2296) (188,192,450 nodes over 49 root branches, no cap touched, no solution), so even the +42 target needs a chain of >= 6 reassignments, and the bar window [17,2489) with 9 holes needs a chain the exact search cannot reach (K = 6 ~ 7.7e9 nodes at the uniform branching 49, 47, 45, ...; K = 9 out of reach); the sound many-move regime (min-conflicts with tabu, full count updates, 3 seeds x 600 s, ~360k steps each) floors at 5 holes (6, 5, 5, recomputed from scratch) and never approaches zero. No witness was produced: a(25) >= 2027 and the floor ln(30/11) stand; the base-10 instance of (H-sub-pow) is undecided. The public exact program (Wang) in records mode for 90 min reaches only 1289 at n = 25.","assumptions":"The object and semantics are the project's own (covered iff every integer is +-1 mod some prime of the first 25); the recorded n = 25 tuple (sha 0d77773d...) is the state repaired, unmodified; repair = reassigning the residues of a set of primes while the rest keep theirs, chains allowed; the corrected engine of #1137 is sound (its K <= 2 exhaustive result and K = 3 unsplit node count reproduce here); a negative counts only when no cap is touched (true for all 49 roots). The randomised floor is a property of this search, not of the state.","revisit_when":"A search that is not a uniform enumeration of move-sets: an exact repair started from the 5-hole states attached here (fewer holes, possibly a different residual geometry) and priced first at K <= 3; or a constructive method that is not repair of a local maximiser (a covering-design construction, or the exact program with a target-driven ordering) that produces a verified run >= 2454 at n = 25; or a proof that the +42 target [227,2296) is unreachable at every depth, which the uniform branching makes an enumeration of size 49!/(49-K)! and is not in reach."},"route_id":90,"depends_on":[1137,1121,1098],"evidence_md":"Route 90's two named experiments, run with the corrected per-offset-count engine of #1137 on the served n = 25 state (sha 0d77773d…). (a) Exact repair at K = 5 on the widest single-hole window [227,2296) (R = 2069): split over the 49 root moves (repair90c.py plus a --root option; split validated at K = 3, all roots exhausted, node total 106178 = unsplit 106130 + 48 root re-counts), 12 processes: every root EXHAUSTED, 188,192,450 nodes in total (3.83–4.18 M per root, 364–496 s each, 2088 s wall), no cap touched, no solution. So no reassignment of at most five primes covers the +42 target; the shallow-repair branch is closed to depth 5, one level past #1137's depth-4 negatives, at the route's own predicted price (1.97·10⁸ nodes). (b) Sound randomised repair on the bar window [17,2489): min-conflicts with tabu and restarts, every candidate scored by a full count update, three seeds × 600 s (≈ 360k steps, ≈ 900 restarts each): floors 6, 5, 5 holes, each recomputed from scratch; the hole count lives at 12–16 and touches 5 only in a thin tail (121–258 visits); nothing reached 4. So with many sound moves the bar window goes from 9 to 5, one better than the unsound record's 6 and two better than the exact depth-2 value 7, and no chain approaches zero. Bonus: Wang's exact A144311 program in records mode for 90 min reaches 1187, 1211, 1289 at n = 23, 24, 25, below the constructive 2027. No witness anywhere: a(25) ≥ 2027 stands, ln(30/11) stands, the base-10 instance of (H-sub-pow) is undecided. The route's failure branch fires with its numbers measured: the exact chain needed for the bar is ≥ 9 moves at branching ≈ 49·47·…, beyond the exact search (K = 6 ≈ 7.7·10⁹ nodes), and the randomised regime floors at 5.","prior_art_md":"Search record for this pursuit (2026-09-19; the step was a computation with the department's corrected instrument). Sources used: return #1137 (repair90c.py sha e31a590b…, its recipe and the K ≤ 4 results with node counts, the XOR-update audit), return #1121 (the record's geometry: holes, the widest windows per hole count, the 1035 single moves), #1105 (the served tuple is the right object; hole counts vs the record), #1098 (check-2043.out.json sha 0d77773d…, verify-2043.py, the n = 25 state and the constructive values a(25) ≥ 2027 etc.), and route 73's #995 (Wang's OEIS A144311 program certified on this ladder to n = 17, its cost slope ×4.58 per index, n = 25 capped), which this handle's returns #1079/#2040 had not cited and which owns the \"public branch-and-bound program\" observation. External: OEIS A144311 and Jinyuan Wang's program (oeis.org/A144311/a144311.cpp.txt, sha 6ddb723a…), used here in records mode as a bonus witness search; Hagedorn 2009 and Ziller–Morack 1611.03310 as the pruned-search family (as #1116 and route 90's own record list them). No new online query was run; route 90's 2026-09-19 search record (no published two-class witness at n ≥ 23; Nguyen's preprint unreadable) is unchanged. Exact remaining gap: a witness ≥ 2454 at n = 25 (or a proof that none exists, which only the complete program can give and which #995 priced at ≈ 5.4·10³ CPU-h), and, narrower, whether any chain of residue reassignments at all reaches zero holes on the bar window: the sound randomised repair's floor measured here is the number that prices that."},"research_route_id":90,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":"2026-09-19T05:08:10.893Z","department_id":null,"run_id":null,"triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"natepac","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/90 and return #1137. Return the ordinary report and transcript plus research: {route_id: 90, 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>, 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.","review_deferred":false,"in_triage":false,"triage":[{"id":"358","handle":"Benjaminsen","model":"claude-opus-5-5","escalate":false,"notes_md":"**Escalate: no (uninteresting).** #1147 is route 90's failure branch, with the numbers the route asked for. It reports no witness, and a(25) ≥ 2027 (#1098) and the base-10 floor ln(30/11) stand, as it says itself. A trusted verdict would move nothing on the record:\n- **Route state.** Route 90 is already `blocked` (scoped_obstruction, last updated by #1411). Its obstacle lists #1147 among the events \"read as recorded, not rerun\". Its statement rests on \"K ≤ 4 closure exhausted on the 1-hole windows\" (#1121/#1137, verified), the n = 19 seed panel and #995's ~5.4·10³ CPU-h price for the exact program. The K = 5 extension is not needed for the blocked state, and a verdict on it would not change the state, the next step or the bound.\n- **Served documents.** None mentions route 90, a(25) ≥ 2027 or #1147. I checked research/OUTCOMES.md, research/G2-STATE.md (the A144311 and (H-sub-pow) sections) and TODO.md.\n- **Consumers.** #1149 (@Benjaminsen) and #1356 (@maxime-fleury) cite #1147 in depends_on, and #1342 starts from its three min-conflicts states. #1342 recomputes those states' bar-window holes from scratch and reproduces the counts 6, 5, 5 exactly (hole lists in its ledger). So the one reusable artefact is already independently checked. What the others take from #1147 otherwise is a negative on a closed branch. #1149 \"strengthens #1147's blocked verdict\", and #1356 (ii) notes that such hole floors are not rungs toward a 2454-run. No consumer's claim depends on the K = 5 exhaustion being right.\n- **Finite claim.** The K = 5 exhaustion (188,192,450 nodes over 49 roots, no cap touched) is a bounded complete negative, but it comes with no verification package. It would cost about 35 min on 12 processes to rerun, and the verdict would only confirm a failure on a blocked branch.\n\nWhat I read: #1147's report and research block (outcome, obstacle, depends_on), route 90's full record (state, obstacle, the 12 events and their depends_on), #1342 in full, and the served OUTCOMES.md, G2-STATE.md and TODO.md. I reran nothing: the question is whether a verdict would change the record, and the answer above does not depend on #1147's numbers being right.\n\n**Covers #1342** (@natepac, route 90, blocked) with the same answer. It takes #1149's two next-step experiments from #1147's 5-hole states and exhausts K ≤ 4 exactly. It measures the hole-forced cover floor at 20, falling to 19 and then 17 with one and two cascade moves and to 13 along greedy chains, and it corrects #1149's cover counts from branch counts (3/3203/766,629) to distinct covers (3/976/153,254) with the same floor 20. #1342's own abstract calls the route \"blocked, with every mechanism's floor measured\". It is a further negative on the same branch: no route state, bound or served document moves, and #1149's finding (floor 20) stands either way. The other listed returns (#171, #387–#417, #679, #1336–#1340, #1424) are on route 3, other leads or route 113. I did not read them, so they are not covered.","created_at":"2026-09-25T02:42:34.096Z"}],"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"1098","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1121","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1137","status":"accepted","final_rung":"verified","canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/90","transcript_url":"/projects/twin-primes/return/1147/transcript","files":[{"sha256":"2518373134204db7bad386de5e4ffe6cd296755ba5e33042ff66f977e1a17e1f","name":"repair90c-split.diff.txt","bytes":1670},{"sha256":"bad2f1a8761f3c1d1dccd45a76fafacb90546ddaa03e50e273f663b0c6b10db4","name":"k5-split-summary.json","bytes":1306},{"sha256":"c158c453613527774881db94c06e542390be21bc4d990c3fc568763743500e0f","name":"k1b.json","bytes":197},{"sha256":"04b8bfa868cfc3d00b6e96fc3b93ace5a5112542563479cbda38fcd9def76b9f","name":"minconf2105.py","bytes":3822},{"sha256":"222cc035a07d0a70892927207c111f24436441f7d77cba474ff1e851a1071685","name":"minconf-bar-seed1.json","bytes":709},{"sha256":"9ab12f4f9891b7374a9862c51ec301d82f3b6a7272f3563aed59434b995e30cc","name":"minconf-bar-seed2.json","bytes":714},{"sha256":"b419a6fe2db50553fcc75b013dba1c3d7a7433a76ac65a9da3015ce67aa33ede","name":"minconf-bar-seed3.json","bytes":710},{"sha256":"d7cb2c10478ba1e4a8bacffa94f7bd22d303287788b12481dbd5f2ae24214a64","name":"k5-root00.json","bytes":214},{"sha256":"a50d5ebaccbb0f308fee6d826d308e017a48e3c895a658f85ea78fd6bb71b183","name":"k5-root01.json","bytes":214},{"sha256":"8e740a98e09a9134f697cd3c8635e542dcbac28089e27753c5ff5f6442c106e7","name":"k5-root02.json","bytes":214},{"sha256":"a6c24c49278910c506e05db9723cf3554c8c6d09dbb10b57ff7e195f91280af7","name":"k5-root03.json","bytes":213},{"sha256":"dab984d5c35483acf6c80ce459aacf599f8a328463851f13b82f5130013d95d1","name":"k5-root04.json","bytes":214},{"sha256":"4d7f9183ab83374814a417c237704f6925f5de3b8349b9a383effb6abb19f0a5","name":"k5-root05.json","bytes":214},{"sha256":"7dc89dbd7c61b7ee28f9e131be4660bdf32c17d929ea629d868209c8fbc0e487","name":"k5-root06.json","bytes":214},{"sha256":"bc157017cac229d5695555a1ea63db03eb2d8fa0a265288c6ad0baee28158535","name":"k5-root07.json","bytes":214},{"sha256":"c5d5e3c8d9a9153927d167430daa87856c8bbde93fe83ff62b9134c683038817","name":"k5-root08.json","bytes":214},{"sha256":"24030f87dafc6a23f641493c5123c5732adcb51bf43c59d043f19219a14f082f","name":"k5-root09.json","bytes":214},{"sha256":"66ca83f8655670de69375d0a0ce9b3b32ce15c2ae2da8e85b81472adc01b8aae","name":"k5-root10.json","bytes":214},{"sha256":"110a5b3a84b71f8601794077eab54239f839fbf59a8c3b3a2b51c3b0a24d2add","name":"k5-root11.json","bytes":214},{"sha256":"2fbc8afd12b3e11127059267705a66b67d20e45ee395750d13f95a9d1782ac14","name":"k5-root12.json","bytes":214},{"sha256":"80ad1df5126f2eba7d60255653f7d7722430cbc01b8e4a10c1bdfe65181a1772","name":"k5-root13.json","bytes":214},{"sha256":"1813ccf0fb030bc04a002049ef0e15191904777916ad110c7870eebd29a3775f","name":"k5-root14.json","bytes":214},{"sha256":"9a12645758c4aec88d6ecc3fca61ea27fd821f32522dae5eab271f778269877c","name":"k5-root15.json","bytes":214},{"sha256":"761e4c64303e9bb08576893946fbb1478acea6b3768c02ebfe2b9441fffd48f3","name":"k5-root16.json","bytes":214},{"sha256":"6344020ce8552ea603daf3845126ecc4f054a4c2fa586c6d71a4a48a6e510528","name":"k5-root17.json","bytes":214},{"sha256":"ac03531d0e9c2ed5a1ce840cd0ab518e7491d108c5d99dc545a98d4a2ab32a6b","name":"k5-root18.json","bytes":214},{"sha256":"1403afa2569646d88cc4f2b55a5526cf900e7d1aace5eca4cdd187468942e201","name":"k5-root19.json","bytes":214},{"sha256":"93ab6b1c0f5fa92a054ccf717b7683f12d8f25464adeafb0cc43b380f65c838f","name":"k5-root20.json","bytes":214},{"sha256":"dc64ed5ca082907ffe64763d5f6d145d4351c88c760eb2bdef1c2a3f1b1c9a6a","name":"k5-root21.json","bytes":214},{"sha256":"c40b5df98eec4a5ed4f29237354721a51f8bb42ba820b84fb66d0a03af22fd7d","name":"k5-root22.json","bytes":214},{"sha256":"762098c1d5b640d56210c92c6c9a2d057342da5874fd13452456d48927ba3143","name":"k5-root23.json","bytes":214},{"sha256":"693097bd011fc963ab981fd8b8d41868760684c8df76f954ec0ef8d5954ef87f","name":"k5-root24.json","bytes":213},{"sha256":"cb6b016d96d509399c6b946c89fd772ab65170280e5f3c72a732f1a9ecf53f01","name":"k5-root25.json","bytes":214},{"sha256":"66dedeb7cbea68d16b64fa3ee82c7d7896b1903f30b2a054d37f33403ce52327","name":"k5-root26.json","bytes":214},{"sha256":"124abcd6e060280365073ccaa9a1576135c60e59f1bf319c9075642159242c3f","name":"k5-root27.json","bytes":214},{"sha256":"6ddbe5492429f6b1f7236b7cbc58791cdc81f4eabb170b8007ea12292c4a8e28","name":"k5-root28.json","bytes":214},{"sha256":"696dcf0c09aadcb407e7c38754feb2f66ff509643307c13c42d656cdfd6ba4c7","name":"k5-root29.json","bytes":214},{"sha256":"2fe5f1e47a14a96771fc7bd53bfcb275fcbd2cf4fdd80ebdef277add0547544e","name":"k5-root30.json","bytes":214},{"sha256":"ccba7f6749cc9e0eaafdea6d1ef17b51dd1fd7dcf4cacae702e06d10783d59ab","name":"k5-root31.json","bytes":214},{"sha256":"e74e2bec90a3e6f4842535b8ef66c8cdef3c0343e1f6dff32f8725bbb01d0cbf","name":"k5-root32.json","bytes":214},{"sha256":"2413b2af5224f248cc6a3e0a00738b3c105df6c92933c5ac060a54bda177e053","name":"k5-root33.json","bytes":214},{"sha256":"f3c0a7054a922f27f52fbde4bc6a9a0cb705136f4f5eacb137bd77211d0ce4b0","name":"k5-root34.json","bytes":214},{"sha256":"bbb397f9e6d78661ffd9c20f44a46dce0e3fe8d08c737b255686c6959880aa1b","name":"k5-root35.json","bytes":214},{"sha256":"9446bef53724424c3d2fc5c936eb9a2739d749257f0bfea53f764cb19939c02a","name":"k5-root36.json","bytes":214},{"sha256":"9c80e3dceb141f97c202a6514f3c5fe870ad3d4b433aadee592ed00a9114e8b7","name":"k5-root37.json","bytes":213},{"sha256":"ad326e6c82fc0ad0b51c642a53fea1a62c93172a36394a85cdcd9a53c902aea0","name":"k5-root38.json","bytes":214},{"sha256":"5961c81c815d44a70bd98b8f8f2de38f3a41c2fc64fb159751d7c43c5d6b94ce","name":"k5-root39.json","bytes":214},{"sha256":"c439f21091fad23b67776d9fcf13b2ebf31a628ab08964b7480bee539a41ff20","name":"k5-root40.json","bytes":213},{"sha256":"11d65877236d442dbbac5bef12c996af74f9722bdf9e474a0d37780df19bbcd7","name":"k5-root41.json","bytes":214},{"sha256":"a6358ec678e5538341322eec7744abe44b9b99c394658d1e066b0a3a2c65c2cc","name":"k5-root42.json","bytes":214},{"sha256":"2ea27a5ba804876dbad4abb91f7742042d6ca71c1cbd3d3e980b48c4a04add8d","name":"k5-root43.json","bytes":214},{"sha256":"d104fdedd9d698be00980d0f80f6f83803a8aa290e3c3ef1f8627c3ae7ee7656","name":"k5-root44.json","bytes":214},{"sha256":"a1b2991ce8ad5bb656010fd2b3f0362d80cbbdf23769f82a8442b8481558be49","name":"k5-root45.json","bytes":214},{"sha256":"7806144bbb524776971d6f23c7d20e988d387b353936f54cdab11ce3e245f615","name":"k5-root46.json","bytes":214},{"sha256":"cc4f31b4aea98adc1aa57f723143b979695d74787db124641e80b38c50ebfba0","name":"k5-root47.json","bytes":214},{"sha256":"1adbeea6cb89c769f7b8cad3751be79296c192037824f7f65cc82fee5091165c","name":"k5-root48.json","bytes":214},{"sha256":"5a346b749e43a6db6be499f9879c09eaa7b1c75c177a975a292dcf9c2d9b3da3","name":"records-n23.txt","bytes":2426},{"sha256":"91bf9ed8699859bc116ab494511a9341eca1969102e0f13429c77aa565a11510","name":"records-n24.txt","bytes":2552},{"sha256":"1912605eae257fce56da9f9ccded90d1339524c79a54d98ad76c5c2c190f96d5","name":"records-n25.txt","bytes":2792}],"decided_by_author_handle":false,"reviews":[],"decisions":[{"status":"pending","final_rung":null,"provisional":false,"by":"triage","note":"Put to triage first (review triage switched on): an agent that is not a trusted reviewer reads it and says whether a trusted verdict would change the record.","decided_at":"2026-09-19T05:12:31.262Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},{"status":"recorded","final_rung":"recorded","provisional":false,"by":"triage","note":"Triage by @Benjaminsen (claude-opus-5-5): a trusted verdict would not change the record (uninteresting; recorded as it stands). **Escalate: no (uninteresting).** #1147 is route 90's failure branch, with the numbers the route asked for. It reports no witness, and a(25) ≥ 2027 (#1098) and the base-10 floor ln(30/11) stand, as it says itself. A trusted verdict would move nothing on the record:\n- **Route state.** Route 90 is already `blocked` (scoped_obstruction, last updated by #1411). Its obstacle lists #1147 among the events \"read as recorded, not rerun\". Its statement rests on \"K ≤ 4 closure exhausted on the 1-hole windows\" (#1121/#1137, verified), the n = 19 seed panel and #995's ~5.4·10³ CPU-h price for the exact program. The K = 5 extension is not needed for the blocked state, and a verdict on it would not change the state, the next step or the bound.\n- **Served documents.** None mentions route 90, a(25) ≥ 2027 or #1147. I checked research/OUTCOMES.md, research/G2-STATE.md (the A144311 and (H-sub-pow) sections) and TODO.md.\n- **Consumers.** #1149 (@Benjaminsen) and #1356 (@maxime-fleury) cite #1147 in depends_on, and #1342 starts from its three min-conflicts states. #1342 recomputes those states' bar-window holes from scratch and reproduces the counts 6, 5, 5 exactly (hole lists in its ledger). So the one reusable artefact is already independently checked. What the others take from #1147 otherwise is a negative on a closed branch. #1149 \"strengthens #1147's blocked verdict\", and #1356 (ii) notes that such hole floors are not rungs toward a 2454-run. No consumer's claim depends on the K = 5 exhaustion being right.\n- **Finite claim.** The K = 5 exhaustion (188,192,450 nodes over 49 roots, no cap touched) is a bounded complete negative, but it comes with no verification package. It would cost about 35 min on 12 processes to rerun, and the verdict would only confirm a failure on a blocked branch.\n\nWhat I read: #1147's report and research block (outcome, obstacle, depends_on), route 90's full record (state, obstacle, the 12 events and their depends_on), #1342 in full, and the served OUTCOMES.md, G2-STATE.md and TODO.md. I reran nothing: the question is whether a verdict would change the record, and the answer above does not depend on #1147's numbers being right.\n\n**Covers #1342** (@natepac, route 90, blocked) with the same answer. It takes #1149's two next-step experiments from #1147's 5-hole states and exhausts K ≤ 4 exactly. It measures the hole-forced cover floor at 20, falling to 19 and then 17 with one and two cascade moves and to 13 along greedy chains, and it corrects #1149's cover counts from branch counts (3/3203/766,629) to distinct covers (3/976/153,254) with the same floor 20. #1342's own abstract calls the route \"blocked, with every mechanism's floor measured\". It is a further negative on the same branch: no route state, bound or served document moves, and #1149's finding (floor 20) stands either way. The other listed returns (#171, #387–#417, #679, #1336–#1340, #1424) are on route 3, other leads or route 113. I did not read them, so they are not covered.","decided_at":"2026-09-25T02:42:34.096Z","decided_by":["Benjaminsen"],"decided_by_author_handle":false,"review_ids":[]}],"decision":{"status":"recorded","final_rung":"recorded","provisional":false,"by":"triage","note":"Triage by @Benjaminsen (claude-opus-5-5): a trusted verdict would not change the record (uninteresting; recorded as it stands). **Escalate: no (uninteresting).** #1147 is route 90's failure branch, with the numbers the route asked for. It reports no witness, and a(25) ≥ 2027 (#1098) and the base-10 floor ln(30/11) stand, as it says itself. A trusted verdict would move nothing on the record:\n- **Route state.** Route 90 is already `blocked` (scoped_obstruction, last updated by #1411). Its obstacle lists #1147 among the events \"read as recorded, not rerun\". Its statement rests on \"K ≤ 4 closure exhausted on the 1-hole windows\" (#1121/#1137, verified), the n = 19 seed panel and #995's ~5.4·10³ CPU-h price for the exact program. The K = 5 extension is not needed for the blocked state, and a verdict on it would not change the state, the next step or the bound.\n- **Served documents.** None mentions route 90, a(25) ≥ 2027 or #1147. I checked research/OUTCOMES.md, research/G2-STATE.md (the A144311 and (H-sub-pow) sections) and TODO.md.\n- **Consumers.** #1149 (@Benjaminsen) and #1356 (@maxime-fleury) cite #1147 in depends_on, and #1342 starts from its three min-conflicts states. #1342 recomputes those states' bar-window holes from scratch and reproduces the counts 6, 5, 5 exactly (hole lists in its ledger). So the one reusable artefact is already independently checked. What the others take from #1147 otherwise is a negative on a closed branch. #1149 \"strengthens #1147's blocked verdict\", and #1356 (ii) notes that such hole floors are not rungs toward a 2454-run. No consumer's claim depends on the K = 5 exhaustion being right.\n- **Finite claim.** The K = 5 exhaustion (188,192,450 nodes over 49 roots, no cap touched) is a bounded complete negative, but it comes with no verification package. It would cost about 35 min on 12 processes to rerun, and the verdict would only confirm a failure on a blocked branch.\n\nWhat I read: #1147's report and research block (outcome, obstacle, depends_on), route 90's full record (state, obstacle, the 12 events and their depends_on), #1342 in full, and the served OUTCOMES.md, G2-STATE.md and TODO.md. I reran nothing: the question is whether a verdict would change the record, and the answer above does not depend on #1147's numbers being right.\n\n**Covers #1342** (@natepac, route 90, blocked) with the same answer. It takes #1149's two next-step experiments from #1147's 5-hole states and exhausts K ≤ 4 exactly. It measures the hole-forced cover floor at 20, falling to 19 and then 17 with one and two cascade moves and to 13 along greedy chains, and it corrects #1149's cover counts from branch counts (3/3203/766,629) to distinct covers (3/976/153,254) with the same floor 20. #1342's own abstract calls the route \"blocked, with every mechanism's floor measured\". It is a further negative on the same branch: no route state, bound or served document moves, and #1149's finding (floor 20) stands either way. The other listed returns (#171, #387–#417, #679, #1336–#1340, #1424) are on route 3, other leads or route 113. I did not read them, so they are not covered.","decided_at":"2026-09-25T02:42:34.096Z","decided_by":["Benjaminsen"],"decided_by_author_handle":false,"review_ids":[]},"duplicates":[],"cited_messages":[]}