@aztec/archiver 0.0.1-commit.f504929 → 0.0.1-commit.f5a9928
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 -13
- package/dest/archiver.d.ts +73 -18
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +321 -81
- package/dest/config.d.ts +7 -3
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +43 -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 +20 -9
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +85 -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 +9 -1
- package/dest/l1/calldata_retriever.d.ts.map +1 -1
- package/dest/l1/calldata_retriever.js +22 -11
- package/dest/l1/data_retrieval.d.ts +25 -11
- 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 +32 -0
- package/dest/modules/data_source_base.d.ts +73 -50
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +250 -144
- 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 +198 -123
- package/dest/modules/instrumentation.d.ts +15 -2
- package/dest/modules/instrumentation.d.ts.map +1 -1
- package/dest/modules/instrumentation.js +48 -9
- package/dest/modules/l1_synchronizer.d.ts +14 -8
- package/dest/modules/l1_synchronizer.d.ts.map +1 -1
- package/dest/modules/l1_synchronizer.js +477 -213
- package/dest/modules/outbox_trees_resolver.d.ts +64 -0
- package/dest/modules/outbox_trees_resolver.d.ts.map +1 -0
- package/dest/modules/outbox_trees_resolver.js +184 -0
- package/dest/modules/validation.d.ts +30 -7
- package/dest/modules/validation.d.ts.map +1 -1
- package/dest/modules/validation.js +35 -17
- package/dest/store/block_store.d.ts +186 -78
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +763 -290
- 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 +42 -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 +58 -6
- 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 +78 -0
- package/dest/store/log_store_codec.d.ts.map +1 -0
- package/dest/store/log_store_codec.js +110 -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 +117 -21
- package/dest/test/mock_l2_block_source.d.ts +51 -52
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +232 -180
- 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 +15 -3
- package/dest/test/noop_l1_archiver.d.ts +17 -6
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +31 -11
- package/package.json +15 -14
- package/src/archiver.ts +415 -90
- package/src/config.ts +51 -13
- package/src/errors.ts +122 -21
- package/src/factory.ts +99 -30
- package/src/index.ts +18 -2
- package/src/l1/calldata_retriever.ts +29 -11
- package/src/l1/data_retrieval.ts +44 -46
- package/src/l1/validate_historical_logs.ts +140 -0
- package/src/modules/contract_data_source_adapter.ts +46 -0
- package/src/modules/data_source_base.ts +327 -189
- package/src/modules/data_store_updater.ts +235 -155
- package/src/modules/instrumentation.ts +43 -10
- package/src/modules/l1_synchronizer.ts +646 -259
- package/src/modules/outbox_trees_resolver.ts +220 -0
- package/src/modules/validation.ts +80 -23
- package/src/store/block_store.ts +930 -348
- package/src/store/contract_class_store.ts +49 -103
- package/src/store/contract_instance_store.ts +74 -11
- 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 +302 -559
- package/src/store/log_store_codec.ts +143 -0
- package/src/store/message_store.ts +60 -10
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +145 -32
- package/src/test/mock_l2_block_source.ts +292 -227
- package/src/test/mock_structs.ts +25 -8
- package/src/test/noop_l1_archiver.ts +61 -12
- 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
|
@@ -1,36 +1,56 @@
|
|
|
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';
|
|
3
|
+
import { InboxContract, type InboxContractState, RollupContract } from '@aztec/ethereum/contracts';
|
|
4
4
|
import type { L1BlockId } from '@aztec/ethereum/l1-types';
|
|
5
|
+
import { getFinalizedL1Block } from '@aztec/ethereum/queries';
|
|
5
6
|
import type { ViemPublicClient, ViemPublicDebugClient } from '@aztec/ethereum/types';
|
|
7
|
+
import { asyncPool } from '@aztec/foundation/async-pool';
|
|
6
8
|
import { maxBigint } from '@aztec/foundation/bigint';
|
|
7
9
|
import { BlockNumber, CheckpointNumber, EpochNumber } from '@aztec/foundation/branded-types';
|
|
8
|
-
import { Buffer32 } from '@aztec/foundation/buffer';
|
|
9
|
-
import { pick } from '@aztec/foundation/collection';
|
|
10
|
+
import { Buffer16, Buffer32 } from '@aztec/foundation/buffer';
|
|
11
|
+
import { compactArray, partition, pick } from '@aztec/foundation/collection';
|
|
10
12
|
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
13
|
+
import { EthAddress } from '@aztec/foundation/eth-address';
|
|
11
14
|
import { type Logger, createLogger } from '@aztec/foundation/log';
|
|
15
|
+
import { retryTimes } from '@aztec/foundation/retry';
|
|
12
16
|
import { count } from '@aztec/foundation/string';
|
|
13
17
|
import { DateProvider, Timer, elapsed } from '@aztec/foundation/timer';
|
|
14
|
-
import { isDefined } from '@aztec/foundation/types';
|
|
15
|
-
import {
|
|
16
|
-
|
|
18
|
+
import { isDefined, isErrorClass } from '@aztec/foundation/types';
|
|
19
|
+
import {
|
|
20
|
+
type ArchiverEmitter,
|
|
21
|
+
type L2Block,
|
|
22
|
+
L2BlockSourceEvents,
|
|
23
|
+
type ValidateCheckpointResult,
|
|
24
|
+
} from '@aztec/stdlib/block';
|
|
25
|
+
import {
|
|
26
|
+
Checkpoint,
|
|
27
|
+
type CheckpointData,
|
|
28
|
+
type CheckpointInfo,
|
|
29
|
+
type L1PublishedData,
|
|
30
|
+
PublishedCheckpoint,
|
|
31
|
+
} from '@aztec/stdlib/checkpoint';
|
|
17
32
|
import { type L1RollupConstants, getEpochAtSlot, getSlotAtNextL1Block } from '@aztec/stdlib/epoch-helpers';
|
|
18
33
|
import { computeInHashFromL1ToL2Messages } from '@aztec/stdlib/messaging';
|
|
34
|
+
import type { CoordinationSignatureContext } from '@aztec/stdlib/p2p';
|
|
19
35
|
import { type Traceable, type Tracer, execInSpan, trackSpan } from '@aztec/telemetry-client';
|
|
20
36
|
|
|
21
37
|
import { InitialCheckpointNumberNotSequentialError } from '../errors.js';
|
|
22
38
|
import {
|
|
23
|
-
|
|
39
|
+
type RetrievedCheckpointFromCalldata,
|
|
40
|
+
getCheckpointBlobDataFromBlobs,
|
|
41
|
+
retrieveCheckpointCalldataFromRollup,
|
|
24
42
|
retrieveL1ToL2Message,
|
|
25
43
|
retrieveL1ToL2Messages,
|
|
26
44
|
retrievedToPublishedCheckpoint,
|
|
27
45
|
} from '../l1/data_retrieval.js';
|
|
28
|
-
import type {
|
|
46
|
+
import type { RejectedCheckpoint } from '../store/block_store.js';
|
|
47
|
+
import { type ArchiverDataStores, getArchiverSynchPoint } from '../store/data_stores.js';
|
|
29
48
|
import type { L2TipsCache } from '../store/l2_tips_cache.js';
|
|
49
|
+
import { MessageStoreError } from '../store/message_store.js';
|
|
30
50
|
import type { InboxMessage } from '../structs/inbox_message.js';
|
|
31
51
|
import { ArchiverDataStoreUpdater } from './data_store_updater.js';
|
|
32
52
|
import type { ArchiverInstrumentation } from './instrumentation.js';
|
|
33
|
-
import {
|
|
53
|
+
import { validateCheckpointAttestationsFromCalldata } from './validation.js';
|
|
34
54
|
|
|
35
55
|
type RollupStatus = {
|
|
36
56
|
provenCheckpointNumber: CheckpointNumber;
|
|
@@ -38,13 +58,17 @@ type RollupStatus = {
|
|
|
38
58
|
pendingCheckpointNumber: CheckpointNumber;
|
|
39
59
|
pendingArchive: string;
|
|
40
60
|
validationResult: ValidateCheckpointResult | undefined;
|
|
61
|
+
/** Last valid checkpoint observed on L1 and synced on this iteration */
|
|
41
62
|
lastRetrievedCheckpoint?: PublishedCheckpoint;
|
|
42
|
-
|
|
63
|
+
/** Last checkpoint observed on L1 across both valid and rejected entries on this iteration */
|
|
64
|
+
lastSeenCheckpoint?: { checkpointNumber: CheckpointNumber; l1: L1PublishedData };
|
|
65
|
+
/** Blocks added while handling checkpoints this iteration, for the aggregate block source update event. */
|
|
66
|
+
blocksAdded: L2Block[];
|
|
43
67
|
};
|
|
44
68
|
|
|
45
69
|
/**
|
|
46
70
|
* Handles L1 synchronization for the archiver.
|
|
47
|
-
* Responsible for fetching checkpoints, L1
|
|
71
|
+
* Responsible for fetching checkpoints, L1 to L2 messages, and handling L1 reorgs.
|
|
48
72
|
*/
|
|
49
73
|
export class ArchiverL1Synchronizer implements Traceable {
|
|
50
74
|
private l1BlockNumber: bigint | undefined;
|
|
@@ -59,23 +83,29 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
59
83
|
private readonly debugClient: ViemPublicDebugClient,
|
|
60
84
|
private readonly rollup: RollupContract,
|
|
61
85
|
private readonly inbox: InboxContract,
|
|
62
|
-
private readonly
|
|
86
|
+
private readonly stores: ArchiverDataStores,
|
|
63
87
|
private config: {
|
|
64
88
|
batchSize: number;
|
|
65
89
|
skipValidateCheckpointAttestations?: boolean;
|
|
90
|
+
skipPromoteProposedCheckpointDuringL1Sync?: boolean;
|
|
66
91
|
maxAllowedEthClientDriftSeconds: number;
|
|
67
92
|
},
|
|
68
93
|
private readonly blobClient: BlobClientInterface,
|
|
69
94
|
private readonly epochCache: EpochCache,
|
|
70
95
|
private readonly dateProvider: DateProvider,
|
|
71
96
|
private readonly instrumentation: ArchiverInstrumentation,
|
|
72
|
-
private readonly l1Constants: L1RollupConstants & {
|
|
97
|
+
private readonly l1Constants: L1RollupConstants & {
|
|
98
|
+
l1StartBlockHash: Buffer32;
|
|
99
|
+
genesisArchiveRoot: Fr;
|
|
100
|
+
},
|
|
73
101
|
private readonly events: ArchiverEmitter,
|
|
74
102
|
tracer: Tracer,
|
|
75
103
|
l2TipsCache?: L2TipsCache,
|
|
76
104
|
private readonly log: Logger = createLogger('archiver:l1-sync'),
|
|
77
105
|
) {
|
|
78
|
-
this.updater = new ArchiverDataStoreUpdater(this.
|
|
106
|
+
this.updater = new ArchiverDataStoreUpdater(this.stores, l2TipsCache, {
|
|
107
|
+
rollupManaLimit: l1Constants.rollupManaLimit,
|
|
108
|
+
});
|
|
79
109
|
this.tracer = tracer;
|
|
80
110
|
}
|
|
81
111
|
|
|
@@ -83,6 +113,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
83
113
|
public setConfig(newConfig: {
|
|
84
114
|
batchSize: number;
|
|
85
115
|
skipValidateCheckpointAttestations?: boolean;
|
|
116
|
+
skipPromoteProposedCheckpointDuringL1Sync?: boolean;
|
|
86
117
|
maxAllowedEthClientDriftSeconds: number;
|
|
87
118
|
}) {
|
|
88
119
|
this.config = newConfig;
|
|
@@ -98,6 +129,13 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
98
129
|
return this.l1Timestamp;
|
|
99
130
|
}
|
|
100
131
|
|
|
132
|
+
private getSignatureContext(): CoordinationSignatureContext {
|
|
133
|
+
return {
|
|
134
|
+
chainId: this.publicClient.chain.id,
|
|
135
|
+
rollupAddress: EthAddress.fromString(this.rollup.address),
|
|
136
|
+
};
|
|
137
|
+
}
|
|
138
|
+
|
|
101
139
|
/** Checks that the ethereum node we are connected to has a latest timestamp no more than the allowed drift. Throw if not. */
|
|
102
140
|
public async testEthereumNodeSynced(): Promise<void> {
|
|
103
141
|
const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
|
|
@@ -114,70 +152,60 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
114
152
|
}
|
|
115
153
|
|
|
116
154
|
@trackSpan('Archiver.syncFromL1')
|
|
117
|
-
public async syncFromL1(initialSyncComplete: boolean): Promise<
|
|
155
|
+
public async syncFromL1(initialSyncComplete: boolean): Promise<L2Block[]> {
|
|
156
|
+
const blocksAdded: L2Block[] = [];
|
|
157
|
+
|
|
158
|
+
// In between the various calls to L1, the block number can move meaning some of the following
|
|
159
|
+
// calls will return data for blocks that were not present during earlier calls. To combat this
|
|
160
|
+
// we ensure that all data retrieval methods only retrieve data up to the currentBlockNumber
|
|
161
|
+
// captured at the top of this function.
|
|
118
162
|
const currentL1Block = await this.publicClient.getBlock({ includeTransactions: false });
|
|
119
163
|
const currentL1BlockNumber = currentL1Block.number;
|
|
120
164
|
const currentL1BlockHash = Buffer32.fromString(currentL1Block.hash);
|
|
121
165
|
const currentL1Timestamp = currentL1Block.timestamp;
|
|
166
|
+
const currentL1BlockData = { l1BlockNumber: currentL1BlockNumber, l1BlockHash: currentL1BlockHash };
|
|
122
167
|
|
|
123
168
|
if (this.l1BlockHash && currentL1BlockHash.equals(this.l1BlockHash)) {
|
|
124
169
|
this.log.trace(`No new L1 blocks since last sync at L1 block ${this.l1BlockNumber}`);
|
|
125
|
-
return;
|
|
170
|
+
return blocksAdded;
|
|
126
171
|
}
|
|
127
172
|
|
|
128
|
-
//
|
|
173
|
+
// Log at error if the latest L1 block timestamp is too old
|
|
129
174
|
const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
|
|
130
175
|
const now = this.dateProvider.nowInSeconds();
|
|
131
176
|
if (maxAllowedDelay > 0 && Number(currentL1Timestamp) <= now - maxAllowedDelay) {
|
|
132
|
-
this.log.
|
|
177
|
+
this.log.error(
|
|
133
178
|
`Latest L1 block ${currentL1BlockNumber} timestamp ${currentL1Timestamp} is too old. Make sure your Ethereum node is synced.`,
|
|
134
179
|
{ currentL1BlockNumber, currentL1Timestamp, now, maxAllowedDelay },
|
|
135
180
|
);
|
|
136
181
|
}
|
|
137
182
|
|
|
138
|
-
//
|
|
139
|
-
const
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
},
|
|
145
|
-
} = await this.store.getSynchPoint();
|
|
183
|
+
// Query finalized block on L1
|
|
184
|
+
const rawFinalizedL1Block = await getFinalizedL1Block(this.publicClient);
|
|
185
|
+
const finalizedL1Block: L1BlockId | undefined = rawFinalizedL1Block && {
|
|
186
|
+
l1BlockNumber: rawFinalizedL1Block.number,
|
|
187
|
+
l1BlockHash: Buffer32.fromString(rawFinalizedL1Block.hash),
|
|
188
|
+
};
|
|
146
189
|
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
190
|
+
// Load sync point for blocks defaulting to start block
|
|
191
|
+
const { blocksSynchedTo = this.l1Constants.l1StartBlock } = await getArchiverSynchPoint(this.stores);
|
|
192
|
+
this.log.debug(`Starting new archiver sync iteration`, { blocksSynchedTo, currentL1BlockData, finalizedL1Block });
|
|
193
|
+
|
|
194
|
+
// 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.
|
|
195
|
+
// 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
|
|
196
|
+
// block, when that wouldn't be the case, since L1 to L2 messages would need another iteration.
|
|
197
|
+
await retryTimes(
|
|
198
|
+
() => this.handleL1ToL2Messages(currentL1BlockData, finalizedL1Block),
|
|
199
|
+
'Handling L1 to L2 messages',
|
|
200
|
+
3,
|
|
201
|
+
0.1,
|
|
202
|
+
);
|
|
153
203
|
|
|
154
|
-
// ********** Ensuring Consistency of data pulled from L1 **********
|
|
155
|
-
|
|
156
|
-
/**
|
|
157
|
-
* There are a number of calls in this sync operation to L1 for retrieving
|
|
158
|
-
* events and transaction data. There are a couple of things we need to bear in mind
|
|
159
|
-
* to ensure that data is read exactly once.
|
|
160
|
-
*
|
|
161
|
-
* The first is the problem of eventually consistent ETH service providers like Infura.
|
|
162
|
-
* Each L1 read operation will query data from the last L1 block that it saw emit its kind of data.
|
|
163
|
-
* (so pending L1 to L2 messages will read from the last L1 block that emitted a message and so on)
|
|
164
|
-
* This will mean the archiver will lag behind L1 and will only advance when there's L2-relevant activity on the chain.
|
|
165
|
-
*
|
|
166
|
-
* The second is that in between the various calls to L1, the block number can move meaning some
|
|
167
|
-
* of the following calls will return data for blocks that were not present during earlier calls.
|
|
168
|
-
* To combat this for the time being we simply ensure that all data retrieval methods only retrieve
|
|
169
|
-
* data up to the currentBlockNumber captured at the top of this function. We might want to improve on this
|
|
170
|
-
* in future but for the time being it should give us the guarantees that we need
|
|
171
|
-
*/
|
|
172
|
-
|
|
173
|
-
// ********** Events that are processed per L1 block **********
|
|
174
|
-
await this.handleL1ToL2Messages(messagesSynchedTo, currentL1BlockNumber);
|
|
175
|
-
|
|
176
|
-
// ********** Events that are processed per checkpoint **********
|
|
177
204
|
if (currentL1BlockNumber > blocksSynchedTo) {
|
|
178
205
|
// First we retrieve new checkpoints and L2 blocks and store them in the DB. This will also update the
|
|
179
206
|
// pending chain validation status, proven checkpoint number, and synched L1 block number.
|
|
180
207
|
const rollupStatus = await this.handleCheckpoints(blocksSynchedTo, currentL1BlockNumber, initialSyncComplete);
|
|
208
|
+
blocksAdded.push(...rollupStatus.blocksAdded);
|
|
181
209
|
|
|
182
210
|
// Then we try pruning uncheckpointed blocks if a new slot was mined without checkpoints
|
|
183
211
|
await this.pruneUncheckpointedBlocks(currentL1Timestamp);
|
|
@@ -193,24 +221,19 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
193
221
|
currentL1Timestamp,
|
|
194
222
|
);
|
|
195
223
|
|
|
196
|
-
// If the last checkpoint we processed had an invalid attestation, we manually advance the L1 syncpoint
|
|
197
|
-
// past it, since otherwise we'll keep downloading it and reprocessing it on every iteration until
|
|
198
|
-
// we get a valid checkpoint to advance the syncpoint.
|
|
199
|
-
if (!rollupStatus.validationResult?.valid && rollupStatus.lastL1BlockWithCheckpoint !== undefined) {
|
|
200
|
-
await this.store.setCheckpointSynchedL1BlockNumber(rollupStatus.lastL1BlockWithCheckpoint);
|
|
201
|
-
}
|
|
202
|
-
|
|
203
224
|
// And lastly we check if we are missing any checkpoints behind us due to a possible L1 reorg.
|
|
204
225
|
// We only do this if rollup cant prune on the next submission. Otherwise we will end up
|
|
205
|
-
// re-syncing the checkpoints we have just unwound above.
|
|
206
|
-
|
|
207
|
-
if (!rollupCanPrune && rollupStatus.validationResult?.valid) {
|
|
226
|
+
// re-syncing the checkpoints we have just unwound above.
|
|
227
|
+
if (!rollupCanPrune) {
|
|
208
228
|
await this.checkForNewCheckpointsBeforeL1SyncPoint(rollupStatus, blocksSynchedTo, currentL1BlockNumber);
|
|
209
229
|
}
|
|
210
230
|
|
|
211
231
|
this.instrumentation.updateL1BlockHeight(currentL1BlockNumber);
|
|
212
232
|
}
|
|
213
233
|
|
|
234
|
+
// Update the finalized L2 checkpoint based on L1 finality.
|
|
235
|
+
await this.updateFinalizedCheckpoint(finalizedL1Block);
|
|
236
|
+
|
|
214
237
|
// After syncing has completed, update the current l1 block number and timestamp,
|
|
215
238
|
// otherwise we risk announcing to the world that we've synced to a given point,
|
|
216
239
|
// but the corresponding blocks have not been processed (see #12631).
|
|
@@ -224,13 +247,42 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
224
247
|
l1TimestampAtStart: currentL1Timestamp,
|
|
225
248
|
l1BlockNumberAtEnd,
|
|
226
249
|
});
|
|
250
|
+
|
|
251
|
+
return blocksAdded;
|
|
252
|
+
}
|
|
253
|
+
|
|
254
|
+
/** Updates the finalized checkpoint using the pre-fetched finalized L1 block from the current sync iteration. */
|
|
255
|
+
private async updateFinalizedCheckpoint(finalizedL1Block: L1BlockId | undefined): Promise<void> {
|
|
256
|
+
try {
|
|
257
|
+
if (!finalizedL1Block) {
|
|
258
|
+
this.log.trace(`Skipping finalized checkpoint update: L1 has no finalized block yet.`);
|
|
259
|
+
return;
|
|
260
|
+
}
|
|
261
|
+
const finalizedL1BlockNumber = finalizedL1Block.l1BlockNumber;
|
|
262
|
+
const finalizedCheckpointNumber = await this.rollup.getProvenCheckpointNumber({
|
|
263
|
+
blockNumber: finalizedL1BlockNumber,
|
|
264
|
+
});
|
|
265
|
+
const localFinalizedCheckpointNumber = await this.stores.blocks.getFinalizedCheckpointNumber();
|
|
266
|
+
if (localFinalizedCheckpointNumber !== finalizedCheckpointNumber) {
|
|
267
|
+
await this.updater.setFinalizedCheckpointNumber(finalizedCheckpointNumber);
|
|
268
|
+
this.log.info(`Updated finalized chain to checkpoint ${finalizedCheckpointNumber}`, {
|
|
269
|
+
finalizedCheckpointNumber,
|
|
270
|
+
finalizedL1BlockNumber,
|
|
271
|
+
});
|
|
272
|
+
}
|
|
273
|
+
} catch (err: any) {
|
|
274
|
+
// The rollup contract may not exist at the finalized L1 block right after deployment.
|
|
275
|
+
if (!err?.message?.includes('returned no data')) {
|
|
276
|
+
this.log.warn(`Failed to update finalized checkpoint: ${err}`);
|
|
277
|
+
}
|
|
278
|
+
}
|
|
227
279
|
}
|
|
228
280
|
|
|
229
281
|
/** Prune all proposed local blocks that should have been checkpointed by now. */
|
|
230
|
-
private async pruneUncheckpointedBlocks(currentL1Timestamp: bigint) {
|
|
282
|
+
private async pruneUncheckpointedBlocks(currentL1Timestamp: bigint): Promise<void> {
|
|
231
283
|
const [lastCheckpointedBlockNumber, lastProposedBlockNumber] = await Promise.all([
|
|
232
|
-
this.
|
|
233
|
-
this.
|
|
284
|
+
this.stores.blocks.getCheckpointedL2BlockNumber(),
|
|
285
|
+
this.stores.blocks.getLatestL2BlockNumber(),
|
|
234
286
|
]);
|
|
235
287
|
|
|
236
288
|
// If there are no uncheckpointed blocks, we got nothing to do
|
|
@@ -239,29 +291,35 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
239
291
|
return;
|
|
240
292
|
}
|
|
241
293
|
|
|
242
|
-
// What's the slot of the first uncheckpointed block?
|
|
243
|
-
const firstUncheckpointedBlockNumber = BlockNumber(lastCheckpointedBlockNumber + 1);
|
|
244
|
-
const [firstUncheckpointedBlockHeader] = await this.store.getBlockHeaders(firstUncheckpointedBlockNumber, 1);
|
|
245
|
-
const firstUncheckpointedBlockSlot = firstUncheckpointedBlockHeader?.getSlot();
|
|
246
|
-
|
|
247
294
|
// What's the slot at the next L1 block? All blocks for slots strictly before this one should've been checkpointed by now.
|
|
248
295
|
const slotAtNextL1Block = getSlotAtNextL1Block(currentL1Timestamp, this.l1Constants);
|
|
296
|
+
const firstUncheckpointedBlockNumber = BlockNumber(lastCheckpointedBlockNumber + 1);
|
|
249
297
|
|
|
250
|
-
//
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
);
|
|
256
|
-
const prunedBlocks = await this.updater.removeUncheckpointedBlocksAfter(lastCheckpointedBlockNumber);
|
|
298
|
+
// What's the slot of the first uncheckpointed block?
|
|
299
|
+
const firstUncheckpointedBlockData = await this.stores.blocks.getBlockData({
|
|
300
|
+
number: firstUncheckpointedBlockNumber,
|
|
301
|
+
});
|
|
302
|
+
const firstUncheckpointedBlockSlot = firstUncheckpointedBlockData?.header.getSlot();
|
|
257
303
|
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
304
|
+
if (firstUncheckpointedBlockSlot === undefined || firstUncheckpointedBlockSlot >= slotAtNextL1Block) {
|
|
305
|
+
return;
|
|
306
|
+
}
|
|
307
|
+
|
|
308
|
+
// Prune provisional blocks from slots that have ended without being checkpointed.
|
|
309
|
+
// This also clears any proposed checkpoint whose blocks are being pruned.
|
|
310
|
+
this.log.warn(
|
|
311
|
+
`Pruning blocks after block ${lastCheckpointedBlockNumber} due to slot ${firstUncheckpointedBlockSlot} not being checkpointed`,
|
|
312
|
+
{ firstUncheckpointedBlockHeader: firstUncheckpointedBlockData?.header.toInspect(), slotAtNextL1Block },
|
|
313
|
+
);
|
|
314
|
+
|
|
315
|
+
const prunedBlocks = await this.updater.removeUncheckpointedBlocksAfter(lastCheckpointedBlockNumber);
|
|
316
|
+
if (prunedBlocks.length > 0) {
|
|
317
|
+
this.instrumentation.recordPrune('uncheckpointed');
|
|
318
|
+
this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
|
|
319
|
+
type: L2BlockSourceEvents.L2PruneUncheckpointed,
|
|
320
|
+
slotNumber: firstUncheckpointedBlockSlot,
|
|
321
|
+
blocks: prunedBlocks,
|
|
322
|
+
});
|
|
265
323
|
}
|
|
266
324
|
}
|
|
267
325
|
|
|
@@ -287,7 +345,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
287
345
|
currentL1Timestamp: bigint,
|
|
288
346
|
): Promise<{ rollupCanPrune: boolean }> {
|
|
289
347
|
const rollupCanPrune = await this.canPrune(currentL1BlockNumber, currentL1Timestamp);
|
|
290
|
-
const localPendingCheckpointNumber = await this.
|
|
348
|
+
const localPendingCheckpointNumber = await this.stores.blocks.getLatestCheckpointNumber();
|
|
291
349
|
const canPrune = localPendingCheckpointNumber > provenCheckpointNumber && rollupCanPrune;
|
|
292
350
|
|
|
293
351
|
if (canPrune) {
|
|
@@ -304,17 +362,20 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
304
362
|
|
|
305
363
|
const checkpointsToUnwind = localPendingCheckpointNumber - provenCheckpointNumber;
|
|
306
364
|
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
const
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
365
|
+
// Fetch checkpoints and blocks in bounded batches to avoid unbounded concurrent
|
|
366
|
+
// promises when the gap between local pending and proven checkpoint numbers is large.
|
|
367
|
+
const BATCH_SIZE = 10;
|
|
368
|
+
const indices = Array.from({ length: checkpointsToUnwind }, (_, i) => CheckpointNumber(i + pruneFrom));
|
|
369
|
+
const checkpoints = (
|
|
370
|
+
await asyncPool(BATCH_SIZE, indices, idx => this.stores.blocks.getCheckpointData(idx))
|
|
371
|
+
).filter(isDefined);
|
|
372
|
+
const newBlocks = (
|
|
373
|
+
await asyncPool(BATCH_SIZE, checkpoints, cp =>
|
|
374
|
+
this.stores.blocks.getBlocksForCheckpoint(CheckpointNumber(cp.checkpointNumber)),
|
|
375
|
+
)
|
|
376
|
+
)
|
|
377
|
+
.filter(isDefined)
|
|
378
|
+
.flat();
|
|
318
379
|
|
|
319
380
|
// Emit an event for listening services to react to the chain prune
|
|
320
381
|
this.events.emit(L2BlockSourceEvents.L2PruneUnproven, {
|
|
@@ -330,12 +391,12 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
330
391
|
this.log.warn(
|
|
331
392
|
`Removed ${count(checkpointsToUnwind, 'checkpoint')} after checkpoint ${provenCheckpointNumber} ` +
|
|
332
393
|
`due to predicted reorg at L1 block ${currentL1BlockNumber}. ` +
|
|
333
|
-
`Updated latest checkpoint is ${await this.
|
|
394
|
+
`Updated latest checkpoint is ${await this.stores.blocks.getLatestCheckpointNumber()}.`,
|
|
334
395
|
);
|
|
335
396
|
this.instrumentation.processPrune(timer.ms());
|
|
336
397
|
// TODO(palla/reorg): Do we need to set the block synched L1 block number here?
|
|
337
398
|
// Seems like the next iteration should handle this.
|
|
338
|
-
// await this.
|
|
399
|
+
// await this.stores.blocks.setSynchedL1BlockNumber(currentL1BlockNumber);
|
|
339
400
|
}
|
|
340
401
|
|
|
341
402
|
return { rollupCanPrune };
|
|
@@ -352,67 +413,102 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
352
413
|
}
|
|
353
414
|
|
|
354
415
|
@trackSpan('Archiver.handleL1ToL2Messages')
|
|
355
|
-
private async handleL1ToL2Messages(
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
416
|
+
private async handleL1ToL2Messages(
|
|
417
|
+
currentL1Block: L1BlockId,
|
|
418
|
+
finalizedL1Block: L1BlockId | undefined,
|
|
419
|
+
): Promise<boolean> {
|
|
420
|
+
// Load the syncpoint, which may have been updated in a previous iteration
|
|
421
|
+
const {
|
|
422
|
+
messagesSynchedTo = {
|
|
423
|
+
l1BlockNumber: this.l1Constants.l1StartBlock,
|
|
424
|
+
l1BlockHash: this.l1Constants.l1StartBlockHash,
|
|
425
|
+
},
|
|
426
|
+
} = await getArchiverSynchPoint(this.stores);
|
|
427
|
+
|
|
428
|
+
// Nothing to do if L1 block number has not moved forward
|
|
429
|
+
const currentL1BlockNumber = currentL1Block.l1BlockNumber;
|
|
430
|
+
if (currentL1BlockNumber <= messagesSynchedTo.l1BlockNumber) {
|
|
431
|
+
return true;
|
|
359
432
|
}
|
|
360
433
|
|
|
361
|
-
//
|
|
362
|
-
const localMessagesInserted = await this.store.getTotalL1ToL2MessageCount();
|
|
363
|
-
const localLastMessage = await this.store.getLastL1ToL2Message();
|
|
434
|
+
// Compare local message store state with the remote. If they match, we just advance the match pointer.
|
|
364
435
|
const remoteMessagesState = await this.inbox.getState({ blockNumber: currentL1BlockNumber });
|
|
436
|
+
const localLastMessage = await this.stores.messages.getLastMessage();
|
|
437
|
+
if (await this.localStateMatches(localLastMessage, remoteMessagesState)) {
|
|
438
|
+
this.log.trace(`Local L1 to L2 messages are already in sync with remote at L1 block ${currentL1BlockNumber}`);
|
|
439
|
+
await this.stores.messages.setMessageSyncState(
|
|
440
|
+
currentL1Block,
|
|
441
|
+
remoteMessagesState.treeInProgress,
|
|
442
|
+
finalizedL1Block,
|
|
443
|
+
);
|
|
444
|
+
return true;
|
|
445
|
+
}
|
|
365
446
|
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
|
|
369
|
-
|
|
370
|
-
|
|
447
|
+
// If not, then we are out of sync. Most likely there are new messages on the inbox, so we try retrieving them.
|
|
448
|
+
// However, it could also be the case that there was an L1 reorg and our syncpoint is no longer valid.
|
|
449
|
+
// If that's the case, we'd get an exception out of the message store since the rolling hash of the first message
|
|
450
|
+
// we try to insert would not match the one in the db, in which case we rollback to the last common message with L1.
|
|
451
|
+
try {
|
|
452
|
+
await this.retrieveAndStoreMessages(messagesSynchedTo.l1BlockNumber, currentL1BlockNumber);
|
|
453
|
+
} catch (error) {
|
|
454
|
+
if (isErrorClass(error, MessageStoreError)) {
|
|
455
|
+
this.log.warn(
|
|
456
|
+
`Failed to store L1 to L2 messages retrieved from L1: ${error.message}. Rolling back syncpoint to retry.`,
|
|
457
|
+
{ inboxMessage: error.inboxMessage },
|
|
458
|
+
);
|
|
459
|
+
await this.rollbackL1ToL2Messages(remoteMessagesState);
|
|
460
|
+
return false;
|
|
461
|
+
}
|
|
462
|
+
throw error;
|
|
463
|
+
}
|
|
371
464
|
|
|
372
|
-
//
|
|
373
|
-
|
|
374
|
-
|
|
375
|
-
|
|
376
|
-
) {
|
|
377
|
-
this.log.
|
|
378
|
-
`
|
|
465
|
+
// Note that, if there are no new messages to insert, but there was an L1 reorg that pruned out last messages,
|
|
466
|
+
// we'd notice by comparing our local state with the remote one again, and seeing they don't match even after
|
|
467
|
+
// our sync attempt. In this case, we also rollback our syncpoint, and trigger a retry.
|
|
468
|
+
const localLastMessageAfterSync = await this.stores.messages.getLastMessage();
|
|
469
|
+
if (!(await this.localStateMatches(localLastMessageAfterSync, remoteMessagesState))) {
|
|
470
|
+
this.log.warn(
|
|
471
|
+
`Local L1 to L2 messages state does not match remote after sync attempt. Rolling back syncpoint to retry.`,
|
|
472
|
+
{ localLastMessageAfterSync, remoteMessagesState },
|
|
379
473
|
);
|
|
380
|
-
|
|
474
|
+
await this.rollbackL1ToL2Messages(remoteMessagesState);
|
|
475
|
+
return false;
|
|
381
476
|
}
|
|
382
477
|
|
|
383
|
-
//
|
|
384
|
-
|
|
385
|
-
|
|
386
|
-
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
remoteLastMessage,
|
|
392
|
-
messagesSyncPoint,
|
|
393
|
-
localLastMessage,
|
|
394
|
-
});
|
|
478
|
+
// Advance the syncpoint after a successful sync
|
|
479
|
+
await this.stores.messages.setMessageSyncState(
|
|
480
|
+
currentL1Block,
|
|
481
|
+
remoteMessagesState.treeInProgress,
|
|
482
|
+
finalizedL1Block,
|
|
483
|
+
);
|
|
484
|
+
return true;
|
|
485
|
+
}
|
|
395
486
|
|
|
396
|
-
|
|
397
|
-
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
487
|
+
/** Checks if the local rolling hash and message count matches the remote state */
|
|
488
|
+
private async localStateMatches(localLastMessage: InboxMessage | undefined, remoteState: InboxContractState) {
|
|
489
|
+
const localMessageCount = await this.stores.messages.getTotalL1ToL2MessageCount();
|
|
490
|
+
this.log.trace(`Comparing local and remote inbox state`, { localMessageCount, localLastMessage, remoteState });
|
|
491
|
+
|
|
492
|
+
return (
|
|
493
|
+
remoteState.totalMessagesInserted === localMessageCount &&
|
|
494
|
+
remoteState.messagesRollingHash.equals(localLastMessage?.rollingHash ?? Buffer16.ZERO)
|
|
495
|
+
);
|
|
496
|
+
}
|
|
402
497
|
|
|
403
|
-
|
|
498
|
+
/** Retrieves L1 to L2 messages from L1 in batches and stores them. */
|
|
499
|
+
private async retrieveAndStoreMessages(fromL1Block: bigint, toL1Block: bigint): Promise<void> {
|
|
404
500
|
let searchStartBlock: bigint = 0n;
|
|
405
|
-
let searchEndBlock: bigint =
|
|
501
|
+
let searchEndBlock: bigint = fromL1Block;
|
|
406
502
|
|
|
407
503
|
let lastMessage: InboxMessage | undefined;
|
|
408
504
|
let messageCount = 0;
|
|
409
505
|
|
|
410
506
|
do {
|
|
411
|
-
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock,
|
|
507
|
+
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, toL1Block);
|
|
412
508
|
this.log.trace(`Retrieving L1 to L2 messages in L1 blocks ${searchStartBlock}-${searchEndBlock}`);
|
|
413
509
|
const messages = await retrieveL1ToL2Messages(this.inbox, searchStartBlock, searchEndBlock);
|
|
414
510
|
const timer = new Timer();
|
|
415
|
-
await this.
|
|
511
|
+
await this.stores.messages.addL1ToL2Messages(messages);
|
|
416
512
|
const perMsg = timer.ms() / messages.length;
|
|
417
513
|
this.instrumentation.processNewMessages(messages.length, perMsg);
|
|
418
514
|
for (const msg of messages) {
|
|
@@ -420,81 +516,108 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
420
516
|
lastMessage = msg;
|
|
421
517
|
messageCount++;
|
|
422
518
|
}
|
|
423
|
-
} while (searchEndBlock <
|
|
519
|
+
} while (searchEndBlock < toL1Block);
|
|
424
520
|
|
|
425
|
-
// Log stats for messages retrieved (if any).
|
|
426
521
|
if (messageCount > 0) {
|
|
427
522
|
this.log.info(
|
|
428
523
|
`Retrieved ${messageCount} new L1 to L2 messages up to message with index ${lastMessage?.index} for checkpoint ${lastMessage?.checkpointNumber}`,
|
|
429
524
|
{ lastMessage, messageCount },
|
|
430
525
|
);
|
|
431
526
|
}
|
|
432
|
-
|
|
433
|
-
// Warn if the resulting rolling hash does not match the remote state we had retrieved.
|
|
434
|
-
if (lastMessage && !lastMessage.rollingHash.equals(remoteMessagesState.messagesRollingHash)) {
|
|
435
|
-
this.log.warn(`Last message retrieved rolling hash does not match remote state.`, {
|
|
436
|
-
lastMessage,
|
|
437
|
-
remoteMessagesState,
|
|
438
|
-
});
|
|
439
|
-
}
|
|
440
527
|
}
|
|
441
528
|
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
529
|
+
/**
|
|
530
|
+
* 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.
|
|
531
|
+
* If no common message is found, rolls back all messages and sets the syncpoint to the start block.
|
|
532
|
+
*/
|
|
533
|
+
private async rollbackL1ToL2Messages(remoteMessagesState: InboxContractState): Promise<L1BlockId> {
|
|
534
|
+
const { treeInProgress: remoteTreeInProgress, messagesRollingHash: remoteRollingHash } = remoteMessagesState;
|
|
446
535
|
|
|
447
|
-
|
|
448
|
-
|
|
536
|
+
const messagesFinalizedL1Block = await this.stores.messages.getMessagesFinalizedL1Block();
|
|
537
|
+
const finalizedL1BlockNumber = messagesFinalizedL1Block?.l1BlockNumber;
|
|
449
538
|
|
|
450
|
-
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
539
|
+
// Slowly go back through our messages until we find the last common message. We could query the logs in
|
|
540
|
+
// batch as an optimization, but the depth of the reorg should not be deep, and this is a very rare case,
|
|
541
|
+
// so it's fine to query one log at a time.
|
|
542
|
+
let commonMsg: undefined | InboxMessage;
|
|
543
|
+
let messagesToDelete = 0;
|
|
544
|
+
this.log.verbose(`Searching most recent common L1 to L2 message`);
|
|
545
|
+
for await (const localMsg of this.stores.messages.iterateL1ToL2Messages({ reverse: true })) {
|
|
546
|
+
const logCtx = { remoteMsg: undefined as InboxMessage | undefined, localMsg, remoteMessagesState };
|
|
547
|
+
|
|
548
|
+
// First check if the local message rolling hash matches the current rolling hash of the inbox contract,
|
|
549
|
+
// which means we just need to rollback some local messages and we should be back in sync. This means there
|
|
550
|
+
// was an L1 reorg that removed some of the messages we had, but no new messages were added compared.
|
|
551
|
+
if (localMsg.rollingHash.equals(remoteRollingHash)) {
|
|
552
|
+
this.log.info(
|
|
553
|
+
`Found common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber} matching current remote state`,
|
|
554
|
+
logCtx,
|
|
555
|
+
);
|
|
556
|
+
commonMsg = localMsg;
|
|
557
|
+
break;
|
|
454
558
|
}
|
|
455
|
-
} while (searchEndBlock < currentL1BlockNumber);
|
|
456
559
|
|
|
457
|
-
|
|
458
|
-
|
|
560
|
+
// Messages at or below the finalized L1 block cannot have been reorged — accept as common without querying L1.
|
|
561
|
+
if (finalizedL1BlockNumber !== undefined && localMsg.l1BlockNumber <= finalizedL1BlockNumber) {
|
|
562
|
+
this.log.info(`Found common L1 to L2 message at finalized L1 block ${localMsg.l1BlockNumber}`, logCtx);
|
|
563
|
+
commonMsg = localMsg;
|
|
564
|
+
break;
|
|
565
|
+
}
|
|
459
566
|
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
const remoteMsg = await this.retrieveL1ToL2Message(msg.leaf);
|
|
471
|
-
const logCtx = { remoteMsg, localMsg: msg };
|
|
472
|
-
if (remoteMsg && remoteMsg.rollingHash.equals(msg.rollingHash)) {
|
|
473
|
-
this.log.verbose(
|
|
474
|
-
`Found most recent common L1 to L2 message at index ${msg.index} on L1 block ${msg.l1BlockNumber}`,
|
|
567
|
+
// If there's no match with the current remote state, check if the message exists on the inbox contract at all
|
|
568
|
+
// by looking at the inbox events. If the L1 reorg *added* new messages in addition to deleting existing ones,
|
|
569
|
+
// then the current remote state's rolling hash will not match anything we have locally, so we need to check existence
|
|
570
|
+
// of individual messages via logs. Note we use logs and not historical queries so we don't have to depend on
|
|
571
|
+
// an archival rpc node, since the message could be from a long time ago if we're catching up with syncing.
|
|
572
|
+
const remoteMsg = await retrieveL1ToL2Message(this.inbox, localMsg);
|
|
573
|
+
logCtx.remoteMsg = remoteMsg;
|
|
574
|
+
if (remoteMsg && remoteMsg.rollingHash.equals(localMsg.rollingHash)) {
|
|
575
|
+
this.log.info(
|
|
576
|
+
`Found most recent common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber}`,
|
|
475
577
|
logCtx,
|
|
476
578
|
);
|
|
477
579
|
commonMsg = remoteMsg;
|
|
478
580
|
break;
|
|
479
581
|
} else if (remoteMsg) {
|
|
480
|
-
this.log.debug(`Local L1 to L2 message with index ${
|
|
582
|
+
this.log.debug(`Local L1 to L2 message with index ${localMsg.index} has different rolling hash`, logCtx);
|
|
583
|
+
messagesToDelete++;
|
|
481
584
|
} else {
|
|
482
|
-
this.log.debug(`Local L1 to L2 message with index ${
|
|
585
|
+
this.log.debug(`Local L1 to L2 message with index ${localMsg.index} not found on L1`, logCtx);
|
|
586
|
+
messagesToDelete++;
|
|
483
587
|
}
|
|
484
588
|
}
|
|
485
589
|
|
|
486
|
-
// Delete everything after the common message we found.
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
590
|
+
// Delete everything after the common message we found, if anything needs to be deleted.
|
|
591
|
+
// Do not exit early if there are no messages to delete, we still want to update the syncpoint.
|
|
592
|
+
if (messagesToDelete > 0) {
|
|
593
|
+
const lastGoodIndex = commonMsg?.index;
|
|
594
|
+
this.log.warn(`Rolling back all local L1 to L2 messages after index ${lastGoodIndex ?? 'initial'}`);
|
|
595
|
+
await this.stores.messages.removeL1ToL2Messages(lastGoodIndex !== undefined ? lastGoodIndex + 1n : 0n);
|
|
596
|
+
}
|
|
490
597
|
|
|
491
598
|
// Update the syncpoint so the loop below reprocesses the changed messages. We go to the block before
|
|
492
599
|
// the last common one, so we force reprocessing it, in case new messages were added on that same L1 block
|
|
493
|
-
// after the last common message.
|
|
494
|
-
|
|
495
|
-
const
|
|
496
|
-
|
|
497
|
-
|
|
600
|
+
// after the last common message. Cap at the finalized L1 block: messages at or below finalized cannot
|
|
601
|
+
// have been reorged, so there is no need to walk back any further than that.
|
|
602
|
+
const syncPointL1BlockNumber = maxBigint(
|
|
603
|
+
...compactArray([
|
|
604
|
+
commonMsg ? commonMsg.l1BlockNumber - 1n : undefined,
|
|
605
|
+
finalizedL1BlockNumber,
|
|
606
|
+
this.l1Constants.l1StartBlock,
|
|
607
|
+
]),
|
|
608
|
+
);
|
|
609
|
+
|
|
610
|
+
const syncPointL1BlockHash =
|
|
611
|
+
syncPointL1BlockNumber === finalizedL1BlockNumber
|
|
612
|
+
? messagesFinalizedL1Block!.l1BlockHash
|
|
613
|
+
: await this.getL1BlockHash(syncPointL1BlockNumber);
|
|
614
|
+
|
|
615
|
+
const messagesSyncPoint = { l1BlockNumber: syncPointL1BlockNumber, l1BlockHash: syncPointL1BlockHash };
|
|
616
|
+
await this.stores.messages.setMessageSyncState(messagesSyncPoint, remoteTreeInProgress);
|
|
617
|
+
this.log.verbose(`Updated messages syncpoint to L1 block ${messagesSyncPoint.l1BlockNumber}`, {
|
|
618
|
+
...messagesSyncPoint,
|
|
619
|
+
remoteTreeInProgress,
|
|
620
|
+
});
|
|
498
621
|
return messagesSyncPoint;
|
|
499
622
|
}
|
|
500
623
|
|
|
@@ -512,9 +635,10 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
512
635
|
currentL1BlockNumber: bigint,
|
|
513
636
|
initialSyncComplete: boolean,
|
|
514
637
|
): Promise<RollupStatus> {
|
|
515
|
-
const
|
|
638
|
+
const blocksAdded: L2Block[] = [];
|
|
639
|
+
const localPendingCheckpointNumber = await this.stores.blocks.getLatestCheckpointNumber();
|
|
516
640
|
const initialValidationResult: ValidateCheckpointResult | undefined =
|
|
517
|
-
await this.
|
|
641
|
+
await this.stores.blocks.getPendingChainValidationStatus();
|
|
518
642
|
const {
|
|
519
643
|
provenCheckpointNumber,
|
|
520
644
|
provenArchive,
|
|
@@ -530,6 +654,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
530
654
|
pendingCheckpointNumber,
|
|
531
655
|
pendingArchive: pendingArchive.toString(),
|
|
532
656
|
validationResult: initialValidationResult,
|
|
657
|
+
blocksAdded,
|
|
533
658
|
};
|
|
534
659
|
this.log.trace(`Retrieved rollup status at current L1 block ${currentL1BlockNumber}.`, {
|
|
535
660
|
localPendingCheckpointNumber,
|
|
@@ -544,7 +669,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
544
669
|
// we need to set it to zero. This is an edge case because we dont have a checkpoint zero (initial checkpoint is one),
|
|
545
670
|
// so localCheckpointForDestinationProvenCheckpointNumber would not be found below.
|
|
546
671
|
if (provenCheckpointNumber === 0) {
|
|
547
|
-
const localProvenCheckpointNumber = await this.
|
|
672
|
+
const localProvenCheckpointNumber = await this.stores.blocks.getProvenCheckpointNumber();
|
|
548
673
|
if (localProvenCheckpointNumber !== provenCheckpointNumber) {
|
|
549
674
|
await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
|
|
550
675
|
this.log.info(`Rolled back proven chain to checkpoint ${provenCheckpointNumber}`, { provenCheckpointNumber });
|
|
@@ -552,11 +677,11 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
552
677
|
}
|
|
553
678
|
|
|
554
679
|
const localCheckpointForDestinationProvenCheckpointNumber =
|
|
555
|
-
await this.
|
|
680
|
+
await this.stores.blocks.getCheckpointData(provenCheckpointNumber);
|
|
556
681
|
|
|
557
682
|
// Sanity check. I've hit what seems to be a state where the proven checkpoint is set to a value greater than the latest
|
|
558
683
|
// synched checkpoint when requesting L2Tips from the archiver. This is the only place where the proven checkpoint is set.
|
|
559
|
-
const synched = await this.
|
|
684
|
+
const synched = await this.stores.blocks.getLatestCheckpointNumber();
|
|
560
685
|
if (
|
|
561
686
|
localCheckpointForDestinationProvenCheckpointNumber &&
|
|
562
687
|
synched < localCheckpointForDestinationProvenCheckpointNumber.checkpointNumber
|
|
@@ -576,7 +701,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
576
701
|
localCheckpointForDestinationProvenCheckpointNumber &&
|
|
577
702
|
provenArchive.equals(localCheckpointForDestinationProvenCheckpointNumber.archive.root)
|
|
578
703
|
) {
|
|
579
|
-
const localProvenCheckpointNumber = await this.
|
|
704
|
+
const localProvenCheckpointNumber = await this.stores.blocks.getProvenCheckpointNumber();
|
|
580
705
|
if (localProvenCheckpointNumber !== provenCheckpointNumber) {
|
|
581
706
|
await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
|
|
582
707
|
this.log.info(`Updated proven chain to checkpoint ${provenCheckpointNumber}`, { provenCheckpointNumber });
|
|
@@ -604,7 +729,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
604
729
|
// If we have 0 checkpoints locally and there are no checkpoints onchain there is nothing to do.
|
|
605
730
|
const noCheckpoints = localPendingCheckpointNumber === 0 && pendingCheckpointNumber === 0;
|
|
606
731
|
if (noCheckpoints) {
|
|
607
|
-
await this.
|
|
732
|
+
await this.stores.blocks.setSynchedL1BlockNumber(currentL1BlockNumber);
|
|
608
733
|
this.log.debug(
|
|
609
734
|
`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}, no checkpoints on chain`,
|
|
610
735
|
);
|
|
@@ -616,7 +741,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
616
741
|
// Related to the L2 reorgs of the pending chain. We are only interested in actually addressing a reorg if there
|
|
617
742
|
// are any state that could be impacted by it. If we have no checkpoints, there is no impact.
|
|
618
743
|
if (localPendingCheckpointNumber > 0) {
|
|
619
|
-
const localPendingCheckpoint = await this.
|
|
744
|
+
const localPendingCheckpoint = await this.stores.blocks.getCheckpointData(localPendingCheckpointNumber);
|
|
620
745
|
if (localPendingCheckpoint === undefined) {
|
|
621
746
|
throw new Error(`Missing checkpoint ${localPendingCheckpointNumber}`);
|
|
622
747
|
}
|
|
@@ -631,7 +756,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
631
756
|
// However, in the re-org scenario, our L1 node is temporarily lying to us and we end up potentially missing checkpoints.
|
|
632
757
|
// We must only set this block number based on actually retrieved logs.
|
|
633
758
|
// TODO(#8621): Tackle this properly when we handle L1 Re-orgs.
|
|
634
|
-
// await this.
|
|
759
|
+
// await this.stores.blocks.setSynchedL1BlockNumber(currentL1BlockNumber);
|
|
635
760
|
this.log.debug(`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}`);
|
|
636
761
|
return rollupStatus;
|
|
637
762
|
}
|
|
@@ -651,7 +776,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
651
776
|
|
|
652
777
|
let tipAfterUnwind = localPendingCheckpointNumber;
|
|
653
778
|
while (true) {
|
|
654
|
-
const candidateCheckpoint = await this.
|
|
779
|
+
const candidateCheckpoint = await this.stores.blocks.getCheckpointData(tipAfterUnwind);
|
|
655
780
|
if (candidateCheckpoint === undefined) {
|
|
656
781
|
break;
|
|
657
782
|
}
|
|
@@ -672,11 +797,14 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
672
797
|
|
|
673
798
|
const checkpointsToRemove = localPendingCheckpointNumber - tipAfterUnwind;
|
|
674
799
|
await this.updater.removeCheckpointsAfter(CheckpointNumber(tipAfterUnwind));
|
|
800
|
+
if (checkpointsToRemove > 0) {
|
|
801
|
+
this.instrumentation.recordPrune('l1_mismatch');
|
|
802
|
+
}
|
|
675
803
|
|
|
676
804
|
this.log.warn(
|
|
677
805
|
`Removed ${count(checkpointsToRemove, 'checkpoint')} after checkpoint ${tipAfterUnwind} ` +
|
|
678
806
|
`due to mismatched checkpoint hashes at L1 block ${currentL1BlockNumber}. ` +
|
|
679
|
-
`Updated L2 latest checkpoint is ${await this.
|
|
807
|
+
`Updated L2 latest checkpoint is ${await this.stores.blocks.getLatestCheckpointNumber()}.`,
|
|
680
808
|
);
|
|
681
809
|
}
|
|
682
810
|
}
|
|
@@ -686,29 +814,27 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
686
814
|
let searchStartBlock: bigint = blocksSynchedTo;
|
|
687
815
|
let searchEndBlock: bigint = blocksSynchedTo;
|
|
688
816
|
let lastRetrievedCheckpoint: PublishedCheckpoint | undefined;
|
|
689
|
-
let
|
|
817
|
+
let lastSeenCheckpoint: { checkpointNumber: CheckpointNumber; l1: L1PublishedData } | undefined;
|
|
690
818
|
|
|
691
819
|
do {
|
|
692
820
|
[searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, currentL1BlockNumber);
|
|
693
821
|
|
|
694
822
|
this.log.trace(`Retrieving checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
|
|
695
823
|
|
|
696
|
-
//
|
|
697
|
-
const
|
|
698
|
-
|
|
824
|
+
// First fetch calldata only, no blobs yet, since we may be able to just get that data out of the proposed chain
|
|
825
|
+
const calldataCheckpoints = await execInSpan(this.tracer, 'Archiver.retrieveCheckpointCalldataFromRollup', () =>
|
|
826
|
+
retrieveCheckpointCalldataFromRollup(
|
|
699
827
|
this.rollup,
|
|
700
828
|
this.publicClient,
|
|
701
829
|
this.debugClient,
|
|
702
|
-
this.blobClient,
|
|
703
830
|
searchStartBlock, // TODO(palla/reorg): If the L2 reorg was due to an L1 reorg, we need to start search earlier
|
|
704
831
|
searchEndBlock,
|
|
705
832
|
this.instrumentation,
|
|
706
833
|
this.log,
|
|
707
|
-
!initialSyncComplete, // isHistoricalSync
|
|
708
834
|
),
|
|
709
835
|
);
|
|
710
836
|
|
|
711
|
-
if (
|
|
837
|
+
if (calldataCheckpoints.length === 0) {
|
|
712
838
|
// We are not calling `setBlockSynchedL1BlockNumber` because it may cause sync issues if based off infura.
|
|
713
839
|
// See further details in earlier comments.
|
|
714
840
|
this.log.trace(`Retrieved no new checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
|
|
@@ -716,40 +842,74 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
716
842
|
}
|
|
717
843
|
|
|
718
844
|
this.log.debug(
|
|
719
|
-
`Retrieved ${
|
|
845
|
+
`Retrieved ${calldataCheckpoints.length} new checkpoint calldata between L1 blocks ${searchStartBlock} and ${searchEndBlock}`,
|
|
720
846
|
{
|
|
721
|
-
lastProcessedCheckpoint:
|
|
847
|
+
lastProcessedCheckpoint: calldataCheckpoints[calldataCheckpoints.length - 1].l1,
|
|
722
848
|
searchStartBlock,
|
|
723
849
|
searchEndBlock,
|
|
724
850
|
},
|
|
725
851
|
);
|
|
726
852
|
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
853
|
+
// Check if the last checkpoint matches a local pending entry (so we can skip blob fetch).
|
|
854
|
+
// We only check the last one; if it matches, the blob fetch is skipped for that entry.
|
|
855
|
+
// TODO(palla/pipelining): We may have more than a single checkpoint to promote
|
|
856
|
+
const lastCalldataCheckpoint = calldataCheckpoints[calldataCheckpoints.length - 1];
|
|
857
|
+
const promoteResult = await this.tryBuildPublishedCheckpointFromProposed(lastCalldataCheckpoint);
|
|
858
|
+
const checkpointToPromote = promoteResult && !('diverged' in promoteResult) ? promoteResult : undefined;
|
|
859
|
+
const evictProposedFrom =
|
|
860
|
+
promoteResult && 'diverged' in promoteResult ? promoteResult.fromCheckpointNumber : undefined;
|
|
861
|
+
|
|
862
|
+
// Validate attestations from CALLDATA before fetching any blobs. A checkpoint with invalid
|
|
863
|
+
// attestations (or one descending from a rejected ancestor) is rejected here without fetching its
|
|
864
|
+
// blobs, so a malformed blob does not throw during decode before the rejection path runs and
|
|
865
|
+
// stall sync. The signed consensus payload (header, archive root, fee asset price
|
|
866
|
+
// modifier) is fully available from calldata.
|
|
867
|
+
const checkpointsToIngest: RetrievedCheckpointFromCalldata[] = [];
|
|
868
|
+
|
|
869
|
+
for (const calldataCheckpoint of calldataCheckpoints) {
|
|
870
|
+
// Check the attestations uploaded by the publisher to L1 are correct.
|
|
871
|
+
// Rollup contract does not validate attestations to save on gas, so this
|
|
872
|
+
// falls on the nodes to verify offchain and skip those checkpoints.
|
|
731
873
|
const validationResult = this.config.skipValidateCheckpointAttestations
|
|
732
874
|
? { valid: true as const }
|
|
733
|
-
: await
|
|
875
|
+
: await validateCheckpointAttestationsFromCalldata(
|
|
876
|
+
calldataCheckpoint,
|
|
877
|
+
this.epochCache,
|
|
878
|
+
this.l1Constants,
|
|
879
|
+
this.getSignatureContext(),
|
|
880
|
+
this.log,
|
|
881
|
+
);
|
|
882
|
+
|
|
883
|
+
// Also skip the checkpoint if it builds on a previously-rejected ancestor. Without
|
|
884
|
+
// this, addCheckpoints would throw InitialCheckpointNumberNotSequentialError when the
|
|
885
|
+
// ancestor was skipped earlier (e.g. due to invalid attestations), the catch handler
|
|
886
|
+
// would roll back the L1 sync point, and the next iteration would re-fetch and re-throw.
|
|
887
|
+
const rejectedAncestor = await this.stores.blocks.getRejectedCheckpointByArchiveRoot(
|
|
888
|
+
calldataCheckpoint.header.lastArchiveRoot,
|
|
889
|
+
);
|
|
734
890
|
|
|
735
|
-
//
|
|
891
|
+
// Update the validation result if it has changed, so we can keep track of the first invalid checkpoint
|
|
736
892
|
// in case there is a sequence of more than one invalid checkpoint, as we need to invalidate the first one.
|
|
737
893
|
// There is an exception though: if a checkpoint is invalidated and replaced with another invalid checkpoint,
|
|
738
894
|
// we need to update the validation result, since we need to be able to invalidate the new one.
|
|
739
895
|
// See test 'chain progresses if an invalid checkpoint is invalidated with an invalid one' for more info.
|
|
740
|
-
if
|
|
741
|
-
|
|
742
|
-
|
|
743
|
-
|
|
744
|
-
|
|
745
|
-
|
|
896
|
+
// Do not update the validation result if there is a rejected ancestor, since in that case we want to keep the
|
|
897
|
+
// original invalidation, as the new checkpoint is extending from a previous invalid one.
|
|
898
|
+
const validStatusChanged = rollupStatus.validationResult?.valid !== validationResult.valid;
|
|
899
|
+
const invalidStatusWithSameCheckpointNumber =
|
|
900
|
+
!validationResult.valid &&
|
|
901
|
+
rollupStatus.validationResult &&
|
|
902
|
+
!rollupStatus.validationResult.valid &&
|
|
903
|
+
rollupStatus.validationResult.checkpoint.checkpointNumber === validationResult.checkpoint.checkpointNumber;
|
|
904
|
+
|
|
905
|
+
if (!rejectedAncestor && (validStatusChanged || invalidStatusWithSameCheckpointNumber)) {
|
|
746
906
|
rollupStatus.validationResult = validationResult;
|
|
747
907
|
}
|
|
748
908
|
|
|
749
909
|
if (!validationResult.valid) {
|
|
750
|
-
this.log.warn(`Skipping checkpoint ${
|
|
751
|
-
|
|
752
|
-
l1BlockNumber:
|
|
910
|
+
this.log.warn(`Skipping checkpoint ${calldataCheckpoint.checkpointNumber} due to invalid attestations`, {
|
|
911
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
912
|
+
l1BlockNumber: calldataCheckpoint.l1.blockNumber,
|
|
753
913
|
...pick(validationResult, 'reason'),
|
|
754
914
|
});
|
|
755
915
|
|
|
@@ -759,16 +919,104 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
759
919
|
validationResult,
|
|
760
920
|
});
|
|
761
921
|
|
|
762
|
-
//
|
|
763
|
-
//
|
|
764
|
-
//
|
|
922
|
+
// Persist a rejected-ancestor entry so any later checkpoint that builds on this one
|
|
923
|
+
// is detected and skipped (rather than tripping the addCheckpoints consecutive-number
|
|
924
|
+
// check and causing the sync point to roll back in a loop).
|
|
925
|
+
await this.stores.blocks.addRejectedCheckpoint({
|
|
926
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
927
|
+
archiveRoot: calldataCheckpoint.archiveRoot,
|
|
928
|
+
parentArchiveRoot: calldataCheckpoint.header.lastArchiveRoot,
|
|
929
|
+
slotNumber: calldataCheckpoint.header.slotNumber,
|
|
930
|
+
l1: calldataCheckpoint.l1,
|
|
931
|
+
reason: 'invalid-attestations' as const,
|
|
932
|
+
});
|
|
933
|
+
|
|
934
|
+
continue;
|
|
935
|
+
}
|
|
936
|
+
|
|
937
|
+
if (rejectedAncestor) {
|
|
938
|
+
const descendantInfo: CheckpointInfo = {
|
|
939
|
+
archive: calldataCheckpoint.archiveRoot,
|
|
940
|
+
lastArchive: calldataCheckpoint.header.lastArchiveRoot,
|
|
941
|
+
slotNumber: calldataCheckpoint.header.slotNumber,
|
|
942
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
943
|
+
timestamp: calldataCheckpoint.header.timestamp,
|
|
944
|
+
};
|
|
945
|
+
this.log.warn(
|
|
946
|
+
`Skipping checkpoint ${calldataCheckpoint.checkpointNumber} as it is a descendant of ` +
|
|
947
|
+
`rejected checkpoint ${rejectedAncestor.checkpointNumber} (${rejectedAncestor.reason})`,
|
|
948
|
+
{
|
|
949
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
950
|
+
l1BlockNumber: calldataCheckpoint.l1.blockNumber,
|
|
951
|
+
l1BlockHash: calldataCheckpoint.l1.blockHash,
|
|
952
|
+
ancestorCheckpointNumber: rejectedAncestor.checkpointNumber,
|
|
953
|
+
ancestorArchiveRoot: rejectedAncestor.archiveRoot.toString(),
|
|
954
|
+
ancestorReason: rejectedAncestor.reason,
|
|
955
|
+
},
|
|
956
|
+
);
|
|
957
|
+
|
|
958
|
+
this.events.emit(L2BlockSourceEvents.DescendentOfInvalidAttestationsCheckpointDetected, {
|
|
959
|
+
type: L2BlockSourceEvents.DescendentOfInvalidAttestationsCheckpointDetected,
|
|
960
|
+
checkpoint: descendantInfo,
|
|
961
|
+
ancestorArchiveRoot: rejectedAncestor.archiveRoot,
|
|
962
|
+
ancestorCheckpointNumber: rejectedAncestor.checkpointNumber,
|
|
963
|
+
});
|
|
964
|
+
|
|
965
|
+
// Persist this chainpoint as rejected as well, so we can construct a chain of
|
|
966
|
+
// skipped checkpoints starting from the first one with invalid attestations.
|
|
967
|
+
await this.stores.blocks.addRejectedCheckpoint({
|
|
968
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
969
|
+
archiveRoot: calldataCheckpoint.archiveRoot,
|
|
970
|
+
parentArchiveRoot: calldataCheckpoint.header.lastArchiveRoot,
|
|
971
|
+
slotNumber: calldataCheckpoint.header.slotNumber,
|
|
972
|
+
l1: calldataCheckpoint.l1,
|
|
973
|
+
reason: 'descends-from-invalid-attestations' as const,
|
|
974
|
+
});
|
|
975
|
+
|
|
765
976
|
continue;
|
|
766
977
|
}
|
|
767
978
|
|
|
979
|
+
checkpointsToIngest.push(calldataCheckpoint);
|
|
980
|
+
}
|
|
981
|
+
|
|
982
|
+
// Fetch blobs in parallel only for the surviving (attestation-valid, non-descendant) checkpoints,
|
|
983
|
+
// then build the full published checkpoints. The last calldata checkpoint may be promotable from a
|
|
984
|
+
// local proposed block (checkpointToPromote), in which case it carries no blob to fetch. A missing or
|
|
985
|
+
// undecodable blob throws and propagates, rolling back the L1 sync point so the fetch is retried.
|
|
986
|
+
const toFetchBlobs = checkpointToPromote
|
|
987
|
+
? checkpointsToIngest.filter(c => c.checkpointNumber !== checkpointToPromote.checkpoint.number)
|
|
988
|
+
: checkpointsToIngest;
|
|
989
|
+
const blobFetched = await asyncPool(10, toFetchBlobs, async checkpoint =>
|
|
990
|
+
retrievedToPublishedCheckpoint({
|
|
991
|
+
...checkpoint,
|
|
992
|
+
checkpointBlobData: await getCheckpointBlobDataFromBlobs(
|
|
993
|
+
this.blobClient,
|
|
994
|
+
checkpoint.l1.blockHash,
|
|
995
|
+
checkpoint.blobHashes,
|
|
996
|
+
checkpoint.checkpointNumber,
|
|
997
|
+
this.log,
|
|
998
|
+
!initialSyncComplete,
|
|
999
|
+
checkpoint.parentBeaconBlockRoot,
|
|
1000
|
+
checkpoint.l1.timestamp,
|
|
1001
|
+
),
|
|
1002
|
+
}),
|
|
1003
|
+
);
|
|
1004
|
+
|
|
1005
|
+
// Index the built checkpoints by number so we can ingest them in calldata order, slotting in the
|
|
1006
|
+
// promoted checkpoint (built from a local proposed block rather than blobs).
|
|
1007
|
+
const publishedByNumber = new Map(blobFetched.map(published => [published.checkpoint.number, published]));
|
|
1008
|
+
if (checkpointToPromote) {
|
|
1009
|
+
publishedByNumber.set(checkpointToPromote.checkpoint.number, checkpointToPromote);
|
|
1010
|
+
}
|
|
1011
|
+
|
|
1012
|
+
const validCheckpoints: PublishedCheckpoint[] = [];
|
|
1013
|
+
for (const calldataCheckpoint of checkpointsToIngest) {
|
|
1014
|
+
const published = publishedByNumber.get(calldataCheckpoint.checkpointNumber)!;
|
|
1015
|
+
|
|
768
1016
|
// Check the inHash of the checkpoint against the l1->l2 messages.
|
|
769
1017
|
// The messages should've been synced up to the currentL1BlockNumber and must be available for the published
|
|
770
1018
|
// checkpoints we just retrieved.
|
|
771
|
-
const l1ToL2Messages = await this.
|
|
1019
|
+
const l1ToL2Messages = await this.stores.messages.getL1ToL2Messages(published.checkpoint.number);
|
|
772
1020
|
const computedInHash = computeInHashFromL1ToL2Messages(l1ToL2Messages);
|
|
773
1021
|
const publishedInHash = published.checkpoint.header.inHash;
|
|
774
1022
|
if (!computedInHash.equals(publishedInHash)) {
|
|
@@ -807,26 +1055,53 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
807
1055
|
try {
|
|
808
1056
|
const updatedValidationResult =
|
|
809
1057
|
rollupStatus.validationResult === initialValidationResult ? undefined : rollupStatus.validationResult;
|
|
1058
|
+
|
|
1059
|
+
// Split valid checkpoints: the promoted one (if any) is persisted via the proposed-promotion path,
|
|
1060
|
+
// the rest via addCheckpoints. Both paths run within the same store transaction for atomicity.
|
|
1061
|
+
const [[maybeValidCheckpointToPromote], checkpointsToAdd] = partition(
|
|
1062
|
+
validCheckpoints,
|
|
1063
|
+
c => c.checkpoint.number === checkpointToPromote?.checkpoint.number,
|
|
1064
|
+
);
|
|
1065
|
+
|
|
810
1066
|
const [processDuration, result] = await elapsed(() =>
|
|
811
1067
|
execInSpan(this.tracer, 'Archiver.addCheckpoints', () =>
|
|
812
|
-
this.updater.addCheckpoints(
|
|
1068
|
+
this.updater.addCheckpoints(
|
|
1069
|
+
checkpointsToAdd,
|
|
1070
|
+
updatedValidationResult,
|
|
1071
|
+
maybeValidCheckpointToPromote && {
|
|
1072
|
+
l1: lastCalldataCheckpoint.l1,
|
|
1073
|
+
attestations: lastCalldataCheckpoint.attestations,
|
|
1074
|
+
checkpoint: maybeValidCheckpointToPromote,
|
|
1075
|
+
},
|
|
1076
|
+
evictProposedFrom,
|
|
1077
|
+
),
|
|
813
1078
|
),
|
|
814
1079
|
);
|
|
815
|
-
|
|
816
|
-
|
|
817
|
-
|
|
818
|
-
|
|
1080
|
+
|
|
1081
|
+
if (validCheckpoints.length > 0) {
|
|
1082
|
+
this.instrumentation.processNewCheckpointedBlocks(
|
|
1083
|
+
processDuration / validCheckpoints.length,
|
|
1084
|
+
validCheckpoints.flatMap(c => c.checkpoint.blocks),
|
|
1085
|
+
);
|
|
1086
|
+
}
|
|
1087
|
+
|
|
1088
|
+
// Record blocks newly fetched from L1 checkpoint payloads as added. The promoted checkpoint (if any) is
|
|
1089
|
+
// excluded: its blocks were already in local archiver storage (added via the proposed-block path) so the
|
|
1090
|
+
// block stream does not need them re-downloaded.
|
|
1091
|
+
blocksAdded.push(...checkpointsToAdd.flatMap(c => c.checkpoint.blocks));
|
|
819
1092
|
|
|
820
1093
|
// If blocks were pruned due to conflict with L1 checkpoints, emit event
|
|
821
1094
|
if (result.prunedBlocks && result.prunedBlocks.length > 0) {
|
|
822
1095
|
const prunedCheckpointNumber = result.prunedBlocks[0].checkpointNumber;
|
|
823
1096
|
const prunedSlotNumber = result.prunedBlocks[0].header.globalVariables.slotNumber;
|
|
824
1097
|
|
|
825
|
-
this.log.
|
|
1098
|
+
this.log.info(
|
|
826
1099
|
`Pruned ${result.prunedBlocks.length} mismatching blocks for checkpoint ${prunedCheckpointNumber}`,
|
|
827
1100
|
{ prunedBlocks: result.prunedBlocks.map(b => b.toBlockInfo()), prunedSlotNumber, prunedCheckpointNumber },
|
|
828
1101
|
);
|
|
829
1102
|
|
|
1103
|
+
this.instrumentation.recordPrune('l1_conflict');
|
|
1104
|
+
|
|
830
1105
|
// Emit event for listening services to react to the prune.
|
|
831
1106
|
// Note: slotNumber comes from the first pruned block. If pruned blocks theoretically spanned multiple slots,
|
|
832
1107
|
// only one slot number would be reported (though in practice all blocks in a checkpoint span a single slot).
|
|
@@ -840,14 +1115,23 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
840
1115
|
if (err instanceof InitialCheckpointNumberNotSequentialError) {
|
|
841
1116
|
const { previousCheckpointNumber, newCheckpointNumber } = err;
|
|
842
1117
|
const previousCheckpoint = previousCheckpointNumber
|
|
843
|
-
? await this.
|
|
1118
|
+
? await this.stores.blocks.getCheckpointData(CheckpointNumber(previousCheckpointNumber))
|
|
844
1119
|
: undefined;
|
|
845
|
-
const
|
|
846
|
-
|
|
1120
|
+
const lastFinalizedCheckpoint = await this.stores.blocks.getCheckpointData(
|
|
1121
|
+
await this.stores.blocks.getFinalizedCheckpointNumber(),
|
|
1122
|
+
);
|
|
1123
|
+
const updatedL1SyncPoint =
|
|
1124
|
+
previousCheckpoint?.l1.blockNumber ??
|
|
1125
|
+
lastFinalizedCheckpoint?.l1.blockNumber ??
|
|
1126
|
+
this.l1Constants.l1StartBlock;
|
|
1127
|
+
await this.stores.blocks.setSynchedL1BlockNumber(updatedL1SyncPoint);
|
|
847
1128
|
this.log.warn(
|
|
848
1129
|
`Attempting to insert checkpoint ${newCheckpointNumber} with previous block ${previousCheckpointNumber}. Rolling back L1 sync point to ${updatedL1SyncPoint} to try and fetch the missing blocks.`,
|
|
849
1130
|
{
|
|
850
1131
|
previousCheckpointNumber,
|
|
1132
|
+
previousCheckpoint: previousCheckpoint?.header.toInspect(),
|
|
1133
|
+
lastFinalizedCheckpoint: lastFinalizedCheckpoint?.header.toInspect(),
|
|
1134
|
+
l1StartBlock: this.l1Constants.l1StartBlock,
|
|
851
1135
|
newCheckpointNumber,
|
|
852
1136
|
updatedL1SyncPoint,
|
|
853
1137
|
},
|
|
@@ -868,13 +1152,107 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
868
1152
|
});
|
|
869
1153
|
}
|
|
870
1154
|
lastRetrievedCheckpoint = validCheckpoints.at(-1) ?? lastRetrievedCheckpoint;
|
|
871
|
-
|
|
1155
|
+
// The last checkpoint seen on L1 this batch (valid or rejected), tracked from calldata since
|
|
1156
|
+
// rejected checkpoints are no longer built into PublishedCheckpoints.
|
|
1157
|
+
lastSeenCheckpoint = lastCalldataCheckpoint;
|
|
872
1158
|
} while (searchEndBlock < currentL1BlockNumber);
|
|
873
1159
|
|
|
874
1160
|
// Important that we update AFTER inserting the blocks.
|
|
875
1161
|
await updateProvenCheckpoint();
|
|
876
1162
|
|
|
877
|
-
return { ...rollupStatus, lastRetrievedCheckpoint,
|
|
1163
|
+
return { ...rollupStatus, lastRetrievedCheckpoint, lastSeenCheckpoint };
|
|
1164
|
+
}
|
|
1165
|
+
|
|
1166
|
+
/**
|
|
1167
|
+
* Checks if a specific checkpoint matches a local pending entry, and if so, loads local data to build
|
|
1168
|
+
* a synthetic published checkpoint (skipping blob fetch).
|
|
1169
|
+
*
|
|
1170
|
+
* Returns { diverged: true, fromCheckpointNumber } when the L1 checkpoint does NOT match local pending
|
|
1171
|
+
* data for that number, so the caller can evict the entire pending suffix >= fromCheckpointNumber
|
|
1172
|
+
* (those entries chain off the now-invalid local state) within the same addCheckpoints transaction.
|
|
1173
|
+
*/
|
|
1174
|
+
private async tryBuildPublishedCheckpointFromProposed(
|
|
1175
|
+
calldataCheckpoint: RetrievedCheckpointFromCalldata | undefined,
|
|
1176
|
+
): Promise<PublishedCheckpoint | { diverged: true; fromCheckpointNumber: CheckpointNumber } | undefined> {
|
|
1177
|
+
if (this.config.skipPromoteProposedCheckpointDuringL1Sync || !calldataCheckpoint) {
|
|
1178
|
+
return undefined;
|
|
1179
|
+
}
|
|
1180
|
+
|
|
1181
|
+
// Look up the specific pending entry for the checkpoint being mined, not just the tip
|
|
1182
|
+
const proposed = await this.stores.blocks.getProposedCheckpointByNumber(calldataCheckpoint.checkpointNumber);
|
|
1183
|
+
if (!proposed) {
|
|
1184
|
+
return undefined;
|
|
1185
|
+
}
|
|
1186
|
+
|
|
1187
|
+
if (
|
|
1188
|
+
!proposed.header.equals(calldataCheckpoint.header) ||
|
|
1189
|
+
!proposed.archive.root.equals(calldataCheckpoint.archiveRoot)
|
|
1190
|
+
) {
|
|
1191
|
+
this.log.warn(
|
|
1192
|
+
`Local proposed checkpoint ${proposed.checkpointNumber} does not match checkpoint retrieved from L1, overriding with L1 data`,
|
|
1193
|
+
{
|
|
1194
|
+
proposedCheckpointNumber: proposed.checkpointNumber,
|
|
1195
|
+
proposedHeader: proposed.header.toInspect(),
|
|
1196
|
+
proposedArchiveRoot: proposed.archive.root.toString(),
|
|
1197
|
+
calldataCheckpointNumber: calldataCheckpoint.checkpointNumber,
|
|
1198
|
+
calldataHeader: calldataCheckpoint.header.toInspect(),
|
|
1199
|
+
calldataArchiveRoot: calldataCheckpoint.archiveRoot.toString(),
|
|
1200
|
+
},
|
|
1201
|
+
);
|
|
1202
|
+
// Both the locally-proposed checkpoint and the L1-confirmed one are signed by the
|
|
1203
|
+
// slot proposer; emit a divergence event so the slasher can attribute equivocation.
|
|
1204
|
+
// Only emit when the slots match — uncheckpointed entries are pruned above so this
|
|
1205
|
+
// should always hold, but guard defensively to avoid mis-attributing a slash.
|
|
1206
|
+
if (proposed.header.slotNumber === calldataCheckpoint.header.slotNumber) {
|
|
1207
|
+
this.events.emit(L2BlockSourceEvents.CheckpointEquivocationDetected, {
|
|
1208
|
+
type: L2BlockSourceEvents.CheckpointEquivocationDetected,
|
|
1209
|
+
slotNumber: calldataCheckpoint.header.slotNumber,
|
|
1210
|
+
checkpointNumber: calldataCheckpoint.checkpointNumber,
|
|
1211
|
+
l1ArchiveRoot: calldataCheckpoint.archiveRoot,
|
|
1212
|
+
proposedArchiveRoot: proposed.archive.root,
|
|
1213
|
+
});
|
|
1214
|
+
}
|
|
1215
|
+
// Return a divergence signal so the caller can evict pending >= this number
|
|
1216
|
+
return { diverged: true, fromCheckpointNumber: proposed.checkpointNumber };
|
|
1217
|
+
}
|
|
1218
|
+
|
|
1219
|
+
this.log.debug(
|
|
1220
|
+
`Building published checkpoint from proposed ${calldataCheckpoint.checkpointNumber} (skipping blob fetch)`,
|
|
1221
|
+
{ proposedHeader: proposed.header.toInspect(), proposedArchiveRoot: proposed.archive.root.toString() },
|
|
1222
|
+
);
|
|
1223
|
+
|
|
1224
|
+
const blocks = await this.stores.blocks.getBlocks({
|
|
1225
|
+
from: BlockNumber(proposed.startBlock),
|
|
1226
|
+
limit: proposed.blockCount,
|
|
1227
|
+
});
|
|
1228
|
+
if (blocks.length !== proposed.blockCount) {
|
|
1229
|
+
this.log.warn(
|
|
1230
|
+
`Local proposed checkpoint ${proposed.checkpointNumber} has wrong block count (expected ${proposed.blockCount} blocks starting at ${proposed.startBlock} but got ${blocks.length})`,
|
|
1231
|
+
{
|
|
1232
|
+
proposedCheckpointNumber: proposed.checkpointNumber,
|
|
1233
|
+
proposedStartBlock: proposed.startBlock,
|
|
1234
|
+
proposedBlockCount: proposed.blockCount,
|
|
1235
|
+
retrievedBlocks: blocks.map(b => b.number),
|
|
1236
|
+
},
|
|
1237
|
+
);
|
|
1238
|
+
return undefined;
|
|
1239
|
+
}
|
|
1240
|
+
|
|
1241
|
+
const checkpoint = Checkpoint.from({
|
|
1242
|
+
archive: proposed.archive,
|
|
1243
|
+
header: proposed.header,
|
|
1244
|
+
blocks,
|
|
1245
|
+
number: proposed.checkpointNumber,
|
|
1246
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier,
|
|
1247
|
+
});
|
|
1248
|
+
const promotedCheckpoint = PublishedCheckpoint.from({
|
|
1249
|
+
checkpoint,
|
|
1250
|
+
l1: calldataCheckpoint.l1,
|
|
1251
|
+
attestations: calldataCheckpoint.attestations,
|
|
1252
|
+
});
|
|
1253
|
+
this.instrumentation.processCheckpointPromoted();
|
|
1254
|
+
|
|
1255
|
+
return promotedCheckpoint;
|
|
878
1256
|
}
|
|
879
1257
|
|
|
880
1258
|
private async checkForNewCheckpointsBeforeL1SyncPoint(
|
|
@@ -882,39 +1260,48 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
882
1260
|
blocksSynchedTo: bigint,
|
|
883
1261
|
currentL1BlockNumber: bigint,
|
|
884
1262
|
): Promise<void> {
|
|
885
|
-
const {
|
|
886
|
-
// Compare the last checkpoint we have (either retrieved in this round or loaded from store)
|
|
887
|
-
// rollup contract told us was the latest one (pinned at the currentL1BlockNumber).
|
|
1263
|
+
const { lastSeenCheckpoint, pendingCheckpointNumber } = status;
|
|
1264
|
+
// Compare the last checkpoint (valid or not) we have (either retrieved in this round or loaded from store)
|
|
1265
|
+
// with what the rollup contract told us was the latest one (pinned at the currentL1BlockNumber).
|
|
888
1266
|
const latestLocalCheckpointNumber =
|
|
889
|
-
|
|
1267
|
+
lastSeenCheckpoint?.checkpointNumber ??
|
|
1268
|
+
CheckpointNumber.max(
|
|
1269
|
+
await this.stores.blocks.getLatestCheckpointNumber(),
|
|
1270
|
+
await this.stores.blocks.getLatestRejectedCheckpointNumber(),
|
|
1271
|
+
) ??
|
|
1272
|
+
CheckpointNumber.ZERO;
|
|
1273
|
+
|
|
890
1274
|
if (latestLocalCheckpointNumber < pendingCheckpointNumber) {
|
|
891
1275
|
// Here we have consumed all logs until the `currentL1Block` we pinned at the beginning of the archiver loop,
|
|
892
1276
|
// but still haven't reached the pending checkpoint according to the call to the rollup contract.
|
|
893
1277
|
// We suspect an L1 reorg that added checkpoints *behind* us. If that is the case, it must have happened between
|
|
894
1278
|
// the last checkpoint we saw and the current one, so we reset the last synched L1 block number. In the edge case
|
|
895
1279
|
// we don't have one, we go back 2 L1 epochs, which is the deepest possible reorg (assuming Casper is working).
|
|
896
|
-
|
|
897
|
-
|
|
898
|
-
|
|
899
|
-
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
|
|
905
|
-
|
|
1280
|
+
const latestLocalCheckpoint:
|
|
1281
|
+
| { checkpointNumber: CheckpointNumber; l1: L1PublishedData }
|
|
1282
|
+
| CheckpointData
|
|
1283
|
+
| RejectedCheckpoint
|
|
1284
|
+
| undefined =
|
|
1285
|
+
lastSeenCheckpoint ??
|
|
1286
|
+
(await this.stores.blocks.getCheckpointData(latestLocalCheckpointNumber)) ??
|
|
1287
|
+
(await this.stores.blocks.getRejectedCheckpointByNumber(latestLocalCheckpointNumber));
|
|
1288
|
+
|
|
1289
|
+
const targetL1BlockNumber =
|
|
1290
|
+
latestLocalCheckpoint?.l1.blockNumber ??
|
|
1291
|
+
maxBigint(currentL1BlockNumber - 64n, this.l1Constants.l1StartBlock, 0n);
|
|
1292
|
+
|
|
906
1293
|
this.log.warn(
|
|
907
1294
|
`Failed to reach checkpoint ${pendingCheckpointNumber} at ${currentL1BlockNumber} (latest is ${latestLocalCheckpointNumber}). ` +
|
|
908
1295
|
`Rolling back last synched L1 block number to ${targetL1BlockNumber}.`,
|
|
909
1296
|
{
|
|
910
1297
|
latestLocalCheckpointNumber,
|
|
911
|
-
|
|
1298
|
+
latestLocalCheckpointL1: latestLocalCheckpoint?.l1,
|
|
912
1299
|
blocksSynchedTo,
|
|
913
1300
|
currentL1BlockNumber,
|
|
914
1301
|
...status,
|
|
915
1302
|
},
|
|
916
1303
|
);
|
|
917
|
-
await this.
|
|
1304
|
+
await this.stores.blocks.setSynchedL1BlockNumber(targetL1BlockNumber);
|
|
918
1305
|
} else {
|
|
919
1306
|
this.log.trace(`No new checkpoints behind L1 sync point to retrieve.`, {
|
|
920
1307
|
latestLocalCheckpointNumber,
|
|
@@ -924,7 +1311,7 @@ export class ArchiverL1Synchronizer implements Traceable {
|
|
|
924
1311
|
}
|
|
925
1312
|
|
|
926
1313
|
private async getCheckpointHeader(number: CheckpointNumber) {
|
|
927
|
-
const checkpoint = await this.
|
|
1314
|
+
const checkpoint = await this.stores.blocks.getCheckpointData(number);
|
|
928
1315
|
if (!checkpoint) {
|
|
929
1316
|
return undefined;
|
|
930
1317
|
}
|