1
0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2025-01-11 16:20:57 +00:00

Edited ch11_blockchain.adoc with Atlas code editor

This commit is contained in:
clenser 2023-10-19 17:15:09 +00:00
parent 7f5851acd9
commit 869a540096

View File

@ -486,7 +486,7 @@ them into 32 bytes.
To prove that a specific transaction is To prove that a specific transaction is
included in a block, a node only needs to produce approximately +log~2~(N)+ 32-byte included in a block, a node only needs to produce approximately +log~2~(N)+ 32-byte
hashes, constituting an _authentication path_ or _merkle path_ hashes, constituting ((("authentication path")))((("merkle path")))an _authentication path_ or _merkle path_
connecting the specific transaction to the root of the tree. This is connecting the specific transaction to the root of the tree. This is
especially important as the number of transactions increases, because especially important as the number of transactions increases, because
the base-2 logarithm of the number of transactions increases much more the base-2 logarithm of the number of transactions increases much more