Expression twist and reversible lowering pass exact audit

Exact statement

The exact audit verifies the one-layer 11/16-state construction, the six-state reachable synchronized square, its five nonrectangular pentagon signatures, the six-state reversible lowering, both compiler criteria over all 530 two-block relations through three symbols, the corrected standard-alphabet six-state C7 residual quotient, 4,130 graph-language checks, and 265 complementing-permutation certificates through five vertices. All checks pass.

StatusAll exact checks pass

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

Context

The audit separates support-tensor adjacency from expression reachability, then checks the reversible sequential lowering independently.

Proof or evidence

Direct product reachability, flat Boolean-product reachability, last-signature projection, graph independence, residual minimization, and per-symbol transition injectivity agree.

Expression-twist exact audit →

Verification notes

1,099 labelled graphs, 265 complementing permutations, 5,088 complementing pair checks, 530 relations under both compiler presentations, and 4,130 graph-language checks pass. The independent review replaces an out-of-alphabet C7 control by the valid final pair (6,0), then verifies the ten-word code's strong-square independence, six states, fourteen transitions, and reversibility.

Limitations

The finite audit does not establish novelty or replace the all-length proofs.

Open work

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