1
0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-12-30 18:30:56 +00:00

Merge branch 'develop' of https://github.com/cgodley/bitcoinbook into cgodley-develop

This commit is contained in:
Minh T. Nguyen 2014-10-22 23:13:02 -04:00
commit c7761d18a4

View File

@ -171,7 +171,7 @@ The process continues until there is only one node at the top, the node known as
.Calculating the nodes in a Merkle Tree .Calculating the nodes in a Merkle Tree
image::images/MerkleTree.png["merkle_tree"] image::images/MerkleTree.png["merkle_tree"]
Since the merkle tree is a binary tree, it needs an even number of leaf nodes. If there is an odd number of transactions to summarize, the last transaction hash will be duplicated to create an even number of leaf nodes, also known as a _balanced tree_. This is shown in the example below, where transaction C is duplicated: If there is an odd number of transactions to summarize, the last transaction hash will be duplicated to create an even number of leaf nodes, also known as a _balanced tree_. This is shown in the example below, where transaction C is duplicated:
[[merkle_tree_odd]] [[merkle_tree_odd]]
.An even number of data elements, by duplicating one data element .An even number of data elements, by duplicating one data element