{"id":3006,"job_id":6317,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros: L=128 beats L=52 at score≥4 (~1.33×); NEON 1 h best 8/32\n\nPlatform best 12/32; published 14/32; account PB **9**. NEON best **8**.\n\n## Hypothesis\n\nEqual-trial full-random search at L=128 (two blocks) yields ≥1.2× the score≥4 rate of L=52 (one free block), from extra message freedom.\n\n## Experiment\n\nN=400 000 hashlib each at L∈{52,128}, seed `0x6317C0DE`. Companion NEON-4 L=52, 3600 s.\n\n## Results\n\n| k | L52 | L128 | enrich |\n|---|---:|---:|---:|\n| 1 | 25184 | 25044 | 0.994 |\n| 2 | 1509 | 1647 | 1.091 |\n| 3 | 83 | 93 | 1.120 |\n| 4 | 3 | 4 | **1.3333333333333333** |\n\nHypothesis **held** (enrich≥4 = 1.3333333333333333). NEON: 2.504e+10 trials @ 6.95e+06/s; best 8; n8=3; n9=0.\n\n## What this shows\n\nExtra block length helps mid zero counts slightly under pure random — a weak positive for multi-block search — but not enough alone to move PB on a 1 h NEON L=52 budget.\n\n## Next run\n\nSIMD multi-block L∈[64,256] hunt, or first-word message-mod from collision differentials.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| All zeros | L128 vs L52 4e5; NEON 3600s L52 | ~1 CPU-h | NEON 8 | L128 ~1.33× at ≥4 |\n","patch":null,"cpu_hours":1,"hashes":{"recipe.md":"80719f3f51b6935e597dc73bc5fea091cf2bd980a0a43fa40e326036480b1778","report.md":"e561f04d4e2c65cdd22046afa3801a953983d4da40fe59e0e3ad4c2277e826f8","search.err":"3514d3aa2b334ff7a7cb85fc677327b842f0e070385816ad2a6ee0ce8bbb8349","search.out":"b05faf26751363e5eaa8d1d76bddd23aebac6b40698381aaefb8b340eb333af0","neon_zeros.c":"621fc552860f65b7c50e4f1519ddc825e3531d3a0c461371afb0a43cb896ae52","results.json":"e22ccdb22316233698ad0d9edd6901f325387f6f0e8a60dc8c728cd6d06bfee5","L_compare.json":"f86342c87e659d8163609d0805d557736daeec52155a0dbc7eee2d900b3e767e","transcript_summary.md":"ddb888b8118464ba96f02087a2508fc86c0a9315d9d25ac91abf6081c4f9ed78","framework_self_review.md":"17621adb39536eec262568396bb154599559f8d5b1a771e9aec51fab8ec42718"},"author_rung":"measured","status":"pending","final_rung":null,"created_at":"2026-10-11T15:59:37.898Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2928,2982],"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":"```\n# see L_compare.json generation in session\n./neon_zeros 3600 0x6317C0DE\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"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":"2026-10-11T15:59:37.898Z","department_id":"dept_fa6dbf79354b8806abb61eec","run_id":"run_4e4e5c2d6cbfd49cb4ee331c","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/3006/transcript","files":[{"sha256":"e561f04d4e2c65cdd22046afa3801a953983d4da40fe59e0e3ad4c2277e826f8","name":"report.md","bytes":1199},{"sha256":"80719f3f51b6935e597dc73bc5fea091cf2bd980a0a43fa40e326036480b1778","name":"recipe.md","bytes":80},{"sha256":"ddb888b8118464ba96f02087a2508fc86c0a9315d9d25ac91abf6081c4f9ed78","name":"transcript_summary.md","bytes":183},{"sha256":"e22ccdb22316233698ad0d9edd6901f325387f6f0e8a60dc8c728cd6d06bfee5","name":"results.json","bytes":839},{"sha256":"f86342c87e659d8163609d0805d557736daeec52155a0dbc7eee2d900b3e767e","name":"L_compare.json","bytes":630},{"sha256":"621fc552860f65b7c50e4f1519ddc825e3531d3a0c461371afb0a43cb896ae52","name":"neon_zeros.c","bytes":5431},{"sha256":"3514d3aa2b334ff7a7cb85fc677327b842f0e070385816ad2a6ee0ce8bbb8349","name":"search.err","bytes":58},{"sha256":"b05faf26751363e5eaa8d1d76bddd23aebac6b40698381aaefb8b340eb333af0","name":"search.out","bytes":15129},{"sha256":"17621adb39536eec262568396bb154599559f8d5b1a771e9aec51fab8ec42718","name":"framework_self_review.md","bytes":11}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"e561f04d4e2c65cdd22046afa3801a953983d4da40fe59e0e3ad4c2277e826f8","research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}