@lodestar/beacon-node 1.49.0-dev.ee7c2aa8ee → 1.49.0-dev.fa4ae94ccc
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/api/impl/beacon/pool/index.d.ts.map +1 -1
- package/lib/api/impl/beacon/pool/index.js +4 -2
- package/lib/api/impl/beacon/pool/index.js.map +1 -1
- package/lib/chain/archiveStore/archiveStore.d.ts +1 -2
- package/lib/chain/archiveStore/archiveStore.d.ts.map +1 -1
- package/lib/chain/archiveStore/archiveStore.js +0 -5
- package/lib/chain/archiveStore/archiveStore.js.map +1 -1
- package/lib/chain/archiveStore/historicalState/metrics.d.ts.map +1 -1
- package/lib/chain/archiveStore/historicalState/metrics.js +0 -6
- package/lib/chain/archiveStore/historicalState/metrics.js.map +1 -1
- package/lib/chain/produceBlock/computeNewStateRoot.d.ts.map +1 -1
- package/lib/chain/produceBlock/computeNewStateRoot.js +4 -2
- package/lib/chain/produceBlock/computeNewStateRoot.js.map +1 -1
- package/lib/db/beacon.d.ts +1 -2
- package/lib/db/beacon.d.ts.map +1 -1
- package/lib/db/beacon.js +1 -3
- package/lib/db/beacon.js.map +1 -1
- package/lib/db/buckets.d.ts +0 -1
- package/lib/db/buckets.d.ts.map +1 -1
- package/lib/db/buckets.js +1 -1
- package/lib/db/buckets.js.map +1 -1
- package/lib/db/interface.d.ts +1 -2
- package/lib/db/interface.d.ts.map +1 -1
- package/lib/db/repositories/blockArchiveIndex.d.ts +2 -2
- package/lib/db/repositories/blockArchiveIndex.d.ts.map +1 -1
- package/lib/db/repositories/index.d.ts +0 -1
- package/lib/db/repositories/index.d.ts.map +1 -1
- package/lib/db/repositories/index.js +0 -1
- package/lib/db/repositories/index.js.map +1 -1
- package/lib/metrics/metrics/lodestar.d.ts +9 -11
- package/lib/metrics/metrics/lodestar.d.ts.map +1 -1
- package/lib/metrics/metrics/lodestar.js +18 -23
- package/lib/metrics/metrics/lodestar.js.map +1 -1
- package/lib/node/nodejs.d.ts +2 -7
- package/lib/node/nodejs.d.ts.map +1 -1
- package/lib/node/nodejs.js +2 -22
- package/lib/node/nodejs.js.map +1 -1
- package/lib/sync/interface.d.ts +1 -2
- package/lib/sync/interface.d.ts.map +1 -1
- package/lib/sync/options.d.ts +0 -6
- package/lib/sync/options.d.ts.map +1 -1
- package/lib/sync/options.js +0 -2
- package/lib/sync/options.js.map +1 -1
- package/lib/sync/types.d.ts +18 -1
- package/lib/sync/types.d.ts.map +1 -1
- package/lib/sync/types.js +19 -1
- package/lib/sync/types.js.map +1 -1
- package/lib/sync/unknownBlock.d.ts +19 -0
- package/lib/sync/unknownBlock.d.ts.map +1 -1
- package/lib/sync/unknownBlock.js +143 -2
- package/lib/sync/unknownBlock.js.map +1 -1
- package/lib/util/shuffle.d.ts +0 -4
- package/lib/util/shuffle.d.ts.map +1 -1
- package/lib/util/shuffle.js +0 -8
- package/lib/util/shuffle.js.map +1 -1
- package/package.json +14 -14
- package/src/api/impl/beacon/pool/index.ts +6 -2
- package/src/chain/archiveStore/archiveStore.ts +0 -6
- package/src/chain/archiveStore/historicalState/metrics.ts +0 -7
- package/src/chain/produceBlock/computeNewStateRoot.ts +9 -2
- package/src/db/beacon.ts +0 -5
- package/src/db/buckets.ts +1 -1
- package/src/db/interface.ts +0 -3
- package/src/db/repositories/index.ts +0 -1
- package/src/metrics/metrics/lodestar.ts +27 -26
- package/src/node/nodejs.ts +0 -27
- package/src/sync/interface.ts +1 -2
- package/src/sync/options.ts +0 -8
- package/src/sync/types.ts +19 -1
- package/src/sync/unknownBlock.ts +151 -1
- package/src/util/shuffle.ts +0 -9
- package/lib/chain/archiveStore/utils/updateBackfillRange.d.ts +0 -20
- package/lib/chain/archiveStore/utils/updateBackfillRange.d.ts.map +0 -1
- package/lib/chain/archiveStore/utils/updateBackfillRange.js +0 -40
- package/lib/chain/archiveStore/utils/updateBackfillRange.js.map +0 -1
- package/lib/db/repositories/backfilledRanges.d.ts +0 -18
- package/lib/db/repositories/backfilledRanges.d.ts.map +0 -1
- package/lib/db/repositories/backfilledRanges.js +0 -26
- package/lib/db/repositories/backfilledRanges.js.map +0 -1
- package/lib/sync/backfill/backfill.d.ts +0 -169
- package/lib/sync/backfill/backfill.d.ts.map +0 -1
- package/lib/sync/backfill/backfill.js +0 -686
- package/lib/sync/backfill/backfill.js.map +0 -1
- package/lib/sync/backfill/errors.d.ts +0 -30
- package/lib/sync/backfill/errors.d.ts.map +0 -1
- package/lib/sync/backfill/errors.js +0 -15
- package/lib/sync/backfill/errors.js.map +0 -1
- package/lib/sync/backfill/index.d.ts +0 -2
- package/lib/sync/backfill/index.d.ts.map +0 -1
- package/lib/sync/backfill/index.js +0 -2
- package/lib/sync/backfill/index.js.map +0 -1
- package/lib/sync/backfill/verify.d.ts +0 -18
- package/lib/sync/backfill/verify.d.ts.map +0 -1
- package/lib/sync/backfill/verify.js +0 -36
- package/lib/sync/backfill/verify.js.map +0 -1
- package/src/chain/archiveStore/utils/updateBackfillRange.ts +0 -50
- package/src/db/repositories/backfilledRanges.ts +0 -29
- package/src/sync/backfill/backfill.ts +0 -916
- package/src/sync/backfill/errors.ts +0 -23
- package/src/sync/backfill/index.ts +0 -1
- package/src/sync/backfill/verify.ts +0 -58
|
@@ -1,5 +1,6 @@
|
|
|
1
1
|
/** biome-ignore-all lint/suspicious/noTemplateCurlyInString: The metric templates requires to have `${}` in a normal string */
|
|
2
2
|
import {NotReorgedReason} from "@lodestar/fork-choice";
|
|
3
|
+
import {StateHashTreeRootSource} from "@lodestar/state-transition";
|
|
3
4
|
import {ArchiveStoreTask} from "../../chain/archiveStore/archiveStore.js";
|
|
4
5
|
import {FrequencyStateArchiveStep} from "../../chain/archiveStore/strategies/frequencyStateArchiveStrategy.js";
|
|
5
6
|
import type {LateCanonicalBlockReason} from "../../chain/archiveStore/utils/archiveBlocks.js";
|
|
@@ -25,8 +26,13 @@ import type {FlatFileStoreOperation} from "../../db/flatFileStore/metrics.js";
|
|
|
25
26
|
import {ExecutionPayloadStatus} from "../../execution/index.js";
|
|
26
27
|
import {GossipType} from "../../network/index.js";
|
|
27
28
|
import {CannotAcceptWorkReason, ReprocessRejectReason} from "../../network/processor/index.js";
|
|
28
|
-
import {
|
|
29
|
-
|
|
29
|
+
import {
|
|
30
|
+
DeferredPayloadResult,
|
|
31
|
+
DownloadResult,
|
|
32
|
+
DroppedItemReason,
|
|
33
|
+
FetchResult,
|
|
34
|
+
PendingBlockType,
|
|
35
|
+
} from "../../sync/types.js";
|
|
30
36
|
import {PeerSyncType, RangeSyncType} from "../../sync/utils/remoteSyncType.js";
|
|
31
37
|
import {AllocSource} from "../../util/bufferPool.js";
|
|
32
38
|
import {DataColumnReconstructionCode} from "../../util/dataColumns.js";
|
|
@@ -403,6 +409,15 @@ export function createLodestarMetrics(
|
|
|
403
409
|
labelNames: ["caller"],
|
|
404
410
|
}),
|
|
405
411
|
|
|
412
|
+
// this metrics stay here instead of @lodestar/state-transition in order to prepare
|
|
413
|
+
// for the native zig state-transition in the future
|
|
414
|
+
stateHashTreeRootTime: register.histogram<{source: StateHashTreeRootSource}>({
|
|
415
|
+
name: "lodestar_stfn_hash_tree_root_seconds",
|
|
416
|
+
help: "Time to compute the hash tree root of a post state in seconds",
|
|
417
|
+
buckets: [0.01, 0.05, 0.1, 0.2, 0.3, 0.5],
|
|
418
|
+
labelNames: ["source"],
|
|
419
|
+
}),
|
|
420
|
+
|
|
406
421
|
// BLS verifier thread pool and queue
|
|
407
422
|
|
|
408
423
|
bls: {
|
|
@@ -655,6 +670,16 @@ export function createLodestarMetrics(
|
|
|
655
670
|
help: "Count of payload (execution payload envelope) sync triggers, labeled by their source",
|
|
656
671
|
labelNames: ["source"],
|
|
657
672
|
}),
|
|
673
|
+
deferredPayloadResult: register.counter<{result: DeferredPayloadResult}>({
|
|
674
|
+
name: "lodestar_sync_deferred_payload_result_total",
|
|
675
|
+
help: "Outcome of a slot's deferred optimistic payload searches, by result",
|
|
676
|
+
labelNames: ["result"],
|
|
677
|
+
}),
|
|
678
|
+
deferredPayloadPolls: register.histogram({
|
|
679
|
+
name: "lodestar_sync_deferred_payload_polls_count",
|
|
680
|
+
help: "Poll ticks after PAYLOAD_DUE until a searched payload was imported",
|
|
681
|
+
buckets: [0, 1, 2, 3, 6],
|
|
682
|
+
}),
|
|
658
683
|
pendingBlocks: register.gauge({
|
|
659
684
|
name: "lodestar_sync_unknown_block_pending_blocks_size",
|
|
660
685
|
help: "Current size of UnknownBlockSync pending blocks cache",
|
|
@@ -1120,30 +1145,6 @@ export function createLodestarMetrics(
|
|
|
1120
1145
|
help: "The total result of calling notifyForkchoiceUpdate execution engine api",
|
|
1121
1146
|
labelNames: ["result"],
|
|
1122
1147
|
}),
|
|
1123
|
-
backfillSync: {
|
|
1124
|
-
backfilledTillSlot: register.gauge({
|
|
1125
|
-
name: "lodestar_backfill_till_slot",
|
|
1126
|
-
help: "Current lowest backfilled slot",
|
|
1127
|
-
}),
|
|
1128
|
-
prevFinOrWsSlot: register.gauge({
|
|
1129
|
-
name: "lodestar_backfill_prev_fin_or_ws_slot",
|
|
1130
|
-
help: "Slot of previous finalized or wsCheckpoint block to be validated",
|
|
1131
|
-
}),
|
|
1132
|
-
totalBlocks: register.gauge<{method: BackfillSyncMethod}>({
|
|
1133
|
-
name: "lodestar_backfill_sync_blocks_total",
|
|
1134
|
-
help: "Total amount of backfilled blocks",
|
|
1135
|
-
labelNames: ["method"],
|
|
1136
|
-
}),
|
|
1137
|
-
errors: register.gauge({
|
|
1138
|
-
name: "lodestar_backfill_sync_errors_total",
|
|
1139
|
-
help: "Total number of errors while backfilling",
|
|
1140
|
-
}),
|
|
1141
|
-
status: register.gauge({
|
|
1142
|
-
name: "lodestar_backfill_sync_status",
|
|
1143
|
-
help: "Current backfill syncing status: [Aborted, Pending, Syncing, Completed]",
|
|
1144
|
-
}),
|
|
1145
|
-
},
|
|
1146
|
-
|
|
1147
1148
|
opPool: {
|
|
1148
1149
|
aggregatedAttestationPool: {
|
|
1149
1150
|
size: register.gauge({
|
package/src/node/nodejs.ts
CHANGED
|
@@ -8,7 +8,6 @@ import {BeaconConfig} from "@lodestar/config";
|
|
|
8
8
|
import type {LoggerNode} from "@lodestar/logger/node";
|
|
9
9
|
import {ZERO_HASH_HEX} from "@lodestar/params";
|
|
10
10
|
import {IBeaconStateView, isStatePostBellatrix, isStatePostGloas} from "@lodestar/state-transition";
|
|
11
|
-
import {phase0} from "@lodestar/types";
|
|
12
11
|
import {sleep, toRootHex} from "@lodestar/utils";
|
|
13
12
|
import {ProcessShutdownCallback} from "@lodestar/validator";
|
|
14
13
|
import {BeaconRestApiServer, getApi} from "../api/index.js";
|
|
@@ -19,7 +18,6 @@ import {initializeExecutionBuilder, initializeExecutionEngine} from "../executio
|
|
|
19
18
|
import {HttpMetricsServer, Metrics, createMetrics, getHttpMetricsServer} from "../metrics/index.js";
|
|
20
19
|
import {MonitoringService} from "../monitoring/index.js";
|
|
21
20
|
import {Network, getReqRespHandlers} from "../network/index.js";
|
|
22
|
-
import {BackfillSync} from "../sync/backfill/index.js";
|
|
23
21
|
import {BeaconSync, IBeaconSync} from "../sync/index.js";
|
|
24
22
|
import {Clock} from "../util/clock.js";
|
|
25
23
|
import {startDeferredVoluntaryExitPublisher} from "./deferredVoluntaryExitPublisher.js";
|
|
@@ -38,7 +36,6 @@ export type BeaconNodeModules = {
|
|
|
38
36
|
chain: IBeaconChain;
|
|
39
37
|
api: BeaconApiMethods;
|
|
40
38
|
sync: IBeaconSync;
|
|
41
|
-
backfillSync: BackfillSync | null;
|
|
42
39
|
metricsServer: HttpMetricsServer | null;
|
|
43
40
|
monitoring: MonitoringService | null;
|
|
44
41
|
restApi?: BeaconRestApiServer;
|
|
@@ -58,7 +55,6 @@ export type BeaconNodeInitModules = {
|
|
|
58
55
|
peerStoreDir?: string;
|
|
59
56
|
anchorState: IBeaconStateView;
|
|
60
57
|
isAnchorStateFinalized: boolean;
|
|
61
|
-
wsCheckpoint?: phase0.Checkpoint;
|
|
62
58
|
metricsRegistries?: Registry[];
|
|
63
59
|
};
|
|
64
60
|
|
|
@@ -70,7 +66,6 @@ export enum BeaconNodeStatus {
|
|
|
70
66
|
|
|
71
67
|
enum LoggerModule {
|
|
72
68
|
api = "api",
|
|
73
|
-
backfill = "backfill",
|
|
74
69
|
chain = "chain",
|
|
75
70
|
execution = "execution",
|
|
76
71
|
metrics = "metrics",
|
|
@@ -105,7 +100,6 @@ export class BeaconNode {
|
|
|
105
100
|
api: BeaconApiMethods;
|
|
106
101
|
restApi?: BeaconRestApiServer;
|
|
107
102
|
sync: IBeaconSync;
|
|
108
|
-
backfillSync: BackfillSync | null;
|
|
109
103
|
|
|
110
104
|
status: BeaconNodeStatus;
|
|
111
105
|
private controller?: AbortController;
|
|
@@ -123,7 +117,6 @@ export class BeaconNode {
|
|
|
123
117
|
api,
|
|
124
118
|
restApi,
|
|
125
119
|
sync,
|
|
126
|
-
backfillSync,
|
|
127
120
|
controller,
|
|
128
121
|
}: BeaconNodeModules) {
|
|
129
122
|
this.opts = opts;
|
|
@@ -138,7 +131,6 @@ export class BeaconNode {
|
|
|
138
131
|
this.restApi = restApi;
|
|
139
132
|
this.network = network;
|
|
140
133
|
this.sync = sync;
|
|
141
|
-
this.backfillSync = backfillSync;
|
|
142
134
|
this.controller = controller;
|
|
143
135
|
|
|
144
136
|
this.status = BeaconNodeStatus.started;
|
|
@@ -161,7 +153,6 @@ export class BeaconNode {
|
|
|
161
153
|
peerStoreDir,
|
|
162
154
|
anchorState,
|
|
163
155
|
isAnchorStateFinalized,
|
|
164
|
-
wsCheckpoint,
|
|
165
156
|
metricsRegistries = [],
|
|
166
157
|
}: BeaconNodeInitModules): Promise<T> {
|
|
167
158
|
if (hasher.name !== "hashtree") {
|
|
@@ -295,25 +286,9 @@ export class BeaconNode {
|
|
|
295
286
|
chain,
|
|
296
287
|
metrics,
|
|
297
288
|
network,
|
|
298
|
-
wsCheckpoint,
|
|
299
289
|
logger: logger.child({module: LoggerModule.sync}),
|
|
300
290
|
});
|
|
301
291
|
|
|
302
|
-
const backfillSync =
|
|
303
|
-
opts.sync.backfillBatchSize > 0
|
|
304
|
-
? await BackfillSync.init(opts.sync, {
|
|
305
|
-
config,
|
|
306
|
-
db,
|
|
307
|
-
chain,
|
|
308
|
-
metrics,
|
|
309
|
-
network,
|
|
310
|
-
wsCheckpoint,
|
|
311
|
-
anchorState,
|
|
312
|
-
logger: logger.child({module: LoggerModule.backfill}),
|
|
313
|
-
signal,
|
|
314
|
-
})
|
|
315
|
-
: null;
|
|
316
|
-
|
|
317
292
|
const api = getApi(opts.api, {
|
|
318
293
|
config,
|
|
319
294
|
logger: logger.child({module: LoggerModule.api}),
|
|
@@ -361,7 +336,6 @@ export class BeaconNode {
|
|
|
361
336
|
api,
|
|
362
337
|
restApi,
|
|
363
338
|
sync,
|
|
364
|
-
backfillSync,
|
|
365
339
|
controller,
|
|
366
340
|
}) as T;
|
|
367
341
|
}
|
|
@@ -373,7 +347,6 @@ export class BeaconNode {
|
|
|
373
347
|
if (this.status === BeaconNodeStatus.started) {
|
|
374
348
|
this.status = BeaconNodeStatus.closing;
|
|
375
349
|
this.sync.close();
|
|
376
|
-
this.backfillSync?.close();
|
|
377
350
|
if (this.restApi) await this.restApi.close();
|
|
378
351
|
await this.network.close();
|
|
379
352
|
if (this.metricsServer) await this.metricsServer.close();
|
package/src/sync/interface.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {routes} from "@lodestar/api";
|
|
2
2
|
import {BeaconConfig} from "@lodestar/config";
|
|
3
|
-
import {Slot
|
|
3
|
+
import {Slot} from "@lodestar/types";
|
|
4
4
|
import {Logger} from "@lodestar/utils";
|
|
5
5
|
import {IBeaconChain} from "../chain/index.js";
|
|
6
6
|
import {IBeaconDb} from "../db/index.js";
|
|
@@ -51,5 +51,4 @@ export interface SyncModules {
|
|
|
51
51
|
metrics: Metrics | null;
|
|
52
52
|
logger: Logger;
|
|
53
53
|
chain: IBeaconChain;
|
|
54
|
-
wsCheckpoint?: phase0.Checkpoint;
|
|
55
54
|
}
|
package/src/sync/options.ts
CHANGED
|
@@ -16,12 +16,6 @@ export type SyncOptions = {
|
|
|
16
16
|
disableRangeSync?: boolean;
|
|
17
17
|
/** USE FOR TESTING ONLY. Disable unknown block sync completely */
|
|
18
18
|
disableBlockInputSync?: boolean;
|
|
19
|
-
/**
|
|
20
|
-
* The batch size of slots for backfill sync can attempt to sync/process before yielding
|
|
21
|
-
* to sync loop. This number can be increased or decreased to make a suitable resource
|
|
22
|
-
* allocation to backfill sync. The default of 0 would mean backfill sync will be skipped
|
|
23
|
-
*/
|
|
24
|
-
backfillBatchSize: number;
|
|
25
19
|
/** For testing only, MAX_PENDING_BLOCKS by default */
|
|
26
20
|
maxPendingBlocks?: number;
|
|
27
21
|
|
|
@@ -39,7 +33,5 @@ export type SyncOptions = {
|
|
|
39
33
|
export const defaultSyncOptions: SyncOptions = {
|
|
40
34
|
isSingleNode: false,
|
|
41
35
|
disableProcessAsChainSegment: false,
|
|
42
|
-
/** By default skip the backfill sync */
|
|
43
|
-
backfillBatchSize: 0,
|
|
44
36
|
slotImportTolerance: SLOTS_PER_EPOCH,
|
|
45
37
|
};
|
package/src/sync/types.ts
CHANGED
|
@@ -24,9 +24,13 @@ export enum PendingBlockType {
|
|
|
24
24
|
*/
|
|
25
25
|
UNKNOWN_PAYLOAD_BLOCK_ROOT = "unknown_payload_block_root",
|
|
26
26
|
/**
|
|
27
|
-
* Same as UNKNOWN_PAYLOAD_BLOCK_ROOT, but the trigger also carries the payload's slot
|
|
27
|
+
* Same as UNKNOWN_PAYLOAD_BLOCK_ROOT, but the trigger also carries the payload's slot
|
|
28
28
|
*/
|
|
29
29
|
UNKNOWN_PAYLOAD_BLOCK_ROOT_SLOT = "unknown_payload_block_root_slot",
|
|
30
|
+
/**
|
|
31
|
+
* Same as UNKNOWN_PAYLOAD_BLOCK_ROOT_SLOT for the current slot
|
|
32
|
+
*/
|
|
33
|
+
DEFERRED_PAYLOAD_BLOCK_ROOT = "deferred_payload_block_root",
|
|
30
34
|
/**
|
|
31
35
|
* Payload analog of INCOMPLETE_BLOCK_INPUT: we have a partial payload input that did not complete in time.
|
|
32
36
|
*/
|
|
@@ -53,6 +57,20 @@ export enum FetchResult {
|
|
|
53
57
|
FailureMaxAttempts = "failure_max_attempts",
|
|
54
58
|
}
|
|
55
59
|
|
|
60
|
+
/**
|
|
61
|
+
* Outcome of a slot's deferred optimistic payload searches, recorded once when its poll loop ends.
|
|
62
|
+
*/
|
|
63
|
+
export enum DeferredPayloadResult {
|
|
64
|
+
/** gossip delivered every watched payload before PAYLOAD_DUE, no search was needed */
|
|
65
|
+
ImportedBeforeSearch = "imported_before_search",
|
|
66
|
+
/** at least one was missing at PAYLOAD_DUE, we searched, and all were imported afterwards */
|
|
67
|
+
ImportedAfterSearch = "imported_after_search",
|
|
68
|
+
/** something was still not in fork choice when the slot ended */
|
|
69
|
+
Unresolved = "unresolved",
|
|
70
|
+
/** the slot had no optimistic search and no payload import at all, eg a skipped slot */
|
|
71
|
+
ResolvedNoRoot = "resolved_no_root",
|
|
72
|
+
}
|
|
73
|
+
|
|
56
74
|
export enum PendingBlockInputStatus {
|
|
57
75
|
pending = "pending",
|
|
58
76
|
fetching = "fetching",
|
package/src/sync/unknownBlock.ts
CHANGED
|
@@ -5,7 +5,7 @@ import {ForkSeq, SLOTS_PER_EPOCH, isForkPostGloas} from "@lodestar/params";
|
|
|
5
5
|
import {RequestError, RequestErrorCode} from "@lodestar/reqresp";
|
|
6
6
|
import {computeTimeAtSlot} from "@lodestar/state-transition";
|
|
7
7
|
import {RootHex, Slot, gloas} from "@lodestar/types";
|
|
8
|
-
import {Logger, fromHex, prettyPrintIndices, pruneSetToMax, sleep, toRootHex} from "@lodestar/utils";
|
|
8
|
+
import {Logger, fromHex, isErrorAborted, prettyPrintIndices, pruneSetToMax, sleep, toRootHex} from "@lodestar/utils";
|
|
9
9
|
import {isBlockInputBlobs, isBlockInputColumns} from "../chain/blocks/blockInput/blockInput.js";
|
|
10
10
|
import {BlockInputSource, IBlockInput} from "../chain/blocks/blockInput/types.js";
|
|
11
11
|
import {PayloadError, PayloadErrorCode} from "../chain/blocks/importExecutionPayload.js";
|
|
@@ -18,6 +18,7 @@ import {Metrics} from "../metrics/index.js";
|
|
|
18
18
|
import {INetwork, NetworkEvent, NetworkEventData, prettyPrintPeerIdStr} from "../network/index.js";
|
|
19
19
|
import {PeerSyncMeta} from "../network/peers/peersData.js";
|
|
20
20
|
import {MAX_PEERS_PER_ROOT} from "../network/processor/constants.js";
|
|
21
|
+
import {ClockEvent} from "../util/clock.js";
|
|
21
22
|
import {PeerIdStr} from "../util/peerId.js";
|
|
22
23
|
import {shuffle} from "../util/shuffle.js";
|
|
23
24
|
import {sortBy} from "../util/sortBy.js";
|
|
@@ -26,6 +27,7 @@ import {MAX_CONCURRENT_REQUESTS} from "./constants.js";
|
|
|
26
27
|
import {SyncOptions} from "./options.js";
|
|
27
28
|
import {
|
|
28
29
|
BlockInputSyncCacheItem,
|
|
30
|
+
DeferredPayloadResult,
|
|
29
31
|
DownloadResult,
|
|
30
32
|
DroppedItemReason,
|
|
31
33
|
FetchResult,
|
|
@@ -57,6 +59,11 @@ const MAX_PENDING_BLOCKS = 100;
|
|
|
57
59
|
*/
|
|
58
60
|
const PRUNE_UNRESOLVED_SLOT_EPOCHS = 2;
|
|
59
61
|
|
|
62
|
+
/**
|
|
63
|
+
* Poll pending payloads of the current slot this often, between PAYLOAD_DUE and the end of the slot.
|
|
64
|
+
*/
|
|
65
|
+
export const PAYLOAD_POLL_INTERVAL_MS = 1_000;
|
|
66
|
+
|
|
60
67
|
type AdvancePendingBlockResult =
|
|
61
68
|
| "ready"
|
|
62
69
|
| "queued_block"
|
|
@@ -116,6 +123,11 @@ export class BlockInputSync {
|
|
|
116
123
|
private subscribedToNetworkEvents = false;
|
|
117
124
|
private peerBalancer: UnknownBlockPeerBalancer;
|
|
118
125
|
private rateLimitBackoffTimeout: NodeJS.Timeout | undefined;
|
|
126
|
+
/**
|
|
127
|
+
* Search unknown payload starting at PAYLOAD_DUE_BPS.
|
|
128
|
+
*/
|
|
129
|
+
private readonly deferredPayloadRoots = new Map<RootHex, {slot: Slot; source: BlockInputSource; peer?: PeerIdStr}>();
|
|
130
|
+
private payloadPollAbortController: AbortController | undefined;
|
|
119
131
|
|
|
120
132
|
constructor(
|
|
121
133
|
private readonly config: ChainForkConfig,
|
|
@@ -161,6 +173,7 @@ export class BlockInputSync {
|
|
|
161
173
|
this.chain.emitter.on(routes.events.EventType.executionPayload, this.onPayloadImported);
|
|
162
174
|
this.network.events.on(NetworkEvent.peerConnected, this.onPeerConnected);
|
|
163
175
|
this.network.events.on(NetworkEvent.peerDisconnected, this.onPeerDisconnected);
|
|
176
|
+
this.chain.clock.on(ClockEvent.slot, this.startPayloadPollAtSlot);
|
|
164
177
|
|
|
165
178
|
// Seed the balancer with peers that connected before we subscribed
|
|
166
179
|
for (const peerId of this.network.getConnectedPeers()) {
|
|
@@ -172,12 +185,19 @@ export class BlockInputSync {
|
|
|
172
185
|
}
|
|
173
186
|
|
|
174
187
|
this.subscribedToNetworkEvents = true;
|
|
188
|
+
// we subscribe mid-slot, and a root can be deferred at any point in the slot, so start this
|
|
189
|
+
// slot's loop now instead of waiting for the next ClockEvent.slot
|
|
190
|
+
this.startPayloadPollAtSlot(this.chain.clock.currentSlot);
|
|
175
191
|
}
|
|
176
192
|
}
|
|
177
193
|
|
|
178
194
|
unsubscribeFromNetwork(): void {
|
|
179
195
|
this.logger.verbose("BlockInputSync disabled.");
|
|
180
196
|
this.clearRateLimitBackoffTimer();
|
|
197
|
+
this.chain.clock.off(ClockEvent.slot, this.startPayloadPollAtSlot);
|
|
198
|
+
this.payloadPollAbortController?.abort();
|
|
199
|
+
this.payloadPollAbortController = undefined;
|
|
200
|
+
this.deferredPayloadRoots.clear();
|
|
181
201
|
this.chain.emitter.off(ChainEvent.unknownBlockRoot, this.onUnknownBlockRoot);
|
|
182
202
|
this.chain.emitter.off(ChainEvent.unknownEnvelopeBlockRoot, this.onUnknownEnvelopeBlockRoot);
|
|
183
203
|
this.chain.emitter.off(ChainEvent.unknownEnvelopeBlockRootSlot, this.onUnknownEnvelopeBlockRootSlot);
|
|
@@ -246,6 +266,20 @@ export class BlockInputSync {
|
|
|
246
266
|
|
|
247
267
|
private onUnknownEnvelopeBlockRootSlot = (data: ChainEventData[ChainEvent.unknownEnvelopeBlockRootSlot]): void => {
|
|
248
268
|
try {
|
|
269
|
+
if (data.slot === this.chain.clock.currentSlot) {
|
|
270
|
+
// we receive the optimistic search, the poll loop searches it at PAYLOAD_DUE or on its next
|
|
271
|
+
// tick. If that loop already returned - every root it watched was imported - this root waits
|
|
272
|
+
// for the next slot, where startPayloadPollAtSlot moves it to pendingPayloads. That is not the normal
|
|
273
|
+
// scenario, and in a forking condition it only delays the search of the extra root
|
|
274
|
+
const deferred = this.deferredPayloadRoots.get(data.rootHex);
|
|
275
|
+
if (deferred === undefined) {
|
|
276
|
+
this.deferredPayloadRoots.set(data.rootHex, {slot: data.slot, source: data.source, peer: data.peer});
|
|
277
|
+
} else if (deferred.peer === undefined) {
|
|
278
|
+
deferred.peer = data.peer;
|
|
279
|
+
}
|
|
280
|
+
return;
|
|
281
|
+
}
|
|
282
|
+
|
|
249
283
|
const isNewRoot = this.addByPayloadRootHex(data.rootHex, data.peer, data.slot);
|
|
250
284
|
if (isNewRoot) {
|
|
251
285
|
this.triggerUnknownBlockSearch();
|
|
@@ -800,6 +834,122 @@ export class BlockInputSync {
|
|
|
800
834
|
}
|
|
801
835
|
}
|
|
802
836
|
|
|
837
|
+
/**
|
|
838
|
+
* Start this slot's payload poll: end the previous slot's loop, move roots it never got to
|
|
839
|
+
* into pendingPayloads, then poll from PAYLOAD_DUE to the end of the slot.
|
|
840
|
+
*/
|
|
841
|
+
private startPayloadPollAtSlot = (slot: Slot): void => {
|
|
842
|
+
if (!isForkPostGloas(this.config.getForkName(slot))) {
|
|
843
|
+
return;
|
|
844
|
+
}
|
|
845
|
+
// end the previous slot's loop, wherever it is: its sleep is bound to this same controller
|
|
846
|
+
this.payloadPollAbortController?.abort();
|
|
847
|
+
this.payloadPollAbortController = new AbortController();
|
|
848
|
+
// entries from an earlier slot is not polled
|
|
849
|
+
for (const [rootHex, {slot: deferredSlot, source, peer}] of this.deferredPayloadRoots) {
|
|
850
|
+
if (deferredSlot < slot) {
|
|
851
|
+
if (!this.chain.forkChoice.hasPayloadHexUnsafe(rootHex)) {
|
|
852
|
+
this.addDeferredPayloadRoot(rootHex, deferredSlot, source, peer);
|
|
853
|
+
}
|
|
854
|
+
this.deferredPayloadRoots.delete(rootHex);
|
|
855
|
+
}
|
|
856
|
+
}
|
|
857
|
+
this.pollPayloadsAtSlot(slot, this.payloadPollAbortController.signal).catch((e) => {
|
|
858
|
+
if (!isErrorAborted(e)) {
|
|
859
|
+
this.logger.debug("Error polling payloads", {slot}, e as Error);
|
|
860
|
+
}
|
|
861
|
+
});
|
|
862
|
+
};
|
|
863
|
+
|
|
864
|
+
/**
|
|
865
|
+
* Poll unknown payloads of the current slot.
|
|
866
|
+
*/
|
|
867
|
+
private async pollPayloadsAtSlot(slot: Slot, signal: AbortSignal): Promise<void> {
|
|
868
|
+
// fixed tick count so the loop cannot outlive its slot: for mainnet, it's 6 ticks
|
|
869
|
+
const tickCount = Math.floor(
|
|
870
|
+
(this.config.SLOT_DURATION_MS - this.config.getPayloadDueMs()) / PAYLOAD_POLL_INTERVAL_MS
|
|
871
|
+
);
|
|
872
|
+
// a root still missing on several ticks is searched on each of them, recorded once
|
|
873
|
+
const searchedRoots = new Set<RootHex>();
|
|
874
|
+
let polls = 0;
|
|
875
|
+
|
|
876
|
+
try {
|
|
877
|
+
await sleep(Math.max(0, this.config.getPayloadDueMs() - this.chain.clock.msFromSlot(slot)), signal);
|
|
878
|
+
|
|
879
|
+
for (polls = 0; polls < tickCount; polls++) {
|
|
880
|
+
let importedCount = 0;
|
|
881
|
+
for (const [rootHex, {slot: deferredSlot, source, peer}] of this.deferredPayloadRoots) {
|
|
882
|
+
if (this.chain.forkChoice.hasPayloadHexUnsafe(rootHex)) {
|
|
883
|
+
importedCount++;
|
|
884
|
+
continue;
|
|
885
|
+
}
|
|
886
|
+
// copy to the regular pendingPayloads so that we can search
|
|
887
|
+
this.addDeferredPayloadRoot(rootHex, deferredSlot, source, peer);
|
|
888
|
+
searchedRoots.add(rootHex);
|
|
889
|
+
}
|
|
890
|
+
|
|
891
|
+
// an empty deferredPayloadRoots means there is no optimistic search comes before PAYLOAD_DUE
|
|
892
|
+
// we have to poll until the payload of current slot is imported or slot end
|
|
893
|
+
if (this.deferredPayloadRoots.size > 0 && importedCount === this.deferredPayloadRoots.size) {
|
|
894
|
+
if (searchedRoots.size > 0) {
|
|
895
|
+
// the backup search was needed
|
|
896
|
+
this.metrics?.blockInputSync.deferredPayloadResult.inc({
|
|
897
|
+
result: DeferredPayloadResult.ImportedAfterSearch,
|
|
898
|
+
});
|
|
899
|
+
this.metrics?.blockInputSync.deferredPayloadPolls.observe(polls);
|
|
900
|
+
this.logger.verbose("Payload imported after unknown sync search", {
|
|
901
|
+
slot,
|
|
902
|
+
roots: Array.from(searchedRoots).join(","),
|
|
903
|
+
polls,
|
|
904
|
+
});
|
|
905
|
+
} else {
|
|
906
|
+
// this happens most of the time on devnet
|
|
907
|
+
// gossip delivered everything before PAYLOAD_DUE
|
|
908
|
+
this.metrics?.blockInputSync.deferredPayloadResult.inc({
|
|
909
|
+
result: DeferredPayloadResult.ImportedBeforeSearch,
|
|
910
|
+
});
|
|
911
|
+
}
|
|
912
|
+
return;
|
|
913
|
+
}
|
|
914
|
+
|
|
915
|
+
this.triggerUnknownBlockSearch();
|
|
916
|
+
if (polls < tickCount - 1) {
|
|
917
|
+
// no sleep after the last tick: the loop would otherwise end right at the slot boundary,
|
|
918
|
+
// where startPayloadPollAtSlot aborts it
|
|
919
|
+
await sleep(PAYLOAD_POLL_INTERVAL_MS, signal);
|
|
920
|
+
}
|
|
921
|
+
}
|
|
922
|
+
|
|
923
|
+
// reaching here means the early return never fired
|
|
924
|
+
if (this.deferredPayloadRoots.size > 0) {
|
|
925
|
+
this.metrics?.blockInputSync.deferredPayloadResult.inc({result: DeferredPayloadResult.Unresolved});
|
|
926
|
+
this.logger.debug("Deferred payloads still missing at end of slot", {
|
|
927
|
+
slot,
|
|
928
|
+
roots: Array.from(this.deferredPayloadRoots.keys()).join(","),
|
|
929
|
+
});
|
|
930
|
+
} else {
|
|
931
|
+
// no optimistic search and no payload import ended the loop, eg a skipped slot
|
|
932
|
+
this.metrics?.blockInputSync.deferredPayloadResult.inc({result: DeferredPayloadResult.ResolvedNoRoot});
|
|
933
|
+
this.logger.debug("No deferred payloads at slot", {
|
|
934
|
+
slot,
|
|
935
|
+
});
|
|
936
|
+
}
|
|
937
|
+
} catch (e) {
|
|
938
|
+
if (!isErrorAborted(e)) {
|
|
939
|
+
throw e;
|
|
940
|
+
}
|
|
941
|
+
this.logger.verbose("Payload poll aborted", {slot, polls, msIntoSlot: this.chain.clock.msFromSlot(slot)});
|
|
942
|
+
}
|
|
943
|
+
}
|
|
944
|
+
|
|
945
|
+
private addDeferredPayloadRoot(rootHex: RootHex, slot: Slot, source: BlockInputSource, peer?: PeerIdStr): void {
|
|
946
|
+
const isNewRoot = this.addByPayloadRootHex(rootHex, peer, slot);
|
|
947
|
+
if (isNewRoot) {
|
|
948
|
+
this.metrics?.blockInputSync.requests.inc({type: PendingBlockType.DEFERRED_PAYLOAD_BLOCK_ROOT});
|
|
949
|
+
this.metrics?.blockInputSync.payloadSource.inc({source});
|
|
950
|
+
}
|
|
951
|
+
}
|
|
952
|
+
|
|
803
953
|
private async downloadBlock(block: BlockInputSyncCacheItem): Promise<void> {
|
|
804
954
|
if (block.status !== PendingBlockInputStatus.pending) {
|
|
805
955
|
return;
|
package/src/util/shuffle.ts
CHANGED
|
@@ -10,12 +10,3 @@ export function shuffle<T>(arr: T[]): T[] {
|
|
|
10
10
|
}
|
|
11
11
|
return _arr;
|
|
12
12
|
}
|
|
13
|
-
|
|
14
|
-
/**
|
|
15
|
-
* Return one random item from array
|
|
16
|
-
*/
|
|
17
|
-
export function shuffleOne<T>(arr: T[]): T | undefined {
|
|
18
|
-
if (arr.length === 0) return undefined;
|
|
19
|
-
|
|
20
|
-
return arr[Math.floor(Math.random() * arr.length)];
|
|
21
|
-
}
|
|
@@ -1,20 +0,0 @@
|
|
|
1
|
-
import { CheckpointWithHex } from "@lodestar/fork-choice";
|
|
2
|
-
import { Logger } from "@lodestar/logger";
|
|
3
|
-
import { IBeaconDb } from "../../../db/interface.js";
|
|
4
|
-
import { IBeaconChain } from "../../interface.js";
|
|
5
|
-
/**
|
|
6
|
-
* Backfill sync relies on verified connected ranges (which are represented as key,value
|
|
7
|
-
* with a verified jump from a key back to value). Since the node could have progressed
|
|
8
|
-
* ahead from, we need to save the forward progress of this node as another backfill
|
|
9
|
-
* range entry, that backfill sync will use to jump back if this node is restarted
|
|
10
|
-
* for any reason.
|
|
11
|
-
* The current backfill has its own backfill entry from anchor slot to last backfilled
|
|
12
|
-
* slot. And this would create the entry from the current finalized slot to the anchor
|
|
13
|
-
* slot.
|
|
14
|
-
*/
|
|
15
|
-
export declare function updateBackfillRange({ chain, db, logger }: {
|
|
16
|
-
chain: IBeaconChain;
|
|
17
|
-
db: IBeaconDb;
|
|
18
|
-
logger: Logger;
|
|
19
|
-
}, finalized: CheckpointWithHex): Promise<void>;
|
|
20
|
-
//# sourceMappingURL=updateBackfillRange.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"updateBackfillRange.d.ts","sourceRoot":"","sources":["../../../../src/chain/archiveStore/utils/updateBackfillRange.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,iBAAiB,EAAC,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAC,MAAM,EAAC,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAC,SAAS,EAAC,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAEhD;;;;;;;;;GASG;AACH,wBAAsB,mBAAmB,CACvC,EAAC,KAAK,EAAE,EAAE,EAAE,MAAM,EAAC,EAAE;IAAC,KAAK,EAAE,YAAY,CAAC;IAAC,EAAE,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAC,EACzE,SAAS,EAAE,iBAAiB,GAC3B,OAAO,CAAC,IAAI,CAAC,CA+Bf"}
|
|
@@ -1,40 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Backfill sync relies on verified connected ranges (which are represented as key,value
|
|
3
|
-
* with a verified jump from a key back to value). Since the node could have progressed
|
|
4
|
-
* ahead from, we need to save the forward progress of this node as another backfill
|
|
5
|
-
* range entry, that backfill sync will use to jump back if this node is restarted
|
|
6
|
-
* for any reason.
|
|
7
|
-
* The current backfill has its own backfill entry from anchor slot to last backfilled
|
|
8
|
-
* slot. And this would create the entry from the current finalized slot to the anchor
|
|
9
|
-
* slot.
|
|
10
|
-
*/
|
|
11
|
-
export async function updateBackfillRange({ chain, db, logger }, finalized) {
|
|
12
|
-
try {
|
|
13
|
-
// Mark the sequence in backfill db from finalized block's slot till anchor slot as
|
|
14
|
-
// filled.
|
|
15
|
-
const finalizedBlockFC = chain.forkChoice.getBlockHexDefaultStatus(finalized.rootHex);
|
|
16
|
-
if (finalizedBlockFC && finalizedBlockFC.slot > chain.anchorStateLatestBlockSlot) {
|
|
17
|
-
await db.backfilledRanges.put(finalizedBlockFC.slot, chain.anchorStateLatestBlockSlot);
|
|
18
|
-
// Clear previously marked sequence till anchorStateLatestBlockSlot, without
|
|
19
|
-
// touching backfill sync process sequence which are at
|
|
20
|
-
// <=anchorStateLatestBlockSlot i.e. clear >anchorStateLatestBlockSlot
|
|
21
|
-
// and < currentSlot
|
|
22
|
-
const filteredSeqs = await db.backfilledRanges.entries({
|
|
23
|
-
gt: chain.anchorStateLatestBlockSlot,
|
|
24
|
-
lt: finalizedBlockFC.slot,
|
|
25
|
-
});
|
|
26
|
-
logger.debug("updated backfilledRanges", {
|
|
27
|
-
key: finalizedBlockFC.slot,
|
|
28
|
-
value: chain.anchorStateLatestBlockSlot,
|
|
29
|
-
});
|
|
30
|
-
if (filteredSeqs.length > 0) {
|
|
31
|
-
await db.backfilledRanges.batchDelete(filteredSeqs.map((entry) => entry.key));
|
|
32
|
-
logger.debug(`Forward Sync - cleaned up backfilledRanges between ${finalizedBlockFC.slot},${chain.anchorStateLatestBlockSlot}`, { seqs: JSON.stringify(filteredSeqs) });
|
|
33
|
-
}
|
|
34
|
-
}
|
|
35
|
-
}
|
|
36
|
-
catch (e) {
|
|
37
|
-
logger.error("Error updating backfilledRanges on finalization", { epoch: finalized.epoch }, e);
|
|
38
|
-
}
|
|
39
|
-
}
|
|
40
|
-
//# sourceMappingURL=updateBackfillRange.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"updateBackfillRange.js","sourceRoot":"","sources":["../../../../src/chain/archiveStore/utils/updateBackfillRange.ts"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,EAAC,KAAK,EAAE,EAAE,EAAE,MAAM,EAAuD,EACzE,SAA4B;IAE5B,IAAI,CAAC;QACH,mFAAmF;QACnF,UAAU;QACV,MAAM,gBAAgB,GAAG,KAAK,CAAC,UAAU,CAAC,wBAAwB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACtF,IAAI,gBAAgB,IAAI,gBAAgB,CAAC,IAAI,GAAG,KAAK,CAAC,0BAA0B,EAAE,CAAC;YACjF,MAAM,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;YAEvF,4EAA4E;YAC5E,uDAAuD;YACvD,sEAAsE;YACtE,oBAAoB;YACpB,MAAM,YAAY,GAAG,MAAM,EAAE,CAAC,gBAAgB,CAAC,OAAO,CAAC;gBACrD,EAAE,EAAE,KAAK,CAAC,0BAA0B;gBACpC,EAAE,EAAE,gBAAgB,CAAC,IAAI;aAC1B,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,0BAA0B,EAAE;gBACvC,GAAG,EAAE,gBAAgB,CAAC,IAAI;gBAC1B,KAAK,EAAE,KAAK,CAAC,0BAA0B;aACxC,CAAC,CAAC;YACH,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,EAAE,CAAC,gBAAgB,CAAC,WAAW,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9E,MAAM,CAAC,KAAK,CACV,sDAAsD,gBAAgB,CAAC,IAAI,IAAI,KAAK,CAAC,0BAA0B,EAAE,EACjH,EAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAAC,CACrC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,CAAC,KAAK,CAAC,iDAAiD,EAAE,EAAC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAC,EAAE,CAAU,CAAC,CAAC;IACxG,CAAC;AACH,CAAC"}
|
|
@@ -1,18 +0,0 @@
|
|
|
1
|
-
import { ChainForkConfig } from "@lodestar/config";
|
|
2
|
-
import { DatabaseController, Repository } from "@lodestar/db";
|
|
3
|
-
import { Slot } from "@lodestar/types";
|
|
4
|
-
/**
|
|
5
|
-
* Slot to slot ranges that ensure that block range is fully backfilled
|
|
6
|
-
*
|
|
7
|
-
* If node starts backfilling at slots 1000, and backfills to 800, there will be an entry
|
|
8
|
-
* 1000 -> 800
|
|
9
|
-
*
|
|
10
|
-
* When the node is backfilling if it starts at 1200 and backfills to 1000, it will find this sequence and,
|
|
11
|
-
* jump directly to 800 and delete the key 1000.
|
|
12
|
-
*/
|
|
13
|
-
export declare class BackfilledRanges extends Repository<Slot, Slot> {
|
|
14
|
-
constructor(config: ChainForkConfig, db: DatabaseController<Uint8Array, Uint8Array>);
|
|
15
|
-
decodeKey(data: Buffer): number;
|
|
16
|
-
getId(_value: Slot): number;
|
|
17
|
-
}
|
|
18
|
-
//# sourceMappingURL=backfilledRanges.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"backfilledRanges.d.ts","sourceRoot":"","sources":["../../../src/db/repositories/backfilledRanges.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,eAAe,EAAC,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAC,kBAAkB,EAAE,UAAU,EAAC,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAC,IAAI,EAAM,MAAM,iBAAiB,CAAC;AAI1C;;;;;;;;GAQG;AACH,qBAAa,gBAAiB,SAAQ,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;IAC1D,YAAY,MAAM,EAAE,eAAe,EAAE,EAAE,EAAE,kBAAkB,CAAC,UAAU,EAAE,UAAU,CAAC,EAGlF;IAED,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE9B;IAED,KAAK,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,CAE1B;CACF"}
|
|
@@ -1,26 +0,0 @@
|
|
|
1
|
-
import { Repository } from "@lodestar/db";
|
|
2
|
-
import { ssz } from "@lodestar/types";
|
|
3
|
-
import { bytesToInt } from "@lodestar/utils";
|
|
4
|
-
import { Bucket, getBucketNameByValue } from "../buckets.js";
|
|
5
|
-
/**
|
|
6
|
-
* Slot to slot ranges that ensure that block range is fully backfilled
|
|
7
|
-
*
|
|
8
|
-
* If node starts backfilling at slots 1000, and backfills to 800, there will be an entry
|
|
9
|
-
* 1000 -> 800
|
|
10
|
-
*
|
|
11
|
-
* When the node is backfilling if it starts at 1200 and backfills to 1000, it will find this sequence and,
|
|
12
|
-
* jump directly to 800 and delete the key 1000.
|
|
13
|
-
*/
|
|
14
|
-
export class BackfilledRanges extends Repository {
|
|
15
|
-
constructor(config, db) {
|
|
16
|
-
const bucket = Bucket.backfilled_ranges;
|
|
17
|
-
super(config, db, bucket, ssz.Slot, getBucketNameByValue(bucket));
|
|
18
|
-
}
|
|
19
|
-
decodeKey(data) {
|
|
20
|
-
return bytesToInt(super.decodeKey(data), "be");
|
|
21
|
-
}
|
|
22
|
-
getId(_value) {
|
|
23
|
-
throw new Error("Cannot get the db key from slot");
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
//# sourceMappingURL=backfilledRanges.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"backfilledRanges.js","sourceRoot":"","sources":["../../../src/db/repositories/backfilledRanges.ts"],"names":[],"mappings":"AACA,OAAO,EAAqB,UAAU,EAAC,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAO,GAAG,EAAC,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAC,MAAM,EAAE,oBAAoB,EAAC,MAAM,eAAe,CAAC;AAE3D;;;;;;;;GAQG;AACH,MAAM,OAAO,gBAAiB,SAAQ,UAAsB;IAC1D,YAAY,MAAuB,EAAE,EAA8C;QACjF,MAAM,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACxC,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,SAAS,CAAC,IAAY;QACpB,OAAO,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAA0B,EAAE,IAAI,CAAC,CAAC;IAC1E,CAAC;IAED,KAAK,CAAC,MAAY;QAChB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACrD,CAAC;CACF"}
|