@lodestar/beacon-node 1.35.0-dev.91dadf81de → 1.35.0-dev.955e9f89ed

package/src/chain/archiveStore/utils/archiveBlocks.ts

@@ -1,437 +0,0 @@
-import path from "node:path";
-import {ChainForkConfig} from "@lodestar/config";
-import {KeyValue} from "@lodestar/db";
-import {IForkChoice} from "@lodestar/fork-choice";
-import {ForkSeq, SLOTS_PER_EPOCH} from "@lodestar/params";
-import {computeEpochAtSlot, computeStartSlotAtEpoch} from "@lodestar/state-transition";
-import {Epoch, RootHex, Slot} from "@lodestar/types";
-import {Logger, fromAsync, fromHex, prettyPrintIndices, toRootHex} from "@lodestar/utils";
-import {IBeaconDb} from "../../../db/index.js";
-import {BlockArchiveBatchPutBinaryItem} from "../../../db/repositories/index.js";
-import {ensureDir, writeIfNotExist} from "../../../util/file.js";
-import {BlockRootHex} from "../../../util/sszBytes.js";
-import {LightClientServer} from "../../lightClient/index.js";
-
-// Process in chunks to avoid OOM
-// this number of blocks per chunk is tested in e2e test blockArchive.test.ts
-// TODO: Review after merge since the size of blocks will increase significantly
-const BLOCK_BATCH_SIZE = 256;
-const BLOB_SIDECAR_BATCH_SIZE = 32;
-
-type BlockRootSlot = {slot: Slot; root: Uint8Array};
-type CheckpointHex = {epoch: Epoch; rootHex: RootHex};
-
-/**
- * Persist orphaned block to disk
- */
-async function persistOrphanedBlock(
-  slot: Slot,
-  blockRoot: BlockRootHex,
-  bytes: Uint8Array,
-  opts: {
-    persistOrphanedBlocksDir: string;
-  }
-) {
-  const dirpath = path.join(opts.persistOrphanedBlocksDir ?? "orphaned_blocks");
-  const filepath = path.join(dirpath, `${slot}_${blockRoot}.ssz`);
-  await ensureDir(dirpath);
-  await writeIfNotExist(filepath, bytes);
-}
-
-/**
- * Archives finalized blocks from active bucket to archive bucket.
- *
- * Only archive blocks on the same chain to the finalized checkpoint.
- * Each run should move all finalized blocks to blockArhive db to make it consistent
- * to stateArchive, so that the node always work well when we restart.
- * Note that the finalized block still stay in forkchoice to check finalize checkpoint of next onBlock calls,
- * the next run should not reprocess finalzied block of this run.
- */
-export async function archiveBlocks(
-  config: ChainForkConfig,
-  db: IBeaconDb,
-  forkChoice: IForkChoice,
-  lightclientServer: LightClientServer | undefined,
-  logger: Logger,
-  finalizedCheckpoint: CheckpointHex,
-  currentEpoch: Epoch,
-  archiveDataEpochs?: number,
-  persistOrphanedBlocks?: boolean,
-  persistOrphanedBlocksDir?: string
-): Promise<void> {
-  // Use fork choice to determine the blocks to archive and delete
-  // getAllAncestorBlocks response includes the finalized block, so it's also moved to the cold db
-  const {ancestors: finalizedCanonicalBlocks, nonAncestors: finalizedNonCanonicalBlocks} =
-    forkChoice.getAllAncestorAndNonAncestorBlocks(finalizedCheckpoint.rootHex);
-
-  // NOTE: The finalized block will be exactly the first block of `epoch` or previous
-  const finalizedPostDeneb = finalizedCheckpoint.epoch >= config.DENEB_FORK_EPOCH;
-  const finalizedPostFulu = finalizedCheckpoint.epoch >= config.FULU_FORK_EPOCH;
-
-  const finalizedCanonicalBlockRoots: BlockRootSlot[] = finalizedCanonicalBlocks.map((block) => ({
-    slot: block.slot,
-    root: fromHex(block.blockRoot),
-  }));
-
-  if (finalizedCanonicalBlockRoots.length > 0) {
-    await migrateBlocksFromHotToColdDb(db, finalizedCanonicalBlockRoots);
-    logger.verbose("Migrated blocks from hot DB to cold DB", {
-      fromSlot: finalizedCanonicalBlockRoots[0].slot,
-      toSlot: finalizedCanonicalBlockRoots.at(-1)?.slot,
-      size: finalizedCanonicalBlockRoots.length,
-    });
-
-    if (finalizedPostDeneb) {
-      const migratedEntries = await migrateBlobSidecarsFromHotToColdDb(
-        config,
-        db,
-        finalizedCanonicalBlockRoots,
-        currentEpoch
-      );
-      logger.verbose("Migrated blobSidecars from hot DB to cold DB", {migratedEntries});
-    }
-
-    if (finalizedPostFulu) {
-      const migratedEntries = await migrateDataColumnSidecarsFromHotToColdDb(
-        config,
-        db,
-        logger,
-        finalizedCanonicalBlockRoots,
-        currentEpoch
-      );
-      logger.verbose("Migrated dataColumnSidecars from hot DB to cold DB", {migratedEntries});
-    }
-  }
-
-  // deleteNonCanonicalBlocks
-  // loop through forkchoice single time
-
-  const nonCanonicalBlockRoots = finalizedNonCanonicalBlocks.map((summary) => fromHex(summary.blockRoot));
-  if (nonCanonicalBlockRoots.length > 0) {
-    if (persistOrphanedBlocks) {
-      // Persist orphaned blocks to disk before deleting them from hot db
-      await Promise.all(
-        nonCanonicalBlockRoots.map(async (root, index) => {
-          const block = finalizedNonCanonicalBlocks[index];
-          const blockBytes = await db.block.getBinary(root);
-          const logCtx = {slot: block.slot, root: block.blockRoot};
-          if (blockBytes) {
-            await persistOrphanedBlock(block.slot, block.blockRoot, blockBytes, {
-              persistOrphanedBlocksDir: persistOrphanedBlocksDir ?? "orphaned_blocks",
-            });
-            logger.verbose("Persisted orphaned block", logCtx);
-          } else {
-            logger.warn("Tried to persist orphaned block but no block found", logCtx);
-          }
-        })
-      );
-    }
-
-    await db.block.batchDelete(nonCanonicalBlockRoots);
-    logger.verbose("Deleted non canonical blocks from hot DB", {
-      slots: finalizedNonCanonicalBlocks.map((summary) => summary.slot).join(","),
-    });
-
-    if (finalizedPostDeneb) {
-      await db.blobSidecars.batchDelete(nonCanonicalBlockRoots);
-      logger.verbose("Deleted non canonical blobSidecars from hot DB");
-    }
-
-    if (finalizedPostFulu) {
-      await db.dataColumnSidecar.deleteMany(nonCanonicalBlockRoots);
-      logger.verbose("Deleted non canonical dataColumnSidecars from hot DB");
-    }
-  }
-
-  // Delete expired blobs
-  // Keep only `[current_epoch - max(MIN_EPOCHS_FOR_BLOB_SIDECARS_REQUESTS, archiveDataEpochs)]`
-  // if archiveDataEpochs set to Infinity do not prune`
-  if (finalizedPostDeneb) {
-    if (archiveDataEpochs !== Infinity) {
-      const blobsArchiveWindow = Math.max(config.MIN_EPOCHS_FOR_BLOB_SIDECARS_REQUESTS, archiveDataEpochs ?? 0);
-      const blobSidecarsMinEpoch = currentEpoch - blobsArchiveWindow;
-      if (blobSidecarsMinEpoch >= config.DENEB_FORK_EPOCH) {
-        const slotsToDelete = await db.blobSidecarsArchive.keys({lt: computeStartSlotAtEpoch(blobSidecarsMinEpoch)});
-        if (slotsToDelete.length > 0) {
-          await db.blobSidecarsArchive.batchDelete(slotsToDelete);
-          logger.verbose(`blobSidecars prune: batchDelete range ${slotsToDelete[0]}..${slotsToDelete.at(-1)}`);
-        } else {
-          logger.verbose(`blobSidecars prune: no entries before epoch ${blobSidecarsMinEpoch}`);
-        }
-      }
-    } else {
-      logger.verbose("blobSidecars pruning skipped: archiveDataEpochs set to Infinity");
-    }
-  }
-
-  // Delete expired data column sidecars
-  // Keep only `[current_epoch - max(MIN_EPOCHS_FOR_DATA_COLUMN_SIDECARS_REQUESTS, archiveDataEpochs)]`
-  if (finalizedPostFulu) {
-    if (archiveDataEpochs !== Infinity) {
-      const dataColumnSidecarsArchiveWindow = Math.max(
-        config.MIN_EPOCHS_FOR_DATA_COLUMN_SIDECARS_REQUESTS,
-        archiveDataEpochs ?? 0
-      );
-      const dataColumnSidecarsMinEpoch = currentEpoch - dataColumnSidecarsArchiveWindow;
-      if (dataColumnSidecarsMinEpoch >= config.FULU_FORK_EPOCH) {
-        const prefixedKeys = await db.dataColumnSidecarArchive.keys({
-          // The `id` value `0` refers to the column index. So we want to fetch all sidecars less than zero column of `dataColumnSidecarsMinEpoch`
-          lt: {prefix: computeStartSlotAtEpoch(dataColumnSidecarsMinEpoch), id: 0},
-        });
-        // for each slot there could be multiple dataColumnSidecar, so we need to deduplicate it
-        const slotsToDelete = [...new Set(prefixedKeys.map(({prefix}) => prefix))].sort((a, b) => a - b);
-
-        if (slotsToDelete.length > 0) {
-          await db.dataColumnSidecarArchive.deleteMany(slotsToDelete);
-          logger.verbose("dataColumnSidecars prune", {
-            slotRange: prettyPrintIndices(slotsToDelete),
-            numOfSlots: slotsToDelete.length,
-            totalNumOfSidecars: prefixedKeys.length,
-          });
-        } else {
-          logger.verbose(`dataColumnSidecars prune: no entries before epoch ${dataColumnSidecarsMinEpoch}`);
-        }
-      } else {
-        logger.verbose(
-          `dataColumnSidecars pruning skipped: ${dataColumnSidecarsMinEpoch} is before fulu fork epoch ${config.FULU_FORK_EPOCH}`
-        );
-      }
-    } else {
-      logger.verbose("dataColumnSidecars pruning skipped: archiveDataEpochs set to Infinity");
-    }
-  }
-
-  // Prunning potential checkpoint data
-  const finalizedCanonicalNonCheckpointBlocks = getNonCheckpointBlocks(finalizedCanonicalBlockRoots);
-  const nonCheckpointBlockRoots: Uint8Array[] = [...nonCanonicalBlockRoots];
-  for (const block of finalizedCanonicalNonCheckpointBlocks) {
-    nonCheckpointBlockRoots.push(block.root);
-  }
-
-  if (lightclientServer) {
-    await lightclientServer.pruneNonCheckpointData(nonCheckpointBlockRoots);
-  }
-
-  logger.verbose("Archiving of finalized blocks complete", {
-    totalArchived: finalizedCanonicalBlocks.length,
-    finalizedEpoch: finalizedCheckpoint.epoch,
-  });
-}
-
-async function migrateBlocksFromHotToColdDb(db: IBeaconDb, blocks: BlockRootSlot[]): Promise<void> {
-  // Start from `i=0`: 1st block in iterateAncestorBlocks() is the finalized block itself
-  // we move it to blockArchive but forkchoice still have it to check next onBlock calls
-  // the next iterateAncestorBlocks call does not return this block
-  for (let i = 0; i < blocks.length; i += BLOCK_BATCH_SIZE) {
-    const toIdx = Math.min(i + BLOCK_BATCH_SIZE, blocks.length);
-    const canonicalBlocks = blocks.slice(i, toIdx);
-
-    // processCanonicalBlocks
-    if (canonicalBlocks.length === 0) return;
-
-    // load Buffer instead of SignedBeaconBlock to improve performance
-    const canonicalBlockEntries: BlockArchiveBatchPutBinaryItem[] = await Promise.all(
-      canonicalBlocks.map(async (block) => {
-        const blockBuffer = await db.block.getBinary(block.root);
-        if (!blockBuffer) {
-          throw Error(`Block not found for slot ${block.slot} root ${toRootHex(block.root)}`);
-        }
-        return {
-          key: block.slot,
-          value: blockBuffer,
-          slot: block.slot,
-          blockRoot: block.root,
-          // TODO: Benchmark if faster to slice Buffer or fromHex()
-          parentRoot: getParentRootFromSignedBlock(blockBuffer),
-        };
-      })
-    );
-
-    // put to blockArchive db and delete block db
-    await Promise.all([
-      db.blockArchive.batchPutBinary(canonicalBlockEntries),
-      db.block.batchDelete(canonicalBlocks.map((block) => block.root)),
-    ]);
-  }
-}
-
-/**
- * Migrate blobSidecars from hot db to cold db.
- * @returns true if we do that, false if block is out of range data.
- */
-async function migrateBlobSidecarsFromHotToColdDb(
-  config: ChainForkConfig,
-  db: IBeaconDb,
-  blocks: BlockRootSlot[],
-  currentEpoch: Epoch
-): Promise<number> {
-  let migratedWrappedBlobSidecars = 0;
-  for (let i = 0; i < blocks.length; i += BLOB_SIDECAR_BATCH_SIZE) {
-    const toIdx = Math.min(i + BLOB_SIDECAR_BATCH_SIZE, blocks.length);
-    const canonicalBlocks = blocks.slice(i, toIdx);
-
-    // processCanonicalBlocks
-    if (canonicalBlocks.length === 0) break;
-
-    // load Buffer instead of ssz deserialized to improve performance
-    const canonicalBlobSidecarsEntries: KeyValue<Slot, Uint8Array>[] = await Promise.all(
-      canonicalBlocks
-        .filter((block) => {
-          const blockSlot = block.slot;
-          const blockEpoch = computeEpochAtSlot(blockSlot);
-          const forkSeq = config.getForkSeq(blockSlot);
-          return (
-            forkSeq >= ForkSeq.deneb &&
-            forkSeq < ForkSeq.fulu &&
-            // if block is out of ${config.MIN_EPOCHS_FOR_BLOB_SIDECARS_REQUESTS}, skip this step
-            blockEpoch >= currentEpoch - config.MIN_EPOCHS_FOR_BLOB_SIDECARS_REQUESTS
-          );
-        })
-        .map(async (block) => {
-          const bytes = await db.blobSidecars.getBinary(block.root);
-          if (!bytes) {
-            throw Error(`No blobSidecars found for slot ${block.slot} root ${toRootHex(block.root)}`);
-          }
-          return {key: block.slot, value: bytes};
-        })
-    );
-
-    // put to blockArchive db and delete block db
-    await Promise.all([
-      db.blobSidecarsArchive.batchPutBinary(canonicalBlobSidecarsEntries),
-      db.blobSidecars.batchDelete(canonicalBlocks.map((block) => block.root)),
-    ]);
-    migratedWrappedBlobSidecars += canonicalBlobSidecarsEntries.length;
-  }
-
-  return migratedWrappedBlobSidecars;
-}
-
-// TODO: This function can be simplified further by reducing layers of promises in a loop
-async function migrateDataColumnSidecarsFromHotToColdDb(
-  config: ChainForkConfig,
-  db: IBeaconDb,
-  logger: Logger,
-  blocks: BlockRootSlot[],
-  currentEpoch: Epoch
-): Promise<number> {
-  let migratedWrappedDataColumns = 0;
-  for (let i = 0; i < blocks.length; i += BLOB_SIDECAR_BATCH_SIZE) {
-    const toIdx = Math.min(i + BLOB_SIDECAR_BATCH_SIZE, blocks.length);
-    const canonicalBlocks = blocks.slice(i, toIdx);
-
-    // processCanonicalBlocks
-    if (canonicalBlocks.length === 0) break;
-    const promises = [];
-
-    // load Buffer instead of ssz deserialized to improve performance
-    for (const block of canonicalBlocks) {
-      const blockSlot = block.slot;
-      const blockEpoch = computeEpochAtSlot(blockSlot);
-
-      if (
-        config.getForkSeq(blockSlot) < ForkSeq.fulu ||
-        // if block is out of ${config.MIN_EPOCHS_FOR_DATA_COLUMN_SIDECARS_REQUESTS}, skip this step
-        blockEpoch < currentEpoch - config.MIN_EPOCHS_FOR_DATA_COLUMN_SIDECARS_REQUESTS
-      ) {
-        continue;
-      }
-
-      const dataColumnSidecarBytes = await fromAsync(db.dataColumnSidecar.valuesStreamBinary(block.root));
-      // there could be 0 dataColumnSidecarBytes if block has no blob
-      logger.verbose("migrateDataColumnSidecarsFromHotToColdDb", {
-        slot: block.slot,
-        root: toRootHex(block.root),
-        numSidecars: dataColumnSidecarBytes.length,
-      });
-      promises.push(
-        db.dataColumnSidecarArchive.putManyBinary(
-          block.slot,
-          dataColumnSidecarBytes.map((p) => ({key: p.id, value: p.value}))
-        )
-      );
-      migratedWrappedDataColumns += dataColumnSidecarBytes.length;
-    }
-
-    promises.push(db.dataColumnSidecar.deleteMany(canonicalBlocks.map((block) => block.root)));
-
-    // put to blockArchive db and delete block db
-    await Promise.all(promises);
-  }
-
-  return migratedWrappedDataColumns;
-}
-
-/**
- * ```
- * class SignedBeaconBlock(Container):
- *   message: BeaconBlock [offset - 4 bytes]
- *   signature: BLSSignature [fixed - 96 bytes]
- *
- * class BeaconBlock(Container):
- *   slot: Slot [fixed - 8 bytes]
- *   proposer_index: ValidatorIndex [fixed - 8 bytes]
- *   parent_root: Root [fixed - 32 bytes]
- *   state_root: Root
- *   body: BeaconBlockBody
- * ```
- * From byte: `4 + 96 + 8 + 8 = 116`
- * To byte: `116 + 32 = 148`
- */
-export function getParentRootFromSignedBlock(bytes: Uint8Array): Uint8Array {
-  return bytes.slice(116, 148);
-}
-
-/**
- *
- * @param blocks sequence of linear blocks, from child to ancestor.
- * In ProtoArray.getAllAncestorNodes child nodes are pushed first to the returned array.
- */
-export function getNonCheckpointBlocks<T extends {slot: Slot}>(blocks: T[]): T[] {
-  // Iterate from lowest child to highest ancestor
-  // Look for the checkpoint of the lowest epoch
-  // If block at `epoch * SLOTS_PER_EPOCH`, it's a checkpoint.
-  // - Then for the previous epoch all blocks but the 0 are NOT checkpoints
-  // - Otherwise for the previous epoch the last block is a checkpoint
-
-  if (blocks.length < 1) {
-    return [];
-  }
-
-  const nonCheckpointBlocks: T[] = [];
-  // Start with Infinity to always trigger `blockEpoch < epochPtr` in the first loop
-  let epochPtr = Infinity;
-  // Assume worst case, since it's unknown if a future epoch will skip the first slot or not.
-  // This function must return only blocks that are guaranteed to never become checkpoints.
-  let epochPtrHasFirstSlot = false;
-
-  // blocks order: from child to ancestor, decreasing slot
-  for (let i = 0; i < blocks.length; i++) {
-    let isCheckpoint = false;
-    const block = blocks[i];
-    const blockEpoch = computeEpochAtSlot(block.slot);
-
-    if (blockEpoch < epochPtr) {
-      // If future epoch has skipped the first slot, the last block in the previous epoch is a checkpoint
-      if (!epochPtrHasFirstSlot) {
-        isCheckpoint = true;
-      }
-
-      // Reset epoch pointer
-      epochPtr = blockEpoch;
-      epochPtrHasFirstSlot = false;
-    }
-
-    // The block in the first slot of an epoch is always a checkpoint slot
-    if (block.slot % SLOTS_PER_EPOCH === 0) {
-      epochPtrHasFirstSlot = true;
-      isCheckpoint = true;
-    }
-
-    if (!isCheckpoint) {
-      nonCheckpointBlocks.push(block);
-    }
-  }
-
-  return nonCheckpointBlocks;
-}

