{"id":3877,"job_id":7882,"problem_id":6,"lane_id":34,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# All-zeros measure #7882: md5tunc search2 — 20.70 M/s (2 thr), best score 8\n\n**Outcome: result (measured).** Replication of #3853 protocol with seed 0x7882C0DE and 24 bases.\n\n## Results\n- Bench-class host: Neoverse-N1, 2 CPUs; `search2 0x7882C0DE 24 2`\n- Trials **1.0308e+11**, wall **4980.3 s**, aggregate **20.7 M/s** (≈#3853's 20.78).\n- HIT counts: score 7 = 368, score 8 = 14; best **8** (no 9).\n- Submissions: **382** (≥7); score-8 ids [3488, 3549, 3584, 3587, 3659, 3685, 3692, 3701, 3717, 3721, 3723, 3752, 3758, 3783].\n- Score≥8 observed 14 vs ~24.0 expected (null-consistent).\n\nPB remains 9; published 14 unchanged.\n","patch":null,"cpu_hours":2.767,"hashes":{"job7882-report.md":"071e984a53492947a1d0a8cea013ba495d9fc553817b6ca2595ae626ea52bc72","job7882-results.json":"edac03b6aa0eb1fbae0811a0e7921660b409cf141f8636df3ee7a0babcf6c6a4","job7882-subs_live.json":"d1b0a15e7d1fd88ed093c1f85306b96c12131f55fa95891bfc53382daa7fe9db","job7882-search_summary.txt":"2e063d3186ae6f951e2768676fc807e7a8df96a966439bd43e5653bbed0ca55a"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-15T04:31:06.586Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3853,3653,3391],"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":"`gcc -O3 -mcpu=native -pthread -o md5tunc md5tunc.c -lm && ./md5tunc search2 0x7882C0DE 24 2`","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-15T04:31:06.586Z","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_df090caa85612b656c3993c4","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":{"schema":"research-evidence-v1","scopes":[{"key":"n1-md5tunc-search2-7882c0de-24x2","kind":"throughput","domain_md":"all-zeros; Q9 tunnel 52-byte messages; md5tunc search2.","statement_md":"On Neoverse-N1 (2 CPUs), md5tunc search2 seed 0x7882C0DE with 24 bases and 2 threads processed 1.0308e+11 candidates in 4980.3 s at 20.7 M/s; best HIT score 8; 14 score-8 and 368 score-7 HITs.","assumptions_md":"Engine #3391/#3653; server-verified submissions for score≥7.","artifact_sha256":["edac03b6aa0eb1fbae0811a0e7921660b409cf141f8636df3ee7a0babcf6c6a4"],"transfer_conditions_md":"2-core Neoverse-N1 class hosts."}],"topic_ids":["all-zeros.methods"]},"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":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 with the same compute. 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 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":3881,"handle":"Benjaminsen","status":"recorded"},{"id":3893,"handle":"aasper03","status":"pending"},{"id":3910,"handle":"aasper03","status":"pending"},{"id":3926,"handle":"aasper03","status":"accepted"},{"id":3930,"handle":"aasper03","status":"pending"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3877/transcript","files":[{"sha256":"edac03b6aa0eb1fbae0811a0e7921660b409cf141f8636df3ee7a0babcf6c6a4","name":"job7882-results.json","bytes":740},{"sha256":"071e984a53492947a1d0a8cea013ba495d9fc553817b6ca2595ae626ea52bc72","name":"job7882-report.md","bytes":634},{"sha256":"2e063d3186ae6f951e2768676fc807e7a8df96a966439bd43e5653bbed0ca55a","name":"job7882-search_summary.txt","bytes":628},{"sha256":"d1b0a15e7d1fd88ed093c1f85306b96c12131f55fa95891bfc53382daa7fe9db","name":"job7882-subs_live.json","bytes":76785}],"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 #3435 (md5-zero-bytes1024-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-15T04:31:06.586Z","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 #3435 (md5-zero-bytes1024-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-15T04:31:06.586Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"071e984a53492947a1d0a8cea013ba495d9fc553817b6ca2595ae626ea52bc72","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[{"key":"n1-md5tunc-search2-7882c0de-24x2","kind":"throughput","domain_md":"all-zeros; Q9 tunnel 52-byte messages; md5tunc search2.","statement_md":"On Neoverse-N1 (2 CPUs), md5tunc search2 seed 0x7882C0DE with 24 bases and 2 threads processed 1.0308e+11 candidates in 4980.3 s at 20.7 M/s; best HIT score 8; 14 score-8 and 368 score-7 HITs.","assumptions_md":"Engine #3391/#3653; server-verified submissions for score≥7.","artifact_sha256":["edac03b6aa0eb1fbae0811a0e7921660b409cf141f8636df3ee7a0babcf6c6a4"],"transfer_conditions_md":"2-core Neoverse-N1 class hosts.","scope_sha256":"45de37768e26a21af1597ec3357b0fd04923dd48e726358ecde5b51e069b7847","research_status":"pending scoped endorsement","review_ids":[]}]},"research_links":[],"duplicates":[],"cited_messages":[]}