mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-26 05:17:22 +00:00
149d3b84fa
* Check attestation target checkpoint is within current or previous epoch * reject bad att where slot does not match target * Add test, reduce redundant check
167 lines
6.7 KiB
Go
167 lines
6.7 KiB
Go
package helpers
|
|
|
|
import (
|
|
"encoding/binary"
|
|
"fmt"
|
|
"time"
|
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/shared/bls"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
"github.com/prysmaticlabs/prysm/shared/timeutils"
|
|
)
|
|
|
|
// IsAggregator returns true if the signature is from the input validator. The committee
|
|
// count is provided as an argument rather than imported implementation from spec. Having
|
|
// committee count as an argument allows cheaper computation at run time.
|
|
//
|
|
// Spec pseudocode definition:
|
|
// def is_aggregator(state: BeaconState, slot: Slot, index: CommitteeIndex, slot_signature: BLSSignature) -> bool:
|
|
// committee = get_beacon_committee(state, slot, index)
|
|
// modulo = max(1, len(committee) // TARGET_AGGREGATORS_PER_COMMITTEE)
|
|
// return bytes_to_int(hash(slot_signature)[0:8]) % modulo == 0
|
|
func IsAggregator(committeeCount uint64, slotSig []byte) (bool, error) {
|
|
modulo := uint64(1)
|
|
if committeeCount/params.BeaconConfig().TargetAggregatorsPerCommittee > 1 {
|
|
modulo = committeeCount / params.BeaconConfig().TargetAggregatorsPerCommittee
|
|
}
|
|
|
|
b := hashutil.Hash(slotSig)
|
|
return binary.LittleEndian.Uint64(b[:8])%modulo == 0, nil
|
|
}
|
|
|
|
// AggregateSignature returns the aggregated signature of the input attestations.
|
|
//
|
|
// Spec pseudocode definition:
|
|
// def get_aggregate_signature(attestations: Sequence[Attestation]) -> BLSSignature:
|
|
// signatures = [attestation.signature for attestation in attestations]
|
|
// return bls_aggregate_signatures(signatures)
|
|
func AggregateSignature(attestations []*ethpb.Attestation) (bls.Signature, error) {
|
|
sigs := make([]bls.Signature, len(attestations))
|
|
var err error
|
|
for i := 0; i < len(sigs); i++ {
|
|
sigs[i], err = bls.SignatureFromBytes(attestations[i].Signature)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return bls.AggregateSignatures(sigs), nil
|
|
}
|
|
|
|
// IsAggregated returns true if the attestation is an aggregated attestation,
|
|
// false otherwise.
|
|
func IsAggregated(attestation *ethpb.Attestation) bool {
|
|
return attestation.AggregationBits.Count() > 1
|
|
}
|
|
|
|
// ComputeSubnetForAttestation returns the subnet for which the provided attestation will be broadcasted to.
|
|
// This differs from the spec definition by instead passing in the active validators indices in the attestation's
|
|
// given epoch.
|
|
//
|
|
// Spec pseudocode definition:
|
|
// def compute_subnet_for_attestation(state: BeaconState, attestation: Attestation) -> uint64:
|
|
// """
|
|
// Compute the correct subnet for an attestation for Phase 0.
|
|
// Note, this mimics expected Phase 1 behavior where attestations will be mapped to their shard subnet.
|
|
// """
|
|
// slots_since_epoch_start = attestation.data.slot % SLOTS_PER_EPOCH
|
|
// committees_since_epoch_start = get_committee_count_at_slot(state, attestation.data.slot) * slots_since_epoch_start
|
|
// return (committees_since_epoch_start + attestation.data.index) % ATTESTATION_SUBNET_COUNT
|
|
func ComputeSubnetForAttestation(activeValCount uint64, att *ethpb.Attestation) uint64 {
|
|
return ComputeSubnetFromCommitteeAndSlot(activeValCount, att.Data.CommitteeIndex, att.Data.Slot)
|
|
}
|
|
|
|
// ComputeSubnetFromCommitteeAndSlot is a flattened version of ComputeSubnetForAttestation where we only pass in
|
|
// the relevant fields from the attestation as function arguments.
|
|
//
|
|
// Spec pseudocode definition:
|
|
// def compute_subnet_for_attestation(state: BeaconState, attestation: Attestation) -> uint64:
|
|
// """
|
|
// Compute the correct subnet for an attestation for Phase 0.
|
|
// Note, this mimics expected Phase 1 behavior where attestations will be mapped to their shard subnet.
|
|
// """
|
|
// slots_since_epoch_start = attestation.data.slot % SLOTS_PER_EPOCH
|
|
// committees_since_epoch_start = get_committee_count_at_slot(state, attestation.data.slot) * slots_since_epoch_start
|
|
// return (committees_since_epoch_start + attestation.data.index) % ATTESTATION_SUBNET_COUNT
|
|
func ComputeSubnetFromCommitteeAndSlot(activeValCount, comIdx, attSlot uint64) uint64 {
|
|
slotSinceStart := SlotsSinceEpochStarts(attSlot)
|
|
comCount := SlotCommitteeCount(activeValCount)
|
|
commsSinceStart := comCount * slotSinceStart
|
|
computedSubnet := (commsSinceStart + comIdx) % params.BeaconNetworkConfig().AttestationSubnetCount
|
|
return computedSubnet
|
|
}
|
|
|
|
// ValidateAttestationTime Validates that the incoming attestation is in the desired time range.
|
|
// An attestation is valid only if received within the last ATTESTATION_PROPAGATION_SLOT_RANGE
|
|
// slots.
|
|
//
|
|
// Example:
|
|
// ATTESTATION_PROPAGATION_SLOT_RANGE = 5
|
|
// current_slot = 100
|
|
// invalid_attestation_slot = 92
|
|
// invalid_attestation_slot = 101
|
|
// valid_attestation_slot = 98
|
|
// In the attestation must be within the range of 95 to 100 in the example above.
|
|
func ValidateAttestationTime(attSlot uint64, genesisTime time.Time) error {
|
|
if err := ValidateSlotClock(attSlot, uint64(genesisTime.Unix())); err != nil {
|
|
return err
|
|
}
|
|
attTime, err := SlotToTime(uint64(genesisTime.Unix()), attSlot)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
currentSlot := SlotsSince(genesisTime)
|
|
|
|
// A clock disparity allows for minor tolerances outside of the expected range. This value is
|
|
// usually small, less than 1 second.
|
|
clockDisparity := params.BeaconNetworkConfig().MaximumGossipClockDisparity
|
|
|
|
// An attestation cannot be from the future, so the upper bounds is set to now, with a minor
|
|
// tolerance for peer clock disparity.
|
|
upperBounds := timeutils.Now().Add(clockDisparity)
|
|
|
|
// An attestation cannot be older than the current slot - attestation propagation slot range
|
|
// with a minor tolerance for peer clock disparity.
|
|
lowerBoundsSlot := uint64(0)
|
|
if currentSlot > params.BeaconNetworkConfig().AttestationPropagationSlotRange {
|
|
lowerBoundsSlot = currentSlot - params.BeaconNetworkConfig().AttestationPropagationSlotRange
|
|
}
|
|
lowerTime, err := SlotToTime(uint64(genesisTime.Unix()), lowerBoundsSlot)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
lowerBounds := lowerTime.Add(-clockDisparity)
|
|
|
|
// Verify attestation slot within the time range.
|
|
if attTime.Before(lowerBounds) || attTime.After(upperBounds) {
|
|
return fmt.Errorf(
|
|
"attestation slot %d not within attestation propagation range of %d to %d (current slot)",
|
|
attSlot,
|
|
lowerBoundsSlot,
|
|
currentSlot,
|
|
)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// VerifyCheckpointEpoch is within current epoch and previous epoch
|
|
// with respect to current time. Returns true if it's within, false if it's not.
|
|
func VerifyCheckpointEpoch(c *ethpb.Checkpoint, genesis time.Time) bool {
|
|
now := uint64(timeutils.Now().Unix())
|
|
genesisTime := uint64(genesis.Unix())
|
|
currentSlot := (now - genesisTime) / params.BeaconConfig().SecondsPerSlot
|
|
currentEpoch := SlotToEpoch(currentSlot)
|
|
|
|
var prevEpoch uint64
|
|
if currentEpoch > 1 {
|
|
prevEpoch = currentEpoch - 1
|
|
}
|
|
|
|
if c.Epoch != prevEpoch && c.Epoch != currentEpoch {
|
|
return false
|
|
}
|
|
|
|
return true
|
|
}
|