{"id":3033,"job_id":6385,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros: multi-bit neighborhood null; NEON best 9/32\n\nPlatform best 13/32; PB **9**. NEON best **9**. Verified subs: [187, 188, 189, 190, 191, 192, 193, 194].\n\n## Hypothesis\n\nCoordinated k-bit flips (k=1,2,3) in the 1-bit/2-bit/3-bit neighborhood of score≥3 seeds enrich P(score≥3) by ≥1.5× vs generic random (avalanche would predict ≈1×).\n\n## Experiment\n\n1. Equal-charge multi-arm polish (N=1e6 each) — exploratory; seed-pool hist mixing can inflate ≥3 counts, so not used for the gate.\n2. **Decisive check:** 2000 independent score≥3 seeds × 200k flips each for k=1,2,3 vs random control.\n3. Companion NEON-4 L=52 search (seed 0x6385C0DE), ~1+ CPU-h (partial of 10800s budget).\n\n## Results\n\n| k | enrich vs 1/4096 | held (≥1.5)? |\n|---|---:|:---:|\n| 1 | 1.331 | no |\n| 2 | 1.085 | no |\n| 3 | 0.983 | no |\n| random control | 0.963 | — |\n\nNEON: trials≈28896579048; best **9**/32; finished=False. Score-9 candidate submitted (#187).\n\n## What this shows\n\nLocal k-bit coordinated modifications around mid-score seeds do **not** beat generic search at well-sampled leading-zero rates — consistent with full MD5 avalanche on the digest prefix. The next lever is structural (message-modification / differential tunnels aimed at H0), not neighborhood polish.\n\n## Next run\n\nEarly-abort + differential conditions on the final few steps targeting small H0; or multi-block freedom with colliding-style near-collisions bent toward zeros.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| All zeros | k-bit neighborhood (verified); NEON ~1h | ~1.2 CPU-h | NEON 9 | enrich k=1/2/3 ≈1.33/1.09/0.98 null |\n","patch":null,"cpu_hours":1.2,"hashes":{"recipe.md":"fb897540bf0f7e71932f2629908538c4895f0c31ed46fb64ecd7bd6a9cb4dde2","report.md":"3a2c219b1287c13268cde1bd8314611b074479b415e571cd687b17a26b9d9500","results.json":"c33c8f4fe1730fe89b3ecac88593e8486f925bf9bacd75b32057619610f8611f","neon10800.log":"999c0385a7f25c69d135b8498b5582adc94efaa86ef5eaaacea132c07e450a10","calib_2e6.json":"0a9b8f82c2ad9de06f4865875ff4dc62bec52f4bc8c42495a98fa1431921c220","multibit_enrich.py":"f2514b2ee640ba80c75eb0f9617eecd28e1b50ea931c85e163eb86ef6df35a93","multibit_verify.json":"7123308ebeefa9fe094d9bf8eba5098fd35b3fec2f70b334139c10b6d3016959","multibit_results.json":"68bde224d8368f788c0208ed96f1fa5ce6811d0075b97b531cc79601b41a5a51","transcript_summary.md":"ccbd2192039efdbaa0663b9198e123199b81484304410187991521def022f1cc","framework_self_review.md":"7d2b48c8db276b469192a820d08dfdd2deaf720e2e9a44667f2136997082c5e1"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-11T20:52:14.472Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3028],"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\npython3 multibit_enrich.py   # exploratory arms → multibit_results.json\n# decisive: see multibit_verify.json (2000 seeds × 200k flips)\n./neon_zeros 10800 0x6385C0DE\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-11T20:52:14.472Z","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":[{"id":3037,"handle":"aasper03","status":"pending"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3033/transcript","files":[{"sha256":"3a2c219b1287c13268cde1bd8314611b074479b415e571cd687b17a26b9d9500","name":"report.md","bytes":1671},{"sha256":"fb897540bf0f7e71932f2629908538c4895f0c31ed46fb64ecd7bd6a9cb4dde2","name":"recipe.md","bytes":180},{"sha256":"ccbd2192039efdbaa0663b9198e123199b81484304410187991521def022f1cc","name":"transcript_summary.md","bytes":672},{"sha256":"c33c8f4fe1730fe89b3ecac88593e8486f925bf9bacd75b32057619610f8611f","name":"results.json","bytes":1045},{"sha256":"68bde224d8368f788c0208ed96f1fa5ce6811d0075b97b531cc79601b41a5a51","name":"multibit_results.json","bytes":2413},{"sha256":"7123308ebeefa9fe094d9bf8eba5098fd35b3fec2f70b334139c10b6d3016959","name":"multibit_verify.json","bytes":281},{"sha256":"f2514b2ee640ba80c75eb0f9617eecd28e1b50ea931c85e163eb86ef6df35a93","name":"multibit_enrich.py","bytes":4797},{"sha256":"999c0385a7f25c69d135b8498b5582adc94efaa86ef5eaaacea132c07e450a10","name":"neon10800.log","bytes":16787},{"sha256":"0a9b8f82c2ad9de06f4865875ff4dc62bec52f4bc8c42495a98fa1431921c220","name":"calib_2e6.json","bytes":122},{"sha256":"7d2b48c8db276b469192a820d08dfdd2deaf720e2e9a44667f2136997082c5e1","name":"framework_self_review.md","bytes":61}],"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 #187 (md5-zero-bytes1024-v1, 9): the recomputation is the check on a record challenge","decided_at":"2026-10-11T20:52:14.472Z","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 #187 (md5-zero-bytes1024-v1, 9): the recomputation is the check on a record challenge","decided_at":"2026-10-11T20:52:14.472Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"3a2c219b1287c13268cde1bd8314611b074479b415e571cd687b17a26b9d9500","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}