@lodestar/beacon-node 1.50.0-dev.6fb6c0bad4 → 1.50.0-dev.9c3f7bebe9

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (52) hide show
  1. package/lib/chain/archiveStore/archiveStore.d.ts +1 -0
  2. package/lib/chain/archiveStore/archiveStore.d.ts.map +1 -1
  3. package/lib/chain/archiveStore/archiveStore.js +6 -2
  4. package/lib/chain/archiveStore/archiveStore.js.map +1 -1
  5. package/lib/chain/archiveStore/utils/pruneHistory.d.ts +4 -1
  6. package/lib/chain/archiveStore/utils/pruneHistory.d.ts.map +1 -1
  7. package/lib/chain/archiveStore/utils/pruneHistory.js +4 -3
  8. package/lib/chain/archiveStore/utils/pruneHistory.js.map +1 -1
  9. package/lib/chain/initState.d.ts +0 -7
  10. package/lib/chain/initState.d.ts.map +1 -1
  11. package/lib/chain/initState.js +3 -35
  12. package/lib/chain/initState.js.map +1 -1
  13. package/lib/db/beacon.d.ts.map +1 -1
  14. package/lib/db/beacon.js +2 -0
  15. package/lib/db/beacon.js.map +1 -1
  16. package/lib/execution/engine/http.d.ts.map +1 -1
  17. package/lib/execution/engine/http.js +5 -4
  18. package/lib/execution/engine/http.js.map +1 -1
  19. package/lib/index.d.ts +1 -1
  20. package/lib/index.d.ts.map +1 -1
  21. package/lib/index.js +1 -1
  22. package/lib/index.js.map +1 -1
  23. package/lib/metrics/metrics/beacon.d.ts +1 -1
  24. package/lib/metrics/metrics/beacon.d.ts.map +1 -1
  25. package/lib/metrics/metrics/beacon.js.map +1 -1
  26. package/lib/network/metadata.d.ts +1 -1
  27. package/lib/network/metadata.d.ts.map +1 -1
  28. package/lib/network/metadata.js +17 -17
  29. package/lib/network/metadata.js.map +1 -1
  30. package/lib/network/peers/datastore.d.ts +9 -9
  31. package/lib/network/peers/datastore.d.ts.map +1 -1
  32. package/lib/network/peers/datastore.js +36 -36
  33. package/lib/network/peers/datastore.js.map +1 -1
  34. package/lib/network/reqresp/handlers/executionPayloadEnvelopesByRoot.d.ts.map +1 -1
  35. package/lib/network/reqresp/handlers/executionPayloadEnvelopesByRoot.js +41 -26
  36. package/lib/network/reqresp/handlers/executionPayloadEnvelopesByRoot.js.map +1 -1
  37. package/lib/util/execution.d.ts +2 -0
  38. package/lib/util/execution.d.ts.map +1 -1
  39. package/lib/util/execution.js +6 -6
  40. package/lib/util/execution.js.map +1 -1
  41. package/package.json +15 -15
  42. package/src/chain/archiveStore/archiveStore.ts +9 -3
  43. package/src/chain/archiveStore/utils/pruneHistory.ts +6 -4
  44. package/src/chain/initState.ts +4 -55
  45. package/src/db/beacon.ts +2 -0
  46. package/src/execution/engine/http.ts +6 -4
  47. package/src/index.ts +1 -1
  48. package/src/metrics/metrics/beacon.ts +1 -1
  49. package/src/network/metadata.ts +17 -17
  50. package/src/network/peers/datastore.ts +36 -36
  51. package/src/network/reqresp/handlers/executionPayloadEnvelopesByRoot.ts +42 -28
  52. package/src/util/execution.ts +10 -6
package/package.json CHANGED
@@ -11,7 +11,7 @@
11
11
  "bugs": {
12
12
  "url": "https://github.com/ChainSafe/lodestar/issues"
13
13
  },
14
- "version": "1.50.0-dev.6fb6c0bad4",
14
+ "version": "1.50.0-dev.9c3f7bebe9",
15
15
  "type": "module",
