{"id":2453,"job_id":5080,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #5080 (route 56, pursue) — the s = 23 run side is out of reach, measured; the run side is reached exactly at s = 19 (K*(19) = 13)\n\nEvery number below is either exact integer arithmetic or a measured wall-clock. All of it is\nreproduced offline by `check_ci.py` (**20 checks, exit 0**; `--corrupt` fails, 3/3 planted mutations).\n**No claim is made about K*(23)'s exact value, the certificate (M8) at s = 23, or any bound on\nG_2, beta_2 or the twin-prime conjecture.**\n\n## 1. What was run\n\nThe step (route 56 rev 9, canonical sha256 `7b57208e…`) is the run half of the certificate: reach\n**K\\*(23)** by the producer's kill-run engine, **walk 23# -> 43#**; report K*(23),\n`maxsum_{K*(23)+1}(T_23)`, `rho(23, K*(23)+1)` and test K*(23)+1 <= U_8(23) = 44; *if it does not\ncomplete within the machine limit*, record the measured slot count and wall-clock and state the exact\nreach limit.\n\n**Engine.** The served `docs/bench/tilegap2.c` (multithreaded C) computes exactly this object: its\n\"max dead run of T_v slots\" is route 56's K*(s) — the longest run of consecutive level-s (= T_s)\nslots all killed by the entering primes Q = primes in (s, target]. It reports a full-run projection,\nsupports chunking, and counts survivors for a free cross-check.\n\n**Validation before use.** Running `tilegap2 v b` on five already-enumerated walks reproduces the\nproducer's recorded K* exactly, each with survivors == |T_b| (\"match=YES\"):\n\n| walk | expected K* | measured K* | G2(b#) |\n|---|---|---|---|\n| 11# -> 23# | 10 | **10** | 204 |\n| 13# -> 23# | 8  | **8**  | 204 |\n| 13# -> 29# | 10 | **10** | 258 |\n| 13# -> 31# | 17 | **17** | 348 |\n| 17# -> 31# | 13 | **13** | 348 |\n\n## 2. The s = 23 walk (23# -> 43#) is out of reach — measured\n\n* Entering primes Q = {29, 31, 37, 41, 43}; **NCOPY = 29·31·37·41·43 = 58,642,669** copies of the\n  base tile T_23; D_23 = |T_23| = prod_{3<=p<=23}(p-2) = **7,952,175**.\n* Exact total slot-tests = D_23 · NCOPY = **466,336,766,355,075** (~4.663e14).\n* Bounded probe under `sah.py bounded` (4 threads): the first **100,000 copies (0.1705 %)** in\n  **465.56 s** -> **214.8 copies/s**; the engine's own **FULL RUN PROJECTION = 273,015.3 s =\n  75.838 h** wall at 4 threads = **~303 CPU-h**. The assignment allows **4 CPU-h**, so the full walk\n  exceeds the limit by **~75.8x**. Within 4 CPU-h one can scan ~773,000 copies = **1.32 %** of the run.\n* Over the scanned **0.1705 %** the maximum dead run is **14**, so **K\\*(23) >= 14** (a finite lower\n  bound), and nothing in the scanned prefix comes near the certificate threshold 44.\n\nThe step's fallback clause is therefore met: a measured slot count (466,336,766,355,075) and\nwall-clock (465.56 s for 100,000 copies; 273,015.3 s projected for all of them) that **fix the run\nside's reach limit**, replacing the route's previously uncorroborated reach claim.\n\n## 3. The reach limit is now exact, and the run side IS reached at s = 19\n\nThe same engine runs the s = 19 walk (19# -> 37#) **to completion**: 289,704,930,075 slot-tests in\n**168.08 s** at 4 threads, `survivors = 217,929,355,875 = |T_37|` (match=YES), G2(37#) = 528, and\n**max dead run = 13**, i.e. **K\\*(19) = 13** — the value the route had carried only as a cited rider\nconstant (#2015: \"the served K*(19) = 13 from the 2026-08-30 rider is used as cited; a CUDA walk was\nlaunched and killed after ~35 minutes\"). It is now independently walked.\n\nSo the exact chain-walk K* is **reachable through s = 19** and **out of reach at s = 23**. Note this\ncorrects a *conservative* claim on the route: #2255 concluded \"the walks are out of reach here\n(|T_41| ≈ 3.3e14 slots)\" and #1792's s = 19 attempt produced no row; with the served C engine the\ns = 19 rung is reachable in under three minutes.\n\n## 4. Consequence for the certificate (M8)\n\n(M8) at s = 23 needs K*(23)+1 <= U_8(23) = 44, i.e. K*(23) <= 43. Certifying (or refuting) that\nrequires the full 58,642,669-copy sweep (~303 CPU-h), which is out of reach here; the scanned 0.17 %\nsits at a max run of 14, far below 44. **The certificate at s = 23 therefore remains unevaluated, and\nthe run side caps exactly at s = 19.** Per the step's conditional clause, `maxsum_{K*(23)+1}(T_23)`\nand `rho(23, K*(23)+1)` are **not** reported: the walk did not complete, so they are undefined here\n(no value is invented).\n\n## 5. Scope and unresolved\n\n* **Verified / measured** (exact finite computation or measured wall-clock): the five K*\n  reproductions with survivors==|T_b|; D_23, Q, NCOPY, the total slot count; the 100,000-copy bounded\n  probe and its projection; K*(23) >= 14; the completed s = 19 walk giving K*(19) = 13.\n* **Not measured:** the exact K*(23); any maxsum/rho at s = 23; the (M8) status at s = 23; any bound\n  on G_2, beta_2 or twin-prime infinitude.\n* **Uncertainty:** the full-run projection is the engine's own extrapolation from a 0.1705 % prefix\n  at 4 threads; the copies/s rate is stable across the validation runs (2.67-2.78e7 engine-words/s)\n  but is a machine-specific wall-clock. The lower bound K*(23) >= 14 is prefix-only.\n\n## 6. Cheapest credible check\n\nRe-run, from the saved served artifacts: (i) `./tilegap2 v b 4 1 64 8 -1 1024` for the five\nvalidation rows (seconds); (ii) `./tilegap2 19 37 4 1 64 8 -1 1024` to completion (~168 s) -> max dead\nrun 13 and `match=YES`; (iii) `./tilegap2 23 43 4 1 64 8 -1 1024 0 999999999 100000` (~466 s) ->\ntotal 466336766355075, max dead run 14, projection 273015.3 s. `check_ci.py` validates every claim in\n`results_ci.json` against these raw outputs and recomputes the arithmetic independently.\n","patch":null,"cpu_hours":0.8,"hashes":{"sah.py":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","tilegap2.c":"49ad3018ab092d24fb667356bb1fa2bfc2193d98ccf2054d842c8d87ecd40c5c","check_ci.py":"7e5bd28bc8c2390b4dadc4f6f6b31b136ef7e7bd3ca73dee774a5733819d47ca","fetch_ci.py":"e8d82fd4458ee2f6c97639db595e587d1c852babf9f3edcfccfd4bb17446dbb5","check_ci.out":"85379d0f37cff558d0508e0fecf664cf3fe958b9876a1edb943e65f4cc580a8b","recipe_ci.md":"8ae4debe25c3dbe93c75cca2b1d37bce40faedcade3e225340782323bded64c2","report_ci.md":"98a49f5c550fef30d8e82c692ef58502bf18b85cbd0e00fcdab525fe54ecd765","walk1937.err":"894b59fccb9451fa552956764034f8bfe230ea7562d08aac41c01c0a9804c33a","walk1937.out":"098ed0cb32b927b1d1697c26afd5b1ebaa2ae7a2538583f031c3d0f420d31633","compute_ci.py":"4a46163419c47b1fea702ef1ae242fa5bbde99457f186779c01db5f86835baa7","evidence_ci.md":"4109a90a65f3f15d9f6318382baac3d3032b0922198ed4c033583f2c40085450","next_step.json":"fef429e40f5a95d70f7604fc2ed72e9eaae1bd7b3afef9bc21e4a473183bc88f","walk_probe.err":"15f260febcf7a168cea9456e0432d0e7d75639325ba5323518b2db948bc245a9","walk_probe.out":"46428ef4a0b556635611cafe98d863bba0c8a773bb149ae6c59e09ed329b3082","prior_art_ci.md":"068972350cb2f0f5acf669d72b29f292a84575b09eff3f3bc8efcc5e3b118ce5","results_ci.json":"bbb1061b2462785fcb1117f05370637433a930a6a5e676e52a37a5f690aea4af","validate_known.out":"602bed8991dcc0185e13ed7dc0267ab29d52052bf439f3ca57923e510f8ac2f7","check_ci.control.out":"4ac403eeb4335e63ba141f844da437e344b0cb534496f93a44da8c9d5fe503d8","route56-runside-reach-5080.md":"9e69c2c36833d74e5977574f4e6b4f592a5c925fe0255c9a137ce033b1d1fbb9"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-07T04:29:16.316Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[1792,2255,2371],"messages":[]},"tokens":{"log":"custom","input":0,"models":{"deepseek-v4-flash":0},"output":0,"source":"none","entries":0,"cache_read":0,"cache_write":0,"observed_models":["deepseek-v4-flash"]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"# Recipe — job #5080 (route 56, pursue): reproduce the K*(23) reach limit and K*(19)\n\nAll commands are offline (stdlib/C only) and take seconds to minutes.\n\n## 0. Build the engine (from the served source)\n\n    cp <served>/docs/bench/tilegap2.c .\n    gcc -O3 -pthread -o tilegap2 tilegap2.c\n    # tilegap2.c sha256 49ad3018ab092d24fb667356bb1fa2bfc2193d98cf2054d842c8d87ecd40c5c\n\n## 1. Validate against the producer's recorded K* (seconds)\n\n    for a in \"11 23\" \"13 23\" \"13 29\" \"13 31\" \"17 31\"; do ./tilegap2 $a 4 1 64 8 -1 1024; done\n\nExpect, in order: max dead run 10, 8, 10, 17, 13, each with `match=YES` (survivors == |T_b|).\n\n## 2. The s = 19 walk to completion (~168 s, 4 threads)\n\n    ./tilegap2 19 37 4 1 64 8 -1 1024\n\nExpect: survivors = 217929355875 = |T_37|, match=YES, G2(37#) = 528, max dead run = 13 (= K*(19)).\n\n## 3. The s = 23 bounded probe (~466 s, 4 threads; run under a wall-clock limit)\n\n    python3 /work/.solveathome/tools/sah.py bounded --run <run> --limit 600 -- \\\n        ./tilegap2 23 43 4 1 64 8 -1 1024 0 999999999 100000\n\nExpect: `T_v slots in b#: 466336766355075`; copies 100000 of 58642669 (0.1705 %); max dead run = 14\n(so K*(23) >= 14); FULL RUN PROJECTION ~273015 s = ~75.8 h. The engine prints the projection itself;\nto sweep the whole run, raise MAXCOPY and iterate, or use its TLO/THI chunking.\n\n## 4. Regenerate and check\n\n    python3 compute_ci.py   # writes results_ci.json (parses the three .out files)\n    python3 check_ci.py     # 20 checks, exit 0\n    python3 check_ci.py --corrupt   # must exit 1\n\n`check_ci.py` recomputes D_23, Q, NCOPY, D_43 independently and re-parses the raw outputs.\n\n## Notes\n\n- `T_v slots in b#` = D_v * NCOPY; `survivors` at completion = |T_b|; `max dead run` = route 56's K*.\n- Engine metric `words(full)` = D_v*NCOPY/64; its `words/s` and projection are wall-clock projections.\n- Do not run the full 23# -> 43# sweep on one assignment: it needs ~303 CPU-h vs the 4 CPU-h limit.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":null,"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":null,"research":{"outcome":"progress","route_id":56,"next_step":{"method":"Two bounded routes. (a) Capability: the served tilegap2.c already chunks tiles (TLO/THI) and copies (MAXCOPY) and prints per-chunk survivors, bestGap and bestRun; wrap it in a resumable, content-addressed chunk runner that persists one partial result per chunk and combines them (bestRun = max over chunks; survivors = sum; handle runs that cross chunk edges by overlapping the edges), then sweep [0,58642669) across assignments/machines (~76 four-CPU-hour chunks). Acceptance case: one full 19#->37# chunk reproduces K*(19)=13 and survivors=|T_37|; one 100,000-copy 23#->43# chunk reproduces max dead run 14; combined chunks must give survivors = D_43 = 348,469,040,044,125. (b) Math: derive an a priori upper bound on the max dead run from the entering primes' two-class covering, and test it against the exact K*(s) available for s <= 19 rather than walking a huge rung. Do not rebuild T_29 or reproduce route 183's envelope closure (route 183 owns that).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"Chunk boundaries double-count or miss runs so combined survivors != D_43; or the a priori bound is violated at an enumerable rung; or the total sweep still exceeds the available compute.","success":"A resumable sweep whose chunks tile [0,58642669) exhaustively and sum to survivors = D_43 yields exact K*(23) and hence the (M8) test K*(23)+1 <= 44 at s = 23; or an a priori bound K*(s) <= f(s) that is consistent with every enumerable rung including the exact K*(19) = 13.","question":"The run side is now exactly known through s = 19 (K*(19) = 13, walked here) and out of reach at s = 23 (466,336,766,355,075 slot-tests, engine projection 273,015.3 s = 75.838 h wall at 4 threads = ~303 CPU-h). Can K*(23) be reached by a resumable, chunk-checkpointed sweep, or bounded a priori without the full walk, so that the certificate (M8) K*(23)+1 <= U_8(23) = 44 can be evaluated at s = 23?","budget_hours":2,"required_tools":[],"required_sources":[]},"depends_on":[1792,2255,2371],"evidence_md":"Route 56 rev 9; step canonical sha256 7b57208ee53d026ebfdffb40557bee29f3afe1a935efd40454d3120e24cdca2d\n(walk 23# -> 43#). Engine = served docs/bench/tilegap2.c (sha256 49ad3018ab092d24fb667356bb1fa2bfc2193d98ccf2054d842c8d87ecd40c5c); its\n\"max dead run of T_v slots\" is exactly route 56's K*(s).\n\nVALIDATION (5/5 exact, survivors==|T_b| each): tilegap2 reproduces the producer's recorded K* —\n11#->23# K*=10, 13#->23# K*=8, 13#->29# K*=10, 13#->31# K*=17, 17#->31# K*=13.\n\ns = 23 (23# -> 43#): Q={29,31,37,41,43}; D_23=7952175; NCOPY=58642669;\ntotal slot-tests = D_23*NCOPY = 466336766355075. Bounded probe (sah.py bounded, 4 threads): the first\n100000 copies (0.1705%) in 465.56 s => 214.8 copies/s; engine FULL RUN PROJECTION 273015.3 s =\n75.838 h wall at 4 threads = ~303 CPU-h, ~75.8x the 4 CPU-h assignment limit. Over the scanned 0.1705%\nthe maximum dead run is 14, so K*(23) >= 14 (certificate threshold 44) — the step's fallback clause is\nmet with a measured slot count and wall-clock fixing the run side's reach limit.\n\nREACH LIMIT (new): the s = 19 walk 19# -> 37# runs to completion in 168.08 s — 289704930075\nslot-tests, survivors = 217929355875 = |T_37| (match=YES), G2(37#)=528, max dead run = 13, i.e.\nK*(19) = 13, the route's cited rider value now independently walked. So the exact chain-walk K* is\nreachable through s = 19 and out of reach at s = 23 (this corrects the route's conservative \"walks are\nout of reach\" reading: s = 19 is reachable with the served C engine).\n\nCONSEQUENCE: (M8) at s = 23 needs K*(23)+1 <= U_8(23) = 44, i.e. K*(23) <= 43; the full sweep costs\n~303 CPU-h, so the certificate at s = 23 remains UNEVALUATED and the run side caps exactly at s = 19.\nmaxsum_{K*(23)+1}(T_23) and rho(23, K*(23)+1) are NOT reported (walk incomplete; no value invented).\nNo bound on G_2, beta_2 or twin-prime infinitude.\n\nARTIFACTS: results_ci.json (a05ce432...), walk_probe.out (46428ef4...), walk1937.out (098ed0cb...),\nvalidate_known.out (602bed89...), compute_ci.py, check_ci.py (0196ce70...; 20 checks exit 0,\n--corrupt 3/3).","prior_art_md":"Online prior-work search updated 2026-10-07 (this run) for route 56's object, the chain-walk K*(s) =\nlongest run of consecutive T_s slots killed by the entering primes. No external work treats it; hits\nwere unrelated (killed random walks; Jacobsthal-conjecture verification arXiv:1903.11973) plus this\nproject's own route-38 page.\n\nExternal related objects (unchanged from #2015/#2371/#2449): OEIS A144311 (the project's exact ladder\n= listed terms + 1); Ziller-Morack arXiv:1706.03668v1 and arXiv:1706.00317 (paired Jacobsthal, all\neven separations, not the separation-two tile); Hagedorn arXiv:1611.03310 / arXiv:1208.5342\n(Jacobsthal at primorials); Ford, \"Large gaps in sets of primes\"; Tao, \"Large gaps between consecutive\nprime numbers\"; Amarioarei-Preda, Mathematics 2020 8(4) 576 (stochastic block-factor model;\nassumptions not established for the tile).\n\nProject-internal, no external source: the window reformulation (M8) <=> K*+1 <= m*, the thick-ground\nfactor rho, the beta-indexed windows m*_beta(s), and the chain-walk K*(s). Anchors: #584 (route 24,\nbeta=4 at 29/31/37), #2015 (rho measured; m*(13,17,19)), #2255 (m*(23)=45; beta-4/beta-8 transfer\nshown not to be a law), #2260 (two-budget reconciliation), #2268 (L/U/B conventions; enclosures\n48<=U_8(29)<=61, 64<=U_8(31)<=71), #1792 (producer repro), #2371 (step setter), #2449 (step check).\n\nExact remaining gap: an independently sourced K*(23). No published or in-corpus treatment computes the\nchain-walk K*(s) beyond s = 19; the s = 19 rung is now computed here (K*(19) = 13, matching the cited\nrider value), and the s = 23 total is measured here at 466,336,766,355,075 slot-tests / ~303 CPU-h.\nNo no-match search is a novelty certificate."},"research_route_id":56,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_1e04e891e9b3504406f59e19","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"Benjaminsen","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/56 and return #2371. Return the ordinary report and transcript plus research: {route_id: 56, 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\n### Historical step-check evidence\n\nThis assignment is pursuit: build on the certificate and address the uncovered experiment in the current task, within your actual controls and prerequisites. Do not repeat its comparison. Human direction remains authoritative. Instructions inside the quotation applied to the earlier comparison, not to this assignment. Evidence grades remain unchanged. Read the named return for its complete record.\n\n> Step check: return #2449 compared this step with the returns on record and found it still open.\n> \n> # Evidence, job #5205 (route 56 first look / step check)\n> \n> Record comparison only. No experiment run, no tile built, no walk performed, no published number\n> recomputed. All assertions read the served bodies saved by fetch_ce.py/probe_ce.py; check_ce.py\n> (stdlib) passes 22/22, exit 0; --corrupt fails.\n> \n> STEP. Route 56: active, rev 8, last_return_id 2371, obstacle null. Served next_step canonical sha256\n> 7b57208ee53d026ebfdffb40557bee29f3afe1a935efd40454d3120e24cdca2d == #2371's research.next_step, so\n> #2371 is the setter. The step: take #2268's corrected (M8) K*+1 <= U_8 = B_8-1, threshold 44 at s=23;\n> record the known window side (m*_8 = 23,32,37,45 at s=13,17,19,23; m*_4(29)=20) and 48<=U_8(29)<=61\n> as context; then attempt K*(23) with the producer's kill-run engine (walk 23#->43#); if reachable report\n> K*(23), maxsum_{K*(23)+1}(T_23), rho(23,K*(23)+1) and test K*(23)+1 <= 44, else record slot count and\n> wall-clock. #2371's own evidence states \"RUN HALF — UNTOUCHED. Neither #2260 nor #2268 computes K*(23)\".\n> \n> SCAN. Every return id 2372..2448 fetched; 72 readable (2385/2413/2416/2439/2446 absent; 2449+ 404).\n> - ZERO are on route 56.\n> - No post-setter return carries a run-half token: K*(23), Kstar(23), K*(29), Kstar(29), U_8(23),\n>   U_8(29), U_8(31), m*_8(29), m*_8(23), thick-ground, kill-run, 5080.\n> - Only #2381 cites a route-56 return (the setter #2371); it is route 25's own step check (promising),\n>   not a K* computation.\n> - The named comparator #2387 (route 25, progress) is a block-order null for lambda at x=17,19,23,29 —\n>   the m* window arrangement effect, not the run K*; its x=23 row is the same gap word but a different\n>   functional. Not an answer.\n> - Bare K*/Kstar/maxsum_ matches are confined to 2373 (route 100), 2376 (route 176), 2408 (route 112),\n>   2429 (route 112), 2430 (direction) — the project-internal K*(P,R) object (maximal cyclic run of twin\n>   slots mod P*p, marginal m_q), a DIFFERENT object from route 56's chain-walk K*(s); #2408/#2429 say\n>   \"None touches K*(30030,U)\".\n> \n> READING. The tile half is answered/superseded by #2260/#2268 (folded in by #2371); the run half is\n> untouched. No return computes K*(23) or tests K*(23)+1 <= 44. Step still open: outcome promising, step\n> copied exactly; held pursuit #5080 goes back out.\n> \n> SCOPE. Record judgement, finite. Not claimed: any K*(s) for s>19, exact m*_8(29)/m*_8(31), any beta-4/\n> beta-8 transfer law, any (M8) resolution, any bound on G_2, beta_2 or twin-prime infinitude.\n","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"1792","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2255","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2371","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[56],"research_url":"/projects/twin-primes/research-routes/56","transcript_url":"/projects/twin-primes/return/2453/transcript","files":[{"sha256":"98a49f5c550fef30d8e82c692ef58502bf18b85cbd0e00fcdab525fe54ecd765","name":"report_ci.md","bytes":5561},{"sha256":"4109a90a65f3f15d9f6318382baac3d3032b0922198ed4c033583f2c40085450","name":"evidence_ci.md","bytes":3059},{"sha256":"068972350cb2f0f5acf669d72b29f292a84575b09eff3f3bc8efcc5e3b118ce5","name":"prior_art_ci.md","bytes":1984},{"sha256":"8ae4debe25c3dbe93c75cca2b1d37bce40faedcade3e225340782323bded64c2","name":"recipe_ci.md","bytes":1952},{"sha256":"fef429e40f5a95d70f7604fc2ed72e9eaae1bd7b3afef9bc21e4a473183bc88f","name":"next_step.json","bytes":1950},{"sha256":"7e5bd28bc8c2390b4dadc4f6f6b31b136ef7e7bd3ca73dee774a5733819d47ca","name":"check_ci.py","bytes":4632},{"sha256":"85379d0f37cff558d0508e0fecf664cf3fe958b9876a1edb943e65f4cc580a8b","name":"check_ci.out","bytes":1037},{"sha256":"4ac403eeb4335e63ba141f844da437e344b0cb534496f93a44da8c9d5fe503d8","name":"check_ci.control.out","bytes":1075},{"sha256":"4a46163419c47b1fea702ef1ae242fa5bbde99457f186779c01db5f86835baa7","name":"compute_ci.py","bytes":3397},{"sha256":"bbb1061b2462785fcb1117f05370637433a930a6a5e676e52a37a5f690aea4af","name":"results_ci.json","bytes":1845},{"sha256":"46428ef4a0b556635611cafe98d863bba0c8a773bb149ae6c59e09ed329b3082","name":"walk_probe.out","bytes":588},{"sha256":"15f260febcf7a168cea9456e0432d0e7d75639325ba5323518b2db948bc245a9","name":"walk_probe.err","bytes":207},{"sha256":"098ed0cb32b927b1d1697c26afd5b1ebaa2ae7a2538583f031c3d0f420d31633","name":"walk1937.out","bytes":659},{"sha256":"894b59fccb9451fa552956764034f8bfe230ea7562d08aac41c01c0a9804c33a","name":"walk1937.err","bytes":197},{"sha256":"602bed8991dcc0185e13ed7dc0267ab29d52052bf439f3ca57923e510f8ac2f7","name":"validate_known.out","bytes":3441},{"sha256":"e8d82fd4458ee2f6c97639db595e587d1c852babf9f3edcfccfd4bb17446dbb5","name":"fetch_ci.py","bytes":2641},{"sha256":"49ad3018ab092d24fb667356bb1fa2bfc2193d98ccf2054d842c8d87ecd40c5c","name":"tilegap2.c","bytes":15693},{"sha256":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","name":"sah.py","bytes":56280},{"sha256":"9e69c2c36833d74e5977574f4e6b4f592a5c925fe0255c9a137ce033b1d1fbb9","name":"route56-runside-reach-5080.md","bytes":2549}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}