@lodestar/beacon-node 1.38.0 → 1.39.0-dev.100ab480bb

package/lib/eth1/utils/deposits.js

@@ -1,47 +0,0 @@
-import { Tree, toGindex } from "@chainsafe/persistent-merkle-tree";
-import { getEth1DepositCount } from "@lodestar/state-transition";
-import { ssz } from "@lodestar/types";
-import { toRootHex } from "@lodestar/utils";
-import { Eth1Error, Eth1ErrorCode } from "../errors.js";
-export async function getDeposits(
-// eth1_deposit_index represents the next deposit index to be added
-state, eth1Data, depositsGetter) {
-    const depositIndex = state.eth1DepositIndex;
-    const depositCount = eth1Data.depositCount;
-    if (depositIndex > depositCount) {
-        throw new Eth1Error({ code: Eth1ErrorCode.DEPOSIT_INDEX_TOO_HIGH, depositIndex, depositCount });
-    }
-    const depositsLen = getEth1DepositCount(state, eth1Data);
-    if (depositsLen === 0) {
-        return []; // If depositsLen === 0, we can return early since no deposit with be returned from depositsGetter
-    }
-    const indexRange = { gte: depositIndex, lt: depositIndex + depositsLen };
-    const deposits = await depositsGetter(indexRange, eth1Data);
-    if (deposits.length < depositsLen) {
-        throw new Eth1Error({ code: Eth1ErrorCode.NOT_ENOUGH_DEPOSITS, len: deposits.length, expectedLen: depositsLen });
-    }
-    if (deposits.length > depositsLen) {
-        throw new Eth1Error({ code: Eth1ErrorCode.TOO_MANY_DEPOSITS, len: deposits.length, expectedLen: depositsLen });
-    }
-    return deposits;
-}
-export function getDepositsWithProofs(depositEvents, depositRootTree, eth1Data) {
-    // Get tree at this particular depositCount to compute correct proofs
-    const viewAtDepositCount = depositRootTree.sliceTo(eth1Data.depositCount - 1);
-    const depositRoot = viewAtDepositCount.hashTreeRoot();
-    if (!ssz.Root.equals(depositRoot, eth1Data.depositRoot)) {
-        throw new Eth1Error({
-            code: Eth1ErrorCode.WRONG_DEPOSIT_ROOT,
-            root: toRootHex(depositRoot),
-            expectedRoot: toRootHex(eth1Data.depositRoot),
-        });
-    }
-    // Already commited for .hashTreeRoot()
-    const treeAtDepositCount = new Tree(viewAtDepositCount.node);
-    const depositTreeDepth = viewAtDepositCount.type.depth;
-    return depositEvents.map((log) => ({
-        proof: treeAtDepositCount.getSingleProof(toGindex(depositTreeDepth, BigInt(log.index))),
-        data: log.depositData,
-    }));
-}
-//# sourceMappingURL=deposits.js.map

package/lib/eth1/utils/deposits.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deposits.js","sourceRoot":"","sources":["../../../src/eth1/utils/deposits.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,IAAI,EAAE,QAAQ,EAAC,MAAM,mCAAmC,CAAC;AAEjE,OAAO,EAA4B,mBAAmB,EAAC,MAAM,4BAA4B,CAAC;AAC1F,OAAO,EAAS,GAAG,EAAC,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAE1C,OAAO,EAAC,SAAS,EAAE,aAAa,EAAC,MAAM,cAAc,CAAC;AAItD,MAAM,CAAC,KAAK,UAAU,WAAW;AAC/B,mEAAmE;AACnE,KAAgC,EAChC,QAAyB,EACzB,cAAgC;IAEhC,MAAM,YAAY,GAAG,KAAK,CAAC,gBAAgB,CAAC;IAC5C,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC;IAE3C,IAAI,YAAY,GAAG,YAAY,EAAE,CAAC;QAChC,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,sBAAsB,EAAE,YAAY,EAAE,YAAY,EAAC,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,WAAW,GAAG,mBAAmB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAEzD,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,CAAC,CAAC,kGAAkG;IAC/G,CAAC;IAED,MAAM,UAAU,GAAG,EAAC,GAAG,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,GAAG,WAAW,EAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,MAAM,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAE5D,IAAI,QAAQ,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,mBAAmB,EAAE,GAAG,EAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,EAAC,CAAC,CAAC;IACjH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,iBAAiB,EAAE,GAAG,EAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,EAAC,CAAC,CAAC;IAC/G,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,aAAoC,EACpC,eAA4B,EAC5B,QAAyB;IAEzB,qEAAqE;IACrE,MAAM,kBAAkB,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;IAE9E,MAAM,WAAW,GAAG,kBAAkB,CAAC,YAAY,EAAE,CAAC;IAEtD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,SAAS,CAAC;YAClB,IAAI,EAAE,aAAa,CAAC,kBAAkB;YACtC,IAAI,EAAE,SAAS,CAAC,WAAW,CAAC;YAC5B,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC;SAC9C,CAAC,CAAC;IACL,CAAC;IAED,uCAAuC;IACvC,MAAM,kBAAkB,GAAG,IAAI,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC7D,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC;IAEvD,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACjC,KAAK,EAAE,kBAAkB,CAAC,cAAc,CAAC,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACvF,IAAI,EAAE,GAAG,CAAC,WAAW;KACtB,CAAC,CAAC,CAAC;AACN,CAAC"}

package/lib/eth1/utils/eth1Data.d.ts

