/
merkle.go
134 lines (123 loc) · 2.6 KB
/
merkle.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 common
import (
"bytes"
"github.com/drep-project/DREP-Chain/crypto/sha3"
"math"
)
type MerkleNode struct {
Parent *MerkleNode
LeftChild *MerkleNode
RightChild *MerkleNode
Neighbour *MerkleNode
Hash []byte
Subscript int
}
type MerkleLayer []*MerkleNode
type Merkle struct {
Root *MerkleNode
Leaves MerkleLayer
Height int
}
func NewMerkle(hashes [][]byte) *Merkle {
if hashes == nil || len(hashes) == 0 {
return &Merkle{Root: &MerkleNode{Hash: []byte{}}}
}
merkle := &Merkle{}
height := getHeight(len(hashes))
merkle.Height = height
leaves := getLeaves(hashes)
merkle.Leaves = leaves
layer := leaves
for i := 0; i < height-1; i++ {
layer = getUpperLayer(layer)
}
if len(layer) > 0 {
merkle.Root = layer[0]
} else {
merkle.Root = &MerkleNode{Hash: []byte{}}
}
return merkle
}
func getHeight(n int) int {
return int(math.Ceil(math.Log(float64(n))/math.Log(2))) + 1
}
func getLeaves(hashes [][]byte) MerkleLayer {
l := len(hashes)
leaves := make([]*MerkleNode, l)
for i := 0; i < l; i++ {
node := &MerkleNode{}
node.Hash = hashes[i]
node.Subscript = i
leaves[i] = node
}
return leaves
}
func getUpperLayer(layer MerkleLayer) MerkleLayer {
l := len(layer)
j := (l + 1) / 2
upperLayer := make([]*MerkleNode, j)
for i := 0; i < j; i++ {
node := &MerkleNode{}
lc := layer[2*i]
var rc *MerkleNode
if 2*i+1 < l {
rc = layer[2*i+1]
}
lc.Parent = node
if rc != nil {
lc.Neighbour = rc
rc.Neighbour = lc
rc.Parent = node
node.Hash = sha3.HashS256(lc.Hash, rc.Hash)
} else {
node.Hash = sha3.HashS256(lc.Hash)
}
node.LeftChild = lc
node.RightChild = rc
node.Subscript = i
upperLayer[i] = node
}
return MerkleLayer(upperLayer)
}
func (m *Merkle) getAuthorizationPath(leaf *MerkleNode) []*MerkleNode {
path := make([]*MerkleNode, m.Height)
node := leaf
for i := 0; i < m.Height; i++ {
if node.Neighbour != nil {
path[i] = node.Neighbour
} else {
path[i] = node
}
node = node.Parent
}
return path
}
func (m *Merkle) validate(leaf *MerkleNode, path []*MerkleNode) bool {
h := leaf.Hash
n := leaf
for i, node := range path {
if i == len(path)-1 {
return bytes.Equal(h, node.Hash)
}
if n != node {
if n.Subscript < node.Subscript {
h = sha3.HashS256(n.Hash, node.Hash)
} else {
h = sha3.HashS256(node.Hash, n.Hash)
}
} else {
h = sha3.HashS256(n.Hash)
}
n = n.Parent
}
return false
}
func (m *Merkle) IsOnTrie(hash []byte) bool {
for _, leaf := range m.Leaves {
if bytes.Equal(hash, leaf.Hash) {
path := m.getAuthorizationPath(leaf)
return m.validate(leaf, path)
}
}
return false
}