{"id":2806,"job_id":5924,"problem_id":6,"lane_id":33,"type":"explore","user_id":76,"model":"auto","provider":"unknown","report_md":"# First look (route 257): ASCII-exhaustive M7 does not enrich self-match ≥4\n\n**Outcome: blocked** (preregistered null). Enrichment on score≥4 was **1.05×** (< 1.5× success bar).\n\n## Hypothesis (from proposal 2805)\n\nExhaustively evaluating all 16⁴ ASCII-hex values of M7 (bytes 28–31) with other bytes fixed yields ≥1.5× the score≥4 rate of equal-hash uniform random search.\n\n## Experiment\n\n- **M7 arm:** 64 random ASCII32 bases; for each, fix bytes 0–27 and try all 65536 hex-alphabet M7 values; full `hashlib.md5`; **4 194 304** charged hashes.\n- **Random arm:** same charged hash count, uniform ASCII32.\n- Hardware: Linux aarch64; Python 3.\n\n## Results\n\n| Arm | charged | ≥4 | ≥5 | rate≥4 | best |\n|---|---:|---:|---:|---:|---:|\n| M7 exhaustive | 4 194 304 | 68 | 4 | 1.62×10⁻⁵ | 5 |\n| Random | 4 194 304 | 65 | 6 | 1.55×10⁻⁵ | 5 |\n| Expected ~1/16⁴ | — | ~64 | ~4 | 1.53×10⁻⁵ | — |\n\n**Enrichment ≥4: 1.046×. Enrichment ≥5: 0.67×.** Success criterion failed. Counts match the geometric model.\n\n## What this shows\n\nWithin one free message word under the hex alphabet, exhaustive search is statistically equivalent to random for short self-match prefixes. Combined with 2630 (unconstrained repair) and 2803 (fixed-prefix null), single-word algebraic/exhaustive levers on L=32 ASCII32 are closed at this budget.\n\n## Obstacle / revisit\n\nScoped obstruction: M7 ASCII exhaustion does not beat 16⁴-cost random for score≥4. Revisit with a multi-word meet-in-the-middle or a different free word **together with** an early-exit structural filter that reduces charged hashes below 16ᵏ — not another single-word full enumeration.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget and hardware | Best reached | Note |\n| --- | --- | --- | --- | --- |\n| Self match | ASCII-exhaustive M7 vs equal-hash random (64×16⁴) | ~0.03 CPU-h Python; aarch64 | score 5; enrich≥4 = 1.05× | First-look null on route 257 |\n","patch":null,"cpu_hours":0.03,"hashes":{"m7_results.json":"d5ced0ecae1c56dcbc82852f96e1b423016c76a5d8a3700b3af990dbee6fadc8"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-10-10T19:36:28.970Z","repo_url":null,"commit":null,"cites":{"files":["0aa7024af92209d56521cb3be0478cf8899aaea9424a59332e5beebbb9fcf270","d5ced0ecae1c56dcbc82852f96e1b423016c76a5d8a3700b3af990dbee6fadc8","4237f03973c23afdcd64e5f59119591fc285929fd50af5a05cff974eeb3bd74c","6cd127515067454855a0e64c4154a3a9c1139d70ee302e014030413fc2da1349","b4a808a178c788ea0cb60f81b17be6ed2dc4cc8f8d9f91485c76098525910623"],"handles":[],"returns":[2805,2630,2803],"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":"# Recipe\n\n```bash\npython3 m7_enrichment.py\n# writes m7_results.json; expect enrichment_ge4 ≈ 1.0 and success false\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":{"outcome":"blocked","obstacle":{"kind":"scoped_obstruction","evidence":"m7_results.json enrichment_ge4=1.0461538461538462; ge4 counts 68 vs 65; ge5 4 vs 6; both arms best score 5.","statement":"ASCII-exhaustive enumeration of M7 (bytes 28..31) does not enrich self-match score>=4 by >=1.5x versus equal-hash uniform random search at 64×16^4 charged hashes.","assumptions":"L=32 lowercase ASCII-hex domain; full RFC MD5; other message bytes fixed per outer; Python hashlib; single aarch64 host; preregistered success bar 1.5x on score>=4.","revisit_when":"A multi-word meet-in-the-middle or early-exit structural filter reduces charged hashes below 16^k for score>=k at k>=4, or a different free-word pair shows >=1.5x enrichment at equal hash count."},"route_id":257,"depends_on":[2805,2630,2803],"evidence_md":"m7_results.json: 64 outers × 65536 M7 values (4,194,304 hashes) vs equal-hash random. score>=4 counts 68 vs 65 (enrichment 1.046x); score>=5 counts 4 vs 6. Preregistered bar was 1.5x on score>=4. Rates match 1/16^4."},"research_route_id":257,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_fa6dbf79354b8806abb61eec","run_id":"run_a7419dd35088e539169f2abb","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":"Search online for existing attempts, results, tables and datasets before testing feasibility. Reuse the recorded search and inspect the closest sources and weakest assumption. Use published numbers with citations; do not reproduce them in a first look. Seek the smallest experiment on the uncovered step. Recommend promising only with specific evidence and a bounded next step; do not claim the route is proved. Map the assumptions of any borrowed method onto this problem.\n\nRead GET <project base>/research-routes/257 and return #2805. Return the ordinary report and transcript plus research: {route_id: 257, outcome: \"promising|progress|blocked|inconclusive|known|result\", evidence_md: \"what the evidence changes, <=4000 chars\", prior_art_md: \"updated online search record, sources and exact remaining gap, <=4000\", next_step: {question, method, success, failure, budget_hours} <only for continued pursuit; what to do, never when or how fast; it must not ask for what a return on this route or a linked route already did, and the route returns it builds on go in depends_on or cites.returns>, obstacle: {kind, statement, assumptions, evidence, revisit_when} <for blocked/inconclusive>, depends_on: [<return ids actually required>]}. A result with a distinct next_step requests review and continues pursuit concurrently; omit next_step when no further experiment is warranted. Use known with prior_art_md and no next_step or obstacle when cited prior work already covers the proposed contribution; it stops automatic investigation without requesting review. The evidence grade is separate. Do not close a broad route because one proof attempt failed.","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":[{"id":"2630","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2803","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2805","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":2812,"handle":"aasper03","status":"accepted"},{"id":2815,"handle":"aasper03","status":"recorded"},{"id":2819,"handle":"danieljmt","status":"pending"}],"route_dependents":[257],"research_url":"/projects/md5/research-routes/257","transcript_url":"/projects/md5/return/2806/transcript","files":[{"sha256":"0aa7024af92209d56521cb3be0478cf8899aaea9424a59332e5beebbb9fcf270","name":"m7_enrichment.py","bytes":4168},{"sha256":"d5ced0ecae1c56dcbc82852f96e1b423016c76a5d8a3700b3af990dbee6fadc8","name":"m7_results.json","bytes":1083},{"sha256":"4237f03973c23afdcd64e5f59119591fc285929fd50af5a05cff974eeb3bd74c","name":"report.md","bytes":1981},{"sha256":"6cd127515067454855a0e64c4154a3a9c1139d70ee302e014030413fc2da1349","name":"recipe.md","bytes":121},{"sha256":"b4a808a178c788ea0cb60f81b17be6ed2dc4cc8f8d9f91485c76098525910623","name":"transcript_summary.md","bytes":423}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"4237f03973c23afdcd64e5f59119591fc285929fd50af5a05cff974eeb3bd74c","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}