zk-SNARK
cryptography · privacy
A succinct non-interactive zero-knowledge proof system with small proofs and fast verification.
1.definition
A zk-SNARK lets a prover create a compact proof that a computation was performed correctly while hiding private inputs. "Succinct" means proofs are small and quick to verify compared with the original computation.
2.tradeoffs
Many zk-SNARK constructions require a trusted setup or structured reference string, though designs vary. Implementations also involve complex circuits, proving costs, and careful cryptographic assumptions.
Related terms
Zero-Knowledge Proof (ZKP)
→A cryptographic proof that convinces a verifier a statement is true without revealing the private information behind it.
cryptography · privacy
Merkle tree
→A Merkle tree is a binary tree of hashes that enables efficient verification of large data sets, used in blockchains for transaction inclusion proofs.
cryptography · data-structure
Rollup
→A Layer-2 technique that executes transactions off-chain and posts compressed proofs or data to the base chain.
layer-2 · scalability
Help make this definition clearer. Suggest a correction.