16
16
  "exports": {
17
17
  ".": {
@@ -127,17 +127,17 @@
127
127
  "@libp2p/prometheus-metrics": "^5.0.28",
128
128
  "@libp2p/tcp": "^11.0.27",
129
129
  "@libp2p/utils": "^7.4.0",
130
- "@lodestar/api": "^1.50.0-dev.6fb6c0bad4",
131
- "@lodestar/config": "^1.50.0-dev.6fb6c0bad4",
132
- "@lodestar/db": "^1.50.0-dev.6fb6c0bad4",
133
- "@lodestar/fork-choice": "^1.50.0-dev.6fb6c0bad4",
134
- "@lodestar/logger": "^1.50.0-dev.6fb6c0bad4",
135
- "@lodestar/params": "^1.50.0-dev.6fb6c0bad4",
136
- "@lodestar/reqresp": "^1.50.0-dev.6fb6c0bad4",
137
- "@lodestar/state-transition": "^1.50.0-dev.6fb6c0bad4",
138
- "@lodestar/types": "^1.50.0-dev.6fb6c0bad4",
139
- "@lodestar/utils": "^1.50.0-dev.6fb6c0bad4",
140
- "@lodestar/validator": "^1.50.0-dev.6fb6c0bad4",
130
+ "@lodestar/api": "^1.50.0-dev.9c3f7bebe9",
131
+ "@lodestar/config": "^1.50.0-dev.9c3f7bebe9",
132
+ "@lodestar/db": "^1.50.0-dev.9c3f7bebe9",
133
+ "@lodestar/fork-choice": "^1.50.0-dev.9c3f7bebe9",
134
+ "@lodestar/logger": "^1.50.0-dev.9c3f7bebe9",
135
+ "@lodestar/params": "^1.50.0-dev.9c3f7bebe9",
136
+ "@lodestar/reqresp": "^1.50.0-dev.9c3f7bebe9",
137
+ "@lodestar/state-transition": "^1.50.0-dev.9c3f7bebe9",
138
+ "@lodestar/types": "^1.50.0-dev.9c3f7bebe9",
139
+ "@lodestar/utils": "^1.50.0-dev.9c3f7bebe9",
140
+ "@lodestar/validator": "^1.50.0-dev.9c3f7bebe9",
141
141
  "@multiformats/multiaddr": "^13.0.1",
142
142
  "datastore-core": "^12.0.1",
143
143
  "datastore-level": "^13.0.1",
@@ -158,8 +158,8 @@
158
158
  "devDependencies": {
159
159
  "@libp2p/interface-internal": "^3.1.12",
160
160
  "@libp2p/logger": "^6.2.13",
161
- "@lodestar/spec-test-util": "^1.50.0-dev.6fb6c0bad4",
162
- "@lodestar/test-utils": "^1.50.0-dev.6fb6c0bad4",
161
+ "@lodestar/spec-test-util": "^1.50.0-dev.9c3f7bebe9",
162
+ "@lodestar/test-utils": "^1.50.0-dev.9c3f7bebe9",
163
163
  "@types/js-yaml": "^4.0.5",
164
164
  "@types/qs": "^6.9.7",
165
165
  "@types/tmp": "^0.2.3",
@@ -174,5 +174,5 @@
174
174
  "beacon",
175
175
  "blockchain"
176
176
  ],
177
- "gitHead": "b0cf4ad48ca035db258dd93537a960a310f89a86"
177
+ "gitHead": "b6622aa0e5694b1b9bae9ff8c73324eb54745012"
178
178
  }
@@ -1,6 +1,7 @@
1
1
  import {CheckpointWithHex} from "@lodestar/fork-choice";
2
2
  import {LoggerNode} from "@lodestar/logger/node";
3
3
  import {SLOTS_PER_EPOCH} from "@lodestar/params";
4
+ import {Slot} from "@lodestar/types";
4
5
  import {Checkpoint} from "@lodestar/types/phase0";
5
6
  import {callFnWhenAwait} from "@lodestar/utils";
6
7
  import {IBeaconDb} from "../../db/index.js";
@@ -47,6 +48,8 @@ export class ArchiveStore {
47
48
  private jobQueue: JobItemQueue<[CheckpointWithHex], void>;
48
49
 
49
50
  private archiveDataEpochs?: number;
51
+ // Finalized state writes are monotonic; reset on restart to include the newly persisted anchor.
52
+ private statePruneFromSlot: Slot = 0;
50
53
  private readonly statesArchiverStrategy: StateArchiveStrategy;
51
54
  private readonly chain: IBeaconChain;
52
55
  private readonly db: IBeaconDb;
@@ -103,7 +106,7 @@ export class ArchiveStore {
103
106
  if (this.opts.pruneHistory) {
104
107
  // prune ALL stale data before starting
105
108
  this.logger.info("Pruning historical data");
106
- await callFnWhenAwait(
109
+ const {stateCutoffSlot} = await callFnWhenAwait(
107
110
  pruneHistory(
108
111
  this.chain.config,
109
112
  this.db,
@@ -116,6 +119,7 @@ export class ArchiveStore {
116
119
  30_000,
117
120
  this.signal
118
121
  );
122
+ this.statePruneFromSlot = stateCutoffSlot;
119
123
  }
120
124
 
121
125
  // Initialize earliestAvailableSlot from the earliest block actually retained (after any pruning
@@ -255,14 +259,16 @@ export class ArchiveStore {
255
259
 
256
260
  if (this.opts.pruneHistory) {
257
261
  timer = this.metrics?.processFinalizedCheckpoint.durationByTask.startTimer();
258
- const blockCutoffSlot = await pruneHistory(
262
+ const {blockCutoffSlot, stateCutoffSlot} = await pruneHistory(
259
263
  this.chain.config,
260
264
  this.db,
261
265
  this.logger,
262
266
  this.metrics,
263
267
  finalizedEpoch,
264
- this.chain.clock.currentEpoch
268
+ this.chain.clock.currentEpoch,
269
+ this.statePruneFromSlot
265
270
  );
271
+ this.statePruneFromSlot = stateCutoffSlot;
266
272
  this.chain.earliestAvailableSlot = Math.max(this.chain.earliestAvailableSlot, blockCutoffSlot);
267
273
  timer?.({source: ArchiveStoreTask.PruneHistory});
268
274
  }
@@ -11,8 +11,9 @@ export async function pruneHistory(
11
11
  logger: Logger,
12
12
  metrics: Metrics | null | undefined,
13
13
  finalizedEpoch: Epoch,
14
- currentEpoch: Epoch
15
- ): Promise<Slot> {
14
+ currentEpoch: Epoch,
15
+ statePruneFromSlot: Slot = 0
16
+ ): Promise<{blockCutoffSlot: Slot; stateCutoffSlot: Slot}> {
16
17
  const blockCutoffEpoch = Math.min(
17
18
  // set by config, with underflow protection
18
19
  Math.max(currentEpoch - config.MIN_EPOCHS_FOR_BLOCK_REQUESTS, 0),
@@ -28,6 +29,7 @@ export async function pruneHistory(
28
29
  currentEpoch,
29
30
  finalizedEpoch,
30
31
  blockCutoffEpoch,
32
+ statePruneFromSlot,
31
33
  stateCutoffSlot,
32
34
  });
33
35
 
@@ -35,7 +37,7 @@ export async function pruneHistory(
35
37
  const [blocks, envelopes, states] = await Promise.all([
36
38
  db.blockArchive.keys({gte: 0, lt: blockCutoffSlot}),
37
39
  db.executionPayloadEnvelopeArchive.keys({gte: 0, lt: blockCutoffSlot}),
38
- db.stateArchive.keys({gte: 0, lt: stateCutoffSlot}),
40
+ stateCutoffSlot > statePruneFromSlot ? db.stateArchive.keys({gte: statePruneFromSlot, lt: stateCutoffSlot}) : [],
39
41
  ]);
40
42
  step0?.();
41
43
 
@@ -64,5 +66,5 @@ export async function pruneHistory(
64
66
 
65
67
  metrics?.pruneHistory.pruneCount.inc();
66
68
 
67
- return blockCutoffSlot;
69
+ return {blockCutoffSlot, stateCutoffSlot};
68
70
  }
@@ -1,14 +1,8 @@
1
1
  import {ChainForkConfig} from "@lodestar/config";
2
2
  import {ForkPostGloas, ForkSeq, ZERO_HASH} from "@lodestar/params";
3
- import {
4
- BeaconStateAllForks,
5
- BeaconStateGloas,
6
- IBeaconStateView,
7
- computeEpochAtSlot,
8
- computeStartSlotAtEpoch,
9
- } from "@lodestar/state-transition";
3
+ import {BeaconStateAllForks, BeaconStateGloas, IBeaconStateView, computeEpochAtSlot} from "@lodestar/state-transition";
10
4
  import {SignedBeaconBlock, ssz} from "@lodestar/types";
11
- import {Logger, byteArrayEquals, toHex, toRootHex} from "@lodestar/utils";
5
+ import {LodestarError, Logger, byteArrayEquals, toRootHex} from "@lodestar/utils";
12
6
  import {GENESIS_SLOT} from "../constants/index.js";
13
7
  import {IBeaconDb} from "../db/index.js";
14
8
  import {Metrics} from "../metrics/index.js";
@@ -33,7 +27,8 @@ export async function persistAnchorState(
33
27
  const latestBlockRoot = ssz.phase0.BeaconBlockHeader.hashTreeRoot(latestBlockHeader);
34
28
 
35
29
  if (!byteArrayEquals(blockRoot, latestBlockRoot)) {
36
- throw Error(
30
+ throw new LodestarError(
31
+ {code: "GENESIS_BLOCK_ROOT_MISMATCH"},
37
32
  `Genesis block root ${toRootHex(blockRoot)} does not match genesis state latest block root ${toRootHex(latestBlockRoot)}`
38
33
  );
39
34
  }
@@ -86,52 +81,6 @@ export async function initStateFromDb(
86
81
  return state;
87
82
  }
88
83
 
89
- /**
90
- * Initialize and persist an anchor state (either weak subjectivity or genesis)
91
- */
92
- export async function checkAndPersistAnchorState(
93
- config: ChainForkConfig,
94
- db: IBeaconDb,
95
- logger: Logger,
96
- anchorState: BeaconStateAllForks,
97
- anchorStateBytes: Uint8Array,
98
- {
99
- isWithinWeakSubjectivityPeriod,
100
- isCheckpointState,
101
- }: {isWithinWeakSubjectivityPeriod: boolean; isCheckpointState: boolean}
102
- ): Promise<void> {
103
- const expectedFork = config.getForkInfo(computeStartSlotAtEpoch(anchorState.fork.epoch));
104
- const expectedForkVersion = toHex(expectedFork.version);
105
- const stateFork = toHex(anchorState.fork.currentVersion);
106
- if (stateFork !== expectedForkVersion) {
107
- throw Error(
108
- `State current fork version ${stateFork} not equal to current config ${expectedForkVersion}. Maybe caused by importing a state from a different network`
109
- );
110
- }
111
-
112
- const stateInfo = isCheckpointState ? "checkpoint" : "db";
113
- if (isWithinWeakSubjectivityPeriod) {
114
- logger.info(`Initializing beacon from a valid ${stateInfo} state`, {
115
- slot: anchorState.slot,
116
- epoch: computeEpochAtSlot(anchorState.slot),
117
- stateRoot: toRootHex(anchorState.hashTreeRoot()),
118
- isWithinWeakSubjectivityPeriod,
119
- });
120
- } else {
121
- logger.warn(`Initializing from a stale ${stateInfo} state vulnerable to long range attacks`, {
122
- slot: anchorState.slot,
123
- epoch: computeEpochAtSlot(anchorState.slot),
124
- stateRoot: toRootHex(anchorState.hashTreeRoot()),
125
- isWithinWeakSubjectivityPeriod,
126
- });
127
- logger.warn("Checkpoint sync recommended, please use --help to see checkpoint sync options");
128
- }
129
-
130
- if (isCheckpointState || anchorState.slot === GENESIS_SLOT) {
131
- await persistAnchorState(config, db, anchorState, anchorStateBytes);
132
- }
133
- }
134
-
135
84
  export function initBeaconMetrics(metrics: Metrics, state: IBeaconStateView): void {
136
85
  metrics.headSlot.set(state.slot);
137
86
  metrics.previousJustifiedEpoch.set(state.previousJustifiedCheckpoint.epoch);
package/src/db/beacon.ts CHANGED
@@ -122,6 +122,8 @@ export class BeaconDb implements IBeaconDb {
122
122
  async pruneHotDb(): Promise<void> {
123
123
  // Prune all hot blobs
124
124
  await this.blobSidecars.batchDelete(await this.blobSidecars.keys());
125
+ // New columns are persisted in flat files, so this bucket only contains legacy hot data.
126
+ await this.deleteBucketData(Bucket.allForks_dataColumnSidecars);
125
127
  // Prune all hot blocks
126
128
  // TODO: Enable once it's deemed safe
127
129
  // await this.block.batchDelete(await this.block.keys());
@@ -516,12 +516,13 @@ export class ExecutionEngineHttp implements IExecutionEngine {
516
516
  ): Promise<(BlobAndProof | null)[]>;
517
517
  async getBlobs(
518
518
  fork: ForkName,
519
- versionedHashes: VersionedHashes
519
+ versionedHashes: VersionedHashes,
520
+ buffers?: Uint8Array[]
520
521
  ): Promise<BlobAndProofV2[] | (BlobAndProof | null)[] | null> {
521
522
  assertReqSizeLimit(versionedHashes.length, MAX_VERSIONED_HASHES);
522
523
  const versionedHashesHex = versionedHashes.map(bytesToData);
523
524
  if (isForkPostFulu(fork)) {
524
- return await this.getBlobsV2(versionedHashesHex);
525
+ return await this.getBlobsV2(versionedHashesHex, buffers);
525
526
  }
526
527
  return await this.getBlobsV1(versionedHashesHex);
527
528
  }
@@ -551,8 +552,9 @@ export class ExecutionEngineHttp implements IExecutionEngine {
551
552
 
552
553
  private async getBlobsV2(versionedHashesHex: string[], buffers?: Uint8Array[]) {
553
554
  if (buffers) {
554
- if (buffers.length !== versionedHashesHex.length) {
555
- throw Error(`Invalid buffers length=${buffers.length} versionedHashes=${versionedHashesHex.length}`);
555
+ // Callers preallocate one buffer per max blobs of the epoch, only the first entries are used
556
+ if (buffers.length < versionedHashesHex.length) {
557
+ throw Error(`Not enough buffers length=${buffers.length} versionedHashes=${versionedHashesHex.length}`);
556
558
  }
557
559
 
558
560
  for (const [i, buffer] of buffers.entries()) {
package/src/index.ts CHANGED
@@ -2,7 +2,7 @@
2
2
 
3
3
  export type {RestApiServerMetrics, RestApiServerModules, RestApiServerOpts} from "./api/rest/base.js";
4
4
  export {RestApiServer} from "./api/rest/base.js";
5
- export {checkAndPersistAnchorState} from "./chain/index.js";
5
+ export {persistAnchorState} from "./chain/index.js";
6
6
  export {DbCPStateDatastore} from "./chain/stateCache/datastore/db.js";
7
7
  export {FileCPStateDatastore} from "./chain/stateCache/datastore/file.js";
8
8
  export {BeaconDb, type IBeaconDb} from "./db/index.js";
@@ -216,7 +216,7 @@ export function createBeaconMetrics(register: RegistryMetricCreator) {
216
216
  }),
217
217
  },
218
218
  payloadEnvelopeReconstruction: {
219
- envelopes: register.counter<{result: "ok" | "unavailable" | "mismatch"}>({
219
+ envelopes: register.counter<{result: "success" | "unavailable" | "mismatch"}>({
220
220
  name: "beacon_payload_envelope_reconstruction_envelopes_total",
221
221
  help: "Archived header envelopes rebuilt from EL bodies, by outcome",
222
222
  labelNames: ["result"],
@@ -42,13 +42,13 @@ export class MetadataController {
42
42
  private onSetValue: (key: string, value: Uint8Array) => void;
43
43
  private networkConfig: NetworkConfig;
44
44
  private logger: Logger;
45
- private _metadata: fulu.Metadata;
45
+ private metadata: fulu.Metadata;
46
46
 
47
47
  constructor(opts: MetadataOpts, modules: MetadataModules) {
48
48
  this.networkConfig = modules.networkConfig;
49
49
  this.logger = modules.logger;
50
50
  this.onSetValue = modules.onSetValue;
51
- this._metadata = opts.metadata ?? {
51
+ this.metadata = opts.metadata ?? {
52
52
  ...ssz.fulu.Metadata.defaultValue(),
53
53
  custodyGroupCount: modules.networkConfig.custodyConfig.targetCustodyGroupCount,
54
54
  };
@@ -58,61 +58,61 @@ export class MetadataController {
58
58
  // updateEth2Field() MUST be called with clock epoch
59
59
  this.updateEth2Field(currentEpoch);
60
60
 
61
- this.onSetValue(ENRKey.attnets, ssz.phase0.AttestationSubnets.serialize(this._metadata.attnets));
61
+ this.onSetValue(ENRKey.attnets, ssz.phase0.AttestationSubnets.serialize(this.metadata.attnets));
62
62
 
63
63
  const config = this.networkConfig.config;
64
64
 
65
65
  if (config.getForkSeq(computeStartSlotAtEpoch(currentEpoch)) >= ForkSeq.altair) {
66
66
  // Only persist syncnets if altair fork is already activated. If currentFork is altair but head is phase0
67
67
  // adding syncnets to the ENR is not a problem, we will just have a useless field for a few hours.
68
- this.onSetValue(ENRKey.syncnets, ssz.altair.SyncSubnets.serialize(this._metadata.syncnets));
68
+ this.onSetValue(ENRKey.syncnets, ssz.altair.SyncSubnets.serialize(this.metadata.syncnets));
69
69
  }
70
70
 
71
71
  // Set CGC regardless of fork. It may be useful to clients before Fulu, and will be ignored otherwise.
72
- this.onSetValue(ENRKey.cgc, serializeCgc(this._metadata.custodyGroupCount));
72
+ this.onSetValue(ENRKey.cgc, serializeCgc(this.metadata.custodyGroupCount));
73
73
  }
74
74
 
75
75
  get seqNumber(): bigint {
76
- return this._metadata.seqNumber;
76
+ return this.metadata.seqNumber;
77
77
  }
78
78
 
79
79
  get syncnets(): BitArray {
80
- return this._metadata.syncnets;
80
+ return this.metadata.syncnets;
81
81
  }
82
82
 
83
83
  set syncnets(syncnets: BitArray) {
84
84
  this.onSetValue(ENRKey.syncnets, ssz.altair.SyncSubnets.serialize(syncnets));
85
- this._metadata.seqNumber++;
86
- this._metadata.syncnets = syncnets;
85
+ this.metadata.seqNumber++;
86
+ this.metadata.syncnets = syncnets;
87
87
  }
88
88
 
89
89
  get attnets(): BitArray {
90
- return this._metadata.attnets;
90
+ return this.metadata.attnets;
91
91
  }
92
92
 
93
93
  set attnets(attnets: BitArray) {
94
94
  this.onSetValue(ENRKey.attnets, ssz.phase0.AttestationSubnets.serialize(attnets));
95
- this._metadata.seqNumber++;
96
- this._metadata.attnets = attnets;
95
+ this.metadata.seqNumber++;
96
+ this.metadata.attnets = attnets;
97
97
  }
98
98
 
99
99
  get custodyGroupCount(): number {
100
- return this._metadata.custodyGroupCount;
100
+ return this.metadata.custodyGroupCount;
101
101
  }
102
102
 
103
103
  set custodyGroupCount(custodyGroupCount: number) {
104
- if (custodyGroupCount === this._metadata.custodyGroupCount) {
104
+ if (custodyGroupCount === this.metadata.custodyGroupCount) {
105
105
  return;
106
106
  }
107
107
  this.onSetValue(ENRKey.cgc, serializeCgc(custodyGroupCount));
108
108
  this.logger.debug("Updated cgc field in ENR", {custodyGroupCount});
109
- this._metadata.seqNumber++;
110
- this._metadata.custodyGroupCount = custodyGroupCount;
109
+ this.metadata.seqNumber++;
110
+ this.metadata.custodyGroupCount = custodyGroupCount;
111
111
  }
112
112
 
113
113
  /** Consumers that need the phase0.Metadata type can just ignore the .syncnets property */
114
114
  get json(): fulu.Metadata {
115
- return this._metadata;
115
+ return this.metadata;
116
116
  }
117
117
 
118
118
  /**
@@ -16,23 +16,23 @@ type AwaitGenerator<T, TReturn = any, TNext = any> = Generator<T, TReturn, TNext
16
16
  * This has a memory issue because all peer data stays in memory and loaded at startup time
17
17
  * This is written for libp2p >=0.35, we maintain the same mechanism but with bounded data structure
18
18
  * This datastore includes a memory datastore and fallback to db datastore
19
- * Use an in-memory datastore with last accessed time and _maxMemoryItems, on start it's empty (lazy load)
19
+ * Use an in-memory datastore with last accessed time and maxMemoryItems, on start it's empty (lazy load)
20
20
  * - get: Search in-memory datastore first, if not found search from db.
21
21
  * - If found from db, add back to the in-memory datastore
22
22
  * - Update lastAccessedMs
23
- * - put: move oldest items from memory to db if there are more than _maxMemoryItems items in memory
24
- * - update memory datastore, only update db datastore if there are at least _threshold dirty items
23
+ * - put: move oldest items from memory to db if there are more than maxMemoryItems items in memory
24
+ * - update memory datastore, only update db datastore if there are at least threshold dirty items
25
25
  * - Update lastAccessedMs
26
26
  */
27
27
  export class Eth2PeerDataStore extends BaseDatastore {
28
- private _dbDatastore: LevelDatastore;
29
- private _memoryDatastore: Map<string, MemoryItem>;
28
+ private dbDatastore: LevelDatastore;
29
+ private memoryDatastore: Map<string, MemoryItem>;
30
30
  /** Same to PersistentPeerStore of the old libp2p implementation */
31
- private _dirtyItems = new Set<string>();
31
+ private dirtyItems = new Set<string>();
32
32
  /** If there are more dirty items than threshold, commit data to db */
33
- private _threshold: number;
33
+ private threshold: number;
34
34
  /** If there are more memory items than this, prune oldest ones from memory and move to db */
35
- private _maxMemoryItems: number;
35
+ private maxMemoryItems: number;
36
36
 
37
37
  constructor(
38
38
  dbDatastore: LevelDatastore | string,
@@ -47,18 +47,18 @@ export class Eth2PeerDataStore extends BaseDatastore {
47
47
  throw Error(`Threshold ${threshold} should be at most maxMemoryItems ${maxMemoryItems}`);
48
48
  }
49
49
 
50
- this._dbDatastore = typeof dbDatastore === "string" ? new LevelDatastore(dbDatastore) : dbDatastore;
51
- this._memoryDatastore = new Map();
52
- this._threshold = threshold;
53
- this._maxMemoryItems = maxMemoryItems;
50
+ this.dbDatastore = typeof dbDatastore === "string" ? new LevelDatastore(dbDatastore) : dbDatastore;
51
+ this.memoryDatastore = new Map();
52
+ this.threshold = threshold;
53
+ this.maxMemoryItems = maxMemoryItems;
54
54
  }
55
55
 
56
56
  async open(): Promise<void> {
57
- return this._dbDatastore.open();
57
+ return this.dbDatastore.open();
58
58
  }
59
59
 
60
60
  async close(): Promise<void> {
61
- return this._dbDatastore.close();
61
+ return this.dbDatastore.close();
62
62
  }
63
63
 
64
64
  async put(key: Key, val: Uint8Array, _options?: AbortOptions): Promise<Key> {
@@ -67,23 +67,23 @@ export class Eth2PeerDataStore extends BaseDatastore {
67
67
 
68
68
  /**
69
69
  * Same interface to put with "fromDb" option, if this item is updated back from db
70
- * Move oldest items from memory data store to db if it's over this._maxMemoryItems
70
+ * Move oldest items from memory data store to db if it's over this.maxMemoryItems
71
71
  */
72
72
  async _put(key: Key, val: Uint8Array, fromDb = false): Promise<Key> {
73
- while (this._memoryDatastore.size >= this._maxMemoryItems) {
73
+ while (this.memoryDatastore.size >= this.maxMemoryItems) {
74
74
  // it's likely this is called only 1 time
75
75
  await this.pruneMemoryDatastore();
76
76
  }
77
77
 
78
78
  const keyStr = key.toString();
79
- const memoryItem = this._memoryDatastore.get(keyStr);
79
+ const memoryItem = this.memoryDatastore.get(keyStr);
80
80
  if (memoryItem) {
81
81
  // update existing
82
82
  memoryItem.lastAccessedMs = Date.now();
83
83
  memoryItem.data = val;
84
84
  } else {
85
85
  // new
86
- this._memoryDatastore.set(keyStr, {data: val, lastAccessedMs: Date.now()});
86
+ this.memoryDatastore.set(keyStr, {data: val, lastAccessedMs: Date.now()});
87
87
  }
88
88
 
89
89
  if (!fromDb) await this._addDirtyItem(keyStr);
@@ -98,15 +98,15 @@ export class Eth2PeerDataStore extends BaseDatastore {
98
98
  */
99
99
  async get(key: Key, options?: AbortOptions): Promise<Uint8Array> {
100
100
  const keyStr = key.toString();
101
- const memoryItem = this._memoryDatastore.get(keyStr);
101
+ const memoryItem = this.memoryDatastore.get(keyStr);
102
102
  if (memoryItem) {
103
103
  memoryItem.lastAccessedMs = Date.now();
104
104
  return memoryItem.data;
105
105
  }
106
106
 
107
107
  // this throws error if not found
108
- const dbValue = await this._dbDatastore.get(key, options);
109
- // don't call this._memoryDatastore.set directly
108
+ const dbValue = await this.dbDatastore.get(key, options);
109
+ // don't call this.memoryDatastore.set directly
110
110
  // we want to get through prune() logic with fromDb as true
111
111
  await this._put(key, dbValue, true);
112
112
  return dbValue;
@@ -125,30 +125,30 @@ export class Eth2PeerDataStore extends BaseDatastore {
125
125
  }
126
126
 
127
127
  async delete(key: Key, options?: AbortOptions): Promise<void> {
128
- this._memoryDatastore.delete(key.toString());
129
- await this._dbDatastore.delete(key, options);
128
+ this.memoryDatastore.delete(key.toString());
129
+ await this.dbDatastore.delete(key, options);
130
130
  }
131
131
 
132
132
  async *_all(q: Query, options?: AbortOptions): AwaitGenerator<Pair> {
133
- for (const [key, value] of this._memoryDatastore.entries()) {
133
+ for (const [key, value] of this.memoryDatastore.entries()) {
134
134
  yield {
135
135
  key: new Key(key),
136
136
  value: value.data,
137
137
  };
138
138
  }
139
- yield* this._dbDatastore.query(q, options);
139
+ yield* this.dbDatastore.query(q, options);
140
140
  }
141
141
 
142
142
  async *_allKeys(q: KeyQuery, options?: AbortOptions): AwaitGenerator<Key> {
143
- for (const key of this._memoryDatastore.keys()) {
143
+ for (const key of this.memoryDatastore.keys()) {
144
144
  yield new Key(key);
145
145
  }
146
- yield* this._dbDatastore.queryKeys(q, options);
146
+ yield* this.dbDatastore.queryKeys(q, options);
147
147
  }
148
148
 
149
149
  private async _addDirtyItem(keyStr: string): Promise<void> {
150
- this._dirtyItems.add(keyStr);
151
- if (this._dirtyItems.size >= this._threshold) {
150
+ this.dirtyItems.add(keyStr);
151
+ if (this.dirtyItems.size >= this.threshold) {
152
152
  try {
153
153
  await this._commitData();
154
154
  } catch (_e) {}
@@ -156,15 +156,15 @@ export class Eth2PeerDataStore extends BaseDatastore {
156
156
  }
157
157
 
158
158
  private async _commitData(): Promise<void> {
159
- const batch = this._dbDatastore.batch();
160
- for (const keyStr of this._dirtyItems) {
161
- const memoryItem = this._memoryDatastore.get(keyStr);
159
+ const batch = this.dbDatastore.batch();
160
+ for (const keyStr of this.dirtyItems) {
161
+ const memoryItem = this.memoryDatastore.get(keyStr);
162
162
  if (memoryItem) {
163
163
  batch.put(new Key(keyStr), memoryItem.data);
164
164
  }
165
165
  }
166
166
  await batch.commit();
167
- this._dirtyItems.clear();
167
+ this.dirtyItems.clear();
168
168
  }
169
169
 
170
170
  /**
@@ -175,7 +175,7 @@ export class Eth2PeerDataStore extends BaseDatastore {
175
175
  let oldestKey: string | undefined = undefined;
176
176
  let oldestValue: Uint8Array | undefined = undefined;
177
177
 
178
- for (const [key, value] of this._memoryDatastore) {
178
+ for (const [key, value] of this.memoryDatastore) {
179
179
  if (value.lastAccessedMs < oldestAccessedMs) {
180
180
  oldestAccessedMs = value.lastAccessedMs;
181
181
  oldestKey = key;
@@ -184,8 +184,8 @@ export class Eth2PeerDataStore extends BaseDatastore {
184
184
  }
185
185
 
186
186
  if (oldestKey && oldestValue) {
187
- await this._dbDatastore.put(new Key(oldestKey), oldestValue);
188
- this._memoryDatastore.delete(oldestKey);
187
+ await this.dbDatastore.put(new Key(oldestKey), oldestValue);
188
+ this.memoryDatastore.delete(oldestKey);
189
189
  }
190
190
  }
191
191
  }
@@ -6,6 +6,7 @@ import {toRootHex} from "@lodestar/utils";
6
6
  import {EnvelopeReconstructionError} from "../../../chain/errors/index.js";
7
7
  import {IBeaconChain} from "../../../chain/index.js";
8
8
  import {IBeaconDb} from "../../../db/index.js";
9
+ import {MAX_BODIES_PER_REQUEST} from "../../../util/execution.js";
9
10
  import {ExecutionPayloadEnvelopesByRootRequest} from "../../../util/types.js";
10
11
  import {prettyPrintPeerId} from "../../util.js";
11
12
 
@@ -19,10 +20,15 @@ export async function* onExecutionPayloadEnvelopesByRoot(
19
20
  // The gloas req/resp spec uses MIN_EPOCHS_FOR_BLOCK_REQUESTS to define the minimum range peers MUST serve.
20
21
  // Archival nodes may still serve older retained payloads to allow genesis sync.
21
22
 
22
- // Resolve slots first so archived header envelopes are rebuilt in one EL batch, not one call per root
23
+ // Resolve slots first so archived envelopes can be reconstructed in EL batches.
24
+ // Duplicate roots are served once, since each archived envelope costs an EL fetch and a rebuild.
23
25
  const requests: {blockSlot: Slot; blockRootHex: RootHex}[] = [];
26
+ const seenRoots = new Set<RootHex>();
24
27
  for (const root of requestBody) {
25
28
  const rootHex = toRootHex(root);
29
+ if (seenRoots.has(rootHex)) continue;
30
+ seenRoots.add(rootHex);
31
+
26
32
  const block = chain.forkChoice.getBlockHexDefaultStatus(rootHex);
27
33
  // If the block is not in fork choice, it may be finalized. Attempt to find its slot in block archive
28
34
  const slot = block ? block.slot : await db.blockArchive.getSlotByRoot(root);
@@ -41,35 +47,43 @@ export async function* onExecutionPayloadEnvelopesByRoot(
41
47
  requests.push({blockSlot: slot, blockRootHex: rootHex});
42
48
  }
43
49
 
44
- let envelopesBytes: (Uint8Array | null)[];
45
- try {
46
- // by-root allows omission, so a mismatched envelope is left out rather than failing the response
47
- envelopesBytes = await chain.getSerializedExecutionPayloadEnvelopes(requests, "omit");
48
- } catch (e) {
49
- if (e instanceof EnvelopeReconstructionError) {
50
- throw new ResponseError(
51
- RespStatus.RESOURCE_UNAVAILABLE,
52
- `Failed to reconstruct archived envelopes: ${e.message}`
53
- );
50
+ // Yield between EL batches so the first response does not wait for the entire request.
51
+ let yielded = 0;
52
+ for (let i = 0; i < requests.length; i += MAX_BODIES_PER_REQUEST) {
53
+ const batch = requests.slice(i, i + MAX_BODIES_PER_REQUEST);
54
+ let envelopesBytes: (Uint8Array | null)[];
55
+ try {
56
+ // By-root allows omission, so a mismatched envelope is left out rather than failing the response.
57
+ envelopesBytes = await chain.getSerializedExecutionPayloadEnvelopes(batch, "omit");
58
+ } catch (e) {
59
+ if (e instanceof EnvelopeReconstructionError) {
60
+ // By-root permits partial responses, so an EL failure can end the response here.
61
+ if (yielded > 0) return;
62
+ throw new ResponseError(
63
+ RespStatus.RESOURCE_UNAVAILABLE,
64
+ `Failed to reconstruct archived envelopes: ${e.message}`
65
+ );
66
+ }
67
+ throw e;
54
68
  }
55
- throw e;
56
- }
57
69
 
58
- for (let i = 0; i < requests.length; i++) {
59
- const {blockSlot, blockRootHex} = requests[i];
60
- const envelopeBytes = envelopesBytes[i];
61
- if (envelopeBytes) {
62
- yield {
63
- data: envelopeBytes,
64
- boundary: chain.config.getForkBoundaryAtEpoch(computeEpochAtSlot(blockSlot)),
65
- };
66
- } else {
67
- chain.logger.debug("Cannot serve ExecutionPayloadEnvelopesByRoot: envelope not found", {
68
- slot: blockSlot,
69
- root: blockRootHex,
70
- peer: prettyPrintPeerId(peerId),
71
- client: peerClient,
72
- });
70
+ for (let j = 0; j < batch.length; j++) {
71
+ const {blockSlot, blockRootHex} = batch[j];
72
+ const envelopeBytes = envelopesBytes[j];
73
+ if (envelopeBytes) {
74
+ yielded++;
75
+ yield {
76
+ data: envelopeBytes,
77
+ boundary: chain.config.getForkBoundaryAtEpoch(computeEpochAtSlot(blockSlot)),
78
+ };
79
+ } else {
80
+ chain.logger.debug("Cannot serve ExecutionPayloadEnvelopesByRoot: envelope not found", {
81
+ slot: blockSlot,
82
+ root: blockRootHex,
83
+ peer: prettyPrintPeerId(peerId),
84
+ client: peerClient,
85
+ });
86
+ }
73
87
  }
74
88
  }
75
89
  }