package/src/chain/archiveStore/utils/pruneHistory.ts

@@ -1,56 +0,0 @@
-import {ChainConfig} from "@lodestar/config";
-import {computeStartSlotAtEpoch} from "@lodestar/state-transition";
-import {Epoch} from "@lodestar/types";
-import {Logger} from "@lodestar/utils";
-import {IBeaconDb} from "../../../db/interface.js";
-import {Metrics} from "../../../metrics/index.js";
-
-export async function pruneHistory(
-  config: ChainConfig,
-  db: IBeaconDb,
-  logger: Logger,
-  metrics: Metrics | null | undefined,
-  finalizedEpoch: Epoch,
-  currentEpoch: Epoch
-): Promise<void> {
-  const blockCutoffEpoch = Math.min(
-    // set by config, with underflow protection
-    Math.max(currentEpoch - config.MIN_EPOCHS_FOR_BLOCK_REQUESTS, 0),
-    // ensure that during (extremely lol) long periods of non-finality we don't delete unfinalized epoch data
-    finalizedEpoch
-  );
-  const blockCutoffSlot = computeStartSlotAtEpoch(blockCutoffEpoch);
-
-  logger.debug("Preparing to prune history", {
-    currentEpoch,
-    finalizedEpoch,
-    blockCutoffEpoch,
-  });
-
-  const step0 = metrics?.pruneHistory.fetchKeys.startTimer();
-  const [blocks, states] = await Promise.all([
-    db.blockArchive.keys({gte: 0, lt: blockCutoffSlot}),
-    db.stateArchive.keys({gte: 0, lt: finalizedEpoch}),
-  ]);
-  step0?.();
-
-  logger.debug("Pruning history", {
-    currentEpoch,
-    blocksToPrune: blocks.length,
-    statesToPrune: states.length,
-  });
-
-  const step1 = metrics?.pruneHistory.pruneKeys.startTimer();
-  await Promise.all([
-    // ->
-    db.blockArchive.batchDelete(blocks),
-    db.stateArchive.batchDelete(states),
-  ]);
-  step1?.();
-
-  logger.debug("Pruned history", {
-    currentEpoch,
-  });
-
-  metrics?.pruneHistory.pruneCount.inc();
-}

