A concrete example
Two competing blocks may both be at height 900,000. Their hashes distinguish them.
In context
An inclusion proof supplies the hashes along one branch, allowing a verifier to reconstruct the root without downloading every transaction. For four leaves A, B, C and D, proving A requires its sibling B and the combined hash of C and D. This reduces the amount of data needed for the inclusion check.
Explore the full explanation
Blockchain
Block anatomy and Merkle trees
A block contains transactions and metadata.
Intermediate3 min reading + workshop ↗