DFIELDSOLUTIONS

Blockchain

GlossaryMerkle proof

A compact cryptographic proof that one item belongs to a big set — verify a leaf against the root hash without holding the whole tree.

A Merkle tree hashes pairs of items upward until one root hash commits to the whole set. To prove item X is in it, you only need the few sibling hashes along X's path — a handful of hashes instead of the entire list. That is how a contract can verify 'this wallet is on the airdrop list' without storing ten thousand addresses.

It is the standard trick wherever on-chain storage is expensive: whitelists, state verification, light clients, certificate transparency. The pattern to remember — commit a small hash on-chain, keep the big data anywhere — is the same one behind most 'verify off-chain data on-chain' designs.

Related terms

The bench this belongs to

Blockchain

Solidity on Ethereum, Polygon, Base and Arbitrum. Anchor programs on Solana. Written with tests first, because a redeploy is not a hotfix once value is on the line.

All termsStart a conversationMarkdown version

DField Bt. · Dunakeszi · dezso@dfieldsolutions.com
5.0
“From LinkedIn DM to live site. Two tiny tweaks, then shipped.”Michael J Ringer · Vilya ProtectionFounder · Spain