cerc-io/lighthouse
16
0
Fork 0
Code Issues 1 Pull Requests Packages Projects Releases Wiki Activity

fix a couple typos in comments in merkle_hasher (#2171)

Browse Source 
Found what I believe to be a couple typos in the comments as I was going through the merkleization code.
This commit is contained in:
Guillaume Ballet 2021-02-03 04:52:22 +00:00
parent 420c2d28f8
commit de193c95d3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
consensus/tree_hash/src/merkle_hasher.rs
View File

@ -61,7 +61,7 @@ impl HalfNode {
/// zero-value hashes at all depths of the tree. /// zero-value hashes at all depths of the tree.
/// ///
/// This algorithm aims to allocate as little memory as possible and it does this by "folding" up /// This algorithm aims to allocate as little memory as possible and it does this by "folding" up
/// the tree has each leaf is provided. Consider this step-by-step functional diagram of hashing a /// the tree as each leaf is provided. Consider this step-by-step functional diagram of hashing a
/// tree with depth three: /// tree with depth three:
/// ///
/// ## Functional Diagram /// ## Functional Diagram
@ -307,7 +307,7 @@ impl MerkleHasher {
/// is a leaf node it will be the value of that leaf). /// is a leaf node it will be the value of that leaf).
/// ///
/// This operation will always complete one node, then it will attempt to crawl up the tree and /// This operation will always complete one node, then it will attempt to crawl up the tree and
/// collapse and other viable nodes. For example, consider a tree of depth 3 (see diagram /// collapse all other completed nodes. For example, consider a tree of depth 3 (see diagram
/// below). When providing the node with id `7`, the node with id `3` will be completed which /// below). When providing the node with id `7`, the node with id `3` will be completed which
/// will also provide the right-node for the `1` node. This function will complete both of /// will also provide the right-node for the `1` node. This function will complete both of
/// those nodes and ultimately find the root of the tree. /// those nodes and ultimately find the root of the tree.