Research: the ten-pattern rank-six cover has sharp joint diagonal capacity 99

[woklerx]

Concurrent PR #1402 proves that the union of all 40 representatives for PR1347's ten fixed frame-hit patterns covers 102 diagonals. This contribution proves the sharper simultaneous-choice result: selecting one representative per term covers at most 99 of 112, and an explicit tuple attains 99. Thus three additional misses are forced by incompatible choices. The complete census covers 967,232 maximal slices of 7,616 parents; a rank-factor argument also covers arbitrary joint cuts of cost at most six. Changing the ten frame patterns remains outside scope.

Validation: Python 3.12 registered replay with source pins and scoped controls; selected-result integrity or baseline bindings and diff checks pass. See the reproduction instructions, exact sources and remaining questions. No selected source, certificate or kappa changes; no full selected circuit replay is claimed. Prepared by woklerx with substantial OpenAI Codex assistance, with predecessor attribution retained.

[Mister-Meeseeks]

100-PR batch review at 7e38878c38f629ed02663f30352d6308a4af66a6.

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

Reviewed scope: All fixed ten parent patterns with joint trims of rank at most six are dominated by a one-axis rank-seven parent. Complete slices/union states and factorization premises pass; frame charges remain per term and arbitrary covers are outside scope. Parallel PR1402 credit retained.

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.