FPRD LabShare an approach

← Claims

Computational finding · compiler and reduction audit

FPRD-SH-C10

XCC and one-shot matching-overhead audit

Exact statement

Exact enumeration checks 16,384 signature subsets for XCC compatibility and 1,355 graphs for the one-shot product correspondence, weighted matching formula, and isolated-edge recovery identity. All 21,152 matching receipts and useful product states agree with the theorems.

StatusSource replay and independent implementation pass
External reviewNo documented external or specialist review of these FPRD results is recorded.

Context

The audit separately tests the color rule, product-state bijection, signature multiplicity, overhead formula, and counting recovery identity.

Proof or evidence

XCC consistency equals pairwise policy compatibility, reachable one-shot states equal matchings, and the isolated-edge formula recovers every exact matching count.

Dancing Links and matching audit →

Verification notes

16,384 signature subsets, 1,099 exhaustive small graphs, 256 deterministic larger graphs, and 21,152 matching states; zero failures.

Limitations

  • The computation is finite; arbitrary-size results come from the proofs.

Open work

Retain as implementation evidence; use the symbolic proofs for arbitrary policies and graphs.