@lodestar/beacon-node 1.51.0-dev.9cb14e3381 → 1.51.0-dev.9f52a9d2ab
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/blocks/index.d.ts.map +1 -1
- package/lib/api/impl/beacon/blocks/index.js +17 -27
- package/lib/api/impl/beacon/blocks/index.js.map +1 -1
- package/lib/api/impl/beacon/pool/index.d.ts.map +1 -1
- package/lib/api/impl/beacon/pool/index.js +5 -2
- package/lib/api/impl/beacon/pool/index.js.map +1 -1
- package/lib/api/impl/beacon/state/utils.d.ts +1 -1
- package/lib/api/impl/beacon/state/utils.d.ts.map +1 -1
- package/lib/api/impl/validator/index.d.ts.map +1 -1
- package/lib/api/impl/validator/index.js +4 -1
- package/lib/api/impl/validator/index.js.map +1 -1
- package/lib/chain/GetBlobsTracker.d.ts +11 -0
- package/lib/chain/GetBlobsTracker.d.ts.map +1 -1
- package/lib/chain/GetBlobsTracker.js +85 -27
- package/lib/chain/GetBlobsTracker.js.map +1 -1
- package/lib/chain/archiveStore/archiveStore.d.ts.map +1 -1
- package/lib/chain/archiveStore/archiveStore.js +1 -0
- package/lib/chain/archiveStore/archiveStore.js.map +1 -1
- package/lib/chain/archiveStore/utils/archiveBlocks.d.ts +4 -0
- package/lib/chain/archiveStore/utils/archiveBlocks.d.ts.map +1 -1
- package/lib/chain/archiveStore/utils/archiveBlocks.js +7 -1
- package/lib/chain/archiveStore/utils/archiveBlocks.js.map +1 -1
- package/lib/chain/blocks/importBlock.d.ts.map +1 -1
- package/lib/chain/blocks/importBlock.js +6 -5
- package/lib/chain/blocks/importBlock.js.map +1 -1
- package/lib/chain/blocks/importExecutionPayload.d.ts +6 -11
- package/lib/chain/blocks/importExecutionPayload.d.ts.map +1 -1
- package/lib/chain/blocks/importExecutionPayload.js +8 -15
- package/lib/chain/blocks/importExecutionPayload.js.map +1 -1
- package/lib/chain/blocks/index.js +2 -2
- package/lib/chain/blocks/index.js.map +1 -1
- package/lib/chain/blocks/payloadEnvelopeProcessor.d.ts +12 -9
- package/lib/chain/blocks/payloadEnvelopeProcessor.d.ts.map +1 -1
- package/lib/chain/blocks/payloadEnvelopeProcessor.js +24 -19
- package/lib/chain/blocks/payloadEnvelopeProcessor.js.map +1 -1
- package/lib/chain/blocks/types.d.ts +4 -1
- package/lib/chain/blocks/types.d.ts.map +1 -1
- package/lib/chain/blocks/verifyBlock.d.ts.map +1 -1
- package/lib/chain/blocks/verifyBlock.js +18 -7
- package/lib/chain/blocks/verifyBlock.js.map +1 -1
- package/lib/chain/blocks/verifyBlocksDataAvailability.d.ts.map +1 -1
- package/lib/chain/blocks/verifyBlocksDataAvailability.js +8 -1
- package/lib/chain/blocks/verifyBlocksDataAvailability.js.map +1 -1
- package/lib/chain/blocks/verifyBlocksSignatures.d.ts.map +1 -1
- package/lib/chain/blocks/verifyBlocksSignatures.js +7 -5
- package/lib/chain/blocks/verifyBlocksSignatures.js.map +1 -1
- package/lib/chain/blocks/verifyPayloadsDataAvailability.d.ts +3 -3
- package/lib/chain/blocks/verifyPayloadsDataAvailability.d.ts.map +1 -1
- package/lib/chain/blocks/verifyPayloadsDataAvailability.js +11 -6
- package/lib/chain/blocks/verifyPayloadsDataAvailability.js.map +1 -1
- package/lib/chain/bls/interface.d.ts +2 -0
- package/lib/chain/bls/interface.d.ts.map +1 -1
- package/lib/chain/bls/multithread/index.d.ts.map +1 -1
- package/lib/chain/bls/multithread/index.js +13 -11
- package/lib/chain/bls/multithread/index.js.map +1 -1
- package/lib/chain/bls/multithread/types.d.ts +1 -1
- package/lib/chain/bls/multithread/types.d.ts.map +1 -1
- package/lib/chain/bls/multithread/worker.js +1 -1
- package/lib/chain/bls/multithread/worker.js.map +1 -1
- package/lib/chain/bls/singleThread.js +1 -1
- package/lib/chain/bls/singleThread.js.map +1 -1
- package/lib/chain/bls/utils.js +1 -1
- package/lib/chain/bls/utils.js.map +1 -1
- package/lib/chain/chain.d.ts +1 -1
- package/lib/chain/chain.d.ts.map +1 -1
- package/lib/chain/chain.js +4 -4
- package/lib/chain/chain.js.map +1 -1
- package/lib/chain/errors/blockError.d.ts +1 -1
- package/lib/chain/errors/blockError.d.ts.map +1 -1
- package/lib/chain/errors/blockError.js +1 -1
- package/lib/chain/errors/blockError.js.map +1 -1
- package/lib/chain/interface.d.ts +2 -3
- package/lib/chain/interface.d.ts.map +1 -1
- package/lib/chain/interface.js.map +1 -1
- package/lib/chain/opPools/aggregatedAttestationPool.d.ts.map +1 -1
- package/lib/chain/opPools/aggregatedAttestationPool.js +23 -10
- package/lib/chain/opPools/aggregatedAttestationPool.js.map +1 -1
- package/lib/chain/opPools/attestationPool.d.ts +1 -1
- package/lib/chain/opPools/attestationPool.d.ts.map +1 -1
- package/lib/chain/opPools/attestationPool.js +15 -4
- package/lib/chain/opPools/attestationPool.js.map +1 -1
- package/lib/chain/opPools/payloadAttestationPool.d.ts.map +1 -1
- package/lib/chain/opPools/payloadAttestationPool.js +17 -7
- package/lib/chain/opPools/payloadAttestationPool.js.map +1 -1
- package/lib/chain/opPools/syncCommitteeMessagePool.d.ts.map +1 -1
- package/lib/chain/opPools/syncCommitteeMessagePool.js +9 -3
- package/lib/chain/opPools/syncCommitteeMessagePool.js.map +1 -1
- package/lib/chain/opPools/syncContributionAndProofPool.d.ts.map +1 -1
- package/lib/chain/opPools/syncContributionAndProofPool.js +11 -3
- package/lib/chain/opPools/syncContributionAndProofPool.js.map +1 -1
- package/lib/chain/opPools/utils.d.ts +1 -1
- package/lib/chain/opPools/utils.d.ts.map +1 -1
- package/lib/chain/opPools/utils.js +1 -1
- package/lib/chain/opPools/utils.js.map +1 -1
- package/lib/chain/options.d.ts +0 -1
- package/lib/chain/options.d.ts.map +1 -1
- package/lib/chain/options.js +0 -1
- package/lib/chain/options.js.map +1 -1
- package/lib/chain/validation/executionPayloadBid.js +13 -13
- package/lib/chain/validation/executionPayloadBid.js.map +1 -1
- package/lib/db/beacon.d.ts +7 -0
- package/lib/db/beacon.d.ts.map +1 -1
- package/lib/db/beacon.js +32 -0
- package/lib/db/beacon.js.map +1 -1
- package/lib/db/dataColumnStore.d.ts +1 -1
- package/lib/db/dataColumnStore.d.ts.map +1 -1
- package/lib/db/dataColumnStore.js +1 -4
- package/lib/db/dataColumnStore.js.map +1 -1
- package/lib/db/flatFileStore/flatFileStore.js +5 -5
- package/lib/db/flatFileStore/flatFileStore.js.map +1 -1
- package/lib/db/flatFileStore/slotIndex.d.ts.map +1 -1
- package/lib/db/flatFileStore/slotIndex.js +2 -2
- package/lib/db/flatFileStore/slotIndex.js.map +1 -1
- package/lib/db/interface.d.ts +1 -0
- package/lib/db/interface.d.ts.map +1 -1
- package/lib/db/repositories/dataColumnSidecarArchive.d.ts +6 -0
- package/lib/db/repositories/dataColumnSidecarArchive.d.ts.map +1 -1
- package/lib/db/repositories/dataColumnSidecarArchive.js +19 -0
- package/lib/db/repositories/dataColumnSidecarArchive.js.map +1 -1
- package/lib/execution/engine/index.d.ts +1 -1
- package/lib/execution/engine/index.d.ts.map +1 -1
- package/lib/execution/engine/index.js +1 -1
- package/lib/execution/engine/index.js.map +1 -1
- package/lib/execution/engine/interface.d.ts +1 -1
- package/lib/execution/engine/interface.d.ts.map +1 -1
- package/lib/execution/engine/interface.js.map +1 -1
- package/lib/execution/engine/types.d.ts.map +1 -1
- package/lib/execution/engine/types.js +2 -2
- package/lib/execution/engine/types.js.map +1 -1
- package/lib/metrics/metrics/lodestar.d.ts +4 -0
- package/lib/metrics/metrics/lodestar.d.ts.map +1 -1
- package/lib/metrics/metrics/lodestar.js +10 -0
- package/lib/metrics/metrics/lodestar.js.map +1 -1
- package/lib/monitoring/service.js +1 -1
- package/lib/monitoring/service.js.map +1 -1
- package/lib/network/core/networkCore.d.ts +2 -0
- package/lib/network/core/networkCore.d.ts.map +1 -1
- package/lib/network/core/networkCore.js +3 -0
- package/lib/network/core/networkCore.js.map +1 -1
- package/lib/network/core/networkCoreWorker.js +1 -0
- package/lib/network/core/networkCoreWorker.js.map +1 -1
- package/lib/network/core/networkCoreWorkerHandler.d.ts +2 -0
- package/lib/network/core/networkCoreWorkerHandler.d.ts.map +1 -1
- package/lib/network/core/networkCoreWorkerHandler.js +3 -0
- package/lib/network/core/networkCoreWorkerHandler.js.map +1 -1
- package/lib/network/core/types.d.ts +2 -0
- package/lib/network/core/types.d.ts.map +1 -1
- package/lib/network/interface.d.ts +2 -0
- package/lib/network/interface.d.ts.map +1 -1
- package/lib/network/libp2p/index.d.ts.map +1 -1
- package/lib/network/libp2p/index.js +5 -1
- package/lib/network/libp2p/index.js.map +1 -1
- package/lib/network/network.d.ts +2 -0
- package/lib/network/network.d.ts.map +1 -1
- package/lib/network/network.js +6 -1
- package/lib/network/network.js.map +1 -1
- package/lib/network/options.d.ts +2 -0
- package/lib/network/options.d.ts.map +1 -1
- package/lib/network/options.js.map +1 -1
- package/lib/network/peers/peerManager.d.ts +2 -1
- package/lib/network/peers/peerManager.d.ts.map +1 -1
- package/lib/network/peers/peerManager.js.map +1 -1
- package/lib/network/peers/utils/assertPeerRelevance.d.ts +9 -1
- package/lib/network/peers/utils/assertPeerRelevance.d.ts.map +1 -1
- package/lib/network/peers/utils/assertPeerRelevance.js +32 -21
- package/lib/network/peers/utils/assertPeerRelevance.js.map +1 -1
- package/lib/network/processor/gossipHandlers.d.ts.map +1 -1
- package/lib/network/processor/gossipHandlers.js +9 -8
- package/lib/network/processor/gossipHandlers.js.map +1 -1
- package/lib/node/nodejs.d.ts +1 -1
- package/lib/node/nodejs.d.ts.map +1 -1
- package/lib/node/nodejs.js +10 -2
- package/lib/node/nodejs.js.map +1 -1
- package/lib/node/options.d.ts +1 -1
- package/lib/node/options.d.ts.map +1 -1
- package/lib/node/options.js +1 -1
- package/lib/node/options.js.map +1 -1
- package/lib/sync/interface.d.ts.map +1 -1
- package/lib/sync/interface.js.map +1 -1
- package/lib/sync/sync.d.ts +7 -0
- package/lib/sync/sync.d.ts.map +1 -1
- package/lib/sync/sync.js +61 -3
- package/lib/sync/sync.js.map +1 -1
- package/lib/util/file.d.ts.map +1 -1
- package/lib/util/file.js +8 -9
- package/lib/util/file.js.map +1 -1
- package/lib/util/queue/itemQueue.js +1 -1
- package/lib/util/queue/itemQueue.js.map +1 -1
- package/lib/util/sszBytes.js +2 -2
- package/lib/util/sszBytes.js.map +1 -1
- package/package.json +16 -17
- package/src/api/impl/beacon/blocks/index.ts +35 -45
- package/src/api/impl/beacon/pool/index.ts +5 -1
- package/src/api/impl/beacon/state/utils.ts +1 -1
- package/src/api/impl/validator/index.ts +4 -1
- package/src/chain/GetBlobsTracker.ts +97 -38
- package/src/chain/archiveStore/archiveStore.ts +1 -0
- package/src/chain/archiveStore/utils/archiveBlocks.ts +12 -4
- package/src/chain/blocks/importBlock.ts +8 -7
- package/src/chain/blocks/importExecutionPayload.ts +13 -21
- package/src/chain/blocks/index.ts +6 -2
- package/src/chain/blocks/payloadEnvelopeProcessor.ts +35 -24
- package/src/chain/blocks/types.ts +4 -1
- package/src/chain/blocks/verifyBlock.ts +31 -16
- package/src/chain/blocks/verifyBlocksDataAvailability.ts +10 -1
- package/src/chain/blocks/verifyBlocksSignatures.ts +7 -5
- package/src/chain/blocks/verifyPayloadsDataAvailability.ts +14 -6
- package/src/chain/bls/interface.ts +2 -0
- package/src/chain/bls/multithread/index.ts +14 -10
- package/src/chain/bls/multithread/types.ts +1 -1
- package/src/chain/bls/multithread/worker.ts +1 -5
- package/src/chain/bls/singleThread.ts +1 -1
- package/src/chain/bls/utils.ts +1 -1
- package/src/chain/chain.ts +5 -5
- package/src/chain/errors/blockError.ts +1 -1
- package/src/chain/interface.ts +2 -3
- package/src/chain/opPools/aggregatedAttestationPool.ts +25 -9
- package/src/chain/opPools/attestationPool.ts +16 -4
- package/src/chain/opPools/payloadAttestationPool.ts +18 -7
- package/src/chain/opPools/syncCommitteeMessagePool.ts +10 -3
- package/src/chain/opPools/syncContributionAndProofPool.ts +13 -3
- package/src/chain/opPools/utils.ts +1 -1
- package/src/chain/options.ts +0 -2
- package/src/chain/validation/executionPayloadBid.ts +14 -13
- package/src/db/beacon.ts +39 -0
- package/src/db/dataColumnStore.ts +2 -4
- package/src/db/flatFileStore/flatFileStore.ts +7 -7
- package/src/db/flatFileStore/slotIndex.ts +4 -3
- package/src/db/interface.ts +2 -0
- package/src/db/repositories/dataColumnSidecarArchive.ts +20 -0
- package/src/execution/engine/index.ts +1 -1
- package/src/execution/engine/interface.ts +1 -1
- package/src/execution/engine/types.ts +3 -1
- package/src/metrics/metrics/lodestar.ts +10 -0
- package/src/monitoring/service.ts +1 -1
- package/src/network/core/networkCore.ts +5 -0
- package/src/network/core/networkCoreWorker.ts +1 -0
- package/src/network/core/networkCoreWorkerHandler.ts +4 -0
- package/src/network/core/types.ts +2 -0
- package/src/network/interface.ts +2 -0
- package/src/network/libp2p/index.ts +5 -1
- package/src/network/network.ts +8 -1
- package/src/network/options.ts +2 -0
- package/src/network/peers/peerManager.ts +1 -1
- package/src/network/peers/utils/assertPeerRelevance.ts +39 -23
- package/src/network/processor/gossipHandlers.ts +9 -8
- package/src/node/nodejs.ts +24 -7
- package/src/node/options.ts +4 -5
- package/src/sync/interface.ts +1 -0
- package/src/sync/sync.ts +65 -4
- package/src/util/file.ts +8 -9
- package/src/util/queue/itemQueue.ts +1 -1
- package/src/util/sszBytes.ts +2 -2
|
@@ -22,6 +22,8 @@ export type VerifySignatureOpts = {
|
|
|
22
22
|
verifyOnMainThread?: boolean;
|
|
23
23
|
/**
|
|
24
24
|
* Some signature sets are more important than others, and should be verified first.
|
|
25
|
+
* Non-batchable priority jobs are posted to an idle worker before this call returns, so the caller
|
|
26
|
+
* can run synchronous work right after without delaying the verification.
|
|
25
27
|
*/
|
|
26
28
|
priority?: boolean;
|
|
27
29
|
};
|
|
@@ -333,16 +333,20 @@ export class BlsMultiThreadWorkerPool implements IBlsVerifier {
|
|
|
333
333
|
}
|
|
334
334
|
}
|
|
335
335
|
|
|
336
|
+
// First hand work to an idle worker before returning to the caller.
|
|
337
|
+
// Deferring the post to the next macrotask would make the worker
|
|
338
|
+
// sit idle while waiting for the next synchronous work
|
|
339
|
+
else if (job.opts.priority) {
|
|
340
|
+
this.jobs.unshift(job);
|
|
341
|
+
void this.runJob();
|
|
342
|
+
}
|
|
343
|
+
|
|
336
344
|
// Push job and schedule to call `runJob` in the next macro event loop cycle.
|
|
337
345
|
// This is useful to allow batching job submitted from a synchronous for loop,
|
|
338
346
|
// and to prevent large stacks since runJob may be called recursively.
|
|
339
347
|
else {
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
} else {
|
|
343
|
-
this.jobs.push(job);
|
|
344
|
-
}
|
|
345
|
-
callInNextEventLoop(this.runJob);
|
|
348
|
+
this.jobs.push(job);
|
|
349
|
+
callInNextEventLoop(() => void this.runJob());
|
|
346
350
|
}
|
|
347
351
|
}
|
|
348
352
|
|
|
@@ -377,7 +381,7 @@ export class BlsMultiThreadWorkerPool implements IBlsVerifier {
|
|
|
377
381
|
let completedJobsCount = 0;
|
|
378
382
|
|
|
379
383
|
if (this.jobs.length > 0) {
|
|
380
|
-
callInNextEventLoop(this.runJob);
|
|
384
|
+
callInNextEventLoop(() => void this.runJob());
|
|
381
385
|
}
|
|
382
386
|
|
|
383
387
|
try {
|
|
@@ -423,7 +427,7 @@ export class BlsMultiThreadWorkerPool implements IBlsVerifier {
|
|
|
423
427
|
if (workReqs.length === 0) {
|
|
424
428
|
worker.status = {code: WorkerStatusCode.idle, workerApi};
|
|
425
429
|
this.workersBusy--;
|
|
426
|
-
callInNextEventLoop(this.runJob);
|
|
430
|
+
callInNextEventLoop(() => void this.runJob());
|
|
427
431
|
return;
|
|
428
432
|
}
|
|
429
433
|
|
|
@@ -499,7 +503,7 @@ export class BlsMultiThreadWorkerPool implements IBlsVerifier {
|
|
|
499
503
|
this.workersBusy--;
|
|
500
504
|
|
|
501
505
|
// Potentially run a new job
|
|
502
|
-
callInNextEventLoop(this.runJob);
|
|
506
|
+
callInNextEventLoop(() => void this.runJob());
|
|
503
507
|
};
|
|
504
508
|
|
|
505
509
|
/**
|
|
@@ -542,7 +546,7 @@ export class BlsMultiThreadWorkerPool implements IBlsVerifier {
|
|
|
542
546
|
this.jobs.unshift(job);
|
|
543
547
|
}
|
|
544
548
|
this.bufferedJobs = null;
|
|
545
|
-
callInNextEventLoop(this.runJob);
|
|
549
|
+
callInNextEventLoop(() => void this.runJob());
|
|
546
550
|
}
|
|
547
551
|
};
|
|
548
552
|
|
|
@@ -1,10 +1,6 @@
|
|
|
1
1
|
import worker from "node:worker_threads";
|
|
2
|
-
import {
|
|
3
|
-
type BlsSignatureSet,
|
|
4
|
-
verifySignatureSets,
|
|
5
|
-
verifySignatureSetsSameMessage,
|
|
6
|
-
} from "@chainsafe/lodestar-z/bls-verifier";
|
|
7
2
|
import {expose} from "@chainsafe/threads/worker";
|
|
3
|
+
import {type BlsSignatureSet, verifySignatureSets, verifySignatureSetsSameMessage} from "@lodestar/native/bls-verifier";
|
|
8
4
|
import {
|
|
9
5
|
BlsWorkReq,
|
|
10
6
|
BlsWorkResult,
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import {verifySignatureSetsSameMessage} from "@
|
|
1
|
+
import {verifySignatureSetsSameMessage} from "@lodestar/native/bls-verifier";
|
|
2
2
|
import {ISignatureSet} from "@lodestar/state-transition";
|
|
3
3
|
import {Metrics} from "../../metrics/index.js";
|
|
4
4
|
import {IBlsVerifier, SameMessageSignatureSet} from "./interface.js";
|
package/src/chain/bls/utils.ts
CHANGED
|
@@ -2,7 +2,7 @@ import {
|
|
|
2
2
|
BLS_VERIFIER_MAX_BATCH_SIZE,
|
|
3
3
|
BLS_VERIFIER_MAX_SAME_MESSAGE_BATCH_SIZE,
|
|
4
4
|
verifySignatureSets,
|
|
5
|
-
} from "@
|
|
5
|
+
} from "@lodestar/native/bls-verifier";
|
|
6
6
|
import {ISignatureSet, SignatureSetType, toBlsSignatureSet} from "@lodestar/state-transition";
|
|
7
7
|
import {SameMessageSignatureSet} from "./interface.js";
|
|
8
8
|
|
package/src/chain/chain.ts
CHANGED
|
@@ -1,6 +1,5 @@
|
|
|
1
1
|
import path from "node:path";
|
|
2
2
|
import {PrivateKey} from "@libp2p/interface";
|
|
3
|
-
import {type PubkeyCache} from "@chainsafe/lodestar-z/pubkeys";
|
|
4
3
|
import {Type} from "@chainsafe/ssz";
|
|
5
4
|
import {routes} from "@lodestar/api";
|
|
6
5
|
import {BeaconConfig} from "@lodestar/config";
|
|
@@ -14,6 +13,7 @@ import {
|
|
|
14
13
|
UpdateHeadOpt,
|
|
15
14
|
} from "@lodestar/fork-choice";
|
|
16
15
|
import {LoggerNode} from "@lodestar/logger/node";
|
|
16
|
+
import {type PubkeyCache} from "@lodestar/native/pubkeys";
|
|
17
17
|
import {
|
|
18
18
|
EFFECTIVE_BALANCE_INCREMENT,
|
|
19
19
|
type ForkPostFulu,
|
|
@@ -1486,10 +1486,10 @@ export class BeaconChain implements IBeaconChain {
|
|
|
1486
1486
|
this.metrics?.forkChoice.requests.inc();
|
|
1487
1487
|
const timer = this.metrics?.forkChoice.findHead.startTimer({caller: FindHeadFnName.predictProposerHead});
|
|
1488
1488
|
const slot = this.clock.currentSlot;
|
|
1489
|
-
const
|
|
1489
|
+
const msFromSlot = this.clock.msFromSlot(slot);
|
|
1490
1490
|
|
|
1491
1491
|
try {
|
|
1492
|
-
return this.forkChoice.updateAndGetHead({mode: UpdateHeadOpt.GetPredictedProposerHead,
|
|
1492
|
+
return this.forkChoice.updateAndGetHead({mode: UpdateHeadOpt.GetPredictedProposerHead, msFromSlot, slot}).head;
|
|
1493
1493
|
} catch (e) {
|
|
1494
1494
|
this.metrics?.forkChoice.errors.inc({entrypoint: UpdateHeadOpt.GetPredictedProposerHead});
|
|
1495
1495
|
throw e;
|
|
@@ -1501,13 +1501,13 @@ export class BeaconChain implements IBeaconChain {
|
|
|
1501
1501
|
getProposerHead(slot: Slot): ProtoBlock {
|
|
1502
1502
|
this.metrics?.forkChoice.requests.inc();
|
|
1503
1503
|
const timer = this.metrics?.forkChoice.findHead.startTimer({caller: FindHeadFnName.getProposerHead});
|
|
1504
|
-
const
|
|
1504
|
+
const msFromSlot = this.clock.msFromSlot(slot);
|
|
1505
1505
|
|
|
1506
1506
|
try {
|
|
1507
1507
|
// Do not emit head event here, when proposing we rely on the one emitted when importing our own block
|
|
1508
1508
|
const {head, isHeadTimely, notReorgedReason} = this.forkChoice.updateAndGetHead({
|
|
1509
1509
|
mode: UpdateHeadOpt.GetProposerHead,
|
|
1510
|
-
|
|
1510
|
+
msFromSlot,
|
|
1511
1511
|
slot,
|
|
1512
1512
|
});
|
|
1513
1513
|
|
|
@@ -72,7 +72,7 @@ export enum BlockErrorCode {
|
|
|
72
72
|
* whoever served the block MAY be downscored. Mirrors PayloadErrorCode.EXECUTION_ENGINE_INVALID.
|
|
73
73
|
*/
|
|
74
74
|
EXECUTION_ENGINE_INVALID = "BLOCK_ERROR_EXECUTION_INVALID",
|
|
75
|
-
/** The
|
|
75
|
+
/** The blob or column data did not arrive within the availability wait */
|
|
76
76
|
DATA_UNAVAILABLE = "BLOCK_ERROR_DATA_UNAVAILABLE",
|
|
77
77
|
/** Block contains too many kzg commitments */
|
|
78
78
|
TOO_MANY_KZG_COMMITMENTS = "BLOCK_ERROR_TOO_MANY_KZG_COMMITMENTS",
|
package/src/chain/interface.ts
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
import {type PubkeyCache} from "@chainsafe/lodestar-z/pubkeys";
|
|
2
1
|
import {Type} from "@chainsafe/ssz";
|
|
3
2
|
import {BeaconConfig} from "@lodestar/config";
|
|
4
3
|
import {CheckpointWithHex, IForkChoice, ProtoBlock} from "@lodestar/fork-choice";
|
|
4
|
+
import {type PubkeyCache} from "@lodestar/native/pubkeys";
|
|
5
5
|
import {EpochShuffling, IBeaconStateView} from "@lodestar/state-transition";
|
|
6
6
|
import {
|
|
7
7
|
BeaconBlock,
|
|
@@ -77,8 +77,7 @@ import {PayloadEnvelopeInput, SeenPayloadEnvelopeInput} from "./seenCache/seenPa
|
|
|
77
77
|
import {ShufflingCache} from "./shufflingCache.js";
|
|
78
78
|
import {ValidatorMonitor} from "./validatorMonitor.js";
|
|
79
79
|
|
|
80
|
-
export {BlockType, type
|
|
81
|
-
export {type ProposerPreparationData};
|
|
80
|
+
export {type AssembledBlockType, BlockType, type ProposerPreparationData};
|
|
82
81
|
export type BlockHash = RootHex;
|
|
83
82
|
|
|
84
83
|
export type StateGetOpts = {
|
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
import {Signature, aggregateSignatures} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BitArray} from "@chainsafe/ssz";
|
|
3
2
|
import {BeaconConfig} from "@lodestar/config";
|
|
4
3
|
import {IForkChoice} from "@lodestar/fork-choice";
|
|
4
|
+
import {Signature, aggregateSignatures} from "@lodestar/native/blst";
|
|
5
5
|
import {
|
|
6
6
|
ForkName,
|
|
7
7
|
ForkSeq,
|
|
@@ -20,6 +20,7 @@ import {
|
|
|
20
20
|
} from "@lodestar/params";
|
|
21
21
|
import {
|
|
22
22
|
EffectiveBalanceIncrements,
|
|
23
|
+
G2_POINT_AT_INFINITY,
|
|
23
24
|
IBeaconStateView,
|
|
24
25
|
RootCache,
|
|
25
26
|
computeEpochAtSlot,
|
|
@@ -30,7 +31,7 @@ import {
|
|
|
30
31
|
isStatePostGloas,
|
|
31
32
|
} from "@lodestar/state-transition";
|
|
32
33
|
import {Attestation, Epoch, RootHex, Slot, electra, isElectraAttestation, phase0, ssz} from "@lodestar/types";
|
|
33
|
-
import {Logger, MapDef, assert, toRootHex} from "@lodestar/utils";
|
|
34
|
+
import {Logger, MapDef, assert, byteArrayEquals, toRootHex} from "@lodestar/utils";
|
|
34
35
|
import {Metrics} from "../../metrics/metrics.js";
|
|
35
36
|
import {IntersectResult, intersectUint8Arrays} from "../../util/bitArray.js";
|
|
36
37
|
import {getShufflingDependentRoot} from "../../util/dependentRoot.js";
|
|
@@ -409,20 +410,34 @@ export class AggregatedAttestationPool {
|
|
|
409
410
|
|
|
410
411
|
const sortedConsolidationsByScore = Array.from(consolidations.entries())
|
|
411
412
|
.sort((a, b) => b[1] - a[1])
|
|
412
|
-
.map(([consolidation, _]) => consolidation)
|
|
413
|
-
.slice(0, MAX_ATTESTATIONS_ELECTRA);
|
|
413
|
+
.map(([consolidation, _]) => consolidation);
|
|
414
414
|
|
|
415
415
|
// on chain aggregation is expensive, only do it after all
|
|
416
416
|
const packedAttestationsMetrics = this.metrics?.opPool.aggregatedAttestationPool.packedAttestations;
|
|
417
|
-
const packedAttestations: electra.Attestation[] =
|
|
418
|
-
for (const
|
|
419
|
-
packedAttestations
|
|
417
|
+
const packedAttestations: electra.Attestation[] = [];
|
|
418
|
+
for (const consolidation of sortedConsolidationsByScore) {
|
|
419
|
+
if (packedAttestations.length >= MAX_ATTESTATIONS_ELECTRA) {
|
|
420
|
+
break;
|
|
421
|
+
}
|
|
422
|
+
|
|
423
|
+
const attestation = aggregateConsolidation(consolidation);
|
|
424
|
+
// The point at infinity is not a valid aggregate signature, exclude it from the block
|
|
425
|
+
if (byteArrayEquals(attestation.signature, G2_POINT_AT_INFINITY)) {
|
|
426
|
+
this.logger?.debug("Excluding aggregate with infinity signature", {
|
|
427
|
+
slot: stateSlot,
|
|
428
|
+
attestationSlot: attestation.data.slot,
|
|
429
|
+
committees: consolidation.byCommittee.size,
|
|
430
|
+
});
|
|
431
|
+
continue;
|
|
432
|
+
}
|
|
433
|
+
|
|
434
|
+
const i = packedAttestations.push(attestation) - 1;
|
|
420
435
|
|
|
421
436
|
// record metrics of packed attestations
|
|
422
437
|
packedAttestationsMetrics?.committeeCount.set({index: i}, consolidation.byCommittee.size);
|
|
423
438
|
packedAttestationsMetrics?.totalAttesters.set({index: i}, consolidation.totalAttesters);
|
|
424
439
|
packedAttestationsMetrics?.nonParticipation.set({index: i}, consolidation.notSeenAttesters);
|
|
425
|
-
packedAttestationsMetrics?.inclusionDistance.set({index: i}, stateSlot -
|
|
440
|
+
packedAttestationsMetrics?.inclusionDistance.set({index: i}, stateSlot - attestation.data.slot);
|
|
426
441
|
packedAttestationsMetrics?.newSeenAttesters.set({index: i}, consolidation.newSeenAttesters);
|
|
427
442
|
packedAttestationsMetrics?.totalEffectiveBalance.set({index: i}, consolidation.totalNewSeenEffectiveBalance);
|
|
428
443
|
}
|
|
@@ -462,7 +477,8 @@ export class AggregatedAttestationPool {
|
|
|
462
477
|
attestations.push(...attestationGroup.getAttestations());
|
|
463
478
|
}
|
|
464
479
|
}
|
|
465
|
-
|
|
480
|
+
// The point at infinity is not a valid aggregate signature, do not serve such an aggregate
|
|
481
|
+
return attestations.filter((attestation) => !byteArrayEquals(attestation.signature, G2_POINT_AT_INFINITY));
|
|
466
482
|
}
|
|
467
483
|
|
|
468
484
|
private onScrapeMetrics(metrics: Metrics): void {
|
|
@@ -1,9 +1,10 @@
|
|
|
1
|
-
import {Signature, aggregateSignatures} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BitArray} from "@chainsafe/ssz";
|
|
3
2
|
import {ChainForkConfig} from "@lodestar/config";
|
|
3
|
+
import {Signature, aggregateSignatures} from "@lodestar/native/blst";
|
|
4
4
|
import {MAX_COMMITTEES_PER_SLOT, isForkPostElectra} from "@lodestar/params";
|
|
5
|
+
import {G2_POINT_AT_INFINITY} from "@lodestar/state-transition";
|
|
5
6
|
import {Attestation, RootHex, SingleAttestation, Slot, isElectraSingleAttestation} from "@lodestar/types";
|
|
6
|
-
import {MapDef, assert} from "@lodestar/utils";
|
|
7
|
+
import {MapDef, assert, byteArrayEquals} from "@lodestar/utils";
|
|
7
8
|
import {Metrics} from "../../metrics/metrics.js";
|
|
8
9
|
import {IClock} from "../../util/clock.js";
|
|
9
10
|
import {InsertOutcome, OpPoolError, OpPoolErrorCode} from "./types.js";
|
|
@@ -180,7 +181,13 @@ export class AttestationPool {
|
|
|
180
181
|
assert.true(!isElectraAggregate(aggregate), "Aggregate should be type AggregateFastPhase0");
|
|
181
182
|
}
|
|
182
183
|
|
|
183
|
-
|
|
184
|
+
const attestation = fastToAttestation(aggregate);
|
|
185
|
+
// The point at infinity is not a valid aggregate signature, do not serve such an aggregate
|
|
186
|
+
if (byteArrayEquals(attestation.signature, G2_POINT_AT_INFINITY)) {
|
|
187
|
+
return null;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
return attestation;
|
|
184
191
|
}
|
|
185
192
|
|
|
186
193
|
/**
|
|
@@ -209,7 +216,12 @@ export class AttestationPool {
|
|
|
209
216
|
if (aggregateByRoot) {
|
|
210
217
|
for (const aggFastByIndex of aggregateByRoot.values()) {
|
|
211
218
|
for (const aggFast of aggFastByIndex.values()) {
|
|
212
|
-
|
|
219
|
+
const attestation = fastToAttestation(aggFast);
|
|
220
|
+
// The point at infinity is not a valid aggregate signature, do not serve such an aggregate
|
|
221
|
+
if (byteArrayEquals(attestation.signature, G2_POINT_AT_INFINITY)) {
|
|
222
|
+
continue;
|
|
223
|
+
}
|
|
224
|
+
attestations.push(attestation);
|
|
213
225
|
}
|
|
214
226
|
}
|
|
215
227
|
}
|
|
@@ -1,9 +1,10 @@
|
|
|
1
|
-
import {Signature, aggregateSignatures} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BitArray} from "@chainsafe/ssz";
|
|
3
2
|
import {ChainForkConfig} from "@lodestar/config";
|
|
3
|
+
import {Signature, aggregateSignatures} from "@lodestar/native/blst";
|
|
4
4
|
import {MAX_COMMITTEES_PER_SLOT, MAX_PAYLOAD_ATTESTATIONS, PTC_SIZE} from "@lodestar/params";
|
|
5
|
+
import {G2_POINT_AT_INFINITY} from "@lodestar/state-transition";
|
|
5
6
|
import {RootHex, Slot, gloas} from "@lodestar/types";
|
|
6
|
-
import {MapDef, toRootHex} from "@lodestar/utils";
|
|
7
|
+
import {MapDef, byteArrayEquals, toRootHex} from "@lodestar/utils";
|
|
7
8
|
import {Metrics} from "../../metrics/metrics.js";
|
|
8
9
|
import {IClock} from "../../util/clock.js";
|
|
9
10
|
import {InsertOutcome, OpPoolError, OpPoolErrorCode} from "./types.js";
|
|
@@ -112,11 +113,19 @@ export class PayloadAttestationPool {
|
|
|
112
113
|
return [];
|
|
113
114
|
}
|
|
114
115
|
|
|
115
|
-
|
|
116
|
-
|
|
116
|
+
const payloadAttestations: gloas.PayloadAttestation[] = [];
|
|
117
|
+
for (const aggregate of aggregateByDataRoot.values()) {
|
|
118
|
+
const payloadAttestation = fastToPayloadAttestation(aggregate);
|
|
119
|
+
// The point at infinity is not a valid aggregate signature, exclude it from the block
|
|
120
|
+
if (byteArrayEquals(payloadAttestation.signature, G2_POINT_AT_INFINITY)) {
|
|
121
|
+
continue;
|
|
122
|
+
}
|
|
123
|
+
payloadAttestations.push(payloadAttestation);
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
return payloadAttestations
|
|
117
127
|
.sort((a, b) => b.aggregationBits.getTrueBitIndexes().length - a.aggregationBits.getTrueBitIndexes().length)
|
|
118
|
-
.slice(0, MAX_PAYLOAD_ATTESTATIONS)
|
|
119
|
-
.map(fastToPayloadAttestation);
|
|
128
|
+
.slice(0, MAX_PAYLOAD_ATTESTATIONS);
|
|
120
129
|
}
|
|
121
130
|
|
|
122
131
|
getAll(slot?: Slot): gloas.PayloadAttestation[] {
|
|
@@ -139,9 +148,11 @@ export class PayloadAttestationPool {
|
|
|
139
148
|
}
|
|
140
149
|
}
|
|
141
150
|
|
|
151
|
+
// The point at infinity is not a valid aggregate signature, do not serve such an aggregate
|
|
142
152
|
return aggregates
|
|
143
153
|
.sort((a, b) => b.aggregationBits.getTrueBitIndexes().length - a.aggregationBits.getTrueBitIndexes().length)
|
|
144
|
-
.map(fastToPayloadAttestation)
|
|
154
|
+
.map(fastToPayloadAttestation)
|
|
155
|
+
.filter((attestation) => !byteArrayEquals(attestation.signature, G2_POINT_AT_INFINITY));
|
|
145
156
|
}
|
|
146
157
|
|
|
147
158
|
prune(clockSlot: Slot): void {
|
|
@@ -1,9 +1,10 @@
|
|
|
1
|
-
import {Signature, aggregateSignatures} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BitArray} from "@chainsafe/ssz";
|
|
3
2
|
import {ChainForkConfig} from "@lodestar/config";
|
|
3
|
+
import {Signature, aggregateSignatures} from "@lodestar/native/blst";
|
|
4
4
|
import {SYNC_COMMITTEE_SIZE, SYNC_COMMITTEE_SUBNET_COUNT} from "@lodestar/params";
|
|
5
|
+
import {G2_POINT_AT_INFINITY} from "@lodestar/state-transition";
|
|
5
6
|
import {Root, Slot, SubcommitteeIndex, SubnetID, altair} from "@lodestar/types";
|
|
6
|
-
import {MapDef, toRootHex} from "@lodestar/utils";
|
|
7
|
+
import {MapDef, byteArrayEquals, toRootHex} from "@lodestar/utils";
|
|
7
8
|
import {IClock} from "../../util/clock.js";
|
|
8
9
|
import {InsertOutcome, OpPoolError, OpPoolErrorCode} from "./types.js";
|
|
9
10
|
import {pruneBySlot, signatureFromBytesNoCheck} from "./utils.js";
|
|
@@ -110,10 +111,16 @@ export class SyncCommitteeMessagePool {
|
|
|
110
111
|
return null;
|
|
111
112
|
}
|
|
112
113
|
|
|
114
|
+
const signature = contribution.signature.toBytes();
|
|
115
|
+
// The point at infinity is not a valid contribution signature, do not serve such a contribution
|
|
116
|
+
if (byteArrayEquals(signature, G2_POINT_AT_INFINITY)) {
|
|
117
|
+
return null;
|
|
118
|
+
}
|
|
119
|
+
|
|
113
120
|
return {
|
|
114
121
|
...contribution,
|
|
115
122
|
aggregationBits: contribution.aggregationBits,
|
|
116
|
-
signature
|
|
123
|
+
signature,
|
|
117
124
|
};
|
|
118
125
|
}
|
|
119
126
|
|
|
@@ -1,10 +1,10 @@
|
|
|
1
|
-
import {Signature, aggregateSignatures} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BitArray} from "@chainsafe/ssz";
|
|
3
2
|
import {ChainForkConfig} from "@lodestar/config";
|
|
3
|
+
import {Signature, aggregateSignatures} from "@lodestar/native/blst";
|
|
4
4
|
import {SYNC_COMMITTEE_SIZE, SYNC_COMMITTEE_SUBNET_SIZE} from "@lodestar/params";
|
|
5
5
|
import {G2_POINT_AT_INFINITY} from "@lodestar/state-transition";
|
|
6
6
|
import {Root, Slot, SubnetID, altair, ssz} from "@lodestar/types";
|
|
7
|
-
import {Logger, MapDef, toRootHex} from "@lodestar/utils";
|
|
7
|
+
import {Logger, MapDef, byteArrayEquals, toRootHex} from "@lodestar/utils";
|
|
8
8
|
import {Metrics} from "../../metrics/metrics.js";
|
|
9
9
|
import {IClock} from "../../util/clock.js";
|
|
10
10
|
import {InsertOutcome, OpPoolError, OpPoolErrorCode} from "./types.js";
|
|
@@ -234,8 +234,18 @@ export function aggregate(
|
|
|
234
234
|
}
|
|
235
235
|
|
|
236
236
|
metrics?.opPool.syncContributionAndProofPool.getAggregateParticipants.set(participationCount);
|
|
237
|
+
|
|
238
|
+
const syncCommitteeSignature = aggregateSignatures(signatures).toBytes();
|
|
239
|
+
// The point at infinity is only a valid sync aggregate signature with empty participation bits
|
|
240
|
+
if (byteArrayEquals(syncCommitteeSignature, G2_POINT_AT_INFINITY)) {
|
|
241
|
+
return {
|
|
242
|
+
syncCommitteeBits: BitArray.fromBitLen(SYNC_COMMITTEE_SIZE),
|
|
243
|
+
syncCommitteeSignature,
|
|
244
|
+
};
|
|
245
|
+
}
|
|
246
|
+
|
|
237
247
|
return {
|
|
238
248
|
syncCommitteeBits,
|
|
239
|
-
syncCommitteeSignature
|
|
249
|
+
syncCommitteeSignature,
|
|
240
250
|
};
|
|
241
251
|
}
|
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import {Signature} from "@chainsafe/lodestar-z/blst";
|
|
2
1
|
import {BeaconConfig} from "@lodestar/config";
|
|
3
2
|
import {DbBatch, Id, Repository} from "@lodestar/db";
|
|
3
|
+
import {Signature} from "@lodestar/native/blst";
|
|
4
4
|
import {BLS_WITHDRAWAL_PREFIX, DOMAIN_BEACON_ATTESTER, DOMAIN_BEACON_PROPOSER} from "@lodestar/params";
|
|
5
5
|
import {IBeaconStateView, computeStartSlotAtEpoch} from "@lodestar/state-transition";
|
|
6
6
|
import {AttesterSlashing, Domain, Slot, capella, phase0} from "@lodestar/types";
|
package/src/chain/options.ts
CHANGED
|
@@ -48,7 +48,6 @@ export type IChainOptions = BlockProcessOpts &
|
|
|
48
48
|
/** Max number of produced block roots (blinded or full) cached for broadcast validations */
|
|
49
49
|
maxCachedProducedRoots?: number;
|
|
50
50
|
initialCustodyGroupCount?: number;
|
|
51
|
-
broadcastValidationStrictness?: string;
|
|
52
51
|
minSameMessageSignatureSetsToBatch: number;
|
|
53
52
|
archiveDateEpochs?: number;
|
|
54
53
|
nHistoricalStatesFileDataStore?: boolean;
|
|
@@ -121,7 +120,6 @@ export const defaultChainOptions: IChainOptions = {
|
|
|
121
120
|
// for attestation validation, having this value ensures we don't have to regen states most of the time
|
|
122
121
|
maxSkipSlots: 32,
|
|
123
122
|
disableProposerSlashings: false,
|
|
124
|
-
broadcastValidationStrictness: "warn",
|
|
125
123
|
// should be less than or equal to MIN_SIGNATURE_SETS_TO_BATCH_VERIFY
|
|
126
124
|
// batching too much may block the I/O thread so if useWorker=false, suggest this value to be 32
|
|
127
125
|
// since this batch attestation work is designed to work with useWorker=true, make this the lowest value
|
|
@@ -179,6 +179,20 @@ async function validateExecutionPayloadBid(
|
|
|
179
179
|
});
|
|
180
180
|
}
|
|
181
181
|
|
|
182
|
+
// [IGNORE] this bid is the highest value bid seen for the tuple
|
|
183
|
+
// `(bid.slot, bid.parent_block_hash, bid.parent_block_root)`.
|
|
184
|
+
// As a DoS prevention measure, the bid must also exceed the current highest bid by a minimum
|
|
185
|
+
// increment, see https://github.com/ethereum/consensus-specs/pull/4831. This prevents spam
|
|
186
|
+
// from builders submitting numerous bids with minimal value increments.
|
|
187
|
+
const bestBid = chain.executionPayloadBidPool.getBestBid(bid.slot, bidParentBlockHash, bidParentBlockRoot);
|
|
188
|
+
if (bestBid !== null && bid.value < getMinBidValue(bestBid.signedBid.message.value)) {
|
|
189
|
+
throw new ExecutionPayloadBidError(GossipAction.IGNORE, {
|
|
190
|
+
code: ExecutionPayloadBidErrorCode.BID_TOO_LOW,
|
|
191
|
+
bidValue: bid.value,
|
|
192
|
+
currentHighestBid: bestBid.signedBid.message.value,
|
|
193
|
+
});
|
|
194
|
+
}
|
|
195
|
+
|
|
182
196
|
// [IGNORE] `bid.parent_block_root` is the hash tree root of a known beacon block in fork choice.
|
|
183
197
|
// Moved earlier than the spec ordering so we can derive the proposer dependent root for the
|
|
184
198
|
// proposer-preferences lookup below from a known fork-choice block.
|
|
@@ -352,19 +366,6 @@ async function validateExecutionPayloadBid(
|
|
|
352
366
|
});
|
|
353
367
|
}
|
|
354
368
|
|
|
355
|
-
// [IGNORE] this bid is the highest value bid seen for the tuple
|
|
356
|
-
// `(bid.slot, bid.parent_block_hash, bid.parent_block_root)`.
|
|
357
|
-
// As a DoS prevention measure, the bid must also exceed the current highest bid by a minimum
|
|
358
|
-
// increment, see https://github.com/ethereum/consensus-specs/pull/4831. This prevents spam
|
|
359
|
-
// from builders submitting numerous bids with minimal value increments.
|
|
360
|
-
const bestBid = chain.executionPayloadBidPool.getBestBid(bid.slot, bidParentBlockHash, bidParentBlockRoot);
|
|
361
|
-
if (bestBid !== null && bid.value < getMinBidValue(bestBid.signedBid.message.value)) {
|
|
362
|
-
throw new ExecutionPayloadBidError(GossipAction.IGNORE, {
|
|
363
|
-
code: ExecutionPayloadBidErrorCode.BID_TOO_LOW,
|
|
364
|
-
bidValue: bid.value,
|
|
365
|
-
currentHighestBid: bestBid.signedBid.message.value,
|
|
366
|
-
});
|
|
367
|
-
}
|
|
368
369
|
// [IGNORE] `bid.value` is less or equal than the builder's excess balance --
|
|
369
370
|
// i.e. `can_builder_cover_bid(state, builder_index, amount)` returns `True`.
|
|
370
371
|
if (!state.canBuilderCoverBid(bid.builderIndex, bid.value)) {
|
package/src/db/beacon.ts
CHANGED
|
@@ -30,6 +30,9 @@ import {
|
|
|
30
30
|
VoluntaryExitRepository,
|
|
31
31
|
} from "./repositories/index.js";
|
|
32
32
|
|
|
33
|
+
/** Below this size, seeks over leftover legacy column data stay cheap */
|
|
34
|
+
const LEGACY_DATA_COLUMNS_COMPACTION_MIN_BYTES = 1024 ** 3;
|
|
35
|
+
|
|
33
36
|
export type BeaconDbOpts = {
|
|
34
37
|
dataColumnDir: string;
|
|
35
38
|
logger: Logger;
|
|
@@ -67,6 +70,7 @@ export class BeaconDb implements IBeaconDb {
|
|
|
67
70
|
readonly dataColumns: IDataColumnStore;
|
|
68
71
|
lastLegacyArchiveSlot: Slot | null = null;
|
|
69
72
|
private readonly flatFileStore: FlatFileStore;
|
|
73
|
+
private readonly logger: Logger;
|
|
70
74
|
|
|
71
75
|
constructor(
|
|
72
76
|
config: ChainForkConfig,
|
|
@@ -100,6 +104,7 @@ export class BeaconDb implements IBeaconDb {
|
|
|
100
104
|
this.syncCommittee = new SyncCommitteeRepository(config, db);
|
|
101
105
|
this.syncCommitteeWitness = new SyncCommitteeWitnessRepository(config, db);
|
|
102
106
|
|
|
107
|
+
this.logger = opts.logger;
|
|
103
108
|
this.flatFileStore = new FlatFileStore(opts.dataColumnDir, config, opts.logger, opts.metrics);
|
|
104
109
|
this.dataColumns = new LegacyDataColumnStore(
|
|
105
110
|
this.flatFileStore,
|
|
@@ -125,6 +130,40 @@ export class BeaconDb implements IBeaconDb {
|
|
|
125
130
|
this.flatFileStore.setMetrics(flatFileStoreMetrics);
|
|
126
131
|
}
|
|
127
132
|
|
|
133
|
+
/**
|
|
134
|
+
* Deletes made while an iterator held a snapshot can stay in the bottom LevelDB level, which `compactRange` never
|
|
135
|
+
* rewrites, so every seek into the legacy column buckets walks them. Writing a key at each end of the pruned range
|
|
136
|
+
* makes the compaction overlap those files and rewrite them.
|
|
137
|
+
*/
|
|
138
|
+
async compactLegacyDataColumns(
|
|
139
|
+
prunedBeforeSlot: Slot,
|
|
140
|
+
minSizeBytes = LEGACY_DATA_COLUMNS_COMPACTION_MIN_BYTES
|
|
141
|
+
): Promise<void> {
|
|
142
|
+
const archiveBucket = Bucket.allForks_dataColumnSidecarsArchive;
|
|
143
|
+
const start = encodeKey(Bucket.allForks_dataColumnSidecars, Buffer.alloc(0));
|
|
144
|
+
const end = encodeKey(archiveBucket, this.dataColumnSidecarArchive.getMinKeyRaw(prunedBeforeSlot));
|
|
145
|
+
const sizeBytes = await this.db.approximateSize(start, end);
|
|
146
|
+
if (sizeBytes < minSizeBytes) return;
|
|
147
|
+
|
|
148
|
+
// Column indices stay below 0xffff and hot column keys are shorter, so no sentinel matches a real key
|
|
149
|
+
const upperSentinel =
|
|
150
|
+
prunedBeforeSlot > 0
|
|
151
|
+
? encodeKey(archiveBucket, this.dataColumnSidecarArchive.encodeKeyRaw(prunedBeforeSlot - 1, 0xffff))
|
|
152
|
+
: encodeKey(Bucket.allForks_dataColumnSidecars, Buffer.alloc(35, 0xff));
|
|
153
|
+
const sentinels = [start, upperSentinel];
|
|
154
|
+
|
|
155
|
+
this.logger.info("Compacting legacy data columns, this may take a while", {sizeBytes});
|
|
156
|
+
const startTime = Date.now();
|
|
157
|
+
await this.db.batchPut(sentinels.map((key) => ({key, value: new Uint8Array()})));
|
|
158
|
+
await this.db.compactRange(start, end);
|
|
159
|
+
await this.db.batchDelete(sentinels);
|
|
160
|
+
await this.db.compactRange(start, end);
|
|
161
|
+
this.logger.verbose("Compacted legacy data columns", {
|
|
162
|
+
durationMs: Date.now() - startTime,
|
|
163
|
+
sizeBytes: await this.db.approximateSize(start, end),
|
|
164
|
+
});
|
|
165
|
+
}
|
|
166
|
+
|
|
128
167
|
async pruneHotDb(): Promise<void> {
|
|
129
168
|
// Prune all hot blobs
|
|
130
169
|
await this.blobSidecars.batchDelete(await this.blobSidecars.keys());
|
|
@@ -13,7 +13,7 @@ export type IndexedDataColumnBytes = {index: ColumnIndex; data: Uint8Array};
|
|
|
13
13
|
type LegacyHotDataColumnStore = Pick<DataColumnSidecarRepository, "values" | "getManyBinary" | "deleteMany">;
|
|
14
14
|
type LegacyArchiveDataColumnStore = Pick<
|
|
15
15
|
DataColumnSidecarArchiveRepository,
|
|
16
|
-
"values" | "getManyBinary" | "
|
|
16
|
+
"values" | "getManyBinary" | "pruneBefore"
|
|
17
17
|
>;
|
|
18
18
|
type BlockRootIndex = Pick<BlockArchiveRepository, "getSlotByRoot">;
|
|
19
19
|
|
|
@@ -86,9 +86,7 @@ export class LegacyDataColumnStore implements IDataColumnStore {
|
|
|
86
86
|
|
|
87
87
|
async pruneBefore(slot: Slot): Promise<Slot[]> {
|
|
88
88
|
const flatFileSlots = await this.flatFiles.pruneBefore(slot);
|
|
89
|
-
const
|
|
90
|
-
const slots = [...new Set(prefixedKeys.map(({prefix}) => prefix))];
|
|
91
|
-
if (slots.length > 0) await this.legacyArchive.deleteMany(slots);
|
|
89
|
+
const slots = await this.legacyArchive.pruneBefore(slot);
|
|
92
90
|
return [...new Set([...flatFileSlots, ...slots])].sort((a, b) => a - b);
|
|
93
91
|
}
|
|
94
92
|
}
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import
|
|
1
|
+
import {type FileHandle, open, readFile, rm} from "node:fs/promises";
|
|
2
2
|
import path from "node:path";
|
|
3
3
|
import {ChainForkConfig} from "@lodestar/config";
|
|
4
4
|
import {ForkPostFulu} from "@lodestar/params";
|
|
@@ -172,7 +172,7 @@ export class FlatFileStore implements IFlatFileStore {
|
|
|
172
172
|
for (const slot of slotsToPrune) {
|
|
173
173
|
const release = await this.acquireMutationLock(slot);
|
|
174
174
|
try {
|
|
175
|
-
await
|
|
175
|
+
await rm(path.join(this.dataColumnDir, padSlot(slot)), {recursive: true, force: true});
|
|
176
176
|
this.slotIndex.remove(slot);
|
|
177
177
|
this.metrics?.prunedDirectories.inc();
|
|
178
178
|
} finally {
|
|
@@ -212,7 +212,7 @@ export class FlatFileStore implements IFlatFileStore {
|
|
|
212
212
|
|
|
213
213
|
private async readFile(slot: Slot, rootHex: RootHex): Promise<Uint8Array | null> {
|
|
214
214
|
try {
|
|
215
|
-
return await
|
|
215
|
+
return await readFile(this.filePath(slot, rootHex));
|
|
216
216
|
} catch (e) {
|
|
217
217
|
if (!isFsNotFoundError(e)) throw e;
|
|
218
218
|
return null;
|
|
@@ -224,9 +224,9 @@ export class FlatFileStore implements IFlatFileStore {
|
|
|
224
224
|
rootHex: RootHex,
|
|
225
225
|
indices: number[]
|
|
226
226
|
): Promise<(Uint8Array | undefined)[] | null> {
|
|
227
|
-
let fd:
|
|
227
|
+
let fd: FileHandle;
|
|
228
228
|
try {
|
|
229
|
-
fd = await
|
|
229
|
+
fd = await open(this.filePath(slot, rootHex), "r");
|
|
230
230
|
} catch (e) {
|
|
231
231
|
if (!isFsNotFoundError(e)) throw e;
|
|
232
232
|
return null;
|
|
@@ -270,7 +270,7 @@ export class FlatFileStore implements IFlatFileStore {
|
|
|
270
270
|
await observeFlatFileStoreOperation(this.metrics, FlatFileStoreOperation.delete, async () => {
|
|
271
271
|
const release = await this.acquireMutationLock(slot);
|
|
272
272
|
try {
|
|
273
|
-
await
|
|
273
|
+
await rm(this.filePath(slot, rootHex), {force: true});
|
|
274
274
|
} finally {
|
|
275
275
|
release();
|
|
276
276
|
}
|
|
@@ -294,7 +294,7 @@ function validateDcolHeader(header: DcolHeader, slot: Slot, rootHex: RootHex): v
|
|
|
294
294
|
}
|
|
295
295
|
}
|
|
296
296
|
|
|
297
|
-
async function readExactly(fd:
|
|
297
|
+
async function readExactly(fd: FileHandle, buffer: Uint8Array, position: number): Promise<void> {
|
|
298
298
|
let totalRead = 0;
|
|
299
299
|
while (totalRead < buffer.length) {
|
|
300
300
|
const {bytesRead} = await fd.read(buffer, totalRead, buffer.length - totalRead, position + totalRead);
|
|
@@ -1,4 +1,5 @@
|
|
|
1
|
-
import
|
|
1
|
+
import type {Dirent} from "node:fs";
|
|
2
|
+
import {readdir} from "node:fs/promises";
|
|
2
3
|
import {Slot} from "@lodestar/types";
|
|
3
4
|
import {isFsNotFoundError} from "./errors.js";
|
|
4
5
|
import {padSlot} from "./path.js";
|
|
@@ -33,9 +34,9 @@ export class SlotIndex {
|
|
|
33
34
|
|
|
34
35
|
async rebuildFromDisk(columnsDir: string): Promise<SlotIndexRebuildStats> {
|
|
35
36
|
this.slots.clear();
|
|
36
|
-
let entries:
|
|
37
|
+
let entries: Dirent[];
|
|
37
38
|
try {
|
|
38
|
-
entries = await
|
|
39
|
+
entries = await readdir(columnsDir, {withFileTypes: true});
|
|
39
40
|
} catch (e) {
|
|
40
41
|
if (!isFsNotFoundError(e)) throw e;
|
|
41
42
|
return {slots: 0, ignoredEntries: 0};
|
package/src/db/interface.ts
CHANGED
|
@@ -68,6 +68,8 @@ export interface IBeaconDb {
|
|
|
68
68
|
readonly lastLegacyArchiveSlot: Slot | null;
|
|
69
69
|
init(): Promise<void>;
|
|
70
70
|
|
|
71
|
+
compactLegacyDataColumns(prunedBeforeSlot: Slot, minSizeBytes?: number): Promise<void>;
|
|
72
|
+
|
|
71
73
|
pruneHotDb(): Promise<void>;
|
|
72
74
|
|
|
73
75
|
deleteDeprecatedEth1Data(): Promise<void>;
|