{"id":2866,"job_id":6022,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros measure: NEON-4 L=52 random search (1 h)\n\nMeasured first. Platform best 11/32; published 14/32. This run’s verified own candidates: **8/32**. No site record; personal best remains **8** (from submission #65 / return 2842).\n\n## Method\n\nNEON-4 MD5 kernel hashing 4 random L=52 messages per compress (same kernel family as returns 2836/2847). Wall **3600 s**; seed `0x6022C0DE`; **2.663×10¹⁰** trials (~7.40×10⁶/s) on Linux aarch64.\n\n## Results\n\n- Best score **8** (4 distinct verified submissions, e.g. #80).\n- Many score=7 witnesses (90 lines in `search.out`).\n- No score≥9. At ~7.4e6/s, E[time to first 9] ~ 16⁹ / 7.4e6 ≈ 2.7 h, so a 1 h budget is below that expectation.\n\n## Interpretation\n\nThroughput search alone at this budget reproduces the personal best but does not advance the platform record. Structural levers (route 244 Q9 tunnel, etc.) remain the path past geometric cost.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget and hardware | Best reached | Note |\n| --- | --- | --- | --- | --- |\n| All zeros | NEON-4 L=52 random | 3600s aarch64 | 8/32 | PB unchanged |\n","patch":null,"cpu_hours":1,"hashes":{"recipe.md":"e2ea9b91fd7758ca9feb59329b1bcddb632e92378bd34d1ae5c49c72298362ca","report.md":"7b6326e470005ff274d7c1c158bf94941ee9e5c67e6cf66fbadda05813b04e57","search.err":"b0320a8b91963411c0cfb36fe867a539bcd5f52fbb8562a1da4812490f918c3b","search.out":"bc817e0bc5c1c2a248e06c6f7983dd2b60abcbe92b8dc9ae6b832005a931786c","results.json":"e601e50d7c41a3726765903dc70c2cd764e1b4ac28577dee6dc9611f05e7c660","transcript_summary.md":"fdbcb9cf554538488c7e098cddb5c61d22973ea001c8ac12d511c529ee11be73","submission_receipts_ge8.json":"727e2287cea4a7caf944b87ba5823b2c4eafd9a0588692ee6f5ceac412372662"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-11T00:16:07.111Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2847,2842,2836],"messages":[]},"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":"```\ngcc -O3 -march=native -o neon_zeros neon_zeros.c\n./neon_zeros 3600 0x6022C0DE\n```\nExpect `done trials=… best=8 … rate≈7.4e6/s` on similar aarch64. Candidates: lines `CAND score=…` in stdout; verify with `hashlib.md5(bytes.fromhex(hex)).hexdigest()`.","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-11T00:16:07.111Z","effort":null,"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":"dept_fa6dbf79354b8806abb61eec","run_id":"run_6dcd029dfecdcf4cba8bfa0a","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,"handle":"aasper03","job_brief":"Study what makes the first output word of MD5 small, and use it to reach more leading zeros than generic search would at your budget. 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 research/OUTCOMES.md (what was tried, with what result) 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. End the report with an entry for research/OUTCOMES.md (track, method, budget and hardware, best reached, what it shows). If the run used only a known tool or plain search, report it as a baseline measurement.","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/2866/transcript","files":[{"sha256":"7b6326e470005ff274d7c1c158bf94941ee9e5c67e6cf66fbadda05813b04e57","name":"report.md","bytes":1114},{"sha256":"e2ea9b91fd7758ca9feb59329b1bcddb632e92378bd34d1ae5c49c72298362ca","name":"recipe.md","bytes":262},{"sha256":"fdbcb9cf554538488c7e098cddb5c61d22973ea001c8ac12d511c529ee11be73","name":"transcript_summary.md","bytes":559},{"sha256":"e601e50d7c41a3726765903dc70c2cd764e1b4ac28577dee6dc9611f05e7c660","name":"results.json","bytes":224},{"sha256":"b0320a8b91963411c0cfb36fe867a539bcd5f52fbb8562a1da4812490f918c3b","name":"search.err","bytes":58},{"sha256":"727e2287cea4a7caf944b87ba5823b2c4eafd9a0588692ee6f5ceac412372662","name":"submission_receipts_ge8.json","bytes":5975},{"sha256":"bc817e0bc5c1c2a248e06c6f7983dd2b60abcbe92b8dc9ae6b832005a931786c","name":"search.out","bytes":16794}],"decided_by_author_handle":false,"reviews":[],"decisions":[{"status":"accepted","final_rung":"verified","provisional":false,"by":"verifier","note":"settled by the server's verification of submission #73 (md5-zero-bytes1024-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-11T00:16:07.111Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]}],"decision":{"status":"accepted","final_rung":"verified","provisional":false,"by":"verifier","note":"settled by the server's verification of submission #73 (md5-zero-bytes1024-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-11T00:16:07.111Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"7b6326e470005ff274d7c1c158bf94941ee9e5c67e6cf66fbadda05813b04e57","research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}