arnaucube/asmt
1
0
Fork 0
mirror of https://github.com/arnaucube/asmt.git synced 2026-02-06 19:06:46 +01:00
Code Issues Packages Projects Releases Wiki Activity

add method VerifyInclusionWithRootC

Browse Source 
Signed-off-by: p4u <pau@dabax.net>
This commit is contained in:
p4u
2021-03-22 11:35:02 +01:00
parent 6fb3b028ac
commit c679bcb817
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
trie_merkle_proof.go
View File

@@ -171,6 +171,12 @@ func (s *Trie) VerifyInclusionC(bitmap, key, value []byte, ap [][]byte, length i
return bytes.Equal(s.Root, s.verifyInclusionC(bitmap, key, leafHash, ap, length, 0, 0)) return bytes.Equal(s.Root, s.verifyInclusionC(bitmap, key, leafHash, ap, length, 0, 0))
} }
// VerifyInclusionWithRootC verifies that key/value is included in the trie with latest root
func (s *Trie) VerifyInclusionWithRootC(root, bitmap, key, value []byte, ap [][]byte, length int) bool {
leafHash := s.hash(key, value, []byte{byte(s.TrieHeight - length)})
return bytes.Equal(root, s.verifyInclusionC(bitmap, key, leafHash, ap, length, 0, 0))
}
// verifyInclusionC returns the merkle root by hashing the merkle proof items // verifyInclusionC returns the merkle root by hashing the merkle proof items
func (s *Trie) verifyInclusionC(bitmap, key, leafHash []byte, ap [][]byte, length, keyIndex, apIndex int) []byte { func (s *Trie) verifyInclusionC(bitmap, key, leafHash []byte, ap [][]byte, length, keyIndex, apIndex int) []byte {
if keyIndex == length { if keyIndex == length {