mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-01 15:57:39 +00:00
183 lines
7.1 KiB
Go
183 lines
7.1 KiB
Go
package forkchoice
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
"time"
|
|
|
|
"github.com/pkg/errors"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/blocks"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/helpers"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/state"
|
|
pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/shared/bytesutil"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
"go.opencensus.io/trace"
|
|
)
|
|
|
|
// OnAttestation is called whenever an attestation is received, it updates validators latest vote,
|
|
// as well as the fork choice store struct.
|
|
//
|
|
// Spec pseudocode definition:
|
|
// def on_attestation(store: Store, attestation: Attestation) -> None:
|
|
// target = attestation.data.target
|
|
//
|
|
// # Cannot calculate the current shuffling if have not seen the target
|
|
// assert target.root in store.blocks
|
|
//
|
|
// # Attestations cannot be from future epochs. If they are, delay consideration until the epoch arrives
|
|
// base_state = store.block_states[target.root].copy()
|
|
// assert store.time >= base_state.genesis_time + compute_start_slot_of_epoch(target.epoch) * SECONDS_PER_SLOT
|
|
//
|
|
// # Store target checkpoint state if not yet seen
|
|
// if target not in store.checkpoint_states:
|
|
// process_slots(base_state, compute_start_slot_of_epoch(target.epoch))
|
|
// store.checkpoint_states[target] = base_state
|
|
// target_state = store.checkpoint_states[target]
|
|
//
|
|
// # Attestations can only affect the fork choice of subsequent slots.
|
|
// # Delay consideration in the fork choice until their slot is in the past.
|
|
// attestation_slot = get_attestation_data_slot(target_state, attestation.data)
|
|
// assert store.time >= (attestation_slot + 1) * SECONDS_PER_SLOT
|
|
//
|
|
// # Get state at the `target` to validate attestation and calculate the committees
|
|
// indexed_attestation = get_indexed_attestation(target_state, attestation)
|
|
// assert is_valid_indexed_attestation(target_state, indexed_attestation)
|
|
//
|
|
// # Update latest messages
|
|
// for i in indexed_attestation.custody_bit_0_indices + indexed_attestation.custody_bit_1_indices:
|
|
// if i not in store.latest_messages or target.epoch > store.latest_messages[i].epoch:
|
|
// store.latest_messages[i] = LatestMessage(epoch=target.epoch, root=attestation.data.beacon_block_root)
|
|
func (s *Store) OnAttestation(ctx context.Context, a *ethpb.Attestation) error {
|
|
ctx, span := trace.StartSpan(ctx, "forkchoice.onAttestation")
|
|
defer span.End()
|
|
|
|
tgt := a.Data.Target
|
|
tgtSlot := helpers.StartSlot(tgt.Epoch)
|
|
|
|
// Verify beacon node has seen the target block before.
|
|
if !s.db.HasBlock(ctx, bytesutil.ToBytes32(tgt.Root)) {
|
|
return fmt.Errorf("target root %#x does not exist in db", bytesutil.Trunc(tgt.Root))
|
|
}
|
|
|
|
// Verify attestation target has had a valid pre state produced by the target block.
|
|
baseState, err := s.verifyAttPreState(ctx, tgt)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
// Verify Attestations cannot be from future epochs.
|
|
slotTime := baseState.GenesisTime + tgtSlot*params.BeaconConfig().SecondsPerSlot
|
|
currentTime := uint64(time.Now().Unix())
|
|
if slotTime > currentTime {
|
|
return fmt.Errorf("could not process attestation from the future epoch, time %d > time %d", slotTime, currentTime)
|
|
}
|
|
|
|
// Store target checkpoint state if not yet seen.
|
|
baseState, err = s.saveChkptState(ctx, baseState, tgt)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
// Verify attestations can only affect the fork choice of subsequent slots.
|
|
if err := s.verifyAttSlotTime(ctx, baseState, a.Data); err != nil {
|
|
return err
|
|
}
|
|
|
|
// Use the target state to to validate attestation and calculate the committees.
|
|
indexedAtt, err := s.verifyAttestation(ctx, baseState, a)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
// Update every validator's latest vote.
|
|
if err := s.updateAttVotes(ctx, indexedAtt, tgt.Root, tgt.Epoch); err != nil {
|
|
return err
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// verifyAttPreState validates input attested check point has a valid pre-state.
|
|
func (s *Store) verifyAttPreState(ctx context.Context, c *ethpb.Checkpoint) (*pb.BeaconState, error) {
|
|
baseState, err := s.db.State(ctx, bytesutil.ToBytes32(c.Root))
|
|
if err != nil {
|
|
return nil, errors.Wrapf(err, "could not get pre state for slot %d", helpers.StartSlot(c.Epoch))
|
|
}
|
|
if baseState == nil {
|
|
return nil, fmt.Errorf("pre state of target block %d does not exist", helpers.StartSlot(c.Epoch))
|
|
}
|
|
return baseState, nil
|
|
}
|
|
|
|
// saveChkptState saves the block root with check point to avoid excessive slot processing down the line.
|
|
func (s *Store) saveChkptState(ctx context.Context, baseState *pb.BeaconState, c *ethpb.Checkpoint) (*pb.BeaconState, error) {
|
|
h, err := hashutil.HashProto(c)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not hash justified checkpoint")
|
|
}
|
|
s.lock.RLock()
|
|
_, exists := s.checkptBlkRoot[h]
|
|
s.lock.RUnlock()
|
|
if !exists {
|
|
baseState, err = state.ProcessSlots(ctx, baseState, helpers.StartSlot(c.Epoch))
|
|
if err != nil {
|
|
return nil, errors.Wrapf(err, "could not process slots up to %d", helpers.StartSlot(c.Epoch))
|
|
}
|
|
s.lock.Lock()
|
|
defer s.lock.Unlock()
|
|
s.checkptBlkRoot[h] = bytesutil.ToBytes32(c.Root)
|
|
}
|
|
return baseState, nil
|
|
}
|
|
|
|
// verifyAttSlotTime validates input attestation is not from the future.
|
|
func (s *Store) verifyAttSlotTime(ctx context.Context, baseState *pb.BeaconState, d *ethpb.AttestationData) error {
|
|
aSlot, err := helpers.AttestationDataSlot(baseState, d)
|
|
if err != nil {
|
|
return errors.Wrap(err, "could not get attestation slot")
|
|
}
|
|
slotTime := baseState.GenesisTime + (aSlot+1)*params.BeaconConfig().SecondsPerSlot
|
|
currentTime := uint64(time.Now().Unix())
|
|
if slotTime > currentTime {
|
|
return fmt.Errorf("could not process attestation for fork choice until inclusion delay, time %d > time %d", slotTime, currentTime)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// verifyAttestation validates input attestation is valid.
|
|
func (s *Store) verifyAttestation(ctx context.Context, baseState *pb.BeaconState, a *ethpb.Attestation) (*ethpb.IndexedAttestation, error) {
|
|
indexedAtt, err := blocks.ConvertToIndexed(baseState, a)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not convert attestation to indexed attestation")
|
|
}
|
|
if err := blocks.VerifyIndexedAttestation(baseState, indexedAtt); err != nil {
|
|
return nil, errors.New("could not verify indexed attestation")
|
|
}
|
|
return indexedAtt, nil
|
|
}
|
|
|
|
// updateAttVotes updates validator's latest votes based on the incoming attestation.
|
|
func (s *Store) updateAttVotes(
|
|
ctx context.Context,
|
|
indexedAtt *ethpb.IndexedAttestation,
|
|
tgtRoot []byte,
|
|
tgtEpoch uint64) error {
|
|
for _, i := range append(indexedAtt.CustodyBit_0Indices, indexedAtt.CustodyBit_1Indices...) {
|
|
vote, err := s.db.ValidatorLatestVote(ctx, i)
|
|
if err != nil {
|
|
return errors.Wrapf(err, "could not get latest vote for validator %d", i)
|
|
}
|
|
if !s.db.HasValidatorLatestVote(ctx, i) || tgtEpoch > vote.Epoch {
|
|
if err := s.db.SaveValidatorLatestVote(ctx, i, &pb.ValidatorLatestVote{
|
|
Epoch: tgtEpoch,
|
|
Root: tgtRoot,
|
|
}); err != nil {
|
|
return errors.Wrapf(err, "could not save latest vote for validator %d", i)
|
|
}
|
|
}
|
|
}
|
|
return nil
|
|
}
|