arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-11-26 01:50:42 +00:00
Code Issues Releases Wiki Activity

Edited ch09.asciidoc with Atlas code editor

Browse Source
This commit is contained in:
nadams 2017-05-11 06:50:15 -07:00
parent f1503464f6
commit ccee3c2697
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ch09.asciidoc
View File

@ -159,7 +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. ((("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]] [[chain_of_blocks]]
[role="smallerfifty"] [role="smallerfourtyfive"]
.Blocks linked in a chain by reference to the previous block header hash .Blocks linked in a chain by reference to the previous block header hash
image::images/mbc2_0901.png[] image::images/mbc2_0901.png[]