2023-10-27 14:10:55 +00:00
|
|
|
package lpwindow
|
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
|
|
|
"context"
|
2023-11-04 10:04:46 +00:00
|
|
|
"sort"
|
|
|
|
"sync"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/ipfs/go-cid"
|
|
|
|
"go.uber.org/multierr"
|
|
|
|
"golang.org/x/xerrors"
|
|
|
|
|
2023-10-27 14:10:55 +00:00
|
|
|
ffi "github.com/filecoin-project/filecoin-ffi"
|
|
|
|
"github.com/filecoin-project/go-address"
|
|
|
|
"github.com/filecoin-project/go-bitfield"
|
|
|
|
"github.com/filecoin-project/go-state-types/abi"
|
|
|
|
"github.com/filecoin-project/go-state-types/builtin"
|
|
|
|
miner2 "github.com/filecoin-project/go-state-types/builtin/v9/miner"
|
|
|
|
"github.com/filecoin-project/go-state-types/crypto"
|
|
|
|
"github.com/filecoin-project/go-state-types/dline"
|
|
|
|
"github.com/filecoin-project/go-state-types/proof"
|
2023-11-04 10:04:46 +00:00
|
|
|
proof7 "github.com/filecoin-project/specs-actors/v7/actors/runtime/proof"
|
|
|
|
|
2023-10-27 14:10:55 +00:00
|
|
|
"github.com/filecoin-project/lotus/build"
|
|
|
|
types "github.com/filecoin-project/lotus/chain/types"
|
|
|
|
"github.com/filecoin-project/lotus/storage/sealer/storiface"
|
|
|
|
)
|
|
|
|
|
|
|
|
const disablePreChecks = false // todo config
|
|
|
|
|
|
|
|
func (t *WdPostTask) doPartition(ctx context.Context, ts *types.TipSet, maddr address.Address, di *dline.Info, partIdx uint64) (out *miner2.SubmitWindowedPoStParams, err error) {
|
|
|
|
defer func() {
|
|
|
|
if r := recover(); r != nil {
|
|
|
|
log.Errorf("recover: %s", r)
|
|
|
|
err = xerrors.Errorf("panic in doPartition: %s", r)
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
|
|
|
|
buf := new(bytes.Buffer)
|
|
|
|
if err := maddr.MarshalCBOR(buf); err != nil {
|
|
|
|
return nil, xerrors.Errorf("failed to marshal address to cbor: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
headTs, err := t.api.ChainHead(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting current head: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
rand, err := t.api.StateGetRandomnessFromBeacon(ctx, crypto.DomainSeparationTag_WindowedPoStChallengeSeed, di.Challenge, buf.Bytes(), headTs.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("failed to get chain randomness from beacon for window post (ts=%d; deadline=%d): %w", ts.Height(), di, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
parts, err := t.api.StateMinerPartitions(ctx, maddr, di.Index, ts.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting partitions: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if partIdx >= uint64(len(parts)) {
|
|
|
|
return nil, xerrors.Errorf("invalid partIdx %d (deadline has %d partitions)", partIdx, len(parts))
|
|
|
|
}
|
|
|
|
|
|
|
|
partition := parts[partIdx]
|
|
|
|
|
|
|
|
params := miner2.SubmitWindowedPoStParams{
|
|
|
|
Deadline: di.Index,
|
|
|
|
Partitions: make([]miner2.PoStPartition, 0, 1),
|
|
|
|
Proofs: nil,
|
|
|
|
}
|
|
|
|
|
|
|
|
var partitions []miner2.PoStPartition
|
|
|
|
var xsinfos []proof7.ExtendedSectorInfo
|
|
|
|
|
|
|
|
{
|
|
|
|
toProve, err := bitfield.SubtractBitField(partition.LiveSectors, partition.FaultySectors)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("removing faults from set of sectors to prove: %w", err)
|
|
|
|
}
|
|
|
|
/*if manual {
|
|
|
|
// this is a check run, we want to prove faulty sectors, even
|
|
|
|
// if they are not declared as recovering.
|
|
|
|
toProve = partition.LiveSectors
|
|
|
|
}*/
|
|
|
|
toProve, err = bitfield.MergeBitFields(toProve, partition.RecoveringSectors)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("adding recoveries to set of sectors to prove: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
good, err := toProve.Copy()
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("copy toProve: %w", err)
|
|
|
|
}
|
|
|
|
if !disablePreChecks {
|
|
|
|
good, err = t.checkSectors(ctx, maddr, toProve, ts.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("checking sectors to skip: %w", err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*good, err = bitfield.SubtractBitField(good, postSkipped)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("toProve - postSkipped: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
post skipped is legacy retry mechanism, shouldn't be needed anymore
|
|
|
|
*/
|
|
|
|
|
|
|
|
skipped, err := bitfield.SubtractBitField(toProve, good)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("toProve - good: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
sc, err := skipped.Count()
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting skipped sector count: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
skipCount := sc
|
|
|
|
|
|
|
|
ssi, err := t.sectorsForProof(ctx, maddr, good, partition.AllSectors, ts)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting sorted sector info: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(ssi) == 0 {
|
|
|
|
return nil, xerrors.Errorf("no sectors to prove")
|
|
|
|
}
|
|
|
|
|
|
|
|
xsinfos = append(xsinfos, ssi...)
|
|
|
|
partitions = append(partitions, miner2.PoStPartition{
|
|
|
|
Index: partIdx,
|
|
|
|
Skipped: skipped,
|
|
|
|
})
|
|
|
|
|
|
|
|
log.Infow("running window post",
|
|
|
|
"chain-random", rand,
|
|
|
|
"deadline", di,
|
|
|
|
"height", ts.Height(),
|
|
|
|
"skipped", skipCount)
|
|
|
|
|
|
|
|
tsStart := build.Clock.Now()
|
|
|
|
|
|
|
|
mid, err := address.IDFromAddress(maddr)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
nv, err := t.api.StateNetworkVersion(ctx, ts.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting network version: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
ppt, err := xsinfos[0].SealProof.RegisteredWindowPoStProofByNetworkVersion(nv)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("failed to get window post type: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
postOut, ps, err := t.generateWindowPoSt(ctx, ppt, abi.ActorID(mid), xsinfos, append(abi.PoStRandomness{}, rand...))
|
|
|
|
elapsed := time.Since(tsStart)
|
|
|
|
log.Infow("computing window post", "partition", partIdx, "elapsed", elapsed, "skip", len(ps), "err", err)
|
|
|
|
if err != nil {
|
|
|
|
log.Errorf("error generating window post: %s", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if err == nil {
|
|
|
|
// If we proved nothing, something is very wrong.
|
|
|
|
if len(postOut) == 0 {
|
|
|
|
log.Errorf("len(postOut) == 0")
|
|
|
|
return nil, xerrors.Errorf("received no proofs back from generate window post")
|
|
|
|
}
|
|
|
|
|
|
|
|
headTs, err := t.api.ChainHead(ctx)
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("getting current head: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
checkRand, err := t.api.StateGetRandomnessFromBeacon(ctx, crypto.DomainSeparationTag_WindowedPoStChallengeSeed, di.Challenge, buf.Bytes(), headTs.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, xerrors.Errorf("failed to get chain randomness from beacon for window post (ts=%d; deadline=%d): %w", ts.Height(), di, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if !bytes.Equal(checkRand, rand) {
|
|
|
|
// this is a check from legacy code, there it would retry with new randomness.
|
|
|
|
// here we don't retry because the current network version uses beacon randomness
|
|
|
|
// which should never change. We do keep this check tho to detect potential issues.
|
|
|
|
return nil, xerrors.Errorf("post generation randomness was different from random beacon")
|
|
|
|
}
|
|
|
|
|
|
|
|
sinfos := make([]proof7.SectorInfo, len(xsinfos))
|
|
|
|
for i, xsi := range xsinfos {
|
|
|
|
sinfos[i] = proof7.SectorInfo{
|
|
|
|
SealProof: xsi.SealProof,
|
|
|
|
SectorNumber: xsi.SectorNumber,
|
|
|
|
SealedCID: xsi.SealedCID,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if correct, err := t.verifier.VerifyWindowPoSt(ctx, proof.WindowPoStVerifyInfo{
|
|
|
|
Randomness: abi.PoStRandomness(checkRand),
|
|
|
|
Proofs: postOut,
|
|
|
|
ChallengedSectors: sinfos,
|
|
|
|
Prover: abi.ActorID(mid),
|
|
|
|
}); err != nil {
|
|
|
|
/*log.Errorw("window post verification failed", "post", postOut, "error", err)
|
|
|
|
time.Sleep(5 * time.Second)
|
|
|
|
continue todo retry loop */
|
|
|
|
} else if !correct {
|
|
|
|
/*log.Errorw("generated incorrect window post proof", "post", postOut, "error", err)
|
|
|
|
continue todo retry loop */
|
|
|
|
}
|
|
|
|
|
|
|
|
// Proof generation successful, stop retrying
|
|
|
|
//somethingToProve = true
|
|
|
|
params.Partitions = partitions
|
|
|
|
params.Proofs = postOut
|
|
|
|
//break
|
|
|
|
|
|
|
|
return ¶ms, nil
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil, xerrors.Errorf("failed to generate window post")
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *WdPostTask) checkSectors(ctx context.Context, maddr address.Address, check bitfield.BitField, tsk types.TipSetKey) (bitfield.BitField, error) {
|
|
|
|
mid, err := address.IDFromAddress(maddr)
|
|
|
|
if err != nil {
|
|
|
|
return bitfield.BitField{}, xerrors.Errorf("failed to convert to ID addr: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
sectorInfos, err := t.api.StateMinerSectors(ctx, maddr, &check, tsk)
|
|
|
|
if err != nil {
|
|
|
|
return bitfield.BitField{}, xerrors.Errorf("failed to get sector infos: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
type checkSector struct {
|
|
|
|
sealed cid.Cid
|
|
|
|
update bool
|
|
|
|
}
|
|
|
|
|
|
|
|
sectors := make(map[abi.SectorNumber]checkSector)
|
|
|
|
var tocheck []storiface.SectorRef
|
|
|
|
for _, info := range sectorInfos {
|
|
|
|
sectors[info.SectorNumber] = checkSector{
|
|
|
|
sealed: info.SealedCID,
|
|
|
|
update: info.SectorKeyCID != nil,
|
|
|
|
}
|
|
|
|
tocheck = append(tocheck, storiface.SectorRef{
|
|
|
|
ProofType: info.SealProof,
|
|
|
|
ID: abi.SectorID{
|
|
|
|
Miner: abi.ActorID(mid),
|
|
|
|
Number: info.SectorNumber,
|
|
|
|
},
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(tocheck) == 0 {
|
|
|
|
return bitfield.BitField{}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
pp, err := tocheck[0].ProofType.RegisteredWindowPoStProof()
|
|
|
|
if err != nil {
|
|
|
|
return bitfield.BitField{}, xerrors.Errorf("failed to get window PoSt proof: %w", err)
|
|
|
|
}
|
|
|
|
pp, err = pp.ToV1_1PostProof()
|
|
|
|
if err != nil {
|
|
|
|
return bitfield.BitField{}, xerrors.Errorf("failed to convert to v1_1 post proof: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
bad, err := t.faultTracker.CheckProvable(ctx, pp, tocheck, func(ctx context.Context, id abi.SectorID) (cid.Cid, bool, error) {
|
|
|
|
s, ok := sectors[id.Number]
|
|
|
|
if !ok {
|
|
|
|
return cid.Undef, false, xerrors.Errorf("sealed CID not found")
|
|
|
|
}
|
|
|
|
return s.sealed, s.update, nil
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
return bitfield.BitField{}, xerrors.Errorf("checking provable sectors: %w", err)
|
|
|
|
}
|
|
|
|
for id := range bad {
|
|
|
|
delete(sectors, id.Number)
|
|
|
|
}
|
|
|
|
|
|
|
|
log.Warnw("Checked sectors", "checked", len(tocheck), "good", len(sectors))
|
|
|
|
|
|
|
|
sbf := bitfield.New()
|
|
|
|
for s := range sectors {
|
|
|
|
sbf.Set(uint64(s))
|
|
|
|
}
|
|
|
|
|
|
|
|
return sbf, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *WdPostTask) sectorsForProof(ctx context.Context, maddr address.Address, goodSectors, allSectors bitfield.BitField, ts *types.TipSet) ([]proof7.ExtendedSectorInfo, error) {
|
|
|
|
sset, err := t.api.StateMinerSectors(ctx, maddr, &goodSectors, ts.Key())
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(sset) == 0 {
|
|
|
|
return nil, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
sectorByID := make(map[uint64]proof7.ExtendedSectorInfo, len(sset))
|
|
|
|
for _, sector := range sset {
|
|
|
|
sectorByID[uint64(sector.SectorNumber)] = proof7.ExtendedSectorInfo{
|
|
|
|
SectorNumber: sector.SectorNumber,
|
|
|
|
SealedCID: sector.SealedCID,
|
|
|
|
SealProof: sector.SealProof,
|
|
|
|
SectorKey: sector.SectorKeyCID,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
proofSectors := make([]proof7.ExtendedSectorInfo, 0, len(sset))
|
|
|
|
if err := allSectors.ForEach(func(sectorNo uint64) error {
|
|
|
|
if info, found := sectorByID[sectorNo]; found {
|
|
|
|
proofSectors = append(proofSectors, info)
|
|
|
|
} else {
|
|
|
|
//skip
|
|
|
|
// todo: testing: old logic used to put 'substitute' sectors here
|
|
|
|
// that probably isn't needed post nv19, but we do need to check that
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}); err != nil {
|
|
|
|
return nil, xerrors.Errorf("iterating partition sector bitmap: %w", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return proofSectors, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *WdPostTask) generateWindowPoSt(ctx context.Context, ppt abi.RegisteredPoStProof, minerID abi.ActorID, sectorInfo []proof.ExtendedSectorInfo, randomness abi.PoStRandomness) ([]proof.PoStProof, []abi.SectorID, error) {
|
|
|
|
var retErr error = nil
|
|
|
|
randomness[31] &= 0x3f
|
|
|
|
|
|
|
|
out := make([]proof.PoStProof, 0)
|
|
|
|
|
|
|
|
if len(sectorInfo) == 0 {
|
|
|
|
return nil, nil, xerrors.New("generate window post len(sectorInfo)=0")
|
|
|
|
}
|
|
|
|
|
|
|
|
maxPartitionSize, err := builtin.PoStProofWindowPoStPartitionSectors(ppt) // todo proxy through chain/actors
|
|
|
|
if err != nil {
|
|
|
|
return nil, nil, xerrors.Errorf("get sectors count of partition failed:%+v", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// The partitions number of this batch
|
|
|
|
// ceil(sectorInfos / maxPartitionSize)
|
|
|
|
partitionCount := uint64((len(sectorInfo) + int(maxPartitionSize) - 1) / int(maxPartitionSize))
|
|
|
|
if partitionCount > 1 {
|
|
|
|
return nil, nil, xerrors.Errorf("generateWindowPoSt partitionCount:%d, only support 1", partitionCount)
|
|
|
|
}
|
|
|
|
|
|
|
|
log.Infof("generateWindowPoSt maxPartitionSize:%d partitionCount:%d", maxPartitionSize, partitionCount)
|
|
|
|
|
|
|
|
var skipped []abi.SectorID
|
|
|
|
var flk sync.Mutex
|
|
|
|
cctx, cancel := context.WithCancel(ctx)
|
|
|
|
defer cancel()
|
|
|
|
|
|
|
|
sort.Slice(sectorInfo, func(i, j int) bool {
|
|
|
|
return sectorInfo[i].SectorNumber < sectorInfo[j].SectorNumber
|
|
|
|
})
|
|
|
|
|
|
|
|
sectorNums := make([]abi.SectorNumber, len(sectorInfo))
|
|
|
|
sectorMap := make(map[abi.SectorNumber]proof.ExtendedSectorInfo)
|
|
|
|
for i, s := range sectorInfo {
|
|
|
|
sectorNums[i] = s.SectorNumber
|
|
|
|
sectorMap[s.SectorNumber] = s
|
|
|
|
}
|
|
|
|
|
|
|
|
postChallenges, err := ffi.GeneratePoStFallbackSectorChallenges(ppt, minerID, randomness, sectorNums)
|
|
|
|
if err != nil {
|
|
|
|
return nil, nil, xerrors.Errorf("generating fallback challenges: %v", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
proofList := make([]ffi.PartitionProof, partitionCount)
|
|
|
|
var wg sync.WaitGroup
|
|
|
|
wg.Add(int(partitionCount))
|
|
|
|
|
|
|
|
for partIdx := uint64(0); partIdx < partitionCount; partIdx++ {
|
|
|
|
go func(partIdx uint64) {
|
|
|
|
defer wg.Done()
|
|
|
|
|
|
|
|
sectors := make([]storiface.PostSectorChallenge, 0)
|
|
|
|
for i := uint64(0); i < maxPartitionSize; i++ {
|
|
|
|
si := i + partIdx*maxPartitionSize
|
|
|
|
if si >= uint64(len(postChallenges.Sectors)) {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
snum := postChallenges.Sectors[si]
|
|
|
|
sinfo := sectorMap[snum]
|
|
|
|
|
|
|
|
sectors = append(sectors, storiface.PostSectorChallenge{
|
|
|
|
SealProof: sinfo.SealProof,
|
|
|
|
SectorNumber: snum,
|
|
|
|
SealedCID: sinfo.SealedCID,
|
|
|
|
Challenge: postChallenges.Challenges[snum],
|
|
|
|
Update: sinfo.SectorKey != nil,
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
pr, err := t.prover.GenerateWindowPoStAdv(cctx, ppt, minerID, sectors, int(partIdx), randomness, true)
|
|
|
|
sk := pr.Skipped
|
|
|
|
|
|
|
|
if err != nil || len(sk) > 0 {
|
|
|
|
log.Errorf("generateWindowPost part:%d, skipped:%d, sectors: %d, err: %+v", partIdx, len(sk), len(sectors), err)
|
|
|
|
flk.Lock()
|
|
|
|
skipped = append(skipped, sk...)
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
retErr = multierr.Append(retErr, xerrors.Errorf("partitionIndex:%d err:%+v", partIdx, err))
|
|
|
|
}
|
|
|
|
flk.Unlock()
|
|
|
|
}
|
|
|
|
|
|
|
|
proofList[partIdx] = ffi.PartitionProof(pr.PoStProofs)
|
|
|
|
}(partIdx)
|
|
|
|
}
|
|
|
|
|
|
|
|
wg.Wait()
|
|
|
|
|
|
|
|
/* if len(skipped) > 0 {
|
|
|
|
return nil, skipped, multierr.Append(xerrors.Errorf("some sectors (%d) were skipped", len(skipped)), retErr)
|
|
|
|
}*/
|
|
|
|
|
|
|
|
postProofs, err := ffi.MergeWindowPoStPartitionProofs(ppt, proofList)
|
|
|
|
if err != nil {
|
|
|
|
return nil, skipped, xerrors.Errorf("merge windowPoSt partition proofs: %v", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
out = append(out, *postProofs)
|
|
|
|
return out, skipped, retErr
|
|
|
|
}
|