From 869a540096de68264102df5108637859846204ea Mon Sep 17 00:00:00 2001 From: clenser Date: Thu, 19 Oct 2023 17:15:09 +0000 Subject: [PATCH] Edited ch11_blockchain.adoc with Atlas code editor --- ch11_blockchain.adoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch11_blockchain.adoc b/ch11_blockchain.adoc index e6c5c1da..9dfae935 100644 --- a/ch11_blockchain.adoc +++ b/ch11_blockchain.adoc @@ -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