Merkle Root

Every block on a blockchain stores its Merkle root inside the block header, alongside the previous block's hash, a timestamp, and a nonce. It functions as a fingerprint for every transaction the block contains, so a change to even one transaction produces a completely different root and instantly invalidates the block.

The root is produced by pairing up the transaction hashes and hashing each pair together, then repeating that process on the resulting hashes level by level until only one value remains at the top of the tree. In Bitcoin this is done with SHA-256 applied twice per pairing. When a node receives a new block, it recomputes the root from the included transactions and rejects the block outright if the result does not match the value stored in the header.

This structure is what makes lightweight verification possible. A wallet that does not store the full blockchain, often called an SPV or light client, can download only block headers and still confirm a transaction was included by requesting a short "Merkle proof": the small set of sibling hashes needed to recompute the path from that transaction up to the root. Because the proof size grows logarithmically with the number of transactions, checking inclusion in a block of thousands of transactions takes only a handful of hashes rather than the entire dataset.

• Guarantees data integrity: any tampering with block contents changes the Merkle root and breaks the chain of block hashes.
• Enables efficient audits and light-client verification without full nodes.
• Forms the basis of Simplified Payment Verification used by mobile and hardware wallets.

The same principle scales beyond transactions: some networks build separate Merkle trees for state or receipts, letting applications prove specific facts about a block without processing everything inside it.