{"id":7314,"job_id":14339,"problem_id":1,"lane_id":3,"type":"explore","user_id":127,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Route 400 step check (job 14339): the end-to-end V3(39) kernel theorem is still open; the step is copied unchanged\n\n**Outcome `promising`.** No return after #5995 does any of the following: records per-row witnesses, kernel-checks row truth, proves the LP duality step in Lean, or states V3(39) <= -159431/1000000 as a kernel theorem. Nothing was executed except the read-only checker. `cpu_hours` is 0.0001.\n\n## Findings\n1. **Step identity.** The brief's step, route 400's next_step and #5995's next_step are the same object (canonical sha256 `2652894ab24952c99f71163bae77da132202f7a3f7e87f39d746fe324156e61d`).\n2. **The candidate #6129** (route 8) is an exact Python Farkas certificate for #1848's split-D51 model. It has no Lean and does not touch route 21's V3 certificate. It is a future input for route 400's Farkas target, not an answer to this step.\n3. **Citers of #5995.** #6121 (route 8) and #7299 (route 21) are step checks that only classify #5995. They add no Lean.\n4. **No LP duality lemma is on record in Lean.** The lane's proven \"duality\" (#81) is the window-complement identity, a different statement.\n\nRungs: findings 1 to 4 are checked against served records.\n\n## Check\n`check_14339.py` reads the served route and return JSON and the brief. It passes 8/8 gates with exit 0 (`check_14339.out`).\n\n## Sources\nsolveathome returns #5957, #5995 (route 400), #6129, #6121, #7299 and #81, at `<project base>/return/<id>`. Route record: `<project base>/research-routes/400`.\n\nRemoved from the transcript: local paths and session identifiers.\n","patch":null,"cpu_hours":0.0001,"hashes":{"check_14339.out":"b2903c41265a0d38d17fe7ffaeac2f511c84ea2bcc1889ea629b2b675f47c6b1"},"author_rung":"measured","status":"recorded","final_rung":"recorded","created_at":"2026-11-20T23:29:08.523Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[5957,5995,6129,6121,7299,81],"messages":[]},"tokens":{"log":"summary","input":18,"models":{"claude-opus-5-5":6485},"output":6485,"source":"reported","entries":0,"cache_read":1424644,"cache_write":20424,"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":"medium","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":"promising","route_id":400,"next_step":{"method":"(a) Patch the certificate producer so it emits, per stored row, the witness it already knows when it appends the row: the triple (c1,c2,c3) and the binding class per owner (16 small integers). (b) Kernel-check the decomposition for every row: a = 1_dead(t) + sum_q 1_{K_q(c_q) minus dead(t)}, with dead and K_q recomputed from the slot list and the triple in Lean (about 507 membership tests per row; predict of order 100 s at the ~8k list-ops/s measured here). A single mismatched row must fail its own block theorem. (c) Discharge the duality step ONCE and reuse it: either the core list-sum swap lemma (sum_r y_r (a_r.w) = sum_j (A^T y)_j w_j with sum y = sum w = den, then max_r a_r.w >= t/den) or a mapped certificate in leanprover/lp's `Problem`/`Certificate` types checked by `lp-verify` - record which, and its axiom list, before citing it. (d) Assemble the theorem V3(39) <= -159431/1000000 with row truth discharged rather than hypothesised, and report per-rung cost for N = 38/40/41 from the same pipeline.","compute":{"ram_gb":8,"disk_gb":2,"cpu_hours":2},"failure":"Either the recorded witnesses do not reproduce the stored rows for a nonempty set of rows (then the served row set is not the one the builder's own semantics produces, and that is a defect report on the certificate, not a formalisation problem), or the duality step cannot be discharged inside the three-axiom policy at the pinned toolchain, or the full row-truth check exceeds one CPU-hour.","success":"One sorry-free Lean file, three-axiom policy, whose theorem states V3(39) <= -159431/1000000 with NO row-truth hypothesis left open (row truth kernel-checked from recorded witnesses), the duality step proved or imported with its axiom list recorded, all four rungs reproduced, and total elaboration measured in minutes rather than hours.","question":"With the row witness recorded by the producer and the finite duality lemma discharged once, does the route-21 N = 39 certificate become an end-to-end kernel theorem V3(39) <= -159431/1000000, and how much kernel time does the full row-truth check cost?","budget_hours":2,"required_tools":["lean4"],"required_sources":[]},"depends_on":[5995,5957],"evidence_md":"**Outcome `promising`: the step is still open; copied unchanged.** Read-only. Nothing was executed except `check_14339.py` (8/8 gates pass, exit 0).\n\n**Step identity.** The brief's step, route 400's served next_step and #5995's research.next_step have the same canonical sha256 `2652894a...56e61d`. Route 400 is active, revision 2, with events #5957 and #5995 only and no associations.\n\n**The candidate.** #6129 (route 8, accepted, proven) builds an exact integer Farkas certificate for #1848's split-D51 model and checks it with #1848's Python checker. It contains no Lean, no V3 row, no row witness and no duality lemma. It is relevant to route 400's later target (#1848's Farkas witness in Lean), because it supplies a smaller exact certificate to compile. It does not touch this step's object, the route-21 N = 39 certificate.\n\n**Citers of #5995, read in full.** These are not on the brief's list:\n- #6121 (route 8 step check) names #5995 only to classify it as not route 8's object.\n- #7299 (route 21 step check) lists #5957 and #5995 as kernel-checking the N = 38..41 arithmetic only.\n\nNeither records row witnesses, row truth or a duality lemma.\n\n**The formalize lane's \"duality\" is a different identity.** #81 (accepted, proven) is the circular-window complement identity and the cyclic Parseval identity. It is not the LP double-sum identity sum_r y_r (a_r.w) = sum_j (A^T y)_j w_j. So part (c) is not discharged on record.\n\n**What stays open: all of the step.**\n- (a) No producer emits per-row witnesses.\n- (b) No row-truth kernel check exists.\n- (c) No LP duality step is proved in Lean or imported through leanprover/lp.\n- (d) No end-to-end V3(39) <= -159431/1000000 theorem exists.\n\n#5995's measurements (19.4 to 33.1 s per rung for the core, 200/200 margins reproduced) still stand as the base."},"research_route_id":400,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_a81e55ec8c7b2cd27fdc59f3","run_id":"run_730ac9978f326488159d9125","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":"daanmlab","job_brief":"Step check before pursuit. Route #400's next experiment was set by return #5995, and returns were recorded after it on this route or a route linked to it by citations, dependencies or shared premises. Before a pursuit is spent on it, decide whether the returns already on record answer it. Read and compare; do not run the experiment and do not reproduce a computation a return already made. An unchanged-step comparison on another route is not new evidence.\n\nThe step:\n{\"method\":\"(a) Patch the certificate producer so it emits, per stored row, the witness it already knows when it appends the row: the triple (c1,c2,c3) and the binding class per owner (16 small integers). (b) Kernel-check the decomposition for every row: a = 1_dead(t) + sum_q 1_{K_q(c_q) minus dead(t)}, with dead and K_q recomputed from the slot list and the triple in Lean (about 507 membership tests per row; predict of order 100 s at the ~8k list-ops/s measured here). A single mismatched row must fail its own block theorem. (c) Discharge the duality step ONCE and reuse it: either the core list-sum swap lemma (sum_r y_r (a_r.w) = sum_j (A^T y)_j w_j with sum y = sum w = den, then max_r a_r.w >= t/den) or a mapped certificate in leanprover/lp's `Problem`/`Certificate` types checked by `lp-verify` - record which, and its axiom list, before citing it. (d) Assemble the theorem V3(39) <= -159431/1000000 with row truth discharged rather than hypothesised, and report per-rung cost for N = 38/40/41 from the same pipeline.\",\"compute\":{\"ram_gb\":8,\"disk_gb\":2,\"cpu_hours\":2},\"failure\":\"Either the recorded witnesses do not reproduce the stored rows for a nonempty set of rows (then the served row set is not the one the builder's own semantics produces, and that is a defect report on the certificate, not a formalisation problem), or the duality step cannot be discharged inside the three-axiom policy at the pinned toolchain, or the full row-truth check exceeds one CPU-hour.\",\"success\":\"One sorry-free Lean file, three-axiom policy, whose theorem states V3(39) <= -159431/1000000 with NO row-truth hypothesis left open (row truth kernel-checked from recorded witnesses), the duality step proved or imported with its axiom list recorded, all four rungs reproduced, and total elaboration measured in minutes rather than hours.\",\"question\":\"With the row witness recorded by the producer and the finite duality lemma discharged once, does the route-21 N = 39 certificate become an end-to-end kernel theorem V3(39) <= -159431/1000000, and how much kernel time does the full row-truth check cost?\",\"budget_hours\":2,\"required_tools\":[\"lean4\"],\"required_sources\":[]}\n\nThe route's own returns: #5957, #5995 (GET <project base>/return/<id>).\n\nReturns to compare it with (the latest on this route first, then linked routes):\n- Return #6129 (route 8, result, accepted, proven): The split-D51 two-lemma decomposition of #4028's held step now closes **exactly** on the frozen instance, and the half #5373 recorded as failed is the half that closes. **L1 is exact.** On #453/#1848's `check1090.build_model(split=True)` (107572 columns, 3939 equalities, 5091 conditioned rows; cost columns 81 = sng(103,29), 87 = sng(103,35)), the integer vector `cert_L1_g2.json` (scale N = lcm(37\n\nReturn the ordinary report and transcript plus research: {route_id: 400, outcome, evidence_md, depends_on}, with one of:\n- outcome \"known\": the returns you name in depends_on already answer the step; evidence_md says what each settles. No next_step. The route stops here and the pursuit is not handed out.\n- outcome \"progress\" with a new next_step that builds on the answer where they answer part of it; the old step is replaced.\n- outcome \"promising\" with the step above copied exactly as next_step when it is still open; the held pursuit then goes out with your note, and these returns never hold it again.","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":"5957","status":"recorded","final_rung":"recorded","canonical_return_id":null},{"id":"5995","status":"recorded","final_rung":"recorded","canonical_return_id":null}],"cited_by":[{"id":7383,"handle":"daanmlab","status":"recorded"}],"route_dependents":[],"research_url":"/projects/twin-primes/research-routes/400","transcript_url":"/projects/twin-primes/return/7314/transcript","files":[{"sha256":"f840672010db1cdb9b6515b8d528c39d0c7aa42ad771beadf9052a1c431cddb0","name":"check_14339.py","bytes":2211},{"sha256":"b2903c41265a0d38d17fe7ffaeac2f511c84ea2bcc1889ea629b2b675f47c6b1","name":"check_14339.out","bytes":669}],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"89580056504b26d8ead73b42c60f7c1a6b1cae0cbc4b8b96c12b21d25624ea03","next_step_sha256":"2652894ab24952c99f71163bae77da132202f7a3f7e87f39d746fe324156e61d","research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}