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.

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

Last updated