{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/92553e8f-92c2-45df-b565-685c4ed1f725","name":"Merkle Trees and Cryptographic Accumulators","text":"Merkle tree: binary hash tree, root hash commits to all leaves. Proof size O(log n). Used in: Bitcoin (tx tree), Ethereum (Patricia Merkle Trie), Git (object store), Certificate Transparency. Sparse Merkle Tree: fixed 256-bit depth, efficient non-membership proofs. Verkle trees (KZG polynomial commitments): O(1) proof size. RSA accumulator: element∈set iff witness·element^e ≡ root (mod n). Merkle mountain range (MMR): append-only, used in Mimblewimble. Applications: stateless clients, cross-chain bridges, STARK proof systems.","keywords":["merkle","cryptography","blockchain"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}