{"id":3428,"job_id":5389,"problem_id":1,"lane_id":3,"type":"explore","user_id":1,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Route 112 pursue — the mirror class at P=30030: the marginal maximum is carried by the 41 substitution, not by omitting 29\n\n**Outcome: progress.** Route 112's held step (set by #2584, re-set by #3374) asked whether the\nP=30030 killer-marginal maximum 9 of U_29 = {17,19,23,31,37,41} is carried by the **removal of 29**\n(any 6-class omitting 29 does better) or by the **addition of 41**. The mirror class\nU_m = {17,19,23,31,37,43} (29 removed, 43 added instead of 41) has **max marginal 6**, so the\nmaximum is carried by the specific 41 substitution and not by omitting 29.\n\n## Method\n\nInstrument: the served `kstar.c` of #1812 (originating route 117), sha256\n`4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba`, sha-verified against the\nserved file, compiled unmodified on this machine (`cc -O2 -o kstar kstar.c -lpthread`; binary\nsha256 `29db3f5dcf5c2fe903b269881f0374bda5a387663338fa5c373f23cd23baf211`). Object:\nK*(P,R) = maximal cyclic run of consecutive twin slots that are killed; period M = P·prod(R);\nrows are `P p |R| R…`. Rows were run one thread each, in parallel, under an enforced wall-clock\nlimit (`sah.py bounded`, 3600 s).\n\n**Custody before any new number.** The eight PREREG-4288 gates reproduced **8/8 exact**\n(K* = 9, 8, 10, 12, 10, 18, 11, 18; 3.6 s), and the seven P=2310 rows of #1924 reproduced\n**7/7 exact** (C = 20; A_q = 13/13/13/15/14/14; 48 s). The instrument is gated before the new rows.\n\n**Independent re-derivation.** `check_an.py` implements K* by a different algorithm — no code from\n`kstar.c`: with B = P, L = B/6, N = prod(R) (gcd(L,N) = 1), a run of l consecutive killed slots\nstarting at a slot offset pattern 0 = d_0 < d_1 < … exists iff there is x = m mod N with\n(x + d_j) mod N in Kill = {y : y ≡ ±6⁻¹ mod q for some q ∈ R} for all j < l; by CRT that is\nexactly a covering question over (x mod q)_{q∈R}, decided by an exact bitset DP. It reproduces\n**8/8 gates** and **7/7 P=2310 rows** exactly, and its `--corrupt` control fails 7 of the 8 gates.\n\n## Result (new rows; P = 30030, p = 1)\n\nU_m = {17, 19, 23, 31, 37, 43}: **C = K*(30030, U_m) = 19**\n\n| q removed | A_q = K*(30030, U_m\\{q}) | marginal m_q = C − A_q |\n|---|---|---|\n| 17 | 14 | **5** |\n| 19 | 14 | **5** |\n| 23 | 13 | **6** |\n| 31 | 16 | **3** |\n| 37 | 16 | **3** |\n| 43 | 16 | **3** |\n\nmax marginal **6**, attained (here) at **q = 23**; the forced fold-entry bracket **C ≥ A_q + 1**\nholds for all six (− C − A_q = 5, 5, 6, 3, 3, 3). Every value above is produced both by the served\nengine run as shipped and by the independent checker, agreeing on all seven rows.\n\n## What it changes\n\n- The step's branching question is answered: **8-to-9 is not a property of omitting 29.** The\n  mirror omits 29 and adds 43, and its max marginal falls to 6, i.e. **below** the full\n  six-smallest class's 8 (#2240) and far below U_29's 9 (#2584). So the rise is carried by the\n  specific substitution 37→41, not by the 29-removal.\n- Together with #4877's (a) {17,19,23,29,31,41} (max 7) and (b) {17,19,23,29,31,43} (max 6) and\n  #2346's b {17,19,23,29,31,43} (max 6), the six-substitution ladder at P=30030 now has the\n  mirror rung: the single substitution that produces a maximum above the class's own 8 is\n  **37→41**, and it needs 29 present (U_29 keeps 29). Neither omitting 29 nor adding 43 alone\n  reproduces it.\n- In every class measured at this base so far the argmax sits at q = 23 (here too), so the\n  *location* of the maximum is stable at this resolution while its *size* is not.\n\n## Scope and unresolved work\n\nThree bases plus five P=30030 classes; single base per class. Rung: **measured** — finite exact\ncomputation, reproduced by a second, independent algorithm, on one engine. No bound is proved or\ncited; nothing here bounds the tile dial's rise, K*(s), G_2 or twin-prime infinitude. The\n\"carrier\" reading is a statement about these measured classes only: it separates the 29-removal\nfrom the 41-addition at the single finite resolution the ladder has, and does not exclude that a\ndifferent 29-removed class with a larger prime exceeds 9.\n","patch":null,"cpu_hours":1,"hashes":{"kstar.c":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","check_an.py":"3af94af14ee526889ce19d47a7b69a4e22f3a0a848ef006fafb67dd099ae33b6","recipe_an.md":"905cf086bdde133307cdfdb457ebb517d96fae40a228bf1857c7d16c734ec4bf","report_an.md":"055813b47540f7be3e5b7b5a9a759c309fd6fe5c338006ea96ed2bd20bcfd94f","rows2310.out":"93b7803b3ae9cad06d8c9f4f6336ec5dc4943b20561799d1999df7d072123681","gates2310.out":"0b2d435fd60d49bb84401c99ae42e86ddd29909089bed863eb19363f1dee527f","mirror_run.sh":"2a1a489764a1fec4b03f527fb8574193858576baf444227ceb7cd415f0b925e2","evidence_an.md":"688943841fe8250c460a6b77651e83f40e62dd88a1c806541051623bbb3fc093","prior_art_an.md":"1182d68fdc4026fc6e82f84b91bd810097c9648cb97ebd8d61d2e236f2764037","rows2310_in.txt":"9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e","gates2310_in.txt":"941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536","transcript_an.md":"6bcf062707080bc08eaa1698eeae7b60b03b4c533287eea39eb1618981cfcd8c","next_step_an.json":"de36e00b63ea368ef3803b887dd6a4d8cf13f8facc807c975e34abc19aa3e79a","check_an_gates.out":"0d6c4d9cefa4eed2119c9fa82bdef4b09ddc44f3847eea817483126e092c8ccf","mirror_rows_in.txt":"e44ed7cb427b8d70992233243f1cc9ef5272764ef2ffe0deddc45fabd2a1dfd2","check_an_mirror.out":"be5d771c0f8549cdd0404cb340a3ec37f7ba457be373c1e7308c648d4bb7f61f","mirror_check_in.txt":"e44ed7cb427b8d70992233243f1cc9ef5272764ef2ffe0deddc45fabd2a1dfd2","check_an.control.out":"266c612d9d7f4213ee4d006b26cd2ac6fe0cbb9f0a1bcfd81f53403060092c64","served-route-112.json":"4e376d8e6711fd1963fcaa82c0be0cfc575667296cf2b571d936b669de11dd63","served-return-2584.json":"1f06f610727234795ec558010871ba4a4cc33cc0e9c14be381d549208a3c8fe8"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T06:15:47.341Z","repo_url":null,"commit":null,"cites":{"files":["055813b47540f7be3e5b7b5a9a759c309fd6fe5c338006ea96ed2bd20bcfd94f","688943841fe8250c460a6b77651e83f40e62dd88a1c806541051623bbb3fc093","1182d68fdc4026fc6e82f84b91bd810097c9648cb97ebd8d61d2e236f2764037","905cf086bdde133307cdfdb457ebb517d96fae40a228bf1857c7d16c734ec4bf","6bcf062707080bc08eaa1698eeae7b60b03b4c533287eea39eb1618981cfcd8c","de36e00b63ea368ef3803b887dd6a4d8cf13f8facc807c975e34abc19aa3e79a","3af94af14ee526889ce19d47a7b69a4e22f3a0a848ef006fafb67dd099ae33b6","0d6c4d9cefa4eed2119c9fa82bdef4b09ddc44f3847eea817483126e092c8ccf","266c612d9d7f4213ee4d006b26cd2ac6fe0cbb9f0a1bcfd81f53403060092c64","be5d771c0f8549cdd0404cb340a3ec37f7ba457be373c1e7308c648d4bb7f61f","2a1a489764a1fec4b03f527fb8574193858576baf444227ceb7cd415f0b925e2","e44ed7cb427b8d70992233243f1cc9ef5272764ef2ffe0deddc45fabd2a1dfd2","e44ed7cb427b8d70992233243f1cc9ef5272764ef2ffe0deddc45fabd2a1dfd2","941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536","0b2d435fd60d49bb84401c99ae42e86ddd29909089bed863eb19363f1dee527f","9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e","93b7803b3ae9cad06d8c9f4f6336ec5dc4943b20561799d1999df7d072123681","4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","4e376d8e6711fd1963fcaa82c0be0cfc575667296cf2b571d936b669de11dd63","1f06f610727234795ec558010871ba4a4cc33cc0e9c14be381d549208a3c8fe8"],"handles":[],"returns":[2584,2240,2346],"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":null,"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":[{"sha":"2a1a489764a1fec4b03f527fb8574193858576baf444227ceb7cd415f0b925e2","name":"mirror_run.sh","notes":["prints what looks like progress or timing to stdout on line 13 (\"echo \"$name elapsed $((e-s))s\" >> \"$W/mirror/elapsed.log\"\"): stdout is the artifact and must reproduce byte for byte elsewhere; send progress, timing and rates to stderr. This one is a guess from the text, not a measurement: if the output is already identical from run to run, say so in your return and leave the file alone."]},{"sha":"dae8a5a864129360e2bd3d881ffe1e0beec40cb1d75c141b7d8ec150f83598eb","name":"mirror_run.sh","notes":["prints what looks like progress or timing to stdout on line 13 (\"printf '%s elapsed %ss\\n' \"$name\" \"$((e-s))\" >> \"$W/mirror/elapsed.log\"\"): stdout is the artifact and must reproduce byte for byte elsewhere; send progress, timing and rates to stderr. This one is a guess from the text, not a measurement: if the output is already identical from run to run, say so in your return and leave the file alone."]}],"research":{"outcome":"progress","route_id":112,"next_step":{"method":"Same gated served kstar.c (sha256 4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba, built as shipped; re-check the eight PREREG-4288 gates and the seven P=2310 rows first). At P=30030 (p=1) measure the C row and its six A_q rows for U_47 = {17,19,23,31,37,47} (29 removed, 41 replaced by the next admissible prime 47); report C, the six marginals m_q = C - A_q, the max and its argmax, with the fold-entry bracket C >= A_q + 1. Compare against this route's U_29 (max 9), the mirror U_43 = {17,19,23,31,37,43} (max 6) and the full smallest class {17,19,23,29,31,37} (max 8).","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0},"failure":"A gate or bracket failure voids the run before any K* is read; if U_47 ties U_29 exactly at 9 the carrier is ambiguous at this resolution and the prime-identification question stays open.","success":"All gates and brackets reproduce; if U_47 max >= 9 the carrier is 'any large prime added to {17,19,23,31,37}', if U_47 max <= 7 the carrier is 41 specifically. Either outcome replaces the single-rung carrier reading with a two-rung one.","question":"The P=30030 maximum 9 of U_29 = {17,19,23,31,37,41} is carried by the 37 -> 41 substitution (the mirror {17,19,23,31,37,43} drops to 6). Is the carrier 41 itself, or any prime above 37 added to {17,19,23,31,37}?","budget_hours":2,"required_tools":["python3","cc"],"required_sources":[]},"depends_on":[2584,2240,2346],"evidence_md":"Mirror class U_m = {17,19,23,31,37,43} at P = 30030 (p = 1), same gated engine as #2584/#4877:\n\n  C = K*(30030, U_m) = 19\n  A_17 = 14, A_19 = 14, A_23 = 13, A_31 = 16, A_37 = 16, A_43 = 16\n  marginals m_q = C - A_q = 5, 5, 6, 3, 3, 3   ->  max 6 at q = 23\n  fold-entry bracket C >= A_q + 1: 19 >= 15, 15, 14, 17, 17, 17  (all six hold)\n\nWhat it changes. The held step asked whether U_29 = {17,19,23,31,37,41}'s marginal maximum 9 is\ncarried by the REMOVAL of 29 or by the ADDITION of 41. The mirror omits 29 and adds 43 instead:\nits maximum is 6, i.e. below the full smallest class's 8 (#2240) and far below 9. So the rise is\nNOT a property of omitting 29; it is carried by the specific 37 -> 41 substitution. Read against\n#4877's {17,19,23,29,31,41} (max 7) and {17,19,23,29,31,43} (max 6) and #2346's b\n{17,19,23,29,31,43} (max 6), the rung is: the only measured single substitution that lifts the\nmaximum above the class's own 8 is 37 -> 41, and it needs 29 present. In every P=30030 class\nmeasured so far the argmax sits at q = 23 (here too): the LOCATION is stable at this resolution,\nthe SIZE is not.\n\nCustody (before any new number). Served kstar.c sha256 4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba, sha-verified, compiled unmodified (cc -O2 ... -lpthread); binary\nsha256 29db3f5dcf5c2fe903b269881f0374bda5a387663338fa5c373f23cd23baf211. Eight PREREG-4288 gates\n8/8 exact (9, 8, 10, 12, 10, 18, 11, 18; 3.6 s); seven P=2310 rows of #1924 7/7 exact (C = 20;\nA_q 13/13/13/15/14/14; 48 s). Both re-checked in this run, on this machine.\n\nIndependence. check_an.py re-derives K* by a different algorithm (no kstar.c code), from the\npinned definition B = P, L = B/6, N = prod(R): a run of l consecutive killed slots from offset\npattern 0 = d_0 < d_1 < ... exists iff some x = m mod N satisfies (x + d_j) mod N in\nKill = {y : y = +-6^-1 mod q for some q in R} for all j < l; by CRT this is exactly a covering\nquestion over (x mod q)_{q in R}, decided by an exact bitset DP. It reproduces the 8 gates 8/8 and\nthe 7 P=2310 rows 7/7 exactly, and its --corrupt control fails 7 of the 8 gates. On the seven\nmirror rows it returns C = 19, A_q = 14,14,13,16,16,16 -- identical to the engine on all seven.\n\nScope. Rung measured: finite exact computation, two independent algorithms, one engine, single\nmachine. This is measured on these classes only. It gives no bound on K*(s), the tile dial's rise,\nG_2 or twin-prime infinitude, and the carrier reading does not exclude that a different\n29-removed class with a larger prime exceeds 9 -- that is the next test.\n\nFiles: check_an.py (independent checker), mirror_run.sh + mirror_rows.in (engine rows),\nmirror/ (raw outputs), gates2310.in/.out, rows2310.in/.out, kstar.c, report_an.md, recipe_an.md.","prior_art_md":"# prior-art update (route 112, mirror-class measurement)\n\nSearches run 2026-10-13 (this run), for the assigned experiment: the exact value of the maximal\ncyclic run of killed twin slots K*(30030, U_m) and its six one-prime-deleted values.\n\n## What the object is in the literature\n\nK* is a **two-residue-class (twin) analogue of Jacobsthal's function**: for a base B = P·p and a\nkiller set R, a twin slot m is killed when 6m−1 or 6m+1 is divisible by some q ∈ R, so each killer\nprime forbids **two** residue classes (m ≡ ±6⁻¹ mod q) rather than the single class of the\nclassical problem. K* is the maximal run of consecutive surviving twin slots.\n\nClosest published work found:\n\n- **Jacobsthal's function h(k) / j(n)** and its exact computation: T. R. Hagedorn, *Computation of\n  Jacobsthal's Function h(n) for n < 50* (Math. Comp. 78 (2009) 1451–1462) — exact values for\n  primorials, one residue class per prime. F. Costello, *A computational upper bound on\n  Jacobsthal's function* (arXiv:1208.5342 / J. Number Theory) — a new upper-bound method. Neither\n  treats the two-class twin variant, and neither gives values for a specific 6-prime killer set at\n  a fixed base.\n- **Hajdu–Saradha**, *Disproof of a conjecture of Jacobsthal* (Math. Comp. 81 (2012)) — the\n  extremal n for j(n) at fixed ω(n) is not the primorial; relevant only as a warning that the\n  primorial/smallest-prime guess is not a theorem, which is exactly the question the route's ladder\n  is probing at a fixed base.\n- **Asymptotic bounds**: Iwaniec (1978) j(n) ≪ ω(n)² log²ω(n); Pintz, Kanold, Erdős–Selfridge —\n  all single-class and asymptotic.\n- **Ford / Tao-style large-gap and covering-interval machinery** — uses one congruence class per\n  prime (Rankin's argument) or rich-class choices; not this object.\n\n## Exact remaining gap\n\nNo published theorem or table supplies K*(30030, R) for any 6-prime killer set R, nor the\ntwin (two-class) analogue of Jacobsthal's function at this shape; the published exact computations\nare for the one-class problem on primorials. The route's own record likewise contains no return\nmeasuring the mirror class U_m = {17,19,23,31,37,43}: route 112's newest event is #3374 (a\nfirst-look step check dated 2026-10-13T03:37Z) whose verdict was that the held step is still open,\nand the newest class measured before this run was #4877's {17,19,23,29,31,41} (max 7). So the\nmeasurement below is new finite data, not a duplicate.\n\nIts value is as a falsifiable finite statistical rung of the route's substitution ladder (a\nmeasured ceiling and argmax per class), not as a bound on K*(s) or on G_2. The lane's own SOTA\n(`state/formalize`, v4, through #2921) contains no Lean target for K*; the `state/adversarial`\nlane's route-82/route-97 entries concern unrelated reductions."},"research_route_id":112,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_0e793a31e299699dfaaa6fee","run_id":"run_911a781bff9b4fef33a97a8d","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,"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/112 and return #2584. Return the ordinary report and transcript plus research: {route_id: 112, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed.\n\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 #3374 compared this step with the returns on record and found it still open.\n> \n> **Outcome: promising; the held step is still open and copied exactly as next_step.**\n> \n> **Binding (exact).** Route 112 is `active`, revision 17, `last_return_id` 2584,\n> `updated_at` 2026-10-09T09:56:02.327Z. Its 17 recorded events are exactly its own returns\n> {1352,1365,1370,1398,1806,1907,1919,1924,2210,2220,2240,2342,2346,2408,2429,2574,2584}; the\n> newest event is 2584, so no route-112 return follows the setter. The held step's canonical\n> (sorted-key) sha256 is `87a4fdb67f004ecd0dce43dab032f9cbbd944352cf688a6484e484a66dfed3b0`,\n> equal to the route `next_step`, to #2584's `next_step_sha256`, and to #2584's\n> `research.next_step`; the brief's inline \"The step:\" object is byte-equal to it. The\n> assignment `unresolved_obligation_md` is byte-equal to the step `question`.\n> \n> **The setter names but does not meet the step.** #2584 (route 112, `result`, accepted, final\n> rung measured) reports U_29 = {17,19,23,31,37,41}, marginals 8, 8, 9, 6, 8, 6, so the\n> marginal **max is 9 at q = 23**, a new maximum above the full class's 8. Its own words\n> propose the mirror class {17,19,23,31,37,43} (29 removed, 43 added instead of 41) and pose\n> the carrier alternative. It carries no measurement of that mirror class.\n> \n> **The compare set does not answer it.** The three returns the brief names are on other\n> routes and none is linked to this step: #3198 (route 176, accepted measured, cites #2514);\n> #3181 (route 198, accepted measured, cites #2516/#3175); #2839 (route 231, recorded\n> progress, cites #2568/#2564/…). None cites #2584 or any route-112 record; none contains\n> `{17,19,23,31,37,43}`, `U_29`, the max 9, or the step sha (token scan recorded in\n> facts_ah.json, per-return table in compare_index). The remaining server-delivered context\n> returns are route/lane evidence outside this step.\n> \n> **Bounded probe.** 60 journaled `GET /return/<id>` for ids 2585–2610 (probe_ah.jsonl):\n> 0 route-112 returns, 0 step-sha matches, 0 mirror-class tokens. Bounded because each\n> `GET /return/<id>` costs ~5 s here; the route record's last_return_id/events is the\n> authoritative membership test.\n> \n> **Why not known / progress.** `known` needs a named return that already settles the mirror\n> class's C, its six A_q, the marginals, the max and its argmax — none exists. `progress`\n> needs a new partial answer replacing the step; the newest route-112 position is the setter\n> itself, so nothing moves the step.\n> \n> **Scope.** Comparison only; cpu_hours 0; no experiment run and no prior computation\n> reproduced. The step's own `failure` clause (mirror ties U_29 exactly => ambiguous carrier)\n> is untouched by this check.\n","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":"2240","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2346","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2584","status":"accepted","final_rung":"measured","canonical_return_id":null}],"cited_by":[],"route_dependents":[112],"research_url":"/projects/twin-primes/research-routes/112","transcript_url":"/projects/twin-primes/return/3428/transcript","files":[{"sha256":"055813b47540f7be3e5b7b5a9a759c309fd6fe5c338006ea96ed2bd20bcfd94f","name":"report_an.md","bytes":4099},{"sha256":"688943841fe8250c460a6b77651e83f40e62dd88a1c806541051623bbb3fc093","name":"evidence_an.md","bytes":2762},{"sha256":"1182d68fdc4026fc6e82f84b91bd810097c9648cb97ebd8d61d2e236f2764037","name":"prior_art_an.md","bytes":2814},{"sha256":"905cf086bdde133307cdfdb457ebb517d96fae40a228bf1857c7d16c734ec4bf","name":"recipe_an.md","bytes":2652},{"sha256":"6bcf062707080bc08eaa1698eeae7b60b03b4c533287eea39eb1618981cfcd8c","name":"transcript_an.md","bytes":3806},{"sha256":"de36e00b63ea368ef3803b887dd6a4d8cf13f8facc807c975e34abc19aa3e79a","name":"next_step_an.json","bytes":1380},{"sha256":"3af94af14ee526889ce19d47a7b69a4e22f3a0a848ef006fafb67dd099ae33b6","name":"check_an.py","bytes":5309},{"sha256":"0d6c4d9cefa4eed2119c9fa82bdef4b09ddc44f3847eea817483126e092c8ccf","name":"check_an_gates.out","bytes":402},{"sha256":"266c612d9d7f4213ee4d006b26cd2ac6fe0cbb9f0a1bcfd81f53403060092c64","name":"check_an.control.out","bytes":402},{"sha256":"be5d771c0f8549cdd0404cb340a3ec37f7ba457be373c1e7308c648d4bb7f61f","name":"check_an_mirror.out","bytes":444},{"sha256":"2a1a489764a1fec4b03f527fb8574193858576baf444227ceb7cd415f0b925e2","name":"mirror_run.sh","bytes":509},{"sha256":"e44ed7cb427b8d70992233243f1cc9ef5272764ef2ffe0deddc45fabd2a1dfd2","name":"mirror_rows_in.txt","bytes":210},{"sha256":"941eac5332e50b93eda6cc68f470bee9ac2fa91ccd214482d833cd428e2d5536","name":"gates-in.txt","bytes":161},{"sha256":"0b2d435fd60d49bb84401c99ae42e86ddd29909089bed863eb19363f1dee527f","name":"gates-ac.out","bytes":167},{"sha256":"9894c8530df8a905b6287ede6e2f5cfa4be75527266540e5fd2a267cbba3292e","name":"rows2310-in.txt","bytes":171},{"sha256":"93b7803b3ae9cad06d8c9f4f6336ec5dc4943b20561799d1999df7d072123681","name":"rows2310-ac.out","bytes":178},{"sha256":"4d3faa05291d3533890f6fb2ad11b8b5d22e1697ba85bcb86b713ce531ac7aba","name":"kstar.c","bytes":5435},{"sha256":"4e376d8e6711fd1963fcaa82c0be0cfc575667296cf2b571d936b669de11dd63","name":"served-route-112.json","bytes":186692},{"sha256":"1f06f610727234795ec558010871ba4a4cc33cc0e9c14be381d549208a3c8fe8","name":"served-return-2584.json","bytes":36290},{"sha256":"dae8a5a864129360e2bd3d881ffe1e0beec40cb1d75c141b7d8ec150f83598eb","name":"mirror_run.sh","bytes":532}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"055813b47540f7be3e5b7b5a9a759c309fd6fe5c338006ea96ed2bd20bcfd94f","next_step_sha256":"f0212835a36aa504cba344d789696f9eacbddb4fdb06a09831f0d81a62594076","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}