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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
// Copyright 2022 Google LLC. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package testonly
import (
"bytes"
"fmt"
"math/rand"
"strconv"
"testing"
"github.com/google/go-cmp/cmp"
"github.com/google/go-cmp/cmp/cmpopts"
"github.com/transparency-dev/merkle/rfc6962"
)
func validateTree(t *testing.T, mt *Tree, size uint64) {
t.Helper()
if got, want := mt.Size(), size; got != want {
t.Errorf("Size: %d, want %d", got, want)
}
roots := RootHashes()
if got, want := mt.Hash(), roots[size]; !bytes.Equal(got, want) {
t.Errorf("Hash(%d): %x, want %x", size, got, want)
}
for s := uint64(0); s <= size; s++ {
if got, want := mt.HashAt(s), roots[s]; !bytes.Equal(got, want) {
t.Errorf("HashAt(%d/%d): %x, want %x", s, size, got, want)
}
}
}
func TestBuildTreeBuildOneAtATime(t *testing.T) {
mt := newTree(nil)
validateTree(t, mt, 0)
for i, entry := range LeafInputs() {
mt.AppendData(entry)
validateTree(t, mt, uint64(i+1))
}
}
func TestBuildTreeBuildTwoChunks(t *testing.T) {
entries := LeafInputs()
mt := newTree(nil)
mt.AppendData(entries[:3]...)
validateTree(t, mt, 3)
mt.AppendData(entries[3:8]...)
validateTree(t, mt, 8)
}
func TestBuildTreeBuildAllAtOnce(t *testing.T) {
mt := newTree(nil)
mt.AppendData(LeafInputs()...)
validateTree(t, mt, 8)
}
func TestTreeHashAt(t *testing.T) {
test := func(desc string, entries [][]byte) {
t.Run(desc, func(t *testing.T) {
mt := newTree(entries)
for size := 0; size <= len(entries); size++ {
got := mt.HashAt(uint64(size))
want := refRootHash(entries[:size], mt.hasher)
if !bytes.Equal(got, want) {
t.Errorf("HashAt(%d): %x, want %x", size, got, want)
}
}
})
}
entries := LeafInputs()
for size := 0; size <= len(entries); size++ {
test(fmt.Sprintf("size:%d", size), entries[:size])
}
test("generated", genEntries(256))
}
func TestTreeInclusionProof(t *testing.T) {
test := func(desc string, entries [][]byte) {
t.Run(desc, func(t *testing.T) {
mt := newTree(entries)
for index, size := uint64(0), uint64(len(entries)); index < size; index++ {
got, err := mt.InclusionProof(index, size)
if err != nil {
t.Fatalf("InclusionProof(%d, %d): %v", index, size, err)
}
want := refInclusionProof(entries[:size], index, mt.hasher)
if diff := cmp.Diff(got, want, cmpopts.EquateEmpty()); diff != "" {
t.Fatalf("InclusionProof(%d, %d): diff (-got +want)\n%s", index, size, diff)
}
}
})
}
test("generated", genEntries(256))
entries := LeafInputs()
for size := 0; size < len(entries); size++ {
test(fmt.Sprintf("golden:%d", size), entries[:size])
}
}
func TestTreeConsistencyProof(t *testing.T) {
entries := LeafInputs()
mt := newTree(entries)
validateTree(t, mt, 8)
if _, err := mt.ConsistencyProof(6, 3); err == nil {
t.Error("ConsistencyProof(6, 3) succeeded unexpectedly")
}
for size1 := uint64(0); size1 <= 8; size1++ {
for size2 := size1; size2 <= 8; size2++ {
t.Run(fmt.Sprintf("%d:%d", size1, size2), func(t *testing.T) {
got, err := mt.ConsistencyProof(size1, size2)
if err != nil {
t.Fatalf("ConsistencyProof: %v", err)
}
want := refConsistencyProof(entries[:size2], size2, size1, mt.hasher, true)
if diff := cmp.Diff(got, want, cmpopts.EquateEmpty()); diff != "" {
t.Errorf("ConsistencyProof: diff (-got +want)\n%s", diff)
}
})
}
}
}
// Make random proof queries and check against the reference implementation.
func TestTreeConsistencyProofFuzz(t *testing.T) {
entries := genEntries(256)
for treeSize := int64(1); treeSize <= 256; treeSize++ {
mt := newTree(entries[:treeSize])
for i := 0; i < 8; i++ {
size2 := uint64(rand.Int63n(treeSize + 1))
size1 := uint64(rand.Int63n(int64(size2) + 1))
got, err := mt.ConsistencyProof(size1, size2)
if err != nil {
t.Fatalf("ConsistencyProof: %v", err)
}
want := refConsistencyProof(entries[:size2], size2, size1, mt.hasher, true)
if diff := cmp.Diff(got, want, cmpopts.EquateEmpty()); diff != "" {
t.Errorf("ConsistencyProof: diff (-got +want)\n%s", diff)
}
}
}
}
func TestTreeAppend(t *testing.T) {
entries := genEntries(256)
mt1 := newTree(entries)
mt2 := newTree(nil)
for _, entry := range entries {
mt2.Append(rfc6962.DefaultHasher.HashLeaf(entry))
}
if diff := cmp.Diff(mt1, mt2, cmp.AllowUnexported(Tree{})); diff != "" {
t.Errorf("Trees built with AppendData and Append mismatch: diff (-mt1 +mt2)\n%s", diff)
}
}
func TestTreeAppendAssociativity(t *testing.T) {
entries := genEntries(256)
mt1 := newTree(nil)
mt1.AppendData(entries...)
mt2 := newTree(nil)
for _, entry := range entries {
mt2.AppendData(entry)
}
if diff := cmp.Diff(mt1, mt2, cmp.AllowUnexported(Tree{})); diff != "" {
t.Errorf("AppendData is not associative: diff (-mt1 +mt2)\n%s", diff)
}
}
func newTree(entries [][]byte) *Tree {
tree := New(rfc6962.DefaultHasher)
tree.AppendData(entries...)
return tree
}
// genEntries a slice of entries of the given size.
func genEntries(size uint64) [][]byte {
entries := make([][]byte, size)
for i := range entries {
entries[i] = []byte(strconv.Itoa(i))
}
return entries
}
|
