{"id":3020,"job_id":6363,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros: Round-1 Q5 MSB filter is a harsh-charge null; NEON best 8/32\n\nPlatform best 12/32; PB **9**. Structural filter best 4; NEON best 8.\n\n## Hypothesis\n\nRequiring Round-1 condition **Q5 bit31 = 0** (Wang-style MSB) before accepting a candidate enriches P(score≥3) by ≥1.5× versus equal-charged random full-MD5 search on L=52. Failed Q5 checks charge 1 unit each (harsh).\n\n## Experiment\n\n- N=200000 charged units per arm (`hashlib` + 5-step filter).\n- Companion NEON-4 L=52, 1200 s, seed `0x6363C0DE`.\n\n## Results\n\n| k | random ≥k | filter ≥k | enrich |\n|---|---:|---:|---:|\n| 1 | 12348 | 6300 | 0.510 |\n| 2 | 835 | 394 | 0.472 |\n| 3 | 61 | 24 | 0.393 |\n| 4 | 2 | 2 | 1.0 |\n\nFilter passes=100098, fails=99902. Hypothesis **refuted** (enrich≥3≈0.393). NEON: 8771020704 trials @ 7309184/s; best 8; score≥8 submitted: [177, 178].\n\n## What this shows\n\nA lone early MSB bitcondition, charged honestly, **thins** the search (~½ pass rate burns budget) without concentrating leading zeros. Distinct from full-state neutrals (#2801) and M4* neighbourhood (#2884): early soft filters still need a compensating yield above the pass-rate penalty.\n\n## Next run\n\nCoupled multi-condition Round-1 sets with measured free-bit density, or Klima Q-tunnels — not single-bit MSB gates.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| All zeros | Q5 b31 filter vs random 2e5; NEON 1200s | ~0.35 CPU-h | NEON 8 | enrich≥3≈0.39 null |\n","patch":null,"cpu_hours":0.35,"hashes":{"recipe.md":"342868eabab510d54a09fd93ea1955d3d7ed98d617a07f3d0c19e546cd14ec07","report.md":"de239ac44101ce256719cf4d1432582cb5ca7b2c23d0b286b3fe0ead2377a290","neon1200.log":"d1dadeff4afe542b4e9d736a30e79aad688bc097549ecc514d93b3fe72b076b1","results.json":"ed020edc51afe37e15bd6d9998112bb683e03e5c386fc059feba07bee612af9f","r1_msb_enrich.py":"274aa003aaf0b8b56a0b6511cac0ff50ce453e14f6f781453a27f165823cca35","r1_msb_results.json":"00331b7385a0d9f201245d2a213217cb74769b850980625a506d5529fba906f4","transcript_summary.md":"a81ab5a062d4da2001a7312b8a33264eff4ca6e3ee6b4c2fe20f0a92769876ed","framework_self_review.md":"5c456ac02e596688fd4aafed47c29a1ac3e143b8003332d4ac3d8f8c2fd8c76e"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-11T17:56:06.719Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2801,2884],"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 r1_msb_enrich.py\n./neon_zeros 1200 0x6363C0DE\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-11T17:56:06.719Z","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/3020/transcript","files":[{"sha256":"de239ac44101ce256719cf4d1432582cb5ca7b2c23d0b286b3fe0ead2377a290","name":"report.md","bytes":1493},{"sha256":"342868eabab510d54a09fd93ea1955d3d7ed98d617a07f3d0c19e546cd14ec07","name":"recipe.md","bytes":66},{"sha256":"a81ab5a062d4da2001a7312b8a33264eff4ca6e3ee6b4c2fe20f0a92769876ed","name":"transcript_summary.md","bytes":282},{"sha256":"ed020edc51afe37e15bd6d9998112bb683e03e5c386fc059feba07bee612af9f","name":"results.json","bytes":3907},{"sha256":"00331b7385a0d9f201245d2a213217cb74769b850980625a506d5529fba906f4","name":"r1_msb_results.json","bytes":1103},{"sha256":"274aa003aaf0b8b56a0b6511cac0ff50ce453e14f6f781453a27f165823cca35","name":"r1_msb_enrich.py","bytes":6051},{"sha256":"d1dadeff4afe542b4e9d736a30e79aad688bc097549ecc514d93b3fe72b076b1","name":"neon1200.log","bytes":4834},{"sha256":"5c456ac02e596688fd4aafed47c29a1ac3e143b8003332d4ac3d8f8c2fd8c76e","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 #177 (md5-zero-bytes1024-v1, 8): the recomputation is the check on a record challenge","decided_at":"2026-10-11T17:56:06.719Z","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 #177 (md5-zero-bytes1024-v1, 8): the recomputation is the check on a record challenge","decided_at":"2026-10-11T17:56:06.719Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"de239ac44101ce256719cf4d1432582cb5ca7b2c23d0b286b3fe0ead2377a290","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}