Validity Proofs

Validity proofs are succinct zero-knowledge proofs (ZKPs) that can prove the existence of compressed accounts as leaves within state trees while maintaining a constant 128-byte size. These proofs are generated off-chain and verified on-chain. ZK Compression uses Groth16, a well-known pairing-based zk-SNARK, for its proof system.

A Merkle proof path (purple nodes) consists of all sibling node hashes required to calculate the final root node.

The protocol leverages ZKP generation and verification under the hood, so you don't have to learn about ZK directly to use ZK Compression.