@lodestar/state-transition 1.35.0-dev.98d359db41 → 1.35.0-dev.b42a298a7c

package/src/cache/epochTransitionCache.ts

@@ -1,542 +0,0 @@
-import {
-  EPOCHS_PER_SLASHINGS_VECTOR,
-  FAR_FUTURE_EPOCH,
-  ForkSeq,
-  MIN_ACTIVATION_BALANCE,
-  SLOTS_PER_HISTORICAL_ROOT,
-} from "@lodestar/params";
-import {Epoch, RootHex, ValidatorIndex} from "@lodestar/types";
-import {intDiv, toRootHex} from "@lodestar/utils";
-import {processPendingAttestations} from "../epoch/processPendingAttestations.js";
-import {
-  CachedBeaconStateAllForks,
-  CachedBeaconStateAltair,
-  CachedBeaconStatePhase0,
-  hasCompoundingWithdrawalCredential,
-} from "../index.js";
-import {computeBaseRewardPerIncrement} from "../util/altair.js";
-import {
-  FLAG_CURR_HEAD_ATTESTER,
-  FLAG_CURR_SOURCE_ATTESTER,
-  FLAG_CURR_TARGET_ATTESTER,
-  FLAG_ELIGIBLE_ATTESTER,
-  FLAG_PREV_HEAD_ATTESTER,
-  FLAG_PREV_SOURCE_ATTESTER,
-  FLAG_PREV_TARGET_ATTESTER,
-  FLAG_UNSLASHED,
-  hasMarkers,
-} from "../util/attesterStatus.js";
-
-export type EpochTransitionCacheOpts = {
-  /**
-   * Assert progressive balances the same to EpochTransitionCache
-   */
-  assertCorrectProgressiveBalances?: boolean;
-  /**
-   * Do not queue shuffling calculation async. Forces sync JIT calculation in afterProcessEpoch
-   */
-  asyncShufflingCalculation?: boolean;
-};
-
-/**
- * EpochTransitionCache is the parent object of:
- * - Any data-structures not part of the spec'ed BeaconState
- * - Necessary to only compute data once
- * - Only necessary for epoch processing, can be disposed immediately
- * - Not already part of `EpochCache` {@see} {@link EpochCache}
- *
- * EpochTransitionCache speeds up epoch processing as a whole at the cost of more memory temporarily. This is okay since
- * only epoch process is done at once, limiting the max total memory increase. In summary it helps:
- * - Only loop state.validators once for all `process_*` fns
- * - Only loop status array once
- */
-export interface EpochTransitionCache {
-  prevEpoch: Epoch;
-  currentEpoch: Epoch;
-  /**
-   * This is sum of active validators' balance in eth.
-   */
-  totalActiveStakeByIncrement: number;
-  /** For altair */
-  baseRewardPerIncrement: number;
-  prevEpochUnslashedStake: {
-    sourceStakeByIncrement: number;
-    targetStakeByIncrement: number;
-    headStakeByIncrement: number;
-  };
-  currEpochUnslashedTargetStakeByIncrement: number;
-
-  /**
-   * Indices which will receive the slashing penalty
-   * ```
-   * v.withdrawableEpoch === currentEpoch + EPOCHS_PER_SLASHINGS_VECTOR / 2
-   * ```
-   * There's a practical limitation in number of possible validators slashed by epoch, which would share the same
-   * withdrawableEpoch. Note that after some count exitChurn would advance the withdrawableEpoch.
-   * ```
-   * maxSlashedPerSlot = SLOTS_PER_EPOCH * (MAX_PROPOSER_SLASHINGS + MAX_ATTESTER_SLASHINGS * bits)
-   * ```
-   * For current mainnet conditions (bits = 128) that's `maxSlashedPerSlot = 8704`.
-   * For less than 327680 validators, churnLimit = 4 (minimum possible)
-   * For exitChurn to overtake the slashing delay, there should be
-   * ```
-   * churnLimit * (EPOCHS_PER_SLASHINGS_VECTOR / 2 - 1 - MAX_SEED_LOOKAHEAD)
-   * ```
-   * For mainnet conditions that's 16364 validators. So the limiting factor is the max operations on the block. Note
-   * that on average indicesToSlash must contain churnLimit validators (4), but it can spike to a max of 8704 in a
-   * single epoch if there haven't been exits in a while and there's a massive attester slashing at once of validators
-   * that happen to be in the same committee, which is very unlikely.
-   */
-  indicesToSlash: ValidatorIndex[];
-
-  /**
-   * Indices of validators that just joined and will be eligible for the active queue.
-   * ```
-   * v.activationEligibilityEpoch === FAR_FUTURE_EPOCH && v.effectiveBalance >= MAX_EFFECTIVE_BALANCE
-   * ```
-   * All validators in indicesEligibleForActivationQueue get activationEligibilityEpoch set. So it can only include
-   * validators that have just joined the registry through a valid full deposit(s).
-   * ```
-   * max indicesEligibleForActivationQueue = SLOTS_PER_EPOCH * MAX_DEPOSITS
-   * ```
-   * For mainnet spec = 512
-   */
-  indicesEligibleForActivationQueue: ValidatorIndex[];
-
-  /**
-   * Indices of validators that may become active once churn and finaly allow.
-   * ```
-   * v.activationEpoch === FAR_FUTURE_EPOCH && v.activationEligibilityEpoch <= currentEpoch
-   * ```
-   * Many validators could be on indicesEligibleForActivation, but only up to churnLimit will be activated.
-   * For less than 327680 validators, churnLimit = 4 (minimum possible), so max processed is 4.
-   */
-  indicesEligibleForActivation: ValidatorIndex[];
-
-  /**
-   * Indices of validators that will be ejected due to low balance.
-   * ```
-   * status.active && v.exitEpoch === FAR_FUTURE_EPOCH && v.effectiveBalance <= config.EJECTION_BALANCE
-   * ```
-   * Potentially the entire validator set could be added to indicesToEject, and all validators in the array will have
-   * their validator object mutated. Exit queue churn delays exit, but the object is mutated immediately.
-   */
-  indicesToEject: ValidatorIndex[];
-
-  /**
-   * Pre-computes status flags for faster checking of statuses during epoch transition.
-   * Spec requires some reward or penalty to apply to
-   * - eligible validators
-   * - un-slashed validators
-   * - prev attester flag set
-   * With a status flag to check this conditions at once we just have to mask with an OR of the conditions.
-   * This is only for phase0 only.
-   */
-  proposerIndices: number[];
-
-  /**
-   * This is for phase0 only.
-   */
-  inclusionDelays: number[];
-
-  flags: number[];
-
-  isCompoundingValidatorArr: boolean[];
-
-  /**
-   * balances array will be populated by processRewardsAndPenalties() and consumed by processEffectiveBalanceUpdates().
-   * processRewardsAndPenalties() already has a regular Javascript array of balances.
-   * Then processEffectiveBalanceUpdates() needs to iterate all balances so it can re-use the array pre-computed previously.
-   */
-  balances?: number[];
-
-  /**
-   * Active validator indices for currentEpoch + 2.
-   * This is only used in `afterProcessEpoch` to compute epoch shuffling, it's not efficient to calculate it at that time
-   * since it requires 1 loop through validator.
-   * | epoch process fn                 | nextEpochTotalActiveBalance action |
-   * | -------------------------------- | ---------------------------------- |
-   * | beforeProcessEpoch               | calculate during the validator loop|
-   * | afterEpochTransitionCache                | read it                            |
-   */
-  nextShufflingActiveIndices: Uint32Array;
-
-  /**
-   * Shuffling decision root that gets set on the EpochCache in afterProcessEpoch
-   */
-  nextShufflingDecisionRoot: RootHex;
-
-  /**
-   * Altair specific, this is total active balances for the next epoch.
-   * This is only used in `afterProcessEpoch` to compute base reward and sync participant reward.
-   * It's not efficient to calculate it at that time since it requires looping through all active validators,
-   * so we should calculate it during `processEffectiveBalancesUpdate` which gives us updated effective balance.
-   * | epoch process fn                 | nextEpochTotalActiveBalance action |
-   * | -------------------------------- | ---------------------------------- |
-   * | beforeProcessEpoch               | initialize as BigInt(0)            |
-   * | processEffectiveBalancesUpdate   | calculate during the loop          |
-   * | afterEpochTransitionCache                | read it                            |
-   */
-  nextEpochTotalActiveBalanceByIncrement: number;
-
-  /**
-   * Compute the shuffling sync or async.  Defaults to synchronous.  Need to pass `true` with the
-   * `EpochTransitionCacheOpts`
-   */
-  asyncShufflingCalculation: boolean;
-
-  /**
-   * Track by validator index if it's active in the prev epoch.
-   * Used in metrics
-   */
-  isActivePrevEpoch: boolean[];
-
-  /**
-   * Track by validator index if it's active in the current epoch.
-   * Used in metrics
-   */
-  isActiveCurrEpoch: boolean[];
-
-  /**
-   * Track by validator index if it's active in the next epoch.
-   * Used in `processEffectiveBalanceUpdates` to save one loop over validators after epoch process.
-   */
-  isActiveNextEpoch: boolean[];
-}
-
-// reuse arrays to avoid memory reallocation and gc
-// WARNING: this is not async safe
-/** WARNING: reused, never gc'd */
-const isActivePrevEpoch = new Array<boolean>();
-/** WARNING: reused, never gc'd */
-const isActiveCurrEpoch = new Array<boolean>();
-/** WARNING: reused, never gc'd */
-const isActiveNextEpoch = new Array<boolean>();
-/** WARNING: reused, never gc'd, from altair this is empty array */
-const proposerIndices = new Array<number>();
-/** WARNING: reused, never gc'd, from altair this is empty array */
-const inclusionDelays = new Array<number>();
-/** WARNING: reused, never gc'd */
-const flags = new Array<number>();
-/** WARNING: reused, never gc'd */
-const nextEpochShufflingActiveValidatorIndices = new Array<number>();
-/** WARNING: reused, never gc'd */
-const isCompoundingValidatorArr = new Array<boolean>();
-
-const previousEpochParticipation = new Array<number>();
-const currentEpochParticipation = new Array<number>();
-
-export function beforeProcessEpoch(
-  state: CachedBeaconStateAllForks,
-  opts?: EpochTransitionCacheOpts
-): EpochTransitionCache {
-  const {config, epochCtx} = state;
-  const forkSeq = config.getForkSeq(state.slot);
-  const currentEpoch = epochCtx.epoch;
-  const prevEpoch = epochCtx.previousShuffling.epoch;
-  const nextEpoch = currentEpoch + 1;
-  // active validator indices for nextShuffling is ready, we want to precalculate for the one after that
-  const nextEpoch2 = currentEpoch + 2;
-
-  const slashingsEpoch = currentEpoch + intDiv(EPOCHS_PER_SLASHINGS_VECTOR, 2);
-
-  const indicesToSlash: ValidatorIndex[] = [];
-  const indicesEligibleForActivationQueue: ValidatorIndex[] = [];
-  const indicesEligibleForActivation: {validatorIndex: ValidatorIndex; activationEligibilityEpoch: Epoch}[] = [];
-  const indicesToEject: ValidatorIndex[] = [];
-
-  let totalActiveStakeByIncrement = 0;
-  const validatorCount = state.validators.length;
-  nextEpochShufflingActiveValidatorIndices.length = validatorCount;
-  let nextEpochShufflingActiveIndicesLength = 0;
-  // pre-fill with true (most validators are active)
-  isActivePrevEpoch.length = validatorCount;
-  isActiveCurrEpoch.length = validatorCount;
-  isActiveNextEpoch.length = validatorCount;
-  isActivePrevEpoch.fill(true);
-  isActiveCurrEpoch.fill(true);
-  isActiveNextEpoch.fill(true);
-
-  // During the epoch transition, additional data is precomputed to avoid traversing any state a second
-  // time. Attestations are a big part of this, and each validator has a "status" to represent its
-  // precomputed participation.
-  // - proposerIndex: number; // -1 when not included by any proposer, for phase0 only so it's declared inside phase0 block below
-  // - inclusionDelay: number;// for phase0 only so it's declared inside phase0 block below
-  // - flags: number; // bitfield of AttesterFlags
-  flags.length = validatorCount;
-  // flags.fill(0);
-  // flags will be zero'd out below
-  // In the first loop, set slashed+eligibility
-  // In the second loop, set participation flags
-  // TODO: optimize by combining the two loops
-  // likely will require splitting into phase0 and post-phase0 versions
-
-  if (forkSeq >= ForkSeq.electra) {
-    isCompoundingValidatorArr.length = validatorCount;
-  }
-
-  // Clone before being mutated in processEffectiveBalanceUpdates
-  epochCtx.beforeEpochTransition();
-
-  const effectiveBalancesByIncrements = epochCtx.effectiveBalanceIncrements;
-
-  state.validators.forEachValue((validator, i) => {
-    let flag = 0;
-
-    if (validator.slashed) {
-      if (slashingsEpoch === validator.withdrawableEpoch) {
-        indicesToSlash.push(i);
-      }
-    } else {
-      flag |= FLAG_UNSLASHED;
-    }
-
-    const {activationEpoch, exitEpoch} = validator;
-    const isActivePrev = activationEpoch <= prevEpoch && prevEpoch < exitEpoch;
-    const isActiveCurr = activationEpoch <= currentEpoch && currentEpoch < exitEpoch;
-    const isActiveNext = activationEpoch <= nextEpoch && nextEpoch < exitEpoch;
-    const isActiveNext2 = activationEpoch <= nextEpoch2 && nextEpoch2 < exitEpoch;
-
-    if (!isActivePrev) {
-      isActivePrevEpoch[i] = false;
-    }
-
-    // Both active validators and slashed-but-not-yet-withdrawn validators are eligible to receive penalties.
-    // This is done to prevent self-slashing from being a way to escape inactivity leaks.
-    // TODO: Consider using an array of `eligibleValidatorIndices: number[]`
-    if (isActivePrev || (validator.slashed && prevEpoch + 1 < validator.withdrawableEpoch)) {
-      flag |= FLAG_ELIGIBLE_ATTESTER;
-    }
-
-    flags[i] = flag;
-
-    if (forkSeq >= ForkSeq.electra) {
-      isCompoundingValidatorArr[i] = hasCompoundingWithdrawalCredential(validator.withdrawalCredentials);
-    }
-
-    if (isActiveCurr) {
-      totalActiveStakeByIncrement += effectiveBalancesByIncrements[i];
-    } else {
-      isActiveCurrEpoch[i] = false;
-    }
-
-    // To optimize process_registry_updates():
-    // ```python
-    // def is_eligible_for_activation_queue(validator: Validator) -> bool:
-    //   return (
-    //     validator.activation_eligibility_epoch == FAR_FUTURE_EPOCH
-    //     and validator.effective_balance >= MAX_EFFECTIVE_BALANCE # [Modified in Electra]
-    //   )
-    // ```
-    if (
-      validator.activationEligibilityEpoch === FAR_FUTURE_EPOCH &&
-      validator.effectiveBalance >= MIN_ACTIVATION_BALANCE
-    ) {
-      indicesEligibleForActivationQueue.push(i);
-    }
-
-    // To optimize process_registry_updates():
-    // ```python
-    // def is_eligible_for_activation(state: BeaconState, validator: Validator) -> bool:
-    //   return (
-    //     validator.activation_eligibility_epoch <= state.finalized_checkpoint.epoch  # Placement in queue is finalized
-    //     and validator.activation_epoch == FAR_FUTURE_EPOCH                          # Has not yet been activated
-    //   )
-    // ```
-    // Here we have to check if `activationEligibilityEpoch <= currentEpoch` instead of finalized checkpoint, because the finalized
-    // checkpoint may change during epoch processing at processJustificationAndFinalization(), which is called before processRegistryUpdates().
-    // Then in processRegistryUpdates() we will check `activationEligibilityEpoch <= finalityEpoch`. This is to keep the array small.
-    //
-    // Use `else` since indicesEligibleForActivationQueue + indicesEligibleForActivation are mutually exclusive
-    else if (validator.activationEpoch === FAR_FUTURE_EPOCH && validator.activationEligibilityEpoch <= currentEpoch) {
-      indicesEligibleForActivation.push({
-        validatorIndex: i,
-        activationEligibilityEpoch: validator.activationEligibilityEpoch,
-      });
-    }
-
-    // To optimize process_registry_updates():
-    // ```python
-    // if is_active_validator(validator, get_current_epoch(state)) and validator.effective_balance <= EJECTION_BALANCE:
-    // ```
-    // Adding extra condition `exitEpoch === FAR_FUTURE_EPOCH` to keep the array as small as possible. initiateValidatorExit() will ignore them anyway
-    //
-    // Use `else` since indicesEligibleForActivationQueue + indicesEligibleForActivation + indicesToEject are mutually exclusive
-    else if (
-      isActiveCurr &&
-      validator.exitEpoch === FAR_FUTURE_EPOCH &&
-      validator.effectiveBalance <= config.EJECTION_BALANCE
-    ) {
-      indicesToEject.push(i);
-    }
-
-    if (!isActiveNext) {
-      isActiveNextEpoch[i] = false;
-    }
-
-    if (isActiveNext2) {
-      nextEpochShufflingActiveValidatorIndices[nextEpochShufflingActiveIndicesLength++] = i;
-    }
-  });
-
-  // Trigger async build of shuffling for epoch after next (nextShuffling post epoch transition)
-  const epochAfterNext = state.epochCtx.nextEpoch + 1;
-  // cannot call calculateShufflingDecisionRoot here because spec prevent getting current slot
-  // as a decision block.  we are part way through the transition though and this was added in
-  // process slot beforeProcessEpoch happens so it available and valid
-  const nextShufflingDecisionRoot = toRootHex(state.blockRoots.get(state.slot % SLOTS_PER_HISTORICAL_ROOT));
-  const nextShufflingActiveIndices = new Uint32Array(nextEpochShufflingActiveIndicesLength);
-  if (nextEpochShufflingActiveIndicesLength > nextEpochShufflingActiveValidatorIndices.length) {
-    throw new Error(
-      `Invalid activeValidatorCount: ${nextEpochShufflingActiveIndicesLength} > ${nextEpochShufflingActiveValidatorIndices.length}`
-    );
-  }
-  // only the first `activeValidatorCount` elements are copied to `activeIndices`
-  for (let i = 0; i < nextEpochShufflingActiveIndicesLength; i++) {
-    nextShufflingActiveIndices[i] = nextEpochShufflingActiveValidatorIndices[i];
-  }
-
-  const asyncShufflingCalculation = opts?.asyncShufflingCalculation ?? false;
-  if (asyncShufflingCalculation) {
-    state.epochCtx.shufflingCache?.build(epochAfterNext, nextShufflingDecisionRoot, state, nextShufflingActiveIndices);
-  }
-
-  if (totalActiveStakeByIncrement < 1) {
-    totalActiveStakeByIncrement = 1;
-  } else if (totalActiveStakeByIncrement >= Number.MAX_SAFE_INTEGER) {
-    throw Error("totalActiveStakeByIncrement >= Number.MAX_SAFE_INTEGER. MAX_EFFECTIVE_BALANCE is too low.");
-  }
-
-  // SPEC: function getBaseRewardPerIncrement()
-  const baseRewardPerIncrement = computeBaseRewardPerIncrement(totalActiveStakeByIncrement);
-
-  // To optimize process_registry_updates():
-  // order by sequence of activationEligibilityEpoch setting and then index
-  indicesEligibleForActivation.sort(
-    (a, b) => a.activationEligibilityEpoch - b.activationEligibilityEpoch || a.validatorIndex - b.validatorIndex
-  );
-
-  if (forkSeq === ForkSeq.phase0) {
-    proposerIndices.length = validatorCount;
-    proposerIndices.fill(-1);
-    inclusionDelays.length = validatorCount;
-    inclusionDelays.fill(0);
-    processPendingAttestations(
-      state as CachedBeaconStatePhase0,
-      proposerIndices,
-      inclusionDelays,
-      flags,
-      (state as CachedBeaconStatePhase0).previousEpochAttestations.getAllReadonly(),
-      prevEpoch,
-      FLAG_PREV_SOURCE_ATTESTER,
-      FLAG_PREV_TARGET_ATTESTER,
-      FLAG_PREV_HEAD_ATTESTER
-    );
-    processPendingAttestations(
-      state as CachedBeaconStatePhase0,
-      proposerIndices,
-      inclusionDelays,
-      flags,
-      (state as CachedBeaconStatePhase0).currentEpochAttestations.getAllReadonly(),
-      currentEpoch,
-      FLAG_CURR_SOURCE_ATTESTER,
-      FLAG_CURR_TARGET_ATTESTER,
-      FLAG_CURR_HEAD_ATTESTER
-    );
-  } else {
-    previousEpochParticipation.length = (state as CachedBeaconStateAltair).previousEpochParticipation.length;
-    (state as CachedBeaconStateAltair).previousEpochParticipation.getAll(previousEpochParticipation);
-    currentEpochParticipation.length = (state as CachedBeaconStateAltair).currentEpochParticipation.length;
-    (state as CachedBeaconStateAltair).currentEpochParticipation.getAll(currentEpochParticipation);
-    for (let i = 0; i < validatorCount; i++) {
-      flags[i] |=
-        // checking active status first is required to pass random spec tests in altair
-        // in practice, inactive validators will have 0 participation
-        // FLAG_PREV are indexes [0,1,2]
-        (isActivePrevEpoch[i] ? previousEpochParticipation[i] : 0) |
-        // FLAG_CURR are indexes [3,4,5], so shift by 3
-        (isActiveCurrEpoch[i] ? currentEpochParticipation[i] << 3 : 0);
-    }
-  }
-
-  let prevSourceUnslStake = 0;
-  let prevTargetUnslStake = 0;
-  let prevHeadUnslStake = 0;
-
-  let currTargetUnslStake = 0;
-
-  const FLAG_PREV_SOURCE_ATTESTER_UNSLASHED = FLAG_PREV_SOURCE_ATTESTER | FLAG_UNSLASHED;
-  const FLAG_PREV_TARGET_ATTESTER_UNSLASHED = FLAG_PREV_TARGET_ATTESTER | FLAG_UNSLASHED;
-  const FLAG_PREV_HEAD_ATTESTER_UNSLASHED = FLAG_PREV_HEAD_ATTESTER | FLAG_UNSLASHED;
-  const FLAG_CURR_TARGET_UNSLASHED = FLAG_CURR_TARGET_ATTESTER | FLAG_UNSLASHED;
-
-  for (let i = 0; i < validatorCount; i++) {
-    const effectiveBalanceByIncrement = effectiveBalancesByIncrements[i];
-    const flag = flags[i];
-    if (hasMarkers(flag, FLAG_PREV_SOURCE_ATTESTER_UNSLASHED)) {
-      prevSourceUnslStake += effectiveBalanceByIncrement;
-    }
-    if (hasMarkers(flag, FLAG_PREV_TARGET_ATTESTER_UNSLASHED)) {
-      prevTargetUnslStake += effectiveBalanceByIncrement;
-    }
-    if (hasMarkers(flag, FLAG_PREV_HEAD_ATTESTER_UNSLASHED)) {
-      prevHeadUnslStake += effectiveBalanceByIncrement;
-    }
-    if (hasMarkers(flag, FLAG_CURR_TARGET_UNSLASHED)) {
-      currTargetUnslStake += effectiveBalanceByIncrement;
-    }
-  }
-
-  if (opts?.assertCorrectProgressiveBalances && forkSeq >= ForkSeq.altair) {
-    // TODO: describe issue. Compute progressive target balances
-    if (epochCtx.currentTargetUnslashedBalanceIncrements !== currTargetUnslStake) {
-      throw Error(
-        `currentTargetUnslashedBalanceIncrements is wrong, expect ${currTargetUnslStake} got ${epochCtx.currentTargetUnslashedBalanceIncrements} epoch ${epochCtx.epoch}`
-      );
-    }
-    if (epochCtx.previousTargetUnslashedBalanceIncrements !== prevTargetUnslStake) {
-      throw Error(
-        `previousTargetUnslashedBalanceIncrements is wrong, expect ${prevTargetUnslStake} got ${epochCtx.previousTargetUnslashedBalanceIncrements} epoch ${epochCtx.epoch}`
-      );
-    }
-  }
-
-  // As per spec of `get_total_balance`:
-  // EFFECTIVE_BALANCE_INCREMENT Gwei minimum to avoid divisions by zero.
-  // Math safe up to ~10B ETH, afterwhich this overflows uint64.
-  if (prevSourceUnslStake < 1) prevSourceUnslStake = 1;
-  if (prevTargetUnslStake < 1) prevTargetUnslStake = 1;
-  if (prevHeadUnslStake < 1) prevHeadUnslStake = 1;
-  if (currTargetUnslStake < 1) currTargetUnslStake = 1;
-
-  return {
-    prevEpoch,
-    currentEpoch,
-    totalActiveStakeByIncrement,
-    baseRewardPerIncrement,
-    prevEpochUnslashedStake: {
-      sourceStakeByIncrement: prevSourceUnslStake,
-      targetStakeByIncrement: prevTargetUnslStake,
-      headStakeByIncrement: prevHeadUnslStake,
-    },
-    currEpochUnslashedTargetStakeByIncrement: currTargetUnslStake,
-    indicesToSlash,
-    indicesEligibleForActivationQueue,
-    indicesEligibleForActivation: indicesEligibleForActivation.map(({validatorIndex}) => validatorIndex),
-    indicesToEject,
-    nextShufflingDecisionRoot,
-    nextShufflingActiveIndices,
-    asyncShufflingCalculation,
-    // to be updated in processEffectiveBalanceUpdates
-    nextEpochTotalActiveBalanceByIncrement: 0,
-    isActivePrevEpoch,
-    isActiveCurrEpoch,
-    isActiveNextEpoch,
-    proposerIndices,
-    inclusionDelays,
-    flags,
-    isCompoundingValidatorArr,
-    // Will be assigned in processRewardsAndPenalties()
-    balances: undefined,
-  };
-}