@@ -1,22 +0,0 @@
-import { Root, phase0 } from "@lodestar/types";
-import { DepositTree } from "../../db/repositories/depositDataRoot.js";
-import { Eth1Block } from "../interface.js";
-type BlockNumber = number;
-/**
- * Appends partial eth1 data (depositRoot, depositCount) in a sequence of blocks
- * eth1 data deposit is inferred from sparse eth1 data obtained from the deposit logs
- */
-export declare function getEth1DataForBlocks(blocks: Eth1Block[], depositDescendingStream: AsyncIterable<phase0.DepositEvent>, depositRootTree: DepositTree, lastProcessedDepositBlockNumber: BlockNumber | null): Promise<(phase0.Eth1Data & Eth1Block)[]>;
-/**
- * Collect depositCount by blockNumber from a stream matching a block number range
- * For a given blockNumber it's depositCount is equal to the index + 1 of the
- * closest deposit event whose deposit.blockNumber <= blockNumber
- * @returns array ascending by blockNumber
- */
-export declare function getDepositsByBlockNumber(fromBlock: BlockNumber, toBlock: BlockNumber, depositEventDescendingStream: AsyncIterable<phase0.DepositEvent>): Promise<phase0.DepositEvent[]>;
-/**
- * Precompute a map of depositCount => depositRoot from a depositRootTree filled beforehand
- */
-export declare function getDepositRootByDepositCount(depositCounts: number[], depositRootTree: DepositTree): Map<number, Root>;
-export {};
-//# sourceMappingURL=eth1Data.d.ts.map

package/lib/eth1/utils/eth1Data.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1Data.d.ts","sourceRoot":"","sources":["../../../src/eth1/utils/eth1Data.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,IAAI,EAAE,MAAM,EAAC,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAC,WAAW,EAAC,MAAM,0CAA0C,CAAC;AAGrE,OAAO,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAE1C,KAAK,WAAW,GAAG,MAAM,CAAC;AAE1B;;;GAGG;AACH,wBAAsB,oBAAoB,CACxC,MAAM,EAAE,SAAS,EAAE,EACnB,uBAAuB,EAAE,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,EAC3D,eAAe,EAAE,WAAW,EAC5B,+BAA+B,EAAE,WAAW,GAAG,IAAI,GAClD,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC,CAkC1C;AAED;;;;;GAKG;AACH,wBAAsB,wBAAwB,CAC5C,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,WAAW,EACpB,4BAA4B,EAAE,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,GAC/D,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAahC;AAED;;GAEG;AACH,wBAAgB,4BAA4B,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,eAAe,EAAE,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAkBrH"}

package/lib/eth1/utils/eth1Data.js

@@ -1,77 +0,0 @@
-import { binarySearchLte } from "../../util/binarySearch.js";
-import { Eth1Error, Eth1ErrorCode } from "../errors.js";
-/**
- * Appends partial eth1 data (depositRoot, depositCount) in a sequence of blocks
- * eth1 data deposit is inferred from sparse eth1 data obtained from the deposit logs
- */
-export async function getEth1DataForBlocks(blocks, depositDescendingStream, depositRootTree, lastProcessedDepositBlockNumber) {
-    // Exclude blocks for which there is no valid eth1 data deposit
-    if (lastProcessedDepositBlockNumber !== null) {
-        blocks = blocks.filter((block) => block.blockNumber <= lastProcessedDepositBlockNumber);
-    }
-    // A valid block can be constructed using previous `state.eth1Data`, don't throw
-    if (blocks.length === 0) {
-        return [];
-    }
-    // Collect the latest deposit of each blockNumber in a block number range
-    const fromBlock = blocks[0].blockNumber;
-    const toBlock = blocks.at(-1)?.blockNumber;
-    const depositsByBlockNumber = await getDepositsByBlockNumber(fromBlock, toBlock, depositDescendingStream);
-    if (depositsByBlockNumber.length === 0) {
-        throw new Eth1Error({ code: Eth1ErrorCode.NO_DEPOSITS_FOR_BLOCK_RANGE, fromBlock, toBlock });
-    }
-    // Precompute a map of depositCount => depositRoot (from depositRootTree)
-    const depositCounts = depositsByBlockNumber.map((event) => event.index + 1);
-    const depositRootByDepositCount = getDepositRootByDepositCount(depositCounts, depositRootTree);
-    const eth1Datas = [];
-    for (const block of blocks) {
-        const deposit = binarySearchLte(depositsByBlockNumber, block.blockNumber, (event) => event.blockNumber);
-        const depositCount = deposit.index + 1;
-        const depositRoot = depositRootByDepositCount.get(depositCount);
-        if (depositRoot === undefined) {
-            throw new Eth1Error({ code: Eth1ErrorCode.NO_DEPOSIT_ROOT, depositCount });
-        }
-        eth1Datas.push({ ...block, depositCount, depositRoot });
-    }
-    return eth1Datas;
-}
-/**
- * Collect depositCount by blockNumber from a stream matching a block number range
- * For a given blockNumber it's depositCount is equal to the index + 1 of the
- * closest deposit event whose deposit.blockNumber <= blockNumber
- * @returns array ascending by blockNumber
- */
-export async function getDepositsByBlockNumber(fromBlock, toBlock, depositEventDescendingStream) {
-    const depositCountMap = new Map();
-    // Take blocks until the block under the range lower bound (included)
-    for await (const deposit of depositEventDescendingStream) {
-        if (deposit.blockNumber <= toBlock && !depositCountMap.has(deposit.blockNumber)) {
-            depositCountMap.set(deposit.blockNumber, deposit);
-        }
-        if (deposit.blockNumber < fromBlock) {
-            break;
-        }
-    }
-    return Array.from(depositCountMap.values()).sort((a, b) => a.blockNumber - b.blockNumber);
-}
-/**
- * Precompute a map of depositCount => depositRoot from a depositRootTree filled beforehand
- */
-export function getDepositRootByDepositCount(depositCounts, depositRootTree) {
-    // Unique + sort numerically in descending order
-    depositCounts = [...new Set(depositCounts)].sort((a, b) => b - a);
-    if (depositCounts.length > 0) {
-        const maxIndex = depositCounts[0] - 1;
-        const treeLength = depositRootTree.length - 1;
-        if (maxIndex > treeLength) {
-            throw new Eth1Error({ code: Eth1ErrorCode.NOT_ENOUGH_DEPOSIT_ROOTS, index: maxIndex, treeLength });
-        }
-    }
-    const depositRootByDepositCount = new Map();
-    for (const depositCount of depositCounts) {
-        depositRootTree = depositRootTree.sliceTo(depositCount - 1);
-        depositRootByDepositCount.set(depositCount, depositRootTree.hashTreeRoot());
-    }
-    return depositRootByDepositCount;
-}
-//# sourceMappingURL=eth1Data.js.map

