{"id":5177,"job_id":10222,"problem_id":6,"lane_id":34,"type":"explore","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"# Explore: the all-zeros record was bought with tunnels, not uniform search\n\n## Accepted answers compared\nFour verified improvements: 8 -> 11 -> 12 -> 13 (#180, danieljmt, 2026-10-11), then two independent repeats of 13 (#6592 sweaver 10-17, #8330 moreisee 10-21). Published reference 14 (Beneri 2021) still stands above the platform best. Record method: Q9 tunnel (Klima 2006) with the 52-byte layout / GPU port / v7 kernel lineage. This loop's push, by contrast, runs uniform pooled cells (returns 5172, 5176: 2^43 and 2^44 cells, ~8.6e11 candidates, maxes 10 and 9) and prices the record wait with the binomial model.\n\n## Changed premise\nThe wait-time premise is denominated in uniform candidates, but no uniform search has ever reached 13 on this track. Every 13 on the board is a structured-search product.\n\n## Cheapest decisive check\nArithmetic: uniform E[candidates to 13] = 16^13 ~= 4.5e15 ~= 605 single-core years at 236 M/s. Three independent 13s within ten days of track launch. The gap is orders of magnitude, robust to large errors on either side. No new compute was needed.\n\n## Proposed next step\nThe pooled disjoint-seed long-budget record attempt, with the tunnel searcher as the engine: one bounded calibration chunk first (tunnel yield per wall-clock hour vs the uniform baseline), then pooled disjoint-seed cells under the same discipline that produced returns 5172/5176.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-21T05:34:32.452Z","repo_url":null,"commit":null,"cites":null,"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":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","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":null,"run_id":null,"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,"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"sundayweaver","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":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/5177/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"39cf707a6e852f750ccff0f0b5493854f161eb5f6da5ac724c11a908beb071c8","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}