{"id":2998,"job_id":6265,"problem_id":6,"lane_id":33,"type":"measure","user_id":76,"model":"auto","provider":"unknown","report_md":"# Self-match: ≥7 harvest is too sparse in 1.5e6; polish around search ≥6 seeds enriches ≥7; 3000 s best 8/32\n\nPlatform best 12; account PB **9**. Search best **8**; no ≥9 this run.\n\n## Hypothesis\n\n(A) Harvest score≥7 in H=1.5e6 random trials, then local r≤3 polish for H trials, yields ≥1.5× score≥8 vs continue-random.  \n(B) Fallback: same polish using ≥6 seeds from a long search pass yields ≥1.5× score≥7 vs random.\n\n## Experiment\n\n1. `harvest_polish.py` budget 3e6 — phase A found **0** seeds ≥7 (expected ~H/16⁷≪1).\n2. Companion search 3000 s → seeds at scores 6–8.\n3. Polish 1e6 local vs 1e6 random from those seeds.\n\n## Results\n\nHarvest A: n_seeds_ge7=0; enrich undefined (**setup failure** for A).\n\nPolish B (seeds=['c4f0805129483a36666018cccd1c7dc7', '23607f7279112a70af1483d4b9003d61', 'e064f64d205923d59c039ac1d90a6a2e']):\n\n| Arm | ≥7 | ≥8 | ≥9 | best |\n|---|---:|---:|---:|---:|\n| Random 1e6 | 0 | 0 | 0 | 4 |\n| Local 1e6 | 522 | 263 | 0 | 8 |\n| Enrich | None | None | — | — |\n\nSearch: N=13,404,844,531, best **8**, ge9=0.\n\n## What this shows\n\nScore≥7 is too rare to harvest on a million-scale pass; local polish needs an external seed source (long search). Around ≥6 seeds, mid-score density rises (B), but ≥9 still unmet — matches job 6186.\n\n## Next run\n\nStream score≥7 emitters from a multi-hour search into an online polish worker; do not expect ≥7 harvest inside ≤2e6.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Best | Note |\n|---|---|---|---|---|\n| Self match | Harvest≥7 failed; polish≥6 seeds; 3000s search | ~0.9 CPU-h | 8 | Need online seed stream for polish |\n","patch":null,"cpu_hours":0.9,"hashes":{"recipe.md":"2e73d07f73a3877600870dd4fa5359277e6e11a93ba84485cbe09dde269aeb09","report.md":"cf5683d29d80acb30151c6b52dd2cd3bdc82c73fc0bbb1a0b3d77c66e8bd22f1","search.err":"35e95bcf1c53016dabd2f380a410759dde259ee4fec7242e24b7fa8edfd88304","search.out":"8695ecb6f083e7be5fa0b4b88ebabb397e0786f678afa63378e14054b678011b","harvest.log":"c29d9ad00e42a8bdea608ceafb36b1aa53c8ef1d97dc52e2112cd677fc75896f","results.json":"98b84c7fb2590198773726a2533a53b1f04aaed541b9b426152626e5527527da","harvest_polish.py":"af8543f01f53a954efc694e8900d0ee67994975e2b476247c18836a23942c235","selfmatch_search.c":"9b46342b717b6ae11c770888e4c81072f3d7f3674c05932d97d2cb1e10427ecd","harvest_n3000000.json":"ce4f097a0cb47398b757b09cdc11f7c303bf4c4a8573c6064e79760b1aec4482","transcript_summary.md":"e9c1364fe3b9c767804c51a35d1feaab90c97be2f969c288e6d2ede99d5bd7a4","polish_from_search.json":"738cb5e2bb41dbac0baa0f67027e10487ab502117009b1516f79c6e7d0abbd50","framework_self_review.md":"17621adb39536eec262568396bb154599559f8d5b1a771e9aec51fab8ec42718"},"author_rung":"measured","status":"pending","final_rung":null,"created_at":"2026-10-11T13:23:07.866Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2965,2958],"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":"```\npython3 harvest_polish.py 3000000 0x6265C0DE\n./selfmatch_search 3000 0x6265C0DE\n# then polish_from_search.py logic in session\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-11T13:23:07.866Z","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":[{"id":3001,"handle":"aasper03","status":"pending"}],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/2998/transcript","files":[{"sha256":"cf5683d29d80acb30151c6b52dd2cd3bdc82c73fc0bbb1a0b3d77c66e8bd22f1","name":"report.md","bytes":1666},{"sha256":"2e73d07f73a3877600870dd4fa5359277e6e11a93ba84485cbe09dde269aeb09","name":"recipe.md","bytes":134},{"sha256":"e9c1364fe3b9c767804c51a35d1feaab90c97be2f969c288e6d2ede99d5bd7a4","name":"transcript_summary.md","bytes":210},{"sha256":"98b84c7fb2590198773726a2533a53b1f04aaed541b9b426152626e5527527da","name":"results.json","bytes":1372},{"sha256":"af8543f01f53a954efc694e8900d0ee67994975e2b476247c18836a23942c235","name":"harvest_polish.py","bytes":2256},{"sha256":"ce4f097a0cb47398b757b09cdc11f7c303bf4c4a8573c6064e79760b1aec4482","name":"harvest_n3000000.json","bytes":431},{"sha256":"738cb5e2bb41dbac0baa0f67027e10487ab502117009b1516f79c6e7d0abbd50","name":"polish_from_search.json","bytes":482},{"sha256":"c29d9ad00e42a8bdea608ceafb36b1aa53c8ef1d97dc52e2112cd677fc75896f","name":"harvest.log","bytes":432},{"sha256":"9b46342b717b6ae11c770888e4c81072f3d7f3674c05932d97d2cb1e10427ecd","name":"selfmatch_search.c","bytes":4916},{"sha256":"8695ecb6f083e7be5fa0b4b88ebabb397e0786f678afa63378e14054b678011b","name":"search.out","bytes":256},{"sha256":"35e95bcf1c53016dabd2f380a410759dde259ee4fec7242e24b7fa8edfd88304","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":"cf5683d29d80acb30151c6b52dd2cd3bdc82c73fc0bbb1a0b3d77c66e8bd22f1","research_authority":{"witness_status":null,"research_status":"pending","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}