forked from wealdtech/go-merkletree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
example_test.go
99 lines (84 loc) · 2.44 KB
/
example_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
// Copyright © 2018, 2019 Weald Technology Trading
// 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 merkletree_test
import (
"fmt"
merkletree "github.com/debabky/go-merkletree/v2"
)
// Example using the Merkle tree to generate and verify proofs.
func ExampleMerkleTree() {
// Data for the tree
data := [][]byte{
[]byte("Foo"),
[]byte("Bar"),
[]byte("Baz"),
}
// Create the tree
tree, err := merkletree.New(data)
if err != nil {
panic(err)
}
// Fetch the root hash of the tree
root := tree.Root()
baz := data[2]
// Generate a proof for 'Baz'
proof, err := tree.GenerateProof(baz, 0)
if err != nil {
panic(err)
}
// Verify the proof for 'Baz'
verified, err := merkletree.VerifyProof(baz, false, proof, [][]byte{root})
if err != nil {
panic(err)
}
if !verified {
panic("failed to verify proof for Baz")
}
fmt.Printf("%x\n", root)
// Output: 2c95331b1a38dba3600391a3e864f9418a271388936e54edecd916824bb54203
}
// Example using a Merkle pollard rather than a simple root.
func ExampleMerklePollard() {
// Data for the tree
data := [][]byte{
[]byte("Foo"),
[]byte("Bar"),
[]byte("Baz"),
[]byte("Qux"),
[]byte("Quux"),
[]byte("Quuz"),
}
// Create the tree
tree, err := merkletree.New(data)
if err != nil {
panic(err)
}
// Fetch the root and first level of branches as a pollard
pollard := tree.Pollard(1)
baz := data[2]
// Generate a proof for 'Baz' up to (but not including) the first level of branches
proof, err := tree.GenerateProof(baz, 1)
if err != nil {
panic(err)
}
// Verify the proof for 'Baz'
verified, err := merkletree.VerifyProof(baz, false, proof, pollard)
if err != nil {
panic(err)
}
if !verified {
panic("failed to verify proof for Baz")
}
fmt.Printf("%x\n", pollard)
// Output: [9db41fa50e69f2d9ce73367bf8fd249fa960f6a416352f473693ea79540e516d 7799922ba259c0529cdfb9f974024d45abef9b3190850bc23fc5145cf81c9592 50824d0d95f73e4228e54705834c6fdaaa7fb22e1b8934a9100cc772f2d1d5f0]
}