qyriad/miden-crypto
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Compare commits

base: qyriad:d57fc21f5beee64a748a61e8929afc4d7e9f1b29
Branches Tags
qyriad:next
qyriad:git-series/sparse-path-parity
qyriad:git-series/sparse-path
qyriad:sparse-path
qyriad:git-series/parallel-subtrees
qyriad:wip/qyriad/parallel-construction
qyriad:wip/qyriad/parallel-subtrees
qyriad:wip/qyriad/bench-subtree
qyriad:git-series/checked-insert
qyriad:wip/qyriad/checked-insert
...
compare: qyriad:7cffe4743d0f6ef4d29df74aa85a804b3f248ffc
Branches Tags
qyriad:git-series/sparse-path-parity
qyriad:git-series/sparse-path
qyriad:next
qyriad:sparse-path
qyriad:git-series/parallel-subtrees
qyriad:wip/qyriad/parallel-construction
qyriad:wip/qyriad/parallel-subtrees
qyriad:wip/qyriad/bench-subtree
qyriad:git-series/checked-insert
qyriad:wip/qyriad/checked-insert

12 commits
d57fc21f5b ... 7cffe4743d

Author SHA1 Message Date
Qyriad
7cffe4743d add test_two_subtrees() commit 2024-11-14 15:38:24 -07:00
Qyriad
df5d7f26d0 smt: test that SparseMerkleTree::build_subtree() is composable 2024-11-14 15:37:37 -07:00
Qyriad
ecd679c647 remove FIXME from single-subtree commit 2024-11-14 15:34:27 -07:00
Qyriad
ae191003a5 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 15:34:16 -07:00
Qyriad
1b1c4ccedb 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 15:34:16 -07:00
Qyriad
baf1916b6e add comments/docs to sorted_pairs_to_leaves commit 2024-11-14 15:33:48 -07:00
Qyriad
9cdf160bb0 smt: add sorted_pairs_to_leaves() and test for it 2024-11-14 15:33:08 -07:00
Qyriad
b3260c261e 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 15:33:08 -07:00
Qyriad
df37bc7fa1 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 15:33:08 -07:00
Qyriad
ecfc89a66c single-subtree commit: change magic PAIR_COUNT to be COLS_PER_SUBTREE in test 2024-11-14 15:03:20 -07:00
Qyriad
c6034c6565 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 15:02:55 -07:00
Qyriad
543436c9d6 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 15:02:51 -07:00
1 changed files with 1 additions and 1 deletions
Show stats Expand all files Collapse all files

2
series

@ -1 +1 @@
Subproject commit 7513cfe040158ef26a3b029f4d2f6dbf1faba7af
Subproject commit df5d7f26d02efb74e5528345e525e0a91b4476b6