forked from cosmos/iavl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
proof_iavl_test.go
60 lines (53 loc) · 1.25 KB
/
proof_iavl_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
package iavl
import (
"fmt"
"testing"
db "github.com/cosmos/cosmos-db"
"github.com/stretchr/testify/require"
)
func TestProofOp(t *testing.T) {
tree, err := NewMutableTreeWithOpts(db.NewMemDB(), 0, nil, false)
require.NoError(t, err)
keys := []byte{0x0a, 0x11, 0x2e, 0x32, 0x50, 0x72, 0x99, 0xa1, 0xe4, 0xf7} // 10 total.
for _, ikey := range keys {
key := []byte{ikey}
tree.Set(key, key)
}
testcases := []struct {
key byte
expectPresent bool
}{
{0x00, false},
{0x0a, true},
{0x0b, false},
{0x11, true},
{0x60, false},
{0x72, true},
{0x99, true},
{0xaa, false},
{0xe4, true},
{0xf7, true},
{0xff, false},
}
for _, tc := range testcases {
tc := tc
t.Run(fmt.Sprintf("%02x", tc.key), func(t *testing.T) {
key := []byte{tc.key}
if tc.expectPresent {
proof, err := tree.GetMembershipProof(key)
require.NoError(t, err)
// Verify that proof is valid.
res, err := tree.VerifyMembership(proof, key)
require.NoError(t, err)
require.True(t, res)
} else {
proof, err := tree.GetNonMembershipProof(key)
require.NoError(t, err)
// Verify that proof is valid.
res, err := tree.VerifyNonMembership(proof, key)
require.NoError(t, err)
require.True(t, res)
}
})
}
}