Compare commits

...

7 commits

Author SHA1 Message Date
99bac324a3 put 'prospective' first in tests for prospective commit 2024-08-22 14:50:24 -06:00
4d1f33ab67 WIP: smt: implement root-checked insertion 2024-08-22 14:50:06 -06:00
d7af60d037 feat: export Merkle get_value() in the trait 2024-08-22 14:49:31 -06:00
6178074b9f feat: impl hashing Merkle leaves that don't yet exist
This commit implements 'prospective leaf hashing' -- computing what the
hash of a sparse Merkle tree leaf *would* be for a key-value insertion
without actually performing that insertion.

For SimpleSmt, this is trivial, since the leaf hash and its payload are
the same.

For the full Smt, the new leaf payload (and thus, its hash) depend on
the existing payload in that leaf, making the prospective hash logic a
combination of the normal insertion logic and the normal hash logic. But
because we're only interested in the hash and not the intermediate
value, we can skip allocations and sorts for the payload itself.
2024-08-22 14:49:29 -06:00
91c4260120 mark get_value commit as non-wip 2024-08-22 14:42:51 -06:00
0c97562ea2 WIP: smt: implement root-checked insertion 2024-08-22 14:32:20 -06:00
70131e892e feat: export Merkle get_value() in the trait 2024-08-22 14:32:20 -06:00

2
series

@ -1 +1 @@
Subproject commit 1662a0a8daceb5269329348d8c0b5431a1ce3198
Subproject commit 4d1f33ab6775297ae617e353acbe8388e1c36fc8