{"id":7068,"job_id":13958,"problem_id":6,"lane_id":33,"type":"measure","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# Self-match measure: fresh 20B vary-M7 cell from a verified disjoint nonce, uniform\n\nJob 13958, measure, self-match. Improvement claim: none. No longer\nmatching prefix was found, and none is claimed. Nothing goes to the\nresults page.\n\n## Hypothesis\n\nThe self-match track stays on the uniform picture, so the cheapest\ndecisive work is fresh counted coverage in the tally9 space with\ntallies compared to uniform expectations. A 20B vary-M7 cell from a\nverified disjoint nonce tests that directly.\n\n## Experiment\n\nThe tally9 binary was rebuilt from source (gcc -O3 -march=znver4\n-mtune=znver4), selftest PASS, then run as a single counted cell:\n20,000,000,000 candidates from nonce 13937500000000, log interval\n60 s, 1 thread pinned to core 0, with the parallel explore job on\ncore 1. The start is verified disjoint: the previous tally9 cell\n(#13896) ran 20B from 13917500000000 with a confirmed [done] total,\nso its range ends at 13937500000000, and no tally9 cell starts at or\ncovers this nonce.\n\nA first launch from the recorded next start 13919500000000 was killed\nat about 300 s after it reproduced #13896's best-8 candidate within\n60 s: that recorded number was arithmetically wrong (2B past #13896's\nstart, not 20B), so the launch re-scanned #13896's range. Its partial\nlog is preserved and its tallies are not counted.\n\n## Results\n\n- 20,000,000,000 candidates, 30.00 M/s loaded, [done] total\n  20000000000, exit 0. Best 8, tally7 59, tally8 2, tally9 0.\n- Uniform expectations for 20B: tally7 74.5, tally8 4.66, tally9\n  0.29 (z -1.80 / -1.23 / -0.54). Uniform within 2 sd at every rung.\n- Best candidate 68795e8a8db0a34d510d24bb4b00ab4b, digest\n  68795e8ab15ab4a80b567775fe52fcd2, score 8. All 9 new-best hits in\n  the log re-hashed with hashlib.md5 and the printed score checked\n  against the true common-prefix score: 0 mismatches.\n- Verified fresh tally9-space total is now 51B: the #13839 union\n  11B, #13896 20B, this cell 20B. Next verified tally9 start nonce:\n  13957500000000.\n\n## What the next run should try\n\nContinue fresh 20B tally9 cells from 13957500000000. The standing\nrule for the next start is unchanged and now thrice-bitten: verify\nit as start + total from the cell log with a calculator, never by\nhand, and cross-check it against all prior run notes before\nlaunching.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"pending","final_rung":null,"created_at":"2026-11-07T00:07:16.880Z","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 the cell: rebuild the tally9 binary from source (gcc -O3\n-march=znver4 -mtune=znver4), run its selftest, then run it from the\nverified next nonce with the candidate count and a 60 s log\ninterval, one thread pinned to a core. Verify the next nonce as the\nprevious cell's start plus its [done] total using a calculator, and\ngrep all prior run notes for any cell starting at or covering it\nbefore launching. After the run, re-hash every [new best] line with\nhashlib.md5 and compare tallies to uniform expectations\n(P(>= k) = 16^-k).","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":"2026-11-07T00:07:16.880Z","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":"Study how a candidate's 32 ASCII bytes flow through the 64 steps into the first digest characters, and use what you learn to reach a longer matching prefix. Ideas to test: which message words the first output word depends on most, fixing a prefix and solving for the rest, early-exit tests on the first output word, meet-in-the-middle on the step function. Start from the algorithm, not the search. Read the track's state of the art in this brief (the fastest known way per machine, what worked, the dead ends) and research/QUESTIONS.md, then state one hypothesis about MD5's structure that would make this track cheaper than generic search, and why you expect it. Test it with the smallest experiment that could refute it, against a measured baseline on the same machine. Submit the best candidates the experiment produced. The report is a finding: the hypothesis, the experiment, what it showed about MD5 (positive or negative, with numbers), and what the next run should try. Send what you learned as a state_entry with your return (the method, the exact hardware, the measured throughput, the best reached), so the track's state of the art carries it. If the run used only a known tool or plain search, report it as a baseline measurement.","review_deferred":false,"in_triage":true,"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/7068/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"c0e9f2cc0780fc2cd9b9fb5ac53043b79b4fac2e4b832789d96efa9c8c9905b5","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}