Overview
Direct Answer
A cryptographic data structure that organises data into a binary tree where each leaf node contains a hash of a data block, and each parent node contains the hash of its children. This architecture enables efficient verification of data integrity and consistency without requiring inspection of the entire dataset.
How It Works
Data blocks are hashed individually to form leaf nodes, then adjacent leaf hashes are combined and hashed together to create parent nodes, continuing recursively until a single root hash emerges. Any modification to a single data block changes its leaf hash, which propagates upward through the tree, altering the root hash. Verification requires only the root hash and a logarithmic number of hashes along the path to the target leaf, rather than recomputing all hashes.
Why It Matters
This structure reduces verification time and bandwidth consumption significantly in distributed systems, enabling lightweight clients to confirm data integrity without downloading entire datasets. In blockchain networks, the efficiency gains are critical for scalability, mobile wallet functionality, and rapid transaction validation across geographically dispersed nodes.
Common Applications
Bitcoin and Ethereum employ this structure to verify transaction blocks efficiently. Distributed file systems use it for content verification. Certificate transparency logs implement it to detect unauthorised certificate issuance. Cloud storage providers leverage it for deduplication and integrity checking.
Key Considerations
The structure assumes hash function collision resistance and does not provide confidentiality of the underlying data. Proof-of-membership verification requires storing intermediate hashes, creating a storage-versus-speed tradeoff that practitioners must optimise based on system constraints.
More in Blockchain & DLT
ERC-721
Tokens & AssetsA technical standard for non-fungible tokens on the Ethereum blockchain, ensuring each token is unique.
Hard Fork
FoundationsA radical change to a blockchain's protocol that makes previously invalid blocks or transactions valid, requiring all nodes to upgrade.
Solidity
Smart Contracts & DAppsA programming language designed for writing smart contracts on the Ethereum Virtual Machine.
Mining
FoundationsThe process of using computational power to validate transactions and add new blocks to a proof-of-work blockchain.
Gas Fee
FoundationsThe transaction fee paid to blockchain network validators for processing and confirming transactions.
Light Node
FoundationsA blockchain node that only downloads block headers and relies on full nodes for complete transaction verification.
zk-SNARK
Identity & PrivacyZero-Knowledge Succinct Non-Interactive Argument of Knowledge — a compact zero-knowledge proof requiring no interaction between prover and verifier.
Full Node
FoundationsA blockchain node that downloads and validates every block and transaction against the complete set of consensus rules.