Open h5law opened 1 year ago
This would require we index the tree, see [1] as a reference on how this works. But is currently not in focus or planned on being implemented.
[1] https://docs.aztec.network/concepts/advanced/data_structures/indexed_merkle_tree
Objective
Add support for the "range based" non-membership proof types used in the
cosmos/ics23
library.Origin Document
cosmos/ics23
issue #152Goals
ProveExclusion
function that can traverse the tree and looking for the key we aim to prove, once it has found a leaf it should collect the adjecent leaves and produce a proof for them.SparseMerkleProof
objects into the releventics23.CommitmentProof
typesDeliverable
Non-goals / Non-deliverables
General issue deliverables
Testing Methodology
go test ...
go test ...
go test -v
Creator: @h5law Co-Owners: @h5law