Skip to content
Glossary

Merkle Tree

A Merkle tree hashes data in pairs up to a single root hash, letting anyone verify one item (like an account balance) was included in a larger set without seeing the whole set.

A Merkle tree is a data structure that hashes pairs of items together, then hashes those results together, repeatedly, until a single “root” hash represents the entire set underneath it. Named for Ralph Merkle, who patented the structure in 1979, it is a foundational building block of blockchains and of several proof-of-reserves schemes.

Why it matters

A Merkle tree lets anyone verify that one specific piece of data (say, your account balance) was included in a much larger set (every customer’s balance) by checking a short chain of hashes, instead of being handed the entire dataset. That is what makes a Merkle-based reserve proof individually checkable rather than a one-line assertion from the exchange.

Example

A customer requests their Merkle proof from an exchange: a short list of hashes that, combined with their own balance, recomputes to the publicly posted root hash. If it matches, their balance really was part of the total the exchange claimed to hold; if the exchange ever changes the underlying data without changing the root, the proof stops matching.

About the author

The Crypto Online Editorial Team

A collective byline for a claim-verification desk. Every piece is human-edited and checked against a primary record; AI assistance is disclosed in our editorial guidelines.

All work by the team → Methodology Corrections

Not financial advice. Human-edited; AI-assisted drafting is disclosed in our editorial guidelines. Spotted an error? See how corrections work.