arno/bitcoinbook
1
0
Fork 0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2025-02-02 10:51:24 +00:00
Code Issues Releases Wiki Activity

I believe 'data' is always treated singular.

Browse Source
This commit is contained in:
Minh T. Nguyen 2014-07-24 23:27:59 -07:00
parent a63ebecf96
commit b4cb4da5de
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ch07.asciidoc
View File

@ -149,7 +149,7 @@ Merkle trees are used in bitcoin to summarize all the transactions in a block, p
When N data elements are hashed and summarized in a Merkle Tree, you can check to see if any one data element is included in the tree with at most +2*log~2~(N)+ calculations, making this a very efficient data structure.
The merkle tree is constructed bottom-up. In the example below, we start with four transactions A, B, C and D, which form the _leaves_ of the Merkle Tree, shown in the diagram at the bottom. The transactions are not stored in the merkle tree, rather their data are hashed and the resulting hash is stored in each leaf node as H~A~, H~B~, H~C~ and H~D~:
The merkle tree is constructed bottom-up. In the example below, we start with four transactions A, B, C and D, which form the _leaves_ of the Merkle Tree, shown in the diagram at the bottom. The transactions are not stored in the merkle tree, rather their data is hashed and the resulting hash is stored in each leaf node as H~A~, H~B~, H~C~ and H~D~:
+H~A~ = SHA256(SHA256(Transaction A))+