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
|
// Copyright (C) 2019-2023 Algorand, Inc.
// This file is part of go-algorand
//
// go-algorand is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// go-algorand is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with go-algorand. If not, see <https://www.gnu.org/licenses/>.
package merklearray
import (
"hash"
"github.com/algorand/go-algorand/crypto"
"github.com/algorand/go-algorand/protocol"
)
// A Layer of the Merkle tree consists of a dense array of hashes at that
// level of the tree. Hashes beyond the end of the array (e.g., if the
// number of leaves is not an exact power of 2) are implicitly zero.
//
//msgp:allocbound Layer MaxNumLeavesOnEncodedTree
type Layer []crypto.GenericDigest
// A pair represents an internal node in the Merkle tree.
type pair struct {
l crypto.GenericDigest
r crypto.GenericDigest
hashDigestSize int
}
func (p pair) ToBeHashed() (protocol.HashID, []byte) {
// hashing of internal node will always be fixed length.
// If one of the children is missing we use [0...0].
// The size of the slice is based on the relevant hash function output size
buf := make([]byte, 2*p.hashDigestSize)
copy(buf[:], p.l[:])
copy(buf[len(p.l):], p.r[:])
return protocol.MerkleArrayNode, buf
}
func upWorker(ws *workerState, in Layer, out Layer, h hash.Hash) {
defer ws.wg.Done()
ws.started()
batchSize := uint64(2)
for {
off := ws.next(batchSize)
if off >= ws.maxidx {
break
}
for i := off; i < off+batchSize && i < ws.maxidx; i += 2 {
var p pair
// we set the output size of the relevant hash function to the pair struct.
// This will allow us to allocate the hash input buffer for the internal node
p.hashDigestSize = h.Size()
p.l = in[i]
if i+1 < ws.maxidx {
p.r = in[i+1]
}
out[i/2] = crypto.GenericHashObj(h, p)
}
batchSize += 2
}
}
|
