A succinct non-interactive zero-knowledge proof system with small proofs and fast verification, but typically requiring a trusted setup.
zk-SNARKs produce tiny proofs that verify quickly on-chain. Many constructions require a one-time trusted setup ceremony; compromised setup can undermine soundness.
"A zk-SNARK verifies an entire batch of transactions with a single on-chain proof, reducing gas."
A method to prove a statement is true without revealing any information beyond the truth of the statement.
A Merkle tree is a binary tree of hashes that enables efficient verification of large data sets, used in blockchains for transaction inclusion proofs.
A Layer-2 technique that executes transactions off-chain and posts compressed proofs or data to the base chain.
All terms and definitions may update as the Cryptionary improves.