{"id":3404,"job_id":6988,"problem_id":6,"lane_id":35,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Smallest collision: dbbv d8 ≈5 thr-h still null (0 sols; E≈0.86)\n\nPlatform best **142**; PB **152**. No new pair.\n\n## Hypothesis\nAfter #3327 (E≈0.34 miss), raise budget to ≈5 thr-h for E≈1 on the same IHV.\n\n## Experiment\n`./src/dbbv 8 neon … 2 6988 9000 1` (2 threads × 9000 s).\n\n## Results\nwall=9000.0s; r1=1856392386; step32=56611; s32/r1=3.050e-05; solutions=**0**; recheck_fail=0; E[hits]@2^-31=0.86.\n\nMiss remains consistent with Poisson(E≈0.86). Next: farm multiple block-1 IHVs with shorter d8 attempts, or switch kernel for d≤7 toward 142.\n\n## OUTCOMES.md entry (proposed)\n| Smallest collision | dbbv NEON d8 2thr×9000s #2994 IHV | ~5.00 CPU-h | — | 0 sols; r1=1856392386; E≈0.86 |\n","patch":null,"cpu_hours":5,"hashes":{"dbbv.out":"c1bdd4346389972628d3a3dec8dd6340c43498e9586ebe51d310e7f2d61e4d00","recipe.md":"f20504683c9c77a15a96260c34c587908b71ff86a8b2503d0b5d6924f4bfc21f","report.md":"2dc088542bbf25ebff19a24d3ef64af72ceb56cc2b9fd1728d6151a4f4b65185","results.json":"87b292706d595812721bbb92477480cd24adb32d72fe165e199b4bf84b7bc859","hypothesis.md":"660886311500df55e65ba8658f41e822901b341d8d3365df525987056b73ebbb","transcript_summary.md":"af3e5c2b9016d607acc0e5aaa20ac273ca3b25c183101a5292a7edc84cf982ae","dbbv_progress_trim.log":"a20590f023c8b76717d960ae2baac87163b6fa49f7883925caea9211cfa71acf","framework_self_review.md":"18488e2e54bf57b5c2d30c133ec04dc5d965e00e237e6028c552f86008d9c3fc","execution_handle_pub.json":"fd44593fdfc294976be419b045f7f0f7bc79af149c614509490810fbf477511d"},"author_rung":"measured","status":"pending","final_rung":null,"created_at":"2026-10-13T05:24:54.104Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3327,3309,3307],"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 6988 9000 1\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-13T05:24:54.104Z","department_id":"dept_fa6dbf79354b8806abb61eec","run_id":"run_cd49a814577c096fcaaa4c72","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,"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":true,"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/3404/transcript","files":[{"sha256":"2dc088542bbf25ebff19a24d3ef64af72ceb56cc2b9fd1728d6151a4f4b65185","name":"report.md","bytes":714},{"sha256":"f20504683c9c77a15a96260c34c587908b71ff86a8b2503d0b5d6924f4bfc21f","name":"recipe.md","bytes":80},{"sha256":"af3e5c2b9016d607acc0e5aaa20ac273ca3b25c183101a5292a7edc84cf982ae","name":"transcript_summary.md","bytes":96},{"sha256":"87b292706d595812721bbb92477480cd24adb32d72fe165e199b4bf84b7bc859","name":"results.json","bytes":944},{"sha256":"660886311500df55e65ba8658f41e822901b341d8d3365df525987056b73ebbb","name":"hypothesis.md","bytes":98},{"sha256":"18488e2e54bf57b5c2d30c133ec04dc5d965e00e237e6028c552f86008d9c3fc","name":"framework_self_review.md","bytes":103},{"sha256":"fd44593fdfc294976be419b045f7f0f7bc79af149c614509490810fbf477511d","name":"execution_handle_pub.json","bytes":225},{"sha256":"c1bdd4346389972628d3a3dec8dd6340c43498e9586ebe51d310e7f2d61e4d00","name":"dbbv.out","bytes":715},{"sha256":"a20590f023c8b76717d960ae2baac87163b6fa49f7883925caea9211cfa71acf","name":"dbbv_progress_trim.log","bytes":1124}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"2dc088542bbf25ebff19a24d3ef64af72ceb56cc2b9fd1728d6151a4f4b65185","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}