-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree_test.go
134 lines (94 loc) · 2.67 KB
/
tree_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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
package gomerkle
import (
"crypto/sha256"
"encoding/binary"
"github.com/stretchr/testify/require"
"testing"
)
func TestPushAndProofs(t *testing.T) {
tree := NewTree(sha256.New())
data := make([]byte, 8)
for i := 0; i < 31; i++ {
binary.LittleEndian.PutUint64(data, uint64(i))
tree.Push(data)
}
// Check all proofs
for i := 0; i < 31; i++ {
proofs := tree.GetIndexProofs(i)
binary.LittleEndian.PutUint64(data, uint64(i))
require.Equal(t, true, tree.ValidateIndexByProofs(i, data, proofs))
}
}
func TestBuildNewAndProofs(t *testing.T) {
tree := NewTree(sha256.New())
allData := make([][]byte, 0, 31)
for i := 0; i < 31; i++ {
data := make([]byte, 8)
binary.LittleEndian.PutUint64(data, uint64(i))
allData = append(allData, data)
}
tree.BuildNewWithData(allData)
// Check all proofs
for i := 0; i < 31; i++ {
proofs := tree.GetIndexProofs(i)
data := make([]byte, 8)
binary.LittleEndian.PutUint64(data, uint64(i))
require.Equal(t, true, tree.ValidateIndexByProofs(i, data, proofs))
}
}
func TestEqualityOfBuildNewAndPush(t *testing.T) {
tree1 := NewTree(sha256.New())
data := make([]byte, 8)
for i := 0; i < 31; i++ {
binary.LittleEndian.PutUint64(data, uint64(i))
tree1.Push(data)
}
tree2 := NewTree(sha256.New())
allData := make([][]byte, 0, 31)
for i := 0; i < 31; i++ {
data := make([]byte, 8)
binary.LittleEndian.PutUint64(data, uint64(i))
allData = append(allData, data)
}
tree2.BuildNewWithData(allData)
require.Equal(t, tree1.RootHash(), tree2.RootHash())
}
func TestNotFull(t *testing.T) {
tree1 := NewTree(sha256.New())
data := make([]byte, 8)
for i := 0; i < 31; i++ {
binary.LittleEndian.PutUint64(data, uint64(i))
tree1.Push(data)
}
tree2 := NewTree(sha256.New())
for i := 0; i < 31; i++ {
binary.LittleEndian.PutUint64(data, uint64(i))
tree2.Push(data)
}
tree3 := NewTree(sha256.New())
allData := make([][]byte, 0, 31)
for i := 0; i < 31; i++ {
data := make([]byte, 8)
binary.LittleEndian.PutUint64(data, uint64(i))
allData = append(allData, data)
}
tree3.BuildNewWithData(allData)
require.Equal(t, tree1.RootHash(), tree2.RootHash())
require.Equal(t, tree1.RootHash(), tree3.RootHash())
}
func TestExportImport(t *testing.T) {
tree1 := NewTree(sha256.New())
data := make([]byte, 8)
for i := 0; i < 31; i++ {
binary.LittleEndian.PutUint64(data, uint64(i))
tree1.Push(data)
}
subtreeRoots := tree1.ExportSubtreesRoots()
tree2 := NewTree(sha256.New())
tree2.ImportSubtreesRoots(subtreeRoots)
require.Equal(t, tree1.RootHash(), tree2.RootHash())
binary.LittleEndian.PutUint64(data, uint64(31))
tree1.Push(data)
tree2.Push(data)
require.Equal(t, tree1.RootHash(), tree2.RootHash())
}