package/src/cache/pubkeyCache.ts

@@ -1,33 +0,0 @@
-import {PublicKey} from "@chainsafe/blst";
-import {PubkeyIndexMap} from "@chainsafe/pubkey-index-map";
-import {phase0} from "@lodestar/types";
-
-export type Index2PubkeyCache = PublicKey[];
-
-/**
- * Checks the pubkey indices against a state and adds missing pubkeys
- *
- * Mutates `pubkey2index` and `index2pubkey`
- *
- * If pubkey caches are empty: SLOW CODE - 🐢
- */
-export function syncPubkeys(
-  validators: phase0.Validator[],
-  pubkey2index: PubkeyIndexMap,
-  index2pubkey: Index2PubkeyCache
-): void {
-  if (pubkey2index.size !== index2pubkey.length) {
-    throw new Error(`Pubkey indices have fallen out of sync: ${pubkey2index.size} != ${index2pubkey.length}`);
-  }
-
-  const newCount = validators.length;
-  index2pubkey.length = newCount;
-  for (let i = pubkey2index.size; i < newCount; i++) {
-    const pubkey = validators[i].pubkey;
-    pubkey2index.set(pubkey, i);
-    // Pubkeys must be checked for group + inf. This must be done only once when the validator deposit is processed.
-    // Afterwards any public key is the state consider validated.
-    // > Do not do any validation here
-    index2pubkey[i] = PublicKey.fromBytes(pubkey); // Optimize for aggregation
-  }
-}

package/src/cache/rewardCache.ts

@@ -1,19 +0,0 @@
-/**
- * A simple data structure to store rewards payable to block proposer in the memory.
- * Rewards are updated throughout the state transition
- * Should only hold info for one state transition
- * All values are in Gwei
- */
-export type RewardCache = {
-  attestations: number;
-  syncAggregate: number;
-  slashing: number; // Sum of attester and proposer slashing reward
-};
-
-export function createEmptyRewardCache(): RewardCache {
-  return {
-    attestations: 0,
-    syncAggregate: 0,
-    slashing: 0,
-  };
-}