@lodestar/beacon-node 1.50.0-dev.af3e3a6cff → 1.50.0-dev.b37917f96a
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/index.d.ts.map +1 -1
- package/lib/api/impl/beacon/index.js +13 -0
- package/lib/api/impl/beacon/index.js.map +1 -1
- package/lib/api/impl/beacon/state/index.d.ts.map +1 -1
- package/lib/api/impl/beacon/state/index.js +28 -6
- package/lib/api/impl/beacon/state/index.js.map +1 -1
- package/lib/api/impl/debug/index.d.ts.map +1 -1
- package/lib/api/impl/debug/index.js +26 -18
- package/lib/api/impl/debug/index.js.map +1 -1
- package/lib/api/impl/validator/index.d.ts +1 -0
- package/lib/api/impl/validator/index.d.ts.map +1 -1
- package/lib/api/impl/validator/index.js +23 -1
- package/lib/api/impl/validator/index.js.map +1 -1
- package/lib/chain/archiveStore/archiveStore.d.ts +5 -0
- package/lib/chain/archiveStore/archiveStore.d.ts.map +1 -1
- package/lib/chain/archiveStore/archiveStore.js +13 -23
- package/lib/chain/archiveStore/archiveStore.js.map +1 -1
- package/lib/chain/archiveStore/utils/pruneHistory.d.ts +1 -1
- package/lib/chain/archiveStore/utils/pruneHistory.d.ts.map +1 -1
- package/lib/chain/archiveStore/utils/pruneHistory.js +2 -1
- package/lib/chain/archiveStore/utils/pruneHistory.js.map +1 -1
- package/lib/chain/blocks/importBlock.d.ts.map +1 -1
- package/lib/chain/blocks/importBlock.js +13 -6
- 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 +4 -1
- package/lib/chain/chain.d.ts.map +1 -1
- package/lib/chain/chain.js +75 -20
- package/lib/chain/chain.js.map +1 -1
- package/lib/chain/emitter.d.ts +7 -1
- package/lib/chain/emitter.d.ts.map +1 -1
- package/lib/chain/emitter.js +5 -0
- package/lib/chain/emitter.js.map +1 -1
- package/lib/chain/forkChoice/index.d.ts.map +1 -1
- package/lib/chain/forkChoice/index.js +2 -0
- package/lib/chain/forkChoice/index.js.map +1 -1
- package/lib/chain/interface.d.ts +1 -0
- package/lib/chain/interface.d.ts.map +1 -1
- package/lib/chain/opPools/aggregatedAttestationPool.d.ts +4 -2
- package/lib/chain/opPools/aggregatedAttestationPool.d.ts.map +1 -1
- package/lib/chain/opPools/aggregatedAttestationPool.js +30 -8
- package/lib/chain/opPools/aggregatedAttestationPool.js.map +1 -1
- package/lib/chain/opPools/proposerPreferencesPool.d.ts +4 -4
- package/lib/chain/opPools/proposerPreferencesPool.d.ts.map +1 -1
- package/lib/chain/opPools/proposerPreferencesPool.js +14 -11
- package/lib/chain/opPools/proposerPreferencesPool.js.map +1 -1
- package/lib/chain/options.d.ts +1 -0
- package/lib/chain/options.d.ts.map +1 -1
- package/lib/chain/seenCache/seenGossipBlockInput.d.ts +7 -0
- package/lib/chain/seenCache/seenGossipBlockInput.d.ts.map +1 -1
- package/lib/chain/seenCache/seenGossipBlockInput.js +21 -0
- package/lib/chain/seenCache/seenGossipBlockInput.js.map +1 -1
- package/lib/chain/shufflingCache.d.ts +18 -8
- package/lib/chain/shufflingCache.d.ts.map +1 -1
- package/lib/chain/shufflingCache.js +72 -18
- package/lib/chain/shufflingCache.js.map +1 -1
- package/lib/db/beacon.d.ts +2 -0
- package/lib/db/beacon.d.ts.map +1 -1
- package/lib/db/beacon.js +3 -0
- package/lib/db/beacon.js.map +1 -1
- package/lib/db/buckets.d.ts +2 -1
- package/lib/db/buckets.d.ts.map +1 -1
- package/lib/db/buckets.js +1 -0
- package/lib/db/buckets.js.map +1 -1
- package/lib/db/interface.d.ts +2 -0
- 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/earliestAvailableSlot.d.ts +11 -0
- package/lib/db/repositories/earliestAvailableSlot.d.ts.map +1 -0
- package/lib/db/repositories/earliestAvailableSlot.js +19 -0
- package/lib/db/repositories/earliestAvailableSlot.js.map +1 -0
- package/lib/metrics/metrics/lodestar.d.ts +7 -0
- package/lib/metrics/metrics/lodestar.d.ts.map +1 -1
- package/lib/metrics/metrics/lodestar.js +17 -0
- package/lib/metrics/metrics/lodestar.js.map +1 -1
- package/lib/network/processor/gossipHandlers.d.ts.map +1 -1
- package/lib/network/processor/gossipHandlers.js +59 -63
- package/lib/network/processor/gossipHandlers.js.map +1 -1
- package/lib/node/nodejs.d.ts +3 -1
- package/lib/node/nodejs.d.ts.map +1 -1
- package/lib/node/nodejs.js +2 -1
- package/lib/node/nodejs.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 +12 -6
- 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 +17 -17
- package/src/api/impl/beacon/index.ts +15 -0
- package/src/api/impl/beacon/state/index.ts +43 -6
- package/src/api/impl/debug/index.ts +28 -19
- package/src/api/impl/validator/index.ts +24 -2
- package/src/chain/archiveStore/archiveStore.ts +18 -24
- package/src/chain/archiveStore/utils/pruneHistory.ts +4 -1
- package/src/chain/blocks/importBlock.ts +16 -5
- package/src/chain/blocks/verifyBlock.ts +7 -6
- package/src/chain/chain.ts +100 -19
- package/src/chain/emitter.ts +7 -1
- package/src/chain/forkChoice/index.ts +2 -0
- package/src/chain/interface.ts +1 -0
- package/src/chain/opPools/aggregatedAttestationPool.ts +34 -10
- package/src/chain/opPools/proposerPreferencesPool.ts +14 -10
- package/src/chain/options.ts +1 -1
- package/src/chain/seenCache/seenGossipBlockInput.ts +23 -0
- package/src/chain/shufflingCache.ts +84 -22
- package/src/db/beacon.ts +3 -0
- package/src/db/buckets.ts +1 -0
- package/src/db/interface.ts +2 -0
- package/src/db/repositories/earliestAvailableSlot.ts +19 -0
- package/src/metrics/metrics/lodestar.ts +18 -0
- package/src/network/processor/gossipHandlers.ts +90 -76
- package/src/node/nodejs.ts +4 -0
- package/src/sync/range/batch.ts +14 -19
- package/src/sync/range/chain.ts +15 -8
- package/src/sync/range/range.ts +26 -12
- package/src/sync/unknownBlock.ts +57 -21
- package/src/sync/utils/downloadByRange.ts +123 -58
|
@@ -30,7 +30,7 @@ import {
|
|
|
30
30
|
isStatePostGloas,
|
|
31
31
|
} from "@lodestar/state-transition";
|
|
32
32
|
import {Attestation, Epoch, RootHex, Slot, electra, isElectraAttestation, phase0, ssz} from "@lodestar/types";
|
|
33
|
-
import {MapDef, assert, toRootHex} from "@lodestar/utils";
|
|
33
|
+
import {Logger, MapDef, assert, toRootHex} from "@lodestar/utils";
|
|
34
34
|
import {Metrics} from "../../metrics/metrics.js";
|
|
35
35
|
import {IntersectResult, intersectUint8Arrays} from "../../util/bitArray.js";
|
|
36
36
|
import {getShufflingDependentRoot} from "../../util/dependentRoot.js";
|
|
@@ -58,7 +58,7 @@ export type AttestationsConsolidation = {
|
|
|
58
58
|
|
|
59
59
|
/**
|
|
60
60
|
* This function returns not seen participation for a given epoch and slot and committee index.
|
|
61
|
-
* Return
|
|
61
|
+
* Return an empty set if all validators are seen, or null if the committee cannot be computed (e.g. missing shuffling).
|
|
62
62
|
*/
|
|
63
63
|
type GetNotSeenValidatorsFn = (epoch: Epoch, slot: Slot, committeeIndex: number) => Set<number> | null;
|
|
64
64
|
|
|
@@ -140,7 +140,8 @@ export class AggregatedAttestationPool {
|
|
|
140
140
|
|
|
141
141
|
constructor(
|
|
142
142
|
private readonly config: BeaconConfig,
|
|
143
|
-
private readonly metrics: Metrics | null = null
|
|
143
|
+
private readonly metrics: Metrics | null = null,
|
|
144
|
+
private readonly logger: Logger | null = null
|
|
144
145
|
) {
|
|
145
146
|
metrics?.opPool.aggregatedAttestationPool.attDataPerSlot.addCollect(() => this.onScrapeMetrics(metrics));
|
|
146
147
|
}
|
|
@@ -244,6 +245,7 @@ export class AggregatedAttestationPool {
|
|
|
244
245
|
const consolidations = new Map<AttestationsConsolidation, number>();
|
|
245
246
|
let scannedSlots = 0;
|
|
246
247
|
let stopReason: ScannedSlotsTerminationReason | null = null;
|
|
248
|
+
const missingShufflingCommitteesByEpoch = new Map<Epoch, number>();
|
|
247
249
|
slot: for (const slot of slots) {
|
|
248
250
|
const attestationGroupByIndexByDataHash = this.attestationGroupByIndexByDataHexBySlot.get(slot);
|
|
249
251
|
// should not happen
|
|
@@ -295,7 +297,12 @@ export class AggregatedAttestationPool {
|
|
|
295
297
|
|
|
296
298
|
for (const [committeeIndex, attestationGroup] of attestationGroupByIndex.entries()) {
|
|
297
299
|
const notSeenCommitteeMembers = notSeenValidatorsFn(epoch, slot, committeeIndex);
|
|
298
|
-
if (notSeenCommitteeMembers === null
|
|
300
|
+
if (notSeenCommitteeMembers === null) {
|
|
301
|
+
// skip this committee instead of failing the whole block production, other epochs may still have shuffling
|
|
302
|
+
missingShufflingCommitteesByEpoch.set(epoch, (missingShufflingCommitteesByEpoch.get(epoch) ?? 0) + 1);
|
|
303
|
+
continue;
|
|
304
|
+
}
|
|
305
|
+
if (notSeenCommitteeMembers.size === 0) {
|
|
299
306
|
this.metrics?.opPool.aggregatedAttestationPool.packedAttestations.seenCommittees.inc();
|
|
300
307
|
continue;
|
|
301
308
|
}
|
|
@@ -386,6 +393,18 @@ export class AggregatedAttestationPool {
|
|
|
386
393
|
scannedSlots++;
|
|
387
394
|
}
|
|
388
395
|
|
|
396
|
+
for (const [epoch, missingCommittees] of missingShufflingCommitteesByEpoch) {
|
|
397
|
+
this.metrics?.opPool.aggregatedAttestationPool.packedAttestations.missingShufflingCommittees.inc(
|
|
398
|
+
missingCommittees
|
|
399
|
+
);
|
|
400
|
+
this.logger?.debug("Missing shuffling when packing attestations, skipped committees", {
|
|
401
|
+
slot: stateSlot,
|
|
402
|
+
epoch,
|
|
403
|
+
decisionRoot: state.getShufflingDecisionRoot(epoch),
|
|
404
|
+
missingCommittees,
|
|
405
|
+
});
|
|
406
|
+
}
|
|
407
|
+
|
|
389
408
|
this.metrics?.opPool.aggregatedAttestationPool.packedAttestations.totalConsolidations.set(consolidations.size);
|
|
390
409
|
|
|
391
410
|
const sortedConsolidationsByScore = Array.from(consolidations.entries())
|
|
@@ -770,13 +789,18 @@ export function getNotSeenValidatorsFn(
|
|
|
770
789
|
}
|
|
771
790
|
const cacheKey = slot + "_" + committeeIndex;
|
|
772
791
|
let notSeenCommitteeMembers = cachedNotSeenValidators.get(cacheKey);
|
|
773
|
-
if (notSeenCommitteeMembers
|
|
774
|
-
|
|
775
|
-
return notSeenCommitteeMembers.size === 0 ? null : notSeenCommitteeMembers;
|
|
792
|
+
if (notSeenCommitteeMembers !== undefined) {
|
|
793
|
+
return notSeenCommitteeMembers;
|
|
776
794
|
}
|
|
777
795
|
|
|
778
796
|
const decisionRoot = state.getShufflingDecisionRoot(computeEpochAtSlot(slot));
|
|
779
|
-
const committee = shufflingCache.
|
|
797
|
+
const committee = shufflingCache.getBeaconCommitteeOrNull(epoch, decisionRoot, slot, committeeIndex);
|
|
798
|
+
if (committee === null) {
|
|
799
|
+
// attestations in the pool were validated against a cached shuffling of the previous or current epoch,
|
|
800
|
+
// so a miss is a ShufflingCache bug. Return null so the caller tracks it via metrics/logs without failing
|
|
801
|
+
// block production. Don't fall back to the state's shuffling, that would hide the bug
|
|
802
|
+
return null;
|
|
803
|
+
}
|
|
780
804
|
notSeenCommitteeMembers = new Set<number>();
|
|
781
805
|
for (const [i, validatorIndex] of committee.entries()) {
|
|
782
806
|
// no need to check flagIsTimelySource as if validator is not seen, it's participation status is 0
|
|
@@ -786,8 +810,8 @@ export function getNotSeenValidatorsFn(
|
|
|
786
810
|
}
|
|
787
811
|
}
|
|
788
812
|
cachedNotSeenValidators.set(cacheKey, notSeenCommitteeMembers);
|
|
789
|
-
//
|
|
790
|
-
return notSeenCommitteeMembers
|
|
813
|
+
// an empty set means all validators are seen, we don't need to check for any attestations of same committee again
|
|
814
|
+
return notSeenCommitteeMembers;
|
|
791
815
|
};
|
|
792
816
|
}
|
|
793
817
|
|
|
@@ -6,8 +6,8 @@ import {toRootHex} from "@lodestar/utils";
|
|
|
6
6
|
*
|
|
7
7
|
* The primary consumer is `validateExecutionPayloadBid`, which looks up the matching
|
|
8
8
|
* preferences via `get(bid.slot, dependent_root)` to enforce the IGNORE-existence and
|
|
9
|
-
* REJECT-equality rules from the gloas spec. The beacon API
|
|
10
|
-
*
|
|
9
|
+
* REJECT-equality rules from the gloas spec. The beacon API `getProposerPreferences`
|
|
10
|
+
* endpoint reads from the same pool via `getAll`.
|
|
11
11
|
*
|
|
12
12
|
* `validator_index` is intentionally not part of the key: gossip validation enforces
|
|
13
13
|
* `proposers[proposalSlot % SLOTS_PER_EPOCH] === validatorIndex` against the shuffling
|
|
@@ -37,15 +37,19 @@ export class ProposerPreferencesPool {
|
|
|
37
37
|
byRoot.set(rootHex, signed);
|
|
38
38
|
}
|
|
39
39
|
|
|
40
|
-
/** API read-out: flatten across branches, optionally filtered by slot. */
|
|
41
|
-
getAll(slot?: Slot): gloas.SignedProposerPreferences[] {
|
|
42
|
-
if (slot !== undefined) {
|
|
43
|
-
const byRoot = this.bySlot.get(slot);
|
|
44
|
-
return byRoot ? Array.from(byRoot.values()) : [];
|
|
45
|
-
}
|
|
40
|
+
/** API read-out: flatten across branches, optionally filtered by slot and dependent root. */
|
|
41
|
+
getAll(slot?: Slot, dependentRootHex?: RootHex): gloas.SignedProposerPreferences[] {
|
|
46
42
|
const out: gloas.SignedProposerPreferences[] = [];
|
|
47
|
-
for (const byRoot of this.bySlot
|
|
48
|
-
|
|
43
|
+
for (const [s, byRoot] of this.bySlot) {
|
|
44
|
+
if (slot !== undefined && s !== slot) {
|
|
45
|
+
continue;
|
|
46
|
+
}
|
|
47
|
+
for (const [root, signed] of byRoot) {
|
|
48
|
+
if (dependentRootHex !== undefined && root !== dependentRootHex) {
|
|
49
|
+
continue;
|
|
50
|
+
}
|
|
51
|
+
out.push(signed);
|
|
52
|
+
}
|
|
49
53
|
}
|
|
50
54
|
return out;
|
|
51
55
|
}
|
package/src/chain/options.ts
CHANGED
|
@@ -27,8 +27,8 @@ export type IChainOptions = BlockProcessOpts &
|
|
|
27
27
|
blsVerifyAllMainThread?: boolean;
|
|
28
28
|
blsVerifyAllMultiThread?: boolean;
|
|
29
29
|
blacklistedBlocks?: string[];
|
|
30
|
-
// TODO GLOAS: add similar option for execution payload envelopes?
|
|
31
30
|
persistProducedBlocks?: boolean;
|
|
31
|
+
persistProducedPayloadEnvelopes?: boolean;
|
|
32
32
|
/** Archive finalized Gloas payload envelopes as headers (bodies reconstructed from the EL on read) */
|
|
33
33
|
dedupePayloads?: boolean;
|
|
34
34
|
persistInvalidSszObjects?: boolean;
|
|
@@ -111,6 +111,9 @@ export class SeenBlockInput {
|
|
|
111
111
|
// there should only 1 block root per slot but we need to always compare against rootHex
|
|
112
112
|
// and the signature to ensure we only skip verification if both match
|
|
113
113
|
private verifiedProposerSignatures = new Map<Slot, Map<RootHex, BLSSignature>>();
|
|
114
|
+
// Roots of gossip blocks under validation, counted because blocks with the same root but different signatures
|
|
115
|
+
// can be validated concurrently
|
|
116
|
+
private validatingBlockRoots = new Map<RootHex, number>();
|
|
114
117
|
|
|
115
118
|
constructor({
|
|
116
119
|
config,
|
|
@@ -153,6 +156,26 @@ export class SeenBlockInput {
|
|
|
153
156
|
return this.blockInputs.get(rootHex)?.hasBlock() ?? false;
|
|
154
157
|
}
|
|
155
158
|
|
|
159
|
+
/**
|
|
160
|
+
* Mark a gossip block root as under validation, every call MUST be paired with `unmarkValidatingBlock()`
|
|
161
|
+
*/
|
|
162
|
+
markValidatingBlock(rootHex: RootHex): void {
|
|
163
|
+
this.validatingBlockRoots.set(rootHex, (this.validatingBlockRoots.get(rootHex) ?? 0) + 1);
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
unmarkValidatingBlock(rootHex: RootHex): void {
|
|
167
|
+
const count = this.validatingBlockRoots.get(rootHex) ?? 0;
|
|
168
|
+
if (count <= 1) {
|
|
169
|
+
this.validatingBlockRoots.delete(rootHex);
|
|
170
|
+
} else {
|
|
171
|
+
this.validatingBlockRoots.set(rootHex, count - 1);
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
isValidatingBlock(rootHex: RootHex): boolean {
|
|
176
|
+
return this.validatingBlockRoots.has(rootHex);
|
|
177
|
+
}
|
|
178
|
+
|
|
156
179
|
get(rootHex: RootHex): IBlockInput | undefined {
|
|
157
180
|
return this.blockInputs.get(rootHex);
|
|
158
181
|
}
|
|
@@ -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,
|
|
@@ -205,6 +228,11 @@ export class ShufflingCache {
|
|
|
205
228
|
return this.getBeaconCommittees(epoch, decisionRoot, slot, [index])[0];
|
|
206
229
|
}
|
|
207
230
|
|
|
231
|
+
getBeaconCommitteeOrNull(epoch: number, decisionRoot: string, slot: Slot, index: CommitteeIndex): Uint32Array | null {
|
|
232
|
+
const shuffling = this.getSync(epoch, decisionRoot);
|
|
233
|
+
return shuffling === null ? null : getBeaconCommittees(shuffling, slot, [index])[0];
|
|
234
|
+
}
|
|
235
|
+
|
|
208
236
|
getBeaconCommittees(epoch: number, decisionRoot: string, slot: Slot, indices: CommitteeIndex[]): Uint32Array[] {
|
|
209
237
|
const shuffling = this.getShufflingOrThrow(epoch, decisionRoot);
|
|
210
238
|
return getBeaconCommittees(shuffling, slot, indices);
|
|
@@ -243,8 +271,42 @@ export class ShufflingCache {
|
|
|
243
271
|
}
|
|
244
272
|
// set the shuffling
|
|
245
273
|
shufflingAtEpoch.set(decisionRoot, {type: CacheItemType.shuffling, shuffling});
|
|
246
|
-
|
|
247
|
-
|
|
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
|
+
});
|
|
248
310
|
}
|
|
249
311
|
}
|
|
250
312
|
|
package/src/db/beacon.ts
CHANGED
|
@@ -8,6 +8,7 @@ import {FlatFileStore} from "./flatFileStore/flatFileStore.js";
|
|
|
8
8
|
import type {FlatFileStoreMetrics} from "./flatFileStore/metrics.js";
|
|
9
9
|
import {IBeaconDb} from "./interface.js";
|
|
10
10
|
import {CheckpointStateRepository} from "./repositories/checkpointState.js";
|
|
11
|
+
import {EarliestAvailableSlotRepository} from "./repositories/earliestAvailableSlot.js";
|
|
11
12
|
import {
|
|
12
13
|
AttesterSlashingRepository,
|
|
13
14
|
BLSToExecutionChangeRepository,
|
|
@@ -48,6 +49,7 @@ export class BeaconDb implements IBeaconDb {
|
|
|
48
49
|
|
|
49
50
|
stateArchive: StateArchiveRepository;
|
|
50
51
|
checkpointState: CheckpointStateRepository;
|
|
52
|
+
earliestAvailableSlot: EarliestAvailableSlotRepository;
|
|
51
53
|
|
|
52
54
|
voluntaryExit: VoluntaryExitRepository;
|
|
53
55
|
proposerSlashing: ProposerSlashingRepository;
|
|
@@ -83,6 +85,7 @@ export class BeaconDb implements IBeaconDb {
|
|
|
83
85
|
|
|
84
86
|
this.stateArchive = new StateArchiveRepository(config, db);
|
|
85
87
|
this.checkpointState = new CheckpointStateRepository(config, db);
|
|
88
|
+
this.earliestAvailableSlot = new EarliestAvailableSlotRepository(db);
|
|
86
89
|
this.voluntaryExit = new VoluntaryExitRepository(config, db);
|
|
87
90
|
this.blsToExecutionChange = new BLSToExecutionChangeRepository(config, db);
|
|
88
91
|
this.proposerSlashing = new ProposerSlashingRepository(config, db);
|
package/src/db/buckets.ts
CHANGED
|
@@ -72,6 +72,7 @@ export enum Bucket {
|
|
|
72
72
|
|
|
73
73
|
gloas_executionPayloadEnvelope = 59, // GLOAS BeaconBlockRoot -> SignedExecutionPayloadEnvelope
|
|
74
74
|
gloas_executionPayloadEnvelopeArchive = 60, // GLOAS Slot -> SignedExecutionPayloadEnvelope, or 0x00 + SignedExecutionPayloadHeaderEnvelope
|
|
75
|
+
earliestAvailableSlot = 61, // singleton -> Slot
|
|
75
76
|
}
|
|
76
77
|
|
|
77
78
|
export function getBucketNameByValue<T extends Bucket>(enumValue: T): keyof typeof Bucket {
|
package/src/db/interface.ts
CHANGED
|
@@ -3,6 +3,7 @@ import {Slot} from "@lodestar/types";
|
|
|
3
3
|
import type {IDataColumnStore} from "./dataColumnStore.js";
|
|
4
4
|
import type {FlatFileStoreMetrics} from "./flatFileStore/metrics.js";
|
|
5
5
|
import {CheckpointStateRepository} from "./repositories/checkpointState.js";
|
|
6
|
+
import {EarliestAvailableSlotRepository} from "./repositories/earliestAvailableSlot.js";
|
|
6
7
|
import {
|
|
7
8
|
AttesterSlashingRepository,
|
|
8
9
|
BLSToExecutionChangeRepository,
|
|
@@ -46,6 +47,7 @@ export interface IBeaconDb {
|
|
|
46
47
|
stateArchive: StateArchiveRepository;
|
|
47
48
|
// checkpoint states
|
|
48
49
|
checkpointState: CheckpointStateRepository;
|
|
50
|
+
earliestAvailableSlot: EarliestAvailableSlotRepository;
|
|
49
51
|
|
|
50
52
|
// op pool
|
|
51
53
|
voluntaryExit: VoluntaryExitRepository;
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
import {Db, encodeKey} from "@lodestar/db";
|
|
2
|
+
import {Slot, ssz} from "@lodestar/types";
|
|
3
|
+
import {Bucket, getBucketNameByValue} from "../buckets.js";
|
|
4
|
+
|
|
5
|
+
export class EarliestAvailableSlotRepository {
|
|
6
|
+
private readonly key = encodeKey(Bucket.earliestAvailableSlot, 0);
|
|
7
|
+
private readonly opts = {bucketId: getBucketNameByValue(Bucket.earliestAvailableSlot)};
|
|
8
|
+
|
|
9
|
+
constructor(private readonly db: Db) {}
|
|
10
|
+
|
|
11
|
+
async get(): Promise<Slot | null> {
|
|
12
|
+
const bytes = await this.db.get(this.key, this.opts);
|
|
13
|
+
return bytes === null ? null : ssz.Slot.deserialize(bytes);
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
async set(slot: Slot): Promise<void> {
|
|
17
|
+
await this.db.put(this.key, ssz.Slot.serialize(slot), this.opts);
|
|
18
|
+
}
|
|
19
|
+
}
|
|
@@ -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";
|
|
@@ -1281,6 +1282,10 @@ export function createLodestarMetrics(
|
|
|
1281
1282
|
name: "lodestar_oppool_aggregated_attestation_pool_packed_attestations_seen_committees_total",
|
|
1282
1283
|
help: "Total number of committees for which all members are seen when producing packed attestations",
|
|
1283
1284
|
}),
|
|
1285
|
+
missingShufflingCommittees: register.gauge({
|
|
1286
|
+
name: "lodestar_oppool_aggregated_attestation_pool_packed_attestations_missing_shuffling_committees_total",
|
|
1287
|
+
help: "Total number of committees skipped due to missing shuffling when producing packed attestations",
|
|
1288
|
+
}),
|
|
1284
1289
|
},
|
|
1285
1290
|
},
|
|
1286
1291
|
attestationPool: {
|
|
@@ -1614,6 +1619,19 @@ export function createLodestarMetrics(
|
|
|
1614
1619
|
name: "lodestar_shuffling_cache_size",
|
|
1615
1620
|
help: "Shuffling cache size",
|
|
1616
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
|
+
}),
|
|
1617
1635
|
insertPromiseCount: register.gauge({
|
|
1618
1636
|
name: "lodestar_shuffling_cache_insert_promise_count",
|
|
1619
1637
|
help: "Total number of times insertPromise is called",
|