PQC necessity from Shor (ISO/NIST alignment audit)
Theorem.PQC necessity from Shor (ISO/NIST alignment audit) — factoring ∈ BQP (Shor: poly(log N)) ⇒ RSA/ECC exposed; the PQC triad = ML-KEM · ML-DSA · SLH-DSA (FIPS 203/204/205).
Proof.MODELED composition: Shor on demo RSA shows PKC exposure; NIST FIPS 203/204/205 (2024) and ISO/IEC 18033-2 Amd 2:2026 (2026-06) name PQC replace; hash/merkle Shor-safe; quantumStandardsAuditSuite recomputes reverse+inverse with reverse≠inverse; NOT ISO certified; NOT FIPS validated.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/water/encryption/index.ts#pqcNecessityFromShorCompose
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"PQC necessity from Shor (ISO/NIST alignment audit)" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation pqcNecessityFromShorCompose.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (pqcNecessityFromShorCompose @ src/water/encryption) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes pqcNecessityFromShorCompose (src/water/encryption/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.