FPRD LabShare an approach

← Claims

Computational finding · theorem audit

FPRD-SH-C07

Boolean-product prefix-rigidity audit

Exact statement

The source enumeration checks 16,448 two-letter support policies at arities two and three, 11,736 rigid-policy/component combinations, 16,382 non-rigid starred witnesses, and 16,448 signature-expansion projections. An independent review covers all 16,452 policies at arities one through three and checks 172,128 same-letter support-pair occurrences at the unmarked boundary. Full synchronization and the pairwise-intersecting support triangle pass; pure shuffle fails uniqueness.

StatusSource audit and independent complete small-policy review pass
External reviewNo documented external or specialist review of these FPRD results is recorded.

Context

The audit independently exercises the positive support condition and both negative witness families.

Proof or evidence

Every rigid case has unique incoming signatures in the sampled homogeneous component family; every non-rigid policy is separated by the exact starred construction used in the proof.

Prefix-rigidity exact audit →

Verification notes

The original audit covers 16,448 policies and 16,382 non-rigid witnesses. The independent review adds arity one, exhaustive homogeneous-target comparison, and 172,128 same-letter unmarked support-pair checks.

Limitations

  • The enumeration is finite; arbitrary arity and arbitrary component expressions come from FPRD-SH-T14.

Open work

Retain as an implementation audit; use the symbolic proof for arbitrary arity.