@lodestar/beacon-node 1.50.0-dev.055a216e01 → 1.50.0-dev.072bf98853
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.
- package/lib/chain/blocks/importBlock.d.ts.map +1 -1
- package/lib/chain/blocks/importBlock.js +6 -3
- package/lib/chain/blocks/importBlock.js.map +1 -1
- package/lib/chain/blocks/verifyBlock.d.ts.map +1 -1
- package/lib/chain/blocks/verifyBlock.js +6 -6
- package/lib/chain/blocks/verifyBlock.js.map +1 -1
- package/lib/chain/chain.d.ts.map +1 -1
- package/lib/chain/chain.js +34 -15
- package/lib/chain/chain.js.map +1 -1
- package/lib/chain/shufflingCache.d.ts +17 -8
- package/lib/chain/shufflingCache.d.ts.map +1 -1
- package/lib/chain/shufflingCache.js +68 -18
- package/lib/chain/shufflingCache.js.map +1 -1
- package/lib/metrics/metrics/lodestar.d.ts +6 -0
- package/lib/metrics/metrics/lodestar.d.ts.map +1 -1
- package/lib/metrics/metrics/lodestar.js +13 -0
- package/lib/metrics/metrics/lodestar.js.map +1 -1
- package/lib/sync/range/batch.d.ts +5 -5
- package/lib/sync/range/batch.d.ts.map +1 -1
- package/lib/sync/range/batch.js +11 -17
- package/lib/sync/range/batch.js.map +1 -1
- package/lib/sync/range/chain.d.ts +4 -4
- package/lib/sync/range/chain.d.ts.map +1 -1
- package/lib/sync/range/chain.js +7 -5
- package/lib/sync/range/chain.js.map +1 -1
- package/lib/sync/range/range.d.ts.map +1 -1
- package/lib/sync/range/range.js +25 -11
- package/lib/sync/range/range.js.map +1 -1
- package/lib/sync/unknownBlock.d.ts +5 -2
- package/lib/sync/unknownBlock.d.ts.map +1 -1
- package/lib/sync/unknownBlock.js +44 -20
- package/lib/sync/unknownBlock.js.map +1 -1
- package/lib/sync/utils/downloadByRange.d.ts +38 -14
- package/lib/sync/utils/downloadByRange.d.ts.map +1 -1
- package/lib/sync/utils/downloadByRange.js +84 -39
- package/lib/sync/utils/downloadByRange.js.map +1 -1
- package/package.json +15 -15
- package/src/chain/blocks/importBlock.ts +7 -2
- package/src/chain/blocks/verifyBlock.ts +7 -6
- package/src/chain/chain.ts +42 -15
- package/src/chain/shufflingCache.ts +79 -22
- package/src/metrics/metrics/lodestar.ts +14 -0
- package/src/sync/range/batch.ts +14 -19
- package/src/sync/range/chain.ts +9 -7
- package/src/sync/range/range.ts +26 -12
- package/src/sync/unknownBlock.ts +57 -21
- package/src/sync/utils/downloadByRange.ts +123 -58
|
@@ -7,14 +7,12 @@ import {
|
|
|
7
7
|
getIndexedAttestation,
|
|
8
8
|
} from "@lodestar/state-transition";
|
|
9
9
|
import {Attestation, CommitteeIndex, Epoch, IndexedAttestation, RootHex, Slot} from "@lodestar/types";
|
|
10
|
-
import {LodestarError, Logger, MapDef
|
|
10
|
+
import {LodestarError, Logger, MapDef} from "@lodestar/utils";
|
|
11
11
|
import {Metrics} from "../metrics/metrics.js";
|
|
12
12
|
|
|
13
13
|
/**
|
|
14
|
-
*
|
|
15
|
-
*
|
|
16
|
-
* - don't have shuffling to verify attestations, need to do 1 epoch transition to add shuffling to this cache. This never happens
|
|
17
|
-
* with default chain option of maxSkipSlots = 32
|
|
14
|
+
* Lookahead duties, gossip validation, and block production need epochs n-1, n, and n+1 for current epoch n.
|
|
15
|
+
* Keep the 4 highest epochs so that it works for epoch rotation.
|
|
18
16
|
**/
|
|
19
17
|
const MAX_EPOCHS = 4;
|
|
20
18
|
|
|
@@ -37,24 +35,29 @@ type ShufflingCacheItem = {
|
|
|
37
35
|
type PromiseCacheItem = {
|
|
38
36
|
type: CacheItemType.promise;
|
|
39
37
|
timeInsertedMs: number;
|
|
40
|
-
promise
|
|
41
|
-
|
|
38
|
+
/** Resolves to null if the promise is cancelled */
|
|
39
|
+
promise: Promise<EpochShuffling | null>;
|
|
40
|
+
resolveFn: (shuffling: EpochShuffling | null) => void;
|
|
42
41
|
};
|
|
43
42
|
|
|
44
43
|
type CacheItem = ShufflingCacheItem | PromiseCacheItem;
|
|
45
44
|
|
|
45
|
+
export enum ShufflingPromiseCancelReason {
|
|
46
|
+
regenError = "regen_error",
|
|
47
|
+
decisionRootMismatch = "decision_root_mismatch",
|
|
48
|
+
pruned = "pruned",
|
|
49
|
+
}
|
|
50
|
+
|
|
46
51
|
export type ShufflingCacheOpts = {
|
|
47
52
|
maxShufflingCacheEpochs?: number;
|
|
48
53
|
};
|
|
49
54
|
|
|
50
55
|
/**
|
|
51
|
-
*
|
|
52
|
-
*
|
|
53
|
-
* - if a shuffling is not available (which does not happen with default chain option of maxSkipSlots = 32), track a promise to make sure we don't compute the same shuffling twice
|
|
54
|
-
* - skip computing shuffling when loading state bytes from disk
|
|
56
|
+
* Cache recent epoch shufflings for lookahead duties, gossip validation, and block production.
|
|
57
|
+
* Pending promises deduplicate computation of missing shufflings.
|
|
55
58
|
*/
|
|
56
59
|
export class ShufflingCache {
|
|
57
|
-
/**
|
|
60
|
+
/** Pruned to the `maxEpochs` highest epochs every time we add a shuffling */
|
|
58
61
|
private readonly itemsByDecisionRootByEpoch: MapDef<Epoch, Map<RootHex, CacheItem>> = new MapDef(
|
|
59
62
|
() => new Map<RootHex, CacheItem>()
|
|
60
63
|
);
|
|
@@ -73,6 +76,9 @@ export class ShufflingCache {
|
|
|
73
76
|
Array.from(this.itemsByDecisionRootByEpoch.values()).reduce((total, innerMap) => total + innerMap.size, 0)
|
|
74
77
|
)
|
|
75
78
|
);
|
|
79
|
+
metrics.shufflingCache.epochs.addCollect(() =>
|
|
80
|
+
metrics.shufflingCache.epochs.set(this.itemsByDecisionRootByEpoch.size)
|
|
81
|
+
);
|
|
76
82
|
}
|
|
77
83
|
|
|
78
84
|
this.maxEpochs = opts.maxShufflingCacheEpochs ?? MAX_EPOCHS;
|
|
@@ -97,8 +103,8 @@ export class ShufflingCache {
|
|
|
97
103
|
`Too many shuffling promises: ${promiseCount}, shufflingEpoch: ${epoch}, decisionRootHex: ${decisionRoot}`
|
|
98
104
|
);
|
|
99
105
|
}
|
|
100
|
-
let resolveFn: ((shuffling: EpochShuffling) => void) | null = null;
|
|
101
|
-
const promise = new Promise<EpochShuffling>((resolve) => {
|
|
106
|
+
let resolveFn: ((shuffling: EpochShuffling | null) => void) | null = null;
|
|
107
|
+
const promise = new Promise<EpochShuffling | null>((resolve) => {
|
|
102
108
|
resolveFn = resolve;
|
|
103
109
|
});
|
|
104
110
|
if (resolveFn === null) {
|
|
@@ -121,7 +127,7 @@ export class ShufflingCache {
|
|
|
121
127
|
* Return null if we don't have a shuffling for this epoch and dependentRootHex.
|
|
122
128
|
*/
|
|
123
129
|
async get(epoch: Epoch, decisionRoot: RootHex): Promise<EpochShuffling | null> {
|
|
124
|
-
const cacheItem = this.itemsByDecisionRootByEpoch.
|
|
130
|
+
const cacheItem = this.itemsByDecisionRootByEpoch.get(epoch)?.get(decisionRoot);
|
|
125
131
|
if (cacheItem === undefined) {
|
|
126
132
|
this.metrics?.shufflingCache.miss.inc();
|
|
127
133
|
return null;
|
|
@@ -136,12 +142,10 @@ export class ShufflingCache {
|
|
|
136
142
|
}
|
|
137
143
|
|
|
138
144
|
/**
|
|
139
|
-
* Get a shuffling synchronously, return null if not present.
|
|
140
|
-
* The only time we have a promise cache item is when we regen shuffling for attestation, which never happens
|
|
141
|
-
* with default chain option.
|
|
145
|
+
* Get a shuffling synchronously, return null if not present or if it's still being computed.
|
|
142
146
|
*/
|
|
143
147
|
getSync(epoch: Epoch, decisionRoot: RootHex): EpochShuffling | null {
|
|
144
|
-
const cacheItem = this.itemsByDecisionRootByEpoch.
|
|
148
|
+
const cacheItem = this.itemsByDecisionRootByEpoch.get(epoch)?.get(decisionRoot);
|
|
145
149
|
if (cacheItem === undefined) {
|
|
146
150
|
this.metrics?.shufflingCache.miss.inc();
|
|
147
151
|
return null;
|
|
@@ -161,7 +165,7 @@ export class ShufflingCache {
|
|
|
161
165
|
* `NativeBeaconStateView`.
|
|
162
166
|
*/
|
|
163
167
|
has(epoch: Epoch, decisionRoot: RootHex): boolean {
|
|
164
|
-
const cacheItem = this.itemsByDecisionRootByEpoch.
|
|
168
|
+
const cacheItem = this.itemsByDecisionRootByEpoch.get(epoch)?.get(decisionRoot);
|
|
165
169
|
return cacheItem !== undefined && isShufflingCacheItem(cacheItem);
|
|
166
170
|
}
|
|
167
171
|
|
|
@@ -186,6 +190,25 @@ export class ShufflingCache {
|
|
|
186
190
|
}
|
|
187
191
|
}
|
|
188
192
|
|
|
193
|
+
/**
|
|
194
|
+
* Resolve a pending promise with null so that waiters don't hang, then remove it.
|
|
195
|
+
*/
|
|
196
|
+
cancelPromise(epoch: Epoch, decisionRoot: RootHex, reason: ShufflingPromiseCancelReason): void {
|
|
197
|
+
const itemsByDecisionRoot = this.itemsByDecisionRootByEpoch.get(epoch);
|
|
198
|
+
const cacheItem = itemsByDecisionRoot?.get(decisionRoot);
|
|
199
|
+
if (itemsByDecisionRoot === undefined || cacheItem === undefined || !isPromiseCacheItem(cacheItem)) {
|
|
200
|
+
return;
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
cacheItem.resolveFn(null);
|
|
204
|
+
itemsByDecisionRoot.delete(decisionRoot);
|
|
205
|
+
if (itemsByDecisionRoot.size === 0) {
|
|
206
|
+
this.itemsByDecisionRootByEpoch.delete(epoch);
|
|
207
|
+
}
|
|
208
|
+
this.metrics?.shufflingCache.cancelledPromises.inc({reason});
|
|
209
|
+
this.logger?.debug("Cancelled shuffling promise", {epoch, decisionRoot, reason});
|
|
210
|
+
}
|
|
211
|
+
|
|
189
212
|
getIndexedAttestation(
|
|
190
213
|
epoch: number,
|
|
191
214
|
decisionRoot: string,
|
|
@@ -248,8 +271,42 @@ export class ShufflingCache {
|
|
|
248
271
|
}
|
|
249
272
|
// set the shuffling
|
|
250
273
|
shufflingAtEpoch.set(decisionRoot, {type: CacheItemType.shuffling, shuffling});
|
|
251
|
-
|
|
252
|
-
|
|
274
|
+
this.prune();
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
/**
|
|
278
|
+
* Keep the `maxEpochs` highest epochs, regardless of insertion order.
|
|
279
|
+
*/
|
|
280
|
+
private prune(): void {
|
|
281
|
+
const toDelete = this.itemsByDecisionRootByEpoch.size - this.maxEpochs;
|
|
282
|
+
if (toDelete <= 0) {
|
|
283
|
+
return;
|
|
284
|
+
}
|
|
285
|
+
|
|
286
|
+
const prunedEpochs = Array.from(this.itemsByDecisionRootByEpoch.keys())
|
|
287
|
+
.sort((a, b) => a - b)
|
|
288
|
+
.slice(0, toDelete);
|
|
289
|
+
let prunedShufflings = 0;
|
|
290
|
+
for (const epoch of prunedEpochs) {
|
|
291
|
+
for (const cacheItem of this.itemsByDecisionRootByEpoch.get(epoch)?.values() ?? []) {
|
|
292
|
+
if (isPromiseCacheItem(cacheItem)) {
|
|
293
|
+
cacheItem.resolveFn(null);
|
|
294
|
+
this.metrics?.shufflingCache.cancelledPromises.inc({reason: ShufflingPromiseCancelReason.pruned});
|
|
295
|
+
} else {
|
|
296
|
+
prunedShufflings++;
|
|
297
|
+
}
|
|
298
|
+
}
|
|
299
|
+
this.itemsByDecisionRootByEpoch.delete(epoch);
|
|
300
|
+
}
|
|
301
|
+
this.metrics?.shufflingCache.prunedShufflings.inc(prunedShufflings);
|
|
302
|
+
|
|
303
|
+
this.logger?.verbose("Pruned shuffling cache", {
|
|
304
|
+
prunedEpochs: prunedEpochs.join(","),
|
|
305
|
+
prunedShufflings,
|
|
306
|
+
cachedEpochs: Array.from(this.itemsByDecisionRootByEpoch.keys())
|
|
307
|
+
.sort((a, b) => a - b)
|
|
308
|
+
.join(","),
|
|
309
|
+
});
|
|
253
310
|
}
|
|
254
311
|
}
|
|
255
312
|
|
|
@@ -20,6 +20,7 @@ import {InsertOutcome} from "../../chain/opPools/types.js";
|
|
|
20
20
|
import {RegenCaller, RegenFnName} from "../../chain/regen/interface.js";
|
|
21
21
|
import {ReprocessStatus} from "../../chain/reprocess.js";
|
|
22
22
|
import {RejectReason} from "../../chain/seenCache/seenAttestationData.js";
|
|
23
|
+
import type {ShufflingPromiseCancelReason} from "../../chain/shufflingCache.js";
|
|
23
24
|
import {CacheItemType} from "../../chain/stateCache/types.js";
|
|
24
25
|
import {OpSource} from "../../chain/validatorMonitor.js";
|
|
25
26
|
import type {FlatFileStoreOperation} from "../../db/flatFileStore/metrics.js";
|
|
@@ -1618,6 +1619,19 @@ export function createLodestarMetrics(
|
|
|
1618
1619
|
name: "lodestar_shuffling_cache_size",
|
|
1619
1620
|
help: "Shuffling cache size",
|
|
1620
1621
|
}),
|
|
1622
|
+
epochs: register.gauge({
|
|
1623
|
+
name: "lodestar_shuffling_cache_epochs",
|
|
1624
|
+
help: "Number of epochs in shuffling cache",
|
|
1625
|
+
}),
|
|
1626
|
+
prunedShufflings: register.counter({
|
|
1627
|
+
name: "lodestar_shuffling_cache_pruned_shufflings_total",
|
|
1628
|
+
help: "Total number of shufflings pruned from shuffling cache",
|
|
1629
|
+
}),
|
|
1630
|
+
cancelledPromises: register.counter<{reason: ShufflingPromiseCancelReason}>({
|
|
1631
|
+
name: "lodestar_shuffling_cache_cancelled_promises_total",
|
|
1632
|
+
help: "Total number of shuffling promises resolved with null",
|
|
1633
|
+
labelNames: ["reason"],
|
|
1634
|
+
}),
|
|
1621
1635
|
insertPromiseCount: register.gauge({
|
|
1622
1636
|
name: "lodestar_shuffling_cache_insert_promise_count",
|
|
1623
1637
|
help: "Total number of times insertPromise is called",
|
package/src/sync/range/batch.ts
CHANGED
|
@@ -14,7 +14,7 @@ import {IClock} from "../../util/clock.js";
|
|
|
14
14
|
import {CustodyConfig} from "../../util/dataColumns.js";
|
|
15
15
|
import {PeerIdStr} from "../../util/peerId.js";
|
|
16
16
|
import {MAX_BATCH_DOWNLOAD_ATTEMPTS, MAX_BATCH_PROCESSING_ATTEMPTS} from "../constants.js";
|
|
17
|
-
import {DownloadByRangeRequests,
|
|
17
|
+
import {DownloadByRangeRequests, ParentPayload} from "../utils/downloadByRange.js";
|
|
18
18
|
import {getBatchSlotRange, hashBlocks} from "./utils/index.js";
|
|
19
19
|
|
|
20
20
|
/**
|
|
@@ -175,7 +175,7 @@ export class Batch {
|
|
|
175
175
|
private readonly clock: IClock;
|
|
176
176
|
private readonly custodyConfig: CustodyConfig;
|
|
177
177
|
private readonly isFirstBatchInChain: boolean;
|
|
178
|
-
private readonly
|
|
178
|
+
private readonly parentPayload: ParentPayload | undefined;
|
|
179
179
|
|
|
180
180
|
constructor(
|
|
181
181
|
startEpoch: Epoch,
|
|
@@ -183,7 +183,7 @@ export class Batch {
|
|
|
183
183
|
clock: IClock,
|
|
184
184
|
custodyConfig: CustodyConfig,
|
|
185
185
|
isFirstBatchInChain: boolean,
|
|
186
|
-
|
|
186
|
+
parentPayload: ParentPayload | undefined,
|
|
187
187
|
targetSlot: Slot
|
|
188
188
|
) {
|
|
189
189
|
this.config = config;
|
|
@@ -196,7 +196,7 @@ export class Batch {
|
|
|
196
196
|
this.startSlot = startSlot;
|
|
197
197
|
this.count = Math.min(count, targetSlot - startSlot + 1);
|
|
198
198
|
this.isFirstBatchInChain = isFirstBatchInChain;
|
|
199
|
-
this.
|
|
199
|
+
this.parentPayload = parentPayload;
|
|
200
200
|
this.requests = this.getRequests([]);
|
|
201
201
|
}
|
|
202
202
|
|
|
@@ -208,24 +208,19 @@ export class Batch {
|
|
|
208
208
|
}
|
|
209
209
|
|
|
210
210
|
// we only know if we should download parent envelope if firstBlock is downloaded
|
|
211
|
-
if (firstBlock === undefined) return false;
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
.
|
|
215
|
-
|
|
211
|
+
if (firstBlock === undefined || this.parentPayload === undefined) return false;
|
|
212
|
+
const firstBlockBid = (firstBlock.message.body as gloas.BeaconBlockBody).signedExecutionPayloadBid.message;
|
|
213
|
+
return (
|
|
214
|
+
byteArrayEquals(firstBlock.message.parentRoot, this.parentPayload.blockRoot) &&
|
|
215
|
+
byteArrayEquals(firstBlockBid.parentBlockHash, this.parentPayload.bid.blockHash)
|
|
216
|
+
);
|
|
216
217
|
}
|
|
217
218
|
|
|
218
|
-
|
|
219
|
-
if (this.
|
|
220
|
-
throw new Error(
|
|
221
|
-
`Coding error: getParentPayloadCommitments called without latestBid for parentBlockRoot=${toRootHex(parentBlockRoot)}`
|
|
222
|
-
);
|
|
219
|
+
getParentPayload(): ParentPayload {
|
|
220
|
+
if (this.parentPayload === undefined) {
|
|
221
|
+
throw new Error("Coding error: getParentPayload called without parentPayload");
|
|
223
222
|
}
|
|
224
|
-
return
|
|
225
|
-
blockRoot: parentBlockRoot,
|
|
226
|
-
blockRootHex: toRootHex(parentBlockRoot),
|
|
227
|
-
kzgCommitments: this.latestBid.blobKzgCommitments,
|
|
228
|
-
};
|
|
223
|
+
return this.parentPayload;
|
|
229
224
|
}
|
|
230
225
|
|
|
231
226
|
/**
|
package/src/sync/range/chain.ts
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import {ChainForkConfig} from "@lodestar/config";
|
|
2
|
-
import {Epoch, Root, Slot
|
|
2
|
+
import {Epoch, Root, Slot} from "@lodestar/types";
|
|
3
3
|
import {ErrorAborted, LodestarError, Logger, prettyPrintIndices, toRootHex} from "@lodestar/utils";
|
|
4
4
|
import {isBlockInputBlobs, isBlockInputColumns} from "../../chain/blocks/blockInput/blockInput.js";
|
|
5
5
|
import {BlockInputErrorCode} from "../../chain/blocks/blockInput/errors.js";
|
|
@@ -16,7 +16,7 @@ import {ItTrigger} from "../../util/itTrigger.js";
|
|
|
16
16
|
import {PeerIdStr} from "../../util/peerId.js";
|
|
17
17
|
import {WarnResult, wrapError} from "../../util/wrapError.js";
|
|
18
18
|
import {BATCH_BUFFER_SIZE, EPOCHS_PER_BATCH, MAX_LOOK_AHEAD_EPOCHS} from "../constants.js";
|
|
19
|
-
import {DownloadByRangeError, DownloadByRangeErrorCode} from "../utils/downloadByRange.js";
|
|
19
|
+
import {DownloadByRangeError, DownloadByRangeErrorCode, ParentPayload} from "../utils/downloadByRange.js";
|
|
20
20
|
import {getRateLimitedUntilMs} from "../utils/rateLimit.js";
|
|
21
21
|
import {RangeSyncType} from "../utils/remoteSyncType.js";
|
|
22
22
|
import {Batch, BatchError, BatchErrorCode, BatchMetadata, BatchStatus} from "./batch.js";
|
|
@@ -160,7 +160,7 @@ export class SyncChain {
|
|
|
160
160
|
private readonly clock: IClock;
|
|
161
161
|
private readonly metrics: Metrics | null;
|
|
162
162
|
private readonly custodyConfig: CustodyConfig;
|
|
163
|
-
private readonly
|
|
163
|
+
private readonly parentPayload: ParentPayload | undefined;
|
|
164
164
|
|
|
165
165
|
constructor(
|
|
166
166
|
initialBatchEpoch: Epoch,
|
|
@@ -168,7 +168,7 @@ export class SyncChain {
|
|
|
168
168
|
syncType: RangeSyncType,
|
|
169
169
|
fns: SyncChainFns,
|
|
170
170
|
modules: SyncChainModules,
|
|
171
|
-
|
|
171
|
+
parentPayload: ParentPayload | undefined
|
|
172
172
|
) {
|
|
173
173
|
const {config, clock, custodyConfig, logger, metrics} = modules;
|
|
174
174
|
this.firstBatchEpoch = initialBatchEpoch;
|
|
@@ -184,7 +184,7 @@ export class SyncChain {
|
|
|
184
184
|
this.clock = clock;
|
|
185
185
|
this.metrics = metrics;
|
|
186
186
|
this.custodyConfig = custodyConfig;
|
|
187
|
-
this.
|
|
187
|
+
this.parentPayload = parentPayload;
|
|
188
188
|
this.logger = logger;
|
|
189
189
|
this.logId = `${syncType}-${nextChainId++}`;
|
|
190
190
|
|
|
@@ -536,8 +536,8 @@ export class SyncChain {
|
|
|
536
536
|
this.clock,
|
|
537
537
|
this.custodyConfig,
|
|
538
538
|
this.isFirstBatch,
|
|
539
|
-
// `
|
|
540
|
-
this.isFirstBatch ? this.
|
|
539
|
+
// `parentPayload` is only meaningful for the first batch
|
|
540
|
+
this.isFirstBatch ? this.parentPayload : undefined,
|
|
541
541
|
this.target.slot
|
|
542
542
|
);
|
|
543
543
|
this.isFirstBatch = false;
|
|
@@ -586,6 +586,8 @@ export class SyncChain {
|
|
|
586
586
|
case DownloadByRangeErrorCode.OUT_OF_RANGE_BLOCKS:
|
|
587
587
|
case DownloadByRangeErrorCode.PARENT_ROOT_MISMATCH:
|
|
588
588
|
case DownloadByRangeErrorCode.INVALID_ENVELOPE_BEACON_BLOCK_ROOT:
|
|
589
|
+
case DownloadByRangeErrorCode.INVALID_ENVELOPE_BLOCK_HASH:
|
|
590
|
+
case DownloadByRangeErrorCode.INVALID_ENVELOPE_SLOT:
|
|
589
591
|
case DownloadByRangeErrorCode.INVALID_CHAIN_SEGMENT:
|
|
590
592
|
case BlobSidecarErrorCode.INCLUSION_PROOF_INVALID:
|
|
591
593
|
case BlobSidecarErrorCode.INVALID_KZG_PROOF_BATCH:
|
package/src/sync/range/range.ts
CHANGED
|
@@ -2,8 +2,8 @@ import {EventEmitter} from "node:events";
|
|
|
2
2
|
import {StrictEventEmitter} from "strict-event-emitter-types";
|
|
3
3
|
import {BeaconConfig} from "@lodestar/config";
|
|
4
4
|
import {IBeaconStateViewGloas, computeStartSlotAtEpoch, isStatePostGloas} from "@lodestar/state-transition";
|
|
5
|
-
import {Epoch, Status, fulu} from "@lodestar/types";
|
|
6
|
-
import {Logger, prettyPrintIndices, toRootHex} from "@lodestar/utils";
|
|
5
|
+
import {Epoch, Status, fulu, ssz} from "@lodestar/types";
|
|
6
|
+
import {Logger, byteArrayEquals, prettyPrintIndices, toRootHex} from "@lodestar/utils";
|
|
7
7
|
import {IBlockInput} from "../../chain/blocks/blockInput/types.js";
|
|
8
8
|
import {PayloadError, PayloadErrorCode} from "../../chain/blocks/importExecutionPayload.js";
|
|
9
9
|
import {AttestationImportOpt, ImportBlockOpts} from "../../chain/blocks/index.js";
|
|
@@ -16,6 +16,7 @@ import {PeerIdStr} from "../../util/peerId.js";
|
|
|
16
16
|
import {
|
|
17
17
|
DownloadByRangeError,
|
|
18
18
|
DownloadByRangeErrorCode,
|
|
19
|
+
ParentPayload,
|
|
19
20
|
cacheByRangeResponses,
|
|
20
21
|
downloadByRange,
|
|
21
22
|
} from "../utils/downloadByRange.js";
|
|
@@ -278,15 +279,14 @@ export class RangeSync extends (EventEmitter as {new (): RangeSyncEmitter}) {
|
|
|
278
279
|
private downloadByRange: SyncChainFns["downloadByRange"] = async (peer, batch) => {
|
|
279
280
|
const batchBlocks = batch.getBlocks();
|
|
280
281
|
const requests = batch.getRequestsForPeer(peer);
|
|
281
|
-
const
|
|
282
|
-
const parentPayloadCommitments = parentRoot ? batch.getParentPayloadCommitments(parentRoot) : undefined;
|
|
282
|
+
const parentPayload = requests.parentPayloadRequest ? batch.getParentPayload() : undefined;
|
|
283
283
|
const {result, warnings} = await downloadByRange({
|
|
284
284
|
config: this.config,
|
|
285
285
|
network: this.network,
|
|
286
286
|
logger: this.logger,
|
|
287
287
|
peerIdStr: peer.peerId,
|
|
288
288
|
batchBlocks,
|
|
289
|
-
|
|
289
|
+
parentPayload,
|
|
290
290
|
peerDasMetrics: this.chain.metrics?.peerDas,
|
|
291
291
|
...requests,
|
|
292
292
|
});
|
|
@@ -299,6 +299,7 @@ export class RangeSync extends (EventEmitter as {new (): RangeSyncEmitter}) {
|
|
|
299
299
|
batchBlocks,
|
|
300
300
|
downloadedPayloadEnvelopes,
|
|
301
301
|
existingPayloadEnvelopes: batch.getPayloadEnvelopes(),
|
|
302
|
+
parentPayload,
|
|
302
303
|
custodyConfig: this.chain.custodyConfig,
|
|
303
304
|
seenTimestampSec: Date.now() / 1000,
|
|
304
305
|
});
|
|
@@ -376,13 +377,26 @@ export class RangeSync extends (EventEmitter as {new (): RangeSyncEmitter}) {
|
|
|
376
377
|
private addPeerOrCreateChain(startEpoch: Epoch, target: ChainTarget, peer: PeerIdStr, syncType: RangeSyncType): void {
|
|
377
378
|
let syncChain = this.chains.get(syncType);
|
|
378
379
|
if (!syncChain) {
|
|
379
|
-
// The first
|
|
380
|
-
//
|
|
381
|
-
// downloaded block's `bid.parentBlockHash` against the head state's `latestExecutionPayloadBid.blockHash`.
|
|
380
|
+
// The first block of the first batch may build on the head's FULL variant before its payload is imported,
|
|
381
|
+
// the batch then downloads the head's payload as dangling parent and validates it against the bid
|
|
382
382
|
const headState = this.chain.getHeadState();
|
|
383
|
-
|
|
384
|
-
|
|
385
|
-
|
|
383
|
+
let parentPayload: ParentPayload | undefined;
|
|
384
|
+
if (isStatePostGloas(headState) && headState.latestBlockHeader.slot > 0) {
|
|
385
|
+
const header = ssz.phase0.BeaconBlockHeader.clone(headState.latestBlockHeader);
|
|
386
|
+
if (byteArrayEquals(header.stateRoot, ssz.Root.defaultValue())) {
|
|
387
|
+
header.stateRoot = headState.hashTreeRoot();
|
|
388
|
+
}
|
|
389
|
+
const headRoot = ssz.phase0.BeaconBlockHeader.hashTreeRoot(header);
|
|
390
|
+
const headSlot = headState.latestBlockHeader.slot;
|
|
391
|
+
parentPayload = {
|
|
392
|
+
blockRoot: headRoot,
|
|
393
|
+
blockRootHex: toRootHex(headRoot),
|
|
394
|
+
slot: headSlot,
|
|
395
|
+
proposerIndex: headState.latestBlockHeader.proposerIndex,
|
|
396
|
+
forkName: this.config.getForkName(headSlot),
|
|
397
|
+
bid: (headState as IBeaconStateViewGloas).latestExecutionPayloadBid,
|
|
398
|
+
};
|
|
399
|
+
}
|
|
386
400
|
|
|
387
401
|
syncChain = new SyncChain(
|
|
388
402
|
startEpoch,
|
|
@@ -403,7 +417,7 @@ export class RangeSync extends (EventEmitter as {new (): RangeSyncEmitter}) {
|
|
|
403
417
|
custodyConfig: this.chain.custodyConfig,
|
|
404
418
|
metrics: this.metrics,
|
|
405
419
|
},
|
|
406
|
-
|
|
420
|
+
parentPayload
|
|
407
421
|
);
|
|
408
422
|
this.chains.set(syncType, syncChain);
|
|
409
423
|
|
package/src/sync/unknownBlock.ts
CHANGED
|
@@ -73,7 +73,11 @@ type AdvancePendingBlockResult =
|
|
|
73
73
|
| "removed";
|
|
74
74
|
|
|
75
75
|
class UnknownBlockRateLimitedError extends Error {
|
|
76
|
-
constructor(
|
|
76
|
+
constructor(
|
|
77
|
+
message: string,
|
|
78
|
+
/** Earliest backoff expiry seen when the download was deferred, it is retried once that has passed */
|
|
79
|
+
readonly retryAt: number
|
|
80
|
+
) {
|
|
77
81
|
super(message);
|
|
78
82
|
this.name = "UnknownBlockRateLimitedError";
|
|
79
83
|
}
|
|
@@ -849,17 +853,20 @@ export class BlockInputSync {
|
|
|
849
853
|
}
|
|
850
854
|
};
|
|
851
855
|
|
|
852
|
-
|
|
856
|
+
/**
|
|
857
|
+
* Returns false if there is no backoff left to wait for, in which case no retry is scheduled.
|
|
858
|
+
*/
|
|
859
|
+
private scheduleRateLimitBackoffRetry(): boolean {
|
|
853
860
|
this.clearRateLimitBackoffTimer();
|
|
854
861
|
|
|
855
862
|
if (!this.subscribedToNetworkEvents || (this.pendingBlocks.size === 0 && this.pendingPayloads.size === 0)) {
|
|
856
|
-
return;
|
|
863
|
+
return false;
|
|
857
864
|
}
|
|
858
865
|
|
|
859
866
|
const now = Date.now();
|
|
860
867
|
const retryAt = this.peerBalancer.getNextRateLimitRetryAt();
|
|
861
868
|
if (retryAt === null) {
|
|
862
|
-
return;
|
|
869
|
+
return false;
|
|
863
870
|
}
|
|
864
871
|
|
|
865
872
|
this.rateLimitBackoffTimeout = setTimeout(
|
|
@@ -870,6 +877,7 @@ export class BlockInputSync {
|
|
|
870
877
|
},
|
|
871
878
|
Math.max(0, retryAt - now)
|
|
872
879
|
);
|
|
880
|
+
return true;
|
|
873
881
|
}
|
|
874
882
|
|
|
875
883
|
private clearRateLimitBackoffTimer(): void {
|
|
@@ -1081,7 +1089,11 @@ export class BlockInputSync {
|
|
|
1081
1089
|
pendingBlock.status = PendingBlockInputStatus.pending;
|
|
1082
1090
|
}
|
|
1083
1091
|
this.logger.debug("Deferring unknown block download due to peer rate limit", logCtx, res.err);
|
|
1084
|
-
this.scheduleRateLimitBackoffRetry()
|
|
1092
|
+
if (!this.scheduleRateLimitBackoffRetry() || res.err.retryAt <= Date.now()) {
|
|
1093
|
+
// The backoff this download waited for expired in the meantime, a timer is only armed if another
|
|
1094
|
+
// peer is still in backoff and would retry it later than needed
|
|
1095
|
+
this.triggerUnknownBlockSearch();
|
|
1096
|
+
}
|
|
1085
1097
|
return;
|
|
1086
1098
|
}
|
|
1087
1099
|
|
|
@@ -1364,6 +1376,14 @@ export class BlockInputSync {
|
|
|
1364
1376
|
if (!isPendingPayloadEnvelope(payload)) {
|
|
1365
1377
|
payload.status = PendingPayloadInputStatus.pending;
|
|
1366
1378
|
}
|
|
1379
|
+
if (
|
|
1380
|
+
res.err instanceof UnknownBlockRateLimitedError &&
|
|
1381
|
+
(!this.scheduleRateLimitBackoffRetry() || res.err.retryAt <= Date.now())
|
|
1382
|
+
) {
|
|
1383
|
+
// The backoff this download waited for expired in the meantime, a timer is only armed if another
|
|
1384
|
+
// peer is still in backoff and would retry it later than needed
|
|
1385
|
+
this.triggerUnknownBlockSearch();
|
|
1386
|
+
}
|
|
1367
1387
|
}
|
|
1368
1388
|
|
|
1369
1389
|
private async processPayload(pendingPayload: PendingPayloadInput): Promise<void> {
|
|
@@ -1488,16 +1508,21 @@ export class BlockInputSync {
|
|
|
1488
1508
|
const pendingColumns = payloadInput?.hasAllData()
|
|
1489
1509
|
? new Set<number>()
|
|
1490
1510
|
: new Set(payloadInput?.getMissingSampledColumnMeta().missing ?? []);
|
|
1511
|
+
// Same `now` for both calls, a backoff expiring in between would be reported as no peer available
|
|
1512
|
+
const now = Date.now();
|
|
1491
1513
|
// prefer peers that gossiped this payload root to us (#9923)
|
|
1492
1514
|
const peerMeta = this.peerBalancer.bestPeerForPendingColumns(
|
|
1493
1515
|
pendingColumns,
|
|
1494
1516
|
excludedPeers,
|
|
1495
|
-
cacheItem.peerIdStrings
|
|
1517
|
+
cacheItem.peerIdStrings,
|
|
1518
|
+
now
|
|
1496
1519
|
);
|
|
1497
1520
|
if (peerMeta === null) {
|
|
1498
|
-
|
|
1521
|
+
const retryAt = this.peerBalancer.getNextRateLimitRetryAt(pendingColumns, excludedPeers, now);
|
|
1522
|
+
if (retryAt !== null) {
|
|
1499
1523
|
throw new UnknownBlockRateLimitedError(
|
|
1500
|
-
`Error fetching payload by root slot=${slot} root=${rootHex} after ${i}: peers with needed columns are rate-limited
|
|
1524
|
+
`Error fetching payload by root slot=${slot} root=${rootHex} after ${i}: peers with needed columns are rate-limited`,
|
|
1525
|
+
retryAt
|
|
1501
1526
|
);
|
|
1502
1527
|
}
|
|
1503
1528
|
|
|
@@ -1636,9 +1661,11 @@ export class BlockInputSync {
|
|
|
1636
1661
|
);
|
|
1637
1662
|
this.metrics?.blockInputSync.payloadFetchPeers.set({result: FetchResult.FailureMaxAttempts}, i - 1);
|
|
1638
1663
|
|
|
1639
|
-
|
|
1664
|
+
const retryAt = deferredByRateLimit ? this.peerBalancer.getNextRateLimitRetryAt() : null;
|
|
1665
|
+
if (retryAt !== null) {
|
|
1640
1666
|
throw new UnknownBlockRateLimitedError(
|
|
1641
|
-
`Error fetching payload with slot=${slot} root=${rootHex} after ${i - 1} attempts: peers are rate-limited
|
|
1667
|
+
`Error fetching payload with slot=${slot} root=${rootHex} after ${i - 1} attempts: peers are rate-limited`,
|
|
1668
|
+
retryAt
|
|
1642
1669
|
);
|
|
1643
1670
|
}
|
|
1644
1671
|
throw Error(`Error fetching payload with slot=${slot} root=${rootHex} after ${i - 1} attempts.`);
|
|
@@ -1730,16 +1757,21 @@ export class BlockInputSync {
|
|
|
1730
1757
|
isPendingBlockInput(cacheItem) && isBlockInputColumns(cacheItem.blockInput)
|
|
1731
1758
|
? new Set(cacheItem.blockInput.getMissingSampledColumnMeta().missing)
|
|
1732
1759
|
: defaultPendingColumns;
|
|
1760
|
+
// Same `now` for both calls, a backoff expiring in between would be reported as no peer available
|
|
1761
|
+
const now = Date.now();
|
|
1733
1762
|
// prefer peers that gossiped this block root to us (#9923)
|
|
1734
1763
|
const peerMeta = this.peerBalancer.bestPeerForPendingColumns(
|
|
1735
1764
|
pendingColumns,
|
|
1736
1765
|
excludedPeers,
|
|
1737
|
-
cacheItem.peerIdStrings
|
|
1766
|
+
cacheItem.peerIdStrings,
|
|
1767
|
+
now
|
|
1738
1768
|
);
|
|
1739
1769
|
if (peerMeta === null) {
|
|
1740
|
-
|
|
1770
|
+
const retryAt = this.peerBalancer.getNextRateLimitRetryAt(pendingColumns, excludedPeers, now);
|
|
1771
|
+
if (retryAt !== null) {
|
|
1741
1772
|
throw new UnknownBlockRateLimitedError(
|
|
1742
|
-
`Error fetching UnknownBlockRoot slot=${slot} root=${rootHex} after ${i}: peers with needed columns are rate-limited
|
|
1773
|
+
`Error fetching UnknownBlockRoot slot=${slot} root=${rootHex} after ${i}: peers with needed columns are rate-limited`,
|
|
1774
|
+
retryAt
|
|
1743
1775
|
);
|
|
1744
1776
|
}
|
|
1745
1777
|
|
|
@@ -1845,8 +1877,9 @@ export class BlockInputSync {
|
|
|
1845
1877
|
|
|
1846
1878
|
const message = `Error fetching BlockInput with slot=${slot} root=${rootHex} after ${i - 1} attempts.`;
|
|
1847
1879
|
|
|
1848
|
-
|
|
1849
|
-
|
|
1880
|
+
const retryAt = deferredByRateLimit ? this.peerBalancer.getNextRateLimitRetryAt() : null;
|
|
1881
|
+
if (retryAt !== null) {
|
|
1882
|
+
throw new UnknownBlockRateLimitedError(`${message} Peers are rate-limited.`, retryAt);
|
|
1850
1883
|
}
|
|
1851
1884
|
|
|
1852
1885
|
if (!isPendingBlockInput(cacheItem)) {
|
|
@@ -2037,8 +2070,11 @@ export class UnknownBlockPeerBalancer {
|
|
|
2037
2070
|
this.rateLimitedUntilByPeer.set(peerId, rateLimitedUntilMs);
|
|
2038
2071
|
}
|
|
2039
2072
|
|
|
2040
|
-
getNextRateLimitRetryAt(
|
|
2041
|
-
|
|
2073
|
+
getNextRateLimitRetryAt(
|
|
2074
|
+
pendingColumns?: Set<number>,
|
|
2075
|
+
excludedPeers?: Set<PeerIdStr>,
|
|
2076
|
+
now = Date.now()
|
|
2077
|
+
): number | null {
|
|
2042
2078
|
let retryAt: number | null = null;
|
|
2043
2079
|
|
|
2044
2080
|
for (const [peerId, rateLimitedUntil] of this.rateLimitedUntilByPeer.entries()) {
|
|
@@ -2077,9 +2113,10 @@ export class UnknownBlockPeerBalancer {
|
|
|
2077
2113
|
bestPeerForPendingColumns(
|
|
2078
2114
|
pendingColumns: Set<number>,
|
|
2079
2115
|
excludedPeers: Set<PeerIdStr>,
|
|
2080
|
-
preferredPeers?: Set<PeerIdStr
|
|
2116
|
+
preferredPeers?: Set<PeerIdStr>,
|
|
2117
|
+
now = Date.now()
|
|
2081
2118
|
): PeerSyncMeta | null {
|
|
2082
|
-
const eligiblePeers = this.filterPeers(pendingColumns, excludedPeers);
|
|
2119
|
+
const eligiblePeers = this.filterPeers(pendingColumns, excludedPeers, now);
|
|
2083
2120
|
if (eligiblePeers.length === 0) {
|
|
2084
2121
|
return null;
|
|
2085
2122
|
}
|
|
@@ -2120,8 +2157,7 @@ export class UnknownBlockPeerBalancer {
|
|
|
2120
2157
|
return totalActiveRequests;
|
|
2121
2158
|
}
|
|
2122
2159
|
|
|
2123
|
-
private filterPeers(pendingDataColumns: Set<number>, excludedPeers: Set<PeerIdStr
|
|
2124
|
-
const now = Date.now();
|
|
2160
|
+
private filterPeers(pendingDataColumns: Set<number>, excludedPeers: Set<PeerIdStr>, now: number): PeerIdStr[] {
|
|
2125
2161
|
let maxColumnCount = 0;
|
|
2126
2162
|
const considerPeers: {peerId: PeerIdStr; columnCount: number}[] = [];
|
|
2127
2163
|
for (const [peerId, syncMeta] of this.peersMeta.entries()) {
|