Padding efficent merkle root algo (#436)

* Add initial work on padding efficent merkle roots

* Improve merklize_padded

* Improve tree_hash crate -- fix bugs, docs

* Update codebase for tree_hash API change

* Remove dbg statements, fix import error

* Fix clippy lints, doc error

* Tidy tree hash comments

* Increase tree_hash max tree height

* Fix PR review comments

* Fix typos

* Fix cache access off-by-one in tree hash

* Set max tree depth to 48 (from 64)
This commit is contained in:
Paul Hauner
2019-07-16 14:40:56 +10:00
committed by GitHub
parent af499c0b8c
commit 88c6d15c32
7 changed files with 403 additions and 12 deletions

View File

@@ -150,7 +150,7 @@ pub fn tree_hash_derive(input: TokenStream) -> TokenStream {
leaves.append(&mut self.#idents.tree_hash_root());
)*
tree_hash::merkleize::merkle_root(&leaves)
tree_hash::merkle_root(&leaves)
}
}
};
@@ -180,7 +180,7 @@ pub fn tree_hash_signed_root_derive(input: TokenStream) -> TokenStream {
leaves.append(&mut self.#idents.tree_hash_root());
)*
tree_hash::merkleize::merkle_root(&leaves)
tree_hash::merkle_root(&leaves)
}
}
};