Merkle tree: leaf nodes hash data blocks; parent nodes hash their children. Change one leaf → all ancestor hashes change. Proof = O(log n) siblings.