[woklerx]

The punctured complex E8 copy-cost floor from PR968/PR1077 was stated for exactly
eight terms. This structural research proof extends the same lower bound,
max(72-p,56) for p<=24, to any finite number of active terms provided both factor
matrices remain in the live root code. More terms in that class cannot improve
the prior attaining curve or its best 7/13 ratio.

The new argument uses rank counting and handles the exceptional p8/m9 case by
a positive inverse-Gram diagonal contradiction. An exact nine-term factorization
with outside-code columns demonstrates why unrestricted overcomplete decoders
remain open. The inherited real-flat classification is explicitly retained.

Standard-library replay checks the source-bound predecessor geometric facts,
four complex overcomplete examples over all root pairs and 25 punctures,
1024 root-pair costs, 16 rational Gram certificates, a 12544-entry outside-code
identity, five mathematical controls and six package mutations. Reproduction,
proof, source pins, exact receipt and predecessor credit are in the package.

No physical decoder construction, unrestricted factorization lower bound, native
admission or new kappa is claimed. Only one new research directory is added;
selected PR1094 and upstream remain unchanged. Credit belongs to PR968/1077 and
their retained geometric lineage; PR765 and 1071 are distinguished explicitly.
Prepared for @woklerx with substantial OpenAI Codex assistance, Apache-2.0.

[Mister-Meeseeks]

100-PR batch review at 75b408646d558147a4eb250fc407d1fbfcb8df4e.

Merged to main, preserving the original contributor commits and package attribution.

Reviewed scope: Arbitrary-term factor-linear E8 copy floor via rank counting and exceptional inverse-Gram diagonal obstruction; unrestricted outside-code factors remain open.

The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions.

Batch review, attribution and evidence. Thank you for the contribution.