Merkle Tree
A tree of hashes that commits to a large dataset in one root hash, letting anyone verify a single item with a short proof.
- glossary
A Merkle tree (or hash tree) repeatedly pairs and hashes data items — transactions, account balances, or other records — until a single hash, the Merkle root, represents the entire set. Bitcoin stores this root in every block header, and Ethereum stores three separate roots covering state, transactions, and receipts. The payoff is that proving one item belongs to the set only requires that item plus a short "Merkle branch" of sibling hashes, not the entire dataset — the technique behind lightweight (SPV) clients that verify a transaction without downloading the full blockchain. This same structure secures on-chain domain ownership: a tokenized domain's record is committed into the chain's state tree, so its ownership can be verified with a compact proof rather than a full copy of the ledger.
Related keywords
- merkle tree
- hash tree
- merkle root
- merkle proof
- merkle branch
- SPV
Contributors
Namefi is a collective of engineers, designers, and operators who obsess over building tools that make managing your onchain domain names effortless.
Victor Zhou is a technology founder and standards editor focused on digital identity and trust. He founded Namefi, edits Ethereum Improvement Proposals, and previously led smart-contract architecture work at Google Labs.
His work sits at the intersection of naming, ownership, and the systems people use to establish identity online. That perspective makes him especially interested in the way names move between personal meaning, public recognition, and digital infrastructure.
For Namefi, Victor edits and writes about domains as durable digital identity: how names become ownable onchain assets, how tokenization changes custody and trust, and what naming can learn from the systems people use to establish identity online.