package/lib/eth1/utils/eth1Data.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1Data.js","sourceRoot":"","sources":["../../../src/eth1/utils/eth1Data.ts"],"names":[],"mappings":"AAEA,OAAO,EAAC,eAAe,EAAC,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAC,SAAS,EAAE,aAAa,EAAC,MAAM,cAAc,CAAC;AAKtD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,MAAmB,EACnB,uBAA2D,EAC3D,eAA4B,EAC5B,+BAAmD;IAEnD,+DAA+D;IAC/D,IAAI,+BAA+B,KAAK,IAAI,EAAE,CAAC;QAC7C,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,IAAI,+BAA+B,CAAC,CAAC;IAC1F,CAAC;IAED,gFAAgF;IAChF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,yEAAyE;IACzE,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACxC,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,WAAqB,CAAC;IACrD,MAAM,qBAAqB,GAAG,MAAM,wBAAwB,CAAC,SAAS,EAAE,OAAO,EAAE,uBAAuB,CAAC,CAAC;IAC1G,IAAI,qBAAqB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,2BAA2B,EAAE,SAAS,EAAE,OAAO,EAAC,CAAC,CAAC;IAC7F,CAAC;IAED,yEAAyE;IACzE,MAAM,aAAa,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5E,MAAM,yBAAyB,GAAG,4BAA4B,CAAC,aAAa,EAAE,eAAe,CAAC,CAAC;IAE/F,MAAM,SAAS,GAAoC,EAAE,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,eAAe,CAAC,qBAAqB,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QACxG,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;QACvC,MAAM,WAAW,GAAG,yBAAyB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChE,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,eAAe,EAAE,YAAY,EAAC,CAAC,CAAC;QAC3E,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,EAAC,GAAG,KAAK,EAAE,YAAY,EAAE,WAAW,EAAC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,SAAsB,EACtB,OAAoB,EACpB,4BAAgE;IAEhE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoC,CAAC;IACpE,qEAAqE;IACrE,IAAI,KAAK,EAAE,MAAM,OAAO,IAAI,4BAA4B,EAAE,CAAC;QACzD,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAChF,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,GAAG,SAAS,EAAE,CAAC;YACpC,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;AAC5F,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,4BAA4B,CAAC,aAAuB,EAAE,eAA4B;IAChG,gDAAgD;IAChD,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAElE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,IAAI,QAAQ,GAAG,UAAU,EAAE,CAAC;YAC1B,MAAM,IAAI,SAAS,CAAC,EAAC,IAAI,EAAE,aAAa,CAAC,wBAAwB,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAC,CAAC,CAAC;QACnG,CAAC;IACH,CAAC;IAED,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAAgB,CAAC;IAC1D,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,eAAe,GAAG,eAAe,CAAC,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;QAC5D,yBAAyB,CAAC,GAAG,CAAC,YAAY,EAAE,eAAe,CAAC,YAAY,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,yBAAyB,CAAC;AACnC,CAAC"}

package/lib/eth1/utils/eth1DepositEvent.d.ts

@@ -1,7 +0,0 @@
-/**
- * Assert that an array of deposits are consecutive and ascending
- */
-export declare function assertConsecutiveDeposits(depositEvents: {
-    index: number;
-}[]): void;
-//# sourceMappingURL=eth1DepositEvent.d.ts.map

package/lib/eth1/utils/eth1DepositEvent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1DepositEvent.d.ts","sourceRoot":"","sources":["../../../src/eth1/utils/eth1DepositEvent.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,aAAa,EAAE;IAAC,KAAK,EAAE,MAAM,CAAA;CAAC,EAAE,GAAG,IAAI,CAQhF"}

package/lib/eth1/utils/eth1DepositEvent.js

@@ -1,13 +0,0 @@
-/**
- * Assert that an array of deposits are consecutive and ascending
- */
-export function assertConsecutiveDeposits(depositEvents) {
-    for (let i = 0; i < depositEvents.length - 1; i++) {
-        const indexLeft = depositEvents[i].index;
-        const indexRight = depositEvents[i + 1].index;
-        if (indexLeft !== indexRight - 1) {
-            throw Error(`Non consecutive deposits. deposit[${i}] = ${indexLeft}, deposit[${i + 1}] ${indexRight}`);
-        }
-    }
-}
-//# sourceMappingURL=eth1DepositEvent.js.map

