Open shuijian-xu opened 4 years ago
To construct the Merkle tree, we follow this algorithm:
Hash all the items of the ordered list with the provided hash function.
If there is exactly 1 hash, we are done.
Otherwise, if there is an odd number of hashes, we duplicate the last hash in the list and add it to the end so that we have an even number of hashes.
We pair the hashes in order and hash the concatenation to get the parent level, which should have half the number of hashes.
Go to #2.
To construct the Merkle tree, we follow this algorithm:
Hash all the items of the ordered list with the provided hash function.
If there is exactly 1 hash, we are done.
Otherwise, if there is an odd number of hashes, we duplicate the last hash in the list and add it to the end so that we have an even number of hashes.
We pair the hashes in order and hash the concatenation to get the parent level, which should have half the number of hashes.
Go to #2.