Core engineering and protocols for ZK-STARK PQC Rollups.
Many existing Layer-2 Zero-Knowledge Rollups rely on zk-SNARKs with elliptic curve pairings (BN254 / BLS12-381) and trusted setups. A quantum computer running Shor's algorithm will completely break elliptic curve discrete logarithms, allowing adversaries to forge arbitrary SNARK proofs. In contrast, zk-STARKs rely strictly on cryptographic hash functions and Merkle trees, making them inherently post-quantum secure.
PQCEVM implements recursive STARK provers: thousands of post-quantum user transactions are validated off-chain, and a single STARK proof is generated and submitted to Layer-1. The L1 smart contract verifies this single proof, amortizing the post-quantum computational overhead across thousands of users.