[MCA] Pay rank-one pair anticodes by fixed-endpoint routing - #1172
[MCA] Pay rank-one pair anticodes by fixed-endpoint routing#1172scottdhughes wants to merge 39 commits into
Conversation
|
The rank-two large-common-factor residual posed here has an exact banked tool on the public prize DAG for its first horn. The shared squarefree locator of degree >= 134,066 between the two forced endpoint-difference polynomials is precisely the input of the common-core cancellation adapter from #1163 (banked with an independent replay as For the second horn (varying factors), note the degree floor is additive under gcd-independence: two edges with coprime locator factors of degree >= 134,066 jointly annihilate >= 268,132 > n - m + t of the evaluation set only if their supports interleave — which may bound the sunflower width directly at the deployed row. This import and the K'-ladder stack (#1170, prefix through K'=86) now share their residual surface: your rich-flat terminal (W vanishing on >= 42,453 columns) is a carrier-atlas object in the #1170 frame, and both stacks' chronology obligations are priced by the #1169 acceptance contract. Full audit + connection analysis at 🤖 Generated with Claude Code |
Summary
Stacked successor to #1171 at exact parent
a3fc2d5aea86577cd50d8b95b6eb2155d4d940f6.This completes the rank-one minimizing-pair anticode branch left partially routed by #1171. Split the post-near affine-error-rank-eleven family at support-margin cutoff
tau=439.For the fixed-left-factor geometry, an invertible endpoint row operation makes one endpoint codeword common to every minimizing pair type. On its complete agreement set
G, the varying endpoints form one ordinary affine Reed--Solomon list. Same-support pair noncontainment forces every nonexceptional owning slope to use a coordinate outsideG; for a fixed pair type and outside coordinate, the projective slope equation has at most one solution.The exact theorem-level envelope is
Cutoff
438is still over budget by96,628,092,421,444, so439is the first paying cutoff. The same envelope has unique minimum81,826,485,385,525,648attau=3608.Together with #1171's fixed-right ray cap
8,147,918, this pays the complete low-margin pairwise-rank-one anticode branch.New residual
Every over-budget rank-eleven line now forces two low-margin actual minimizing pair types
e,fsatisfyingThus the two independent degree-
<Kendpoint-difference polynomials share a squarefree deployed-evaluation locator of degree at least134,066.The next missing theorem is a chronology-safe compiler for these rank-two large-common-factor edges: either many edges share one locator factor and enter one shortened correction plane, or varying factors force a bounded-factor sunflower/cycle collision charged once.
Scope
0No per-edge cancellation, sum over unrelated factor owners, or common-factor synchronization is assumed.
Verification
675b02624c17373e435000dcbdc87746e7b4c9b2b0f0e1ccc5081c479b621fa667,471legal cutoffs scannedgscans attau=439andtau=3608GL_2(F_5)andGL_2(F_7)projective-owner controls: PASS6/6rejectedDependency
This PR must integrate after #1171, which itself is stacked after #1168.