From 3807defabaca421a049d5d397dc71346a7a34688 Mon Sep 17 00:00:00 2001 From: "judymcconville@roadrunner.com" Date: Tue, 2 May 2017 11:03:05 -0700 Subject: [PATCH] Edited ch10.asciidoc with Atlas code editor --- ch10.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch10.asciidoc b/ch10.asciidoc index 3bdcbd4a..13143bed 100644 --- a/ch10.asciidoc +++ b/ch10.asciidoc @@ -394,7 +394,7 @@ Next, the mining node needs to add the "Previous Block Hash" (also known as +pre By selecting the specific _parent_ block, indicated by the Previous Block Hash field in the candidate block header, Jing is committing his mining power to extending the chain that ends in that specific block. In essence, this is how Jing "votes" with his mining power for the longest-difficulty valid chain. ==== -The next step is to summarize all the transactions with a merkle tree, in order to add the merkle root to the block header. The coinbase transaction is listed as the first transaction in the block. Then, 418 more transactions are added after it, for a total of 419 transactions in the block. As we saw in the <>, there must be an even number of "leaf" nodes in the tree, so the last transaction is duplicated, creating 420 nodes, each containing the hash of one transaction. The transaction hashes are then combined, in pairs, creating each level of the tree, until all the transactions are summarized into one node at the "root" of the tree. The root of the merkle tree summarizes all the transactions into a single 32-byte value, which you can see listed as "merkle root" in <>, and here: +((("merkle trees")))((("blockchain technology", "merkle trees")))The next step is to summarize all the transactions with a merkle tree, in order to add the merkle root to the block header. The coinbase transaction is listed as the first transaction in the block. Then, 418 more transactions are added after it, for a total of 419 transactions in the block. As we saw in the <>, there must be an even number of "leaf" nodes in the tree, so the last transaction is duplicated, creating 420 nodes, each containing the hash of one transaction. The transaction hashes are then combined, in pairs, creating each level of the tree, until all the transactions are summarized into one node at the "root" of the tree. The root of the merkle tree summarizes all the transactions into a single 32-byte value, which you can see listed as "merkle root" in <>, and here: ---- c91c008c26e50763e9f548bb8b2fc323735f73577effbc55502c51eb4cc7cf2e