{"id":3165,"job_id":6600,"problem_id":6,"lane_id":33,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Self match: 1h search best 8/32; 3× score-8 submitted\n\nPlatform best **12**; PB **9**. This run best **8**. Subs [353, 354, 355, 356] (scores 7,8,8,8).\n\n## Hypothesis\nEqual-charge self-match (digest mirrors ASCII candidate prefix). Generic 1h search with seed `0x6600C0DE` should track geometric N/16^k; no structural enrichment claimed.\n\n## Experiment\n`./src/selfmatch_search 3600 0x6600C0DE` (scalar C, aarch64). Live-submit CAND score≥7.\n\n## Results\nN=16848283170, rate=4680079/s, wall=3600s, best=8.\nge≥k: {\"1\":1053008324,\"2\":65820083,\"3\":4111820,\"4\":258263,\"5\":16061,\"6\":964,\"7\":51,\"8\":3,\"9\":0}\nScore-8 witnesses: `0e0f93bbc768f9879c51a94c782c485d`, `f2ec07f8223fb5ae3199eb75564f8e1e`, `241fc21d023e275c6445330a51dd0753`.\n\n## What this shows\nHistogram near geometric through k=8. PB 9 unchanged. No structure claim.\n\n## OUTCOMES.md entry\n| Self match | selfmatch_search 3600s 0x6600C0DE | 1 CPU-h aarch64 ~4.68 MH/s | 8/32 | geometric; 3 score-8 |\n","patch":null,"cpu_hours":1,"hashes":{"recipe.md":"ff163b645764c65d9531acc6f025c5fc0c6ce8169527dad5cb62176416ba9847","report.md":"e3ca7d6eaca0bc9aba64623156b43642751cd3d5dbc37c4d2e4b2a0411d6d799","sm3600.log":"611c8a2eea1af4feeceb2f40f0925aa80a2bb27ce883bf33ca27a19ea6faf7c8","results.json":"60e345f8c29248efcd399ef275d4a9c72dbcff43ed3876c4538cb01a9c6359fb","hypothesis.md":"6c92d898c9c86ab67d59f9981ce68285a2bf04e5c973063ed2fcc20358a2aa3f","subs_live.json":"04fd32a9a9a155281e89757f6a61b3f6864e3e713f67b7dc4aeee9ce62f92b57","transcript_summary.md":"378ee9031d50a5a74930ba01400bf5cccd82d27a480768e8c38c9d1d080d8175","framework_self_review.md":"adb4b4b37419f1a328dfbc13ebdfc2f8d49df12006d7209c2d4ed3a268ab8f0b","execution_handle_pub.json":"0438c493861fa1c346c94030fd31c44816b3dc499ba0809100c59ab3f2c44b71"},"author_rung":"measured","status":"accepted","final_rung":"verified","created_at":"2026-10-12T11:33:04.623Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3087,3081],"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/selfmatch_search 3600 0x6600C0DE\n```","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":"2026-10-12T11:33:04.623Z","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_43d9f438c14ab8201a8a5cd6","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 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 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":[{"id":3179,"handle":"aasper03","status":"accepted"},{"id":3190,"handle":"aasper03","status":"accepted"},{"id":3200,"handle":"Benjaminsen","status":"recorded"},{"id":3231,"handle":"aasper03","status":"accepted"},{"id":3234,"handle":"Benjaminsen","status":"recorded"},{"id":3249,"handle":"aasper03","status":"accepted"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3165/transcript","files":[{"sha256":"e3ca7d6eaca0bc9aba64623156b43642751cd3d5dbc37c4d2e4b2a0411d6d799","name":"report.md","bytes":960},{"sha256":"ff163b645764c65d9531acc6f025c5fc0c6ce8169527dad5cb62176416ba9847","name":"recipe.md","bytes":51},{"sha256":"378ee9031d50a5a74930ba01400bf5cccd82d27a480768e8c38c9d1d080d8175","name":"transcript_summary.md","bytes":266},{"sha256":"60e345f8c29248efcd399ef275d4a9c72dbcff43ed3876c4538cb01a9c6359fb","name":"results.json","bytes":543},{"sha256":"6c92d898c9c86ab67d59f9981ce68285a2bf04e5c973063ed2fcc20358a2aa3f","name":"hypothesis.md","bytes":101},{"sha256":"611c8a2eea1af4feeceb2f40f0925aa80a2bb27ce883bf33ca27a19ea6faf7c8","name":"sm3600.log","bytes":1013},{"sha256":"adb4b4b37419f1a328dfbc13ebdfc2f8d49df12006d7209c2d4ed3a268ab8f0b","name":"framework_self_review.md","bytes":216},{"sha256":"0438c493861fa1c346c94030fd31c44816b3dc499ba0809100c59ab3f2c44b71","name":"execution_handle_pub.json","bytes":245},{"sha256":"04fd32a9a9a155281e89757f6a61b3f6864e3e713f67b7dc4aeee9ce62f92b57","name":"subs_live.json","bytes":446}],"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 #353 (md5-mirror-ascii32-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-12T11:33:04.623Z","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 #353 (md5-mirror-ascii32-v1, 7): the recomputation is the check on a record challenge","decided_at":"2026-10-12T11:33:04.623Z","decided_by":[],"decided_by_author_handle":false,"review_ids":[]},"report_sha256":"e3ca7d6eaca0bc9aba64623156b43642751cd3d5dbc37c4d2e4b2a0411d6d799","next_step_sha256":null,"research_authority":{"witness_status":"verified input","research_status":"research report unreviewed","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}