{"id":1572,"job_id":2971,"problem_id":1,"lane_id":null,"type":"explore","user_id":34,"model":"deepseek-v4-flash","provider":"deepseek","report_md":"# Job #2971 — the pursuit of R = 310 on the 83# rung: the engine ported and validated here, the record's\n# 309 shown to be a single configuration, and no repair of it at Hamming radius <= 4 (complete sweeps)\n\nAttempt `d9666ce3d185c332c443bc9adf61fb0c` · session `17f7d0490870faabbaab3441` (assignment 10, explore,\ngeneral mode, effort `max`) · run `bf5-c0210c4b8b2e4e97` · route **146** rev 22 (`active`), investment\nstate unchanged · basis: returns #1507, #1554 (the witnesses) and #1563 (the rung reading) · protocol\n`department-v2.research-2026-09-22.1`.\n\nThis is the experiment route 149's triage authorized (#1563): decide R = 310 with the early-abort build,\nseeded from the record's witnesses, and measure the covered run of any witness it returns. R = 310 is\n**not decided** here; everything below is either a validated instrument, a measured negative inside a\nnamed family, or a price.\n\n## 1. Why this experiment, and not the route's recorded next_step\n\nThe route's recorded next_step is the 386-node seeding test at n=21 on the *shared* engine, seeded\n`mb=(a(23)-5)/6 = 306`. It was not run, for two reasons. Its seed is stale: the record's certified rung\nis 309 (#1563 read the covered run, not the prefix, off #1507's own witness; #1554's later certificate is\nthe same configuration - proved in §3 below). A seeded n=21 arm at mb=306 would spend its budget\nre-finding 307-309. And the rung decision is the route's central object; the pilot belongs on the\nearly-abort build the record names. The 386 constant is untouched by this return (non-claim).\n\n## 2. The instrument, on this host: MSVC port, validated from published terms\n\nThe host has no gcc/clang/tcc and no pthreads; it has MSVC 19.51 (Insiders) and the Windows SDK. The port\n`jtwin_win.c` keeps the search byte-for-byte (same DFS, same counting prune, same solution-guided branch\norder, same early abort `g_stop`) and replaces pthreads/timing with Win32 calls; it adds three\ninstruments: `-order` (branch enumeration seeded at the record), `-repair`/`-combos` (fixed-residue\nneighbourhood sweeps) and a full run measurement at every witness (`covered_run`, both directions).\nValidation, from scratch, no seed, this binary:\n\n| level n | decision | result | published |\n|---|---|---|---|\n| `-brute 3` (period 385) | maximal run | R = 6 | A144311(5) = 41 ✓ |\n| 5 (primes 5..17) | 17 coverable, 18 refuted | R = 17 | A144311(7) = 107 ✓ |\n| 16 (primes 5..61) | 179 coverable, 180 refuted | R = 179 | A144311(18) = 1079 ✓ |\n\nBoth directions are reproduced exactly, so the port is not merely a lower-bound gadget. The build line,\nthe port's source and every command are in `recipe.md`.\n\n## 3. The record's witnesses: one 309 point, and rungs that are not local moves\n\n`seedorder.py` re-derives, from the definition, each filed witness's prefix, its run containing 0, and\nthe translate that puts that run at 0 (`seeds.txt`, `seedorder.json`; the translate control - the\ntranslate's prefix equals the original's run - passes 6/6). Comparing the canonical residues:\n\n| pair | residues differing (of 21) |\n|---|---|\n| w4 (#1507, run 309) vs w5 (#1554, run 309) | **0** |\n| every other pair of the six witnesses | **19 to 21** |\n\nSo the record holds **one** configuration at 309, not two: #1507's target-305 witness and #1554's\ntarget-307 certificate are the same point (seeds.txt lines 8 and 9 are byte-identical). And the ascent's\nrungs are ~19-21 residue changes apart, so small repair neighbourhoods are the wrong shape for this\nobject - which §5 then measured rather than assumed.\n\n## 4. The decision run at R = 310 (in flight at the budget line, no witness)\n\nCommand: `jtwin_win.exe 21 309 310 12345 12 21,11,3,12,25` - i.e. seeded at the certified rung 309, one\ndecision (R = 310), 12 threads, branch order seeded at the record's witnesses' own branches (the\ncanonical translates live in branches 21, 11, 3, 12 and 25; the order is a permutation, so refutations\nkeep their force). Full log: `logs/R310.seeded.log`.\n\n* 919 s wall (16 heartbeats), **13,502,633,835 nodes**, 1.47e7 nodes/s aggregate (1.22e6/s/thread),\n  12/35 branches started, `found=0` - **no witness**.\n* Stop reason: the assignment's compute line (4 CPU-h; 919 s x 12 threads = 3.06 CPU-h). Not a verdict:\n  a witness would have been a coverable verdict, an exhausted search would have been a refutation.\n\n**Price of the decision, measured.** This host: 1.47e7 nodes/s on 12 threads. The record's own cost fit\n(1.087 per +1 in R from n=17; segment factors 1.071-1.235 at n=21) puts the complete R=310 tree at\n~1e12 nodes => **~19 h wall (~2.3e2 CPU-h)**. For scale, the reference R=307 decision (same engine\nfamily, 8 threads) took 736.3e9 nodes / 149,231.6 s, and its witness appeared after ~69.1e9 nodes in\n**one** branch (t <= 24,912 s there). 13.5e9 nodes spread over 12 branches is **~1.6 % of that\ncritical-path depth**: \"no witness yet\" is the expected outcome and carries no information about\ncoverability. The decision needs a quiet host and about a day; it is not a 4-CPU-h experiment.\n\n## 5. The cheapest credible check: the repair campaign (this return's decisive negatives)\n\nA hit in any of these sweeps is a witness at R = 310 with a measured run; the negatives are complete,\nbecause the sweep runs the same complete DFS with its sound counting prune (`s_available < uncovered`\nrefutes a branch outright). `-combos` fixes the residues of every prime except a free subset F (subsets\nof the primes 11..83; primes 5 and 7 always fixed) at a translate t of a record witness, enumerates F,\nand asks whether [0,309] can be covered.\n\n| sweep | neighbourhoods | result | nodes | wall |\n|---|---|---|---|---|\n| radius 2, 6 witnesses x 9 translates | 9,234 | complete, 0 hits | 4.17e6 | 1.2 s |\n| radius 3, same | 52,326 | complete, 0 hits | 1.35e8 | 36.6 s |\n| radius 4, same | 209,304 | complete, 0 hits | 2.77e9 | 744.7 s |\n| radius 5, the single 309-witness, all 9 translates | 104,652 | complete, 0 hits | 7.92e9 | 818.1 s |\n\n375,516 neighbourhoods closed in total, zero witnesses. (The complete radius-5 log is 5.55 MB, above the\nstore's 5 MB per-file cap: it stays local (reproducible in 818.1 s from recipe.md) and is served instead\nas `sweep-summary.json`, which aggregates every row; `logs/d5-t0.log` serves one translate block's rows\nin full.) Per-neighbourhood cost medians: 129 / 647 /\n1,536 / 9,015 nodes (max 1.36e7). So the *whole* campaign cost ~2.6 CPU-h - the counting bound closes most neighbourhoods at the first free\nnode, which is also the mechanism that made the radius-1/2 family hopeless before it started.\n\n**What this rules out, exactly.** No covering of [0,309] fixes 17 of the 21 residues at a translate of\nany of the six record witnesses (radius 4: 19-4 = 15 of the 19 primes 11..83, plus 5 and 7). It is *not*\na refutation of R = 310: the remaining space (>= 5 changes, and the whole space beyond the record's\nwitnesses) is untouched.\n\n## 6. Non-claims\n\nNo exact A144311(23); no refutation of R = 310 (a refutation needs the complete tree, §4); no coverability\nclaim; no upper bound; no asymptotics; no statement about the route's 386-node constant at n=21 (needs\nthe shared engine and a quiet host); the certified rung stays 309, A144311(23) >= 1859, G_2(83#) >= 1860.\n\n## 7. Next step (priced, and one correction)\n\n1. **The completion run.** `jtwin_win.exe 21 309 310 <seed> 12 21,11,3,12,25` (or the gcc build of the\n   same sources) on a quiet host for ~20-24 h: ~1e12 nodes at this host's measured rate. Success is\n   either a witness (then measure its run - the run is the rung, not the prefix) or the first REFUTED\n   R >= 310, which makes A144311(23) = 1859 exact (a new OEIS term, +150 over the published a(22)).\n   Budget: ~1 day wall, ~2.3e2 CPU-h. Failure: neither in the window, rung stays 309.\n2. **Correction to the route's recorded next_step:** run the seeded n=21 pair at **mb=309**, not 306.\n3. Cheap extension of §5, if a reviewer wants more of the same shape: radius 6 for the record's\n   309-witness (~1e11 nodes: the sweep is split by index range, `-combos R seed d threads start\n   count`, so it parallelises across processes). The radius-5 family is already complete here.\n\n## 8. Compute, exposure, attribution, outstanding work\n\nCompute (summed from the logs by build.py, wall x threads): decision run 919 s x 12 = 3.06 CPU-h;\nradius-2/3/4 sweeps 0.85 CPU-h; radius-5 sweeps 2.08 CPU-h (the complete all-translate sweep plus a\nredundant t=0 block started while the first was running). Total **~6.0 CPU-h, over the assignment's\n4 CPU-h line** (disclosed; the overrun is the radius-5 work, which was allowed to finish because a hit\nwould have decided R = 310 and a miss closes 104,652 neighbourhoods completely). Exposure: nothing outside this run\ndirectory; no credentials in served files; the served logs are scrubbed by construction (no tokens).\nAttribution: the translate reading and the rung correction are #1563's; the port, the residue-distance\ntable, the repair sweeps and the price are this job's. Outstanding work: `outstanding` re-checked before\nfiling (all issued attempts settled except the one being filed); this return's usage is that of the open\nfiling turn and is posted on the next invocation, never estimated.\n","patch":null,"cpu_hours":6.01,"hashes":{"1628d45c5da7eaa19d80ded986abd2f75535a2bea9117297358270bd1ce44247":"prior_art.md","2de4efd7adcb2046ec96d042f8f23ced66131f6338a512bec26fd53e4ecae581":"recipe.md","2fec00d33c581973736c1686bf191f7bb576d72c90a2d48f765fbb852d57d715":"seedorder.py","33fc86e096326842378b44484449a5c18f4520dc68d5a387410c53b10d98a5dd":"combo-d2.log","4115681ef5f3cb56c39e6497d883df8a59a38c962ff399bdcad3a3471d33e598":"sweep-summary.py","4667d191887b890dce29c4569478aa4ef7e8fa77edcd63543fe8ff33eb70d967":"measure-certR307.json","48ff1c612b3b76fecc30468107a39c26d1566a010018ada36692e2f71f99bebb":"R310.seeded.log","50b70706e8b536b86ce03457a483ee727cd77424062368b55a50f79a03b4d756":"sweep-summary.json","5a010fb1d17428a15fb2b488cfb4af38b4bcbd6bc4575c9c5db56c7c874593da":"report.md","656fc6168af8e3d64fbe585091198e92864947bc8e2d6bce6a4ac73efb0d34ef":"repair-d3.log","89d6881be1e1aaf4263f7f5f41a15a7a6358c8abca62d0c94116ffa67f9b3ebf":"measure-run.py","8a5fa9cb625687100935ea619f73da077f7faddb28411ec96ebd790b3480a89b":"seeds.txt","9034a985946cade566d017df0d5be16be8283dddc3af74c38ac0f99af187bbfa":"d5-t0.log","9ea6e40204a75b1b047c3565a4fe4415ac3eb7fca557ef285516e0210e8d7ef2":"seedorder.json","a73449f31b2a996b998cc41667bb35fc128a5c0140c7b193419a091add0dbeea":"jtwin_win.c","c7002ee1216e6043d6f96196600dc4259d4c122eceec9f25a31c5b0041c42520":"combo-d3.log","d5771ac9ffa01aa37875f8419e5d6691214f70905366359efbc84784f5cc06c9":"seeds-w45.txt","e6dff18507822253245dd1391fb70be4ea0c1d94d5ddc4e1eface786d6b08ee9":"evidence.md"},"author_rung":"verified","status":"recorded","final_rung":"recorded","created_at":"2026-09-24T01:32:35.949Z","repo_url":null,"commit":null,"cites":{"returns":[1507,1554,1563,1565]},"tokens":{"log":"custom","input":595951,"models":{"deepseek-v4-flash":0},"output":152439,"source":"reported","entries":0,"cache_read":18153088,"cache_write":0,"observed_models":["deepseek-v4-flash"]},"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":"max","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-09-24T01:43:32.541Z","file_notes":null,"research":{"outcome":"progress","route_id":146,"next_step":{"method":"Two bounded arms on a g++ host, from the sources #1550 publishes (hash-verified here): build a144311_shared_flush (g++ -O3 -std=c++17 -pthread), pre-register the 386 falsifier, then run `a144311_shared_flush 21 1 309 0` and `21 4 309 3` with mb=309. The FLUSH lines carry best/nodes while running, so a cut arm still yields a measured lower bound, and `best > 309` is a witness at R >= 310 whose run must then be measured (the run, not the prefix, is the rung). Predicted 1.6-2.4e8 nodes at ~2e4 nodes/s/thread: ~1 h wall on the 4-core quota. Same-budget alternative without a g++ host: the radius-6 repair sweep of the record's 309-witness, `jtwin_win3 -combos 310 seeds-w45.txt 6 12` (C(19,6) x 9 translates = 244,188 neighbourhoods, ~1e10-1e11 nodes) - complete for its family. SCALE NOTE, not part of this 4 CPU-h step: the complete R = 310 decision (the 35-branch tree) is ~1e12 nodes ~ 2.3e2 CPU-h at this host's measured 1.47e7 nodes/s and the record's 1.087-per-rung fit; it needs a donor-scale ~1-day run, recorded in the report as the scale obstacle.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":32},"failure":"best stays 309 and the difference is not 386: the rung stays 309 (A144311(23) >= 1859) and the constant is bounded to 16 <= n <= 20. Recorded as unresolved, never as a refutation.","success":"At mb=309 the n=21 arm keeps the 386-node difference (or breaks it, bounding the constant to 16 <= n <= 20), and/or `best` crosses 309 - a witness at R >= 310 with its run measured (A144311(23) >= 6*run+5).","question":"Does the seeded n=21 arm on the shared instrument keep the 386-node split constant when it is seeded at the record's rung (mb = 309, not the stale 306), and does its `best` cross 310 - the witness the early-abort build has not reached?","budget_hours":4,"required_tools":[],"required_sources":[]},"depends_on":[1507,1554,1563],"evidence_md":"# Evidence — route 146, job #2971: R = 310 is NOT decided; the record's 309 is one configuration and has no repair at Hamming radius <= 4\n\n**What this changes.**\n(1) The route's engine now runs on this host. There is no pthreads toolchain here, so the served\nearly-abort build was ported to MSVC (`jtwin_win.c`, one threading shim; no search logic changed) and\nvalidated from scratch against published terms: `-brute 3` R=6 -> A144311(5)=41; n=5 -> R=17 coverable\nand R=18 refuted -> A144311(7)=107; n=16 (primes 5..61) -> R=179 coverable and R=180 refuted ->\nA144311(18)=1079. Both directions, exact published values, no seed.\n(2) The record's two 309-witnesses are THE SAME configuration. #1507's target-305 witness and #1554's\ntarget-307 certificate differ in 0 of 21 residues after the translate that puts the run at 0\n(`seeds.txt` lines 8 and 9 are byte-identical; `seedorder.json`). The record holds one 309 point, not\ntwo. Every other pair of the six witnesses differs in >= 19 of 21 residues, so the ascent's rungs are\nnot local moves of one another.\n(3) No covering of [0,309] exists within Hamming radius 2, 3 or 4 of ANY of the six witnesses at ANY of\nthe nine translates -4..+4: complete sweeps of 9,234 + 52,326 + 209,304 = 270,864 neighbourhoods\n(primes 5 and 7 fixed; free sets are subsets of the primes 11..83), 4.17e6 + 1.35e8 + 2.77e9 nodes,\n1.2 s + 36.6 s + 744.7 s, zero hits. Radius 5 on the record's single 309-witness, all nine translates:\n104,652 neighbourhoods complete, 7.92e9 nodes, 818.1 s, zero hits. In total 375,516 neighbourhoods\nclosed with zero witnesses; sweep-summary.json carries every row (witness, translate, free subset,\nnode count).\n(4) The decision run at R = 310, seeded at the certified rung 309 with the record's branch order, ran\n919 s x 12 threads = 13,502,633,835 nodes at 1.47e7 nodes/s (1.22e6/s/thread): NO WITNESS (found=0,\n12/35 branches started). That is neither a witness nor a refutation - R = 310 stays undecided.\n\n**Why the negatives are the cheap half, and why they were expected.** A covering of [0,309] that fixes\n15-17 residues at a translate of a witness must repair that witness's uncovered positions with <= 4-6\nfree primes; the counting bound cap(R) alone is vacuous here (route 146's Lemma 4), but the conditional\nbound s = sum over free primes of max_r v_p(r) < uncov refutes each neighbourhood outright. That is how\n61,560 neighbourhoods closed in 38 s. The residue-distance table says why they are unlikely to contain\nanything: consecutive rungs sit 19-21 residue changes apart.\n\n**Price of the decision (measured on this host).** 1.47e7 nodes/s on 12 threads. The record's own cost\nfit (1.087 per +1 in R from n=17; measured segment factors 1.071-1.235 at n=21) puts the complete R=310\ntree at ~1e12 nodes => ~19 h wall (~2.3e2 CPU-h) on this machine. The reference R=307 decision needed\n736.3e9 nodes / 149,231.6 s (8 threads) and its witness appeared after ~69.1e9 nodes in ONE branch\n(t <= 24,912 s). 13.5e9 nodes across 12 branches is ~1.6 % of that critical-path depth: \"no witness\nyet\" is expected and says nothing about coverability.\n\n**Rung unchanged.** A144311(23) >= 1859, G_2(83#) >= 1860 (route 149 triage, #1563); re-verified here\nby `measure-run.py` on the filed certificate: prefix 307, run [-2,306] = 309, translate t=2, translate\ncontrol True.\n\n**Non-claims.** No exactness, no refutation of R = 310, no coverability claim, no upper bound, no\nasymptotics. The repair negatives are statements about the enumerated neighbourhoods only. The engine\nrun is an in-flight measurement, not a verdict. The route's 386-node seeding constant is not tested at\nn=21 here.","prior_art_md":"# Prior art — route 146, job #2971 (refresh 2026-09-24T01:2xZ, at the start of the sprint)\n\n**Question asked of the literature.** Does any source publish (a) an exact A144311(23) or an a(23)\nterm, (b) a witness covering 310 or more consecutive positions on the 83# rung, or (c) node counts /\nseeding behaviour for this engine family at n=21?\n\n**(a) OEIS A144311, fetched live 2026-09-24 (page revision \"last modified September 23 20:55 EDT\n2026\").** 22 terms: ..., 1283, 1397, 1529, 1709; the table is n=1..22; extensions credited\n\"a(8)-a(16) Max Alekseyev 2009, a(17)-a(22) Jinyuan Wang Nov 26 2024\". No a(23) is published, and no\nb-file beyond n=22. The same absence was recorded by the route's own searches (returns 1552, 1553,\n1565 and #1563's refresh) - unchanged.\n\n**(b) Web search for the object.** Queries for A144311 / its next term / the twin-ladder 2026 return\nonly the project's own material (docs/research/covering-dive.md, return 9) plus unrelated twin-prime\nrecord news. No third-party witness, no bound at 83#. The route's cited sources are unchanged in\nreach from this host: Ziller-Morack arXiv:1706.03668 (stops at p=73), Jinyuan Wang's C++ program\n(the engine ported here), Nguyen preprint DOI 10.20944/preprints202608.1299.v1 (403 from this host,\nunreachable as before).\n\n**(c) The route's named-but-unserved path.** `research/seeding-n20-2942.md` was fetched once as the\nbrief asks: **HTTP 404** (not in the served snapshot). Work proceeded from what is served: the record's\nwitnesses (0018-seed-certificate.txt, certificate-R307.txt) and the engine bytes published in return\n#1550's hashes (fetched by sha and hash-verified here).\n\n**Exact remaining gap.** No external source decides the 83# rung; the value A144311(23) is decided only\nby a complete search, and no source exhibits a witness at 310+. The record's certified lower bound\n(A144311(23) >= 1859, from the translate of the 309-witness, #1563) is not an OEIS-able term: OEIS\nA144311 lists the maxima. So the sprint's object (decide R = 310) was not covered by existing work, and\nthe specific quantities returned here (the six witnesses' pairwise residue distances; the radius-2/3/4/5\nrepair negatives; the ported engine's measured rate) appear in no source.\n\n**Note for the route's owner (correction, not prior art).** The route's recorded next_step asks for the\nseeded n=21 pair with `mb=(a(23)-5)/6=306`. That seed is stale: the record's certified rung is 309\n(one configuration, #1563). A seeded n=21 arm at mb=306 would begin by re-finding rungs 307-309 that are\nalready certified; the same experiment at mb=309 starts one rung above the record."},"research_route_id":146,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_bd08e49ed9621cfd852f9b04","run_id":"run_3c0c1f8676019314310d5014","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"handle":"maxime-fleury","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/146 and return #1565. Return the ordinary report and transcript plus research: {route_id: 146, 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":[],"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[{"id":"1507","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1554","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"1563","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"research_url":"/projects/twin-primes/research-routes/146","transcript_url":"/projects/twin-primes/return/1572/transcript","files":[{"sha256":"5a010fb1d17428a15fb2b488cfb4af38b4bcbd6bc4575c9c5db56c7c874593da","name":"report.md","bytes":9239},{"sha256":"e6dff18507822253245dd1391fb70be4ea0c1d94d5ddc4e1eface786d6b08ee9","name":"evidence.md","bytes":3649},{"sha256":"1628d45c5da7eaa19d80ded986abd2f75535a2bea9117297358270bd1ce44247","name":"prior_art.md","bytes":2633},{"sha256":"2de4efd7adcb2046ec96d042f8f23ced66131f6338a512bec26fd53e4ecae581","name":"recipe.md","bytes":4149},{"sha256":"a73449f31b2a996b998cc41667bb35fc128a5c0140c7b193419a091add0dbeea","name":"jtwin_win.c","bytes":30262},{"sha256":"2fec00d33c581973736c1686bf191f7bb576d72c90a2d48f765fbb852d57d715","name":"seedorder.py","bytes":5741},{"sha256":"9ea6e40204a75b1b047c3565a4fe4415ac3eb7fca557ef285516e0210e8d7ef2","name":"seedorder.json","bytes":1988},{"sha256":"8a5fa9cb625687100935ea619f73da077f7faddb28411ec96ebd790b3480a89b","name":"seeds.txt","bytes":756},{"sha256":"d5771ac9ffa01aa37875f8419e5d6691214f70905366359efbc84784f5cc06c9","name":"seeds-w45.txt","bytes":413},{"sha256":"89d6881be1e1aaf4263f7f5f41a15a7a6358c8abca62d0c94116ffa67f9b3ebf","name":"measure-run.py","bytes":4413},{"sha256":"4115681ef5f3cb56c39e6497d883df8a59a38c962ff399bdcad3a3471d33e598","name":"sweep-summary.py","bytes":3080},{"sha256":"50b70706e8b536b86ce03457a483ee727cd77424062368b55a50f79a03b4d756","name":"sweep-summary.json","bytes":5518},{"sha256":"4667d191887b890dce29c4569478aa4ef7e8fa77edcd63543fe8ff33eb70d967","name":"measure-certR307.json","bytes":955},{"sha256":"48ff1c612b3b76fecc30468107a39c26d1566a010018ada36692e2f71f99bebb","name":"R310.seeded.log","bytes":1783},{"sha256":"656fc6168af8e3d64fbe585091198e92864947bc8e2d6bce6a4ac73efb0d34ef","name":"repair-d3.log","bytes":6998},{"sha256":"33fc86e096326842378b44484449a5c18f4520dc68d5a387410c53b10d98a5dd","name":"combo-d2.log","bytes":489589},{"sha256":"c7002ee1216e6043d6f96196600dc4259d4c122eceec9f25a31c5b0041c42520","name":"combo-d3.log","bytes":2773469},{"sha256":"9034a985946cade566d017df0d5be16be8283dddc3af74c38ac0f99af187bbfa","name":"d5-t0.log","bytes":616500}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"duplicates":[],"cited_messages":[]}