mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-26 05:17:22 +00:00
41c8ff4c1b
* updates coinciding vars * renames receiver in sync service * Merge branch 'master' into sync-rename-receiver
116 lines
3.8 KiB
Go
116 lines
3.8 KiB
Go
package sync
|
|
|
|
import (
|
|
"context"
|
|
"sort"
|
|
|
|
"github.com/libp2p/go-libp2p-core/peer"
|
|
pubsub "github.com/libp2p/go-libp2p-pubsub"
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/blocks"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/state"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
"github.com/prysmaticlabs/prysm/shared/sliceutil"
|
|
"github.com/prysmaticlabs/prysm/shared/traceutil"
|
|
"go.opencensus.io/trace"
|
|
)
|
|
|
|
// Clients who receive an attester slashing on this topic MUST validate the conditions within VerifyAttesterSlashing before
|
|
// forwarding it across the network.
|
|
func (s *Service) validateAttesterSlashing(ctx context.Context, pid peer.ID, msg *pubsub.Message) pubsub.ValidationResult {
|
|
// Validation runs on publish (not just subscriptions), so we should approve any message from
|
|
// ourselves.
|
|
if pid == s.p2p.PeerID() {
|
|
return pubsub.ValidationAccept
|
|
}
|
|
|
|
// The head state will be too far away to validate any slashing.
|
|
if s.initialSync.Syncing() {
|
|
return pubsub.ValidationIgnore
|
|
}
|
|
|
|
ctx, span := trace.StartSpan(ctx, "sync.validateAttesterSlashing")
|
|
defer span.End()
|
|
|
|
m, err := s.decodePubsubMessage(msg)
|
|
if err != nil {
|
|
log.WithError(err).Error("Failed to decode message")
|
|
traceutil.AnnotateError(span, err)
|
|
return pubsub.ValidationReject
|
|
}
|
|
slashing, ok := m.(*ethpb.AttesterSlashing)
|
|
if !ok {
|
|
return pubsub.ValidationReject
|
|
}
|
|
|
|
if slashing == nil || slashing.Attestation_1 == nil || slashing.Attestation_2 == nil {
|
|
return pubsub.ValidationReject
|
|
}
|
|
if s.hasSeenAttesterSlashingIndices(slashing.Attestation_1.AttestingIndices, slashing.Attestation_2.AttestingIndices) {
|
|
return pubsub.ValidationIgnore
|
|
}
|
|
|
|
// Retrieve head state, advance state to the epoch slot used specified in slashing message.
|
|
headState, err := s.chain.HeadState(ctx)
|
|
if err != nil {
|
|
return pubsub.ValidationIgnore
|
|
}
|
|
slashSlot := slashing.Attestation_1.Data.Target.Epoch * params.BeaconConfig().SlotsPerEpoch
|
|
if headState.Slot() < slashSlot {
|
|
if ctx.Err() != nil {
|
|
return pubsub.ValidationIgnore
|
|
}
|
|
|
|
var err error
|
|
headState, err = state.ProcessSlots(ctx, headState, slashSlot)
|
|
if err != nil {
|
|
return pubsub.ValidationIgnore
|
|
}
|
|
}
|
|
|
|
if err := blocks.VerifyAttesterSlashing(ctx, headState, slashing); err != nil {
|
|
return pubsub.ValidationReject
|
|
}
|
|
|
|
msg.ValidatorData = slashing // Used in downstream subscriber
|
|
return pubsub.ValidationAccept
|
|
}
|
|
|
|
// Returns true if the node has already received a valid attester slashing with the attesting indices.
|
|
func (s *Service) hasSeenAttesterSlashingIndices(indices1 []uint64, indices2 []uint64) bool {
|
|
s.seenAttesterSlashingLock.RLock()
|
|
defer s.seenAttesterSlashingLock.RUnlock()
|
|
|
|
slashableIndices := sliceutil.IntersectionUint64(indices1, indices2)
|
|
sort.SliceStable(slashableIndices, func(i, j int) bool {
|
|
return slashableIndices[i] < slashableIndices[j]
|
|
})
|
|
IndicesInBytes := make([]byte, 0, len(slashableIndices))
|
|
for _, i := range slashableIndices {
|
|
IndicesInBytes = append(IndicesInBytes, byte(i))
|
|
}
|
|
b := hashutil.FastSum256(IndicesInBytes)
|
|
|
|
_, seen := s.seenAttesterSlashingCache.Get(b)
|
|
return seen
|
|
}
|
|
|
|
// Set attester slashing indices in attester slashing cache.
|
|
func (s *Service) setAttesterSlashingIndicesSeen(indices1 []uint64, indices2 []uint64) {
|
|
s.seenAttesterSlashingLock.Lock()
|
|
defer s.seenAttesterSlashingLock.Unlock()
|
|
|
|
slashableIndices := sliceutil.IntersectionUint64(indices1, indices2)
|
|
sort.SliceStable(slashableIndices, func(i, j int) bool {
|
|
return slashableIndices[i] < slashableIndices[j]
|
|
})
|
|
IndicesInBytes := make([]byte, 0, len(slashableIndices))
|
|
for _, i := range slashableIndices {
|
|
IndicesInBytes = append(IndicesInBytes, byte(i))
|
|
}
|
|
b := hashutil.FastSum256(IndicesInBytes)
|
|
|
|
s.seenAttesterSlashingCache.Add(b, true)
|
|
}
|