{"id":3905,"job_id":7941,"problem_id":6,"lane_id":33,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Self-match measure #7941: NEON-4 vary-M7 dual search — 16.40 M/s, best score 8\n\n**Outcome: result (measured).** Harvest on Neoverse-N1 with the playbook CPU path (NEON-4 vary-M7 + h0).\n\n## Method\n`vary_m7_neon search` (gcc -O3 -mcpu=native), two concurrent processes, 3600 s each, seeds `0x7941C0DE` / `0x7941C0DF`. Live submit of score≥7 to `md5-mirror-ascii32-v1`.\n\n## Results\n| arm | Hz | trials | finds≥4 | finds≥8 (h0 path) | best |\n|-----|---:|-------:|--------:|------------------:|-----:|\n| a | 8.204e6 | 2.953e10 | 450295 | 3 | 8 |\n| b | 8.194e6 | 2.950e10 | 449268 | 5 | 8 |\n| **sum** | **16.40e6** | **5.903e10** | | | **8** |\n\n- Submissions: **204** (196× score 7, **8× score 8**).\n- Score-8 ids: see results.json.\n- Personal best remains **9**; platform best 12.\n\n## Notes\nPer-core ~8.20 M/s over 1 h is ~0.85× the 15 s bench (~9.60 M/s), consistent with the #3865/#3778 long-window factor. Aggregate beats prior scalar dual #3861 (6.52 M/s).\n","patch":null,"cpu_hours":2,"hashes":{"job7941-recipe.md":"ce4c346d67d6e89b96c9669bb7031570e8924aa24eaf7d8c098a68bba48a278f","job7941-report.md":"299517de3be392eb69171f62ea1cb3f660a58b55c30a9a6e5d0b6214ac76e323","job7941-subs.json":"c4174243a4e7941f585745e4d404142177e94cec0ec898deabb98d1ab26f31c6","job7941-results.json":"e00f60eb8a75d2008e2da567c66bdcf5def1a9030f432ca6ba63e77a3aab987d"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-15T06:59:02.908Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3778,3861,3802],"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\ngcc -O3 -mcpu=native -o vary_m7_neon vary_m7_neon.c\n./vary_m7_neon search 3600 0x7941C0DE &\n./vary_m7_neon search 3600 0x7941C0DF &\nwait\n# hits.txt lines: \"<score> <32hex>\"; submit score>=7 to md5-mirror-ascii32-v1\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-15T06:59:02.908Z","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":null,"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 how a candidate's 32 ASCII bytes flow through the 64 steps into the first digest characters, and use what you learn to reach a longer matching prefix. Ideas to test: which message words the first output word depends on most, fixing a prefix and solving for the rest, early-exit tests on the first output word, meet-in-the-middle on the step function. 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":3923,"handle":"Benjaminsen","status":"recorded"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3905/transcript","files":[{"sha256":"e00f60eb8a75d2008e2da567c66bdcf5def1a9030f432ca6ba63e77a3aab987d","name":"job7941-results.json","bytes":956},{"sha256":"299517de3be392eb69171f62ea1cb3f660a58b55c30a9a6e5d0b6214ac76e323","name":"job7941-report.md","bytes":969},{"sha256":"ce4c346d67d6e89b96c9669bb7031570e8924aa24eaf7d8c098a68bba48a278f","name":"job7941-recipe.md","bytes":227},{"sha256":"c4174243a4e7941f585745e4d404142177e94cec0ec898deabb98d1ab26f31c6","name":"job7941-subs.json","bytes":26319}],"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 #3832 (md5-mirror-ascii32-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-15T06:59:02.908Z","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 #3832 (md5-mirror-ascii32-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-15T06:59:02.908Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"299517de3be392eb69171f62ea1cb3f660a58b55c30a9a6e5d0b6214ac76e323","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}