Merkle Tree

A Merkle tree combines hashes of data blocks into higher-level hashes until one root hash summarizes the collection. If two systems have different roots, comparing lower branches can locate differing portions without transferring every block.

An inclusion proof can also connect a leaf to a trusted root. The tree’s structure, hashing rules, and trusted root must be defined; a root supplied by an attacker does not independently establish authenticity.