Extend description of the partial merkle block format #4

1. 
   sipa commented at 4:13 pm on December 27, 2013: member
2. Extend description of the partial merkle block format bda2aa1b0e
3. 
   sipa commented at 4:13 pm on December 27, 2013: member

   @mikehearn @TheBlueMatt Look!
4. 
   jgarzik commented at 4:17 pm on December 27, 2013: contributor

   Seems sane by quick review
5. 
   mikehearn commented at 4:23 pm on December 27, 2013: contributor

   Awesome, thanks! Fixed comments in the code would be neat too :)
6. in bip-0037.mediawiki: in bda2aa1b0e

   173+*** Descend into its left child tree, and store its computed hash as L.
   174+*** If this node has a right child as well:
   175+**** Descend into its right child, and store its computed hash as R.
   176+**** If L == R, the partial merkle tree object is invalid.
   177+**** Return Hash(L || R).
   178+*** If this node has no right child, return Hash(L || L).
   

   ---

   ---

   

   TheBlueMatt commented at 11:10 pm on December 27, 2013:

   Would be nice to add a note as to why this is necessary (“in the same way that hashes are repeated when building the full merkle tree”)
7. 
   TheBlueMatt commented at 11:10 pm on December 27, 2013: contributor

   Nice, looks good.
8. laanwj referenced this in commit bee6818965 on Jan 23, 2014
9. laanwj merged this on Jan 23, 2014
10. laanwj closed this on Jan 23, 2014

    ---

11. CodeShark referenced this in commit 3d2b3a8ebd on Dec 23, 2015
12. luke-jr referenced this in commit c7fd6ddb2e on Mar 17, 2016
13. justusranvier referenced this in commit da43de2dba on Jul 11, 2016
14. real-or-random referenced this in commit ccd415fd89 on Aug 2, 2018
15. t-bast referenced this in commit d62f6b14c4 on Apr 6, 2022

Contributors
sipa jgarzik mikehearn TheBlueMatt