{"id":7161,"job_id":14108,"problem_id":6,"lane_id":34,"type":"explore","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# Report (job 14108, explore, all-zeros)\n\n## Question\n\nIdentify an uncovered obligation or a changed premise on the all-zeros\ntrack; compare the accepted scoped answers before proposing the\ncheapest new experiment. Deliberate replication needs a stated\nindependence objective.\n\n## Comparison of the accepted scoped answers\n\nState page fetched live (GET /projects/md5/state, curl,\nruns/job-14108/work/state_page.json, 38,877 bytes, md5\n20ded3e2aaa983b0416ac308c65b6c12), byte-identical to the #14100,\n#14103 and #14104 snapshots. All-zeros lane unchanged since v43\n(2026-11-03), through return #6503. Records unchanged: platform\nbest 13 of 32 (submission #180, 2026-10-11); best published result\n14 of 32 (Beneri Hash Game, record #209). No changed premise on\nthe page itself.\n\nThe v43 accepted answers that bound this job:\n\n- Existence: inputs up to 15/16/17 bytes give 0.0039/1.004/257\n  expected all-zero preimages; the full 32-zero target costs about\n  2^128 generic, 2^72-2^76 past 13/14.\n- Counts fit 256^L times 16^-k; pooled recounts across machines\n  (N1, M1, VM, M5Pro, Ada) match uniform within noise.\n- Dead ends include: prior-block CV choice; full-state neutral\n  bits 0/416 past t16; last-4-bytes-free about 1.0x; and L=128\n  untested at power (#3006).\n\n## New measurement: fresh 400B exact-tally cell\n\nFresh disjoint 400-billion-candidate all-zeros cell, il8 tally\nbinary, start nonce 17080403000000, pinned to core 0, log interval\n120 s, sibling L62 arm on core 1. Overall 223.66 M/s (solo smoke\n323.41 M/s over 3B). Exit 0, finished about 22:05Z. Best 9.\nExact tallies: tally2 1562496722, tally4 6104179, tally6 23704,\ntally7 1494, tally8 100, tally9 7. All 9 lines scoring 8 or above\nin the cell log were re-verified with hashlib: 9 of 9 match,\n0 mismatches. The 7 distinct score-9 inputs are the cell's best\ncandidates; none scores 13 or above, so nothing goes to the\nresults page.\n\nUniformity check (400B candidates, uniform expectation):\n\n| rung | observed | expected | z |\n|---|---|---|---|\n| >=2 | 1562496722 | 1562500000 | -0.08 |\n| >=4 | 6104179 | 6103516 | +0.27 |\n| >=6 | 23704 | 23842 | -0.89 |\n| >=7 | 1494 | 1490 | +0.10 |\n| >=8 | 100 | 93.1 | +0.71 |\n| >=9 | 7 | 5.82 | +0.49 |\n| >=10 | 0 | 0.36 | P(no 10) about 0.70 |\n\nLargest deviation under one sigma. The cell is consistent with\nuniform and adds another 400B disjoint range to the pooled\nexact-count series.\n\n## Uncovered obligation and cheapest new experiment\n\nThe uncovered obligation is L=128 at power: the v43 dead-ends list\nrecords 128-byte inputs as untested at power, while every measured\ncell so far (including this one) searches 64-byte single-block\ninputs. The track's counting arguments and the 2^72-2^76 cost past\n13/14 say nothing about whether the 128-byte length class behaves\ndifferently at scale, and no throughput or best-score number exists\nfor it.\n\nCheapest new experiment: extend the il8 tally binary to two-block\n128-byte inputs and run a measured cell. Cost is a small code\nchange (second block per candidate, same scoring) plus one run:\nat roughly half the single-block rate (about 110-160 M/s loaded),\na 100-billion-candidate cell takes about 10-15 minutes and gives\nthe 128-byte throughput, a best score, and exact tallies to compare\nagainst the 64-byte series. That decides whether L=128 is just a\nslower copy of the known search or a class worth a longer run.\nA second, cheaper bookkeeping step first: a proper recount of the\npooled exact-count tally9 series from the disjoint-range list, so\nthe next cell's tallies land in a clean series.\n\n## Finding\n\nImprovement claim: none. No input scoring 13 or above was found,\nand none is claimed. The state page is unchanged; the uncovered\nobligation is L=128 untested at power; the cheapest decisive check\nis a two-block 128-byte il8 cell. The fresh 400B cell is a\ndeliberate replication of the tally measurement on a new disjoint\nrange (independence objective: verify the uniform tally\ndistribution on nonces no prior cell searched), and it reproduces\nthe uniform picture.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-11-08T22:09:06.808Z","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 (job 14108, explore, all-zeros)\n\nFetch the state page live (GET /projects/md5/state) and compare\nits md5 with the previous snapshot\n(20ded3e2aaa983b0416ac308c65b6c12); read the all-zeros lane in full\n(saved this cycle at runs/job-14108/work/allzeros_state_v43.md).\n\nVerify the il8 tally binary with a short smoke run\n(runs/job-13994/work/md5tun_il8 <start> 3000000000 5); rate should\nbe near 323 M/s solo, best 7, tally2 near 11.7M.\n\nRun a 400-billion-candidate cell from the next disjoint nonce\n(this cycle: 17080403000000), pinned to one core, log interval\n120 s. Verify every [new best] and [hit9] line scoring 8 or above\nwith hashlib, and compare every exact tally rung against the\nuniform expectation for the cell size. Nothing scored 13 or above;\nnothing to the results page.\n\nCheapest next experiment: extend the il8 tally binary to two-block\n128-byte inputs and run a measured 100-billion-candidate cell\n(about 10-15 minutes at the expected halved rate) to establish the\n128-byte throughput, best score, and exact tallies. Next disjoint\nall-zeros start nonce: 17480403000000.","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/7161/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"4842a6ec60b73e62e70271e4e6396445b12dbcd5c203b3f3d7095cfce739f16e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}