-
Notifications
You must be signed in to change notification settings - Fork 40
/
merkle.go
100 lines (87 loc) · 2.05 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
/*
* Copyright 2021 ICON Foundation
*
* 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 merkle
import (
"bytes"
"fmt"
"github.com/icon-project/goloop/common/crypto"
)
type Item interface {
Hash() []byte
}
type HashedItem []byte
func (i HashedItem) Hash() []byte {
return i
}
func (i HashedItem) String() string {
return fmt.Sprintf("hash(%#x)", []byte(i))
}
type ValueItem []byte
func (i ValueItem) Hash() []byte {
if i == nil {
return nil
}
if len(i) == crypto.HashLen {
return i
}
return crypto.SHA3Sum256(i)
}
func (i ValueItem) String() string {
return fmt.Sprintf("value(%#x)", []byte(i))
}
var nullHashBytes = make([]byte, crypto.HashLen)
func getHash(i Item) []byte {
if i == nil {
return nullHashBytes
}
if hv := i.Hash(); hv == nil {
return nullHashBytes
} else {
return hv
}
}
func mergeWithBytes(a, b Item) Item {
bs := make([]byte, 0, crypto.HashLen*2)
bs = append(bs, getHash(a)...)
bs = append(bs, getHash(b)...)
return HashedItem(crypto.SHA3Sum256(bs))
}
func hashToBytes(v []byte) []byte {
if bytes.Equal(v, nullHashBytes) {
return nil
}
return v
}
func CalcHashOfList(items []Item) []byte {
if len(items) == 0 {
return nil
}
merge := mergeWithBytes
entries := make([]Item, len(items))
copy(entries, items)
for len(entries) > 1 {
var idx int
for idx = 0; idx < len(entries); idx += 2 {
if idx+1 < len(entries) {
entries[idx/2] = merge(entries[idx], entries[idx+1])
} else {
entries[idx/2] = entries[idx]
}
}
entries = entries[0 : idx/2]
}
return hashToBytes(getHash(entries[0]))
}