One-shot overhead has a canonical conflict-mask quotient

Exact statement

Group each hub support $A$ by $\mu(A)=\{j:A\cap B_j\ne\varnothing\}\subseteq[\gamma]$ . This is the coarsest quotient preserving compatibility with every exceptional matching. A subset-zeta transform computes exact one-shot overhead in $O(|\mathcal F|r\gamma+\gamma2^\gamma)$ time and $O(2^\gamma)$ auxiliary space.

StatusSelf-contained proof; complete small-domain and sharpness audits pass

External reviewNo documented external or specialist review of these FPRD results is recorded.

Context

In the one-shot model, an exceptional matching can distinguish two hub supports only by which exceptional supports they intersect.

Proof or evidence

The matching polynomial splits into exceptional matchings and compatible one-hub extensions.

Conflict-mask quotient and zeta algorithm →

Verification notes

33,856 complete support families and 738,063 matching states agree exactly.

Limitations

Arbitrary targets require FPRD-SH-T31's oracle.
Subset zeta is classical machinery.

Open work

Seek an independently motivated application; do not optimize the same kernel in isolation.