April 2020
Intermediate to advanced
244 pages
7h 20m
English
Another operation that can be performed on a Merkle tree is consistency proof, aimed at verifying whether two different versions of the archive are consistent with each other, checking whether the next version of the database includes all of the data (the transactions) contained in the previous version.
The elements must also respect the temporal order of insertion. It appears evident at this point how the audit proof and the consistency proof both resemble operations required to achieve the global consensus on a blockchain status.
To understand the tasks accomplished by a Merkle tree and the operations that can be performed on it, let's now analyze an example of a Merkle tree implementation in Python.
Read now
Unlock full access