-
Notifications
You must be signed in to change notification settings - Fork 2
/
single.go
62 lines (51 loc) · 1.45 KB
/
single.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
/*
* Copyright 2023 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 proof
import (
"encoding/binary"
"fmt"
"math"
ssz "github.com/ferranbt/fastssz"
)
type SingleProof struct {
ssz *ssz.Proof
}
func (s *SingleProof) SSZ() *ssz.Proof {
return s.ssz
}
func (s *SingleProof) Leaf() []byte {
return s.ssz.Leaf
}
func NewSingleProof(data []byte) (*SingleProof, error) {
ssz := &ssz.Proof{}
proofType := int(data[0])
if proofType != 0 {
return nil, fmt.Errorf("invalid proof type. %d", proofType)
}
dataOffset := 1
idx := binary.LittleEndian.Uint64(data[dataOffset : dataOffset+8])
ssz.Index = int(idx)
dataOffset += 8
ssz.Leaf = data[dataOffset : dataOffset+32]
dataOffset += 32
leafCount := int(math.Log2(float64(ssz.Index)))
ssz.Hashes = make([][]byte, leafCount, leafCount)
for i := 0; i < leafCount; i++ {
ssz.Hashes[i] = data[dataOffset : dataOffset+32]
dataOffset += 32
}
return &SingleProof{ssz: ssz}, nil
}