tendermint

291 MiB

Tree: e5312942e3

Author	SHA1	Message	Date
Marko	4e06dfef8c	crypto/merkle: optimize merkle tree hashing (#6513 ) ## Description Upstream https://github.com/lazyledger/lazyledger-core/pull/351 to optimize merkle tree hashing ### Benchmarking: ``` benchmark old ns/op new ns/op delta BenchmarkHashAlternatives/recursive-8 22914 21949 -4.21% BenchmarkHashAlternatives/iterative-8 21634 21939 +1.41% benchmark old allocs new allocs delta BenchmarkHashAlternatives/recursive-8 398 200 -49.75% BenchmarkHashAlternatives/iterative-8 399 301 -24.56% benchmark old bytes new bytes delta BenchmarkHashAlternatives/recursive-8 19088 6496 -65.97% BenchmarkHashAlternatives/iterative-8 21776 13984 -35.78% ``` cc @odeke-em @cuonglm	4 years ago
Cuong Manh Le	a9fc0c32b2	crypto/merkle: pre-allocate data slice in innherHash (#6443 ) So we can reduce pressure on runtime for checking that slice has enough capacity before appending.	4 years ago
Erik Grinaker	f66b7a8e32	merkle: return hashes for empty merkle trees (#5193 ) Fixes #5192. @liamsi Can you verify that the test vectors match the Rust implementation? I updated `ProofsFromByteSlices()` as well, anything else that should be updated?	4 years ago
Dev Ojha	ec53ce359b	Simple merkle rfc compatibility (#2713 ) * Begin simple merkle compatibility PR * Fix query_test * Use trillian test vectors * Change the split point per RFC 6962 * update spec * refactor innerhash to match spec * Update changelog * Address @liamsi's comments * Write the comment requested by @liamsi	6 years ago