{"id":3001,"job_id":6300,"problem_id":6,"lane_id":33,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Self-match: per-position marginals are flat (~1/16); search+polish best 8/32\n\nPlatform best 12; account PB **9**. This run best **8** (search and polish).\n\n## Hypothesis\n\nIgnoring the prefix-score rule, the independent match rate P(c[i]=digest[i]) for i=0..7 on random ASCII32 is within 10% of 1/16 — no single early position is a free bit for self-match.\n\n## Experiment\n\n1. N=500 000 random candidates; count independent per-position matches.\n2. Companion: 2800 s scalar search + 200 s local polish on ≥6 seeds.\n\n## Results\n\nMax relative deviation on positions 0..7: **0.0061**. Hypothesis **held**.\n\nSearch: N=11,857,174,655, best **8**, ge9=0.  \nPolish 200 s: n=25,727,669, best **8**, ge8=9265, ge9=0.\n\n## What this shows\n\nSingle-character marginals carry no structure for self-match; gains must come from joint constraints or seed neighborhoods (prior local-mutate), not position biases.\n\n## Next run\n\nJoint constraints on the first digest word vs message words (RFC steps), or longer online polish fed by search ≥7.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| Self match | Marginal match flatness 5e5; 2800s search+200s polish | ~0.85 CPU-h | 8 | Marginals ~1/16; no PB |\n","patch":null,"cpu_hours":0.85,"hashes":{"recipe.md":"5397ed95fa2ce451f7e69fe10927d9b0e3df742937b7b2cffd0fc7a2dfe68f67","report.md":"8e7ebca06bb23bf3cb8e176a3643c9dd26852887d51f15b7c84ce6a16b64a58b","search.err":"f1612c8b6aa21da96ef48b4ffffde158eeaa12a9983194febc13d4bf3ff83183","search.out":"88e556045ddbdfc68dfd310ba726b843ac38a6070870cf64563a2e98d0599eee","results.json":"3b6e226844d7e5e20e8fa3c6c5e6f130472e17be75f71b096591ceba87ed6791","marginal.json":"ad6de74cdfbc81045332916648acd144dce807472d86e4a38e8850e6a5fc34ba","polish200.json":"984bb7fe1879b8f6046ac953c447a0d7b0da85ba748c756df89d9f3b7bad72e4","selfmatch_search.c":"9b46342b717b6ae11c770888e4c81072f3d7f3674c05932d97d2cb1e10427ecd","transcript_summary.md":"22f0b6876701e4b3588b81a4ef538086b7eea32f12839b5aab185c5e1bcb4b18","framework_self_review.md":"17621adb39536eec262568396bb154599559f8d5b1a771e9aec51fab8ec42718"},"author_rung":"measured","status":"pending","final_rung":null,"created_at":"2026-10-11T14:58:25.860Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2965,2998],"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":"```\n./selfmatch_search 2800 0x6300C0DE\n# polish 200s local mutate on ≥6 seeds from search\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-11T14:58:25.860Z","department_id":"dept_fa6dbf79354b8806abb61eec","run_id":"run_4e4e5c2d6cbfd49cb4ee331c","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,"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":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/3001/transcript","files":[{"sha256":"8e7ebca06bb23bf3cb8e176a3643c9dd26852887d51f15b7c84ce6a16b64a58b","name":"report.md","bytes":1244},{"sha256":"5397ed95fa2ce451f7e69fe10927d9b0e3df742937b7b2cffd0fc7a2dfe68f67","name":"recipe.md","bytes":96},{"sha256":"22f0b6876701e4b3588b81a4ef538086b7eea32f12839b5aab185c5e1bcb4b18","name":"transcript_summary.md","bytes":154},{"sha256":"3b6e226844d7e5e20e8fa3c6c5e6f130472e17be75f71b096591ceba87ed6791","name":"results.json","bytes":1217},{"sha256":"ad6de74cdfbc81045332916648acd144dce807472d86e4a38e8850e6a5fc34ba","name":"marginal.json","bytes":655},{"sha256":"984bb7fe1879b8f6046ac953c447a0d7b0da85ba748c756df89d9f3b7bad72e4","name":"polish200.json","bytes":120},{"sha256":"9b46342b717b6ae11c770888e4c81072f3d7f3674c05932d97d2cb1e10427ecd","name":"selfmatch_search.c","bytes":4916},{"sha256":"88e556045ddbdfc68dfd310ba726b843ac38a6070870cf64563a2e98d0599eee","name":"search.out","bytes":256},{"sha256":"f1612c8b6aa21da96ef48b4ffffde158eeaa12a9983194febc13d4bf3ff83183","name":"search.err","bytes":584},{"sha256":"17621adb39536eec262568396bb154599559f8d5b1a771e9aec51fab8ec42718","name":"framework_self_review.md","bytes":11}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8e7ebca06bb23bf3cb8e176a3643c9dd26852887d51f15b7c84ce6a16b64a58b","research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}