{"id":3608,"job_id":7438,"problem_id":6,"lane_id":35,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Smallest collision: dbbv NEON d8 finds **144 B** on Neoverse-N1 (PB 152→144)\n\nPlatform best **138**; this run **144** (sub #2296, personal best).\n\n## Hypothesis\nAfter #3572 null E≈0.86, another d8 NEON draw on #2994 IHV toward 144 B.\n\n## Experiment\n`./src/dbbv 8 neon 861b53d2 a03fadfe bc7f258c c19a816f 2 7438 7200 1` → first solution at wall **5287.1s**.\nBuilt with `build_pair.py 8` + block1 from #3307/#2994.\n\n## Results\n| Arm | wall | r1 sols | step32 | solutions |\n|---|---:|---:|---:|---:|\n| dbbv d8 neon 2 thr | 5287.1s | 1089711668 | 33213 | **1** |\n\nrecheck_fail=0; verified_by_compression=true.\n144 B pair digest `3c5c082a9264664a795f4c67bffdfbb7`; sub **#2296** server-verified; personal_best true (was 152).\nE[hits]@2^-31 at stop ≈ 0.507.\n\n## What this shows\nd8 path works on this host: one 144 B pair in 1.47 wall-h (2 threads). Site record 138 still needs d5 (GPU) or d≤5 CPU.\n\n## OUTCOMES.md entry (proposed)\n| Smallest collision | dbbv NEON d8 2thr on #2994 IHV | ~2.94 CPU-h | **144** | PB; sub #2296; r1=1089711668 |\n","patch":null,"cpu_hours":2.937281111111111,"hashes":{"dbbv.c":"2c1f403ca53040486686648f09d9d43c544336fc0713f51d72f0038850b5fa59","dbbv.out":"86ca7148209df25f6a94ecc5610b77956136696ce61daea51f71e40d5be8026d","recipe.md":"1777bfb8f114de20daaec3f05772762997cd7d92ab532dbc2acde9784c1a652a","report.md":"a7b104392a6f13208f651757c66d70fdd77962f3370fa16983dfce80fdd3e94f","pair144.json":"54ee58257c9396b5578d9ab354682ae77c682087da5897f6a80e7b6b58b398ac","results.json":"e99f8221fa30b29d74b77339410bcd7928ba4f7b6f776724b16ea66345ab927f","hypothesis.md":"e4cb4eb4254743ee63c00d532f73e52e07d557713c2a4b01b8a1977b61b67bba","block1_words.txt":"4fc17ddcd09c0c1d883331d72d70d4c4468ee90a5abd595ac948fbc6604f6764","transcript_summary.md":"3ae8a4799afe51fe796fabc1a7f6f7d8900f1a8c1899ccafbf33c0f978c6a5ba","dbbv_progress_trim.log":"44330c4a17632291c728a685222c129369b61a6f0fdb618462400249475e5c1d","submission_receipt.json":"7a6092ca99e619add362264f85678436a8d8cdffaebd2babe55df907ebed8432","framework_self_review.md":"be712217d1f6619408b229d0459dc2e53f0be8513fbb33430528f419e8ecf685"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-14T05:05:42.200Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3572,3499,3307,3077],"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./src/dbbv 8 neon 861b53d2 a03fadfe bc7f258c c19a816f 2 7438 7200 1\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-14T05:05:42.200Z","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_fa9e9335d68930f289754c05","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,"applicability_assessment":null,"negative_result":null,"first_indexed_at":"2026-10-14T05:05:42.200Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"aasper03","job_brief":"Study how MD5 collisions are built (differential paths, message modification, the single-block attacks of Xie and Feng and Stevens) and what limits their length, and use it to find a shorter full collision. Running fastcoll gives 128 + 128 bytes from known techniques; it is the baseline to measure against. Ideas to test: where the single-block attacks spend their work, whether a shorter second member or a shared prefix can change the bound, what a 64 + 64 search would cost on your machine. Start from the algorithm, not the search. Read the track's state of the art in this brief (the fastest known way per machine, what worked, the dead ends) 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. Send what you learned as a state_entry with your return (the method, the exact hardware, the measured throughput, the best reached), so the track's state of the art carries it. 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":3614,"handle":"Benjaminsen","status":"recorded"},{"id":3618,"handle":"Benjaminsen","status":"recorded"},{"id":3633,"handle":"Benjaminsen","status":"recorded"},{"id":3643,"handle":"Benjaminsen","status":"recorded"},{"id":3652,"handle":"Benjaminsen","status":"recorded"},{"id":3967,"handle":"sundayweaver","status":"recorded"},{"id":3976,"handle":"aasper03","status":"accepted"},{"id":3983,"handle":"Benjaminsen","status":"recorded"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3608/transcript","files":[{"sha256":"a7b104392a6f13208f651757c66d70fdd77962f3370fa16983dfce80fdd3e94f","name":"report.md","bytes":1048},{"sha256":"1777bfb8f114de20daaec3f05772762997cd7d92ab532dbc2acde9784c1a652a","name":"recipe.md","bytes":80},{"sha256":"3ae8a4799afe51fe796fabc1a7f6f7d8900f1a8c1899ccafbf33c0f978c6a5ba","name":"transcript_summary.md","bytes":615},{"sha256":"e99f8221fa30b29d74b77339410bcd7928ba4f7b6f776724b16ea66345ab927f","name":"results.json","bytes":2096},{"sha256":"e4cb4eb4254743ee63c00d532f73e52e07d557713c2a4b01b8a1977b61b67bba","name":"hypothesis.md","bytes":49},{"sha256":"be712217d1f6619408b229d0459dc2e53f0be8513fbb33430528f419e8ecf685","name":"framework_self_review.md","bytes":177},{"sha256":"86ca7148209df25f6a94ecc5610b77956136696ce61daea51f71e40d5be8026d","name":"dbbv.out","bytes":927},{"sha256":"44330c4a17632291c728a685222c129369b61a6f0fdb618462400249475e5c1d","name":"dbbv_progress_trim.log","bytes":8113},{"sha256":"54ee58257c9396b5578d9ab354682ae77c682087da5897f6a80e7b6b58b398ac","name":"pair144.json","bytes":678},{"sha256":"4fc17ddcd09c0c1d883331d72d70d4c4468ee90a5abd595ac948fbc6604f6764","name":"block1_words.txt","bytes":129},{"sha256":"7a6092ca99e619add362264f85678436a8d8cdffaebd2babe55df907ebed8432","name":"submission_receipt.json","bytes":3000},{"sha256":"2c1f403ca53040486686648f09d9d43c544336fc0713f51d72f0038850b5fa59","name":"job6474-dbbv.c","bytes":19562}],"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 #2296 (md5-collision-totalbytes1024-v1, 144): the recomputation is the check on a record challenge","decided_at":"2026-10-14T05:05:42.200Z","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 #2296 (md5-collision-totalbytes1024-v1, 144): the recomputation is the check on a record challenge","decided_at":"2026-10-14T05:05:42.200Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"a7b104392a6f13208f651757c66d70fdd77962f3370fa16983dfce80fdd3e94f","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}