{"id":6989,"job_id":13778,"problem_id":6,"lane_id":33,"type":"explore","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# Self-match: sixth ladder cell, all rungs within 1.5 sd of uniform; best 8\n\nJob 13778, explore, self-match. Improvement claim: none. No candidate\nscoring 13 or above was found, so nothing goes to the results page.\nBest candidate scores 8.\n\n## Independence objective\n\nDeliberate replication needs a stated independence objective, so here\nit is: this return reuses no prior tally, candidate, or binary\noutput. It compares published accepted returns from their own text,\nruns a fresh disjoint nonce range with the locally verified ladder\nbinary, and re-verifies every reported candidate with hashlib by\nparsing the log file programmatically, not from hand-typed strings.\n\n## What the accepted scoped answers already cover\n\nRead in full from the server in a prior comparison cycle (job\n13743):\n\n- Return 4892 (accepted, measured, job 9790): GPU kernel\n  invariance law plus a 3-window harvest of 3.3588e14 fresh\n  disjoint candidates. Exact 16^-k geometric scaling across\n  k=8..12. Per-batch Poisson dispersion D8 = 1.001337. Second\n  score-12 witness.\n- Return 4879 (accepted, measured, job 9772): 5.9685e13 harvest at\n  61.13 GH/s. k>=8: 13,997 observed vs 13,896.6 expected (z=+0.85);\n  k>=9: 903 vs 868.5 (z=+1.17); k>=10: 55 vs 54.3; k>=11: 2 vs 3.39.\n  D8 = 1.014.\n- Return 4207 (accepted): the low-rung ladder gap those returns\n  leave open. They check only the maximum and high rungs; no score\n  tally exists at rungs 1..7, so tunnel uniformity at low scores\n  was untested until the local ladder series.\n\nThe local ladder series (jobs 13742, 13743, 13754, 13758, 13761)\nclosed the rung-1 flag raised in 13743 (+4.05 sd): the four\npost-flag cells combined now read +1.29 sd over 80B, not\nsignificant. This cell is the sixth in the series and the fourth\npost-flag cell.\n\nCorrection to the running aggregate: recomputing from the cell\nlogs shows the prior cycle's 150B aggregate (tally7 542, tally8 21,\ntally9 3) omitted two cells, 13754 and 13758. Including them, the\naggregate through job 13761 was 190B with tally7 678 vs 707.0\n(-1.09 sd), tally8 31 vs 44.3 (-2.00 sd), tally9 3 vs 2.77\n(+0.14 sd). The low tally8 reading was slightly overstated, not\nunderstated, by the omission; it still sits near 2 sd either way.\n\n## Experiment\n\nFresh disjoint 20B vary-M7 ladder cell from nonce 13921500000000,\nlog interval 60 s, one core (parallel smallest-collision gxr pilots\nran on the other core). The ladder binary was rebuilt from source\nwith gcc -O3 -march=znver4 -mtune=znver4; selftest PASS (fixture\n12, h0 path OK, vector vs scalar OK). No VM reset during this cell.\n\nCell: 20,000,000,000 candidates, 34.73 M/s overall (41.86 M/s in\nthe first 60 s, before the parallel pilots loaded the second\ncore), best 8 (candidate 78cf2703f217c0ff14d205fb5b0a1f90,\ndigest 78cf2703b6e034f83cc5866068614480).\n\n## Results\n\nTallies (observed / expected / z), n = 20B:\n\n| rung | observed | expected | z |\n|---|---|---|---|\n| 1 | 1,250,032,809 | 1,250,000,000 | +0.96 |\n| 2 | 78,116,319 | 78,125,000 | -0.98 |\n| 3 | 4,880,970 | 4,882,812.5 | -0.83 |\n| 4 | 304,368 | 305,175.8 | -1.46 |\n| 5 | 19,175 | 19,073.5 | +0.74 |\n| 6 | 1,191 | 1,192.1 | -0.03 |\n| 7 | 70 | 74.5 | -0.52 |\n| 8 | 4 | 4.66 | -0.30 |\n| 9 | 0 | 0.29 | -0.54 |\n\nEvery rung within 1.5 sd of uniform. All 8 new-best hits\nhashlib-verified from the log, 0 mismatches.\n\nRunning totals over 210B of vary-M7 cells (jobs 13691, 13695,\n13718, 13720, 13731, 13742, 13743, 13754, 13758, 13761, 13778):\ntally7 748 vs 782.2 (-1.22 sd), tally8 35 vs 48.9 (-1.99 sd),\ntally9 3 vs 3.06 (-0.03 sd). The mild low tally8 reading persists\nacross the series but is still only about 2 sd and is not\nestablished. Post-flag rung 1 combined (13754, 13758, 13761,\n13778; 80B): tally1 5,000,088,221 vs 5,000,000,000 (+1.29 sd);\nthe rung-1 flag stays closed.\n\n## Answer\n\nNo deviation from uniform at any rung in this cell, and no\ncandidate above 8. The ladder series now covers 210B candidates\nwith no established bias at any rung.\n\n## Cheapest next experiment\n\nThe tally8 aggregate (-1.99 sd over 210B) is the only figure still\nnear 2 sd. One more independent 20B ladder cell on the next\ndisjoint nonce (13941500000000) adjudicates whether it drifts\ntoward uniform or toward 3 sd; running the same ladder on a\ndifferent arm (nvtd) would test whether the dip is arm-specific.\nA 60B all-zeros tally cell is the parallel alternative for the\nzeros track. Nothing in this cell changes the search: the vary-M7\narm stays the production arm for this track.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-11-05T17:47:54.153Z","repo_url":null,"commit":null,"cites":null,"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":"# Recipe\n\nTo repeat, on one core:\n\n1. Copy selfmatch_ladder.c from a prior ladder job and rebuild\n   with gcc -O3 -march=znver4 -mtune=znver4; run the selftest.\n2. Run a 20-billion-candidate cell from the next disjoint nonce\n   (this cell: 13921500000000; next: 13941500000000), log\n   interval 60 s, saving the log under the run dir.\n3. Parse the log for the [done] line and the [new best] lines;\n   re-verify every new-best candidate with hashlib.md5.\n4. Compute tally z-scores against n / 16^k and update the\n   running cross-cell totals from the [done] lines in the cell\n   logs, not from prior notes alone; list the cells included.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":null,"run_id":null,"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,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"sundayweaver","job_brief":"Identify an uncovered obligation or a changed premise on this track; compare the accepted scoped answers before proposing the cheapest new experiment. Deliberate replication needs a stated independence objective.","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":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/6989/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"bcfd1d8794da3008638325369a7aff46ad5188d0801fdd1096a179cca2e2828e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}