package altair import ( "context" "github.com/pkg/errors" "github.com/prysmaticlabs/prysm/beacon-chain/core/epoch/precompute" "github.com/prysmaticlabs/prysm/beacon-chain/core/helpers" "github.com/prysmaticlabs/prysm/beacon-chain/core/time" "github.com/prysmaticlabs/prysm/beacon-chain/state" "github.com/prysmaticlabs/prysm/config/params" "github.com/prysmaticlabs/prysm/math" "github.com/prysmaticlabs/prysm/runtime/version" "go.opencensus.io/trace" ) // InitializePrecomputeValidators precomputes individual validator for its attested balances and the total sum of validators attested balances of the epoch. func InitializePrecomputeValidators(ctx context.Context, beaconState state.BeaconStateAltair) ([]*precompute.Validator, *precompute.Balance, error) { _, span := trace.StartSpan(ctx, "altair.InitializePrecomputeValidators") defer span.End() vals := make([]*precompute.Validator, beaconState.NumValidators()) bal := &precompute.Balance{} prevEpoch := time.PrevEpoch(beaconState) currentEpoch := time.CurrentEpoch(beaconState) inactivityScores, err := beaconState.InactivityScores() if err != nil { return nil, nil, err } // This shouldn't happen with a correct beacon state, // but rather be safe to defend against index out of bound panics. if beaconState.NumValidators() != len(inactivityScores) { return nil, nil, errors.New("num of validators is different than num of inactivity scores") } if err := beaconState.ReadFromEveryValidator(func(idx int, val state.ReadOnlyValidator) error { // Set validator's balance, inactivity score and slashed/withdrawable status. v := &precompute.Validator{ CurrentEpochEffectiveBalance: val.EffectiveBalance(), InactivityScore: inactivityScores[idx], IsSlashed: val.Slashed(), IsWithdrawableCurrentEpoch: currentEpoch >= val.WithdrawableEpoch(), } // Set validator's active status for current epoch. if helpers.IsActiveValidatorUsingTrie(val, currentEpoch) { v.IsActiveCurrentEpoch = true bal.ActiveCurrentEpoch, err = math.Add64(bal.ActiveCurrentEpoch, val.EffectiveBalance()) if err != nil { return err } } // Set validator's active status for preivous epoch. if helpers.IsActiveValidatorUsingTrie(val, prevEpoch) { v.IsActivePrevEpoch = true bal.ActivePrevEpoch, err = math.Add64(bal.ActivePrevEpoch, val.EffectiveBalance()) if err != nil { return err } } vals[idx] = v return nil }); err != nil { return nil, nil, errors.Wrap(err, "could not read every validator") } return vals, bal, nil } // ProcessInactivityScores of beacon chain. This updates inactivity scores of beacon chain and // updates the precompute validator struct for later processing. The inactivity scores work as following: // For fully inactive validators and perfect active validators, the effect is the same as before Altair. // For a validator is inactive and the chain fails to finalize, the inactivity score increases by a fixed number, the total loss after N epochs is proportional to N**2/2. // For imperfectly active validators. The inactivity score's behavior is specified by this function: // If a validator fails to submit an attestation with the correct target, their inactivity score goes up by 4. // If they successfully submit an attestation with the correct source and target, their inactivity score drops by 1 // If the chain has recently finalized, each validator's score drops by 16. func ProcessInactivityScores( ctx context.Context, beaconState state.BeaconState, vals []*precompute.Validator, ) (state.BeaconState, []*precompute.Validator, error) { _, span := trace.StartSpan(ctx, "altair.ProcessInactivityScores") defer span.End() cfg := params.BeaconConfig() if time.CurrentEpoch(beaconState) == cfg.GenesisEpoch { return beaconState, vals, nil } inactivityScores, err := beaconState.InactivityScores() if err != nil { return nil, nil, err } bias := cfg.InactivityScoreBias recoveryRate := cfg.InactivityScoreRecoveryRate prevEpoch := time.PrevEpoch(beaconState) finalizedEpoch := beaconState.FinalizedCheckpointEpoch() for i, v := range vals { if !precompute.EligibleForRewards(v) { continue } if v.IsPrevEpochTargetAttester && !v.IsSlashed { // Decrease inactivity score when validator gets target correct. if v.InactivityScore > 0 { v.InactivityScore -= 1 } } else { v.InactivityScore, err = math.Add64(v.InactivityScore, bias) if err != nil { return nil, nil, err } } if !helpers.IsInInactivityLeak(prevEpoch, finalizedEpoch) { score := recoveryRate // Prevents underflow below 0. if score > v.InactivityScore { score = v.InactivityScore } v.InactivityScore -= score } inactivityScores[i] = v.InactivityScore } if err := beaconState.SetInactivityScores(inactivityScores); err != nil { return nil, nil, err } return beaconState, vals, nil } // ProcessEpochParticipation processes the epoch participation in state and updates individual validator's pre computes, // it also tracks and updates epoch attesting balances. // Spec code: // if epoch == get_current_epoch(state): // epoch_participation = state.current_epoch_participation // else: // epoch_participation = state.previous_epoch_participation // active_validator_indices = get_active_validator_indices(state, epoch) // participating_indices = [i for i in active_validator_indices if has_flag(epoch_participation[i], flag_index)] // return set(filter(lambda index: not state.validators[index].slashed, participating_indices)) func ProcessEpochParticipation( ctx context.Context, beaconState state.BeaconState, bal *precompute.Balance, vals []*precompute.Validator, ) ([]*precompute.Validator, *precompute.Balance, error) { _, span := trace.StartSpan(ctx, "altair.ProcessEpochParticipation") defer span.End() cp, err := beaconState.CurrentEpochParticipation() if err != nil { return nil, nil, err } cfg := params.BeaconConfig() targetIdx := cfg.TimelyTargetFlagIndex sourceIdx := cfg.TimelySourceFlagIndex headIdx := cfg.TimelyHeadFlagIndex for i, b := range cp { has, err := HasValidatorFlag(b, sourceIdx) if err != nil { return nil, nil, err } if has && vals[i].IsActiveCurrentEpoch { vals[i].IsCurrentEpochAttester = true } has, err = HasValidatorFlag(b, targetIdx) if err != nil { return nil, nil, err } if has && vals[i].IsActiveCurrentEpoch { vals[i].IsCurrentEpochAttester = true vals[i].IsCurrentEpochTargetAttester = true } } pp, err := beaconState.PreviousEpochParticipation() if err != nil { return nil, nil, err } for i, b := range pp { has, err := HasValidatorFlag(b, sourceIdx) if err != nil { return nil, nil, err } if has && vals[i].IsActivePrevEpoch { vals[i].IsPrevEpochAttester = true vals[i].IsPrevEpochSourceAttester = true } has, err = HasValidatorFlag(b, targetIdx) if err != nil { return nil, nil, err } if has && vals[i].IsActivePrevEpoch { vals[i].IsPrevEpochAttester = true vals[i].IsPrevEpochTargetAttester = true } has, err = HasValidatorFlag(b, headIdx) if err != nil { return nil, nil, err } if has && vals[i].IsActivePrevEpoch { vals[i].IsPrevEpochHeadAttester = true } } bal = precompute.UpdateBalance(vals, bal, beaconState.Version()) return vals, bal, nil } // ProcessRewardsAndPenaltiesPrecompute processes the rewards and penalties of individual validator. // This is an optimized version by passing in precomputed validator attesting records and and total epoch balances. func ProcessRewardsAndPenaltiesPrecompute( beaconState state.BeaconStateAltair, bal *precompute.Balance, vals []*precompute.Validator, ) (state.BeaconStateAltair, error) { // Don't process rewards and penalties in genesis epoch. cfg := params.BeaconConfig() if time.CurrentEpoch(beaconState) == cfg.GenesisEpoch { return beaconState, nil } numOfVals := beaconState.NumValidators() // Guard against an out-of-bounds using validator balance precompute. if len(vals) != numOfVals || len(vals) != beaconState.BalancesLength() { return beaconState, errors.New("validator registries not the same length as state's validator registries") } attsRewards, attsPenalties, err := AttestationsDelta(beaconState, bal, vals) if err != nil { return nil, errors.Wrap(err, "could not get attestation delta") } balances := beaconState.Balances() for i := 0; i < numOfVals; i++ { vals[i].BeforeEpochTransitionBalance = balances[i] // Compute the post balance of the validator after accounting for the // attester and proposer rewards and penalties. balances[i], err = helpers.IncreaseBalanceWithVal(balances[i], attsRewards[i]) if err != nil { return nil, err } balances[i] = helpers.DecreaseBalanceWithVal(balances[i], attsPenalties[i]) vals[i].AfterEpochTransitionBalance = balances[i] } if err := beaconState.SetBalances(balances); err != nil { return nil, errors.Wrap(err, "could not set validator balances") } return beaconState, nil } // AttestationsDelta computes and returns the rewards and penalties differences for individual validators based on the // voting records. func AttestationsDelta(beaconState state.BeaconState, bal *precompute.Balance, vals []*precompute.Validator) (rewards, penalties []uint64, err error) { numOfVals := beaconState.NumValidators() rewards = make([]uint64, numOfVals) penalties = make([]uint64, numOfVals) cfg := params.BeaconConfig() prevEpoch := time.PrevEpoch(beaconState) finalizedEpoch := beaconState.FinalizedCheckpointEpoch() increment := cfg.EffectiveBalanceIncrement factor := cfg.BaseRewardFactor baseRewardMultiplier := increment * factor / math.IntegerSquareRoot(bal.ActiveCurrentEpoch) leak := helpers.IsInInactivityLeak(prevEpoch, finalizedEpoch) // Modified in Altair and Bellatrix. var inactivityDenominator uint64 bias := cfg.InactivityScoreBias switch beaconState.Version() { case version.Altair: inactivityDenominator = bias * cfg.InactivityPenaltyQuotientAltair case version.Bellatrix: inactivityDenominator = bias * cfg.InactivityPenaltyQuotientBellatrix default: return nil, nil, errors.Errorf("invalid state type version: %T", beaconState.Version()) } for i, v := range vals { rewards[i], penalties[i], err = attestationDelta(bal, v, baseRewardMultiplier, inactivityDenominator, leak) if err != nil { return nil, nil, err } } return rewards, penalties, nil } func attestationDelta( bal *precompute.Balance, val *precompute.Validator, baseRewardMultiplier, inactivityDenominator uint64, inactivityLeak bool) (reward, penalty uint64, err error) { eligible := val.IsActivePrevEpoch || (val.IsSlashed && !val.IsWithdrawableCurrentEpoch) // Per spec `ActiveCurrentEpoch` can't be 0 to process attestation delta. if !eligible || bal.ActiveCurrentEpoch == 0 { return 0, 0, nil } cfg := params.BeaconConfig() increment := cfg.EffectiveBalanceIncrement effectiveBalance := val.CurrentEpochEffectiveBalance baseReward := (effectiveBalance / increment) * baseRewardMultiplier activeIncrement := bal.ActiveCurrentEpoch / increment weightDenominator := cfg.WeightDenominator srcWeight := cfg.TimelySourceWeight tgtWeight := cfg.TimelyTargetWeight headWeight := cfg.TimelyHeadWeight reward, penalty = uint64(0), uint64(0) // Process source reward / penalty if val.IsPrevEpochSourceAttester && !val.IsSlashed { if !inactivityLeak { n := baseReward * srcWeight * (bal.PrevEpochAttested / increment) reward += n / (activeIncrement * weightDenominator) } } else { penalty += baseReward * srcWeight / weightDenominator } // Process target reward / penalty if val.IsPrevEpochTargetAttester && !val.IsSlashed { if !inactivityLeak { n := baseReward * tgtWeight * (bal.PrevEpochTargetAttested / increment) reward += n / (activeIncrement * weightDenominator) } } else { penalty += baseReward * tgtWeight / weightDenominator } // Process head reward / penalty if val.IsPrevEpochHeadAttester && !val.IsSlashed { if !inactivityLeak { n := baseReward * headWeight * (bal.PrevEpochHeadAttested / increment) reward += n / (activeIncrement * weightDenominator) } } // Process finality delay penalty // Apply an additional penalty to validators that did not vote on the correct target or slashed if !val.IsPrevEpochTargetAttester || val.IsSlashed { n, err := math.Mul64(effectiveBalance, val.InactivityScore) if err != nil { return 0, 0, err } penalty += n / inactivityDenominator } return reward, penalty, nil }