package/lib/eth1/utils/eth1DepositEvent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1DepositEvent.js","sourceRoot":"","sources":["../../../src/eth1/utils/eth1DepositEvent.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,aAAgC;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACzC,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QAC9C,IAAI,SAAS,KAAK,UAAU,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,KAAK,CAAC,qCAAqC,CAAC,OAAO,SAAS,aAAa,CAAC,GAAG,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;QACzG,CAAC;IACH,CAAC;AACH,CAAC"}

package/lib/eth1/utils/eth1Vote.d.ts

@@ -1,17 +0,0 @@
-import { ChainForkConfig } from "@lodestar/config";
-import { BeaconStateAllForks } from "@lodestar/state-transition";
-import { phase0 } from "@lodestar/types";
-export type Eth1DataGetter = ({ timestampRange, }: {
-    timestampRange: {
-        gte: number;
-        lte: number;
-    };
-}) => Promise<phase0.Eth1Data[]>;
-export declare function getEth1VotesToConsider(config: ChainForkConfig, state: BeaconStateAllForks, eth1DataGetter: Eth1DataGetter): Promise<phase0.Eth1Data[]>;
-export declare function pickEth1Vote(state: BeaconStateAllForks, votesToConsider: phase0.Eth1Data[]): phase0.Eth1Data;
-/**
- * Serialize eth1Data types to a unique string ID. It is only used for comparison.
- */
-export declare function fastSerializeEth1Data(eth1Data: phase0.Eth1Data): string;
-export declare function votingPeriodStartTime(config: ChainForkConfig, state: BeaconStateAllForks): number;
-//# sourceMappingURL=eth1Vote.d.ts.map

package/lib/eth1/utils/eth1Vote.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1Vote.d.ts","sourceRoot":"","sources":["../../../src/eth1/utils/eth1Vote.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,eAAe,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,EAAC,mBAAmB,EAAwC,MAAM,4BAA4B,CAAC;AACtG,OAAO,EAAU,MAAM,EAAC,MAAM,iBAAiB,CAAC;AAGhD,MAAM,MAAM,cAAc,GAAG,CAAC,EAC5B,cAAc,GACf,EAAE;IACD,cAAc,EAAE;QAAC,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAC,CAAC;CAC5C,KAAK,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;AAEjC,wBAAsB,sBAAsB,CAC1C,MAAM,EAAE,eAAe,EACvB,KAAK,EAAE,mBAAmB,EAC1B,cAAc,EAAE,cAAc,GAC7B,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAyB5B;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,QAAQ,CA+C5G;AAyCD;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,GAAG,MAAM,CAEvE;AAED,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,mBAAmB,GAAG,MAAM,CAGjG"}

package/lib/eth1/utils/eth1Vote.js

