mirror of
https://github.com/bitcoinbook/bitcoinbook
synced 2025-04-19 16:49:05 +00:00
Edited ch11_blockchain.adoc with Atlas code editor
This commit is contained in:
parent
33497a6ccc
commit
7f5851acd9
@ -421,7 +421,7 @@ image::images/mbc3_1102.png["merkle_tree"]
|
||||
Because the merkle tree is a binary tree, it needs
|
||||
an even number of leaf nodes. If there are 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
|
||||
even number of leaf nodes, also known ((("balanced trees")))as a _balanced tree_. This is
|
||||
shown in <<merkle_tree_odd>>, where transaction C is duplicated.
|
||||
Similarly, if there are an odd number of hashes to process at any level,
|
||||
the last hash is duplicated.
|
||||
|
Loading…
Reference in New Issue
Block a user