Edited ch11_blockchain.adoc with Atlas code editor

develop
clenser 7 months ago
parent 7f5851acd9
commit 869a540096

@ -486,7 +486,7 @@ them into 32 bytes.
To prove that a specific transaction is
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
especially important as the number of transactions increases, because
the base-2 logarithm of the number of transactions increases much more

Loading…
Cancel
Save