@@ -1,111 +0,0 @@
-import { EPOCHS_PER_ETH1_VOTING_PERIOD, SLOTS_PER_EPOCH, isForkPostElectra } from "@lodestar/params";
-import { computeTimeAtSlot } from "@lodestar/state-transition";
-import { toRootHex } from "@lodestar/utils";
-export async function getEth1VotesToConsider(config, state, eth1DataGetter) {
-    const fork = config.getForkName(state.slot);
-    if (isForkPostElectra(fork)) {
-        const { eth1DepositIndex, depositRequestsStartIndex } = state;
-        if (eth1DepositIndex === Number(depositRequestsStartIndex)) {
-            return state.eth1DataVotes.getAllReadonly();
-        }
-    }
-    const periodStart = votingPeriodStartTime(config, state);
-    const { SECONDS_PER_ETH1_BLOCK, ETH1_FOLLOW_DISTANCE } = config;
-    // Modified version of the spec function to fetch the required range directly from the DB
-    return (await eth1DataGetter({
-        timestampRange: {
-            // Spec v0.12.2
-            // is_candidate_block =
-            //   block.timestamp + SECONDS_PER_ETH1_BLOCK * ETH1_FOLLOW_DISTANCE <= period_start &&
-            //   block.timestamp + SECONDS_PER_ETH1_BLOCK * ETH1_FOLLOW_DISTANCE * 2 >= period_start
-            lte: periodStart - SECONDS_PER_ETH1_BLOCK * ETH1_FOLLOW_DISTANCE,
-            gte: periodStart - SECONDS_PER_ETH1_BLOCK * ETH1_FOLLOW_DISTANCE * 2,
-        },
-    })).filter((eth1Data) => eth1Data.depositCount >= state.eth1Data.depositCount);
-}
-export function pickEth1Vote(state, votesToConsider) {
-    const votesToConsiderKeys = new Set();
-    for (const eth1Data of votesToConsider) {
-        votesToConsiderKeys.add(getEth1DataKey(eth1Data));
-    }
-    const eth1DataHashToEth1Data = new Map();
-    const eth1DataVoteCountByRoot = new Map();
-    const eth1DataVotesOrder = [];
-    // BeaconStateAllForks is always represented as a tree with a hashing cache.
-    // To check equality its cheaper to use hashTreeRoot as keys.
-    // However `votesToConsider` is an array of values since those are read from DB.
-    // TODO: Optimize cache of known votes, to prevent re-hashing stored values.
-    // Note: for low validator counts it's not very important, since this runs once per proposal
-    const eth1DataVotes = state.eth1DataVotes.getAllReadonly();
-    for (const eth1DataVote of eth1DataVotes) {
-        const rootHex = getEth1DataKey(eth1DataVote);
-        if (votesToConsiderKeys.has(rootHex)) {
-            const prevVoteCount = eth1DataVoteCountByRoot.get(rootHex);
-            eth1DataVoteCountByRoot.set(rootHex, 1 + (prevVoteCount ?? 0));
-            // Cache eth1DataVote to root Map only once per root
-            if (prevVoteCount === undefined) {
-                eth1DataHashToEth1Data.set(rootHex, eth1DataVote);
-                eth1DataVotesOrder.push(rootHex);
-            }
-        }
-    }
-    const eth1DataRootsMaxVotes = getKeysWithMaxValue(eth1DataVoteCountByRoot);
-    // No votes, vote for the last valid vote
-    if (eth1DataRootsMaxVotes.length === 0) {
-        return votesToConsider.at(-1) ?? state.eth1Data;
-    }
-    // If there's a single winning vote with a majority vote that one
-    if (eth1DataRootsMaxVotes.length === 1) {
-        return eth1DataHashToEth1Data.get(eth1DataRootsMaxVotes[0]) ?? state.eth1Data;
-    }
-    // If there are multiple winning votes, vote for the latest one
-    const latestMostVotedRoot = eth1DataVotesOrder[Math.max(...eth1DataRootsMaxVotes.map((root) => eth1DataVotesOrder.indexOf(root)))];
-    return eth1DataHashToEth1Data.get(latestMostVotedRoot) ?? state.eth1Data;
-}
-/**
- * Returns the array of keys with max value. May return 0, 1 or more keys
- */
-function getKeysWithMaxValue(map) {
-    const entries = Array.from(map.entries());
-    let keysMax = [];
-    let valueMax = -Infinity;
-    for (const [key, value] of entries) {
-        if (value > valueMax) {
-            keysMax = [key];
-            valueMax = value;
-        }
-        else if (value === valueMax) {
-            keysMax.push(key);
-        }
-    }
-    return keysMax;
-}
-/**
- * Key-ed by fastSerializeEth1Data(). votesToConsider is read from DB as struct and always has a length of 2048.
- * `state.eth1DataVotes` has a length between 0 and ETH1_FOLLOW_DISTANCE with an equal probability of each value.
- * So to get the average faster time to key both votesToConsider and state.eth1DataVotes it's better to use
- * fastSerializeEth1Data(). However, a long term solution is to cache valid votes in memory and prevent having
- * to recompute their key on every proposal.
- *
- * With `fastSerializeEth1Data()`: avg time 20 ms/op
- * ✓ pickEth1Vote - no votes                                             233.0587 ops/s    4.290764 ms/op        -        121 runs   1.02 s
- * ✓ pickEth1Vote - max votes                                            29.21546 ops/s    34.22845 ms/op        -         25 runs   1.38 s
- *
- * With `toHexString(ssz.phase0.Eth1Data.hashTreeRoot(eth1Data))`: avg time 23 ms/op
- * ✓ pickEth1Vote - no votes                                             46.12341 ops/s    21.68096 ms/op        -        133 runs   3.40 s
- * ✓ pickEth1Vote - max votes                                            37.89912 ops/s    26.38583 ms/op        -         29 runs   1.27 s
- */
-function getEth1DataKey(eth1Data) {
-    return fastSerializeEth1Data(eth1Data);
-}
-/**
- * Serialize eth1Data types to a unique string ID. It is only used for comparison.
- */
-export function fastSerializeEth1Data(eth1Data) {
-    return toRootHex(eth1Data.blockHash) + eth1Data.depositCount.toString(16) + toRootHex(eth1Data.depositRoot);
-}
-export function votingPeriodStartTime(config, state) {
-    const eth1VotingPeriodStartSlot = state.slot - (state.slot % (EPOCHS_PER_ETH1_VOTING_PERIOD * SLOTS_PER_EPOCH));
-    return computeTimeAtSlot(config, eth1VotingPeriodStartSlot, state.genesisTime);
-}
-//# sourceMappingURL=eth1Vote.js.map

