@lodestar/beacon-node 1.40.0-dev.9defa5c09b → 1.40.0-dev.ade3accfa0

package/src/sync/backfill/verify.ts

@@ -1,6 +1,6 @@
 import {BeaconConfig} from "@lodestar/config";
 import {GENESIS_SLOT} from "@lodestar/params";
-import {ISignatureSet, Index2PubkeyCache, getBlockProposerSignatureSet} from "@lodestar/state-transition";
+import {ISignatureSet, getBlockProposerSignatureSet} from "@lodestar/state-transition";
 import {Root, SignedBeaconBlock, Slot, ssz} from "@lodestar/types";
 import {IBlsVerifier} from "../../chain/bls/index.js";
 import {BackfillSyncError, BackfillSyncErrorCode} from "./errors.js";
@@ -42,14 +42,13 @@ export function verifyBlockSequence(
 
 export async function verifyBlockProposerSignature(
   config: BeaconConfig,
-  index2pubkey: Index2PubkeyCache,
   bls: IBlsVerifier,
   blocks: SignedBeaconBlock[]
 ): Promise<void> {
   if (blocks.length === 1 && blocks[0].message.slot === GENESIS_SLOT) return;
   const signatures = blocks.reduce((sigs: ISignatureSet[], block) => {
     // genesis block doesn't have valid signature
-    if (block.message.slot !== GENESIS_SLOT) sigs.push(getBlockProposerSignatureSet(config, index2pubkey, block));
+    if (block.message.slot !== GENESIS_SLOT) sigs.push(getBlockProposerSignatureSet(config, block));
     return sigs;
   }, []);
 

package/src/sync/utils/downloadByRange.ts

@@ -8,7 +8,7 @@ import {
   isForkPostGloas,
 } from "@lodestar/params";
 import {SignedBeaconBlock, Slot, deneb, fulu, phase0} from "@lodestar/types";
-import {LodestarError, Logger, fromHex, prettyPrintIndices, toRootHex} from "@lodestar/utils";
+import {LodestarError, Logger, byteArrayEquals, fromHex, prettyPrintIndices, toRootHex} from "@lodestar/utils";
 import {
   BlockInputSource,
   DAType,
@@ -475,7 +475,7 @@ export function validateBlockByRangeResponse(
     if (i < blocks.length - 1) {
       // compare the block root against the next block's parent root
       const parentRoot = blocks[i + 1].message.parentRoot;
-      if (Buffer.compare(blockRoot, parentRoot) !== 0) {
+      if (!byteArrayEquals(blockRoot, parentRoot)) {
         throw new DownloadByRangeError(
           {
             code: DownloadByRangeErrorCode.PARENT_ROOT_MISMATCH,

package/src/sync/utils/downloadByRoot.ts

@@ -9,7 +9,7 @@ import {
   isForkPostFulu,
 } from "@lodestar/params";
 import {BeaconBlockBody, BlobIndex, ColumnIndex, SignedBeaconBlock, Slot, deneb, fulu} from "@lodestar/types";
-import {LodestarError, fromHex, prettyPrintIndices, toHex, toRootHex} from "@lodestar/utils";
+import {LodestarError, byteArrayEquals, fromHex, prettyPrintIndices, toHex, toRootHex} from "@lodestar/utils";
 import {isBlockInputBlobs, isBlockInputColumns} from "../../chain/blocks/blockInput/blockInput.js";
 import {BlockInputSource, IBlockInput} from "../../chain/blocks/blockInput/types.js";
 import {ChainEventEmitter} from "../../chain/emitter.js";
@@ -19,7 +19,6 @@ import {validateBlockDataColumnSidecars} from "../../chain/validation/dataColumn
 import {INetwork} from "../../network/interface.js";
 import {PeerSyncMeta} from "../../network/peers/peersData.js";
 import {prettyPrintPeerIdStr} from "../../network/util.js";
-import {byteArrayEquals} from "../../util/bytes.js";
 import {PeerIdStr} from "../../util/peerId.js";
 import {WarnResult} from "../../util/wrapError.js";
 import {

package/src/util/queue/itemQueue.ts

@@ -24,6 +24,8 @@ export class JobItemQueue<Args extends any[], R> {
   private readonly metrics?: QueueMetrics;
   private runningJobs = 0;
   private lastYield = 0;
+  /** Resolvers waiting for space in the queue */
+  private spaceWaiters: (() => void)[] = [];
 
   constructor(
     private readonly itemProcessor: (...args: Args) => Promise<R>,
@@ -72,12 +74,57 @@ export class JobItemQueue<Args extends any[], R> {
     });
   }
 
+  /**
+   * Returns a promise that resolves when there is space in the queue.
+   * If the queue already has space, resolves immediately (noop).
+   * Use this to apply backpressure when the caller should wait rather than
+   * have push() throw QUEUE_MAX_LENGTH.
+   */
+  async waitForSpace(): Promise<void> {
+    if (this.opts.signal.aborted) {
+      throw new QueueError({code: QueueErrorCode.QUEUE_ABORTED});
+    }
+
+    if (this.jobs.length < this.opts.maxLength) {
+      return;
+    }
+
+    return new Promise<void>((resolve, reject) => {
+      let settled = false;
+
+      const onAbort = (): void => {
+        if (settled) return;
+        settled = true;
+        const index = this.spaceWaiters.indexOf(wrappedResolve);
+        if (index >= 0) {
+          this.spaceWaiters.splice(index, 1);
+        }
+        reject(new QueueError({code: QueueErrorCode.QUEUE_ABORTED}));
+      };
+
+      const wrappedResolve = (): void => {
+        if (settled) return;
+        settled = true;
+        this.opts.signal.removeEventListener("abort", onAbort);
+        resolve();
+      };
+
+      this.spaceWaiters.push(wrappedResolve);
+      this.opts.signal.addEventListener("abort", onAbort, {once: true});
+
+      // Re-check after attaching listener to close the race window where
+      // signal.abort() fires between the initial check and addEventListener
+      if (this.opts.signal.aborted) onAbort();
+    });
+  }
+
   getItems(): {args: Args; addedTimeMs: number}[] {
     return this.jobs.map((job) => ({args: job.args, addedTimeMs: job.addedTimeMs}));
   }
 
   dropAllJobs = (): void => {
     this.jobs.clear();
+    this.notifySpaceWaiters();
   };
 
   private runJob = async (): Promise<void> => {
@@ -115,10 +162,25 @@ export class JobItemQueue<Args extends any[], R> {
 
     this.runningJobs = Math.max(0, this.runningJobs - 1);
 
+    // Notify any waiters that space is available
+    this.notifySpaceWaiters();
+
     // Potentially run a new job
     void this.runJob();
   };
 
+  private notifySpaceWaiters(): void {
+    // Compute available slots once to avoid thundering herd: resolved waiters
+    // won't push() until the next microtask, so jobs.length doesn't change
+    // inside this loop. Without the cap we'd wake ALL waiters on a single slot.
+    let available = this.opts.maxLength - this.jobs.length;
+    while (available > 0 && this.spaceWaiters.length > 0) {
+      const resolve = this.spaceWaiters.shift();
+      if (resolve) resolve();
+      available--;
+    }
+  }
+
   private abortAllJobs = (): void => {
     while (this.jobs.length > 0) {
       const job = this.jobs.pop();

package/lib/chain/stateCache/blockStateCacheImpl.d.ts

@@ -1,54 +0,0 @@
-import { routes } from "@lodestar/api";
-import { CachedBeaconStateAllForks } from "@lodestar/state-transition";
-import { Epoch, RootHex } from "@lodestar/types";
-import { Metrics } from "../../metrics/index.js";
-import { BlockStateCache } from "./types.js";
-/**
- * Old implementation of StateCache (used to call `StateContextCache`)
- * - Prune per checkpoint so number of states ranges from 96 to 128
- * - Keep a separate head state to make sure it is always available
- */
-export declare class BlockStateCacheImpl implements BlockStateCache {
-    /**
-     * Max number of states allowed in the cache
-     */
-    readonly maxStates: number;
-    private readonly cache;
-    /** Epoch -> Set<blockRoot> */
-    private readonly epochIndex;
-    private readonly metrics;
-    /**
-     * Strong reference to prevent head state from being pruned.
-     * null if head state is being regen and not available at the moment.
-     */
-    private head;
-    constructor({ maxStates, metrics }: {
-        maxStates?: number;
-        metrics?: Metrics | null;
-    });
-    get(rootHex: RootHex): CachedBeaconStateAllForks | null;
-    add(item: CachedBeaconStateAllForks): void;
-    setHeadState(item: CachedBeaconStateAllForks | null): void;
-    /**
-     * Get a seed state for state reload.
-     * This is to conform to the api only as this cache is not used in n-historical state.
-     * See ./fifoBlockStateCache.ts for implementation
-     */
-    getSeedState(): CachedBeaconStateAllForks;
-    clear(): void;
-    get size(): number;
-    /**
-     * TODO make this more robust.
-     * Without more thought, this currently breaks our assumptions about recent state availablity
-     */
-    prune(headStateRootHex: RootHex): void;
-    /**
-     * Prune per finalized epoch.
-     */
-    deleteAllBeforeEpoch(finalizedEpoch: Epoch): void;
-    /** ONLY FOR DEBUGGING PURPOSES. For lodestar debug API */
-    dumpSummary(): routes.lodestar.StateCacheItem[];
-    getStates(): IterableIterator<CachedBeaconStateAllForks>;
-    private deleteAllEpochItems;
-}
-//# sourceMappingURL=blockStateCacheImpl.d.ts.map

package/lib/chain/stateCache/blockStateCacheImpl.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"blockStateCacheImpl.d.ts","sourceRoot":"","sources":["../../../src/chain/stateCache/blockStateCacheImpl.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,eAAe,CAAC;AACrC,OAAO,EAAC,yBAAyB,EAAC,MAAM,4BAA4B,CAAC;AACrE,OAAO,EAAC,KAAK,EAAE,OAAO,EAAC,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAC,OAAO,EAAC,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAC,eAAe,EAAC,MAAM,YAAY,CAAC;AAI3C;;;;GAIG;AACH,qBAAa,mBAAoB,YAAW,eAAe;IACzD;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAE3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgD;IACtE,8BAA8B;IAC9B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAiC;IAC5D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA2C;IACnE;;;OAGG;IACH,OAAO,CAAC,IAAI,CAAuE;gBAEvE,EAAC,SAAsB,EAAE,OAAO,EAAC,EAAE;QAAC,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,GAAG,IAAI,CAAA;KAAC;IAS7F,GAAG,CAAC,OAAO,EAAE,OAAO,GAAG,yBAAyB,GAAG,IAAI;IAavD,GAAG,CAAC,IAAI,EAAE,yBAAyB,GAAG,IAAI;IAgB1C,YAAY,CAAC,IAAI,EAAE,yBAAyB,GAAG,IAAI,GAAG,IAAI;IAS1D;;;;OAIG;IACH,YAAY,IAAI,yBAAyB;IAIzC,KAAK,IAAI,IAAI;IAKb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;OAGG;IACH,KAAK,CAAC,gBAAgB,EAAE,OAAO,GAAG,IAAI;IAgBtC;;OAEG;IACH,oBAAoB,CAAC,cAAc,EAAE,KAAK,GAAG,IAAI;IAQjD,0DAA0D;IAC1D,WAAW,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE;IAU/C,SAAS,IAAI,gBAAgB,CAAC,yBAAyB,CAAC;IAIxD,OAAO,CAAC,mBAAmB;CAM5B"}

package/lib/chain/stateCache/blockStateCacheImpl.js

@@ -1,130 +0,0 @@
-import { toRootHex } from "@lodestar/utils";
-import { MapTracker } from "./mapMetrics.js";
-const MAX_STATES = 3 * 32;
-/**
- * Old implementation of StateCache (used to call `StateContextCache`)
- * - Prune per checkpoint so number of states ranges from 96 to 128
- * - Keep a separate head state to make sure it is always available
- */
-export class BlockStateCacheImpl {
-    /**
-     * Max number of states allowed in the cache
-     */
-    maxStates;
-    cache;
-    /** Epoch -> Set<blockRoot> */
-    epochIndex = new Map();
-    metrics;
-    /**
-     * Strong reference to prevent head state from being pruned.
-     * null if head state is being regen and not available at the moment.
-     */
-    head = null;
-    constructor({ maxStates = MAX_STATES, metrics }) {
-        this.maxStates = maxStates;
-        this.cache = new MapTracker(metrics?.stateCache);
-        if (metrics) {
-            this.metrics = metrics.stateCache;
-            metrics.stateCache.size.addCollect(() => metrics.stateCache.size.set(this.cache.size));
-        }
-    }
-    get(rootHex) {
-        this.metrics?.lookups.inc();
-        const item = this.head?.stateRoot === rootHex ? this.head.state : this.cache.get(rootHex);
-        if (!item) {
-            return null;
-        }
-        this.metrics?.hits.inc();
-        this.metrics?.stateClonedCount.observe(item.clonedCount);
-        return item;
-    }
-    add(item) {
-        const key = toRootHex(item.hashTreeRoot());
-        if (this.cache.get(key)) {
-            return;
-        }
-        this.metrics?.adds.inc();
-        this.cache.set(key, item);
-        const epoch = item.epochCtx.epoch;
-        const blockRoots = this.epochIndex.get(epoch);
-        if (blockRoots) {
-            blockRoots.add(key);
-        }
-        else {
-            this.epochIndex.set(epoch, new Set([key]));
-        }
-    }
-    setHeadState(item) {
-        if (item) {
-            const key = toRootHex(item.hashTreeRoot());
-            this.head = { state: item, stateRoot: key };
-        }
-        else {
-            this.head = null;
-        }
-    }
-    /**
-     * Get a seed state for state reload.
-     * This is to conform to the api only as this cache is not used in n-historical state.
-     * See ./fifoBlockStateCache.ts for implementation
-     */
-    getSeedState() {
-        throw Error("Not implemented for BlockStateCacheImpl");
-    }
-    clear() {
-        this.cache.clear();
-        this.epochIndex.clear();
-    }
-    get size() {
-        return this.cache.size;
-    }
-    /**
-     * TODO make this more robust.
-     * Without more thought, this currently breaks our assumptions about recent state availablity
-     */
-    prune(headStateRootHex) {
-        const keys = Array.from(this.cache.keys());
-        if (keys.length > this.maxStates) {
-            // object keys are stored in insertion order, delete keys starting from the front
-            for (const key of keys.slice(0, keys.length - this.maxStates)) {
-                if (key !== headStateRootHex) {
-                    const item = this.cache.get(key);
-                    if (item) {
-                        this.epochIndex.get(item.epochCtx.epoch)?.delete(key);
-                        this.cache.delete(key);
-                    }
-                }
-            }
-        }
-    }
-    /**
-     * Prune per finalized epoch.
-     */
-    deleteAllBeforeEpoch(finalizedEpoch) {
-        for (const epoch of this.epochIndex.keys()) {
-            if (epoch < finalizedEpoch) {
-                this.deleteAllEpochItems(epoch);
-            }
-        }
-    }
-    /** ONLY FOR DEBUGGING PURPOSES. For lodestar debug API */
-    dumpSummary() {
-        return Array.from(this.cache.entries()).map(([key, state]) => ({
-            slot: state.slot,
-            root: toRootHex(state.hashTreeRoot()),
-            reads: this.cache.readCount.get(key) ?? 0,
-            lastRead: this.cache.lastRead.get(key) ?? 0,
-            checkpointState: false,
-        }));
-    }
-    getStates() {
-        return this.cache.values();
-    }
-    deleteAllEpochItems(epoch) {
-        for (const rootHex of this.epochIndex.get(epoch) || []) {
-            this.cache.delete(rootHex);
-        }
-        this.epochIndex.delete(epoch);
-    }
-}
-//# sourceMappingURL=blockStateCacheImpl.js.map

package/lib/chain/stateCache/blockStateCacheImpl.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"blockStateCacheImpl.js","sourceRoot":"","sources":["../../../src/chain/stateCache/blockStateCacheImpl.ts"],"names":[],"mappings":"AAGA,OAAO,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAE1C,OAAO,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAG3C,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,CAAC;AAE1B;;;;GAIG;AACH,MAAM,OAAO,mBAAmB;IAC9B;;OAEG;IACM,SAAS,CAAS;IAEV,KAAK,CAAgD;IACtE,8BAA8B;IACb,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,OAAO,CAA2C;IACnE;;;OAGG;IACK,IAAI,GAAkE,IAAI,CAAC;IAEnF,YAAY,EAAC,SAAS,GAAG,UAAU,EAAE,OAAO,EAAiD;QAC3F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACjD,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC;YAClC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IAED,GAAG,CAAC,OAAgB;QAClB,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1F,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG,CAAC,IAA+B;QACjC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,UAAU,EAAE,CAAC;YACf,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,YAAY,CAAC,IAAsC;QACjD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI,GAAG,EAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,MAAM,KAAK,CAAC,yCAAyC,CAAC,CAAC;IACzD,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,gBAAyB;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,iFAAiF;YACjF,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9D,IAAI,GAAG,KAAK,gBAAgB,EAAE,CAAC;oBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACjC,IAAI,IAAI,EAAE,CAAC;wBACT,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;wBACtD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,cAAqB;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC;gBAC3B,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7D,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YACzC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAC3C,eAAe,EAAE,KAAK;SACvB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAEO,mBAAmB,CAAC,KAAY;QACtC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;CACF"}

package/lib/chain/stateCache/inMemoryCheckpointsCache.d.ts

@@ -1,60 +0,0 @@
-import { routes } from "@lodestar/api";
-import { CachedBeaconStateAllForks } from "@lodestar/state-transition";
-import { Epoch, RootHex, phase0 } from "@lodestar/types";
-import { Metrics } from "../../metrics/index.js";
-import { CheckpointStateCache } from "./types.js";
-export type CheckpointHex = {
-    epoch: Epoch;
-    rootHex: RootHex;
-};
-/**
- * In memory cache of CachedBeaconState
- * belonging to checkpoint
- *
- * Similar API to Repository
- */
-export declare class InMemoryCheckpointStateCache implements CheckpointStateCache {
-    private readonly cache;
-    /** Epoch -> Set<blockRoot> */
-    private readonly epochIndex;
-    /**
-     * Max number of epochs allowed in the cache
-     */
-    private readonly maxEpochs;
-    private readonly metrics;
-    private preComputedCheckpoint;
-    private preComputedCheckpointHits;
-    constructor({ metrics }: {
-        metrics?: Metrics | null;
-    }, { maxEpochs }?: {
-        maxEpochs?: number;
-    });
-    getOrReload(cp: CheckpointHex): Promise<CachedBeaconStateAllForks | null>;
-    getStateOrBytes(cp: CheckpointHex): Promise<Uint8Array | CachedBeaconStateAllForks | null>;
-    getOrReloadLatest(rootHex: string, maxEpoch: number): Promise<CachedBeaconStateAllForks | null>;
-    processState(): Promise<number>;
-    get(cp: CheckpointHex): CachedBeaconStateAllForks | null;
-    add(cp: phase0.Checkpoint, item: CachedBeaconStateAllForks): void;
-    /**
-     * Searches for the latest cached state with a `root`, starting with `epoch` and descending
-     */
-    getLatest(rootHex: RootHex, maxEpoch: Epoch): CachedBeaconStateAllForks | null;
-    /**
-     * Update the precomputed checkpoint and return the number of his for the
-     * previous one (if any).
-     */
-    updatePreComputedCheckpoint(rootHex: RootHex, epoch: Epoch): number | null;
-    pruneFinalized(finalizedEpoch: Epoch): void;
-    prune(finalizedEpoch: Epoch, justifiedEpoch: Epoch): void;
-    delete(cp: phase0.Checkpoint): void;
-    deleteAllEpochItems(epoch: Epoch): void;
-    clear(): void;
-    /** ONLY FOR DEBUGGING PURPOSES. For lodestar debug API */
-    dumpSummary(): routes.lodestar.StateCacheItem[];
-    getStates(): IterableIterator<CachedBeaconStateAllForks>;
-    /** ONLY FOR DEBUGGING PURPOSES. For spec tests on error */
-    dumpCheckpointKeys(): string[];
-}
-export declare function toCheckpointHex(checkpoint: phase0.Checkpoint): CheckpointHex;
-export declare function toCheckpointKey(cp: CheckpointHex): string;
-//# sourceMappingURL=inMemoryCheckpointsCache.d.ts.map

package/lib/chain/stateCache/inMemoryCheckpointsCache.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"inMemoryCheckpointsCache.d.ts","sourceRoot":"","sources":["../../../src/chain/stateCache/inMemoryCheckpointsCache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,eAAe,CAAC;AACrC,OAAO,EAAC,yBAAyB,EAAC,MAAM,4BAA4B,CAAC;AACrE,OAAO,EAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAC,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAC,OAAO,EAAC,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAgB,oBAAoB,EAAC,MAAM,YAAY,CAAC;AAE/D,MAAM,MAAM,aAAa,GAAG;IAAC,KAAK,EAAE,KAAK,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAC,CAAC;AAG7D;;;;;GAKG;AACH,qBAAa,4BAA6B,YAAW,oBAAoB;IACvE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgD;IACtE,8BAA8B;IAC9B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA2D;IACtF;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA6C;IACrE,OAAO,CAAC,qBAAqB,CAAuB;IACpD,OAAO,CAAC,yBAAyB,CAAuB;gBAE5C,EAAC,OAAc,EAAC,EAAE;QAAC,OAAO,CAAC,EAAE,OAAO,GAAG,IAAI,CAAA;KAAC,EAAE,EAAC,SAAsB,EAAC,GAAE;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAM;IAcvG,WAAW,CAAC,EAAE,EAAE,aAAa,GAAG,OAAO,CAAC,yBAAyB,GAAG,IAAI,CAAC;IAIzE,eAAe,CAAC,EAAE,EAAE,aAAa,GAAG,OAAO,CAAC,UAAU,GAAG,yBAAyB,GAAG,IAAI,CAAC;IAI1F,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,yBAAyB,GAAG,IAAI,CAAC;IAI/F,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC;IAKrC,GAAG,CAAC,EAAE,EAAE,aAAa,GAAG,yBAAyB,GAAG,IAAI;IAoBxD,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE,IAAI,EAAE,yBAAyB,GAAG,IAAI;IAWjE;;OAEG;IACH,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,GAAG,yBAAyB,GAAG,IAAI;IAa9E;;;OAGG;IACH,2BAA2B,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI;IAO1E,cAAc,CAAC,cAAc,EAAE,KAAK,GAAG,IAAI;IAQ3C,KAAK,CAAC,cAAc,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,GAAG,IAAI;IAWzD,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,UAAU,GAAG,IAAI;IAYnC,mBAAmB,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;IAOvC,KAAK,IAAI,IAAI;IAKb,0DAA0D;IAC1D,WAAW,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,EAAE;IAU/C,SAAS,IAAI,gBAAgB,CAAC,yBAAyB,CAAC;IAIxD,2DAA2D;IAC3D,kBAAkB,IAAI,MAAM,EAAE;CAG/B;AAED,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,GAAG,aAAa,CAK5E;AAED,wBAAgB,eAAe,CAAC,EAAE,EAAE,aAAa,GAAG,MAAM,CAEzD"}

package/lib/chain/stateCache/inMemoryCheckpointsCache.js

@@ -1,156 +0,0 @@
-import { MapDef, toRootHex } from "@lodestar/utils";
-import { MapTracker } from "./mapMetrics.js";
-import { CacheItemType } from "./types.js";
-const MAX_EPOCHS = 10;
-/**
- * In memory cache of CachedBeaconState
- * belonging to checkpoint
- *
- * Similar API to Repository
- */
-export class InMemoryCheckpointStateCache {
-    cache;
-    /** Epoch -> Set<blockRoot> */
-    epochIndex = new MapDef(() => new Set());
-    /**
-     * Max number of epochs allowed in the cache
-     */
-    maxEpochs;
-    metrics;
-    preComputedCheckpoint = null;
-    preComputedCheckpointHits = null;
-    constructor({ metrics = null }, { maxEpochs = MAX_EPOCHS } = {}) {
-        this.cache = new MapTracker(metrics?.cpStateCache);
-        if (metrics) {
-            this.metrics = metrics.cpStateCache;
-            metrics.cpStateCache.size.addCollect(() => metrics.cpStateCache.size.set({ type: CacheItemType.inMemory }, this.cache.size));
-            metrics.cpStateCache.epochSize.addCollect(() => metrics.cpStateCache.epochSize.set({ type: CacheItemType.inMemory }, this.epochIndex.size));
-        }
-        this.maxEpochs = maxEpochs;
-    }
-    async getOrReload(cp) {
-        return this.get(cp);
-    }
-    async getStateOrBytes(cp) {
-        return this.get(cp);
-    }
-    async getOrReloadLatest(rootHex, maxEpoch) {
-        return this.getLatest(rootHex, maxEpoch);
-    }
-    async processState() {
-        // do nothing, this class does not support prunning
-        return 0;
-    }
-    get(cp) {
-        this.metrics?.lookups.inc();
-        const cpKey = toCheckpointKey(cp);
-        const item = this.cache.get(cpKey);
-        if (!item) {
-            return null;
-        }
-        this.metrics?.hits.inc();
-        if (cpKey === this.preComputedCheckpoint) {
-            this.preComputedCheckpointHits = (this.preComputedCheckpointHits ?? 0) + 1;
-        }
-        this.metrics?.stateClonedCount.observe(item.clonedCount);
-        return item;
-    }
-    add(cp, item) {
-        const cpHex = toCheckpointHex(cp);
-        const key = toCheckpointKey(cpHex);
-        if (this.cache.has(key)) {
-            return;
-        }
-        this.metrics?.adds.inc();
-        this.cache.set(key, item);
-        this.epochIndex.getOrDefault(cp.epoch).add(cpHex.rootHex);
-    }
-    /**
-     * Searches for the latest cached state with a `root`, starting with `epoch` and descending
-     */
-    getLatest(rootHex, maxEpoch) {
-        // sort epochs in descending order, only consider epochs lte `epoch`
-        const epochs = Array.from(this.epochIndex.keys())
-            .sort((a, b) => b - a)
-            .filter((e) => e <= maxEpoch);
-        for (const epoch of epochs) {
-            if (this.epochIndex.get(epoch)?.has(rootHex)) {
-                return this.get({ rootHex, epoch });
-            }
-        }
-        return null;
-    }
-    /**
-     * Update the precomputed checkpoint and return the number of his for the
-     * previous one (if any).
-     */
-    updatePreComputedCheckpoint(rootHex, epoch) {
-        const previousHits = this.preComputedCheckpointHits;
-        this.preComputedCheckpoint = toCheckpointKey({ rootHex, epoch });
-        this.preComputedCheckpointHits = 0;
-        return previousHits;
-    }
-    pruneFinalized(finalizedEpoch) {
-        for (const epoch of this.epochIndex.keys()) {
-            if (epoch < finalizedEpoch) {
-                this.deleteAllEpochItems(epoch);
-            }
-        }
-    }
-    prune(finalizedEpoch, justifiedEpoch) {
-        const epochs = Array.from(this.epochIndex.keys()).filter((epoch) => epoch !== finalizedEpoch && epoch !== justifiedEpoch);
-        if (epochs.length > this.maxEpochs) {
-            for (const epoch of epochs.slice(0, epochs.length - this.maxEpochs)) {
-                this.deleteAllEpochItems(epoch);
-            }
-        }
-    }
-    delete(cp) {
-        this.cache.delete(toCheckpointKey(toCheckpointHex(cp)));
-        const epochKey = toRootHex(cp.root);
-        const value = this.epochIndex.get(cp.epoch);
-        if (value) {
-            value.delete(epochKey);
-            if (value.size === 0) {
-                this.epochIndex.delete(cp.epoch);
-            }
-        }
-    }
-    deleteAllEpochItems(epoch) {
-        for (const rootHex of this.epochIndex.get(epoch) || []) {
-            this.cache.delete(toCheckpointKey({ rootHex, epoch }));
-        }
-        this.epochIndex.delete(epoch);
-    }
-    clear() {
-        this.cache.clear();
-        this.epochIndex.clear();
-    }
-    /** ONLY FOR DEBUGGING PURPOSES. For lodestar debug API */
-    dumpSummary() {
-        return Array.from(this.cache.entries()).map(([key, state]) => ({
-            slot: state.slot,
-            root: toRootHex(state.hashTreeRoot()),
-            reads: this.cache.readCount.get(key) ?? 0,
-            lastRead: this.cache.lastRead.get(key) ?? 0,
-            checkpointState: true,
-        }));
-    }
-    getStates() {
-        return this.cache.values();
-    }
-    /** ONLY FOR DEBUGGING PURPOSES. For spec tests on error */
-    dumpCheckpointKeys() {
-        return Array.from(this.cache.keys());
-    }
-}
-export function toCheckpointHex(checkpoint) {
-    return {
-        epoch: checkpoint.epoch,
-        rootHex: toRootHex(checkpoint.root),
-    };
-}
-export function toCheckpointKey(cp) {
-    return `${cp.rootHex}:${cp.epoch}`;
-}
-//# sourceMappingURL=inMemoryCheckpointsCache.js.map

package/lib/chain/stateCache/inMemoryCheckpointsCache.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"inMemoryCheckpointsCache.js","sourceRoot":"","sources":["../../../src/chain/stateCache/inMemoryCheckpointsCache.ts"],"names":[],"mappings":"AAGA,OAAO,EAAC,MAAM,EAAE,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAElD,OAAO,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAC,aAAa,EAAuB,MAAM,YAAY,CAAC;AAG/D,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB;;;;;GAKG;AACH,MAAM,OAAO,4BAA4B;IACtB,KAAK,CAAgD;IACtE,8BAA8B;IACb,UAAU,GAAG,IAAI,MAAM,CAAqB,GAAG,EAAE,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC;IACtF;;OAEG;IACc,SAAS,CAAS;IAClB,OAAO,CAA6C;IAC7D,qBAAqB,GAAkB,IAAI,CAAC;IAC5C,yBAAyB,GAAkB,IAAI,CAAC;IAExD,YAAY,EAAC,OAAO,GAAG,IAAI,EAA6B,EAAE,EAAC,SAAS,GAAG,UAAU,KAA0B,EAAE;QAC3G,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QACnD,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;YACpC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CACxC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,QAAQ,EAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAC/E,CAAC;YACF,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAE,CAC7C,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,QAAQ,EAAC,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CACzF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,EAAiB;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,EAAiB;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,OAAe,EAAE,QAAgB;QACvD,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,mDAAmD;QACnD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG,CAAC,EAAiB;QACnB,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QAEzB,IAAI,KAAK,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YACzC,IAAI,CAAC,yBAAyB,GAAG,CAAC,IAAI,CAAC,yBAAyB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,gBAAgB,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG,CAAC,EAAqB,EAAE,IAA+B;QACxD,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,OAAgB,EAAE,QAAe;QACzC,oEAAoE;QACpE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;aAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;aACrB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,EAAC,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,2BAA2B,CAAC,OAAgB,EAAE,KAAY;QACxD,MAAM,YAAY,GAAG,IAAI,CAAC,yBAAyB,CAAC;QACpD,IAAI,CAAC,qBAAqB,GAAG,eAAe,CAAC,EAAC,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,yBAAyB,GAAG,CAAC,CAAC;QACnC,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,cAAc,CAAC,cAAqB;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC;gBAC3B,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,cAAqB,EAAE,cAAqB;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CACtD,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,cAAc,IAAI,KAAK,KAAK,cAAc,CAChE,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACpE,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,EAAqB;QAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,KAAY;QAC9B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,eAAe,CAAC,EAAC,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,0DAA0D;IAC1D,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7D,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YACzC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAC3C,eAAe,EAAE,IAAI;SACtB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED,2DAA2D;IAC3D,kBAAkB;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;CACF;AAED,MAAM,UAAU,eAAe,CAAC,UAA6B;IAC3D,OAAO;QACL,KAAK,EAAE,UAAU,CAAC,KAAK;QACvB,OAAO,EAAE,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC;KACpC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,EAAiB;IAC/C,OAAO,GAAG,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;AACrC,CAAC"}

package/lib/util/bytes.d.ts

@@ -1,3 +0,0 @@
-import { Root } from "@lodestar/types";
-export declare function byteArrayEquals(a: Uint8Array | Root, b: Uint8Array | Root): boolean;
-//# sourceMappingURL=bytes.d.ts.map

package/lib/util/bytes.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bytes.d.ts","sourceRoot":"","sources":["../../src/util/bytes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,IAAI,EAAC,MAAM,iBAAiB,CAAC;AAErC,wBAAgB,eAAe,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,EAAE,CAAC,EAAE,UAAU,GAAG,IAAI,GAAG,OAAO,CAQnF"}

package/lib/util/bytes.js

@@ -1,11 +0,0 @@
-export function byteArrayEquals(a, b) {
-    if (a.length !== b.length) {
-        return false;
-    }
-    for (let i = 0; i < a.length; i++) {
-        if (a[i] !== b[i])
-            return false;
-    }
-    return true;
-}
-//# sourceMappingURL=bytes.js.map

package/lib/util/bytes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bytes.js","sourceRoot":"","sources":["../../src/util/bytes.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,eAAe,CAAC,CAAoB,EAAE,CAAoB;IACxE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}