Database Reference
In-Depth Information
The following figure shows the Merkle tree to determine a mismatch in hash values at the
parent nodes due to the difference in the underlying data:
To exemplify this, the preceding figure shows the Merkle tree from two nodes with incon-
sistent data. A process comparing these two trees would know that there is something in-
consistent, because the hash values stored in the top nodes do not match. It can descend
down and knows that the right subtree is likely to have an inconsistency. And then, the
same process is repeated until it finds out that all the data is mismatched.