package/lib/eth1/utils/eth1Vote.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"eth1Vote.js","sourceRoot":"","sources":["../../../src/eth1/utils/eth1Vote.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,6BAA6B,EAAE,eAAe,EAAE,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AACnG,OAAO,EAA0C,iBAAiB,EAAC,MAAM,4BAA4B,CAAC;AAEtG,OAAO,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAQ1C,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,MAAuB,EACvB,KAA0B,EAC1B,cAA8B;IAE9B,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,MAAM,EAAC,gBAAgB,EAAE,yBAAyB,EAAC,GAAG,KAA2B,CAAC;QAClF,IAAI,gBAAgB,KAAK,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC;YAC3D,OAAO,KAAK,CAAC,aAAa,CAAC,cAAc,EAAE,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzD,MAAM,EAAC,sBAAsB,EAAE,oBAAoB,EAAC,GAAG,MAAM,CAAC;IAE9D,yFAAyF;IACzF,OAAO,CACL,MAAM,cAAc,CAAC;QACnB,cAAc,EAAE;YACd,eAAe;YACf,uBAAuB;YACvB,uFAAuF;YACvF,wFAAwF;YACxF,GAAG,EAAE,WAAW,GAAG,sBAAsB,GAAG,oBAAoB;YAChE,GAAG,EAAE,WAAW,GAAG,sBAAsB,GAAG,oBAAoB,GAAG,CAAC;SACrE;KACF,CAAC,CACH,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,YAAY,IAAI,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC/E,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAA0B,EAAE,eAAkC;IACzF,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9C,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACvC,mBAAmB,CAAC,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAA4B,CAAC;IACnE,MAAM,uBAAuB,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3D,MAAM,kBAAkB,GAAc,EAAE,CAAC;IAEzC,4EAA4E;IAC5E,6DAA6D;IAC7D,gFAAgF;IAChF,4EAA4E;IAC5E,4FAA4F;IAC5F,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,cAAc,EAAE,CAAC;IAC3D,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;QAE7C,IAAI,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,aAAa,GAAG,uBAAuB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3D,uBAAuB,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC;YAE/D,oDAAoD;YACpD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,sBAAsB,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;gBAClD,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,qBAAqB,GAAG,mBAAmB,CAAC,uBAAuB,CAAC,CAAC;IAE3E,yCAAyC;IACzC,IAAI,qBAAqB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,OAAO,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC;IAClD,CAAC;IAED,iEAAiE;IACjE,IAAI,qBAAqB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,OAAO,sBAAsB,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC;IAChF,CAAC;IAED,+DAA+D;IAC/D,MAAM,mBAAmB,GACvB,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,OAAO,sBAAsB,CAAC,GAAG,CAAC,mBAAmB,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC;AAC3E,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAI,GAAmB;IACjD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;IAC1C,IAAI,OAAO,GAAQ,EAAE,CAAC;IACtB,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC;IAEzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACnC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;QACnB,CAAC;aAAM,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,cAAc,CAAC,QAAyB;IAC/C,OAAO,qBAAqB,CAAC,QAAQ,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,QAAyB;IAC7D,OAAO,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC9G,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAuB,EAAE,KAA0B;IACvF,MAAM,yBAAyB,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,6BAA6B,GAAG,eAAe,CAAC,CAAC,CAAC;IAChH,OAAO,iBAAiB,CAAC,MAAM,EAAE,yBAAyB,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;AACjF,CAAC"}

package/lib/eth1/utils/groupDepositEventsByBlock.d.ts

@@ -1,9 +0,0 @@
-import { phase0 } from "@lodestar/types";
-import { BatchDepositEvents } from "../interface.js";
-/**
- * Return deposit events of blocks grouped/sorted by block number and deposit index
- * Blocks without events are omitted
- * @param depositEvents range deposit events
- */
-export declare function groupDepositEventsByBlock(depositEvents: phase0.DepositEvent[]): BatchDepositEvents[];
-//# sourceMappingURL=groupDepositEventsByBlock.d.ts.map

package/lib/eth1/utils/groupDepositEventsByBlock.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"groupDepositEventsByBlock.d.ts","sourceRoot":"","sources":["../../../src/eth1/utils/groupDepositEventsByBlock.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,iBAAiB,CAAC;AACvC,OAAO,EAAC,kBAAkB,EAAC,MAAM,iBAAiB,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,yBAAyB,CAAC,aAAa,EAAE,MAAM,CAAC,YAAY,EAAE,GAAG,kBAAkB,EAAE,CAUpG"}

package/lib/eth1/utils/groupDepositEventsByBlock.js

@@ -1,17 +0,0 @@
-/**
- * Return deposit events of blocks grouped/sorted by block number and deposit index
- * Blocks without events are omitted
- * @param depositEvents range deposit events
- */
-export function groupDepositEventsByBlock(depositEvents) {
-    depositEvents.sort((event1, event2) => event1.index - event2.index);
-    const depositsByBlockMap = new Map();
-    for (const deposit of depositEvents) {
-        depositsByBlockMap.set(deposit.blockNumber, [...(depositsByBlockMap.get(deposit.blockNumber) || []), deposit]);
-    }
-    return Array.from(depositsByBlockMap.entries()).map(([blockNumber, depositEvents]) => ({
-        blockNumber,
-        depositEvents,
-    }));
-}
-//# sourceMappingURL=groupDepositEventsByBlock.js.map

