Trace-cover boundary exact audit

Exact statement

Direct trace-step enumeration and the cover dynamic program agree on all 64 four-letter independence graphs, all 65,536 complete two-state DFA instances and final sets, 2,500 larger deterministic controls, and 4,000 DNF reduction-pattern controls. Two complete runs are byte-identical.

StatusAll exact checks pass; deterministic rerun is byte-identical

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

Context

The audit separately tests the positive one-step recurrence and the fixed-one-edge negative control.

Proof or evidence

Every direct count, size distribution, and parameter extraction agrees.

Trace-cover exact audit →

Verification notes

The public dependency-free verifier reproduces 64 graph, 65,536 exhaustive DFA, 2,500 larger deterministic, and 4,000 DNF-pattern controls; its canonical output is linked from the result page.

Limitations

Finite computation supports but does not replace either proof.

Open work

Retain as supporting evidence; the arbitrary-size conclusions come from the proof and the published reduction.