package/src/chain/archiveStore/utils/updateBackfillRange.ts

@@ -1,50 +0,0 @@
-import {CheckpointWithHex} from "@lodestar/fork-choice";
-import {Logger} from "@lodestar/logger";
-import {IBeaconDb} from "../../../db/interface.js";
-import {IBeaconChain} from "../../interface.js";
-
-/**
- * Backfill sync relies on verified connected ranges (which are represented as key,value
- * with a verified jump from a key back to value). Since the node could have progressed
- * ahead from, we need to save the forward progress of this node as another backfill
- * range entry, that backfill sync will use to jump back if this node is restarted
- * for any reason.
- * The current backfill has its own backfill entry from anchor slot to last backfilled
- * slot. And this would create the entry from the current finalized slot to the anchor
- * slot.
- */
-export async function updateBackfillRange(
-  {chain, db, logger}: {chain: IBeaconChain; db: IBeaconDb; logger: Logger},
-  finalized: CheckpointWithHex
-): Promise<void> {
-  try {
-    // Mark the sequence in backfill db from finalized block's slot till anchor slot as
-    // filled.
-    const finalizedBlockFC = chain.forkChoice.getBlockHex(finalized.rootHex);
-    if (finalizedBlockFC && finalizedBlockFC.slot > chain.anchorStateLatestBlockSlot) {
-      await db.backfilledRanges.put(finalizedBlockFC.slot, chain.anchorStateLatestBlockSlot);
-
-      // Clear previously marked sequence till anchorStateLatestBlockSlot, without
-      // touching backfill sync process sequence which are at
-      // <=anchorStateLatestBlockSlot i.e. clear >anchorStateLatestBlockSlot
-      // and < currentSlot
-      const filteredSeqs = await db.backfilledRanges.entries({
-        gt: chain.anchorStateLatestBlockSlot,
-        lt: finalizedBlockFC.slot,
-      });
-      logger.debug("updated backfilledRanges", {
-        key: finalizedBlockFC.slot,
-        value: chain.anchorStateLatestBlockSlot,
-      });
-      if (filteredSeqs.length > 0) {
-        await db.backfilledRanges.batchDelete(filteredSeqs.map((entry) => entry.key));
-        logger.debug(
-          `Forward Sync - cleaned up backfilledRanges between ${finalizedBlockFC.slot},${chain.anchorStateLatestBlockSlot}`,
-          {seqs: JSON.stringify(filteredSeqs)}
-        );
-      }
-    }
-  } catch (e) {
-    logger.error("Error updating backfilledRanges on finalization", {epoch: finalized.epoch}, e as Error);
-  }
-}