package/lib/eth1/utils/groupDepositEventsByBlock.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"groupDepositEventsByBlock.js","sourceRoot":"","sources":["../../../src/eth1/utils/groupDepositEventsByBlock.ts"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,aAAoC;IAC5E,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACpE,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAiC,CAAC;IACpE,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;QACpC,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACjH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC;QACrF,WAAW;QACX,aAAa;KACd,CAAC,CAAC,CAAC;AACN,CAAC"}

package/lib/eth1/utils/optimizeNextBlockDiffForGenesis.d.ts

@@ -1,10 +0,0 @@
-import { ChainConfig } from "@lodestar/config";
-/**
- * Utility for fetching genesis min genesis time block
- * Returns an approximation of the next block diff to fetch to progressively
- * get closer to the block that satisfies min genesis time condition
- */
-export declare function optimizeNextBlockDiffForGenesis(lastFetchedBlock: {
-    timestamp: number;
-}, params: Pick<ChainConfig, "MIN_GENESIS_TIME" | "GENESIS_DELAY" | "SECONDS_PER_ETH1_BLOCK">): number;
-//# sourceMappingURL=optimizeNextBlockDiffForGenesis.d.ts.map

package/lib/eth1/utils/optimizeNextBlockDiffForGenesis.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"optimizeNextBlockDiffForGenesis.d.ts","sourceRoot":"","sources":["../../../src/eth1/utils/optimizeNextBlockDiffForGenesis.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAE7C;;;;GAIG;AACH,wBAAgB,+BAA+B,CAC7C,gBAAgB,EAAE;IAAC,SAAS,EAAE,MAAM,CAAA;CAAC,EACrC,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,kBAAkB,GAAG,eAAe,GAAG,wBAAwB,CAAC,GACzF,MAAM,CAOR"}

package/lib/eth1/utils/optimizeNextBlockDiffForGenesis.js

@@ -1,14 +0,0 @@
-/**
- * Utility for fetching genesis min genesis time block
- * Returns an approximation of the next block diff to fetch to progressively
- * get closer to the block that satisfies min genesis time condition
- */
-export function optimizeNextBlockDiffForGenesis(lastFetchedBlock, params) {
-    const timeToGenesis = params.MIN_GENESIS_TIME - params.GENESIS_DELAY - lastFetchedBlock.timestamp;
-    const numBlocksToGenesis = Math.floor(timeToGenesis / params.SECONDS_PER_ETH1_BLOCK);
-    if (numBlocksToGenesis <= 2) {
-        return 1;
-    }
-    return Math.max(1, Math.floor(numBlocksToGenesis / 2));
-}
-//# sourceMappingURL=optimizeNextBlockDiffForGenesis.js.map

package/lib/eth1/utils/optimizeNextBlockDiffForGenesis.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"optimizeNextBlockDiffForGenesis.js","sourceRoot":"","sources":["../../../src/eth1/utils/optimizeNextBlockDiffForGenesis.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,+BAA+B,CAC7C,gBAAqC,EACrC,MAA0F;IAE1F,MAAM,aAAa,GAAG,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,aAAa,GAAG,gBAAgB,CAAC,SAAS,CAAC;IAClG,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC;IACrF,IAAI,kBAAkB,IAAI,CAAC,EAAE,CAAC;QAC5B,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC"}

package/src/chain/genesis/genesis.ts

@@ -1,190 +0,0 @@
-import {Tree, toGindex} from "@chainsafe/persistent-merkle-tree";
-import {BeaconConfig, ChainForkConfig} from "@lodestar/config";
-import {GENESIS_EPOCH, GENESIS_SLOT} from "@lodestar/params";
-import {
-  BeaconStateAllForks,
-  CachedBeaconStateAllForks,
-  applyDeposits,
-  applyEth1BlockHash,
-  applyTimestamp,
-  createCachedBeaconState,
-  createEmptyEpochCacheImmutableData,
-  getActiveValidatorIndices,
-  getGenesisBeaconState,
-  getTemporaryBlockHeader,
-} from "@lodestar/state-transition";
-import {phase0, ssz} from "@lodestar/types";
-import {Logger} from "@lodestar/utils";
-import {DepositTree} from "../../db/repositories/depositDataRoot.js";
-import {IEth1Provider} from "../../eth1/index.js";
-import {IEth1StreamParams} from "../../eth1/interface.js";
-import {getDepositsAndBlockStreamForGenesis, getDepositsStream} from "../../eth1/stream.js";
-import {GenesisResult, IGenesisBuilder} from "./interface.js";
-
-export type GenesisBuilderKwargs = {
-  config: ChainForkConfig;
-  eth1Provider: IEth1Provider;
-  logger: Logger;
-
-  /** Use to restore pending progress */
-  pendingStatus?: {
-    state: BeaconStateAllForks;
-    depositTree: DepositTree;
-    lastProcessedBlockNumber: number;
-  };
-
-  signal?: AbortSignal;
-  maxBlocksPerPoll?: number;
-};
-
-export class GenesisBuilder implements IGenesisBuilder {
-  // Expose state to persist on error
-  readonly state: CachedBeaconStateAllForks;
-  readonly depositTree: DepositTree;
-  /** Is null if no block has been processed yet */
-  lastProcessedBlockNumber: number | null = null;
-
-  private readonly config: BeaconConfig;
-  private readonly eth1Provider: IEth1Provider;
-  private readonly logger: Logger;
-  private readonly signal?: AbortSignal;
-  private readonly eth1Params: IEth1StreamParams;
-  private readonly depositCache = new Set<number>();
-  private readonly fromBlock: number;
-  private readonly logEvery = 30 * 1000;
-  private lastLog = 0;
-  /** Current count of active validators in the state */
-  private activatedValidatorCount: number;
-
-  constructor({config, eth1Provider, logger, signal, pendingStatus, maxBlocksPerPoll}: GenesisBuilderKwargs) {
-    // at genesis builder, there is no genesis validator so we don't have a real BeaconConfig
-    // but we need BeaconConfig to temporarily create CachedBeaconState, the cast here is safe since we don't use any getDomain here
-    // the use of state as CachedBeaconState is just for convenient, GenesisResult returns TreeView anyway
-    this.eth1Provider = eth1Provider;
-    this.logger = logger;
-    this.signal = signal;
-    this.eth1Params = {
-      ...config,
-      maxBlocksPerPoll: maxBlocksPerPoll ?? 10000,
-    };
-
-    let stateView: BeaconStateAllForks;
-
-    if (pendingStatus) {
-      this.logger.info("Restoring pending genesis state", {block: pendingStatus.lastProcessedBlockNumber});
-      stateView = pendingStatus.state;
-      this.depositTree = pendingStatus.depositTree;
-      this.fromBlock = Math.max(pendingStatus.lastProcessedBlockNumber + 1, this.eth1Provider.deployBlock);
-    } else {
-      stateView = getGenesisBeaconState(
-        config,
-        ssz.phase0.Eth1Data.defaultValue(),
-        getTemporaryBlockHeader(config, config.getForkTypes(GENESIS_SLOT).BeaconBlock.defaultValue())
-      );
-      this.depositTree = ssz.phase0.DepositDataRootList.defaultViewDU();
-      this.fromBlock = this.eth1Provider.deployBlock;
-    }
-
-    // TODO - PENDING: Ensure EpochCacheImmutableData is created only once
-    this.state = createCachedBeaconState(stateView, createEmptyEpochCacheImmutableData(config, stateView));
-    this.config = this.state.config;
-    this.activatedValidatorCount = getActiveValidatorIndices(stateView, GENESIS_EPOCH).length;
-  }
-
-  /**
-   * Get eth1 deposit events and blocks and apply to this.state until we found genesis.
-   */
-  async waitForGenesis(): Promise<GenesisResult> {
-    await this.eth1Provider.validateContract();
-
-    // Load data from data from this.db.depositData, this.db.depositDataRoot
-    // And start from a more recent fromBlock
-    const blockNumberValidatorGenesis = await this.waitForGenesisValidators();
-
-    const depositsAndBlocksStream = getDepositsAndBlockStreamForGenesis(
-      blockNumberValidatorGenesis,
-      this.eth1Provider,
-      this.eth1Params,
-      this.signal
-    );
-
-    for await (const [depositEvents, block] of depositsAndBlocksStream) {
-      this.applyDeposits(depositEvents);
-      applyTimestamp(this.config, this.state, block.timestamp);
-      applyEth1BlockHash(this.state, block.blockHash);
-      this.lastProcessedBlockNumber = block.blockNumber;
-
-      if (
-        this.state.genesisTime >= this.config.MIN_GENESIS_TIME &&
-        this.activatedValidatorCount >= this.config.MIN_GENESIS_ACTIVE_VALIDATOR_COUNT
-      ) {
-        this.logger.info("Found genesis state", {blockNumber: block.blockNumber});
-        return {
-          state: this.state,
-          depositTree: this.depositTree,
-          block,
-        };
-      }
-
-      this.throttledLog(`Waiting for min genesis time ${block.timestamp} / ${this.config.MIN_GENESIS_TIME}`);
-    }
-
-    throw Error("depositsStream stopped without a valid genesis state");
-  }
-
-  /**
-   * First phase of waiting for genesis.
-   * Stream deposits events in batches as big as possible without querying block data
-   * @returns Block number at which there are enough active validators is state for genesis
-   */
-  private async waitForGenesisValidators(): Promise<number> {
-    const depositsStream = getDepositsStream(this.fromBlock, this.eth1Provider, this.eth1Params, this.signal);
-
-    for await (const {depositEvents, blockNumber} of depositsStream) {
-      this.applyDeposits(depositEvents);
-      this.lastProcessedBlockNumber = blockNumber;
-
-      if (this.activatedValidatorCount >= this.config.MIN_GENESIS_ACTIVE_VALIDATOR_COUNT) {
-        this.logger.info("Found enough genesis validators", {blockNumber});
-        return blockNumber;
-      }
-
-      this.throttledLog(
-        `Found ${this.state.validators.length} / ${this.config.MIN_GENESIS_ACTIVE_VALIDATOR_COUNT} validators to genesis`
-      );
-    }
-
-    throw Error("depositsStream stopped without a valid genesis state");
-  }
-
-  private applyDeposits(depositEvents: phase0.DepositEvent[]): void {
-    const newDeposits = depositEvents
-      .filter((depositEvent) => !this.depositCache.has(depositEvent.index))
-      .map((depositEvent) => {
-        this.depositCache.add(depositEvent.index);
-        this.depositTree.push(ssz.phase0.DepositData.hashTreeRoot(depositEvent.depositData));
-        const gindex = toGindex(this.depositTree.type.depth, BigInt(depositEvent.index));
-
-        // Apply changes from the push above
-        this.depositTree.commit();
-        const depositTreeNode = this.depositTree.node;
-        return {
-          proof: new Tree(depositTreeNode).getSingleProof(gindex),
-          data: depositEvent.depositData,
-        };
-      });
-
-    const {activatedValidatorCount} = applyDeposits(this.config, this.state, newDeposits, this.depositTree);
-    this.activatedValidatorCount += activatedValidatorCount;
-
-    // TODO: If necessary persist deposits here to this.db.depositData, this.db.depositDataRoot
-  }
-
-  /** Throttle genesis generation status log to prevent spamming */
-  private throttledLog(message: string): void {
-    if (Date.now() - this.lastLog > this.logEvery) {
-      this.lastLog = Date.now();
-      this.logger.info(message);
-    }
-  }
-}

package/src/chain/genesis/interface.ts

@@ -1,14 +0,0 @@
-import {CompositeViewDU, VectorCompositeType} from "@chainsafe/ssz";
-import {CachedBeaconStateAllForks} from "@lodestar/state-transition";
-import {ssz} from "@lodestar/types";
-import {Eth1Block} from "../../eth1/interface.js";
-
-export type GenesisResult = {
-  state: CachedBeaconStateAllForks;
-  depositTree: CompositeViewDU<VectorCompositeType<typeof ssz.Root>>;
-  block: Eth1Block;
-};
-
-export interface IGenesisBuilder {
-  waitForGenesis: () => Promise<GenesisResult>;
-}