Compare commits

..

9 commits

Author SHA1 Message Date
753c372886 add Box<dyn Iterator> comment to sorted_pairs_to_leaves() commit 2024-11-14 16:06:37 -07:00
1b32285fc2 smt: test that subtree logic can correctly construct an entire tree
This commit ensures that `SparseMerkleTree::build_subtree()` can
correctly compose into building an entire sparse Merkle tree, without
yet getting into potential complications concurrency introduces.
2024-11-14 16:06:17 -07:00
04cef48555 smt: test that SparseMerkleTree::build_subtree() is composable 2024-11-14 16:06:17 -07:00
a126ff9767 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 16:06:17 -07:00
baaf2b4caa 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 16:06:17 -07:00
d4f1ccf396 smt: add sorted_pairs_to_leaves() and test for it 2024-11-14 16:06:17 -07:00
bb1424e5c4 add test_singlethreaded_subtree commit 2024-11-14 16:05:05 -07:00
29ee02fa56 smt: test that subtree logic can correctly construct an entire tree
This commit ensures that `SparseMerkleTree::build_subtree()` can
correctly compose into building an entire sparse Merkle tree, without
yet getting into potential complications concurrency introduces.
2024-11-14 16:00:58 -07:00
e47f3ab7bc smt: test that SparseMerkleTree::build_subtree() is composable 2024-11-14 15:59:29 -07:00

2
series

@ -1 +1 @@
Subproject commit df5d7f26d02efb74e5528345e525e0a91b4476b6
Subproject commit 1b32285fc254d2fc0183ae6088061455d525b8e3