package/src/chain/balancesCache.ts

@@ -1,52 +0,0 @@
-import {CheckpointWithHex} from "@lodestar/fork-choice";
-import {
-  CachedBeaconStateAllForks,
-  EffectiveBalanceIncrements,
-  computeStartSlotAtEpoch,
-  getBlockRootAtSlot,
-  getEffectiveBalanceIncrementsZeroInactive,
-} from "@lodestar/state-transition";
-import {Epoch, RootHex} from "@lodestar/types";
-import {toRootHex} from "@lodestar/utils";
-
-/** The number of validator balance sets that are cached within `CheckpointBalancesCache`. */
-const MAX_BALANCE_CACHE_SIZE = 4;
-
-type BalancesCacheItem = {
-  rootHex: RootHex;
-  epoch: Epoch;
-  balances: EffectiveBalanceIncrements;
-};
-
-/**
- * Cache EffectiveBalanceIncrements of checkpoint blocks
- */
-export class CheckpointBalancesCache {
-  private readonly items: BalancesCacheItem[] = [];
-
-  /**
-   * Inspect the given `state` and determine the root of the block at the first slot of
-   * `state.current_epoch`. If there is not already some entry for the given block root, then
-   * add the effective balances from the `state` to the cache.
-   */
-  processState(blockRootHex: RootHex, state: CachedBeaconStateAllForks): void {
-    const epoch = state.epochCtx.epoch;
-    const epochBoundarySlot = computeStartSlotAtEpoch(epoch);
-    const epochBoundaryRoot =
-      epochBoundarySlot === state.slot ? blockRootHex : toRootHex(getBlockRootAtSlot(state, epochBoundarySlot));
-
-    const index = this.items.findIndex((item) => item.epoch === epoch && item.rootHex === epochBoundaryRoot);
-    if (index === -1) {
-      if (this.items.length === MAX_BALANCE_CACHE_SIZE) {
-        this.items.shift();
-      }
-      // expect to reach this once per epoch
-      this.items.push({epoch, rootHex: epochBoundaryRoot, balances: getEffectiveBalanceIncrementsZeroInactive(state)});
-    }
-  }
-
-  get(checkpoint: CheckpointWithHex): EffectiveBalanceIncrements | undefined {
-    const {rootHex, epoch} = checkpoint;
-    return this.items.find((item) => item.epoch === epoch && item.rootHex === rootHex)?.balances;
-  }
-}

