Compare commits

...

10 commits

Author SHA1 Message Date
d57fc21f5b add balanced Merkle benchmark 2024-11-14 14:47:15 -07:00
7513cfe040 merkle: add a benchmark for constructing 256-balanced trees
This is intended for comparison with the benchmarks from the previous
commit. This benchmark represents the theoretical perfect-efficiency
performance we could possibly (but impractically) get for computing
depth-8 sparse Merkle subtrees.
2024-11-14 14:45:26 -07:00
f6e245d2ad I forgot to include the benchmark file in the last commit 2024-11-14 14:04:28 -07:00
46857174c6 smt: implement single subtree-8 hashing, w/ benchmarks & tests
This will be composed into depth-8-subtree-based computation of entire
sparse Merkle trees.
2024-11-14 14:04:15 -07:00
d825a3f593 add single subtree8 commit 2024-11-14 13:54:58 -07:00
acfb432e90 smt: implement single subtree-8 hashing, w/ benchmarks & tests
This will be composed into depth-8-subtree-based computation of entire
sparse Merkle trees.
2024-11-14 13:53:00 -07:00
4f22d3830d re-init as cleanup 2024-11-13 15:33:12 -07:00
46f951b0f1 smt: add sorted_pairs_to_leaves() and test for it 2024-11-13 15:32:48 -07:00
f5d3dea50d smt: add pairs_to_leaf() to trait 2024-11-13 15:19:05 -07:00
b585f9cac6 merkle: add parent() helper function on NodeIndex 2024-11-13 15:17:40 -07:00

2
series

@ -1 +1 @@
Subproject commit 8eaff5c30be24906e867f367c0cac6a165ac8cf9
Subproject commit 7513cfe040158ef26a3b029f4d2f6dbf1faba7af