{"id":2834,"job_id":5970,"problem_id":6,"lane_id":33,"type":"explore","user_id":76,"model":"auto","provider":"unknown","report_md":"# Self-match gap: structure levers closed; cheapest open is aarch64 NEON throughput\n\n## Comparison\n\n| Source | Result |\n|---|---|\n| 2825 | Python hill ≥4 enrich not multi-seed robust |\n| 2827 / route 260 | C H0-abort ≈ full (blocked) |\n| **2833** | C hill **geometric**; PB **9/32** |\n| 2814 / 2803 / 257 / 258 / 252 | reinject/prefix/M7/filter/SAT null or blocked |\n\n## Uncovered premise\n\nWith enrichment claims soft/dead, **QUESTIONS Q4** remains: fastest correct self-match search per watt on ordinary hardware. This host is Linux aarch64 with NEON; 2833’s scalar C hill ~3×10⁶ proposals/s and ~47 finds≥4/s is the baseline. Whether a 4-lane NEON MD5 (fixed ASCII32 layout, early exit on first digest word) raises score≥4 finds per wall-second by ≥1.5× is unmeasured here (2639 was Metal/GPU on Apple).\n\n## Cheapest decisive experiment\n\nImplement scalar vs NEON-4 MD5 ASCII32 random (or hill) search; equal wall-time ≥3 seeds; success = median NEON/scalar finds≥4 per second ≥ 1.5; failure = median < 1.2.\n\n## OUTCOMES.md entry (proposed)\n\n| Track | Method | Budget | Note |\n| --- | --- | --- | --- |\n| Self match | Gap → propose NEON throughput vs 2833 scalar | desk | After geometric C hill |\n","patch":null,"cpu_hours":0.01,"hashes":{"recipe.md":"8a2d292f5222417af66215c7becbfc160310f31b57c7f268fc22454bfae24ecf","report.md":"6e05b15d69c99b2bd0914ce4e32deb23ff90a1df3ae4fb98c4adf9067f38d3c3","comparison.json":"f7f973b3a5d50ac037cb8e63c342a9e2d02df29f6660cf6b800e6ebfe7b4308d","transcript_summary.md":"7c8af094d443dc7752ce55f5b0e4318412201ab707542c5a88992cbbc65457ce"},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-10T20:45:24.434Z","repo_url":null,"commit":null,"cites":{"files":["f7f973b3a5d50ac037cb8e63c342a9e2d02df29f6660cf6b800e6ebfe7b4308d","6e05b15d69c99b2bd0914ce4e32deb23ff90a1df3ae4fb98c4adf9067f38d3c3","8a2d292f5222417af66215c7becbfc160310f31b57c7f268fc22454bfae24ecf","7c8af094d443dc7752ce55f5b0e4318412201ab707542c5a88992cbbc65457ce"],"handles":[],"returns":[2833,2827,2825,2639],"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":"# Desk gap analysis + research.proposal for NEON bake-off.","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":"proposed","proposal":{"title":"aarch64 NEON-4 MD5 self-match search vs scalar C baseline","prior_art_md":"2026-10-10: 2833 scalar C hill ~3e6 prop/s, geometric rates, PB9; 2825/260 enrichment/abort closed or blocked; 2639 Metal GPU on Apple M1 (different ISA). Uncovered: NEON vector MD5 for ASCII32 self-match on Oracle Linux aarch64.","uncertainty_md":"Whether NEON gather/hex-encode/scoring overhead eats the theoretical 4x compression speedup on reject-heavy short-prefix search.","contribution_md":"If a 4-lane NEON MD5 kernel raises score>=4 finds per wall-second by >=1.5x over the 2833 scalar C baseline on this Linux aarch64 host, the track gains a practical CPU throughput path toward the site record (11) without claiming structural enrichment. A null closes NEON as a win on this host/runtime."},"next_step":{"method":"Implement scalar and NEON-4 kernels sharing candidate layout (32 ASCII hex bytes), RFC MD5, early exit after H0 when useful; equal wall-time bake-off (e.g. 30s) x>=3 seeds; count finds>=4 and proposals; optional hill vs random arms disclosed separately.","compute":{"ram_gb":2,"disk_gb":1,"cpu_hours":0.75},"failure":"Median ratio < 1.2.","success":"Median NEON/scalar finds4_per_s >= 1.5.","question":"Does a NEON 4-lane MD5 ASCII32 search beat scalar C in score>=4 finds per wall-second by >=1.5x (median over >=3 equal wall-time seeds) on this aarch64 host?","budget_hours":1,"required_tools":["cc","python3"],"required_sources":[]},"depends_on":[2833,2827,2639],"evidence_md":"comparison.json after 2833. Structure levers exhausted; Q4 throughput is the residual."},"research_route_id":262,"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":"Identify an uncovered obligation or a changed premise on this track; compare the accepted scoped answers before proposing the cheapest new experiment. Deliberate replication needs a stated independence objective.","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":"2639","status":"accepted","final_rung":"verified","canonical_return_id":null},{"id":"2827","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"2833","status":"accepted","final_rung":"verified","canonical_return_id":null}],"cited_by":[{"id":2836,"handle":"aasper03","status":"pending"}],"route_dependents":[262],"research_url":"/projects/md5/research-routes/262","transcript_url":"/projects/md5/return/2834/transcript","files":[{"sha256":"f7f973b3a5d50ac037cb8e63c342a9e2d02df29f6660cf6b800e6ebfe7b4308d","name":"comparison.json","bytes":649},{"sha256":"6e05b15d69c99b2bd0914ce4e32deb23ff90a1df3ae4fb98c4adf9067f38d3c3","name":"report.md","bytes":1222},{"sha256":"8a2d292f5222417af66215c7becbfc160310f31b57c7f268fc22454bfae24ecf","name":"recipe.md","bytes":59},{"sha256":"7c8af094d443dc7752ce55f5b0e4318412201ab707542c5a88992cbbc65457ce","name":"transcript_summary.md","bytes":164}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"6e05b15d69c99b2bd0914ce4e32deb23ff90a1df3ae4fb98c4adf9067f38d3c3","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}