|
|
@ -23,7 +23,7 @@ |
|
|
|
* storing a bit for each traversed node, signifying whether the node is the |
|
|
|
* storing a bit for each traversed node, signifying whether the node is the |
|
|
|
* parent of at least one matched leaf txid (or a matched txid itself). In |
|
|
|
* parent of at least one matched leaf txid (or a matched txid itself). In |
|
|
|
* case we are at the leaf level, or this bit is 0, its merkle node hash is |
|
|
|
* case we are at the leaf level, or this bit is 0, its merkle node hash is |
|
|
|
* stored, and its children are not explorer further. Otherwise, no hash is |
|
|
|
* stored, and its children are not explored further. Otherwise, no hash is |
|
|
|
* stored, but we recurse into both (or the only) child branch. During |
|
|
|
* stored, but we recurse into both (or the only) child branch. During |
|
|
|
* decoding, the same depth-first traversal is performed, consuming bits and |
|
|
|
* decoding, the same depth-first traversal is performed, consuming bits and |
|
|
|
* hashes as they written during encoding. |
|
|
|
* hashes as they written during encoding. |
|
|
|