mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-03 16:37:39 +00:00
81c53c26fb
* Update seed domains (#3872) * Remove Transfers (#3870) * Remove active index roots and compact committee roots (#3869) * Update inclusion reward (#3886) * Alter proposer selection logic (#3884) * Fix early committee bias (#3888) * Remove shards and committees (#3896) * Epoch spec tests v0.9 (#3907) * Block spec test v0.9 (#3905) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Update deposit contract (#3906) * Proto spec tests v0.9 (#3908) * Starting * Add AggregateAndProof * Unskip block util tests (#3910) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Unskip block util tests * Slot processing spec test V0.9 (#3912) * Starting * Add AggregateAndProof * Unskip slot processing mainnet test * Unskip minimal spec test for finalization (#3920) * Remove outdated interop tests (#3922) * Rm outdated interop tests * Rm test runner * Gazelle * Update validator to use proposer slot (#3919) * Fix committee assignment (#3931) * Replace shard with committee index (#3930) * Conflict * Clean up (#3933) * Remove shard filter in db (#3936) * Remove lightouse compatibility test (#3939) * Update Committee Cache for v0.9 (#3948) * Updated committee cache * Removed shuffled indices cache * Started testing run time * Lint * Fixed test * Safeguard against nil head state * address edge case * add test * Fixed TestRoundRobinSync by doubling the epochs * Unskip TestProtoCompatability (#3958) * Unskip TestProtoCompatability * Update WORKSPACE * Fix minimal config (#3959) * fix minimal configs * fix hardcoded value in test * Simplify verify att time (#3961) * update readme for deposit contract, regen bindings for vyper 0.1.0b12 (#3963) * update readme for deposit contract, regen bindings * medium * Check nil base state (#3964) * Copy Block When Receiving it From Sync (#3966) * copy block * clone for other service methods too * Change logging of Bitfield (#3956) * change logging of bits * preston's review * Unskip Beacon Server Test (#3962) * run test till the end * fix up proto message types * fmt * resolve broken tests * better error handling * fixing new logic to use archived proposer info * fix up logic * clip using the max effective balance * broken build fix with num arg mismatch * amend archive * archival logic changed * rename test * archive both proposer and attester seeds * page size 100 * further experiments * further experimentation, archivedProposerIndex seems wrong * test passes * rem log * fix broken test * fix test * gaz * fix imports * ethapis
294 lines
10 KiB
Go
294 lines
10 KiB
Go
package forkchoice
|
|
|
|
import (
|
|
"context"
|
|
"fmt"
|
|
"time"
|
|
|
|
"github.com/gogo/protobuf/proto"
|
|
"github.com/pkg/errors"
|
|
"github.com/prysmaticlabs/go-ssz"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/cache"
|
|
"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"
|
|
"github.com/sirupsen/logrus"
|
|
"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) (uint64, error) {
|
|
ctx, span := trace.StartSpan(ctx, "forkchoice.onAttestation")
|
|
defer span.End()
|
|
|
|
tgt := proto.Clone(a.Data.Target).(*ethpb.Checkpoint)
|
|
tgtSlot := helpers.StartSlot(tgt.Epoch)
|
|
|
|
// Verify beacon node has seen the target block before.
|
|
if !s.db.HasBlock(ctx, bytesutil.ToBytes32(tgt.Root)) {
|
|
return 0, 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 0, err
|
|
}
|
|
|
|
// Verify Attestations cannot be from future epochs.
|
|
if err := helpers.VerifySlotTime(baseState.GenesisTime, tgtSlot); err != nil {
|
|
return 0, errors.Wrap(err, "could not verify attestation target slot")
|
|
}
|
|
|
|
// Store target checkpoint state if not yet seen.
|
|
baseState, err = s.saveCheckpointState(ctx, baseState, tgt)
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
|
|
// Delay attestation processing until the subsequent slot.
|
|
if err := s.waitForAttInclDelay(ctx, a, baseState); err != nil {
|
|
return 0, err
|
|
}
|
|
|
|
// Verify attestations can only affect the fork choice of subsequent slots.
|
|
if err := helpers.VerifySlotTime(baseState.GenesisTime, a.Data.Slot+1); err != nil {
|
|
return 0, err
|
|
}
|
|
|
|
s.attsQueueLock.Lock()
|
|
defer s.attsQueueLock.Unlock()
|
|
atts := make([]*ethpb.Attestation, 0, len(s.attsQueue))
|
|
for root, a := range s.attsQueue {
|
|
log := log.WithFields(logrus.Fields{
|
|
"AggregatedBitfield": fmt.Sprintf("%08b", a.AggregationBits),
|
|
"Root": fmt.Sprintf("%#x", root),
|
|
})
|
|
log.Debug("Updating latest votes")
|
|
|
|
// Use the target state to to validate attestation and calculate the committees.
|
|
indexedAtt, err := s.verifyAttestation(ctx, baseState, a)
|
|
if err != nil {
|
|
log.WithError(err).Warn("Removing attestation from queue.")
|
|
delete(s.attsQueue, root)
|
|
continue
|
|
}
|
|
|
|
// Update every validator's latest vote.
|
|
if err := s.updateAttVotes(ctx, indexedAtt, tgt.Root, tgt.Epoch); err != nil {
|
|
return 0, err
|
|
}
|
|
|
|
// Mark attestation as seen we don't update votes when it appears in block.
|
|
if err := s.setSeenAtt(a); err != nil {
|
|
return 0, err
|
|
}
|
|
delete(s.attsQueue, root)
|
|
att, err := s.aggregatedAttestations(ctx, a)
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
atts = append(atts, att...)
|
|
}
|
|
|
|
if err := s.db.SaveAttestations(ctx, atts); err != nil {
|
|
return 0, err
|
|
}
|
|
|
|
return tgtSlot, 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
|
|
}
|
|
|
|
// saveCheckpointState saves and returns the processed state with the associated check point.
|
|
func (s *Store) saveCheckpointState(ctx context.Context, baseState *pb.BeaconState, c *ethpb.Checkpoint) (*pb.BeaconState, error) {
|
|
s.checkpointStateLock.Lock()
|
|
defer s.checkpointStateLock.Unlock()
|
|
cachedState, err := s.checkpointState.StateByCheckpoint(c)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not get cached checkpoint state")
|
|
}
|
|
if cachedState != nil {
|
|
return cachedState, nil
|
|
}
|
|
|
|
// Advance slots only when it's higher than current state slot.
|
|
if helpers.StartSlot(c.Epoch) > baseState.Slot {
|
|
stateCopy := proto.Clone(baseState).(*pb.BeaconState)
|
|
baseState, err = state.ProcessSlots(ctx, stateCopy, helpers.StartSlot(c.Epoch))
|
|
if err != nil {
|
|
return nil, errors.Wrapf(err, "could not process slots up to %d", helpers.StartSlot(c.Epoch))
|
|
}
|
|
}
|
|
|
|
if err := s.checkpointState.AddCheckpointState(&cache.CheckpointState{
|
|
Checkpoint: c,
|
|
State: baseState,
|
|
}); err != nil {
|
|
return nil, errors.Wrap(err, "could not saved checkpoint state to cache")
|
|
}
|
|
|
|
return baseState, nil
|
|
}
|
|
|
|
// waitForAttInclDelay waits until the next slot because attestation can only affect
|
|
// fork choice of subsequent slot. This is to delay attestation inclusion for fork choice
|
|
// until the attested slot is in the past.
|
|
func (s *Store) waitForAttInclDelay(ctx context.Context, a *ethpb.Attestation, targetState *pb.BeaconState) error {
|
|
ctx, span := trace.StartSpan(ctx, "beacon-chain.forkchoice.waitForAttInclDelay")
|
|
defer span.End()
|
|
|
|
nextSlot := a.Data.Slot + 1
|
|
duration := time.Duration(nextSlot*params.BeaconConfig().SecondsPerSlot) * time.Second
|
|
timeToInclude := time.Unix(int64(targetState.GenesisTime), 0).Add(duration)
|
|
|
|
if err := s.aggregateAttestation(ctx, a); err != nil {
|
|
return errors.Wrap(err, "could not aggregate attestation")
|
|
}
|
|
|
|
time.Sleep(time.Until(timeToInclude))
|
|
return nil
|
|
}
|
|
|
|
// aggregateAttestation aggregates the attestations in the pending queue.
|
|
func (s *Store) aggregateAttestation(ctx context.Context, att *ethpb.Attestation) error {
|
|
s.attsQueueLock.Lock()
|
|
defer s.attsQueueLock.Unlock()
|
|
root, err := ssz.HashTreeRoot(att.Data)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if a, ok := s.attsQueue[root]; ok {
|
|
a, err := helpers.AggregateAttestation(a, att)
|
|
if err != nil {
|
|
return nil
|
|
}
|
|
s.attsQueue[root] = a
|
|
return nil
|
|
}
|
|
s.attsQueue[root] = proto.Clone(att).(*ethpb.Attestation)
|
|
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(ctx, baseState, a)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not convert attestation to indexed attestation")
|
|
}
|
|
if err := blocks.VerifyIndexedAttestation(ctx, baseState, indexedAtt); err != nil {
|
|
return nil, errors.Wrap(err, "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 {
|
|
|
|
indices := append(indexedAtt.CustodyBit_0Indices, indexedAtt.CustodyBit_1Indices...)
|
|
newVoteIndices := make([]uint64, 0, len(indices))
|
|
newVotes := make([]*pb.ValidatorLatestVote, 0, len(indices))
|
|
for _, i := range indices {
|
|
vote, err := s.db.ValidatorLatestVote(ctx, i)
|
|
if err != nil {
|
|
return errors.Wrapf(err, "could not get latest vote for validator %d", i)
|
|
}
|
|
if vote == nil || tgtEpoch > vote.Epoch {
|
|
newVotes = append(newVotes, &pb.ValidatorLatestVote{
|
|
Epoch: tgtEpoch,
|
|
Root: tgtRoot,
|
|
})
|
|
newVoteIndices = append(newVoteIndices, i)
|
|
}
|
|
}
|
|
return s.db.SaveValidatorLatestVotes(ctx, newVoteIndices, newVotes)
|
|
}
|
|
|
|
// setSeenAtt sets the attestation hash in seen attestation map to true.
|
|
func (s *Store) setSeenAtt(a *ethpb.Attestation) error {
|
|
s.seenAttsLock.Lock()
|
|
defer s.seenAttsLock.Unlock()
|
|
|
|
r, err := hashutil.HashProto(a)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
s.seenAtts[r] = true
|
|
|
|
return nil
|
|
}
|
|
|
|
// aggregatedAttestation returns the aggregated attestation after checking saved one in db.
|
|
func (s *Store) aggregatedAttestations(ctx context.Context, att *ethpb.Attestation) ([]*ethpb.Attestation, error) {
|
|
r, err := ssz.HashTreeRoot(att.Data)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
saved, err := s.db.AttestationsByDataRoot(ctx, r)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if saved == nil {
|
|
return []*ethpb.Attestation{att}, nil
|
|
}
|
|
|
|
aggregated, err := helpers.AggregateAttestations(append(saved, att))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return aggregated, nil
|
|
}
|