forked from lynn9388/merkletree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
merkletree_test.go
112 lines (103 loc) · 3.22 KB
/
merkletree_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
/*
* Copyright © 2018 Lynn <[email protected]>
*
* 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
import (
"encoding/hex"
"fmt"
"strings"
"testing"
)
func TestNewMerkleTree(t *testing.T) {
mt := NewMerkleTree([][]byte{}...)
if mt != nil {
t.FailNow()
}
}
func ExampleNewMerkleTree() {
tests := [][]byte{[]byte("http"), []byte("www"), []byte("lynn"), []byte("9388"), []byte("com")}
mt := NewMerkleTree(tests...)
fmt.Println("Merkle Tree:\n" + mt.PrettyString(6, 2))
// Output:
// Merkle Tree:
// cf5744
// / \
// / \
// / \
// 1b5c1e 71b4f3
// / \
// / \
// / \
// / \
// / \
// / \
// / \
// 4b2099 19ec96
// / \ / \
// / \ / \
// / \ / \
// e0603c 7c2ecd 1502fe 6d86b7
}
func ExampleMerkleTree_GetProof() {
tests := [][]byte{[]byte("http"), []byte("www"), []byte("lynn"), []byte("9388"), []byte("com")}
mt := NewMerkleTree(tests...)
proof, _ := mt.GetProof(tests[3])
prettyTree := mt.PrettyString(6, 2)
for i, p := range proof {
hash := hex.EncodeToString(p.Hash)[:6]
prettyTree = strings.Replace(prettyTree, hash, fmt.Sprintf("%v-%v", i, hash[:4]), 1)
}
fmt.Println("Proof Path:\n" + prettyTree)
// Output:
// Proof Path:
// cf5744
// / \
// / \
// / \
// 1b5c1e 2-71b4
// / \
// / \
// / \
// / \
// / \
// / \
// / \
// 1-4b20 19ec96
// / \ / \
// / \ / \
// / \ / \
// e0603c 7c2ecd 0-1502 6d86b7
}
func TestIsProofValid(t *testing.T) {
tests := [][]byte{[]byte("http"), []byte("www"), []byte("lynn"), []byte("9388"), []byte("com")}
mt := NewMerkleTree(tests[2])
proof, err := mt.GetProof(tests[0])
if err == nil || proof != nil || IsProofValid(tests[0], proof, mt.Root.Hash) == true {
t.Error("failed in case 0")
}
proof, err = mt.GetProof(tests[2])
if err != nil || proof != nil || IsProofValid(tests[2], proof, mt.Root.Hash) == false {
t.Error("failed in case 1")
}
mt = NewMerkleTree(tests...)
proof, err = mt.GetProof(tests[0])
if err != nil || proof == nil || IsProofValid(tests[0], proof, mt.Root.Hash) == false {
t.Error("failed in case 2")
}
proof, err = mt.GetProof(tests[2])
if err != nil || proof == nil || IsProofValid(tests[2], proof, mt.Root.Hash) == false {
t.Error("failed in case 3")
}
}