arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2025-07-05 06:12:37 +00:00
Code Issues Releases Wiki Activity

Edited ch11_blockchain.adoc with Atlas code editor

Browse Source
This commit is contained in:
clenser 2023-10-19 17:14:04 +00:00
parent 33497a6ccc
commit 7f5851acd9
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ch11_blockchain.adoc
View File

@ -421,7 +421,7 @@ image::images/mbc3_1102.png["merkle_tree"]
Because the merkle tree is a binary tree, it needs Because the merkle tree is a binary tree, it needs
an even number of leaf nodes. If there are an odd number of transactions 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 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. shown in <<merkle_tree_odd>>, where transaction C is duplicated.
Similarly, if there are an odd number of hashes to process at any level, Similarly, if there are an odd number of hashes to process at any level,
the last hash is duplicated. the last hash is duplicated.