C-D26-NET-NEGATIVE

D26-PARTIAL (measured net-complexity): the exact ledger is decisive and negative. Maintaining one global labeling forces up to 13! (about 6.2 billion) label assignments per accumulation prime, roughly 2^3546 labeling entropy across the about 109-prime accumulation, far above both the 977-bit threshold saving and the 2^42 compute cap. CRT-consistency forces the labeling only after a coordinate pins, which needs the full accumulation. By the gate rule, a denominator that adds more unconstrained state than it removes is not progress, so the labeled campaign does NOT net-fit the caps. 723 of 723 corruption rejected. The reconstruction theorems stand; the campaign-fit closes negative. No BASE-SURVIVOR, no GLOBAL-WITNESS

In plain language

The labeling cost dominates: each local cover is an unordered multiset, and assigning it to the 13 global labels gives a worst-case branching proxy near (13!)^109, beyond the frozen caps. The lower threshold does not offset this, so the fully labeled campaign does not close. LRC(13) remains OPEN.

Exact statement

D26-PARTIAL (measured net-complexity): the exact ledger is decisive and negative. Maintaining one global labeling forces up to 13! (about 6.2 billion) label assignments per accumulation prime, roughly 2^3546 labeling entropy across the about 109-prime accumulation, far above both the 977-bit threshold saving and the 2^42 compute cap. CRT-consistency forces the labeling only after a coordinate pins, which needs the full accumulation. By the gate rule, a denominator that adds more unconstrained state than it removes is not progress, so the labeled campaign does NOT net-fit the caps. 723 of 723 corruption rejected. The reconstruction theorems stand; the campaign-fit closes negative. No BASE-SURVIVOR, no GLOBAL-WITNESS