@aztec/world-state 0.0.1-commit.fce3e4f → 0.0.1-commit.fffb133c
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/dest/instrumentation/instrumentation.d.ts +1 -1
- package/dest/instrumentation/instrumentation.d.ts.map +1 -1
- package/dest/instrumentation/instrumentation.js +11 -42
- package/dest/native/merkle_trees_facade.d.ts +10 -4
- package/dest/native/merkle_trees_facade.d.ts.map +1 -1
- package/dest/native/merkle_trees_facade.js +37 -7
- package/dest/native/message.d.ts +12 -11
- package/dest/native/message.d.ts.map +1 -1
- package/dest/native/message.js +14 -13
- package/dest/native/native_world_state.d.ts +12 -9
- package/dest/native/native_world_state.d.ts.map +1 -1
- package/dest/native/native_world_state.js +14 -10
- package/dest/synchronizer/config.d.ts +1 -3
- package/dest/synchronizer/config.d.ts.map +1 -1
- package/dest/synchronizer/config.js +1 -6
- package/dest/synchronizer/server_world_state_synchronizer.d.ts +10 -16
- package/dest/synchronizer/server_world_state_synchronizer.d.ts.map +1 -1
- package/dest/synchronizer/server_world_state_synchronizer.js +79 -69
- package/dest/test/utils.d.ts +12 -5
- package/dest/test/utils.d.ts.map +1 -1
- package/dest/test/utils.js +54 -50
- package/dest/testing.d.ts +2 -2
- package/dest/testing.d.ts.map +1 -1
- package/dest/testing.js +1 -1
- package/dest/world-state-db/merkle_tree_db.d.ts +10 -11
- package/dest/world-state-db/merkle_tree_db.d.ts.map +1 -1
- package/package.json +13 -13
- package/src/instrumentation/instrumentation.ts +10 -42
- package/src/native/merkle_trees_facade.ts +39 -5
- package/src/native/message.ts +23 -22
- package/src/native/native_world_state.ts +35 -21
- package/src/synchronizer/config.ts +1 -14
- package/src/synchronizer/server_world_state_synchronizer.ts +94 -96
- package/src/test/utils.ts +86 -91
- package/src/testing.ts +1 -1
- package/src/world-state-db/merkle_tree_db.ts +13 -14
|
@@ -1,19 +1,19 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import type { Fr } from '@aztec/foundation/
|
|
1
|
+
import { GENESIS_BLOCK_HEADER_HASH, INITIAL_L2_BLOCK_NUM, INITIAL_L2_CHECKPOINT_NUM } from '@aztec/constants';
|
|
2
|
+
import { BlockNumber } from '@aztec/foundation/branded-types';
|
|
3
|
+
import type { Fr } from '@aztec/foundation/curves/bn254';
|
|
4
4
|
import { type Logger, createLogger } from '@aztec/foundation/log';
|
|
5
5
|
import { promiseWithResolvers } from '@aztec/foundation/promise';
|
|
6
6
|
import { elapsed } from '@aztec/foundation/timer';
|
|
7
|
-
import {
|
|
8
|
-
|
|
9
|
-
L2Block,
|
|
10
|
-
L2BlockId,
|
|
11
|
-
L2BlockSource,
|
|
7
|
+
import {
|
|
8
|
+
GENESIS_CHECKPOINT_HEADER_HASH,
|
|
9
|
+
type L2Block,
|
|
10
|
+
type L2BlockId,
|
|
11
|
+
type L2BlockSource,
|
|
12
12
|
L2BlockStream,
|
|
13
|
-
L2BlockStreamEvent,
|
|
14
|
-
L2BlockStreamEventHandler,
|
|
15
|
-
L2BlockStreamLocalDataProvider,
|
|
16
|
-
L2Tips,
|
|
13
|
+
type L2BlockStreamEvent,
|
|
14
|
+
type L2BlockStreamEventHandler,
|
|
15
|
+
type L2BlockStreamLocalDataProvider,
|
|
16
|
+
type L2Tips,
|
|
17
17
|
} from '@aztec/stdlib/block';
|
|
18
18
|
import {
|
|
19
19
|
WorldStateRunningState,
|
|
@@ -25,7 +25,7 @@ import type { L1ToL2MessageSource } from '@aztec/stdlib/messaging';
|
|
|
25
25
|
import type { SnapshotDataKeys } from '@aztec/stdlib/snapshots';
|
|
26
26
|
import type { L2BlockHandledStats } from '@aztec/stdlib/stats';
|
|
27
27
|
import { MerkleTreeId, type MerkleTreeReadOperations, type MerkleTreeWriteOperations } from '@aztec/stdlib/trees';
|
|
28
|
-
import {
|
|
28
|
+
import { getTelemetryClient } from '@aztec/telemetry-client';
|
|
29
29
|
|
|
30
30
|
import { WorldStateInstrumentation } from '../instrumentation/instrumentation.js';
|
|
31
31
|
import type { WorldStateStatusFull } from '../native/message.js';
|
|
@@ -45,17 +45,16 @@ export class ServerWorldStateSynchronizer
|
|
|
45
45
|
{
|
|
46
46
|
private readonly merkleTreeCommitted: MerkleTreeReadOperations;
|
|
47
47
|
|
|
48
|
-
private latestBlockNumberAtStart =
|
|
48
|
+
private latestBlockNumberAtStart = BlockNumber.ZERO;
|
|
49
49
|
private historyToKeep: number | undefined;
|
|
50
50
|
private currentState: WorldStateRunningState = WorldStateRunningState.IDLE;
|
|
51
|
-
private latestBlockHashQuery: { blockNumber: number; hash: string | undefined } | undefined = undefined;
|
|
52
51
|
|
|
53
52
|
private syncPromise = promiseWithResolvers<void>();
|
|
54
53
|
protected blockStream: L2BlockStream | undefined;
|
|
55
54
|
|
|
56
55
|
// WorldState doesn't track the proven block number, it only tracks the latest tips of the pending chain and the finalized chain
|
|
57
56
|
// store the proven block number here, in the synchronizer, so that we don't end up spamming the logs with 'chain-proved' events
|
|
58
|
-
private provenBlockNumber:
|
|
57
|
+
private provenBlockNumber: BlockNumber | undefined;
|
|
59
58
|
|
|
60
59
|
constructor(
|
|
61
60
|
private readonly merkleTreeDb: MerkleTreeAdminDatabase,
|
|
@@ -77,12 +76,12 @@ export class ServerWorldStateSynchronizer
|
|
|
77
76
|
return this.merkleTreeDb.getCommitted();
|
|
78
77
|
}
|
|
79
78
|
|
|
80
|
-
public getSnapshot(blockNumber:
|
|
79
|
+
public getSnapshot(blockNumber: BlockNumber): MerkleTreeReadOperations {
|
|
81
80
|
return this.merkleTreeDb.getSnapshot(blockNumber);
|
|
82
81
|
}
|
|
83
82
|
|
|
84
|
-
public fork(blockNumber?: number): Promise<MerkleTreeWriteOperations> {
|
|
85
|
-
return this.merkleTreeDb.fork(blockNumber);
|
|
83
|
+
public fork(blockNumber?: BlockNumber, opts?: { closeDelayMs?: number }): Promise<MerkleTreeWriteOperations> {
|
|
84
|
+
return this.merkleTreeDb.fork(blockNumber, opts);
|
|
86
85
|
}
|
|
87
86
|
|
|
88
87
|
public backupTo(dstPath: string, compact?: boolean): Promise<Record<Exclude<SnapshotDataKeys, 'archiver'>, string>> {
|
|
@@ -102,9 +101,7 @@ export class ServerWorldStateSynchronizer
|
|
|
102
101
|
}
|
|
103
102
|
|
|
104
103
|
// Get the current latest block number
|
|
105
|
-
this.latestBlockNumberAtStart = await
|
|
106
|
-
? this.l2BlockSource.getProvenBlockNumber()
|
|
107
|
-
: this.l2BlockSource.getBlockNumber());
|
|
104
|
+
this.latestBlockNumberAtStart = BlockNumber(await this.l2BlockSource.getBlockNumber());
|
|
108
105
|
|
|
109
106
|
const blockToDownloadFrom = (await this.getLatestBlockNumber()) + 1;
|
|
110
107
|
|
|
@@ -126,12 +123,11 @@ export class ServerWorldStateSynchronizer
|
|
|
126
123
|
}
|
|
127
124
|
|
|
128
125
|
protected createBlockStream(): L2BlockStream {
|
|
129
|
-
const tracer = this.instrumentation.telemetry.getTracer('WorldStateL2BlockStream');
|
|
130
126
|
const logger = createLogger('world-state:block_stream');
|
|
131
|
-
return new
|
|
132
|
-
proven: this.config.worldStateProvenBlocksOnly,
|
|
127
|
+
return new L2BlockStream(this.l2BlockSource, this, this, logger, {
|
|
133
128
|
pollIntervalMS: this.config.worldStateBlockCheckIntervalMS,
|
|
134
129
|
batchSize: this.config.worldStateBlockRequestBatchSize,
|
|
130
|
+
ignoreCheckpoints: true,
|
|
135
131
|
});
|
|
136
132
|
}
|
|
137
133
|
|
|
@@ -147,10 +143,10 @@ export class ServerWorldStateSynchronizer
|
|
|
147
143
|
public async status(): Promise<WorldStateSynchronizerStatus> {
|
|
148
144
|
const summary = await this.merkleTreeDb.getStatusSummary();
|
|
149
145
|
const status: WorldStateSyncStatus = {
|
|
150
|
-
latestBlockNumber:
|
|
151
|
-
latestBlockHash: (await this.getL2BlockHash(
|
|
152
|
-
finalizedBlockNumber:
|
|
153
|
-
oldestHistoricBlockNumber:
|
|
146
|
+
latestBlockNumber: summary.unfinalizedBlockNumber,
|
|
147
|
+
latestBlockHash: (await this.getL2BlockHash(summary.unfinalizedBlockNumber)) ?? '',
|
|
148
|
+
finalizedBlockNumber: summary.finalizedBlockNumber,
|
|
149
|
+
oldestHistoricBlockNumber: summary.oldestHistoricalBlock,
|
|
154
150
|
treesAreSynched: summary.treesAreSynched,
|
|
155
151
|
};
|
|
156
152
|
return {
|
|
@@ -160,7 +156,7 @@ export class ServerWorldStateSynchronizer
|
|
|
160
156
|
}
|
|
161
157
|
|
|
162
158
|
public async getLatestBlockNumber() {
|
|
163
|
-
return (await this.getL2Tips()).
|
|
159
|
+
return (await this.getL2Tips()).proposed.number;
|
|
164
160
|
}
|
|
165
161
|
|
|
166
162
|
public async stopSync() {
|
|
@@ -184,7 +180,10 @@ export class ServerWorldStateSynchronizer
|
|
|
184
180
|
* @param skipThrowIfTargetNotReached - Whether to skip throwing if the target block number is not reached.
|
|
185
181
|
* @returns A promise that resolves with the block number the world state was synced to
|
|
186
182
|
*/
|
|
187
|
-
public async syncImmediate(
|
|
183
|
+
public async syncImmediate(
|
|
184
|
+
targetBlockNumber?: BlockNumber,
|
|
185
|
+
skipThrowIfTargetNotReached?: boolean,
|
|
186
|
+
): Promise<BlockNumber> {
|
|
188
187
|
if (this.currentState !== WorldStateRunningState.RUNNING) {
|
|
189
188
|
throw new Error(`World State is not running. Unable to perform sync.`);
|
|
190
189
|
}
|
|
@@ -202,7 +201,7 @@ export class ServerWorldStateSynchronizer
|
|
|
202
201
|
|
|
203
202
|
// If the archiver is behind the target block, force an archiver sync
|
|
204
203
|
if (targetBlockNumber) {
|
|
205
|
-
const archiverLatestBlock = await this.l2BlockSource.getBlockNumber();
|
|
204
|
+
const archiverLatestBlock = BlockNumber(await this.l2BlockSource.getBlockNumber());
|
|
206
205
|
if (archiverLatestBlock < targetBlockNumber) {
|
|
207
206
|
this.log.debug(`Archiver is at ${archiverLatestBlock} behind target block ${targetBlockNumber}.`);
|
|
208
207
|
await this.l2BlockSource.syncImmediate();
|
|
@@ -232,31 +231,48 @@ export class ServerWorldStateSynchronizer
|
|
|
232
231
|
}
|
|
233
232
|
|
|
234
233
|
/** Returns the L2 block hash for a given number. Used by the L2BlockStream for detecting reorgs. */
|
|
235
|
-
public async getL2BlockHash(number:
|
|
236
|
-
if (number ===
|
|
234
|
+
public async getL2BlockHash(number: BlockNumber): Promise<string | undefined> {
|
|
235
|
+
if (number === BlockNumber.ZERO) {
|
|
237
236
|
return (await this.merkleTreeCommitted.getInitialHeader().hash()).toString();
|
|
238
237
|
}
|
|
239
|
-
|
|
240
|
-
this.latestBlockHashQuery = {
|
|
241
|
-
hash: await this.merkleTreeCommitted
|
|
242
|
-
.getLeafValue(MerkleTreeId.ARCHIVE, BigInt(number))
|
|
243
|
-
.then(leaf => leaf?.toString()),
|
|
244
|
-
blockNumber: number,
|
|
245
|
-
};
|
|
246
|
-
}
|
|
247
|
-
return this.latestBlockHashQuery.hash;
|
|
238
|
+
return this.merkleTreeCommitted.getLeafValue(MerkleTreeId.ARCHIVE, BigInt(number)).then(leaf => leaf?.toString());
|
|
248
239
|
}
|
|
249
240
|
|
|
250
241
|
/** Returns the latest L2 block number for each tip of the chain (latest, proven, finalized). */
|
|
251
242
|
public async getL2Tips(): Promise<L2Tips> {
|
|
252
243
|
const status = await this.merkleTreeDb.getStatusSummary();
|
|
253
|
-
const
|
|
254
|
-
const
|
|
255
|
-
|
|
244
|
+
const unfinalizedBlockHashPromise = this.getL2BlockHash(status.unfinalizedBlockNumber);
|
|
245
|
+
const finalizedBlockHashPromise = this.getL2BlockHash(status.finalizedBlockNumber);
|
|
246
|
+
|
|
247
|
+
const provenBlockNumber = this.provenBlockNumber ?? status.finalizedBlockNumber;
|
|
248
|
+
const provenBlockHashPromise =
|
|
249
|
+
this.provenBlockNumber === undefined ? finalizedBlockHashPromise : this.getL2BlockHash(this.provenBlockNumber);
|
|
250
|
+
|
|
251
|
+
const [unfinalizedBlockHash, finalizedBlockHash, provenBlockHash] = await Promise.all([
|
|
252
|
+
unfinalizedBlockHashPromise,
|
|
253
|
+
finalizedBlockHashPromise,
|
|
254
|
+
provenBlockHashPromise,
|
|
255
|
+
]);
|
|
256
|
+
const latestBlockId: L2BlockId = { number: status.unfinalizedBlockNumber, hash: unfinalizedBlockHash! };
|
|
257
|
+
|
|
258
|
+
// World state doesn't track checkpointed blocks or checkpoints themselves.
|
|
259
|
+
// but we use a block stream so we need to provide 'local' L2Tips.
|
|
260
|
+
// We configure the block stream to ignore checkpoints and set checkpoint values to genesis here.
|
|
261
|
+
const genesisCheckpointHeaderHash = GENESIS_CHECKPOINT_HEADER_HASH.toString();
|
|
256
262
|
return {
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
263
|
+
proposed: latestBlockId,
|
|
264
|
+
checkpointed: {
|
|
265
|
+
block: { number: INITIAL_L2_BLOCK_NUM, hash: GENESIS_BLOCK_HEADER_HASH.toString() },
|
|
266
|
+
checkpoint: { number: INITIAL_L2_CHECKPOINT_NUM, hash: genesisCheckpointHeaderHash },
|
|
267
|
+
},
|
|
268
|
+
finalized: {
|
|
269
|
+
block: { number: status.finalizedBlockNumber, hash: finalizedBlockHash ?? '' },
|
|
270
|
+
checkpoint: { number: INITIAL_L2_CHECKPOINT_NUM, hash: genesisCheckpointHeaderHash },
|
|
271
|
+
},
|
|
272
|
+
proven: {
|
|
273
|
+
block: { number: provenBlockNumber, hash: provenBlockHash ?? '' },
|
|
274
|
+
checkpoint: { number: INITIAL_L2_CHECKPOINT_NUM, hash: genesisCheckpointHeaderHash },
|
|
275
|
+
},
|
|
260
276
|
};
|
|
261
277
|
}
|
|
262
278
|
|
|
@@ -264,7 +280,7 @@ export class ServerWorldStateSynchronizer
|
|
|
264
280
|
public async handleBlockStreamEvent(event: L2BlockStreamEvent): Promise<void> {
|
|
265
281
|
switch (event.type) {
|
|
266
282
|
case 'blocks-added':
|
|
267
|
-
await this.handleL2Blocks(event.blocks
|
|
283
|
+
await this.handleL2Blocks(event.blocks);
|
|
268
284
|
break;
|
|
269
285
|
case 'chain-pruned':
|
|
270
286
|
await this.handleChainPruned(event.block.number);
|
|
@@ -286,19 +302,29 @@ export class ServerWorldStateSynchronizer
|
|
|
286
302
|
private async handleL2Blocks(l2Blocks: L2Block[]) {
|
|
287
303
|
this.log.trace(`Handling L2 blocks ${l2Blocks[0].number} to ${l2Blocks.at(-1)!.number}`);
|
|
288
304
|
|
|
289
|
-
|
|
290
|
-
const
|
|
291
|
-
|
|
305
|
+
// Fetch the L1->L2 messages for the first block in a checkpoint.
|
|
306
|
+
const messagesForBlocks = new Map<BlockNumber, Fr[]>();
|
|
307
|
+
await Promise.all(
|
|
308
|
+
l2Blocks
|
|
309
|
+
.filter(b => b.indexWithinCheckpoint === 0)
|
|
310
|
+
.map(async block => {
|
|
311
|
+
const l1ToL2Messages = await this.l2BlockSource.getL1ToL2Messages(block.checkpointNumber);
|
|
312
|
+
messagesForBlocks.set(block.number, l1ToL2Messages);
|
|
313
|
+
}),
|
|
314
|
+
);
|
|
292
315
|
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
316
|
+
let updateStatus: WorldStateStatusFull | undefined = undefined;
|
|
317
|
+
for (const block of l2Blocks) {
|
|
318
|
+
const [duration, result] = await elapsed(() =>
|
|
319
|
+
this.handleL2Block(block, messagesForBlocks.get(block.number) ?? []),
|
|
320
|
+
);
|
|
321
|
+
this.log.info(`World state updated with L2 block ${block.number}`, {
|
|
296
322
|
eventName: 'l2-block-handled',
|
|
297
323
|
duration,
|
|
298
|
-
unfinalizedBlockNumber: result.summary.unfinalizedBlockNumber,
|
|
299
|
-
finalizedBlockNumber: result.summary.finalizedBlockNumber,
|
|
300
|
-
oldestHistoricBlock: result.summary.oldestHistoricalBlock,
|
|
301
|
-
...
|
|
324
|
+
unfinalizedBlockNumber: BigInt(result.summary.unfinalizedBlockNumber),
|
|
325
|
+
finalizedBlockNumber: BigInt(result.summary.finalizedBlockNumber),
|
|
326
|
+
oldestHistoricBlock: BigInt(result.summary.oldestHistoricalBlock),
|
|
327
|
+
...block.getStats(),
|
|
302
328
|
} satisfies L2BlockHandledStats);
|
|
303
329
|
updateStatus = result;
|
|
304
330
|
}
|
|
@@ -315,13 +341,6 @@ export class ServerWorldStateSynchronizer
|
|
|
315
341
|
* @returns Whether the block handled was produced by this same node.
|
|
316
342
|
*/
|
|
317
343
|
private async handleL2Block(l2Block: L2Block, l1ToL2Messages: Fr[]): Promise<WorldStateStatusFull> {
|
|
318
|
-
// First we check that the L1 to L2 messages hash to the block inHash.
|
|
319
|
-
// Note that we cannot optimize this check by checking the root of the subtree after inserting the messages
|
|
320
|
-
// to the real L1_TO_L2_MESSAGE_TREE (like we do in merkleTreeDb.handleL2BlockAndMessages(...)) because that
|
|
321
|
-
// tree uses pedersen and we don't have access to the converted root.
|
|
322
|
-
await this.verifyMessagesHashToInHash(l1ToL2Messages, l2Block.header.contentCommitment.inHash);
|
|
323
|
-
|
|
324
|
-
// If the above check succeeds, we can proceed to handle the block.
|
|
325
344
|
this.log.trace(`Pushing L2 block ${l2Block.number} to merkle tree db `, {
|
|
326
345
|
blockNumber: l2Block.number,
|
|
327
346
|
blockHash: await l2Block.hash().then(h => h.toString()),
|
|
@@ -337,31 +356,30 @@ export class ServerWorldStateSynchronizer
|
|
|
337
356
|
return result;
|
|
338
357
|
}
|
|
339
358
|
|
|
340
|
-
private async handleChainFinalized(blockNumber:
|
|
359
|
+
private async handleChainFinalized(blockNumber: BlockNumber) {
|
|
341
360
|
this.log.verbose(`Finalized chain is now at block ${blockNumber}`);
|
|
342
|
-
const summary = await this.merkleTreeDb.setFinalized(
|
|
361
|
+
const summary = await this.merkleTreeDb.setFinalized(blockNumber);
|
|
343
362
|
if (this.historyToKeep === undefined) {
|
|
344
363
|
return;
|
|
345
364
|
}
|
|
346
|
-
const newHistoricBlock = summary.finalizedBlockNumber -
|
|
365
|
+
const newHistoricBlock = summary.finalizedBlockNumber - this.historyToKeep + 1;
|
|
347
366
|
if (newHistoricBlock <= 1) {
|
|
348
367
|
return;
|
|
349
368
|
}
|
|
350
369
|
this.log.verbose(`Pruning historic blocks to ${newHistoricBlock}`);
|
|
351
|
-
const status = await this.merkleTreeDb.removeHistoricalBlocks(newHistoricBlock);
|
|
370
|
+
const status = await this.merkleTreeDb.removeHistoricalBlocks(BlockNumber(newHistoricBlock));
|
|
352
371
|
this.log.debug(`World state summary `, status.summary);
|
|
353
372
|
}
|
|
354
373
|
|
|
355
|
-
private handleChainProven(blockNumber:
|
|
356
|
-
this.provenBlockNumber =
|
|
374
|
+
private handleChainProven(blockNumber: BlockNumber) {
|
|
375
|
+
this.provenBlockNumber = blockNumber;
|
|
357
376
|
this.log.debug(`Proven chain is now at block ${blockNumber}`);
|
|
358
377
|
return Promise.resolve();
|
|
359
378
|
}
|
|
360
379
|
|
|
361
|
-
private async handleChainPruned(blockNumber:
|
|
380
|
+
private async handleChainPruned(blockNumber: BlockNumber) {
|
|
362
381
|
this.log.warn(`Chain pruned to block ${blockNumber}`);
|
|
363
|
-
const status = await this.merkleTreeDb.unwindBlocks(
|
|
364
|
-
this.latestBlockHashQuery = undefined;
|
|
382
|
+
const status = await this.merkleTreeDb.unwindBlocks(blockNumber);
|
|
365
383
|
this.provenBlockNumber = undefined;
|
|
366
384
|
this.instrumentation.updateWorldStateMetrics(status);
|
|
367
385
|
}
|
|
@@ -374,24 +392,4 @@ export class ServerWorldStateSynchronizer
|
|
|
374
392
|
this.currentState = newState;
|
|
375
393
|
this.log.debug(`Moved to state ${WorldStateRunningState[this.currentState]}`);
|
|
376
394
|
}
|
|
377
|
-
|
|
378
|
-
/**
|
|
379
|
-
* Verifies that the L1 to L2 messages hash to the block inHash.
|
|
380
|
-
* @param l1ToL2Messages - The L1 to L2 messages for the block.
|
|
381
|
-
* @param inHash - The inHash of the block.
|
|
382
|
-
* @throws If the L1 to L2 messages do not hash to the block inHash.
|
|
383
|
-
*/
|
|
384
|
-
protected async verifyMessagesHashToInHash(l1ToL2Messages: Fr[], inHash: Fr) {
|
|
385
|
-
const treeCalculator = await MerkleTreeCalculator.create(
|
|
386
|
-
L1_TO_L2_MSG_SUBTREE_HEIGHT,
|
|
387
|
-
Buffer.alloc(32),
|
|
388
|
-
(lhs, rhs) => Promise.resolve(new SHA256Trunc().hash(lhs, rhs)),
|
|
389
|
-
);
|
|
390
|
-
|
|
391
|
-
const root = await treeCalculator.computeTreeRoot(l1ToL2Messages.map(msg => msg.toBuffer()));
|
|
392
|
-
|
|
393
|
-
if (!root.equals(inHash.toBuffer())) {
|
|
394
|
-
throw new Error('Obtained L1 to L2 messages failed to be hashed to the block inHash');
|
|
395
|
-
}
|
|
396
|
-
}
|
|
397
395
|
}
|
package/src/test/utils.ts
CHANGED
|
@@ -4,122 +4,100 @@ import {
|
|
|
4
4
|
NULLIFIER_SUBTREE_HEIGHT,
|
|
5
5
|
NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP,
|
|
6
6
|
} from '@aztec/constants';
|
|
7
|
+
import { asyncMap } from '@aztec/foundation/async-map';
|
|
8
|
+
import { BlockNumber, type CheckpointNumber, IndexWithinCheckpoint } from '@aztec/foundation/branded-types';
|
|
7
9
|
import { padArrayEnd } from '@aztec/foundation/collection';
|
|
8
|
-
import { Fr } from '@aztec/foundation/
|
|
10
|
+
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
9
11
|
import { L2Block } from '@aztec/stdlib/block';
|
|
10
12
|
import type {
|
|
11
13
|
IndexedTreeId,
|
|
12
14
|
MerkleTreeReadOperations,
|
|
13
15
|
MerkleTreeWriteOperations,
|
|
14
16
|
} from '@aztec/stdlib/interfaces/server';
|
|
17
|
+
import { mockCheckpointAndMessages, mockL1ToL2Messages } from '@aztec/stdlib/testing';
|
|
15
18
|
import { AppendOnlyTreeSnapshot, MerkleTreeId } from '@aztec/stdlib/trees';
|
|
19
|
+
import { BlockHeader } from '@aztec/stdlib/tx';
|
|
16
20
|
|
|
17
21
|
import type { NativeWorldStateService } from '../native/native_world_state.js';
|
|
18
22
|
|
|
23
|
+
export async function updateBlockState(block: L2Block, l1ToL2Messages: Fr[], fork: MerkleTreeWriteOperations) {
|
|
24
|
+
const insertData = async (
|
|
25
|
+
treeId: IndexedTreeId,
|
|
26
|
+
data: Buffer[][],
|
|
27
|
+
subTreeHeight: number,
|
|
28
|
+
fork: MerkleTreeWriteOperations,
|
|
29
|
+
) => {
|
|
30
|
+
for (const dataBatch of data) {
|
|
31
|
+
await fork.batchInsert(treeId, dataBatch, subTreeHeight);
|
|
32
|
+
}
|
|
33
|
+
};
|
|
34
|
+
|
|
35
|
+
const publicDataInsert = insertData(
|
|
36
|
+
MerkleTreeId.PUBLIC_DATA_TREE,
|
|
37
|
+
block.body.txEffects.map(txEffect => txEffect.publicDataWrites.map(write => write.toBuffer())),
|
|
38
|
+
0,
|
|
39
|
+
fork,
|
|
40
|
+
);
|
|
41
|
+
const nullifierInsert = insertData(
|
|
42
|
+
MerkleTreeId.NULLIFIER_TREE,
|
|
43
|
+
block.body.txEffects.map(txEffect =>
|
|
44
|
+
padArrayEnd(txEffect.nullifiers, Fr.ZERO, MAX_NULLIFIERS_PER_TX).map(nullifier => nullifier.toBuffer()),
|
|
45
|
+
),
|
|
46
|
+
NULLIFIER_SUBTREE_HEIGHT,
|
|
47
|
+
fork,
|
|
48
|
+
);
|
|
49
|
+
const noteHashesPadded = block.body.txEffects.flatMap(txEffect =>
|
|
50
|
+
padArrayEnd(txEffect.noteHashes, Fr.ZERO, MAX_NOTE_HASHES_PER_TX),
|
|
51
|
+
);
|
|
52
|
+
|
|
53
|
+
const l1ToL2MessagesPadded =
|
|
54
|
+
block.indexWithinCheckpoint === 0
|
|
55
|
+
? padArrayEnd<Fr, number>(l1ToL2Messages, Fr.ZERO, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP)
|
|
56
|
+
: l1ToL2Messages;
|
|
57
|
+
|
|
58
|
+
const noteHashInsert = fork.appendLeaves(MerkleTreeId.NOTE_HASH_TREE, noteHashesPadded);
|
|
59
|
+
const messageInsert = fork.appendLeaves(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, l1ToL2MessagesPadded);
|
|
60
|
+
await Promise.all([publicDataInsert, nullifierInsert, noteHashInsert, messageInsert]);
|
|
61
|
+
|
|
62
|
+
const state = await fork.getStateReference();
|
|
63
|
+
block.header = BlockHeader.from({ ...block.header, state });
|
|
64
|
+
await fork.updateArchive(block.header);
|
|
65
|
+
|
|
66
|
+
const archiveState = await fork.getTreeInfo(MerkleTreeId.ARCHIVE);
|
|
67
|
+
|
|
68
|
+
block.archive = new AppendOnlyTreeSnapshot(Fr.fromBuffer(archiveState.root), Number(archiveState.size));
|
|
69
|
+
}
|
|
70
|
+
|
|
19
71
|
export async function mockBlock(
|
|
20
|
-
blockNum:
|
|
72
|
+
blockNum: BlockNumber,
|
|
21
73
|
size: number,
|
|
22
74
|
fork: MerkleTreeWriteOperations,
|
|
23
75
|
maxEffects: number | undefined = 1000, // Defaults to the maximum tx effects.
|
|
76
|
+
numL1ToL2Messages: number = NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP,
|
|
77
|
+
isFirstBlockInCheckpoint: boolean = true,
|
|
24
78
|
) {
|
|
25
|
-
const
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
data: Buffer[][],
|
|
32
|
-
subTreeHeight: number,
|
|
33
|
-
fork: MerkleTreeWriteOperations,
|
|
34
|
-
) => {
|
|
35
|
-
for (const dataBatch of data) {
|
|
36
|
-
await fork.batchInsert(treeId, dataBatch, subTreeHeight);
|
|
37
|
-
}
|
|
38
|
-
};
|
|
39
|
-
|
|
40
|
-
const publicDataInsert = insertData(
|
|
41
|
-
MerkleTreeId.PUBLIC_DATA_TREE,
|
|
42
|
-
l2Block.body.txEffects.map(txEffect => txEffect.publicDataWrites.map(write => write.toBuffer())),
|
|
43
|
-
0,
|
|
44
|
-
fork,
|
|
45
|
-
);
|
|
46
|
-
const nullifierInsert = insertData(
|
|
47
|
-
MerkleTreeId.NULLIFIER_TREE,
|
|
48
|
-
l2Block.body.txEffects.map(txEffect =>
|
|
49
|
-
padArrayEnd(txEffect.nullifiers, Fr.ZERO, MAX_NULLIFIERS_PER_TX).map(nullifier => nullifier.toBuffer()),
|
|
50
|
-
),
|
|
51
|
-
NULLIFIER_SUBTREE_HEIGHT,
|
|
52
|
-
fork,
|
|
53
|
-
);
|
|
54
|
-
const noteHashesPadded = l2Block.body.txEffects.flatMap(txEffect =>
|
|
55
|
-
padArrayEnd(txEffect.noteHashes, Fr.ZERO, MAX_NOTE_HASHES_PER_TX),
|
|
56
|
-
);
|
|
57
|
-
|
|
58
|
-
const l1ToL2MessagesPadded = padArrayEnd<Fr, number>(l1ToL2Messages, Fr.ZERO, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP);
|
|
59
|
-
|
|
60
|
-
const noteHashInsert = fork.appendLeaves(MerkleTreeId.NOTE_HASH_TREE, noteHashesPadded);
|
|
61
|
-
const messageInsert = fork.appendLeaves(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, l1ToL2MessagesPadded);
|
|
62
|
-
await Promise.all([publicDataInsert, nullifierInsert, noteHashInsert, messageInsert]);
|
|
63
|
-
}
|
|
64
|
-
|
|
65
|
-
const state = await fork.getStateReference();
|
|
66
|
-
l2Block.header.state = state;
|
|
67
|
-
await fork.updateArchive(l2Block.getBlockHeader());
|
|
68
|
-
|
|
69
|
-
const archiveState = await fork.getTreeInfo(MerkleTreeId.ARCHIVE);
|
|
79
|
+
const block = await L2Block.random(blockNum, {
|
|
80
|
+
indexWithinCheckpoint: isFirstBlockInCheckpoint ? IndexWithinCheckpoint(0) : IndexWithinCheckpoint(1),
|
|
81
|
+
txsPerBlock: size,
|
|
82
|
+
txOptions: { maxEffects },
|
|
83
|
+
});
|
|
84
|
+
const l1ToL2Messages = mockL1ToL2Messages(numL1ToL2Messages);
|
|
70
85
|
|
|
71
|
-
|
|
86
|
+
await updateBlockState(block, l1ToL2Messages, fork);
|
|
72
87
|
|
|
73
88
|
return {
|
|
74
|
-
block
|
|
89
|
+
block,
|
|
75
90
|
messages: l1ToL2Messages,
|
|
76
91
|
};
|
|
77
92
|
}
|
|
78
93
|
|
|
79
|
-
export async function mockEmptyBlock(blockNum:
|
|
94
|
+
export async function mockEmptyBlock(blockNum: BlockNumber, fork: MerkleTreeWriteOperations) {
|
|
80
95
|
const l2Block = L2Block.empty();
|
|
81
96
|
const l1ToL2Messages = Array(16).fill(0).map(Fr.zero);
|
|
82
97
|
|
|
83
98
|
l2Block.header.globalVariables.blockNumber = blockNum;
|
|
84
99
|
|
|
85
|
-
|
|
86
|
-
{
|
|
87
|
-
const noteHashesPadded = l2Block.body.txEffects.flatMap(txEffect =>
|
|
88
|
-
padArrayEnd(txEffect.noteHashes, Fr.ZERO, MAX_NOTE_HASHES_PER_TX),
|
|
89
|
-
);
|
|
90
|
-
await fork.appendLeaves(MerkleTreeId.NOTE_HASH_TREE, noteHashesPadded);
|
|
91
|
-
|
|
92
|
-
const l1ToL2MessagesPadded = padArrayEnd<Fr, number>(l1ToL2Messages, Fr.ZERO, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP);
|
|
93
|
-
await fork.appendLeaves(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, l1ToL2MessagesPadded);
|
|
94
|
-
}
|
|
95
|
-
|
|
96
|
-
// Sync the indexed trees
|
|
97
|
-
{
|
|
98
|
-
// We insert the public data tree leaves with one batch per tx to avoid updating the same key twice
|
|
99
|
-
for (const txEffect of l2Block.body.txEffects) {
|
|
100
|
-
await fork.batchInsert(
|
|
101
|
-
MerkleTreeId.PUBLIC_DATA_TREE,
|
|
102
|
-
txEffect.publicDataWrites.map(write => write.toBuffer()),
|
|
103
|
-
0,
|
|
104
|
-
);
|
|
105
|
-
|
|
106
|
-
const nullifiersPadded = padArrayEnd(txEffect.nullifiers, Fr.ZERO, MAX_NULLIFIERS_PER_TX);
|
|
107
|
-
|
|
108
|
-
await fork.batchInsert(
|
|
109
|
-
MerkleTreeId.NULLIFIER_TREE,
|
|
110
|
-
nullifiersPadded.map(nullifier => nullifier.toBuffer()),
|
|
111
|
-
NULLIFIER_SUBTREE_HEIGHT,
|
|
112
|
-
);
|
|
113
|
-
}
|
|
114
|
-
}
|
|
115
|
-
|
|
116
|
-
const state = await fork.getStateReference();
|
|
117
|
-
l2Block.header.state = state;
|
|
118
|
-
await fork.updateArchive(l2Block.getBlockHeader());
|
|
119
|
-
|
|
120
|
-
const archiveState = await fork.getTreeInfo(MerkleTreeId.ARCHIVE);
|
|
121
|
-
|
|
122
|
-
l2Block.archive = new AppendOnlyTreeSnapshot(Fr.fromBuffer(archiveState.root), Number(archiveState.size));
|
|
100
|
+
await updateBlockState(l2Block, l1ToL2Messages, fork);
|
|
123
101
|
|
|
124
102
|
return {
|
|
125
103
|
block: l2Block,
|
|
@@ -127,13 +105,18 @@ export async function mockEmptyBlock(blockNum: number, fork: MerkleTreeWriteOper
|
|
|
127
105
|
};
|
|
128
106
|
}
|
|
129
107
|
|
|
130
|
-
export async function mockBlocks(
|
|
131
|
-
|
|
108
|
+
export async function mockBlocks(
|
|
109
|
+
from: BlockNumber,
|
|
110
|
+
count: number,
|
|
111
|
+
numTxs: number,
|
|
112
|
+
worldState: NativeWorldStateService,
|
|
113
|
+
) {
|
|
114
|
+
const tempFork = await worldState.fork(BlockNumber(from - 1));
|
|
132
115
|
|
|
133
116
|
const blocks = [];
|
|
134
117
|
const messagesArray = [];
|
|
135
118
|
for (let blockNumber = from; blockNumber < from + count; blockNumber++) {
|
|
136
|
-
const { block, messages } = await mockBlock(blockNumber, numTxs, tempFork);
|
|
119
|
+
const { block, messages } = await mockBlock(BlockNumber(blockNumber), numTxs, tempFork);
|
|
137
120
|
blocks.push(block);
|
|
138
121
|
messagesArray.push(messages);
|
|
139
122
|
}
|
|
@@ -143,6 +126,18 @@ export async function mockBlocks(from: number, count: number, numTxs: number, wo
|
|
|
143
126
|
return { blocks, messages: messagesArray };
|
|
144
127
|
}
|
|
145
128
|
|
|
129
|
+
export async function mockCheckpoint(
|
|
130
|
+
checkpointNumber: CheckpointNumber,
|
|
131
|
+
fork: MerkleTreeWriteOperations,
|
|
132
|
+
options: Partial<Parameters<typeof mockCheckpointAndMessages>[1]> = {},
|
|
133
|
+
) {
|
|
134
|
+
const { checkpoint, messages } = await mockCheckpointAndMessages(checkpointNumber, options);
|
|
135
|
+
await asyncMap(checkpoint.blocks, async (block, i) => {
|
|
136
|
+
await updateBlockState(block, i === 0 ? messages : [], fork);
|
|
137
|
+
});
|
|
138
|
+
return { checkpoint, messages };
|
|
139
|
+
}
|
|
140
|
+
|
|
146
141
|
export async function assertSameState(forkA: MerkleTreeReadOperations, forkB: MerkleTreeReadOperations) {
|
|
147
142
|
const nativeStateRef = await forkA.getStateReference();
|
|
148
143
|
const nativeArchive = await forkA.getTreeInfo(MerkleTreeId.ARCHIVE);
|
package/src/testing.ts
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { GENESIS_ARCHIVE_ROOT } from '@aztec/constants';
|
|
2
|
-
import { Fr } from '@aztec/foundation/
|
|
2
|
+
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
3
3
|
import { computeFeePayerBalanceLeafSlot } from '@aztec/protocol-contracts/fee-juice';
|
|
4
4
|
import type { AztecAddress } from '@aztec/stdlib/aztec-address';
|
|
5
5
|
import { MerkleTreeId, PublicDataTreeLeaf } from '@aztec/stdlib/trees';
|
|
@@ -1,8 +1,13 @@
|
|
|
1
1
|
import { MAX_NULLIFIERS_PER_TX, MAX_TOTAL_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX } from '@aztec/constants';
|
|
2
|
-
import type {
|
|
2
|
+
import type { BlockNumber } from '@aztec/foundation/branded-types';
|
|
3
|
+
import type { Fr } from '@aztec/foundation/curves/bn254';
|
|
3
4
|
import type { IndexedTreeSnapshot, TreeSnapshot } from '@aztec/merkle-tree';
|
|
4
|
-
import type { L2Block
|
|
5
|
-
import type {
|
|
5
|
+
import type { L2Block } from '@aztec/stdlib/block';
|
|
6
|
+
import type {
|
|
7
|
+
ForkMerkleTreeOperations,
|
|
8
|
+
MerkleTreeReadOperations,
|
|
9
|
+
ReadonlyWorldStateAccess,
|
|
10
|
+
} from '@aztec/stdlib/interfaces/server';
|
|
6
11
|
import type { MerkleTreeId } from '@aztec/stdlib/trees';
|
|
7
12
|
|
|
8
13
|
import type { WorldStateStatusFull, WorldStateStatusSummary } from '../native/message.js';
|
|
@@ -34,19 +39,13 @@ export type TreeSnapshots = {
|
|
|
34
39
|
[MerkleTreeId.ARCHIVE]: TreeSnapshot<Fr>;
|
|
35
40
|
};
|
|
36
41
|
|
|
37
|
-
export interface MerkleTreeAdminDatabase extends ForkMerkleTreeOperations {
|
|
42
|
+
export interface MerkleTreeAdminDatabase extends ForkMerkleTreeOperations, ReadonlyWorldStateAccess {
|
|
38
43
|
/**
|
|
39
44
|
* Handles a single L2 block (i.e. Inserts the new note hashes into the merkle tree).
|
|
40
45
|
* @param block - The L2 block to handle.
|
|
41
46
|
* @param l1ToL2Messages - The L1 to L2 messages for the block.
|
|
42
|
-
* @param isFirstBlock - Whether the block is the first block in a checkpoint. Temporary hack to only insert l1 to l2
|
|
43
|
-
* messages for the first block in a checkpoint. TODO(#17027) Remove this.
|
|
44
47
|
*/
|
|
45
|
-
handleL2BlockAndMessages(
|
|
46
|
-
block: L2Block | L2BlockNew,
|
|
47
|
-
l1ToL2Messages: Fr[],
|
|
48
|
-
isFirstBlock?: boolean,
|
|
49
|
-
): Promise<WorldStateStatusFull>;
|
|
48
|
+
handleL2BlockAndMessages(block: L2Block, l1ToL2Messages: Fr[]): Promise<WorldStateStatusFull>;
|
|
50
49
|
|
|
51
50
|
/**
|
|
52
51
|
* Gets a handle that allows reading the latest committed state
|
|
@@ -58,21 +57,21 @@ export interface MerkleTreeAdminDatabase extends ForkMerkleTreeOperations {
|
|
|
58
57
|
* @param toBlockNumber The block number of the new oldest historical block
|
|
59
58
|
* @returns The new WorldStateStatus
|
|
60
59
|
*/
|
|
61
|
-
removeHistoricalBlocks(toBlockNumber:
|
|
60
|
+
removeHistoricalBlocks(toBlockNumber: BlockNumber): Promise<WorldStateStatusFull>;
|
|
62
61
|
|
|
63
62
|
/**
|
|
64
63
|
* Removes all pending blocks down to but not including the given block number
|
|
65
64
|
* @param toBlockNumber The block number of the new tip of the pending chain,
|
|
66
65
|
* @returns The new WorldStateStatus
|
|
67
66
|
*/
|
|
68
|
-
unwindBlocks(toBlockNumber:
|
|
67
|
+
unwindBlocks(toBlockNumber: BlockNumber): Promise<WorldStateStatusFull>;
|
|
69
68
|
|
|
70
69
|
/**
|
|
71
70
|
* Advances the finalized block number to be the number provided
|
|
72
71
|
* @param toBlockNumber The block number that is now the tip of the finalized chain
|
|
73
72
|
* @returns The new WorldStateStatus
|
|
74
73
|
*/
|
|
75
|
-
setFinalized(toBlockNumber:
|
|
74
|
+
setFinalized(toBlockNumber: BlockNumber): Promise<WorldStateStatusSummary>;
|
|
76
75
|
|
|
77
76
|
/**
|
|
78
77
|
* Gets the current status summary of the database.
|