-
-
Notifications
You must be signed in to change notification settings - Fork 289
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #3 from tuyennhv/proposer-boost-reorg-e2e-test
fix: proposer boost reorg e2e test
- Loading branch information
Showing
11 changed files
with
247 additions
and
34 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
140 changes: 140 additions & 0 deletions
140
packages/beacon-node/test/e2e/chain/proposerBoostReorg.test.ts
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,140 @@ | ||
| import {describe, it, afterEach, expect} from "vitest"; | ||
| import {SLOTS_PER_EPOCH} from "@lodestar/params"; | ||
| import {TimestampFormatCode} from "@lodestar/logger"; | ||
| import {ChainConfig} from "@lodestar/config"; | ||
| import {RootHex, Slot} from "@lodestar/types"; | ||
| import {routes} from "@lodestar/api"; | ||
| import {toHexString} from "@lodestar/utils"; | ||
| import {LogLevel, TestLoggerOpts, testLogger} from "../../utils/logger.js"; | ||
| import {getDevBeaconNode} from "../../utils/node/beacon.js"; | ||
| import {TimelinessForkChoice} from "../../mocks/fork-choice/timeliness.js"; | ||
| import {getAndInitDevValidators} from "../../utils/node/validator.js"; | ||
| import {waitForEvent} from "../../utils/events/resolver.js"; | ||
| import {ReorgEventData} from "../../../src/chain/emitter.js"; | ||
|
|
||
| describe( | ||
| "proposer boost reorg", | ||
| function () { | ||
| const validatorCount = 8; | ||
| const testParams: Pick<ChainConfig, "SECONDS_PER_SLOT" | "REORG_PARENT_WEIGHT_THRESHOLD" | "PROPOSER_SCORE_BOOST"> = | ||
| { | ||
| // eslint-disable-next-line @typescript-eslint/naming-convention | ||
| SECONDS_PER_SLOT: 2, | ||
| // need this to make block `reorgSlot - 1` strong enough | ||
| // eslint-disable-next-line @typescript-eslint/naming-convention | ||
| REORG_PARENT_WEIGHT_THRESHOLD: 80, | ||
| // need this to make block `reorgSlot + 1` to become the head | ||
| // eslint-disable-next-line @typescript-eslint/naming-convention | ||
| PROPOSER_SCORE_BOOST: 120, | ||
| }; | ||
|
|
||
| const afterEachCallbacks: (() => Promise<unknown> | void)[] = []; | ||
| afterEach(async () => { | ||
| while (afterEachCallbacks.length > 0) { | ||
| const callback = afterEachCallbacks.pop(); | ||
| if (callback) await callback(); | ||
| } | ||
| }); | ||
|
|
||
| const reorgSlot = 10; | ||
| const proposerBoostReorgEnabled = true; | ||
| /** | ||
| * reorgSlot | ||
| * / | ||
| * reorgSlot - 1 ------------ reorgSlot + 1 | ||
| * | ||
| * Note that in additional of being not timely, there are other criterion that | ||
| * the block needs to satisfied before being re-orged out. This test assumes | ||
| * other criterion are satisfied except timeliness. | ||
| * Note that in additional of being not timely, there are other criterion that | ||
| * the block needs to satisfy before being re-orged out. This test assumes | ||
| * other criterion are already satisfied | ||
| */ | ||
| it(`should reorg a late block at slot ${reorgSlot}`, async () => { | ||
| // the node needs time to transpile/initialize bls worker threads | ||
| const genesisSlotsDelay = 7; | ||
| const genesisTime = Math.floor(Date.now() / 1000) + genesisSlotsDelay * testParams.SECONDS_PER_SLOT; | ||
| const testLoggerOpts: TestLoggerOpts = { | ||
| level: LogLevel.debug, | ||
| timestampFormat: { | ||
| format: TimestampFormatCode.EpochSlot, | ||
| genesisTime, | ||
| slotsPerEpoch: SLOTS_PER_EPOCH, | ||
| secondsPerSlot: testParams.SECONDS_PER_SLOT, | ||
| }, | ||
| }; | ||
| const logger = testLogger("BeaconNode", testLoggerOpts); | ||
| const bn = await getDevBeaconNode({ | ||
| params: testParams, | ||
| options: { | ||
| sync: {isSingleNode: true}, | ||
| network: {allowPublishToZeroPeers: true, mdns: true, useWorker: false}, | ||
| // run the first bn with ReorgedForkChoice, no nHistoricalStates flag so it does not have to reload | ||
| chain: { | ||
| blsVerifyAllMainThread: true, | ||
| forkchoiceConstructor: TimelinessForkChoice, | ||
| proposerBoostEnabled: true, | ||
| proposerBoostReorgEnabled, | ||
| }, | ||
| }, | ||
| validatorCount, | ||
| genesisTime, | ||
| logger, | ||
| }); | ||
|
|
||
| (bn.chain.forkChoice as TimelinessForkChoice).lateSlot = reorgSlot; | ||
| afterEachCallbacks.push(async () => bn.close()); | ||
| const {validators} = await getAndInitDevValidators({ | ||
| node: bn, | ||
| logPrefix: "vc-0", | ||
| validatorsPerClient: validatorCount, | ||
| validatorClientCount: 1, | ||
| startIndex: 0, | ||
| useRestApi: false, | ||
| testLoggerOpts, | ||
| }); | ||
| afterEachCallbacks.push(() => Promise.all(validators.map((v) => v.close()))); | ||
|
|
||
| const commonAncestor = await waitForEvent<{slot: Slot; block: RootHex}>( | ||
| bn.chain.emitter, | ||
| routes.events.EventType.head, | ||
| 240000, | ||
| ({slot}) => slot === reorgSlot - 1 | ||
| ); | ||
| // reorgSlot | ||
| // / | ||
| // commonAncestor ------------ newBlock | ||
| const commonAncestorRoot = commonAncestor.block; | ||
| const reorgBlockEventData = await waitForEvent<{slot: Slot; block: RootHex}>( | ||
| bn.chain.emitter, | ||
| routes.events.EventType.head, | ||
| 240000, | ||
| ({slot}) => slot === reorgSlot | ||
| ); | ||
| const reorgBlockRoot = reorgBlockEventData.block; | ||
| const [newBlockEventData, reorgEventData] = await Promise.all([ | ||
| waitForEvent<{slot: Slot; block: RootHex}>( | ||
| bn.chain.emitter, | ||
| routes.events.EventType.block, | ||
| 240000, | ||
| ({slot}) => slot === reorgSlot + 1 | ||
| ), | ||
| waitForEvent<ReorgEventData>(bn.chain.emitter, routes.events.EventType.chainReorg, 240000), | ||
| ]); | ||
| expect(reorgEventData.slot).toEqual(reorgSlot + 1); | ||
| const newBlock = await bn.chain.getBlockByRoot(newBlockEventData.block); | ||
| if (newBlock == null) { | ||
| throw Error(`Block ${reorgSlot + 1} not found`); | ||
| } | ||
| expect(reorgEventData.oldHeadBlock).toEqual(reorgBlockRoot); | ||
| expect(reorgEventData.newHeadBlock).toEqual(newBlockEventData.block); | ||
| expect(reorgEventData.depth).toEqual(2); | ||
| expect(toHexString(newBlock?.block.message.parentRoot)).toEqual(commonAncestorRoot); | ||
| logger.info("New block", { | ||
| slot: newBlock.block.message.slot, | ||
| parentRoot: toHexString(newBlock.block.message.parentRoot), | ||
| }); | ||
| }); | ||
| }, | ||
| {timeout: 60000} | ||
| ); |
Oops, something went wrong.