-
Notifications
You must be signed in to change notification settings - Fork 136
/
distributed.go
219 lines (182 loc) · 4.77 KB
/
distributed.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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
//go:build cgo
// +build cgo
package ffi
import (
"github.com/filecoin-project/filecoin-ffi/cgo"
"github.com/filecoin-project/go-state-types/abi"
"github.com/filecoin-project/go-state-types/proof"
)
type FallbackChallenges struct {
Sectors []abi.SectorNumber
Challenges map[abi.SectorNumber][]uint64
}
// GenerateWinningPoStSectorChallenge
func GeneratePoStFallbackSectorChallenges(
proofType abi.RegisteredPoStProof,
minerID abi.ActorID,
randomness abi.PoStRandomness,
sectorIds []abi.SectorNumber,
) (*FallbackChallenges, error) {
proverID, err := toProverID(minerID)
if err != nil {
return nil, err
}
pp, err := toFilRegisteredPoStProof(proofType)
if err != nil {
return nil, err
}
// this should be a simple cast..
sectorIdsRaw := make([]uint64, len(sectorIds))
for i := range sectorIds {
sectorIdsRaw[i] = uint64(sectorIds[i])
}
randomnessBytes := cgo.AsByteArray32(randomness)
ids, challenges, err := cgo.GenerateFallbackSectorChallenges(pp, &randomnessBytes, cgo.AsSliceRefUint64(sectorIdsRaw), &proverID)
if err != nil {
return nil, err
}
out := FallbackChallenges{
Sectors: make([]abi.SectorNumber, len(ids)),
Challenges: make(map[abi.SectorNumber][]uint64),
}
for idx := range ids {
secNum := abi.SectorNumber(ids[idx])
out.Sectors[idx] = secNum
out.Challenges[secNum] = challenges[idx]
}
return &out, nil
}
func GenerateSingleVanillaProof(
replica PrivateSectorInfo,
challenges []uint64,
) ([]byte, error) {
rep, err := toFilPrivateReplicaInfo(replica)
if err != nil {
return nil, err
}
return cgo.GenerateSingleVanillaProof(rep, cgo.AsSliceRefUint64(challenges))
}
func GenerateWinningPoStWithVanilla(
proofType abi.RegisteredPoStProof,
minerID abi.ActorID,
randomness abi.PoStRandomness,
proofs [][]byte,
) ([]proof.PoStProof, error) {
pp, err := toFilRegisteredPoStProof(proofType)
if err != nil {
return nil, err
}
proverID, err := toProverID(minerID)
if err != nil {
return nil, err
}
fproofs, cleanup := toVanillaProofs(proofs)
defer cleanup()
randomnessBytes := cgo.AsByteArray32(randomness)
resp, err := cgo.GenerateWinningPoStWithVanilla(pp, &randomnessBytes, &proverID, cgo.AsSliceRefSliceBoxedUint8(fproofs))
if err != nil {
return nil, err
}
out, err := fromFilPoStProofs(resp)
if err != nil {
return nil, err
}
return out, nil
}
func GenerateWindowPoStWithVanilla(
proofType abi.RegisteredPoStProof,
minerID abi.ActorID,
randomness abi.PoStRandomness,
proofs [][]byte,
) ([]proof.PoStProof, error) {
pp, err := toFilRegisteredPoStProof(proofType)
if err != nil {
return nil, err
}
proverID, err := toProverID(minerID)
if err != nil {
return nil, err
}
fproofs, cleaner := toVanillaProofs(proofs)
defer cleaner()
randomnessBytes := cgo.AsByteArray32(randomness)
rawProofs, _, err := cgo.GenerateWindowPoStWithVanilla(pp, &randomnessBytes, &proverID, cgo.AsSliceRefSliceBoxedUint8(fproofs))
if err != nil {
return nil, err
}
out, err := fromFilPoStProofs(rawProofs)
if err != nil {
return nil, err
}
return out, nil
}
type PartitionProof proof.PoStProof
func GenerateSinglePartitionWindowPoStWithVanilla(
proofType abi.RegisteredPoStProof,
minerID abi.ActorID,
randomness abi.PoStRandomness,
proofs [][]byte,
partitionIndex uint,
) (*PartitionProof, error) {
pp, err := toFilRegisteredPoStProof(proofType)
if err != nil {
return nil, err
}
proverID, err := toProverID(minerID)
if err != nil {
return nil, err
}
fproofs, cleaner := toVanillaProofs(proofs)
defer cleaner()
randomnessBytes := cgo.AsByteArray32(randomness)
resp, _, err := cgo.GenerateSingleWindowPoStWithVanilla(
pp,
&randomnessBytes,
&proverID,
cgo.AsSliceRefSliceBoxedUint8(fproofs),
partitionIndex,
)
if err != nil {
return nil, err
}
dpp, err := fromFilRegisteredPoStProof(resp.RegisteredProof)
if err != nil {
return nil, err
}
out := PartitionProof{
PoStProof: dpp,
ProofBytes: resp.Proof,
}
return &out, nil
}
func MergeWindowPoStPartitionProofs(
proofType abi.RegisteredPoStProof,
partitionProofs []PartitionProof,
) (*proof.PoStProof, error) {
pp, err := toFilRegisteredPoStProof(proofType)
if err != nil {
return nil, err
}
fproofs, cleaner := toPartitionProofs(partitionProofs)
defer cleaner()
resp, err := cgo.MergeWindowPoStPartitionProofs(pp, cgo.AsSliceRefSliceBoxedUint8(fproofs))
if err != nil {
return nil, err
}
dpp, err := fromFilRegisteredPoStProof(resp.RegisteredProof)
if err != nil {
return nil, err
}
out := proof.PoStProof{
PoStProof: dpp,
ProofBytes: resp.Proof,
}
return &out, nil
}
func toPartitionProofs(src []PartitionProof) ([]cgo.SliceBoxedUint8, func()) {
out := make([]cgo.SliceBoxedUint8, len(src))
for idx := range out {
out[idx] = cgo.AllocSliceBoxedUint8(src[idx].ProofBytes)
}
return out, makeCleanerSBU(out, len(src))
}