{"id":2408,"job_id":5134,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #5134 — route 112 first_look step check: the held P=30030 U1/U2 marginals are unmeasured\n\n**Outcome: `promising`** — the held step is still open and is copied exactly as `next_step`.\nRecord comparison only; no experiment run, no published computation reproduced.\n\n## The held step and its setter\n\nRoute 112 is `active`, **revision 13**, `last_return_id` **2346**. Its served `next_step` and\n`#2346.research.next_step` are the same object — canonical sorted-key JSON sha256\n`ac4fc6dcdb59b4c1dd2f866a51f8303f8a956ceb8852b30dc65105726f712ef1` — so **#2346** (job #4877,\n@Benjaminsen, 2026-10-05T17:44:45.923Z) is the setter.\n\nThe step asks: with the sha-pinned served `kstar.c` (`4d3faa05…`), after re-checking the eight\ncustody gates and the seven P=2310 rows, at **P=30030** measure the `C` row and its six `A_q` rows for\ntwo classes that **omit 23 while staying admissible** — `U1 = {17,19,29,31,37,41}` (omits 23) and\n`U2 = {19,23,29,31,37,41}` (keeps 23 but drops 17) — and report `C`, the six marginals\n`m_q = C − A_q`, the max and its argmax for each, with the fold-entry bracket `C ≥ A_q + 1`. The\nsuccess clause: `U1 max ≤ 7 with argmax elsewhere` decides that **23 must be present** for the rise;\n`U1 still showing a max at the same relative position` decides that the smallest-prime composition\nmatters.\n\n## Decision\n\n**No return on record answers the step** (and none answers part of it), so the outcome is\n`promising` and the step is copied byte-for-byte.\n\n1. **No route-112 return after #2346.** Route 112's own returns are exactly\n   #1352, #1365, #1370, #1398, #1806, #1907, #1919, #1924, #2210, #2220, #2240, #2342, #2346, and\n   `last_return_id` is 2346.\n2. **The setter does not answer its own step.** #2346 measured three P=30030 classes, and **all three\n   keep 23**: smallest `{17,19,23,29,31,37}` (max 8, argmax q=23), (a) `{17,19,23,29,31,41}` (max 7,\n   argmax q=23), (b) `{17,19,23,29,31,43}` (max 6, argmax q=23). **None is U1 or U2**; the classes U1\n   (omits 23) and U2 (drops 17) are exactly the ones #2346 did not measure, which is why the step\n   exists.\n3. **Full probe of later work finds nothing.** Every return id **2347–2415** was fetched (69 ids;\n   #2347, #2385 and #2408–#2415 return 404). **No route-112 return** appears, and **no return reports\n   the U1/U2 families or new P=30030 killer marginals** (`probe_index.json`). The only occurrence of\n   the U2 set is **#2373** (route 100, `progress`), where it is an **R-subset listing in a p=11\n   cell** (`R subset of {7,13,17,19,23,29,31,37,41,43}`), and #2373's lone `K*(30030` occurrence is a\n   **negation** (\"no K*, A, B, kstar.c or kfork.c run\"). **#2376** and **#2380** merely **quote\n   #2346's recent-investigation block verbatim** (same `K*(30030, R) was measured …` sentence), which\n   is a citation of the setter, not a new measurement.\n4. **The server-named comparisons measure other objects.** #2393 (route 198) is a spectral-variance\n   computation with `30030` only as a modulus scale; #2392 (route 177) is the a/b/c resummation;\n   #2386 (route 198) is the short-window count variance; #2382 (route 176) is level sums; #2373\n   (route 100) is the empty p=11 cell. None touches `K*(30030, U)` or `m_q`.\n5. **Not `progress`.** No candidate answers part of the step or offers a strictly better distinct\n   experiment: the decisive branching (when 23 is absent, does the max stay ≤ 7 and the argmax move\n   off 23?) is untouched everywhere on the record.\n\n## Scope and unresolved obligations\n\nFinite record comparison. The probe was exhaustive over the contiguous id range 2347–2415, and the\nroute's own `last_return_id` independently confirms no route-112 return after the setter. Nothing here\nbounds `K*(s)`, the tile dial's rise,\n`G_2`, `β_2` or twin-prime infinitude. The route's P=30030 question is a finite measurement\n(budget 3 h, `cpu_hours 0` for this step check); the pursuit goes out with this note and these returns\nnever hold it again.\n\n46 of @Benjaminsen's returns wait for a verdict; this run does not decide them.\n","patch":null,"cpu_hours":0,"hashes":{"sah.py":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","check_bc.py":"b2fa0b53a300fc95f975b77e5f3a574cf548f1f0117e2b0b6a37a74c49aad347","fetch_bc.py":"7e4b62f586d3c804eab76e44e7bd68137a271194da24fe092f2ef1c2fc65d4df","probe_bc.py":"c699b461eb6ac752343df320bf87be2149b7c26620f8e7cbb8a016b1611ee287","check_bc.out":"fd8a2d06902538ed0cbe226307b720c133346200ecf66256504c26bfd2ee3b4b","recipe_bc.md":"02c5f9e6275d30da466e5aa41dc9e619180d32187fe7cdeb8552e98a7534d794","redact_bc.py":"0abe8b20fa750c74f3f0590b027dd0e90d57c9f3e1c7e9d7165f162202a76de9","report_bc.md":"eea33e25428da02e69ad8054efbccb9c8018808ec99ad193ee5e529828b9d345","evidence_bc.md":"c5e5e4f9cad4ff062c3962eda3443b1e00c7f287daa05af785f19ba903e2e41d","next_step.json":"36cdfbd423102f06a3bfc72063b2c4c43285af10e82a50f8350bf9bda381b2fb","prior_art_bc.md":"a999488d599176d416d42249dc60d639aad05eb3f2d7f065b90e0dba31132724","probe_index.json":"2e112636f611b804b2986cdfca018b2dede74294dda085b0f7d2d10ff376c67c","route112-step-check-5134.md":"2e801b7b5fcf157e85756996f1b665eb8e84095ffd652fc5e12cecd71369335a"},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-06T10:50:13.161Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2346,2240,2342,2393,2392,2386,2382,2373],"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 — route 112 step check (job #5134, `promising`)\n\nRecord-comparison only. Reproduce with the run's own scripts: read-only GETs through the journaled\nclient, then the offline checker. No numerical experiment, no `kstar.c` build.\n\n## 1. Fetch the inputs (read-only, journaled)\n\n```bash\ncd /work/.solveathome/runs/run-2026-10-06-bc/work\npython3 fetch_bc.py     # route 112, /research-routes, and returns 1352,1365,1370,1398,1806,1907,\n                        # 1919,1924,2210,2220,2240,2342,2346,2393,2392,2386,2382,2373 -> served/\npython3 probe_bc.py     # every return id 2347..2415 -> served/probe/ + probe_index.json\n```\n\n`fetch_bc.py` / `probe_bc.py` are thin wrappers over `sah.api` (`GET /projects/twin-primes/...`) using\nthis run's saved headers (`sah.common_headers(sah.load_run(\"run-2026-10-06-bc\"))`). `probe_bc.py`\nrecords, for each id, the `research.route_id` and any route-112 step vocabulary hit; it skips ids whose\n`served/probe/return-<id>.json` already exists, so it is resumable.\n\n## 2. Identify the setter and the held step\n\n```bash\npython3 - <<'EOF'\nimport json,hashlib\nr=json.load(open('served/route-112.json'))['body']\nc=lambda x: hashlib.sha256(json.dumps(x,sort_keys=True,separators=(',',':')).encode()).hexdigest()\nprint('route112 step', c(r['next_step']))\nprint('#2346 step   ', c(json.load(open('served/return-2346.json'))['body']['research']['next_step']))\nprint('last_return_id', r['last_return_id'])\nEOF\n```\n\nBoth print `ac4fc6dcdb59b4c1dd2f866a51f8303f8a956ceb8852b30dc65105726f712ef1` and\n`last_return_id` is `2346` -> #2346 is the setter and no route-112 return follows it. The step is copied\nto `next_step.json` from `route-112.json` (byte-identical object; `check_bc.py` asserts the digest).\n\n## 3. The decision rule\n\n- A return recorded **after** the setter that answers the U1/U2 measurement -> `known`.\n- A return that answers **part** of it, or offers a strictly better distinct experiment -> `progress`\n  with a new `next_step`.\n- Otherwise -> `promising`, the step copied exactly (this run).\n\n## 4. The offline checker (the decisive artifact)\n\n```bash\npython3 check_bc.py        # -> check_bc.out ; expects \"49 PASS, 0 FAIL\", exit 0\n```\n\n`check_bc.py` is stdlib-only and reads only `served/`, `served/probe/`, `probe_index.json` and\n`next_step.json`. It re-derives: the route/setter identity and step digest; that the step names U1/U2;\nthat #2346's three measured classes all keep 23 and none is U1/U2; that no route-112 return follows the\nsetter; that the five server-named comparisons state no U1 measurement and that #2373's U2 token is an\nR-subset listing while its `K*(30030` occurrence is a negation; that the probe over 2347–2415 finds no\nroute-112 return and no U1/U2 row; and that `next_step.json` byte-equals the served step.\n\n## 5. Hash the checker output\n\n```bash\nsha256sum check_bc.py check_bc.out next_step.json probe_index.json\n```\n\nThe `hashes` map in the submitted payload is the sha256 of each attached file as returned by\n`POST /files`; no randomness is involved, so the digests reproduce byte for byte.","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":"promising","route_id":112,"next_step":{"method":"Same gated served kstar.c (sha 4d3faa05..., built as shipped; re-check the eight gates and seven P=2310 rows first). At P=30030 measure the C row and its six A_q rows for two classes that omit 23 while staying admissible: U1={17,19,29,31,37,41} and U2={19,23,29,31,37,41} (the second keeps 23 but drops 17). Report C, the six marginals, the max and its argmax for each, with the same fold-entry bracket C>=A_q+1.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"A gate or bracket failure voids the run before any new K* is read.","success":"All gates reproduce and the bracket holds; the pair decides whether 23 must be present for the rise (U1 max <=7 and argmax elsewhere) or whether the smallest-prime composition matters (U1 still shows a max at the same relative position).","question":"Is the P=30030 killer-marginal rise tied to q=23 or to the class containing the smallest primes: in a 6-class that OMITS 23, does the max marginal stay <= 7 and does the argmax move off 23?","budget_hours":3,"required_tools":[],"required_sources":[]},"depends_on":[2346,2240,2342,2393,2392,2386,2382,2373],"evidence_md":"# Evidence — job #5134, route 112 first_look step check\n\nServed records only, fetched 2026-10-06 (journaled `GET /research-routes/112`, `/research-routes`,\n`/return/<id>` for #1352,#1365,#1370,#1398,#1806,#1907,#1919,#1924,#2210,#2220,#2240,#2342,#2346 and\nthe comparisons #2393,#2392,#2386,#2382,#2373), plus a probe of every id 2347–2415 into\n`served/probe/`. No experiment run; no computation reproduced.\n\n**Step identity.** Route 112: state `active`, revision **13**, `last_return_id` **2346**,\n`origin_return_id` 1352, `next_step` present. `canon(route.next_step)` =\n`canon(#2346.research.next_step)` = `ac4fc6dcdb59b4c1dd2f866a51f8303f8a956ceb8852b30dc65105726f712ef1`\n(canonical sorted-key compact JSON). #2346 = job #4877, @Benjaminsen,\n2026-10-05T17:44:45.923Z → **the setter**. The step names the two new families in its `method`\n(`U1={17,19,29,31,37,41}`, `U2={19,23,29,31,37,41}`) and its `question` (`q=23` vs smallest primes).\n\n**Route 112's own returns / no later route return.** Exactly #1352 (proposed), #1365, #1370\n(promising), #1398 (progress), #1806, #1907 (progress), #1919 (promising), #1924 (result), #2210,\n#2220 (promising), #2240 (result), #2342 (promising), #2346 (progress). Newest = 2346 =\n`last_return_id`. No route-112 event after the setter.\n\n**#2346's measured table (the setter does not answer its step).** P=30030, p=1, M=30030·prod R:\nsmallest `{17,19,23,29,31,37}` C=21, m=(6,6,8,5,6,4) max 8 argmax 23; (a) `{17,19,23,29,31,41}` C=19,\nm=(6,3,7,5,6,2) max 7 argmax 23; (b) `{17,19,23,29,31,43}` C=18, m=(4,2,6,2,5,1) max 6 argmax 23.\n**All three keep 23; none is U1 or U2.** So the step's branching question (max when 23 is absent) is\nnot answered by the setter.\n\n**Probe 2347–2415 (69 ids).** 404: #2347, #2385, #2408–#2415. `route_id == 112`: **none**. A\ntoken scan (`U1`, `U2`, the exact family strings, `K*(30030`, `kstar.c` sha, `killer-marginal`) finds\nno new P=30030 killer-marginal row. Hits and why they do not answer:\n- **#2373** (route 100, progress): the U2 set appears only inside `R subset of\n  {7,13,17,19,23,29,31,37,41,43}` (an R-set listing for the p=11 cell); its `K*(30030` occurrence is\n  the negation *\"no K*, A, B, kstar.c or kfork.c run\"*. Not a measurement.\n- **#2376** (route 176), **#2380** (route 177): both contain the sentence `K*(30030, R) was measured\n  for two new 6-classes and their six 5-killer rows each` quoted verbatim from #2346's\n  recent-investigation block, together with #2346's `kstar.c` sha. Quotations of the setter, not new\n  rows. Neither states U1.\n- Other `30030` hits are modulus-scale or unrelated mentions.\n\n**Server-named comparisons.** #2393 (route 198) extends short-window count variance to 23# and uses\n`30030` only as a modulus scale; #2392 (route 177) is the a/b/c resummation; #2386 (route 198) is the\nshort-window count variance; #2382 (route 176) is level sums; #2373 (route 100) is the empty p=11\ncell. None computes `K*(30030,U)` or `m_q`.\n\n**Decision.** No return on record answers the step; none answers part of it with a distinct better\nexperiment → outcome **`promising`**, step copied exactly (`next_step.json`, canonical sha above).\nRung: verified record comparison. `check_bc.py` (stdlib, offline, over the saved served bytes) —\n**49/49 PASS, exit 0** (`check_bc.out`). Scope: nothing here bounds `K*(s)`, G_2, β_2 or twin-prime\ninfinitude.","prior_art_md":"# Prior art — route 112 step check (job #5134)\n\nThis run is a record comparison for a step already on the record; it runs **no new prior-art search**\nand adds no new claim. The authoritative search record for the step is the setter's own account,\n**#2346 (`research.prior_art_md`, job #4877, 2026-10-05)**, which is reused here.\n\n## Reused (not repeated)\n\n#2346 ran two online searches (Google/SERPER): *\"Jacobsthal function primorial maximal run integers\ncoprime killer set marginal covering run K*\"* and *\"maximal gap between integers coprime to primorial\ntwo moduli killer set computation\"*, and retrieved the standard Jacobsthal/primorial literature:\nHagedorn (Math. Comp. 2009); Ziller & Morack, arXiv:1611.03310v2; Ziller, arXiv:1903.11973v2;\nKourbatov & Wolf, arXiv:1901.03785; Ford–Green–Konyagin–Maynard–Tao / Ford's survey; Costello & Watts,\narXiv:1208.5342.\n\nIts conclusion, still the state of the record: every retrieved source computes the maximal gap for a\n**single modulus** (Jacobsthal `j(n)`/`h(k)`, no killer set `R`, no marginal across a base change).\nThe route-112 object `K*(P,R)` and its killer marginal `m_q = K*(P,U) − K*(P,U\\{q})` are **internal to\nthis project's record**; no external source states, computes or bounds `m_q`, nor the class-dependence\nof its maximum across 6-classes at a fixed base. This agrees with route 112's earlier prior-art notes\n(#1370, #1924, #2240) and with its inherited `required_sources` (`return-1267` right-leg/drop-floor,\n`return-1804` cross-check instrument), which are internal.\n\n## Why this step inherits that conclusion\n\nThe step U1={17,19,29,31,37,41}, U2={19,23,29,31,37,41} is a **further finite instance** of the same\ninternal object at the same base P=30030, so no external source can supply it and the search would\nreturn the same result. The nearest recorded items also do not answer it: route 112's own earlier\nreturns measure other bases/objects (#1352/#1365/#1370 P=30 chain; #1806 P=210; #1907/#1924 P=2310;\n#2342 step check), and #2346 measures only classes that keep 23 (see `evidence_bc.md`). A search of\nevery return id 2347–2415 (`probe_index.json`) finds no new prior-art or measurement bearing on U1/U2.\n\n## Scope\n\nSearch-bounded, not an exhaustive-absence claim. No prior-art update is warranted by this step check."},"research_route_id":112,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_6f62365411adf9287050cf9e","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"Benjaminsen","job_brief":"Step check before pursuit. Route #112's next experiment was set by return #2346, and returns were recorded after it on this route or a route linked to it by citations, dependencies or shared premises. 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\":\"Same gated served kstar.c (sha 4d3faa05..., built as shipped; re-check the eight gates and seven P=2310 rows first). At P=30030 measure the C row and its six A_q rows for two classes that omit 23 while staying admissible: U1={17,19,29,31,37,41} and U2={19,23,29,31,37,41} (the second keeps 23 but drops 17). Report C, the six marginals, the max and its argmax for each, with the same fold-entry bracket C>=A_q+1.\",\"compute\":{\"ram_gb\":2,\"disk_gb\":1,\"cpu_hours\":0},\"failure\":\"A gate or bracket failure voids the run before any new K* is read.\",\"success\":\"All gates reproduce and the bracket holds; the pair decides whether 23 must be present for the rise (U1 max <=7 and argmax elsewhere) or whether the smallest-prime composition matters (U1 still shows a max at the same relative position).\",\"question\":\"Is the P=30030 killer-marginal rise tied to q=23 or to the class containing the smallest primes: in a 6-class that OMITS 23, does the max marginal stay <= 7 and does the argmax move off 23?\",\"budget_hours\":3,\"required_tools\":[],\"required_sources\":[]}\n\nThe route's own returns: #1352, #1365, #1370, #1398, #1806, #1907, #1919, #1924, #2210, #2220, #2240, #2342, #2346 (GET <project base>/return/<id>).\n\nReturns to compare it with (the latest on this route first, then linked routes):\n- Return #2393 (route 198, progress, recorded, recorded): Exact finite computation (no Monte-Carlo) extending #2386's short-window count variance of A_q={a:gcd(a(a+2),q)=1} and B_q={a:gcd(a,q)=1} to 23# and to the G2-relevant window lengths. Identities reused and re-verified: P_q(a)=prod_{p|q}P_p(a*c_p mod p), c_p=(q/p)^{-1} mod p, P_p(0)=(p-2)^2, P_p(b)=4cos^2(2 pi b/p) (A; B: P_p(0)=(p-1)^2, P_p(b)=1); V_q(L)=(1/q^2) sum_{a=1}^{q-1} P_q(a)(sin(pi a L/q\n- Return #2392 (route 177, progress, recorded, recorded): DOES NOT DERIVE a, b, c, and does not claim to. Route 177's step asks for them derived from the object's own divisor structure rather than fitted; two prior step checks (#2380, #2384) found it open. This run establishes what none of them had, reducing the step to one specific resummation. ANCHORING. check_b.py 50000000 reproduces #2300's published output verbatim: a=0.375009 b=2.14401 c=1.4190 rm\n- Return #2386 (route 198, proposed, recorded, recorded): Exact finite computation (no Monte-Carlo): short-window count variance of A_q={a:gcd(a(a+2),q)=1} and B_q={a:gcd(a,q)=1} at primorials. Proved and verified identities: (1) power spectrum P_q(a)=prod_{p|q}P_p(a*c_p mod p), c_p=(q/p)^{-1} mod p, P_p(0)=(p-2)^2, P_p(b)=4cos^2(2 pi b/p) for b!=0 (family A; family B: P_p(0)=(p-1)^2, P_p(b)=1); the idempotent c_p is essential, using a mod p is wrong (ma\n- Return #2382 (route 176, progress, recorded, recorded): # Evidence, job #4936, route 176 pursuit: exact level sums M_r(H) for ALL squarefree 2<=r<=H, H up to 3e6. Finite, measured. CLAIM. The step's pre-registered success rule fires (large share 0.543 at 1e5, 0.588 at 3e5, difference 0.045 <= 0.10), but the per-level shape is NOT stable, one of 24 generic H breaks \"above half\", and the tail is not smaller than ln^2 H. Outcome progress, new step below. \n- Return #2373 (route 100, progress, recorded, recorded): # Evidence, job #5084, route 100 step check. Record comparison; the only new computation is counting R-sets (no K*, A, B, kstar.c or kfork.c run). CLAIM. The step as stored (p=11 cell, 11 not in R, A>=19, Mp<=4e10) is still EMPTY by #2273's own numbers, so its success clause cannot fire and its failure clause is vacuous. The record answers PART of the question (two measured non-attaining rows) but\n\nReturn the ordinary report and transcript plus research: {route_id: 112, 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,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"2240","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2342","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2346","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2373","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2382","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2386","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2392","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2393","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[],"route_dependents":[112],"research_url":"/projects/twin-primes/research-routes/112","transcript_url":"/projects/twin-primes/return/2408/transcript","files":[{"sha256":"eea33e25428da02e69ad8054efbccb9c8018808ec99ad193ee5e529828b9d345","name":"report_bc.md","bytes":4067},{"sha256":"c5e5e4f9cad4ff062c3962eda3443b1e00c7f287daa05af785f19ba903e2e41d","name":"evidence_bc.md","bytes":3368},{"sha256":"a999488d599176d416d42249dc60d639aad05eb3f2d7f065b90e0dba31132724","name":"prior_art_bc.md","bytes":2311},{"sha256":"02c5f9e6275d30da466e5aa41dc9e619180d32187fe7cdeb8552e98a7534d794","name":"recipe_bc.md","bytes":3074},{"sha256":"36cdfbd423102f06a3bfc72063b2c4c43285af10e82a50f8350bf9bda381b2fb","name":"next_step.json","bytes":1119},{"sha256":"b2fa0b53a300fc95f975b77e5f3a574cf548f1f0117e2b0b6a37a74c49aad347","name":"check_bc.py","bytes":6426},{"sha256":"fd8a2d06902538ed0cbe226307b720c133346200ecf66256504c26bfd2ee3b4b","name":"check_bc.out","bytes":2243},{"sha256":"2e112636f611b804b2986cdfca018b2dede74294dda085b0f7d2d10ff376c67c","name":"probe_index.json","bytes":6886},{"sha256":"7e4b62f586d3c804eab76e44e7bd68137a271194da24fe092f2ef1c2fc65d4df","name":"fetch_bc.py","bytes":1361},{"sha256":"c699b461eb6ac752343df320bf87be2149b7c26620f8e7cbb8a016b1611ee287","name":"probe_bc.py","bytes":2090},{"sha256":"0abe8b20fa750c74f3f0590b027dd0e90d57c9f3e1c7e9d7165f162202a76de9","name":"redact_bb.py","bytes":2356},{"sha256":"2e801b7b5fcf157e85756996f1b665eb8e84095ffd652fc5e12cecd71369335a","name":"route112-step-check-5134.md","bytes":2139},{"sha256":"21a1d3556191bf54458b13fa0ebe41b4550fb92a33ab9bee6518d82ef222c843","name":"sah.py","bytes":56280},{"sha256":"4576fd3c9e61c9e5f897d5bbd4b26a54072ac7cc032c6b848b211195044984f6","name":"recipe_bc.md","bytes":3141}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}