@aztec/archiver 0.0.1-commit.181e2d196 → 0.0.1-commit.189eedb3
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/README.md +19 -11
- package/dest/archiver.d.ts +55 -18
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +276 -79
- package/dest/config.d.ts +4 -1
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +21 -14
- package/dest/errors.d.ts +55 -9
- package/dest/errors.d.ts.map +1 -1
- package/dest/errors.js +81 -14
- package/dest/factory.d.ts +14 -9
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +51 -37
- package/dest/index.d.ts +11 -3
- package/dest/index.d.ts.map +1 -1
- package/dest/index.js +10 -2
- package/dest/l1/calldata_retriever.d.ts +2 -1
- package/dest/l1/calldata_retriever.d.ts.map +1 -1
- package/dest/l1/calldata_retriever.js +15 -5
- package/dest/l1/data_retrieval.d.ts +19 -10
- package/dest/l1/data_retrieval.d.ts.map +1 -1
- package/dest/l1/data_retrieval.js +25 -32
- package/dest/l1/trace_tx.d.ts +12 -66
- package/dest/l1/trace_tx.d.ts.map +1 -1
- package/dest/l1/validate_historical_logs.d.ts +23 -0
- package/dest/l1/validate_historical_logs.d.ts.map +1 -0
- package/dest/l1/validate_historical_logs.js +108 -0
- package/dest/modules/contract_data_source_adapter.d.ts +25 -0
- package/dest/modules/contract_data_source_adapter.d.ts.map +1 -0
- package/dest/modules/contract_data_source_adapter.js +40 -0
- package/dest/modules/data_source_base.d.ts +73 -49
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +269 -137
- package/dest/modules/data_store_updater.d.ts +42 -17
- package/dest/modules/data_store_updater.d.ts.map +1 -1
- package/dest/modules/data_store_updater.js +191 -122
- package/dest/modules/instrumentation.d.ts +7 -2
- package/dest/modules/instrumentation.d.ts.map +1 -1
- package/dest/modules/instrumentation.js +25 -7
- package/dest/modules/l1_synchronizer.d.ts +12 -6
- package/dest/modules/l1_synchronizer.d.ts.map +1 -1
- package/dest/modules/l1_synchronizer.js +432 -205
- package/dest/modules/outbox_trees_resolver.d.ts +62 -0
- package/dest/modules/outbox_trees_resolver.d.ts.map +1 -0
- package/dest/modules/outbox_trees_resolver.js +162 -0
- package/dest/modules/validation.d.ts +4 -3
- package/dest/modules/validation.d.ts.map +1 -1
- package/dest/modules/validation.js +6 -6
- package/dest/store/block_store.d.ts +174 -76
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +692 -277
- package/dest/store/contract_class_store.d.ts +17 -4
- package/dest/store/contract_class_store.d.ts.map +1 -1
- package/dest/store/contract_class_store.js +24 -68
- package/dest/store/contract_instance_store.d.ts +28 -1
- package/dest/store/contract_instance_store.d.ts.map +1 -1
- package/dest/store/contract_instance_store.js +37 -2
- package/dest/store/data_stores.d.ts +68 -0
- package/dest/store/data_stores.d.ts.map +1 -0
- package/dest/store/data_stores.js +54 -0
- package/dest/store/function_names_cache.d.ts +17 -0
- package/dest/store/function_names_cache.d.ts.map +1 -0
- package/dest/store/function_names_cache.js +30 -0
- package/dest/store/l2_tips_cache.d.ts +13 -7
- package/dest/store/l2_tips_cache.d.ts.map +1 -1
- package/dest/store/l2_tips_cache.js +13 -76
- package/dest/store/log_store.d.ts +42 -37
- package/dest/store/log_store.d.ts.map +1 -1
- package/dest/store/log_store.js +262 -408
- package/dest/store/log_store_codec.d.ts +70 -0
- package/dest/store/log_store_codec.d.ts.map +1 -0
- package/dest/store/log_store_codec.js +101 -0
- package/dest/store/message_store.d.ts +11 -1
- package/dest/store/message_store.d.ts.map +1 -1
- package/dest/store/message_store.js +51 -9
- package/dest/test/fake_l1_state.d.ts +20 -1
- package/dest/test/fake_l1_state.d.ts.map +1 -1
- package/dest/test/fake_l1_state.js +114 -18
- package/dest/test/mock_l1_to_l2_message_source.d.ts +1 -1
- package/dest/test/mock_l1_to_l2_message_source.d.ts.map +1 -1
- package/dest/test/mock_l1_to_l2_message_source.js +2 -1
- package/dest/test/mock_l2_block_source.d.ts +54 -52
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +248 -182
- package/dest/test/mock_structs.d.ts +4 -1
- package/dest/test/mock_structs.d.ts.map +1 -1
- package/dest/test/mock_structs.js +13 -1
- package/dest/test/noop_l1_archiver.d.ts +13 -6
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +27 -10
- package/package.json +14 -14
- package/src/archiver.ts +347 -88
- package/src/config.ts +24 -11
- package/src/errors.ts +122 -21
- package/src/factory.ts +58 -31
- package/src/index.ts +18 -2
- package/src/l1/calldata_retriever.ts +16 -5
- package/src/l1/data_retrieval.ts +36 -45
- package/src/l1/validate_historical_logs.ts +140 -0
- package/src/modules/contract_data_source_adapter.ts +55 -0
- package/src/modules/data_source_base.ts +343 -176
- package/src/modules/data_store_updater.ts +224 -154
- package/src/modules/instrumentation.ts +28 -8
- package/src/modules/l1_synchronizer.ts +572 -248
- package/src/modules/outbox_trees_resolver.ts +199 -0
- package/src/modules/validation.ts +10 -9
- package/src/store/block_store.ts +858 -333
- package/src/store/contract_class_store.ts +31 -103
- package/src/store/contract_instance_store.ts +51 -5
- package/src/store/data_stores.ts +104 -0
- package/src/store/function_names_cache.ts +37 -0
- package/src/store/l2_tips_cache.ts +16 -70
- package/src/store/log_store.ts +301 -559
- package/src/store/log_store_codec.ts +132 -0
- package/src/store/message_store.ts +60 -10
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +142 -29
- package/src/test/mock_l1_to_l2_message_source.ts +1 -0
- package/src/test/mock_l2_block_source.ts +306 -227
- package/src/test/mock_structs.ts +20 -6
- package/src/test/noop_l1_archiver.ts +49 -10
- package/dest/store/kv_archiver_store.d.ts +0 -354
- package/dest/store/kv_archiver_store.d.ts.map +0 -1
- package/dest/store/kv_archiver_store.js +0 -464
- package/src/store/kv_archiver_store.ts +0 -671
package/src/store/block_store.ts
CHANGED
|
@@ -12,15 +12,24 @@ import {
|
|
|
12
12
|
type BlockData,
|
|
13
13
|
BlockHash,
|
|
14
14
|
Body,
|
|
15
|
-
CheckpointedL2Block,
|
|
16
15
|
CommitteeAttestation,
|
|
16
|
+
GENESIS_CHECKPOINT_HEADER_HASH,
|
|
17
17
|
L2Block,
|
|
18
|
+
type L2TipId,
|
|
19
|
+
type L2Tips,
|
|
18
20
|
type ValidateCheckpointResult,
|
|
19
21
|
deserializeValidateCheckpointResult,
|
|
20
22
|
serializeValidateCheckpointResult,
|
|
21
23
|
} from '@aztec/stdlib/block';
|
|
22
|
-
import {
|
|
23
|
-
|
|
24
|
+
import {
|
|
25
|
+
Checkpoint,
|
|
26
|
+
type CheckpointData,
|
|
27
|
+
type CommonCheckpointData,
|
|
28
|
+
L1PublishedData,
|
|
29
|
+
type ProposedCheckpointData,
|
|
30
|
+
type ProposedCheckpointInput,
|
|
31
|
+
PublishedCheckpoint,
|
|
32
|
+
} from '@aztec/stdlib/checkpoint';
|
|
24
33
|
import { CheckpointHeader } from '@aztec/stdlib/rollup';
|
|
25
34
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
26
35
|
import {
|
|
@@ -28,26 +37,28 @@ import {
|
|
|
28
37
|
type IndexedTxEffect,
|
|
29
38
|
TxEffect,
|
|
30
39
|
TxHash,
|
|
31
|
-
TxReceipt,
|
|
32
|
-
TxStatus,
|
|
33
40
|
deserializeIndexedTxEffect,
|
|
34
41
|
serializeIndexedTxEffect,
|
|
35
42
|
} from '@aztec/stdlib/tx';
|
|
36
43
|
|
|
37
44
|
import {
|
|
45
|
+
BlockAlreadyCheckpointedError,
|
|
38
46
|
BlockArchiveNotConsistentError,
|
|
47
|
+
BlockCheckpointNumberNotSequentialError,
|
|
39
48
|
BlockIndexNotSequentialError,
|
|
40
49
|
BlockNotFoundError,
|
|
41
50
|
BlockNumberNotSequentialError,
|
|
42
51
|
CannotOverwriteCheckpointedBlockError,
|
|
43
52
|
CheckpointNotFoundError,
|
|
44
|
-
CheckpointNumberNotConsistentError,
|
|
45
53
|
CheckpointNumberNotSequentialError,
|
|
46
|
-
InitialBlockNumberNotSequentialError,
|
|
47
54
|
InitialCheckpointNumberNotSequentialError,
|
|
55
|
+
NoProposedCheckpointToPromoteError,
|
|
56
|
+
ProposedCheckpointArchiveRootMismatchError,
|
|
57
|
+
ProposedCheckpointNotSequentialError,
|
|
58
|
+
ProposedCheckpointPromotionNotSequentialError,
|
|
48
59
|
} from '../errors.js';
|
|
49
60
|
|
|
50
|
-
export {
|
|
61
|
+
export type { TxEffect, TxHash, TxReceipt } from '@aztec/stdlib/tx';
|
|
51
62
|
|
|
52
63
|
type BlockIndexValue = [blockNumber: number, index: number];
|
|
53
64
|
|
|
@@ -59,19 +70,78 @@ type BlockStorage = {
|
|
|
59
70
|
indexWithinCheckpoint: number;
|
|
60
71
|
};
|
|
61
72
|
|
|
62
|
-
|
|
73
|
+
/** Reason a checkpoint was rejected during sync. */
|
|
74
|
+
export type RejectedCheckpointReason = 'invalid-attestations' | 'descends-from-invalid-attestations';
|
|
75
|
+
|
|
76
|
+
/**
|
|
77
|
+
* A checkpoint observed on L1 that the archiver decided not to ingest, recorded so that
|
|
78
|
+
* any descendant that builds on top of it can also be skipped (rather than throwing
|
|
79
|
+
* `InitialCheckpointNumberNotSequentialError` and looping). An entry is dropped via
|
|
80
|
+
* {@link BlockStore.removeRejectedCheckpointByArchiveRoot} once a checkpoint with the same
|
|
81
|
+
* archive root is later ingested as valid (e.g. it gathered enough attestations), which
|
|
82
|
+
* re-enables its descendants.
|
|
83
|
+
*/
|
|
84
|
+
export type RejectedCheckpoint = {
|
|
85
|
+
/** Checkpoint number this entry represents. */
|
|
86
|
+
checkpointNumber: CheckpointNumber;
|
|
87
|
+
/** Archive root produced by this rejected checkpoint (matched against descendants' `lastArchiveRoot`). */
|
|
88
|
+
archiveRoot: Fr;
|
|
89
|
+
/** `lastArchiveRoot` from this checkpoint's header (the ancestor it built on). */
|
|
90
|
+
parentArchiveRoot: Fr;
|
|
91
|
+
/** Slot number of the rejected checkpoint. */
|
|
92
|
+
slotNumber: SlotNumber;
|
|
93
|
+
/** L1 publication data for the rejected checkpoint (block number, hash, timestamp). */
|
|
94
|
+
l1: L1PublishedData;
|
|
95
|
+
/** Why the entry was recorded. */
|
|
96
|
+
reason: RejectedCheckpointReason;
|
|
97
|
+
};
|
|
98
|
+
|
|
99
|
+
type RejectedCheckpointStorage = {
|
|
100
|
+
checkpointNumber: number;
|
|
101
|
+
archiveRoot: Buffer;
|
|
102
|
+
parentArchiveRoot: Buffer;
|
|
103
|
+
slotNumber: number;
|
|
104
|
+
l1: Buffer;
|
|
105
|
+
reason: RejectedCheckpointReason;
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
/** Checkpoint Storage shared between Checkpoints + Proposed Checkpoints */
|
|
109
|
+
type CommonCheckpointStorage = {
|
|
63
110
|
header: Buffer;
|
|
64
111
|
archive: Buffer;
|
|
65
112
|
checkpointOutHash: Buffer;
|
|
66
113
|
checkpointNumber: number;
|
|
67
114
|
startBlock: number;
|
|
68
115
|
blockCount: number;
|
|
116
|
+
};
|
|
117
|
+
|
|
118
|
+
type CheckpointStorage = CommonCheckpointStorage & {
|
|
69
119
|
l1: Buffer;
|
|
70
120
|
attestations: Buffer[];
|
|
121
|
+
feeAssetPriceModifier: string;
|
|
122
|
+
};
|
|
123
|
+
|
|
124
|
+
/** Storage format for a proposed checkpoint (attested but not yet L1-confirmed). */
|
|
125
|
+
type ProposedCheckpointStorage = CommonCheckpointStorage & {
|
|
126
|
+
totalManaUsed: string;
|
|
127
|
+
feeAssetPriceModifier: string;
|
|
71
128
|
};
|
|
72
129
|
|
|
73
130
|
export type RemoveCheckpointsResult = { blocksRemoved: L2Block[] | undefined };
|
|
74
131
|
|
|
132
|
+
/**
|
|
133
|
+
* Single-block lookup with the chain-tip `tag` variant of {@link BlockQuery} already resolved
|
|
134
|
+
* to a concrete block number. The `tag` branch is unrepresentable here so storage code does
|
|
135
|
+
* not need to handle it at runtime.
|
|
136
|
+
*/
|
|
137
|
+
export type ResolvedBlockQuery = { number: BlockNumber } | { hash: BlockHash } | { archive: Fr };
|
|
138
|
+
|
|
139
|
+
/**
|
|
140
|
+
* Range lookup with the `epoch` variant of {@link BlocksQuery} already resolved to a
|
|
141
|
+
* `{ from, limit }` pair. Storage code never needs to map epoch numbers to block ranges.
|
|
142
|
+
*/
|
|
143
|
+
export type ResolvedBlocksQuery = { from: BlockNumber; limit: number; onlyCheckpointed?: boolean };
|
|
144
|
+
|
|
75
145
|
/**
|
|
76
146
|
* LMDB-based block storage for the archiver.
|
|
77
147
|
*/
|
|
@@ -79,7 +149,10 @@ export class BlockStore {
|
|
|
79
149
|
/** Map block number to block data */
|
|
80
150
|
#blocks: AztecAsyncMap<number, BlockStorage>;
|
|
81
151
|
|
|
82
|
-
/** Map checkpoint number
|
|
152
|
+
/** Map keyed by checkpoint number holding proposed (locally-validated, not yet L1-confirmed) checkpoints. */
|
|
153
|
+
#proposedCheckpoints: AztecAsyncMap<number, ProposedCheckpointStorage>;
|
|
154
|
+
|
|
155
|
+
/** Map checkpoint number to checkpoint data for mined checkpoints only */
|
|
83
156
|
#checkpoints: AztecAsyncMap<number, CheckpointStorage>;
|
|
84
157
|
|
|
85
158
|
/** Map slot number to checkpoint number, for looking up checkpoints by slot range. */
|
|
@@ -97,6 +170,9 @@ export class BlockStore {
|
|
|
97
170
|
/** Stores last proven checkpoint */
|
|
98
171
|
#lastProvenCheckpoint: AztecAsyncSingleton<number>;
|
|
99
172
|
|
|
173
|
+
/** Stores last finalized checkpoint (proven at or before the finalized L1 block) */
|
|
174
|
+
#lastFinalizedCheckpoint: AztecAsyncSingleton<number>;
|
|
175
|
+
|
|
100
176
|
/** Stores the pending chain validation status */
|
|
101
177
|
#pendingChainValidationStatus: AztecAsyncSingleton<Buffer>;
|
|
102
178
|
|
|
@@ -109,12 +185,15 @@ export class BlockStore {
|
|
|
109
185
|
/** Index mapping block archive to block number */
|
|
110
186
|
#blockArchiveIndex: AztecAsyncMap<string, number>;
|
|
111
187
|
|
|
188
|
+
/** Map rejected checkpoints (due to invalid attestations) by archive root */
|
|
189
|
+
#rejectedCheckpoints: AztecAsyncMap<string, RejectedCheckpointStorage>;
|
|
190
|
+
|
|
191
|
+
/** Index mapping a rejected checkpoint's number to its archive root, so the latest can be read in reverse order */
|
|
192
|
+
#rejectedCheckpointsByNumber: AztecAsyncMap<number, string>;
|
|
193
|
+
|
|
112
194
|
#log = createLogger('archiver:block_store');
|
|
113
195
|
|
|
114
|
-
constructor(
|
|
115
|
-
private db: AztecAsyncKVStore,
|
|
116
|
-
private l1Constants: Pick<L1RollupConstants, 'epochDuration'>,
|
|
117
|
-
) {
|
|
196
|
+
constructor(private db: AztecAsyncKVStore) {
|
|
118
197
|
this.#blocks = db.openMap('archiver_blocks');
|
|
119
198
|
this.#blockTxs = db.openMap('archiver_block_txs');
|
|
120
199
|
this.#txEffects = db.openMap('archiver_tx_effects');
|
|
@@ -123,120 +202,110 @@ export class BlockStore {
|
|
|
123
202
|
this.#blockArchiveIndex = db.openMap('archiver_block_archive_index');
|
|
124
203
|
this.#lastSynchedL1Block = db.openSingleton('archiver_last_synched_l1_block');
|
|
125
204
|
this.#lastProvenCheckpoint = db.openSingleton('archiver_last_proven_l2_checkpoint');
|
|
205
|
+
this.#lastFinalizedCheckpoint = db.openSingleton('archiver_last_finalized_l2_checkpoint');
|
|
126
206
|
this.#pendingChainValidationStatus = db.openSingleton('archiver_pending_chain_validation_status');
|
|
127
207
|
this.#checkpoints = db.openMap('archiver_checkpoints');
|
|
128
208
|
this.#slotToCheckpoint = db.openMap('archiver_slot_to_checkpoint');
|
|
209
|
+
this.#proposedCheckpoints = db.openMap('archiver_proposed_checkpoints');
|
|
210
|
+
this.#rejectedCheckpoints = db.openMap('archiver_rejected_checkpoints');
|
|
211
|
+
this.#rejectedCheckpointsByNumber = db.openMap('archiver_rejected_checkpoints_by_number');
|
|
129
212
|
}
|
|
130
213
|
|
|
131
214
|
/**
|
|
132
|
-
*
|
|
133
|
-
*
|
|
134
|
-
* TODO(#13569): Compute proper finalized block number based on L1 finalized block.
|
|
135
|
-
* TODO(palla/mbps): Even the provisional computation is wrong, since it should subtract checkpoints, not blocks
|
|
215
|
+
* Returns the finalized L2 block number. An L2 block is finalized when it was proven
|
|
216
|
+
* in an L1 block that has itself been finalized on Ethereum.
|
|
136
217
|
* @returns The finalized block number.
|
|
137
218
|
*/
|
|
138
219
|
async getFinalizedL2BlockNumber(): Promise<BlockNumber> {
|
|
139
|
-
const
|
|
140
|
-
|
|
220
|
+
const finalizedCheckpointNumber = await this.getFinalizedCheckpointNumber();
|
|
221
|
+
if (finalizedCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
222
|
+
return BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
223
|
+
}
|
|
224
|
+
const checkpointStorage = await this.#checkpoints.getAsync(finalizedCheckpointNumber);
|
|
225
|
+
if (!checkpointStorage) {
|
|
226
|
+
throw new CheckpointNotFoundError(finalizedCheckpointNumber);
|
|
227
|
+
}
|
|
228
|
+
return BlockNumber(checkpointStorage.startBlock + checkpointStorage.blockCount - 1);
|
|
141
229
|
}
|
|
142
230
|
|
|
143
231
|
/**
|
|
144
|
-
* Append new proposed
|
|
145
|
-
*
|
|
232
|
+
* Append a new proposed block to the store.
|
|
233
|
+
* This is an uncheckpointed block that has been proposed by the sequencer but not yet included in a checkpoint on L1.
|
|
146
234
|
* For checkpointed blocks (already published to L1), use addCheckpoints() instead.
|
|
147
|
-
* @param
|
|
235
|
+
* @param block - The proposed L2 block to be added to the store.
|
|
148
236
|
* @returns True if the operation is successful.
|
|
149
237
|
*/
|
|
150
|
-
async
|
|
151
|
-
if (blocks.length === 0) {
|
|
152
|
-
return true;
|
|
153
|
-
}
|
|
154
|
-
|
|
238
|
+
async addProposedBlock(block: L2Block, opts: { force?: boolean } = {}): Promise<boolean> {
|
|
155
239
|
return await this.db.transactionAsync(async () => {
|
|
156
|
-
|
|
157
|
-
const
|
|
158
|
-
const
|
|
159
|
-
const
|
|
160
|
-
const firstBlockLastArchive = blocks[0].header.lastArchive.root;
|
|
240
|
+
const blockNumber = block.number;
|
|
241
|
+
const blockCheckpointNumber = block.checkpointNumber;
|
|
242
|
+
const blockIndex = block.indexWithinCheckpoint;
|
|
243
|
+
const blockLastArchive = block.header.lastArchive.root;
|
|
161
244
|
|
|
162
245
|
// Extract the latest block and checkpoint numbers
|
|
163
|
-
const previousBlockNumber = await this.
|
|
164
|
-
const
|
|
246
|
+
const previousBlockNumber = await this.getLatestL2BlockNumber();
|
|
247
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
165
248
|
|
|
166
249
|
// Verify we're not overwriting checkpointed blocks
|
|
167
250
|
const lastCheckpointedBlockNumber = await this.getCheckpointedL2BlockNumber();
|
|
168
|
-
if (!opts.force &&
|
|
169
|
-
|
|
251
|
+
if (!opts.force && blockNumber <= lastCheckpointedBlockNumber) {
|
|
252
|
+
// Check if the proposed block matches the already-checkpointed one
|
|
253
|
+
const existingBlock = await this.getBlockData({ number: BlockNumber(blockNumber) });
|
|
254
|
+
if (existingBlock && existingBlock.archive.root.equals(block.archive.root)) {
|
|
255
|
+
throw new BlockAlreadyCheckpointedError(blockNumber);
|
|
256
|
+
}
|
|
257
|
+
throw new CannotOverwriteCheckpointedBlockError(blockNumber, lastCheckpointedBlockNumber);
|
|
170
258
|
}
|
|
171
259
|
|
|
172
|
-
// Check that the
|
|
173
|
-
if (!opts.force && previousBlockNumber !==
|
|
174
|
-
throw new
|
|
260
|
+
// Check that the block number is the expected one
|
|
261
|
+
if (!opts.force && previousBlockNumber !== blockNumber - 1) {
|
|
262
|
+
throw new BlockNumberNotSequentialError(blockNumber, previousBlockNumber);
|
|
175
263
|
}
|
|
176
264
|
|
|
177
|
-
//
|
|
178
|
-
|
|
179
|
-
|
|
265
|
+
// Accept the block if either the confirmed checkpoint or a pending checkpoint matches
|
|
266
|
+
// the expected predecessor. We look for a pending entry at exactly blockCheckpointNumber - 1.
|
|
267
|
+
const expectedCheckpointNumber = blockCheckpointNumber - 1;
|
|
268
|
+
const hasPendingAtExpected = await this.#proposedCheckpoints.hasAsync(expectedCheckpointNumber);
|
|
269
|
+
if (!opts.force && latestCheckpointNumber !== expectedCheckpointNumber && !hasPendingAtExpected) {
|
|
270
|
+
const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({ reverse: true, limit: 1 }));
|
|
271
|
+
const previous = CheckpointNumber(Math.max(latestCheckpointNumber, latestPendingKey ?? 0));
|
|
272
|
+
throw new BlockCheckpointNumberNotSequentialError(BlockNumber(blockNumber), blockCheckpointNumber, previous);
|
|
180
273
|
}
|
|
181
274
|
|
|
182
275
|
// Extract the previous block if there is one and see if it is for the same checkpoint or not
|
|
183
|
-
const previousBlockResult = await this.
|
|
276
|
+
const previousBlockResult = await this.getBlockData({ number: previousBlockNumber });
|
|
184
277
|
|
|
185
|
-
let
|
|
278
|
+
let expectedBlockIndex = 0;
|
|
186
279
|
let previousBlockIndex: number | undefined = undefined;
|
|
187
280
|
if (previousBlockResult !== undefined) {
|
|
188
|
-
if (previousBlockResult.checkpointNumber ===
|
|
281
|
+
if (previousBlockResult.checkpointNumber === blockCheckpointNumber) {
|
|
189
282
|
// The previous block is for the same checkpoint, therefore our index should follow it
|
|
190
283
|
previousBlockIndex = previousBlockResult.indexWithinCheckpoint;
|
|
191
|
-
|
|
284
|
+
expectedBlockIndex = previousBlockIndex + 1;
|
|
192
285
|
}
|
|
193
|
-
if (!previousBlockResult.archive.root.equals(
|
|
286
|
+
if (!previousBlockResult.archive.root.equals(blockLastArchive)) {
|
|
194
287
|
throw new BlockArchiveNotConsistentError(
|
|
195
|
-
|
|
196
|
-
previousBlockResult.
|
|
197
|
-
|
|
288
|
+
blockNumber,
|
|
289
|
+
previousBlockResult.header.globalVariables.blockNumber,
|
|
290
|
+
blockLastArchive,
|
|
198
291
|
previousBlockResult.archive.root,
|
|
199
292
|
);
|
|
200
293
|
}
|
|
201
294
|
}
|
|
202
295
|
|
|
203
|
-
// Now check that the
|
|
204
|
-
if (!opts.force &&
|
|
205
|
-
throw new BlockIndexNotSequentialError(
|
|
296
|
+
// Now check that the block has the expected index value
|
|
297
|
+
if (!opts.force && expectedBlockIndex !== blockIndex) {
|
|
298
|
+
throw new BlockIndexNotSequentialError(blockIndex, previousBlockIndex);
|
|
206
299
|
}
|
|
207
300
|
|
|
208
|
-
|
|
209
|
-
let previousBlock: L2Block | undefined = undefined;
|
|
210
|
-
for (const block of blocks) {
|
|
211
|
-
if (!opts.force && previousBlock) {
|
|
212
|
-
if (previousBlock.number + 1 !== block.number) {
|
|
213
|
-
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
214
|
-
}
|
|
215
|
-
if (previousBlock.indexWithinCheckpoint + 1 !== block.indexWithinCheckpoint) {
|
|
216
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
217
|
-
}
|
|
218
|
-
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
219
|
-
throw new BlockArchiveNotConsistentError(
|
|
220
|
-
block.number,
|
|
221
|
-
previousBlock.number,
|
|
222
|
-
block.header.lastArchive.root,
|
|
223
|
-
previousBlock.archive.root,
|
|
224
|
-
);
|
|
225
|
-
}
|
|
226
|
-
}
|
|
227
|
-
if (!opts.force && firstBlockCheckpointNumber !== block.checkpointNumber) {
|
|
228
|
-
throw new CheckpointNumberNotConsistentError(block.checkpointNumber, firstBlockCheckpointNumber);
|
|
229
|
-
}
|
|
230
|
-
previousBlock = block;
|
|
231
|
-
await this.addBlockToDatabase(block, block.checkpointNumber, block.indexWithinCheckpoint);
|
|
232
|
-
}
|
|
301
|
+
await this.addBlockToDatabase(block, block.checkpointNumber, block.indexWithinCheckpoint);
|
|
233
302
|
|
|
234
303
|
return true;
|
|
235
304
|
});
|
|
236
305
|
}
|
|
237
306
|
|
|
238
307
|
/**
|
|
239
|
-
* Append new
|
|
308
|
+
* Append new checkpoints to the store's list.
|
|
240
309
|
* @param checkpoints - The L2 checkpoints to be added to the store.
|
|
241
310
|
* @returns True if the operation is successful.
|
|
242
311
|
*/
|
|
@@ -246,37 +315,29 @@ export class BlockStore {
|
|
|
246
315
|
}
|
|
247
316
|
|
|
248
317
|
return await this.db.transactionAsync(async () => {
|
|
249
|
-
// Check that the checkpoint immediately before the first block to be added is present in the store.
|
|
250
318
|
const firstCheckpointNumber = checkpoints[0].checkpoint.number;
|
|
251
319
|
const previousCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
252
320
|
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
// There should be a previous checkpoint
|
|
261
|
-
previousCheckpointData = await this.getCheckpointData(previousCheckpointNumber);
|
|
262
|
-
if (previousCheckpointData === undefined) {
|
|
263
|
-
throw new CheckpointNotFoundError(previousCheckpointNumber);
|
|
321
|
+
// Handle already-stored checkpoints at the start of the batch.
|
|
322
|
+
// This can happen after an L1 reorg re-includes a checkpoint in a different L1 block.
|
|
323
|
+
// We accept them if archives match (same content) and update their L1 metadata.
|
|
324
|
+
if (!opts.force && firstCheckpointNumber <= previousCheckpointNumber) {
|
|
325
|
+
checkpoints = await this.skipOrUpdateAlreadyStoredCheckpoints(checkpoints, previousCheckpointNumber);
|
|
326
|
+
if (checkpoints.length === 0) {
|
|
327
|
+
return true;
|
|
264
328
|
}
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
// If we have a previous checkpoint then we need to get the previous block number
|
|
271
|
-
if (previousCheckpointData !== undefined) {
|
|
272
|
-
previousBlockNumber = BlockNumber(previousCheckpointData.startBlock + previousCheckpointData.blockCount - 1);
|
|
273
|
-
previousBlock = await this.getBlock(previousBlockNumber);
|
|
274
|
-
if (previousBlock === undefined) {
|
|
275
|
-
// We should be able to get the required previous block
|
|
276
|
-
throw new BlockNotFoundError(previousBlockNumber);
|
|
329
|
+
// Re-check sequentiality after skipping
|
|
330
|
+
const newFirstNumber = checkpoints[0].checkpoint.number;
|
|
331
|
+
if (previousCheckpointNumber !== newFirstNumber - 1) {
|
|
332
|
+
throw new InitialCheckpointNumberNotSequentialError(newFirstNumber, previousCheckpointNumber);
|
|
277
333
|
}
|
|
334
|
+
} else if (previousCheckpointNumber !== firstCheckpointNumber - 1 && !opts.force) {
|
|
335
|
+
throw new InitialCheckpointNumberNotSequentialError(firstCheckpointNumber, previousCheckpointNumber);
|
|
278
336
|
}
|
|
279
337
|
|
|
338
|
+
// Get the last block of the previous checkpoint for archive chaining
|
|
339
|
+
let previousBlock = await this.getPreviousCheckpointBlock(checkpoints[0].checkpoint.number);
|
|
340
|
+
|
|
280
341
|
// Iterate over checkpoints array and insert them, checking that the block numbers are sequential.
|
|
281
342
|
let previousCheckpoint: PublishedCheckpoint | undefined = undefined;
|
|
282
343
|
for (const checkpoint of checkpoints) {
|
|
@@ -292,42 +353,14 @@ export class BlockStore {
|
|
|
292
353
|
}
|
|
293
354
|
previousCheckpoint = checkpoint;
|
|
294
355
|
|
|
295
|
-
//
|
|
296
|
-
|
|
297
|
-
const block = checkpoint.checkpoint.blocks[i];
|
|
298
|
-
if (previousBlock) {
|
|
299
|
-
// The blocks should have a sequential block number
|
|
300
|
-
if (previousBlock.number !== block.number - 1) {
|
|
301
|
-
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
302
|
-
}
|
|
303
|
-
// If the blocks are for the same checkpoint then they should have sequential indexes
|
|
304
|
-
if (
|
|
305
|
-
previousBlock.checkpointNumber === block.checkpointNumber &&
|
|
306
|
-
previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1
|
|
307
|
-
) {
|
|
308
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
309
|
-
}
|
|
310
|
-
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
311
|
-
throw new BlockArchiveNotConsistentError(
|
|
312
|
-
block.number,
|
|
313
|
-
previousBlock.number,
|
|
314
|
-
block.header.lastArchive.root,
|
|
315
|
-
previousBlock.archive.root,
|
|
316
|
-
);
|
|
317
|
-
}
|
|
318
|
-
} else {
|
|
319
|
-
// No previous block, must be block 1 at checkpoint index 0
|
|
320
|
-
if (block.indexWithinCheckpoint !== 0) {
|
|
321
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
322
|
-
}
|
|
323
|
-
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
324
|
-
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
325
|
-
}
|
|
326
|
-
}
|
|
356
|
+
// Validate block sequencing, indexes, and archive chaining
|
|
357
|
+
this.validateCheckpointBlocks(checkpoint.checkpoint.blocks, previousBlock);
|
|
327
358
|
|
|
328
|
-
|
|
329
|
-
|
|
359
|
+
// Store every block in the database (may already exist, but L1 data is authoritative)
|
|
360
|
+
for (let i = 0; i < checkpoint.checkpoint.blocks.length; i++) {
|
|
361
|
+
await this.addBlockToDatabase(checkpoint.checkpoint.blocks[i], checkpoint.checkpoint.number, i);
|
|
330
362
|
}
|
|
363
|
+
previousBlock = checkpoint.checkpoint.blocks.at(-1);
|
|
331
364
|
|
|
332
365
|
// Store the checkpoint in the database
|
|
333
366
|
await this.#checkpoints.set(checkpoint.checkpoint.number, {
|
|
@@ -339,17 +372,135 @@ export class BlockStore {
|
|
|
339
372
|
checkpointNumber: checkpoint.checkpoint.number,
|
|
340
373
|
startBlock: checkpoint.checkpoint.blocks[0].number,
|
|
341
374
|
blockCount: checkpoint.checkpoint.blocks.length,
|
|
375
|
+
feeAssetPriceModifier: checkpoint.checkpoint.feeAssetPriceModifier.toString(),
|
|
342
376
|
});
|
|
343
377
|
|
|
344
378
|
// Update slot-to-checkpoint index
|
|
345
379
|
await this.#slotToCheckpoint.set(checkpoint.checkpoint.header.slotNumber, checkpoint.checkpoint.number);
|
|
380
|
+
|
|
381
|
+
// Remove proposed checkpoint if it exists, since L1 is authoritative
|
|
382
|
+
await this.#proposedCheckpoints.delete(checkpoint.checkpoint.number);
|
|
383
|
+
|
|
384
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
385
|
+
// (e.g. invalid attestations) is now being ingested as valid, so its descendants are allowed.
|
|
386
|
+
await this.removeRejectedCheckpointByArchiveRoot(checkpoint.checkpoint.archive.root);
|
|
346
387
|
}
|
|
347
388
|
|
|
348
|
-
await this
|
|
389
|
+
await this.advanceSynchedL1BlockNumber(checkpoints[checkpoints.length - 1].l1.blockNumber);
|
|
349
390
|
return true;
|
|
350
391
|
});
|
|
351
392
|
}
|
|
352
393
|
|
|
394
|
+
/**
|
|
395
|
+
* Handles checkpoints at the start of a batch that are already stored (e.g. due to L1 reorg).
|
|
396
|
+
* Verifies the archive root matches, updates L1 metadata, and returns only the new checkpoints.
|
|
397
|
+
*/
|
|
398
|
+
private async skipOrUpdateAlreadyStoredCheckpoints(
|
|
399
|
+
checkpoints: PublishedCheckpoint[],
|
|
400
|
+
latestStored: CheckpointNumber,
|
|
401
|
+
): Promise<PublishedCheckpoint[]> {
|
|
402
|
+
let i = 0;
|
|
403
|
+
for (; i < checkpoints.length && checkpoints[i].checkpoint.number <= latestStored; i++) {
|
|
404
|
+
const incoming = checkpoints[i];
|
|
405
|
+
const stored = await this.getCheckpointData(incoming.checkpoint.number);
|
|
406
|
+
if (!stored) {
|
|
407
|
+
// Should not happen if latestStored is correct, but be safe
|
|
408
|
+
break;
|
|
409
|
+
}
|
|
410
|
+
// Verify the checkpoint content matches (archive root)
|
|
411
|
+
if (!stored.archive.root.equals(incoming.checkpoint.archive.root)) {
|
|
412
|
+
throw new Error(
|
|
413
|
+
`Checkpoint ${incoming.checkpoint.number} already exists in store but with a different archive root. ` +
|
|
414
|
+
`Stored: ${stored.archive.root}, incoming: ${incoming.checkpoint.archive.root}`,
|
|
415
|
+
);
|
|
416
|
+
}
|
|
417
|
+
// Update L1 metadata and attestations for the already-stored checkpoint
|
|
418
|
+
this.#log.warn(
|
|
419
|
+
`Checkpoint ${incoming.checkpoint.number} already stored, updating L1 info ` +
|
|
420
|
+
`(L1 block ${stored.l1.blockNumber} -> ${incoming.l1.blockNumber})`,
|
|
421
|
+
);
|
|
422
|
+
await this.#checkpoints.set(incoming.checkpoint.number, {
|
|
423
|
+
header: incoming.checkpoint.header.toBuffer(),
|
|
424
|
+
archive: incoming.checkpoint.archive.toBuffer(),
|
|
425
|
+
checkpointOutHash: incoming.checkpoint.getCheckpointOutHash().toBuffer(),
|
|
426
|
+
l1: incoming.l1.toBuffer(),
|
|
427
|
+
attestations: incoming.attestations.map(a => a.toBuffer()),
|
|
428
|
+
checkpointNumber: incoming.checkpoint.number,
|
|
429
|
+
startBlock: incoming.checkpoint.blocks[0].number,
|
|
430
|
+
blockCount: incoming.checkpoint.blocks.length,
|
|
431
|
+
feeAssetPriceModifier: incoming.checkpoint.feeAssetPriceModifier.toString(),
|
|
432
|
+
});
|
|
433
|
+
// Update the sync point to reflect the new L1 block
|
|
434
|
+
await this.advanceSynchedL1BlockNumber(incoming.l1.blockNumber);
|
|
435
|
+
}
|
|
436
|
+
return checkpoints.slice(i);
|
|
437
|
+
}
|
|
438
|
+
|
|
439
|
+
/**
|
|
440
|
+
* Gets the last block of the checkpoint before the given one.
|
|
441
|
+
* Returns undefined if there is no previous checkpoint (i.e. genesis).
|
|
442
|
+
*/
|
|
443
|
+
private async getPreviousCheckpointBlock(checkpointNumber: CheckpointNumber): Promise<L2Block | undefined> {
|
|
444
|
+
const previousCheckpointNumber = CheckpointNumber(checkpointNumber - 1);
|
|
445
|
+
if (previousCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
446
|
+
return undefined;
|
|
447
|
+
}
|
|
448
|
+
|
|
449
|
+
// Check across both proposed and mined checkpoints
|
|
450
|
+
const predecessor =
|
|
451
|
+
(await this.getProposedCheckpointByNumber(previousCheckpointNumber)) ??
|
|
452
|
+
(await this.getCheckpointData(previousCheckpointNumber));
|
|
453
|
+
|
|
454
|
+
if (!predecessor) {
|
|
455
|
+
throw new CheckpointNotFoundError(previousCheckpointNumber);
|
|
456
|
+
}
|
|
457
|
+
|
|
458
|
+
const previousBlockNumber = BlockNumber(predecessor.startBlock + predecessor.blockCount - 1);
|
|
459
|
+
const previousBlock = await this.getBlock({ number: previousBlockNumber });
|
|
460
|
+
if (previousBlock === undefined) {
|
|
461
|
+
throw new BlockNotFoundError(previousBlockNumber);
|
|
462
|
+
}
|
|
463
|
+
return previousBlock;
|
|
464
|
+
}
|
|
465
|
+
|
|
466
|
+
/**
|
|
467
|
+
* Validates that blocks are sequential, have correct indexes, and chain via archive roots.
|
|
468
|
+
* This is the same validation used for both confirmed checkpoints (addCheckpoints) and
|
|
469
|
+
* proposed checkpoints (addProposedCheckpoint).
|
|
470
|
+
*/
|
|
471
|
+
private validateCheckpointBlocks(blocks: L2Block[], previousBlock: L2Block | undefined): void {
|
|
472
|
+
for (const block of blocks) {
|
|
473
|
+
if (previousBlock) {
|
|
474
|
+
if (previousBlock.number !== block.number - 1) {
|
|
475
|
+
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
476
|
+
}
|
|
477
|
+
if (previousBlock.checkpointNumber === block.checkpointNumber) {
|
|
478
|
+
if (previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
|
|
479
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
480
|
+
}
|
|
481
|
+
} else if (block.indexWithinCheckpoint !== 0) {
|
|
482
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
483
|
+
}
|
|
484
|
+
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
485
|
+
throw new BlockArchiveNotConsistentError(
|
|
486
|
+
block.number,
|
|
487
|
+
previousBlock.number,
|
|
488
|
+
block.header.lastArchive.root,
|
|
489
|
+
previousBlock.archive.root,
|
|
490
|
+
);
|
|
491
|
+
}
|
|
492
|
+
} else {
|
|
493
|
+
if (block.indexWithinCheckpoint !== 0) {
|
|
494
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
495
|
+
}
|
|
496
|
+
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
497
|
+
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
498
|
+
}
|
|
499
|
+
}
|
|
500
|
+
previousBlock = block;
|
|
501
|
+
}
|
|
502
|
+
}
|
|
503
|
+
|
|
353
504
|
private async addBlockToDatabase(block: L2Block, checkpointNumber: number, indexWithinCheckpoint: number) {
|
|
354
505
|
const blockHash = await block.hash();
|
|
355
506
|
|
|
@@ -367,6 +518,7 @@ export class BlockStore {
|
|
|
367
518
|
l2BlockNumber: block.number,
|
|
368
519
|
l2BlockHash: blockHash,
|
|
369
520
|
txIndexInBlock: i,
|
|
521
|
+
slotNumber: block.header.globalVariables.slotNumber,
|
|
370
522
|
};
|
|
371
523
|
await this.#txEffects.set(txEffect.data.txHash.toString(), serializeIndexedTxEffect(txEffect));
|
|
372
524
|
}
|
|
@@ -442,6 +594,9 @@ export class BlockStore {
|
|
|
442
594
|
this.#log.debug(`Removed checkpoint ${c}`);
|
|
443
595
|
}
|
|
444
596
|
|
|
597
|
+
// Evict all pending checkpoints > checkpointNumber (their base chain no longer exists)
|
|
598
|
+
await this.evictProposedCheckpointsFrom(CheckpointNumber(checkpointNumber + 1));
|
|
599
|
+
|
|
445
600
|
return { blocksRemoved };
|
|
446
601
|
});
|
|
447
602
|
}
|
|
@@ -481,6 +636,22 @@ export class BlockStore {
|
|
|
481
636
|
return result;
|
|
482
637
|
}
|
|
483
638
|
|
|
639
|
+
/**
|
|
640
|
+
* Returns the checkpoint numbers for all checkpoints whose slot falls within the given range (inclusive).
|
|
641
|
+
* Lighter than {@link getCheckpointDataForSlotRange} when callers only need to identify which
|
|
642
|
+
* checkpoints fall in the range and will fetch full data for at most a few of them.
|
|
643
|
+
*/
|
|
644
|
+
async getCheckpointNumbersForSlotRange(startSlot: SlotNumber, endSlot: SlotNumber): Promise<CheckpointNumber[]> {
|
|
645
|
+
const result: CheckpointNumber[] = [];
|
|
646
|
+
for await (const [, checkpointNumber] of this.#slotToCheckpoint.entriesAsync({
|
|
647
|
+
start: startSlot,
|
|
648
|
+
end: endSlot + 1,
|
|
649
|
+
})) {
|
|
650
|
+
result.push(CheckpointNumber(checkpointNumber));
|
|
651
|
+
}
|
|
652
|
+
return result;
|
|
653
|
+
}
|
|
654
|
+
|
|
484
655
|
private checkpointDataFromCheckpointStorage(checkpointStorage: CheckpointStorage): CheckpointData {
|
|
485
656
|
return {
|
|
486
657
|
header: CheckpointHeader.fromBuffer(checkpointStorage.header),
|
|
@@ -489,6 +660,7 @@ export class BlockStore {
|
|
|
489
660
|
checkpointNumber: CheckpointNumber(checkpointStorage.checkpointNumber),
|
|
490
661
|
startBlock: BlockNumber(checkpointStorage.startBlock),
|
|
491
662
|
blockCount: checkpointStorage.blockCount,
|
|
663
|
+
feeAssetPriceModifier: BigInt(checkpointStorage.feeAssetPriceModifier),
|
|
492
664
|
l1: L1PublishedData.fromBuffer(checkpointStorage.l1),
|
|
493
665
|
attestations: checkpointStorage.attestations.map(buf => CommitteeAttestation.fromBuffer(buf)),
|
|
494
666
|
};
|
|
@@ -547,11 +719,11 @@ export class BlockStore {
|
|
|
547
719
|
const removedBlocks: L2Block[] = [];
|
|
548
720
|
|
|
549
721
|
// Get the latest block number to determine the range
|
|
550
|
-
const latestBlockNumber = await this.
|
|
722
|
+
const latestBlockNumber = await this.getLatestL2BlockNumber();
|
|
551
723
|
|
|
552
724
|
// Iterate from blockNumber + 1 to latestBlockNumber
|
|
553
725
|
for (let bn = blockNumber + 1; bn <= latestBlockNumber; bn++) {
|
|
554
|
-
const block = await this.getBlock(BlockNumber(bn));
|
|
726
|
+
const block = await this.getBlock({ number: BlockNumber(bn) });
|
|
555
727
|
|
|
556
728
|
if (block === undefined) {
|
|
557
729
|
this.#log.warn(`Cannot remove block ${bn} from the store since we don't have it`);
|
|
@@ -580,13 +752,6 @@ export class BlockStore {
|
|
|
580
752
|
}
|
|
581
753
|
}
|
|
582
754
|
|
|
583
|
-
async getLatestBlockNumber(): Promise<BlockNumber> {
|
|
584
|
-
const [latestBlocknumber] = await toArray(this.#blocks.keysAsync({ reverse: true, limit: 1 }));
|
|
585
|
-
return typeof latestBlocknumber === 'number'
|
|
586
|
-
? BlockNumber(latestBlocknumber)
|
|
587
|
-
: BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
588
|
-
}
|
|
589
|
-
|
|
590
755
|
async getLatestCheckpointNumber(): Promise<CheckpointNumber> {
|
|
591
756
|
const [latestCheckpointNumber] = await toArray(this.#checkpoints.keysAsync({ reverse: true, limit: 1 }));
|
|
592
757
|
if (latestCheckpointNumber === undefined) {
|
|
@@ -595,175 +760,204 @@ export class BlockStore {
|
|
|
595
760
|
return CheckpointNumber(latestCheckpointNumber);
|
|
596
761
|
}
|
|
597
762
|
|
|
598
|
-
async
|
|
599
|
-
const
|
|
600
|
-
|
|
601
|
-
|
|
602
|
-
|
|
603
|
-
|
|
604
|
-
|
|
605
|
-
|
|
606
|
-
|
|
607
|
-
const block = await this.getBlockFromBlockStorage(number, blockStorage);
|
|
608
|
-
if (!block) {
|
|
609
|
-
return undefined;
|
|
763
|
+
async hasProposedCheckpoint(): Promise<boolean> {
|
|
764
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({ limit: 1 }));
|
|
765
|
+
return key !== undefined;
|
|
766
|
+
}
|
|
767
|
+
|
|
768
|
+
/** Deletes all pending proposed checkpoints from storage. */
|
|
769
|
+
async deleteProposedCheckpoints(): Promise<void> {
|
|
770
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()) {
|
|
771
|
+
await this.#proposedCheckpoints.delete(key);
|
|
610
772
|
}
|
|
611
|
-
return new CheckpointedL2Block(
|
|
612
|
-
CheckpointNumber(checkpoint.checkpointNumber),
|
|
613
|
-
block,
|
|
614
|
-
L1PublishedData.fromBuffer(checkpoint.l1),
|
|
615
|
-
checkpoint.attestations.map(buf => CommitteeAttestation.fromBuffer(buf)),
|
|
616
|
-
);
|
|
617
773
|
}
|
|
618
774
|
|
|
619
775
|
/**
|
|
620
|
-
*
|
|
621
|
-
*
|
|
622
|
-
*
|
|
623
|
-
* @
|
|
776
|
+
* Promotes a specific pending checkpoint to a confirmed checkpoint entry.
|
|
777
|
+
* This persists the checkpoint to the store, removes only that pending entry, and updates the L1 sync point.
|
|
778
|
+
* Remaining pending entries (e.g. N+1, N+2) are left intact — they chain off the just-promoted one.
|
|
779
|
+
* @param checkpointNumber - The checkpoint number to promote.
|
|
780
|
+
* @param l1 - L1 published data for the checkpoint.
|
|
781
|
+
* @param attestations - Committee attestations.
|
|
782
|
+
* @param expectedArchiveRoot - Archive root guard against races.
|
|
624
783
|
*/
|
|
625
|
-
async
|
|
626
|
-
|
|
627
|
-
|
|
628
|
-
|
|
629
|
-
|
|
630
|
-
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
|
|
634
|
-
|
|
635
|
-
const checkpointedBlock = new CheckpointedL2Block(
|
|
636
|
-
CheckpointNumber(checkpoint.checkpointNumber),
|
|
637
|
-
block,
|
|
638
|
-
L1PublishedData.fromBuffer(checkpoint.l1),
|
|
639
|
-
checkpoint.attestations.map(buf => CommitteeAttestation.fromBuffer(buf)),
|
|
640
|
-
);
|
|
641
|
-
yield checkpointedBlock;
|
|
642
|
-
}
|
|
784
|
+
async promoteProposedToCheckpointed(
|
|
785
|
+
checkpointNumber: CheckpointNumber,
|
|
786
|
+
l1: L1PublishedData,
|
|
787
|
+
attestations: CommitteeAttestation[],
|
|
788
|
+
expectedArchiveRoot: Fr,
|
|
789
|
+
): Promise<void> {
|
|
790
|
+
return await this.db.transactionAsync(async () => {
|
|
791
|
+
const proposed = await this.getProposedCheckpointByNumber(checkpointNumber);
|
|
792
|
+
if (!proposed) {
|
|
793
|
+
throw new NoProposedCheckpointToPromoteError();
|
|
643
794
|
}
|
|
644
|
-
|
|
795
|
+
if (!proposed.archive.root.equals(expectedArchiveRoot)) {
|
|
796
|
+
throw new ProposedCheckpointArchiveRootMismatchError(expectedArchiveRoot, proposed.archive.root);
|
|
797
|
+
}
|
|
798
|
+
|
|
799
|
+
// Verify sequentiality: promoted checkpoint must follow the latest confirmed one
|
|
800
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
801
|
+
if (latestCheckpointNumber !== proposed.checkpointNumber - 1) {
|
|
802
|
+
throw new ProposedCheckpointPromotionNotSequentialError(proposed.checkpointNumber, latestCheckpointNumber);
|
|
803
|
+
}
|
|
804
|
+
|
|
805
|
+
// Write the checkpoint entry
|
|
806
|
+
await this.#checkpoints.set(proposed.checkpointNumber, {
|
|
807
|
+
header: proposed.header.toBuffer(),
|
|
808
|
+
archive: proposed.archive.toBuffer(),
|
|
809
|
+
checkpointOutHash: proposed.checkpointOutHash.toBuffer(),
|
|
810
|
+
l1: l1.toBuffer(),
|
|
811
|
+
attestations: attestations.map(attestation => attestation.toBuffer()),
|
|
812
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
813
|
+
startBlock: proposed.startBlock,
|
|
814
|
+
blockCount: proposed.blockCount,
|
|
815
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString(),
|
|
816
|
+
});
|
|
817
|
+
|
|
818
|
+
// Update the slot-to-checkpoint index
|
|
819
|
+
await this.#slotToCheckpoint.set(proposed.header.slotNumber, proposed.checkpointNumber);
|
|
820
|
+
|
|
821
|
+
// Remove only this pending entry — remaining entries N+1, N+2, ... stay valid
|
|
822
|
+
await this.#proposedCheckpoints.delete(proposed.checkpointNumber);
|
|
823
|
+
|
|
824
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
825
|
+
// (e.g. invalid attestations) is now being promoted as valid, so its descendants are allowed.
|
|
826
|
+
await this.removeRejectedCheckpointByArchiveRoot(proposed.archive.root);
|
|
827
|
+
|
|
828
|
+
// Update the last synced L1 block
|
|
829
|
+
await this.advanceSynchedL1BlockNumber(l1.blockNumber);
|
|
830
|
+
});
|
|
645
831
|
}
|
|
646
832
|
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
833
|
+
/**
|
|
834
|
+
* Returns the latest pending checkpoint (highest-numbered entry), or undefined if none.
|
|
835
|
+
* No fallback to confirmed.
|
|
836
|
+
*/
|
|
837
|
+
async getLastProposedCheckpoint(): Promise<ProposedCheckpointData | undefined> {
|
|
838
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({ reverse: true, limit: 1 }));
|
|
839
|
+
if (key === undefined) {
|
|
650
840
|
return undefined;
|
|
651
841
|
}
|
|
652
|
-
|
|
842
|
+
const stored = await this.#proposedCheckpoints.getAsync(key);
|
|
843
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
653
844
|
}
|
|
654
845
|
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
}
|
|
660
|
-
return this.getCheckpointedBlock(BlockNumber(blockNumber));
|
|
846
|
+
/** Returns the pending checkpoint for a specific checkpoint number, or undefined if not found. */
|
|
847
|
+
async getProposedCheckpointByNumber(n: CheckpointNumber): Promise<ProposedCheckpointData | undefined> {
|
|
848
|
+
const stored = await this.#proposedCheckpoints.getAsync(n);
|
|
849
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
661
850
|
}
|
|
662
851
|
|
|
663
852
|
/**
|
|
664
|
-
*
|
|
665
|
-
*
|
|
666
|
-
*
|
|
667
|
-
* @returns The requested L2 blocks
|
|
853
|
+
* Returns the pending checkpoint whose header slot matches the given slot, or undefined if not found.
|
|
854
|
+
* Iterates `#proposedCheckpoints` rather than reading an index because the map carries 0–1 entries
|
|
855
|
+
* in normal operation (bounded by the proposer pipelining window). Returns the first match.
|
|
668
856
|
*/
|
|
669
|
-
async
|
|
670
|
-
for await (const [
|
|
671
|
-
const
|
|
672
|
-
if (
|
|
673
|
-
|
|
857
|
+
async getProposedCheckpointBySlot(slot: SlotNumber): Promise<ProposedCheckpointData | undefined> {
|
|
858
|
+
for await (const [, stored] of this.#proposedCheckpoints.entriesAsync()) {
|
|
859
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
860
|
+
if (header.slotNumber === slot) {
|
|
861
|
+
return this.convertToProposedCheckpointData(stored);
|
|
674
862
|
}
|
|
675
863
|
}
|
|
864
|
+
return undefined;
|
|
676
865
|
}
|
|
677
866
|
|
|
678
867
|
/**
|
|
679
|
-
*
|
|
680
|
-
*
|
|
681
|
-
*
|
|
868
|
+
* Evicts all pending checkpoints with checkpoint number >= fromNumber.
|
|
869
|
+
* Used for divergent-mined-checkpoint cleanup: when L1 mines checkpoint N with a different archive,
|
|
870
|
+
* all pending >= N must be evicted since they chain off the now-invalid pending N.
|
|
682
871
|
*/
|
|
683
|
-
async
|
|
684
|
-
const
|
|
685
|
-
|
|
686
|
-
|
|
872
|
+
async evictProposedCheckpointsFrom(fromNumber: CheckpointNumber): Promise<void> {
|
|
873
|
+
const keysToDelete: number[] = [];
|
|
874
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()) {
|
|
875
|
+
if (key >= fromNumber) {
|
|
876
|
+
keysToDelete.push(key);
|
|
877
|
+
}
|
|
878
|
+
}
|
|
879
|
+
for (const key of keysToDelete) {
|
|
880
|
+
await this.#proposedCheckpoints.delete(key);
|
|
687
881
|
}
|
|
688
|
-
return this.getBlockDataFromBlockStorage(blockStorage);
|
|
689
882
|
}
|
|
690
883
|
|
|
691
884
|
/**
|
|
692
|
-
* Gets
|
|
693
|
-
*
|
|
694
|
-
*
|
|
885
|
+
* Gets the checkpoint at the proposed tip:
|
|
886
|
+
* - latest pending checkpoint if any exist
|
|
887
|
+
* - fallsback to latest confirmed checkpoint otherwise
|
|
695
888
|
*/
|
|
696
|
-
async
|
|
697
|
-
const
|
|
698
|
-
if (
|
|
699
|
-
return
|
|
889
|
+
async getLastCheckpoint(): Promise<CommonCheckpointData | undefined> {
|
|
890
|
+
const latest = await this.getLastProposedCheckpoint();
|
|
891
|
+
if (!latest) {
|
|
892
|
+
return this.getCheckpointData(await this.getLatestCheckpointNumber());
|
|
700
893
|
}
|
|
701
|
-
return
|
|
894
|
+
return latest;
|
|
702
895
|
}
|
|
703
896
|
|
|
704
|
-
|
|
705
|
-
|
|
706
|
-
|
|
707
|
-
|
|
708
|
-
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
|
|
712
|
-
|
|
713
|
-
|
|
714
|
-
|
|
897
|
+
private convertToProposedCheckpointData(stored: ProposedCheckpointStorage): ProposedCheckpointData {
|
|
898
|
+
return {
|
|
899
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
900
|
+
header: CheckpointHeader.fromBuffer(stored.header),
|
|
901
|
+
archive: AppendOnlyTreeSnapshot.fromBuffer(stored.archive),
|
|
902
|
+
checkpointOutHash: Fr.fromBuffer(stored.checkpointOutHash),
|
|
903
|
+
startBlock: BlockNumber(stored.startBlock),
|
|
904
|
+
blockCount: stored.blockCount,
|
|
905
|
+
totalManaUsed: BigInt(stored.totalManaUsed),
|
|
906
|
+
feeAssetPriceModifier: BigInt(stored.feeAssetPriceModifier),
|
|
907
|
+
};
|
|
715
908
|
}
|
|
716
909
|
|
|
717
910
|
/**
|
|
718
|
-
*
|
|
719
|
-
* @
|
|
720
|
-
* @returns The requested L2 block.
|
|
911
|
+
* Attempts to get the proposedCheckpoint's number, if there is not one, then fallback to the latest confirmed checkpoint number.
|
|
912
|
+
* @returns CheckpointNumber
|
|
721
913
|
*/
|
|
722
|
-
async
|
|
723
|
-
const
|
|
724
|
-
if (
|
|
725
|
-
return
|
|
914
|
+
async getProposedCheckpointNumber(): Promise<CheckpointNumber> {
|
|
915
|
+
const proposed = await this.getLastCheckpoint();
|
|
916
|
+
if (!proposed) {
|
|
917
|
+
return await this.getLatestCheckpointNumber();
|
|
726
918
|
}
|
|
727
|
-
return
|
|
919
|
+
return CheckpointNumber(proposed.checkpointNumber);
|
|
728
920
|
}
|
|
729
921
|
|
|
730
922
|
/**
|
|
731
|
-
*
|
|
732
|
-
* @
|
|
733
|
-
* @returns The requested L2 block.
|
|
923
|
+
* Attempts to get the proposedCheckpoint's block number, if there is not one, then fallback to the checkpointed block number
|
|
924
|
+
* @returns BlockNumber
|
|
734
925
|
*/
|
|
735
|
-
async
|
|
736
|
-
const
|
|
737
|
-
if (
|
|
738
|
-
return
|
|
926
|
+
async getProposedCheckpointL2BlockNumber(): Promise<BlockNumber> {
|
|
927
|
+
const proposed = await this.getLastCheckpoint();
|
|
928
|
+
if (!proposed) {
|
|
929
|
+
return await this.getCheckpointedL2BlockNumber();
|
|
739
930
|
}
|
|
740
|
-
return
|
|
931
|
+
return BlockNumber(proposed.startBlock + proposed.blockCount - 1);
|
|
741
932
|
}
|
|
742
933
|
|
|
743
|
-
/**
|
|
744
|
-
|
|
745
|
-
|
|
746
|
-
|
|
747
|
-
|
|
748
|
-
|
|
749
|
-
|
|
934
|
+
/** Returns the checkpoint number that contains the given slot (or undefined if not found). */
|
|
935
|
+
async getCheckpointNumberBySlot(slot: SlotNumber): Promise<CheckpointNumber | undefined> {
|
|
936
|
+
const checkpointNumber = await this.#slotToCheckpoint.getAsync(slot);
|
|
937
|
+
return checkpointNumber === undefined ? undefined : CheckpointNumber(checkpointNumber);
|
|
938
|
+
}
|
|
939
|
+
|
|
940
|
+
/** Gets a single L2 block matching the given resolved query. */
|
|
941
|
+
async getBlock(query: ResolvedBlockQuery): Promise<L2Block | undefined> {
|
|
942
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
750
943
|
if (blockNumber === undefined) {
|
|
751
944
|
return undefined;
|
|
752
945
|
}
|
|
753
946
|
const blockStorage = await this.#blocks.getAsync(blockNumber);
|
|
754
|
-
if (!blockStorage
|
|
947
|
+
if (!blockStorage) {
|
|
755
948
|
return undefined;
|
|
756
949
|
}
|
|
757
|
-
return
|
|
950
|
+
return this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
758
951
|
}
|
|
759
952
|
|
|
760
|
-
/**
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
|
|
765
|
-
|
|
766
|
-
|
|
953
|
+
/** Gets a collection of L2 blocks for a resolved range. */
|
|
954
|
+
getBlocks(query: ResolvedBlocksQuery): Promise<L2Block[]> {
|
|
955
|
+
return toArray(this.iterateBlocks(query));
|
|
956
|
+
}
|
|
957
|
+
|
|
958
|
+
/** Gets single block metadata matching the given resolved query. */
|
|
959
|
+
async getBlockData(query: ResolvedBlockQuery): Promise<BlockData | undefined> {
|
|
960
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
767
961
|
if (blockNumber === undefined) {
|
|
768
962
|
return undefined;
|
|
769
963
|
}
|
|
@@ -771,24 +965,36 @@ export class BlockStore {
|
|
|
771
965
|
if (!blockStorage || !blockStorage.header) {
|
|
772
966
|
return undefined;
|
|
773
967
|
}
|
|
774
|
-
return
|
|
968
|
+
return this.getBlockDataFromBlockStorage(blockStorage);
|
|
775
969
|
}
|
|
776
970
|
|
|
777
|
-
/**
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
781
|
-
|
|
782
|
-
|
|
783
|
-
async *
|
|
784
|
-
|
|
785
|
-
|
|
786
|
-
if (
|
|
787
|
-
|
|
788
|
-
|
|
789
|
-
|
|
971
|
+
/** Gets a collection of block metadata entries for a resolved range. */
|
|
972
|
+
getBlocksData(query: ResolvedBlocksQuery): Promise<BlockData[]> {
|
|
973
|
+
return toArray(this.iterateBlocksData(query));
|
|
974
|
+
}
|
|
975
|
+
|
|
976
|
+
/** Async iterator over L2 blocks for a resolved range. */
|
|
977
|
+
private async *iterateBlocks(query: ResolvedBlocksQuery): AsyncIterableIterator<L2Block> {
|
|
978
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
979
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)) {
|
|
980
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
981
|
+
break;
|
|
982
|
+
}
|
|
983
|
+
const block = await this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
984
|
+
if (block) {
|
|
985
|
+
yield block;
|
|
986
|
+
}
|
|
987
|
+
}
|
|
988
|
+
}
|
|
989
|
+
|
|
990
|
+
/** Async iterator over block metadata for a resolved range. */
|
|
991
|
+
private async *iterateBlocksData(query: ResolvedBlocksQuery): AsyncIterableIterator<BlockData> {
|
|
992
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
993
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)) {
|
|
994
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
995
|
+
break;
|
|
790
996
|
}
|
|
791
|
-
yield
|
|
997
|
+
yield this.getBlockDataFromBlockStorage(blockStorage);
|
|
792
998
|
}
|
|
793
999
|
}
|
|
794
1000
|
|
|
@@ -805,11 +1011,29 @@ export class BlockStore {
|
|
|
805
1011
|
}
|
|
806
1012
|
}
|
|
807
1013
|
|
|
1014
|
+
/** Resolves a ResolvedBlockQuery discriminant to a block number, or undefined if not found. */
|
|
1015
|
+
async getBlockNumber(query: ResolvedBlockQuery): Promise<BlockNumber | undefined> {
|
|
1016
|
+
let blockNumber: BlockNumber | undefined;
|
|
1017
|
+
if ('number' in query) {
|
|
1018
|
+
blockNumber = query.number;
|
|
1019
|
+
} else if ('hash' in query) {
|
|
1020
|
+
const n = await this.#blockHashIndex.getAsync(query.hash.toString());
|
|
1021
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
1022
|
+
} else {
|
|
1023
|
+
const n = await this.#blockArchiveIndex.getAsync(query.archive.toString());
|
|
1024
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
1025
|
+
}
|
|
1026
|
+
if (blockNumber === undefined) {
|
|
1027
|
+
return undefined;
|
|
1028
|
+
}
|
|
1029
|
+
return blockNumber;
|
|
1030
|
+
}
|
|
1031
|
+
|
|
808
1032
|
private getBlockDataFromBlockStorage(blockStorage: BlockStorage): BlockData {
|
|
809
1033
|
return {
|
|
810
1034
|
header: BlockHeader.fromBuffer(blockStorage.header),
|
|
811
1035
|
archive: AppendOnlyTreeSnapshot.fromBuffer(blockStorage.archive),
|
|
812
|
-
blockHash:
|
|
1036
|
+
blockHash: BlockHash.fromBuffer(blockStorage.blockHash),
|
|
813
1037
|
checkpointNumber: CheckpointNumber(blockStorage.checkpointNumber),
|
|
814
1038
|
indexWithinCheckpoint: IndexWithinCheckpoint(blockStorage.indexWithinCheckpoint),
|
|
815
1039
|
};
|
|
@@ -866,48 +1090,6 @@ export class BlockStore {
|
|
|
866
1090
|
return deserializeIndexedTxEffect(buffer);
|
|
867
1091
|
}
|
|
868
1092
|
|
|
869
|
-
/**
|
|
870
|
-
* Gets a receipt of a settled tx.
|
|
871
|
-
* @param txHash - The hash of a tx we try to get the receipt for.
|
|
872
|
-
* @returns The requested tx receipt (or undefined if not found).
|
|
873
|
-
*/
|
|
874
|
-
async getSettledTxReceipt(txHash: TxHash): Promise<TxReceipt | undefined> {
|
|
875
|
-
const txEffect = await this.getTxEffect(txHash);
|
|
876
|
-
if (!txEffect) {
|
|
877
|
-
return undefined;
|
|
878
|
-
}
|
|
879
|
-
|
|
880
|
-
const blockNumber = BlockNumber(txEffect.l2BlockNumber);
|
|
881
|
-
|
|
882
|
-
// Use existing archiver methods to determine finalization level
|
|
883
|
-
const [provenBlockNumber, checkpointedBlockNumber, finalizedBlockNumber] = await Promise.all([
|
|
884
|
-
this.getProvenBlockNumber(),
|
|
885
|
-
this.getCheckpointedL2BlockNumber(),
|
|
886
|
-
this.getFinalizedL2BlockNumber(),
|
|
887
|
-
]);
|
|
888
|
-
|
|
889
|
-
let status: TxStatus;
|
|
890
|
-
if (blockNumber <= finalizedBlockNumber) {
|
|
891
|
-
status = TxStatus.FINALIZED;
|
|
892
|
-
} else if (blockNumber <= provenBlockNumber) {
|
|
893
|
-
status = TxStatus.PROVEN;
|
|
894
|
-
} else if (blockNumber <= checkpointedBlockNumber) {
|
|
895
|
-
status = TxStatus.CHECKPOINTED;
|
|
896
|
-
} else {
|
|
897
|
-
status = TxStatus.PROPOSED;
|
|
898
|
-
}
|
|
899
|
-
|
|
900
|
-
return new TxReceipt(
|
|
901
|
-
txHash,
|
|
902
|
-
status,
|
|
903
|
-
TxReceipt.executionResultFromRevertCode(txEffect.data.revertCode),
|
|
904
|
-
undefined,
|
|
905
|
-
txEffect.data.transactionFee.toBigInt(),
|
|
906
|
-
txEffect.l2BlockHash,
|
|
907
|
-
blockNumber,
|
|
908
|
-
);
|
|
909
|
-
}
|
|
910
|
-
|
|
911
1093
|
/**
|
|
912
1094
|
* Looks up which block included the requested tx effect.
|
|
913
1095
|
* @param txHash - The txHash of the tx.
|
|
@@ -918,10 +1100,45 @@ export class BlockStore {
|
|
|
918
1100
|
if (!txEffect) {
|
|
919
1101
|
return undefined;
|
|
920
1102
|
}
|
|
921
|
-
|
|
1103
|
+
// Read only the IndexedTxEffect header (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4)`); the
|
|
1104
|
+
// large tail (the full TxEffect with logs etc.) is irrelevant here.
|
|
1105
|
+
const view = Buffer.from(txEffect.buffer, txEffect.byteOffset, txEffect.byteLength);
|
|
1106
|
+
const l2BlockNumber = view.readUInt32BE(32);
|
|
1107
|
+
const txIndexInBlock = view.readUInt32BE(36);
|
|
922
1108
|
return [l2BlockNumber, txIndexInBlock];
|
|
923
1109
|
}
|
|
924
1110
|
|
|
1111
|
+
/**
|
|
1112
|
+
* Batched, partial deserializer that fetches `noteHashes` and `nullifiers` (all of them) for the given
|
|
1113
|
+
* txs. For each input txHash, returns a `[noteHashes, nullifiers]` tuple. Returns `[[], []]` for any
|
|
1114
|
+
* unknown txHash. Preserves input order. Used by the log read path when `includeEffects` is set to
|
|
1115
|
+
* attach effect data on demand without paying for a full {@link TxEffect} deserialization.
|
|
1116
|
+
*
|
|
1117
|
+
* The on-disk `IndexedTxEffect` layout starts with a fixed-length header
|
|
1118
|
+
* (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4) + slotNumber(4) + revertCode(1) + txHash(32) +
|
|
1119
|
+
* transactionFee(32)` = 109 bytes), followed by `noteHashes` and `nullifiers` (both u8-length-prefixed `Fr`
|
|
1120
|
+
* vectors). We
|
|
1121
|
+
* skip the header, then read the two vectors, and stop — the large tail (`l2ToL1Msgs`,
|
|
1122
|
+
* `publicDataWrites`, `privateLogs`, `publicLogs`, `contractClassLogs`) is never touched.
|
|
1123
|
+
*/
|
|
1124
|
+
public getNoteHashesAndNullifiers(txHashes: TxHash[]): Promise<[Fr[], Fr[]][]> {
|
|
1125
|
+
return Promise.all(
|
|
1126
|
+
txHashes.map(async (txHash): Promise<[Fr[], Fr[]]> => {
|
|
1127
|
+
const buffer = await this.#txEffects.getAsync(txHash.toString());
|
|
1128
|
+
if (!buffer) {
|
|
1129
|
+
return [[], []];
|
|
1130
|
+
}
|
|
1131
|
+
const reader = BufferReader.asReader(buffer);
|
|
1132
|
+
// Skip the fixed-length header: blockHash + l2BlockNumber + txIndexInBlock + slotNumber + revertCode +
|
|
1133
|
+
// txHash + transactionFee.
|
|
1134
|
+
reader.readBytes(32 + 4 + 4 + 4 + 1 + 32 + 32);
|
|
1135
|
+
const noteHashes = reader.readVectorUint8Prefix(Fr);
|
|
1136
|
+
const nullifiers = reader.readVectorUint8Prefix(Fr);
|
|
1137
|
+
return [noteHashes, nullifiers];
|
|
1138
|
+
}),
|
|
1139
|
+
);
|
|
1140
|
+
}
|
|
1141
|
+
|
|
925
1142
|
/**
|
|
926
1143
|
* Looks up which block deployed a particular contract.
|
|
927
1144
|
* @param contractAddress - The address of the contract to look up.
|
|
@@ -949,6 +1166,174 @@ export class BlockStore {
|
|
|
949
1166
|
return typeof lastBlockNumber === 'number' ? BlockNumber(lastBlockNumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
950
1167
|
}
|
|
951
1168
|
|
|
1169
|
+
/**
|
|
1170
|
+
* Resolves all five L2 chain tips (proposed, proposedCheckpoint, checkpointed, proven, finalized)
|
|
1171
|
+
* in a single read-only transaction so the snapshot is internally consistent. Each underlying
|
|
1172
|
+
* record is read at most once: latest block, latest confirmed checkpoint, and latest pending
|
|
1173
|
+
* checkpoint are each loaded directly (no separate "find the number, then look up data" hop),
|
|
1174
|
+
* the proven/finalized checkpoint singletons are read once and their storage entries are
|
|
1175
|
+
* reused if they coincide with the latest checkpoint, and per-tip block hashes are deduped
|
|
1176
|
+
* when two tips land on the same block (e.g. finalized == proven, or proposedCheckpoint falls
|
|
1177
|
+
* back to checkpointed when no pending checkpoint exists).
|
|
1178
|
+
*
|
|
1179
|
+
* The result is guaranteed to satisfy `finalized <= proven <= checkpointed <= proposed` (by
|
|
1180
|
+
* block number). Genesis is represented by `(INITIAL_L2_BLOCK_NUM - 1)` and the supplied
|
|
1181
|
+
* `genesisBlockHash`, paired with the synthetic genesis checkpoint id.
|
|
1182
|
+
*
|
|
1183
|
+
* @param genesisBlockHash - Block hash to report for the synthetic pre-initial block (used when
|
|
1184
|
+
* a tip is still at genesis).
|
|
1185
|
+
*/
|
|
1186
|
+
async getL2TipsData(genesisBlockHash: BlockHash): Promise<L2Tips> {
|
|
1187
|
+
return await this.db.transactionAsync(async () => {
|
|
1188
|
+
// Define genesis tips
|
|
1189
|
+
const genesisBlockNumber = BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
1190
|
+
const genesisCheckpointNumber = CheckpointNumber(INITIAL_CHECKPOINT_NUMBER - 1);
|
|
1191
|
+
const genesisBlockId = { number: genesisBlockNumber, hash: genesisBlockHash.toString() };
|
|
1192
|
+
const genesisCheckpointId = {
|
|
1193
|
+
number: genesisCheckpointNumber,
|
|
1194
|
+
hash: GENESIS_CHECKPOINT_HEADER_HASH.toString(),
|
|
1195
|
+
};
|
|
1196
|
+
const genesisTip: L2TipId = { block: genesisBlockId, checkpoint: genesisCheckpointId };
|
|
1197
|
+
|
|
1198
|
+
// Load latest block and checkpoint entries
|
|
1199
|
+
const [latestBlockEntry] = await toArray(this.#blocks.entriesAsync({ reverse: true, limit: 1 }));
|
|
1200
|
+
const [proposedCheckpointEntry] = await toArray(
|
|
1201
|
+
this.#proposedCheckpoints.entriesAsync({ reverse: true, limit: 1 }),
|
|
1202
|
+
);
|
|
1203
|
+
const [latestCheckpointEntry] = await toArray(this.#checkpoints.entriesAsync({ reverse: true, limit: 1 }));
|
|
1204
|
+
const latestCheckpointNumber = latestCheckpointEntry
|
|
1205
|
+
? CheckpointNumber(latestCheckpointEntry[0])
|
|
1206
|
+
: genesisCheckpointNumber;
|
|
1207
|
+
|
|
1208
|
+
// Load proven and finalized checkpoint number pointers
|
|
1209
|
+
const [provenRaw, finalizedRaw] = await Promise.all([
|
|
1210
|
+
this.#lastProvenCheckpoint.getAsync(),
|
|
1211
|
+
this.#lastFinalizedCheckpoint.getAsync(),
|
|
1212
|
+
]);
|
|
1213
|
+
|
|
1214
|
+
// Clamp to enforce finalized <= proven <= checkpointed.
|
|
1215
|
+
const provenCheckpointNumber = CheckpointNumber(Math.min(provenRaw ?? 0, latestCheckpointNumber));
|
|
1216
|
+
const finalizedCheckpointNumber = CheckpointNumber(Math.min(finalizedRaw ?? 0, provenCheckpointNumber));
|
|
1217
|
+
|
|
1218
|
+
// Avoid loading the same checkpoint more than once
|
|
1219
|
+
const checkpointStorageCache = new Map<CheckpointNumber, CheckpointStorage>();
|
|
1220
|
+
if (latestCheckpointEntry) {
|
|
1221
|
+
checkpointStorageCache.set(CheckpointNumber(latestCheckpointEntry[0]), latestCheckpointEntry[1]);
|
|
1222
|
+
}
|
|
1223
|
+
const loadCheckpointStorage = async (n: CheckpointNumber): Promise<CheckpointStorage | undefined> => {
|
|
1224
|
+
if (n === 0) {
|
|
1225
|
+
return undefined;
|
|
1226
|
+
}
|
|
1227
|
+
if (!checkpointStorageCache.has(n)) {
|
|
1228
|
+
const checkpointStorage = await this.#checkpoints.getAsync(n);
|
|
1229
|
+
if (!checkpointStorage) {
|
|
1230
|
+
throw new CheckpointNotFoundError(n);
|
|
1231
|
+
}
|
|
1232
|
+
checkpointStorageCache.set(n, checkpointStorage);
|
|
1233
|
+
}
|
|
1234
|
+
return checkpointStorageCache.get(n)!;
|
|
1235
|
+
};
|
|
1236
|
+
|
|
1237
|
+
// Load proven and finalized checkpoint storage entries
|
|
1238
|
+
const provenCheckpoint = await loadCheckpointStorage(provenCheckpointNumber);
|
|
1239
|
+
const finalizedCheckpoint = await loadCheckpointStorage(finalizedCheckpointNumber);
|
|
1240
|
+
|
|
1241
|
+
// Avoid loading the same block hash multiple times when tips land on the same block
|
|
1242
|
+
const blockHashCache = new Map<number, string>();
|
|
1243
|
+
blockHashCache.set(genesisBlockNumber, genesisBlockHash.toString());
|
|
1244
|
+
if (latestBlockEntry) {
|
|
1245
|
+
blockHashCache.set(latestBlockEntry[0], BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString());
|
|
1246
|
+
}
|
|
1247
|
+
const loadBlockHash = async (n: BlockNumber): Promise<string> => {
|
|
1248
|
+
if (!blockHashCache.has(n)) {
|
|
1249
|
+
const blockStorage = await this.#blocks.getAsync(n);
|
|
1250
|
+
if (!blockStorage) {
|
|
1251
|
+
throw new BlockNotFoundError(n);
|
|
1252
|
+
}
|
|
1253
|
+
const blockHash = BlockHash.fromBuffer(blockStorage.blockHash).toString();
|
|
1254
|
+
blockHashCache.set(n, blockHash);
|
|
1255
|
+
}
|
|
1256
|
+
return blockHashCache.get(n)!;
|
|
1257
|
+
};
|
|
1258
|
+
|
|
1259
|
+
// Build proposed chain tip (this one has block only, no checkpoint)
|
|
1260
|
+
const proposedBlockId =
|
|
1261
|
+
latestBlockEntry === undefined
|
|
1262
|
+
? genesisBlockId
|
|
1263
|
+
: {
|
|
1264
|
+
number: BlockNumber(latestBlockEntry[0]),
|
|
1265
|
+
hash: BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString(),
|
|
1266
|
+
};
|
|
1267
|
+
|
|
1268
|
+
// Build other tips from checkpoint data, reading corresponding block data from the cache
|
|
1269
|
+
const buildTipFromCheckpoint = async (
|
|
1270
|
+
stored: ProposedCheckpointStorage | CheckpointStorage | undefined,
|
|
1271
|
+
): Promise<L2TipId> => {
|
|
1272
|
+
if (!stored) {
|
|
1273
|
+
return genesisTip;
|
|
1274
|
+
}
|
|
1275
|
+
const blockNumber = BlockNumber(stored.startBlock + stored.blockCount - 1);
|
|
1276
|
+
const blockHash = await loadBlockHash(blockNumber);
|
|
1277
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
1278
|
+
return {
|
|
1279
|
+
block: { number: blockNumber, hash: blockHash },
|
|
1280
|
+
checkpoint: { number: CheckpointNumber(stored.checkpointNumber), hash: header.hash().toString() },
|
|
1281
|
+
};
|
|
1282
|
+
};
|
|
1283
|
+
|
|
1284
|
+
const checkpointedTip = await buildTipFromCheckpoint(latestCheckpointEntry?.[1]);
|
|
1285
|
+
const provenTip = await buildTipFromCheckpoint(provenCheckpoint);
|
|
1286
|
+
const finalizedTip = await buildTipFromCheckpoint(finalizedCheckpoint);
|
|
1287
|
+
|
|
1288
|
+
// Proposed checkpoint falls back to the checkpoint tip if it's not set. And if local storage is
|
|
1289
|
+
// inconsistent and the proposed checkpoint is behind the checkpointed tip, we patch that and
|
|
1290
|
+
// report the checkpointed tip as the proposed checkpoint to maintain the invariant.
|
|
1291
|
+
const proposedCheckpointTip =
|
|
1292
|
+
proposedCheckpointEntry === undefined || proposedCheckpointEntry[0] <= latestCheckpointNumber
|
|
1293
|
+
? checkpointedTip
|
|
1294
|
+
: await buildTipFromCheckpoint(proposedCheckpointEntry[1]);
|
|
1295
|
+
|
|
1296
|
+
// A checkpointed block past the latest stored block would mean a checkpoint
|
|
1297
|
+
// references blocks that aren't in blocks.
|
|
1298
|
+
if (proposedBlockId.number < checkpointedTip.block.number) {
|
|
1299
|
+
throw new Error(
|
|
1300
|
+
`Inconsistent block store: latest block ${proposedBlockId.number} is behind checkpointed block ${checkpointedTip.block.number}`,
|
|
1301
|
+
);
|
|
1302
|
+
}
|
|
1303
|
+
|
|
1304
|
+
// Assert that checkpoint numbers are increasing
|
|
1305
|
+
if (
|
|
1306
|
+
finalizedTip.checkpoint.number > provenTip.checkpoint.number ||
|
|
1307
|
+
provenTip.checkpoint.number > checkpointedTip.checkpoint.number ||
|
|
1308
|
+
checkpointedTip.checkpoint.number > proposedCheckpointTip.checkpoint.number
|
|
1309
|
+
) {
|
|
1310
|
+
throw new Error(
|
|
1311
|
+
`Inconsistent checkpoint numbers in chain tips: finalized=${finalizedTip.checkpoint.number} proven=${provenTip.checkpoint.number} checkpointed=${checkpointedTip.checkpoint.number} proposed=${proposedCheckpointTip.checkpoint.number}`,
|
|
1312
|
+
);
|
|
1313
|
+
}
|
|
1314
|
+
|
|
1315
|
+
// Assert block numbers are increasing
|
|
1316
|
+
if (
|
|
1317
|
+
finalizedTip.block.number > provenTip.block.number ||
|
|
1318
|
+
provenTip.block.number > checkpointedTip.block.number ||
|
|
1319
|
+
checkpointedTip.block.number > proposedCheckpointTip.block.number ||
|
|
1320
|
+
proposedCheckpointTip.block.number > proposedBlockId.number
|
|
1321
|
+
) {
|
|
1322
|
+
throw new Error(
|
|
1323
|
+
`Inconsistent block numbers in chain tips: finalized=${finalizedTip.block.number} proven=${provenTip.block.number} checkpointed=${checkpointedTip.block.number} proposedCheckpoint=${proposedCheckpointTip.block.number} proposed=${proposedBlockId.number}`,
|
|
1324
|
+
);
|
|
1325
|
+
}
|
|
1326
|
+
|
|
1327
|
+
return {
|
|
1328
|
+
proposed: proposedBlockId,
|
|
1329
|
+
proposedCheckpoint: proposedCheckpointTip,
|
|
1330
|
+
checkpointed: checkpointedTip,
|
|
1331
|
+
proven: provenTip,
|
|
1332
|
+
finalized: finalizedTip,
|
|
1333
|
+
};
|
|
1334
|
+
});
|
|
1335
|
+
}
|
|
1336
|
+
|
|
952
1337
|
/**
|
|
953
1338
|
* Gets the most recent L1 block processed.
|
|
954
1339
|
* @returns The L1 block that published the latest L2 block
|
|
@@ -961,14 +1346,62 @@ export class BlockStore {
|
|
|
961
1346
|
return this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
962
1347
|
}
|
|
963
1348
|
|
|
1349
|
+
/**
|
|
1350
|
+
* Adds a proposed checkpoint to the pending queue.
|
|
1351
|
+
* Accepts proposed.checkpointNumber === latestTip + 1, where latestTip is the highest of
|
|
1352
|
+
* confirmed and the highest pending checkpoint number.
|
|
1353
|
+
* Computes archive and checkpointOutHash from the stored blocks.
|
|
1354
|
+
*/
|
|
1355
|
+
async addProposedCheckpoint(proposed: ProposedCheckpointInput) {
|
|
1356
|
+
return await this.db.transactionAsync(async () => {
|
|
1357
|
+
const confirmed = await this.getLatestCheckpointNumber();
|
|
1358
|
+
const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({ reverse: true, limit: 1 }));
|
|
1359
|
+
const latestTip = CheckpointNumber(
|
|
1360
|
+
latestPendingKey !== undefined ? Math.max(latestPendingKey, confirmed) : confirmed,
|
|
1361
|
+
);
|
|
1362
|
+
|
|
1363
|
+
if (proposed.checkpointNumber !== latestTip + 1) {
|
|
1364
|
+
throw new ProposedCheckpointNotSequentialError(proposed.checkpointNumber, latestTip);
|
|
1365
|
+
}
|
|
1366
|
+
|
|
1367
|
+
// Ensure the predecessor block (from pending or confirmed chain) exists
|
|
1368
|
+
const previousBlock = await this.getPreviousCheckpointBlock(proposed.checkpointNumber);
|
|
1369
|
+
const blocks: L2Block[] = [];
|
|
1370
|
+
for (let i = 0; i < proposed.blockCount; i++) {
|
|
1371
|
+
const block = await this.getBlock({ number: BlockNumber(proposed.startBlock + i) });
|
|
1372
|
+
if (!block) {
|
|
1373
|
+
throw new BlockNotFoundError(proposed.startBlock + i);
|
|
1374
|
+
}
|
|
1375
|
+
blocks.push(block);
|
|
1376
|
+
}
|
|
1377
|
+
this.validateCheckpointBlocks(blocks, previousBlock);
|
|
1378
|
+
|
|
1379
|
+
const archive = blocks[blocks.length - 1].archive;
|
|
1380
|
+
const checkpointOutHash = Checkpoint.getCheckpointOutHash(blocks);
|
|
1381
|
+
|
|
1382
|
+
await this.#proposedCheckpoints.set(proposed.checkpointNumber, {
|
|
1383
|
+
header: proposed.header.toBuffer(),
|
|
1384
|
+
archive: archive.toBuffer(),
|
|
1385
|
+
checkpointOutHash: checkpointOutHash.toBuffer(),
|
|
1386
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
1387
|
+
startBlock: proposed.startBlock,
|
|
1388
|
+
blockCount: proposed.blockCount,
|
|
1389
|
+
totalManaUsed: proposed.totalManaUsed.toString(),
|
|
1390
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString(),
|
|
1391
|
+
});
|
|
1392
|
+
});
|
|
1393
|
+
}
|
|
1394
|
+
|
|
964
1395
|
async getProvenCheckpointNumber(): Promise<CheckpointNumber> {
|
|
965
|
-
|
|
966
|
-
|
|
967
|
-
|
|
968
|
-
|
|
969
|
-
|
|
970
|
-
|
|
971
|
-
|
|
1396
|
+
return await this.db.transactionAsync(async () => {
|
|
1397
|
+
const [latestCheckpointNumber, provenCheckpointNumber] = await Promise.all([
|
|
1398
|
+
this.getLatestCheckpointNumber(),
|
|
1399
|
+
this.#lastProvenCheckpoint.getAsync(),
|
|
1400
|
+
]);
|
|
1401
|
+
return (provenCheckpointNumber ?? 0) > latestCheckpointNumber
|
|
1402
|
+
? latestCheckpointNumber
|
|
1403
|
+
: CheckpointNumber(provenCheckpointNumber ?? 0);
|
|
1404
|
+
});
|
|
972
1405
|
}
|
|
973
1406
|
|
|
974
1407
|
async setProvenCheckpointNumber(checkpointNumber: CheckpointNumber) {
|
|
@@ -976,6 +1409,22 @@ export class BlockStore {
|
|
|
976
1409
|
return result;
|
|
977
1410
|
}
|
|
978
1411
|
|
|
1412
|
+
async getFinalizedCheckpointNumber(): Promise<CheckpointNumber> {
|
|
1413
|
+
return await this.db.transactionAsync(async () => {
|
|
1414
|
+
const [provenCheckpointNumber, finalizedCheckpointNumber] = await Promise.all([
|
|
1415
|
+
this.getProvenCheckpointNumber(),
|
|
1416
|
+
this.#lastFinalizedCheckpoint.getAsync(),
|
|
1417
|
+
]);
|
|
1418
|
+
return (finalizedCheckpointNumber ?? 0) > provenCheckpointNumber
|
|
1419
|
+
? provenCheckpointNumber
|
|
1420
|
+
: CheckpointNumber(finalizedCheckpointNumber ?? 0);
|
|
1421
|
+
});
|
|
1422
|
+
}
|
|
1423
|
+
|
|
1424
|
+
setFinalizedCheckpointNumber(checkpointNumber: CheckpointNumber) {
|
|
1425
|
+
return this.#lastFinalizedCheckpoint.set(checkpointNumber);
|
|
1426
|
+
}
|
|
1427
|
+
|
|
979
1428
|
#computeBlockRange(start: BlockNumber, limit: number): Required<Pick<Range<number>, 'start' | 'limit'>> {
|
|
980
1429
|
if (limit < 1) {
|
|
981
1430
|
throw new Error(`Invalid limit: ${limit}`);
|
|
@@ -1012,4 +1461,80 @@ export class BlockStore {
|
|
|
1012
1461
|
await this.#pendingChainValidationStatus.delete();
|
|
1013
1462
|
}
|
|
1014
1463
|
}
|
|
1464
|
+
|
|
1465
|
+
/** Records a rejected-checkpoint entry, keyed by its own archive root. */
|
|
1466
|
+
async addRejectedCheckpoint(entry: RejectedCheckpoint): Promise<void> {
|
|
1467
|
+
const archiveRootHex = entry.archiveRoot.toString();
|
|
1468
|
+
await this.#rejectedCheckpoints.set(archiveRootHex, {
|
|
1469
|
+
checkpointNumber: entry.checkpointNumber,
|
|
1470
|
+
archiveRoot: entry.archiveRoot.toBuffer(),
|
|
1471
|
+
parentArchiveRoot: entry.parentArchiveRoot.toBuffer(),
|
|
1472
|
+
slotNumber: entry.slotNumber,
|
|
1473
|
+
l1: entry.l1.toBuffer(),
|
|
1474
|
+
reason: entry.reason,
|
|
1475
|
+
});
|
|
1476
|
+
await this.#rejectedCheckpointsByNumber.set(entry.checkpointNumber, archiveRootHex);
|
|
1477
|
+
await this.advanceSynchedL1BlockNumber(entry.l1.blockNumber);
|
|
1478
|
+
}
|
|
1479
|
+
|
|
1480
|
+
/** Returns the rejected-checkpoint entry with the given archive root, or undefined if not present. */
|
|
1481
|
+
async getRejectedCheckpointByArchiveRoot(archiveRoot: Fr): Promise<RejectedCheckpoint | undefined> {
|
|
1482
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRoot.toString());
|
|
1483
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1484
|
+
}
|
|
1485
|
+
|
|
1486
|
+
/** Returns the rejected-checkpoint entry recorded for the given checkpoint number, or undefined if none. */
|
|
1487
|
+
async getRejectedCheckpointByNumber(checkpointNumber: CheckpointNumber): Promise<RejectedCheckpoint | undefined> {
|
|
1488
|
+
const archiveRootHex = await this.#rejectedCheckpointsByNumber.getAsync(checkpointNumber);
|
|
1489
|
+
if (archiveRootHex === undefined) {
|
|
1490
|
+
return undefined;
|
|
1491
|
+
}
|
|
1492
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1493
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1494
|
+
}
|
|
1495
|
+
|
|
1496
|
+
/** Returns the highest checkpoint number recorded across all rejected entries, or `INITIAL_CHECKPOINT_NUMBER - 1` if none. */
|
|
1497
|
+
async getLatestRejectedCheckpointNumber(): Promise<CheckpointNumber> {
|
|
1498
|
+
const [latest] = await toArray(this.#rejectedCheckpointsByNumber.keysAsync({ reverse: true, limit: 1 }));
|
|
1499
|
+
return CheckpointNumber(latest ?? INITIAL_CHECKPOINT_NUMBER - 1);
|
|
1500
|
+
}
|
|
1501
|
+
|
|
1502
|
+
/** Removes a rejected-checkpoint entry by its archive root (used when an entry no longer matches L1). */
|
|
1503
|
+
async removeRejectedCheckpointByArchiveRoot(archiveRoot: Fr): Promise<void> {
|
|
1504
|
+
const archiveRootHex = archiveRoot.toString();
|
|
1505
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1506
|
+
await this.#rejectedCheckpoints.delete(archiveRootHex);
|
|
1507
|
+
if (stored) {
|
|
1508
|
+
// Only clear the by-number index if it still points at this archive root, so a distinct
|
|
1509
|
+
// entry that shares the checkpoint number (e.g. an L1 reorg replacement) is not dropped.
|
|
1510
|
+
const indexed = await this.#rejectedCheckpointsByNumber.getAsync(stored.checkpointNumber);
|
|
1511
|
+
if (indexed === archiveRootHex) {
|
|
1512
|
+
await this.#rejectedCheckpointsByNumber.delete(stored.checkpointNumber);
|
|
1513
|
+
}
|
|
1514
|
+
}
|
|
1515
|
+
}
|
|
1516
|
+
|
|
1517
|
+
/**
|
|
1518
|
+
* Advances the stored last-synched L1 block number to `l1BlockNumber` only if it is strictly
|
|
1519
|
+
* greater than the current value. Use this whenever ingesting checkpoint-shaped data so the
|
|
1520
|
+
* sync pointer never walks backwards on out-of-order writes (e.g. an invalid checkpoint
|
|
1521
|
+
* advance followed by a valid-checkpoint commit landing at an earlier L1 block).
|
|
1522
|
+
*/
|
|
1523
|
+
private async advanceSynchedL1BlockNumber(l1BlockNumber: bigint): Promise<void> {
|
|
1524
|
+
const current = await this.#lastSynchedL1Block.getAsync();
|
|
1525
|
+
if (current === undefined || l1BlockNumber > current) {
|
|
1526
|
+
await this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
1527
|
+
}
|
|
1528
|
+
}
|
|
1529
|
+
|
|
1530
|
+
private rejectedCheckpointFromStorage(stored: RejectedCheckpointStorage): RejectedCheckpoint {
|
|
1531
|
+
return {
|
|
1532
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
1533
|
+
archiveRoot: Fr.fromBuffer(stored.archiveRoot),
|
|
1534
|
+
parentArchiveRoot: Fr.fromBuffer(stored.parentArchiveRoot),
|
|
1535
|
+
slotNumber: SlotNumber(stored.slotNumber),
|
|
1536
|
+
l1: L1PublishedData.fromBuffer(stored.l1),
|
|
1537
|
+
reason: stored.reason,
|
|
1538
|
+
};
|
|
1539
|
+
}
|
|
1015
1540
|
}
|