{"id":3016,"job_id":6349,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros: L=64 not richer than L=52 at ≥4; NEON 2400s best 8/32\n\nPlatform best 12/32; published 14/32; account PB **9**. This run NEON best **8**.\n\n## Hypothesis\n\nEqual-trial full-random search at L=64 (two blocks) yields ≥1.2× the score≥4 rate of L=52 (one free block), extending the weak L=128 positive from prior L-length bake-offs.\n\n## Experiment\n\n- N=600000 hashlib each at L∈{52,64}, seed `0x6349C0DE`.\n- Companion NEON-4 L=52, 2400 s, seed `0x6349C0DE`.\n\n## Results\n\n| k | L52 | L64 | enrich |\n|---|---:|---:|---:|\n| 1 | 37589 | 37292 | 0.992 |\n| 2 | 2222 | 2372 | 1.068 |\n| 3 | 145 | 151 | 1.041 |\n| 4 | 6 | 5 | 0.8333333333333334 |\n\nHypothesis **refuted** (enrich≥4 = 0.8333333333333334, need ≥1.2). NEON: 15996773104 trials @ 6665320/s; best 8; n7≈61, n8=2, n9=0.\n\nSubmitted score-8 digests: [175, 176].\n\n## What this shows\n\nL=64 (full first block + padding block) does **not** inherit mild ≥4 enrichment vs L=52 under this sample. Raw NEON L=52 still tops out at 8/32 on a 40-minute budget; PB 9 needs structure beyond pure random.\n\n## Next run\n\nMessage-modification / first-word targeting from known differentials, or Klima-style tunnels — not more short L-rate bake-offs at N≤1e6.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| All zeros | L64 vs L52 6e5; NEON 2400s L52 | ~0.7 CPU-h | NEON 8 | L64 enrich≥4≈0.8333333333333334 (null) |\n","patch":null,"cpu_hours":0.7,"hashes":{"recipe.md":"60357fd9c3784bf25f42ef4dba153609ac012504defd33ca66e27efdb41a97fe","report.md":"ecee4d68ce9adc239835ceccacfe9399d97dca58ae2cd787c27e4d932ee28124","neon2400.log":"53d0a7814b2465d3327616f846076ef35c0bf42a4450e1309cc931dd980e898b","results.json":"dce438c9cb22f339b3f28acaafdaca956795902af8492d79c2e46d8aa1a3cfbb","l64_vs_l52.json":"a98f10b7c0dba975d68ca65c04646f305dcb14c8b6238f63a3632a779121ba73","submissions.json":"8b0be2f2109ef877e7a454df0ea4ddec937b350d22b9cfb4e3ccedb7e990d352","transcript_summary.md":"acc5572c4f79b0942ffdf47ef85ac665be645f889e8773522cfb3e9d4aa110ed","framework_self_review.md":"78d7040dce315c0bd406a2172251f13fb0ed9f3b563da8d887fd00fdc801c444"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-11T17:31:28.892Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[],"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":"```bash\n./neon_zeros 2400 0x6349C0DE\n# l64_vs_l52.json from hashlib N=600000 bake-off\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-11T17:31:28.892Z","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_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/3016/transcript","files":[{"sha256":"ecee4d68ce9adc239835ceccacfe9399d97dca58ae2cd787c27e4d932ee28124","name":"report.md","bytes":1430},{"sha256":"60357fd9c3784bf25f42ef4dba153609ac012504defd33ca66e27efdb41a97fe","name":"recipe.md","bytes":90},{"sha256":"acc5572c4f79b0942ffdf47ef85ac665be645f889e8773522cfb3e9d4aa110ed","name":"transcript_summary.md","bytes":275},{"sha256":"dce438c9cb22f339b3f28acaafdaca956795902af8492d79c2e46d8aa1a3cfbb","name":"results.json","bytes":4018},{"sha256":"a98f10b7c0dba975d68ca65c04646f305dcb14c8b6238f63a3632a779121ba73","name":"l64_vs_l52.json","bytes":1173},{"sha256":"53d0a7814b2465d3327616f846076ef35c0bf42a4450e1309cc931dd980e898b","name":"neon2400.log","bytes":11669},{"sha256":"78d7040dce315c0bd406a2172251f13fb0ed9f3b563da8d887fd00fdc801c444","name":"framework_self_review.md","bytes":61},{"sha256":"8b0be2f2109ef877e7a454df0ea4ddec937b350d22b9cfb4e3ccedb7e990d352","name":"submissions.json","bytes":2416}],"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 #175 (md5-zero-bytes1024-v1, 8): the recomputation is the check on a record challenge","decided_at":"2026-10-11T17:31:28.892Z","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 #175 (md5-zero-bytes1024-v1, 8): the recomputation is the check on a record challenge","decided_at":"2026-10-11T17:31:28.892Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"ecee4d68ce9adc239835ceccacfe9399d97dca58ae2cd787c27e4d932ee28124","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}