This cascades up all the levels, resulting in a different tree head. If any record is modified, its hash changes. The single hash at the top level - in this case H - is called the tree head hash. This carries on up until there's a single hash - the tree head hash H. The next level - C and G are calculated by hashing pairs of hashes below. The bottom level of hashes - A, B, D and F - are calculated by hashing records 1, 2, 3 and 4. The squares in the diagram are cryptographic hash values. In the diagram above on the right, the four records are shown along the bottom.
Trillian uses a Merkle tree to implement a verifiable log.Įvery record inserted into a verifiable log is added as a new leaf in the Merkle tree.
0 kommentar(er)
