{"id":6873,"job_id":13614,"problem_id":6,"lane_id":34,"type":"measure","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# All zeros: il4 baseline cell of 2.88e11 candidates, best 10, uniform model survives\n\nJob 13614, measure, all-zeros. Improvement claim: none. No input at 13 or above was found, and none is claimed. Nothing goes to the results page.\n\n## Hypothesis\n\nDigest hex characters behave uniformly and independently, each matching with probability 1/16, so a fresh cell's best score should track N / 16^k expectations and no structural shortcut should appear in a plain search cell. This run is a baseline measurement: it used only the known production tool, so it is reported as a baseline, not as a new method.\n\n## Experiment\n\nProduction binary tools/md5tun_avx512_il4, smoke run verified (1,000,000 candidates, top hit verified by hashlib recompute). One core only (taskset -c 0), AMD EPYC 9D25 VM. Cell: start nonce 50000000000000 (disjoint from prior cells, including the 49 range used in the previous cycle), 288,000,000,000 candidates, about 1194 s, 241.27 M/s single-core.\n\nBest score 10, input 5a25db91c3cf358c8ed02acf3f8b892b7f760dfebd55f09f2ddfb7674eecf98091fb607258855f6396da943723b9d1ff23281c98, digest 0000000000bd0a380f8c48ac4213b4bf, verified by hashlib, as were all other logged record-breakers (10 lines verified, 0 mismatches).\n\n## Comparison with the uniform null\n\nExpected counts under the null for 2.88e11 candidates: about 67.1 at 8 or above, about 4.19 at 9 or above, about 0.26 at 10 or above, about 0.016 at 11 or above. A best of 10 is above the modal outcome but well within the null: the chance of at least one score-10 candidate in a cell this size is about 0.23, and no score-11 candidate appeared, as expected (probability about 0.98 of none). The null survives at the level of the maximum. Counts below the maximum are not reported because the binary logs record-breaking candidates only.\n\n## Next step\n\nRun the proposed il4-arm tally cell: the same 2.88e11-candidate cell shape with a counter added to the searcher, recording hits at 7 or above, 8 or above, and 9 or above, so the null can be tested at count level rather than maximum level only.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"pending","final_rung":null,"created_at":"2026-11-04T04:13:02.507Z","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. Verify tools/md5tun_avx512_il4 with a 1,000,000-candidate smoke run and a hashlib recompute of its top hit.\n2. Run: taskset -c 0 ./tools/md5tun_avx512_il4 50000000000000 288000000000 60\n3. Verify every logged record-breaker with hashlib.\n4. Expected result: about 241 M/s, best score 9 or 10 in most cells of this size; a best of 13 or above would be far outside the uniform null.","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-04T04:13:02.507Z","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 what makes the first output word of MD5 small, and use it to reach more leading zeros than generic search would with the same compute. Ideas to test: freedom from extra message blocks, neutral bits and message modification from collision attacks applied to the output instead of a difference, early abort on the final additions. 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/6873/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"4c8c5a86a33fe46be74b8337960d11592c20c896b28495b30723db6993f68cc1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}