-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmerkle_test.go
175 lines (152 loc) · 3.4 KB
/
merkle_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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
package fastmerkle
import (
"crypto/rand"
"encoding/hex"
"github.com/stretchr/testify/assert"
"testing"
)
func BenchmarkGenerateMerkleTree5(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(5),
)
}
}
func BenchmarkGenerateMerkleTree50(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(50),
)
}
}
func BenchmarkGenerateMerkleTree500(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(500),
)
}
}
func BenchmarkGenerateMerkleTree1000(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(1000),
)
}
}
func BenchmarkGenerateMerkleTree10000(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(10000),
)
}
}
func BenchmarkGenerateMerkleTree1000000(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = GenerateMerkleTree(
generateRandomData(1000000),
)
}
}
// generateRandomData generates random byte data
func generateRandomData(count int) [][]byte {
randomData := make([][]byte, count)
for i := 0; i < count; i++ {
data := make([]byte, 32)
_, _ = rand.Read(data)
randomData[i] = data
}
return randomData
}
// generateInputSet generates an input set from the
// fixed random data
func generateInputSet(count int) [][]byte {
if count < 1 {
return nil
}
inputSet := [][]byte{
[]byte("Lazar"),
[]byte("Vuksan"),
[]byte("Dusan"),
[]byte("Aleksa"),
[]byte("Yoshiki"),
[]byte("Milos"),
[]byte("Zeljko"),
}
if count > len(inputSet) {
count = len(inputSet)
}
return inputSet[:count]
}
// getHexBytes converts an input string to bytes
func getHexBytes(t *testing.T, input string) []byte {
t.Helper()
hexBytes, err := hex.DecodeString(input)
if err != nil {
t.Fatalf("Unable to decode hex, %v", err)
}
return hexBytes
}
// TestGenerateMerkleTree test Merkle tree generation logic
func TestGenerateMerkleTree(t *testing.T) {
testTable := []struct {
name string
inputElements [][]byte
expectedRoot []byte
expectedError error
}{
{
"no input data provided",
nil,
nil,
errEmptyDataSet,
},
{
"single element input data",
generateInputSet(1),
getHexBytes(
t,
"6c4cc993464af6cca9101c82d9a5733d6b8453726834f7fd9b1e7a6104915065",
),
nil,
},
{
"input data set is power of 2",
generateInputSet(2),
getHexBytes(
t,
"2997f58b4810eb8d4e779f69e51ab80dc85d1a962a5036d02b21f485e1557c35",
),
nil,
},
{
"input data set is not a power of 2 (even)",
generateInputSet(6),
getHexBytes(
t,
"de0aa53f3e453e031fc92844aa1845f29b69909f6123fed4b047bc253174a497",
),
nil,
},
}
for _, testCase := range testTable {
t.Run(testCase.name, func(t *testing.T) {
// Generate the Merkle tree
merkleTree, genErr := GenerateMerkleTree(testCase.inputElements)
// Check the errors
if testCase.expectedError != nil {
// Make sure the error is correct
assert.ErrorIs(t, genErr, testCase.expectedError)
// Make sure the Merkle tree has not been generated
assert.Nil(t, merkleTree)
} else {
// Make sure no error occurred
assert.NoError(t, genErr)
if merkleTree == nil || merkleTree.root == nil {
t.Fatalf("Merkle tree is not initialized")
}
// Make sure the Merkle roots match
assert.Equal(t, testCase.expectedRoot, merkleTree.RootHash())
}
})
}
}