ZK & Compressionconcurrent-merkle-tree
Concurrent Merkle Tree
Also known asCMT
A Concurrent Merkle Tree (CMT) is a specialized on-chain Solana data structure that allows multiple state updates to the same Merkle tree within a single block without conflicting, by recording a changelog buffer of recent root transitions that validators use to reconcile parallel proof submissions. A CMT is parameterized by its maximum depth (max_depth, determining tree capacity of 2^max_depth leaves), max_buffer_size (number of concurrent changes the changelog can track, directly controlling how many operations per slot the tree can safely absorb), and an optional canopy_depth. The SPL Account Compression program manages CMTs, and they are the foundational storage primitive for both Metaplex compressed NFTs and Light Protocol compressed accounts.
Related terms
2ZK & Compression
State Compression
State Compression is Solana's technique for storing the cryptographic fingerprint (root hash) of a Merkle tree on-chain...
ZK & Compression
Merkle Proof
A Merkle proof is the minimal set of sibling node hashes (the proof path) along the branch from a specific leaf to the t...