@aztec/archiver 0.0.1-commit.e3c1de76 → 0.0.1-commit.e588bc7e5
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 +12 -6
- package/dest/archiver.d.ts +9 -6
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +78 -113
- package/dest/config.d.ts +3 -3
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +2 -1
- package/dest/errors.d.ts +34 -10
- package/dest/errors.d.ts.map +1 -1
- package/dest/errors.js +45 -16
- package/dest/factory.d.ts +4 -5
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +31 -26
- package/dest/index.d.ts +2 -1
- package/dest/index.d.ts.map +1 -1
- package/dest/index.js +1 -0
- package/dest/l1/bin/retrieve-calldata.js +36 -33
- package/dest/l1/calldata_retriever.d.ts +73 -50
- package/dest/l1/calldata_retriever.d.ts.map +1 -1
- package/dest/l1/calldata_retriever.js +191 -259
- package/dest/l1/data_retrieval.d.ts +10 -10
- package/dest/l1/data_retrieval.d.ts.map +1 -1
- package/dest/l1/data_retrieval.js +35 -34
- package/dest/l1/spire_proposer.d.ts +5 -5
- package/dest/l1/spire_proposer.d.ts.map +1 -1
- package/dest/l1/spire_proposer.js +9 -17
- package/dest/modules/data_source_base.d.ts +14 -7
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +39 -77
- package/dest/modules/data_store_updater.d.ts +25 -12
- package/dest/modules/data_store_updater.d.ts.map +1 -1
- package/dest/modules/data_store_updater.js +125 -94
- package/dest/modules/instrumentation.d.ts +15 -2
- package/dest/modules/instrumentation.d.ts.map +1 -1
- package/dest/modules/instrumentation.js +19 -2
- package/dest/modules/l1_synchronizer.d.ts +7 -9
- package/dest/modules/l1_synchronizer.d.ts.map +1 -1
- package/dest/modules/l1_synchronizer.js +176 -136
- package/dest/modules/validation.d.ts +1 -1
- package/dest/modules/validation.d.ts.map +1 -1
- package/dest/modules/validation.js +2 -2
- package/dest/store/block_store.d.ts +65 -28
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +311 -134
- package/dest/store/contract_class_store.d.ts +2 -3
- package/dest/store/contract_class_store.d.ts.map +1 -1
- package/dest/store/contract_class_store.js +7 -67
- package/dest/store/contract_instance_store.d.ts +1 -1
- package/dest/store/contract_instance_store.d.ts.map +1 -1
- package/dest/store/contract_instance_store.js +6 -2
- package/dest/store/kv_archiver_store.d.ts +61 -24
- package/dest/store/kv_archiver_store.d.ts.map +1 -1
- package/dest/store/kv_archiver_store.js +75 -27
- package/dest/store/l2_tips_cache.d.ts +20 -0
- package/dest/store/l2_tips_cache.d.ts.map +1 -0
- package/dest/store/l2_tips_cache.js +109 -0
- package/dest/store/log_store.d.ts +6 -3
- package/dest/store/log_store.d.ts.map +1 -1
- package/dest/store/log_store.js +148 -51
- package/dest/store/message_store.d.ts +5 -1
- package/dest/store/message_store.d.ts.map +1 -1
- package/dest/store/message_store.js +21 -9
- package/dest/test/fake_l1_state.d.ts +14 -1
- package/dest/test/fake_l1_state.d.ts.map +1 -1
- package/dest/test/fake_l1_state.js +120 -26
- package/dest/test/mock_archiver.d.ts +1 -1
- package/dest/test/mock_archiver.d.ts.map +1 -1
- package/dest/test/mock_archiver.js +3 -2
- 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 +26 -5
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +160 -89
- 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 +4 -1
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +5 -1
- package/package.json +13 -13
- package/src/archiver.ts +97 -133
- package/src/config.ts +8 -1
- package/src/errors.ts +70 -26
- package/src/factory.ts +46 -24
- package/src/index.ts +1 -0
- package/src/l1/README.md +25 -68
- package/src/l1/bin/retrieve-calldata.ts +46 -39
- package/src/l1/calldata_retriever.ts +250 -379
- package/src/l1/data_retrieval.ts +31 -37
- package/src/l1/spire_proposer.ts +7 -15
- package/src/modules/data_source_base.ts +78 -98
- package/src/modules/data_store_updater.ts +138 -124
- package/src/modules/instrumentation.ts +29 -2
- package/src/modules/l1_synchronizer.ts +195 -168
- package/src/modules/validation.ts +2 -2
- package/src/store/block_store.ts +393 -170
- package/src/store/contract_class_store.ts +8 -106
- package/src/store/contract_instance_store.ts +8 -5
- package/src/store/kv_archiver_store.ts +115 -41
- package/src/store/l2_tips_cache.ts +128 -0
- package/src/store/log_store.ts +219 -58
- package/src/store/message_store.ts +27 -10
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +163 -30
- package/src/test/mock_archiver.ts +3 -2
- package/src/test/mock_l1_to_l2_message_source.ts +1 -0
- package/src/test/mock_l2_block_source.ts +209 -82
- package/src/test/mock_structs.ts +20 -6
- package/src/test/noop_l1_archiver.ts +7 -1
|
@@ -1,19 +1,19 @@
|
|
|
1
1
|
import type { BlobClientInterface } from '@aztec/blob-client/client';
|
|
2
2
|
import { EpochCache } from '@aztec/epoch-cache';
|
|
3
|
-
import { InboxContract, RollupContract } from '@aztec/ethereum/contracts';
|
|
4
|
-
import type { L1ContractAddresses } from '@aztec/ethereum/l1-contract-addresses';
|
|
3
|
+
import { InboxContract, type InboxContractState, RollupContract } from '@aztec/ethereum/contracts';
|
|
5
4
|
import type { L1BlockId } from '@aztec/ethereum/l1-types';
|
|
6
5
|
import type { ViemPublicClient, ViemPublicDebugClient } from '@aztec/ethereum/types';
|
|
6
|
+
import { asyncPool } from '@aztec/foundation/async-pool';
|
|
7
7
|
import { maxBigint } from '@aztec/foundation/bigint';
|
|
8
8
|
import { BlockNumber, CheckpointNumber, EpochNumber } from '@aztec/foundation/branded-types';
|
|
9
|
-
import { Buffer32 } from '@aztec/foundation/buffer';
|
|
9
|
+
import { Buffer16, Buffer32 } from '@aztec/foundation/buffer';
|
|
10
10
|
import { pick } from '@aztec/foundation/collection';
|
|
11
11
|
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
12
|
-
import { EthAddress } from '@aztec/foundation/eth-address';
|
|
13
12
|
import { type Logger, createLogger } from '@aztec/foundation/log';
|
|
13
|
+
import { retryTimes } from '@aztec/foundation/retry';
|
|
14
14
|
import { count } from '@aztec/foundation/string';
|
|
15
15
|
import { DateProvider, Timer, elapsed } from '@aztec/foundation/timer';
|
|
16
|
-
import { isDefined } from '@aztec/foundation/types';
|
|
16
|
+
import { isDefined, isErrorClass } from '@aztec/foundation/types';
|
|
17
17
|
import { type ArchiverEmitter, L2BlockSourceEvents, type ValidateCheckpointResult } from '@aztec/stdlib/block';
|
|
18
18
|
import { PublishedCheckpoint } from '@aztec/stdlib/checkpoint';
|
|
19
19
|
import { type L1RollupConstants, getEpochAtSlot, getSlotAtNextL1Block } from '@aztec/stdlib/epoch-helpers';
|
|
@@ -28,6 +28,8 @@ import {
|
|
|
28
28
|
retrievedToPublishedCheckpoint,
|
|
29
29
|
} from '../l1/data_retrieval.js';
|
|
30
30
|
import type { KVArchiverDataStore } from '../store/kv_archiver_store.js';
|
|
31
|
+
import type { L2TipsCache } from '../store/l2_tips_cache.js';
|
|
32
|
+
import { MessageStoreError } from '../store/message_store.js';
|
|
31
33
|
import type { InboxMessage } from '../structs/inbox_message.js';
|
|
32
34
|
import { ArchiverDataStoreUpdater } from './data_store_updater.js';
|
|
33
35
|
import type { ArchiverInstrumentation } from './instrumentation.js';
|
|
@@ -60,10 +62,6 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
60
62
|
private readonly debugClient: ViemPublicDebugClient,
|
|
61
63
|
private readonly rollup: RollupContract,
|
|
62
64
|
private readonly inbox: InboxContract,
|
|
63
|
-
private readonly l1Addresses: Pick<
|
|
64
|
-
L1ContractAddresses,
|
|
65
|
-
'registryAddress' | 'governanceProposerAddress' | 'slashFactoryAddress'
|
|
66
|
-
> & { slashingProposerAddress: EthAddress },
|
|
67
65
|
private readonly store: KVArchiverDataStore,
|
|
68
66
|
private config: {
|
|
69
67
|
batchSize: number;
|
|
@@ -74,12 +72,18 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
74
72
|
private readonly epochCache: EpochCache,
|
|
75
73
|
private readonly dateProvider: DateProvider,
|
|
76
74
|
private readonly instrumentation: ArchiverInstrumentation,
|
|
77
|
-
private readonly l1Constants: L1RollupConstants & {
|
|
75
|
+
private readonly l1Constants: L1RollupConstants & {
|
|
76
|
+
l1StartBlockHash: Buffer32;
|
|
77
|
+
genesisArchiveRoot: Fr;
|
|
78
|
+
},
|
|
78
79
|
private readonly events: ArchiverEmitter,
|
|
79
80
|
tracer: Tracer,
|
|
81
|
+
l2TipsCache?: L2TipsCache,
|
|
80
82
|
private readonly log: Logger = createLogger('archiver:l1-sync'),
|
|
81
83
|
) {
|
|
82
|
-
this.updater = new ArchiverDataStoreUpdater(this.store
|
|
84
|
+
this.updater = new ArchiverDataStoreUpdater(this.store, l2TipsCache, {
|
|
85
|
+
rollupManaLimit: l1Constants.rollupManaLimit,
|
|
86
|
+
});
|
|
83
87
|
this.tracer = tracer;
|
|
84
88
|
}
|
|
85
89
|
|
|
@@ -119,10 +123,15 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
119
123
|
|
|
120
124
|
@trackSpan('Archiver.syncFromL1')
|
|
121
125
|
public async syncFromL1(initialSyncComplete: boolean): Promise<void> {
|
|
126
|
+
// In between the various calls to L1, the block number can move meaning some of the following
|
|
127
|
+
// calls will return data for blocks that were not present during earlier calls. To combat this
|
|
128
|
+
// we ensure that all data retrieval methods only retrieve data up to the currentBlockNumber
|
|
129
|
+
// captured at the top of this function.
|
|
122
130
|
const currentL1Block = await this.publicClient.getBlock({ includeTransactions: false });
|
|
123
131
|
const currentL1BlockNumber = currentL1Block.number;
|
|
124
132
|
const currentL1BlockHash = Buffer32.fromString(currentL1Block.hash);
|
|
125
133
|
const currentL1Timestamp = currentL1Block.timestamp;
|
|
134
|
+
const currentL1BlockData = { l1BlockNumber: currentL1BlockNumber, l1BlockHash: currentL1BlockHash };
|
|
126
135
|
|
|
127
136
|
if (this.l1BlockHash && currentL1BlockHash.equals(this.l1BlockHash)) {
|
|
128
137
|
this.log.trace(`No new L1 blocks since last sync at L1 block ${this.l1BlockNumber}`);
|
|
@@ -139,45 +148,15 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
139
148
|
);
|
|
140
149
|
}
|
|
141
150
|
|
|
142
|
-
// Load sync point for blocks
|
|
143
|
-
const {
|
|
144
|
-
|
|
145
|
-
messagesSynchedTo = {
|
|
146
|
-
l1BlockNumber: this.l1Constants.l1StartBlock,
|
|
147
|
-
l1BlockHash: this.l1Constants.l1StartBlockHash,
|
|
148
|
-
},
|
|
149
|
-
} = await this.store.getSynchPoint();
|
|
151
|
+
// Load sync point for blocks defaulting to start block
|
|
152
|
+
const { blocksSynchedTo = this.l1Constants.l1StartBlock } = await this.store.getSynchPoint();
|
|
153
|
+
this.log.debug(`Starting new archiver sync iteration`, { blocksSynchedTo, currentL1BlockData });
|
|
150
154
|
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
currentL1BlockHash,
|
|
156
|
-
});
|
|
155
|
+
// Sync L1 to L2 messages. We retry this a few times since there are error conditions that reset the sync point, requiring a new iteration.
|
|
156
|
+
// Note that we cannot just wait for the l1 synchronizer to loop again, since the synchronizer would report as synced up to the current L1
|
|
157
|
+
// block, when that wouldn't be the case, since L1 to L2 messages would need another iteration.
|
|
158
|
+
await retryTimes(() => this.handleL1ToL2Messages(currentL1BlockData), 'Handling L1 to L2 messages', 3, 0.1);
|
|
157
159
|
|
|
158
|
-
// ********** Ensuring Consistency of data pulled from L1 **********
|
|
159
|
-
|
|
160
|
-
/**
|
|
161
|
-
* There are a number of calls in this sync operation to L1 for retrieving
|
|
162
|
-
* events and transaction data. There are a couple of things we need to bear in mind
|
|
163
|
-
* to ensure that data is read exactly once.
|
|
164
|
-
*
|
|
165
|
-
* The first is the problem of eventually consistent ETH service providers like Infura.
|
|
166
|
-
* Each L1 read operation will query data from the last L1 block that it saw emit its kind of data.
|
|
167
|
-
* (so pending L1 to L2 messages will read from the last L1 block that emitted a message and so on)
|
|
168
|
-
* This will mean the archiver will lag behind L1 and will only advance when there's L2-relevant activity on the chain.
|
|
169
|
-
*
|
|
170
|
-
* The second is that in between the various calls to L1, the block number can move meaning some
|
|
171
|
-
* of the following calls will return data for blocks that were not present during earlier calls.
|
|
172
|
-
* To combat this for the time being we simply ensure that all data retrieval methods only retrieve
|
|
173
|
-
* data up to the currentBlockNumber captured at the top of this function. We might want to improve on this
|
|
174
|
-
* in future but for the time being it should give us the guarantees that we need
|
|
175
|
-
*/
|
|
176
|
-
|
|
177
|
-
// ********** Events that are processed per L1 block **********
|
|
178
|
-
await this.handleL1ToL2Messages(messagesSynchedTo, currentL1BlockNumber);
|
|
179
|
-
|
|
180
|
-
// ********** Events that are processed per checkpoint **********
|
|
181
160
|
if (currentL1BlockNumber > blocksSynchedTo) {
|
|
182
161
|
// First we retrieve new checkpoints and L2 blocks and store them in the DB. This will also update the
|
|
183
162
|
// pending chain validation status, proven checkpoint number, and synched L1 block number.
|
|
@@ -215,6 +194,9 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
215
194
|
this.instrumentation.updateL1BlockHeight(currentL1BlockNumber);
|
|
216
195
|
}
|
|
217
196
|
|
|
197
|
+
// Update the finalized L2 checkpoint based on L1 finality.
|
|
198
|
+
await this.updateFinalizedCheckpoint();
|
|
199
|
+
|
|
218
200
|
// After syncing has completed, update the current l1 block number and timestamp,
|
|
219
201
|
// otherwise we risk announcing to the world that we've synced to a given point,
|
|
220
202
|
// but the corresponding blocks have not been processed (see #12631).
|
|
@@ -230,6 +212,30 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
230
212
|
});
|
|
231
213
|
}
|
|
232
214
|
|
|
215
|
+
/** Query L1 for its finalized block and update the finalized checkpoint accordingly. */
|
|
216
|
+
private async updateFinalizedCheckpoint(): Promise<void> {
|
|
217
|
+
try {
|
|
218
|
+
const finalizedL1Block = await this.publicClient.getBlock({ blockTag: 'finalized', includeTransactions: false });
|
|
219
|
+
const finalizedL1BlockNumber = finalizedL1Block.number;
|
|
220
|
+
const finalizedCheckpointNumber = await this.rollup.getProvenCheckpointNumber({
|
|
221
|
+
blockNumber: finalizedL1BlockNumber,
|
|
222
|
+
});
|
|
223
|
+
const localFinalizedCheckpointNumber = await this.store.getFinalizedCheckpointNumber();
|
|
224
|
+
if (localFinalizedCheckpointNumber !== finalizedCheckpointNumber) {
|
|
225
|
+
await this.updater.setFinalizedCheckpointNumber(finalizedCheckpointNumber);
|
|
226
|
+
this.log.info(`Updated finalized chain to checkpoint ${finalizedCheckpointNumber}`, {
|
|
227
|
+
finalizedCheckpointNumber,
|
|
228
|
+
finalizedL1BlockNumber,
|
|
229
|
+
});
|
|
230
|
+
}
|
|
231
|
+
} catch (err: any) {
|
|
232
|
+
// The rollup contract may not exist at the finalized L1 block right after deployment.
|
|
233
|
+
if (!err?.message?.includes('returned no data')) {
|
|
234
|
+
this.log.warn(`Failed to update finalized checkpoint: ${err}`);
|
|
235
|
+
}
|
|
236
|
+
}
|
|
237
|
+
}
|
|
238
|
+
|
|
233
239
|
/** Prune all proposed local blocks that should have been checkpointed by now. */
|
|
234
240
|
private async pruneUncheckpointedBlocks(currentL1Timestamp: bigint) {
|
|
235
241
|
const [lastCheckpointedBlockNumber, lastProposedBlockNumber] = await Promise.all([
|
|
@@ -243,29 +249,32 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
243
249
|
return;
|
|
244
250
|
}
|
|
245
251
|
|
|
246
|
-
// What's the slot
|
|
252
|
+
// What's the slot at the next L1 block? All blocks for slots strictly before this one should've been checkpointed by now.
|
|
253
|
+
const slotAtNextL1Block = getSlotAtNextL1Block(currentL1Timestamp, this.l1Constants);
|
|
247
254
|
const firstUncheckpointedBlockNumber = BlockNumber(lastCheckpointedBlockNumber + 1);
|
|
255
|
+
|
|
256
|
+
// What's the slot of the first uncheckpointed block?
|
|
248
257
|
const [firstUncheckpointedBlockHeader] = await this.store.getBlockHeaders(firstUncheckpointedBlockNumber, 1);
|
|
249
258
|
const firstUncheckpointedBlockSlot = firstUncheckpointedBlockHeader?.getSlot();
|
|
250
259
|
|
|
251
|
-
|
|
252
|
-
|
|
260
|
+
if (firstUncheckpointedBlockSlot === undefined || firstUncheckpointedBlockSlot >= slotAtNextL1Block) {
|
|
261
|
+
return;
|
|
262
|
+
}
|
|
253
263
|
|
|
254
|
-
// Prune provisional blocks from slots that have ended without being checkpointed
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
264
|
+
// Prune provisional blocks from slots that have ended without being checkpointed.
|
|
265
|
+
// This also clears any proposed checkpoint whose blocks are being pruned.
|
|
266
|
+
this.log.warn(
|
|
267
|
+
`Pruning blocks after block ${lastCheckpointedBlockNumber} due to slot ${firstUncheckpointedBlockSlot} not being checkpointed`,
|
|
268
|
+
{ firstUncheckpointedBlockHeader: firstUncheckpointedBlockHeader.toInspect(), slotAtNextL1Block },
|
|
269
|
+
);
|
|
270
|
+
const prunedBlocks = await this.updater.removeUncheckpointedBlocksAfter(lastCheckpointedBlockNumber);
|
|
261
271
|
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
}
|
|
272
|
+
if (prunedBlocks.length > 0) {
|
|
273
|
+
this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
|
|
274
|
+
type: L2BlockSourceEvents.L2PruneUncheckpointed,
|
|
275
|
+
slotNumber: firstUncheckpointedBlockSlot,
|
|
276
|
+
blocks: prunedBlocks,
|
|
277
|
+
});
|
|
269
278
|
}
|
|
270
279
|
}
|
|
271
280
|
|
|
@@ -308,17 +317,20 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
308
317
|
|
|
309
318
|
const checkpointsToUnwind = localPendingCheckpointNumber - provenCheckpointNumber;
|
|
310
319
|
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
const
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
checkpoints
|
|
318
|
-
.filter(isDefined)
|
|
319
|
-
.map(cp => this.store.getBlocksForCheckpoint(CheckpointNumber(cp.checkpointNumber))),
|
|
320
|
+
// Fetch checkpoints and blocks in bounded batches to avoid unbounded concurrent
|
|
321
|
+
// promises when the gap between local pending and proven checkpoint numbers is large.
|
|
322
|
+
const BATCH_SIZE = 10;
|
|
323
|
+
const indices = Array.from({ length: checkpointsToUnwind }, (_, i) => CheckpointNumber(i + pruneFrom));
|
|
324
|
+
const checkpoints = (await asyncPool(BATCH_SIZE, indices, idx => this.store.getCheckpointData(idx))).filter(
|
|
325
|
+
isDefined,
|
|
320
326
|
);
|
|
321
|
-
const newBlocks =
|
|
327
|
+
const newBlocks = (
|
|
328
|
+
await asyncPool(BATCH_SIZE, checkpoints, cp =>
|
|
329
|
+
this.store.getBlocksForCheckpoint(CheckpointNumber(cp.checkpointNumber)),
|
|
330
|
+
)
|
|
331
|
+
)
|
|
332
|
+
.filter(isDefined)
|
|
333
|
+
.flat();
|
|
322
334
|
|
|
323
335
|
// Emit an event for listening services to react to the chain prune
|
|
324
336
|
this.events.emit(L2BlockSourceEvents.L2PruneUnproven, {
|
|
@@ -356,63 +368,87 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
356
368
|
}
|
|
357
369
|
|
|
358
370
|
@trackSpan('Archiver.handleL1ToL2Messages')
|
|
359
|
-
private async handleL1ToL2Messages(
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
371
|
+
private async handleL1ToL2Messages(currentL1Block: L1BlockId): Promise<boolean> {
|
|
372
|
+
// Load the syncpoint, which may have been updated in a previous iteration
|
|
373
|
+
const {
|
|
374
|
+
messagesSynchedTo = {
|
|
375
|
+
l1BlockNumber: this.l1Constants.l1StartBlock,
|
|
376
|
+
l1BlockHash: this.l1Constants.l1StartBlockHash,
|
|
377
|
+
},
|
|
378
|
+
} = await this.store.getSynchPoint();
|
|
379
|
+
|
|
380
|
+
// Nothing to do if L1 block number has not moved forward
|
|
381
|
+
const currentL1BlockNumber = currentL1Block.l1BlockNumber;
|
|
382
|
+
if (currentL1BlockNumber <= messagesSynchedTo.l1BlockNumber) {
|
|
383
|
+
return true;
|
|
363
384
|
}
|
|
364
385
|
|
|
365
|
-
//
|
|
366
|
-
const localMessagesInserted = await this.store.getTotalL1ToL2MessageCount();
|
|
367
|
-
const localLastMessage = await this.store.getLastL1ToL2Message();
|
|
386
|
+
// Compare local message store state with the remote. If they match, we just advance the match pointer.
|
|
368
387
|
const remoteMessagesState = await this.inbox.getState({ blockNumber: currentL1BlockNumber });
|
|
388
|
+
const localLastMessage = await this.store.getLastL1ToL2Message();
|
|
389
|
+
if (await this.localStateMatches(localLastMessage, remoteMessagesState)) {
|
|
390
|
+
this.log.trace(`Local L1 to L2 messages are already in sync with remote at L1 block ${currentL1BlockNumber}`);
|
|
391
|
+
await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
|
|
392
|
+
return true;
|
|
393
|
+
}
|
|
369
394
|
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
|
|
373
|
-
|
|
374
|
-
|
|
395
|
+
// If not, then we are out of sync. Most likely there are new messages on the inbox, so we try retrieving them.
|
|
396
|
+
// However, it could also be the case that there was an L1 reorg and our syncpoint is no longer valid.
|
|
397
|
+
// If that's the case, we'd get an exception out of the message store since the rolling hash of the first message
|
|
398
|
+
// we try to insert would not match the one in the db, in which case we rollback to the last common message with L1.
|
|
399
|
+
try {
|
|
400
|
+
await this.retrieveAndStoreMessages(messagesSynchedTo.l1BlockNumber, currentL1BlockNumber);
|
|
401
|
+
} catch (error) {
|
|
402
|
+
if (isErrorClass(error, MessageStoreError)) {
|
|
403
|
+
this.log.warn(
|
|
404
|
+
`Failed to store L1 to L2 messages retrieved from L1: ${error.message}. Rolling back syncpoint to retry.`,
|
|
405
|
+
{ inboxMessage: error.inboxMessage },
|
|
406
|
+
);
|
|
407
|
+
await this.rollbackL1ToL2Messages(remoteMessagesState.treeInProgress);
|
|
408
|
+
return false;
|
|
409
|
+
}
|
|
410
|
+
throw error;
|
|
411
|
+
}
|
|
375
412
|
|
|
376
|
-
//
|
|
377
|
-
|
|
378
|
-
|
|
379
|
-
|
|
380
|
-
) {
|
|
381
|
-
this.log.
|
|
382
|
-
`
|
|
413
|
+
// Note that, if there are no new messages to insert, but there was an L1 reorg that pruned out last messages,
|
|
414
|
+
// we'd notice by comparing our local state with the remote one again, and seeing they don't match even after
|
|
415
|
+
// our sync attempt. In this case, we also rollback our syncpoint, and trigger a retry.
|
|
416
|
+
const localLastMessageAfterSync = await this.store.getLastL1ToL2Message();
|
|
417
|
+
if (!(await this.localStateMatches(localLastMessageAfterSync, remoteMessagesState))) {
|
|
418
|
+
this.log.warn(
|
|
419
|
+
`Local L1 to L2 messages state does not match remote after sync attempt. Rolling back syncpoint to retry.`,
|
|
420
|
+
{ localLastMessageAfterSync, remoteMessagesState },
|
|
383
421
|
);
|
|
384
|
-
|
|
422
|
+
await this.rollbackL1ToL2Messages(remoteMessagesState.treeInProgress);
|
|
423
|
+
return false;
|
|
385
424
|
}
|
|
386
425
|
|
|
387
|
-
//
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
const remoteLastMessage = await this.retrieveL1ToL2Message(localLastMessage.leaf);
|
|
392
|
-
this.log.trace(`Retrieved remote message for local last`, { remoteLastMessage, localLastMessage });
|
|
393
|
-
if (!remoteLastMessage || !remoteLastMessage.rollingHash.equals(localLastMessage.rollingHash)) {
|
|
394
|
-
this.log.warn(`Rolling back L1 to L2 messages due to hash mismatch or msg not found.`, {
|
|
395
|
-
remoteLastMessage,
|
|
396
|
-
messagesSyncPoint,
|
|
397
|
-
localLastMessage,
|
|
398
|
-
});
|
|
426
|
+
// Advance the syncpoint after a successful sync
|
|
427
|
+
await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
|
|
428
|
+
return true;
|
|
429
|
+
}
|
|
399
430
|
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
}
|
|
405
|
-
}
|
|
431
|
+
/** Checks if the local rolling hash and message count matches the remote state */
|
|
432
|
+
private async localStateMatches(localLastMessage: InboxMessage | undefined, remoteState: InboxContractState) {
|
|
433
|
+
const localMessageCount = await this.store.getTotalL1ToL2MessageCount();
|
|
434
|
+
this.log.trace(`Comparing local and remote inbox state`, { localMessageCount, localLastMessage, remoteState });
|
|
406
435
|
|
|
407
|
-
|
|
436
|
+
return (
|
|
437
|
+
remoteState.totalMessagesInserted === localMessageCount &&
|
|
438
|
+
remoteState.messagesRollingHash.equals(localLastMessage?.rollingHash ?? Buffer16.ZERO)
|
|
439
|
+
);
|
|
440
|
+
}
|
|
441
|
+
|
|
442
|
+
/** Retrieves L1 to L2 messages from L1 in batches and stores them. */
|
|
443
|
+
private async retrieveAndStoreMessages(fromL1Block: bigint, toL1Block: bigint): Promise<void> {
|
|
408
444
|
let searchStartBlock: bigint = 0n;
|
|
409
|
-
let searchEndBlock: bigint =
|
|
445
|
+
let searchEndBlock: bigint = fromL1Block;
|
|
410
446
|
|
|
411
447
|
let lastMessage: InboxMessage | undefined;
|
|
412
448
|
let messageCount = 0;
|
|
413
449
|
|
|
414
450
|
do {
|
|
415
|
-
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock,
|
|
451
|
+
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, toL1Block);
|
|
416
452
|
this.log.trace(`Retrieving L1 to L2 messages in L1 blocks ${searchStartBlock}-${searchEndBlock}`);
|
|
417
453
|
const messages = await retrieveL1ToL2Messages(this.inbox, searchStartBlock, searchEndBlock);
|
|
418
454
|
const timer = new Timer();
|
|
@@ -424,81 +460,65 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
424
460
|
lastMessage = msg;
|
|
425
461
|
messageCount++;
|
|
426
462
|
}
|
|
427
|
-
} while (searchEndBlock <
|
|
463
|
+
} while (searchEndBlock < toL1Block);
|
|
428
464
|
|
|
429
|
-
// Log stats for messages retrieved (if any).
|
|
430
465
|
if (messageCount > 0) {
|
|
431
466
|
this.log.info(
|
|
432
467
|
`Retrieved ${messageCount} new L1 to L2 messages up to message with index ${lastMessage?.index} for checkpoint ${lastMessage?.checkpointNumber}`,
|
|
433
468
|
{ lastMessage, messageCount },
|
|
434
469
|
);
|
|
435
470
|
}
|
|
436
|
-
|
|
437
|
-
// Warn if the resulting rolling hash does not match the remote state we had retrieved.
|
|
438
|
-
if (lastMessage && !lastMessage.rollingHash.equals(remoteMessagesState.messagesRollingHash)) {
|
|
439
|
-
this.log.warn(`Last message retrieved rolling hash does not match remote state.`, {
|
|
440
|
-
lastMessage,
|
|
441
|
-
remoteMessagesState,
|
|
442
|
-
});
|
|
443
|
-
}
|
|
444
471
|
}
|
|
445
472
|
|
|
446
|
-
|
|
447
|
-
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
|
|
451
|
-
do {
|
|
452
|
-
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, currentL1BlockNumber);
|
|
453
|
-
|
|
454
|
-
const message = await retrieveL1ToL2Message(this.inbox, leaf, searchStartBlock, searchEndBlock);
|
|
455
|
-
|
|
456
|
-
if (message) {
|
|
457
|
-
return message;
|
|
458
|
-
}
|
|
459
|
-
} while (searchEndBlock < currentL1BlockNumber);
|
|
460
|
-
|
|
461
|
-
return undefined;
|
|
462
|
-
}
|
|
463
|
-
|
|
464
|
-
private async rollbackL1ToL2Messages(
|
|
465
|
-
localLastMessage: InboxMessage,
|
|
466
|
-
messagesSyncPoint: L1BlockId,
|
|
467
|
-
): Promise<L1BlockId> {
|
|
473
|
+
/**
|
|
474
|
+
* Rolls back local L1 to L2 messages to the last common message with L1, and updates the syncpoint to the L1 block of that message.
|
|
475
|
+
* If no common message is found, rolls back all messages and sets the syncpoint to the start block.
|
|
476
|
+
*/
|
|
477
|
+
private async rollbackL1ToL2Messages(remoteTreeInProgress: bigint): Promise<L1BlockId> {
|
|
468
478
|
// Slowly go back through our messages until we find the last common message.
|
|
469
479
|
// We could query the logs in batch as an optimization, but the depth of the reorg should not be deep, and this
|
|
470
480
|
// is a very rare case, so it's fine to query one log at a time.
|
|
471
481
|
let commonMsg: undefined | InboxMessage;
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
const
|
|
476
|
-
|
|
482
|
+
let messagesToDelete = 0;
|
|
483
|
+
this.log.verbose(`Searching most recent common L1 to L2 message`);
|
|
484
|
+
for await (const localMsg of this.store.iterateL1ToL2Messages({ reverse: true })) {
|
|
485
|
+
const remoteMsg = await retrieveL1ToL2Message(this.inbox, localMsg);
|
|
486
|
+
const logCtx = { remoteMsg, localMsg: localMsg };
|
|
487
|
+
if (remoteMsg && remoteMsg.rollingHash.equals(localMsg.rollingHash)) {
|
|
477
488
|
this.log.verbose(
|
|
478
|
-
`Found most recent common L1 to L2 message at index ${
|
|
489
|
+
`Found most recent common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber}`,
|
|
479
490
|
logCtx,
|
|
480
491
|
);
|
|
481
492
|
commonMsg = remoteMsg;
|
|
482
493
|
break;
|
|
483
494
|
} else if (remoteMsg) {
|
|
484
|
-
this.log.debug(`Local L1 to L2 message with index ${
|
|
495
|
+
this.log.debug(`Local L1 to L2 message with index ${localMsg.index} has different rolling hash`, logCtx);
|
|
496
|
+
messagesToDelete++;
|
|
485
497
|
} else {
|
|
486
|
-
this.log.debug(`Local L1 to L2 message with index ${
|
|
498
|
+
this.log.debug(`Local L1 to L2 message with index ${localMsg.index} not found on L1`, logCtx);
|
|
499
|
+
messagesToDelete++;
|
|
487
500
|
}
|
|
488
501
|
}
|
|
489
502
|
|
|
490
|
-
// Delete everything after the common message we found.
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
|
|
503
|
+
// Delete everything after the common message we found, if anything needs to be deleted.
|
|
504
|
+
// Do not exit early if there are no messages to delete, we still want to update the syncpoint.
|
|
505
|
+
if (messagesToDelete > 0) {
|
|
506
|
+
const lastGoodIndex = commonMsg?.index;
|
|
507
|
+
this.log.warn(`Rolling back all local L1 to L2 messages after index ${lastGoodIndex ?? 'initial'}`);
|
|
508
|
+
await this.store.removeL1ToL2Messages(lastGoodIndex !== undefined ? lastGoodIndex + 1n : 0n);
|
|
509
|
+
}
|
|
494
510
|
|
|
495
511
|
// Update the syncpoint so the loop below reprocesses the changed messages. We go to the block before
|
|
496
512
|
// the last common one, so we force reprocessing it, in case new messages were added on that same L1 block
|
|
497
513
|
// after the last common message.
|
|
498
514
|
const syncPointL1BlockNumber = commonMsg ? commonMsg.l1BlockNumber - 1n : this.l1Constants.l1StartBlock;
|
|
499
515
|
const syncPointL1BlockHash = await this.getL1BlockHash(syncPointL1BlockNumber);
|
|
500
|
-
messagesSyncPoint = { l1BlockNumber: syncPointL1BlockNumber, l1BlockHash: syncPointL1BlockHash };
|
|
501
|
-
await this.store.
|
|
516
|
+
const messagesSyncPoint = { l1BlockNumber: syncPointL1BlockNumber, l1BlockHash: syncPointL1BlockHash };
|
|
517
|
+
await this.store.setMessageSyncState(messagesSyncPoint, remoteTreeInProgress);
|
|
518
|
+
this.log.verbose(`Updated messages syncpoint to L1 block ${syncPointL1BlockNumber}`, {
|
|
519
|
+
...messagesSyncPoint,
|
|
520
|
+
remoteTreeInProgress,
|
|
521
|
+
});
|
|
502
522
|
return messagesSyncPoint;
|
|
503
523
|
}
|
|
504
524
|
|
|
@@ -550,7 +570,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
550
570
|
if (provenCheckpointNumber === 0) {
|
|
551
571
|
const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
|
|
552
572
|
if (localProvenCheckpointNumber !== provenCheckpointNumber) {
|
|
553
|
-
await this.
|
|
573
|
+
await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
|
|
554
574
|
this.log.info(`Rolled back proven chain to checkpoint ${provenCheckpointNumber}`, { provenCheckpointNumber });
|
|
555
575
|
}
|
|
556
576
|
}
|
|
@@ -582,13 +602,13 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
582
602
|
) {
|
|
583
603
|
const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
|
|
584
604
|
if (localProvenCheckpointNumber !== provenCheckpointNumber) {
|
|
585
|
-
await this.
|
|
605
|
+
await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
|
|
586
606
|
this.log.info(`Updated proven chain to checkpoint ${provenCheckpointNumber}`, { provenCheckpointNumber });
|
|
587
607
|
const provenSlotNumber = localCheckpointForDestinationProvenCheckpointNumber.header.slotNumber;
|
|
588
608
|
const provenEpochNumber: EpochNumber = getEpochAtSlot(provenSlotNumber, this.l1Constants);
|
|
589
609
|
const lastBlockNumberInCheckpoint =
|
|
590
610
|
localCheckpointForDestinationProvenCheckpointNumber.startBlock +
|
|
591
|
-
localCheckpointForDestinationProvenCheckpointNumber.
|
|
611
|
+
localCheckpointForDestinationProvenCheckpointNumber.blockCount -
|
|
592
612
|
1;
|
|
593
613
|
|
|
594
614
|
this.events.emit(L2BlockSourceEvents.L2BlockProven, {
|
|
@@ -597,7 +617,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
597
617
|
slotNumber: provenSlotNumber,
|
|
598
618
|
epochNumber: provenEpochNumber,
|
|
599
619
|
});
|
|
600
|
-
this.instrumentation.
|
|
620
|
+
this.instrumentation.updateLastProvenCheckpoint(localCheckpointForDestinationProvenCheckpointNumber);
|
|
601
621
|
} else {
|
|
602
622
|
this.log.trace(`Proven checkpoint ${provenCheckpointNumber} already stored.`);
|
|
603
623
|
}
|
|
@@ -706,7 +726,6 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
706
726
|
this.blobClient,
|
|
707
727
|
searchStartBlock, // TODO(palla/reorg): If the L2 reorg was due to an L1 reorg, we need to start search earlier
|
|
708
728
|
searchEndBlock,
|
|
709
|
-
this.l1Addresses,
|
|
710
729
|
this.instrumentation,
|
|
711
730
|
this.log,
|
|
712
731
|
!initialSyncComplete, // isHistoricalSync
|
|
@@ -801,6 +820,14 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
801
820
|
);
|
|
802
821
|
}
|
|
803
822
|
|
|
823
|
+
for (const published of validCheckpoints) {
|
|
824
|
+
this.instrumentation.processCheckpointL1Timing({
|
|
825
|
+
slotNumber: published.checkpoint.header.slotNumber,
|
|
826
|
+
l1Timestamp: published.l1.timestamp,
|
|
827
|
+
l1Constants: this.l1Constants,
|
|
828
|
+
});
|
|
829
|
+
}
|
|
830
|
+
|
|
804
831
|
try {
|
|
805
832
|
const updatedValidationResult =
|
|
806
833
|
rollupStatus.validationResult === initialValidationResult ? undefined : rollupStatus.validationResult;
|
|
@@ -819,7 +846,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
819
846
|
const prunedCheckpointNumber = result.prunedBlocks[0].checkpointNumber;
|
|
820
847
|
const prunedSlotNumber = result.prunedBlocks[0].header.globalVariables.slotNumber;
|
|
821
848
|
|
|
822
|
-
this.log.
|
|
849
|
+
this.log.info(
|
|
823
850
|
`Pruned ${result.prunedBlocks.length} mismatching blocks for checkpoint ${prunedCheckpointNumber}`,
|
|
824
851
|
{ prunedBlocks: result.prunedBlocks.map(b => b.toBlockInfo()), prunedSlotNumber, prunedCheckpointNumber },
|
|
825
852
|
);
|
|
@@ -9,7 +9,7 @@ import {
|
|
|
9
9
|
getAttestationInfoFromPayload,
|
|
10
10
|
} from '@aztec/stdlib/block';
|
|
11
11
|
import type { PublishedCheckpoint } from '@aztec/stdlib/checkpoint';
|
|
12
|
-
import { type L1RollupConstants, getEpochAtSlot } from '@aztec/stdlib/epoch-helpers';
|
|
12
|
+
import { type L1RollupConstants, computeQuorum, getEpochAtSlot } from '@aztec/stdlib/epoch-helpers';
|
|
13
13
|
import { ConsensusPayload } from '@aztec/stdlib/p2p';
|
|
14
14
|
|
|
15
15
|
export type { ValidateCheckpointResult };
|
|
@@ -66,7 +66,7 @@ export async function validateCheckpointAttestations(
|
|
|
66
66
|
return { valid: true };
|
|
67
67
|
}
|
|
68
68
|
|
|
69
|
-
const requiredAttestationCount =
|
|
69
|
+
const requiredAttestationCount = computeQuorum(committee.length);
|
|
70
70
|
|
|
71
71
|
const failedValidationResult = <TReason extends ValidateCheckpointNegativeResult['reason']>(reason: TReason) => ({
|
|
72
72
|
valid: false as const,
|