package/src/chain/beaconProposerCache.ts

@@ -1,43 +0,0 @@
-import {routes} from "@lodestar/api";
-import {Epoch} from "@lodestar/types";
-import {MapDef} from "@lodestar/utils";
-
-const PROPOSER_PRESERVE_EPOCHS = 2;
-
-export type ProposerPreparationData = routes.validator.ProposerPreparationData;
-
-export class BeaconProposerCache {
-  private readonly feeRecipientByValidatorIndex: MapDef<number, {epoch: Epoch; feeRecipient: string}>;
-  constructor(opts: {suggestedFeeRecipient: string}) {
-    this.feeRecipientByValidatorIndex = new MapDef(() => ({
-      epoch: 0,
-      feeRecipient: opts.suggestedFeeRecipient,
-    }));
-  }
-
-  add(epoch: Epoch, {validatorIndex, feeRecipient}: ProposerPreparationData): void {
-    this.feeRecipientByValidatorIndex.set(validatorIndex, {epoch, feeRecipient});
-  }
-
-  prune(epoch: Epoch): void {
-    // This is not so optimized function, but could maintain a 2d array may be?
-    for (const [validatorIndex, feeRecipientEntry] of this.feeRecipientByValidatorIndex.entries()) {
-      // We only retain an entry for PROPOSER_PRESERVE_EPOCHS epochs
-      if (feeRecipientEntry.epoch + PROPOSER_PRESERVE_EPOCHS < epoch) {
-        this.feeRecipientByValidatorIndex.delete(validatorIndex);
-      }
-    }
-  }
-
-  getOrDefault(proposerIndex: number): string {
-    return this.feeRecipientByValidatorIndex.getOrDefault(proposerIndex).feeRecipient;
-  }
-
-  get(proposerIndex: number): string | undefined {
-    return this.feeRecipientByValidatorIndex.get(proposerIndex)?.feeRecipient;
-  }
-
-  getValidatorIndices(): number[] {
-    return Array.from(this.feeRecipientByValidatorIndex.keys());
-  }
-}