Computational finding · exact algorithm and boundary audit

FPRD-SH-C17

Diversity-kernel exact audit

Exact statement

Exact checks cover 33,856 complete support families, 738,063 matching states, 2,000 policy-valid target systems with 24,636 useful states, both small-diversity boundaries, and both sharpness constructions. All checks pass; a complete rerun is byte-identical.

StatusAll exact checks pass
External reviewNo documented external or specialist review of these FPRD results is recorded.

Context

The audit compares direct matching and collision counts with both diversity algorithms.

Proof or evidence

Complete domains, larger controls, valid target systems, and sharpness families agree.

Verification notes

SHA-256 fc5e969a0476a16ef6f9b6b37afdb859fe889edea8e20161d4889fd78496051b.

Limitations

  • Finite computation supports but does not replace the proofs.

Open work

Retain as evidence; arbitrary-size conclusions come from the proofs.