From f18b55fd6193950aeb2cf5c74c02b0f23eea15ab Mon Sep 17 00:00:00 2001 From: nadams Date: Thu, 11 May 2017 06:07:20 -0700 Subject: [PATCH] Edited ch09.asciidoc with Atlas code editor --- ch09.asciidoc | 1 + 1 file changed, 1 insertion(+) diff --git a/ch09.asciidoc b/ch09.asciidoc index d58b8e7f..9c80c648 100644 --- a/ch09.asciidoc +++ b/ch09.asciidoc @@ -159,6 +159,7 @@ Looking at this new block, the node finds the +previousblockhash+ field, which c ((("binary hash trees", see="merkle trees")))A _merkle tree_, also known as a _binary hash tree_, is a data structure used for efficiently summarizing and verifying the integrity of large sets of data. Merkle trees are binary trees containing cryptographic hashes. The term "tree" is used in computer science to describe a branching data structure, but these trees are usually displayed upside down with the "root" at the top and the "leaves" at the bottom of a diagram, as you will see in the examples that follow. [[chain_of_blocks]] +[role="smallerfourty"] .Blocks linked in a chain by reference to the previous block header hash image::images/mbc2_0901.png[]