@aztec/world-state 0.0.1-commit.b655e406 → 0.0.1-commit.c7c42ec
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/index.d.ts +1 -1
- package/dest/instrumentation/instrumentation.d.ts +1 -1
- package/dest/instrumentation/instrumentation.d.ts.map +1 -1
- package/dest/native/bench_metrics.d.ts +1 -1
- package/dest/native/bench_metrics.d.ts.map +1 -1
- package/dest/native/fork_checkpoint.d.ts +1 -1
- package/dest/native/fork_checkpoint.d.ts.map +1 -1
- package/dest/native/index.d.ts +1 -1
- package/dest/native/merkle_trees_facade.d.ts +12 -6
- package/dest/native/merkle_trees_facade.d.ts.map +1 -1
- package/dest/native/merkle_trees_facade.js +25 -5
- 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/native/native_world_state_instance.d.ts +10 -1
- package/dest/native/native_world_state_instance.d.ts.map +1 -1
- package/dest/native/native_world_state_instance.js +21 -0
- package/dest/native/world_state_ops_queue.d.ts +1 -1
- package/dest/native/world_state_ops_queue.d.ts.map +1 -1
- package/dest/synchronizer/config.d.ts +1 -1
- package/dest/synchronizer/errors.d.ts +1 -1
- package/dest/synchronizer/errors.d.ts.map +1 -1
- package/dest/synchronizer/factory.d.ts +1 -1
- package/dest/synchronizer/index.d.ts +1 -1
- package/dest/synchronizer/server_world_state_synchronizer.d.ts +9 -25
- package/dest/synchronizer/server_world_state_synchronizer.d.ts.map +1 -1
- package/dest/synchronizer/server_world_state_synchronizer.js +34 -50
- package/dest/test/index.d.ts +1 -1
- package/dest/test/utils.d.ts +16 -9
- package/dest/test/utils.d.ts.map +1 -1
- package/dest/test/utils.js +56 -52
- 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/index.d.ts +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 -12
- package/src/native/merkle_trees_facade.ts +32 -7
- package/src/native/message.ts +23 -22
- package/src/native/native_world_state.ts +33 -21
- package/src/native/native_world_state_instance.ts +28 -0
- package/src/synchronizer/server_world_state_synchronizer.ts +60 -74
- package/src/test/utils.ts +89 -94
- package/src/testing.ts +1 -1
- package/src/world-state-db/merkle_tree_db.ts +13 -10
|
@@ -1,13 +1,11 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
3
|
-
import type { Fr } from '@aztec/foundation/fields';
|
|
1
|
+
import { BlockNumber } from '@aztec/foundation/branded-types';
|
|
2
|
+
import type { Fr } from '@aztec/foundation/curves/bn254';
|
|
4
3
|
import { type Logger, createLogger } from '@aztec/foundation/log';
|
|
5
4
|
import { promiseWithResolvers } from '@aztec/foundation/promise';
|
|
6
5
|
import { elapsed } from '@aztec/foundation/timer';
|
|
7
|
-
import { MerkleTreeCalculator } from '@aztec/foundation/trees';
|
|
8
6
|
import type {
|
|
9
|
-
L2Block,
|
|
10
7
|
L2BlockId,
|
|
8
|
+
L2BlockNew,
|
|
11
9
|
L2BlockSource,
|
|
12
10
|
L2BlockStream,
|
|
13
11
|
L2BlockStreamEvent,
|
|
@@ -45,17 +43,17 @@ export class ServerWorldStateSynchronizer
|
|
|
45
43
|
{
|
|
46
44
|
private readonly merkleTreeCommitted: MerkleTreeReadOperations;
|
|
47
45
|
|
|
48
|
-
private latestBlockNumberAtStart =
|
|
46
|
+
private latestBlockNumberAtStart = BlockNumber.ZERO;
|
|
49
47
|
private historyToKeep: number | undefined;
|
|
50
48
|
private currentState: WorldStateRunningState = WorldStateRunningState.IDLE;
|
|
51
|
-
private latestBlockHashQuery: { blockNumber:
|
|
49
|
+
private latestBlockHashQuery: { blockNumber: BlockNumber; hash: string | undefined } | undefined = undefined;
|
|
52
50
|
|
|
53
51
|
private syncPromise = promiseWithResolvers<void>();
|
|
54
52
|
protected blockStream: L2BlockStream | undefined;
|
|
55
53
|
|
|
56
54
|
// WorldState doesn't track the proven block number, it only tracks the latest tips of the pending chain and the finalized chain
|
|
57
55
|
// 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:
|
|
56
|
+
private provenBlockNumber: BlockNumber | undefined;
|
|
59
57
|
|
|
60
58
|
constructor(
|
|
61
59
|
private readonly merkleTreeDb: MerkleTreeAdminDatabase,
|
|
@@ -77,12 +75,12 @@ export class ServerWorldStateSynchronizer
|
|
|
77
75
|
return this.merkleTreeDb.getCommitted();
|
|
78
76
|
}
|
|
79
77
|
|
|
80
|
-
public getSnapshot(blockNumber:
|
|
78
|
+
public getSnapshot(blockNumber: BlockNumber): MerkleTreeReadOperations {
|
|
81
79
|
return this.merkleTreeDb.getSnapshot(blockNumber);
|
|
82
80
|
}
|
|
83
81
|
|
|
84
|
-
public fork(blockNumber?: number): Promise<MerkleTreeWriteOperations> {
|
|
85
|
-
return this.merkleTreeDb.fork(blockNumber);
|
|
82
|
+
public fork(blockNumber?: BlockNumber, opts?: { closeDelayMs?: number }): Promise<MerkleTreeWriteOperations> {
|
|
83
|
+
return this.merkleTreeDb.fork(blockNumber, opts);
|
|
86
84
|
}
|
|
87
85
|
|
|
88
86
|
public backupTo(dstPath: string, compact?: boolean): Promise<Record<Exclude<SnapshotDataKeys, 'archiver'>, string>> {
|
|
@@ -102,9 +100,11 @@ export class ServerWorldStateSynchronizer
|
|
|
102
100
|
}
|
|
103
101
|
|
|
104
102
|
// Get the current latest block number
|
|
105
|
-
this.latestBlockNumberAtStart =
|
|
106
|
-
|
|
107
|
-
|
|
103
|
+
this.latestBlockNumberAtStart = BlockNumber(
|
|
104
|
+
await (this.config.worldStateProvenBlocksOnly
|
|
105
|
+
? this.l2BlockSource.getProvenBlockNumber()
|
|
106
|
+
: this.l2BlockSource.getBlockNumber()),
|
|
107
|
+
);
|
|
108
108
|
|
|
109
109
|
const blockToDownloadFrom = (await this.getLatestBlockNumber()) + 1;
|
|
110
110
|
|
|
@@ -147,10 +147,10 @@ export class ServerWorldStateSynchronizer
|
|
|
147
147
|
public async status(): Promise<WorldStateSynchronizerStatus> {
|
|
148
148
|
const summary = await this.merkleTreeDb.getStatusSummary();
|
|
149
149
|
const status: WorldStateSyncStatus = {
|
|
150
|
-
latestBlockNumber:
|
|
151
|
-
latestBlockHash: (await this.getL2BlockHash(
|
|
152
|
-
finalizedBlockNumber:
|
|
153
|
-
oldestHistoricBlockNumber:
|
|
150
|
+
latestBlockNumber: summary.unfinalizedBlockNumber,
|
|
151
|
+
latestBlockHash: (await this.getL2BlockHash(summary.unfinalizedBlockNumber)) ?? '',
|
|
152
|
+
finalizedBlockNumber: summary.finalizedBlockNumber,
|
|
153
|
+
oldestHistoricBlockNumber: summary.oldestHistoricalBlock,
|
|
154
154
|
treesAreSynched: summary.treesAreSynched,
|
|
155
155
|
};
|
|
156
156
|
return {
|
|
@@ -184,7 +184,10 @@ export class ServerWorldStateSynchronizer
|
|
|
184
184
|
* @param skipThrowIfTargetNotReached - Whether to skip throwing if the target block number is not reached.
|
|
185
185
|
* @returns A promise that resolves with the block number the world state was synced to
|
|
186
186
|
*/
|
|
187
|
-
public async syncImmediate(
|
|
187
|
+
public async syncImmediate(
|
|
188
|
+
targetBlockNumber?: BlockNumber,
|
|
189
|
+
skipThrowIfTargetNotReached?: boolean,
|
|
190
|
+
): Promise<BlockNumber> {
|
|
188
191
|
if (this.currentState !== WorldStateRunningState.RUNNING) {
|
|
189
192
|
throw new Error(`World State is not running. Unable to perform sync.`);
|
|
190
193
|
}
|
|
@@ -202,7 +205,7 @@ export class ServerWorldStateSynchronizer
|
|
|
202
205
|
|
|
203
206
|
// If the archiver is behind the target block, force an archiver sync
|
|
204
207
|
if (targetBlockNumber) {
|
|
205
|
-
const archiverLatestBlock = await this.l2BlockSource.getBlockNumber();
|
|
208
|
+
const archiverLatestBlock = BlockNumber(await this.l2BlockSource.getBlockNumber());
|
|
206
209
|
if (archiverLatestBlock < targetBlockNumber) {
|
|
207
210
|
this.log.debug(`Archiver is at ${archiverLatestBlock} behind target block ${targetBlockNumber}.`);
|
|
208
211
|
await this.l2BlockSource.syncImmediate();
|
|
@@ -232,8 +235,8 @@ export class ServerWorldStateSynchronizer
|
|
|
232
235
|
}
|
|
233
236
|
|
|
234
237
|
/** Returns the L2 block hash for a given number. Used by the L2BlockStream for detecting reorgs. */
|
|
235
|
-
public async getL2BlockHash(number:
|
|
236
|
-
if (number ===
|
|
238
|
+
public async getL2BlockHash(number: BlockNumber): Promise<string | undefined> {
|
|
239
|
+
if (number === BlockNumber.ZERO) {
|
|
237
240
|
return (await this.merkleTreeCommitted.getInitialHeader().hash()).toString();
|
|
238
241
|
}
|
|
239
242
|
if (this.latestBlockHashQuery?.hash === undefined || number !== this.latestBlockHashQuery.blockNumber) {
|
|
@@ -250,13 +253,13 @@ export class ServerWorldStateSynchronizer
|
|
|
250
253
|
/** Returns the latest L2 block number for each tip of the chain (latest, proven, finalized). */
|
|
251
254
|
public async getL2Tips(): Promise<L2Tips> {
|
|
252
255
|
const status = await this.merkleTreeDb.getStatusSummary();
|
|
253
|
-
const unfinalizedBlockHash = await this.getL2BlockHash(
|
|
254
|
-
const latestBlockId: L2BlockId = { number:
|
|
256
|
+
const unfinalizedBlockHash = await this.getL2BlockHash(status.unfinalizedBlockNumber);
|
|
257
|
+
const latestBlockId: L2BlockId = { number: status.unfinalizedBlockNumber, hash: unfinalizedBlockHash! };
|
|
255
258
|
|
|
256
259
|
return {
|
|
257
260
|
latest: latestBlockId,
|
|
258
|
-
finalized: { number:
|
|
259
|
-
proven: { number:
|
|
261
|
+
finalized: { number: status.finalizedBlockNumber, hash: '' },
|
|
262
|
+
proven: { number: this.provenBlockNumber ?? status.finalizedBlockNumber, hash: '' }, // TODO(palla/reorg): Using finalized as proven for now
|
|
260
263
|
};
|
|
261
264
|
}
|
|
262
265
|
|
|
@@ -264,7 +267,7 @@ export class ServerWorldStateSynchronizer
|
|
|
264
267
|
public async handleBlockStreamEvent(event: L2BlockStreamEvent): Promise<void> {
|
|
265
268
|
switch (event.type) {
|
|
266
269
|
case 'blocks-added':
|
|
267
|
-
await this.handleL2Blocks(event.blocks.map(b => b.block));
|
|
270
|
+
await this.handleL2Blocks(event.blocks.map(b => b.block.toL2Block()));
|
|
268
271
|
break;
|
|
269
272
|
case 'chain-pruned':
|
|
270
273
|
await this.handleChainPruned(event.block.number);
|
|
@@ -283,22 +286,32 @@ export class ServerWorldStateSynchronizer
|
|
|
283
286
|
* @param l2Blocks - The L2 blocks to handle.
|
|
284
287
|
* @returns Whether the block handled was produced by this same node.
|
|
285
288
|
*/
|
|
286
|
-
private async handleL2Blocks(l2Blocks:
|
|
289
|
+
private async handleL2Blocks(l2Blocks: L2BlockNew[]) {
|
|
287
290
|
this.log.trace(`Handling L2 blocks ${l2Blocks[0].number} to ${l2Blocks.at(-1)!.number}`);
|
|
288
291
|
|
|
289
|
-
|
|
290
|
-
const
|
|
291
|
-
|
|
292
|
+
// Fetch the L1->L2 messages for the first block in a checkpoint.
|
|
293
|
+
const messagesForBlocks = new Map<BlockNumber, Fr[]>();
|
|
294
|
+
await Promise.all(
|
|
295
|
+
l2Blocks
|
|
296
|
+
.filter(b => b.indexWithinCheckpoint === 0)
|
|
297
|
+
.map(async block => {
|
|
298
|
+
const l1ToL2Messages = await this.l2BlockSource.getL1ToL2Messages(block.checkpointNumber);
|
|
299
|
+
messagesForBlocks.set(block.number, l1ToL2Messages);
|
|
300
|
+
}),
|
|
301
|
+
);
|
|
292
302
|
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
303
|
+
let updateStatus: WorldStateStatusFull | undefined = undefined;
|
|
304
|
+
for (const block of l2Blocks) {
|
|
305
|
+
const [duration, result] = await elapsed(() =>
|
|
306
|
+
this.handleL2Block(block, messagesForBlocks.get(block.number) ?? []),
|
|
307
|
+
);
|
|
308
|
+
this.log.info(`World state updated with L2 block ${block.number}`, {
|
|
296
309
|
eventName: 'l2-block-handled',
|
|
297
310
|
duration,
|
|
298
|
-
unfinalizedBlockNumber: result.summary.unfinalizedBlockNumber,
|
|
299
|
-
finalizedBlockNumber: result.summary.finalizedBlockNumber,
|
|
300
|
-
oldestHistoricBlock: result.summary.oldestHistoricalBlock,
|
|
301
|
-
...
|
|
311
|
+
unfinalizedBlockNumber: BigInt(result.summary.unfinalizedBlockNumber),
|
|
312
|
+
finalizedBlockNumber: BigInt(result.summary.finalizedBlockNumber),
|
|
313
|
+
oldestHistoricBlock: BigInt(result.summary.oldestHistoricalBlock),
|
|
314
|
+
...block.getStats(),
|
|
302
315
|
} satisfies L2BlockHandledStats);
|
|
303
316
|
updateStatus = result;
|
|
304
317
|
}
|
|
@@ -314,14 +327,7 @@ export class ServerWorldStateSynchronizer
|
|
|
314
327
|
* @param l1ToL2Messages - The L1 to L2 messages for the block.
|
|
315
328
|
* @returns Whether the block handled was produced by this same node.
|
|
316
329
|
*/
|
|
317
|
-
private async handleL2Block(l2Block:
|
|
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.
|
|
330
|
+
private async handleL2Block(l2Block: L2BlockNew, l1ToL2Messages: Fr[]): Promise<WorldStateStatusFull> {
|
|
325
331
|
this.log.trace(`Pushing L2 block ${l2Block.number} to merkle tree db `, {
|
|
326
332
|
blockNumber: l2Block.number,
|
|
327
333
|
blockHash: await l2Block.hash().then(h => h.toString()),
|
|
@@ -337,30 +343,30 @@ export class ServerWorldStateSynchronizer
|
|
|
337
343
|
return result;
|
|
338
344
|
}
|
|
339
345
|
|
|
340
|
-
private async handleChainFinalized(blockNumber:
|
|
346
|
+
private async handleChainFinalized(blockNumber: BlockNumber) {
|
|
341
347
|
this.log.verbose(`Finalized chain is now at block ${blockNumber}`);
|
|
342
|
-
const summary = await this.merkleTreeDb.setFinalized(
|
|
348
|
+
const summary = await this.merkleTreeDb.setFinalized(blockNumber);
|
|
343
349
|
if (this.historyToKeep === undefined) {
|
|
344
350
|
return;
|
|
345
351
|
}
|
|
346
|
-
const newHistoricBlock = summary.finalizedBlockNumber -
|
|
352
|
+
const newHistoricBlock = summary.finalizedBlockNumber - this.historyToKeep + 1;
|
|
347
353
|
if (newHistoricBlock <= 1) {
|
|
348
354
|
return;
|
|
349
355
|
}
|
|
350
356
|
this.log.verbose(`Pruning historic blocks to ${newHistoricBlock}`);
|
|
351
|
-
const status = await this.merkleTreeDb.removeHistoricalBlocks(newHistoricBlock);
|
|
357
|
+
const status = await this.merkleTreeDb.removeHistoricalBlocks(BlockNumber(newHistoricBlock));
|
|
352
358
|
this.log.debug(`World state summary `, status.summary);
|
|
353
359
|
}
|
|
354
360
|
|
|
355
|
-
private handleChainProven(blockNumber:
|
|
356
|
-
this.provenBlockNumber =
|
|
361
|
+
private handleChainProven(blockNumber: BlockNumber) {
|
|
362
|
+
this.provenBlockNumber = blockNumber;
|
|
357
363
|
this.log.debug(`Proven chain is now at block ${blockNumber}`);
|
|
358
364
|
return Promise.resolve();
|
|
359
365
|
}
|
|
360
366
|
|
|
361
|
-
private async handleChainPruned(blockNumber:
|
|
367
|
+
private async handleChainPruned(blockNumber: BlockNumber) {
|
|
362
368
|
this.log.warn(`Chain pruned to block ${blockNumber}`);
|
|
363
|
-
const status = await this.merkleTreeDb.unwindBlocks(
|
|
369
|
+
const status = await this.merkleTreeDb.unwindBlocks(blockNumber);
|
|
364
370
|
this.latestBlockHashQuery = undefined;
|
|
365
371
|
this.provenBlockNumber = undefined;
|
|
366
372
|
this.instrumentation.updateWorldStateMetrics(status);
|
|
@@ -374,24 +380,4 @@ export class ServerWorldStateSynchronizer
|
|
|
374
380
|
this.currentState = newState;
|
|
375
381
|
this.log.debug(`Moved to state ${WorldStateRunningState[this.currentState]}`);
|
|
376
382
|
}
|
|
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
383
|
}
|
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 } from '@aztec/foundation/branded-types';
|
|
7
9
|
import { padArrayEnd } from '@aztec/foundation/collection';
|
|
8
|
-
import { Fr } from '@aztec/foundation/
|
|
9
|
-
import {
|
|
10
|
+
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
11
|
+
import { L2BlockNew } 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
|
|
|
19
|
-
export async function
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
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
|
-
}
|
|
23
|
+
export async function updateBlockState(block: L2BlockNew, 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]);
|
|
64
61
|
|
|
65
62
|
const state = await fork.getStateReference();
|
|
66
|
-
|
|
67
|
-
await fork.updateArchive(
|
|
63
|
+
block.header = BlockHeader.from({ ...block.header, state });
|
|
64
|
+
await fork.updateArchive(block.header);
|
|
68
65
|
|
|
69
66
|
const archiveState = await fork.getTreeInfo(MerkleTreeId.ARCHIVE);
|
|
70
67
|
|
|
71
|
-
|
|
68
|
+
block.archive = new AppendOnlyTreeSnapshot(Fr.fromBuffer(archiveState.root), Number(archiveState.size));
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
export async function mockBlock(
|
|
72
|
+
blockNum: BlockNumber,
|
|
73
|
+
size: number,
|
|
74
|
+
fork: MerkleTreeWriteOperations,
|
|
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,
|
|
78
|
+
) {
|
|
79
|
+
const block = await L2BlockNew.random(blockNum, {
|
|
80
|
+
indexWithinCheckpoint: isFirstBlockInCheckpoint ? 0 : 1,
|
|
81
|
+
txsPerBlock: size,
|
|
82
|
+
txOptions: { maxEffects },
|
|
83
|
+
});
|
|
84
|
+
const l1ToL2Messages = mockL1ToL2Messages(numL1ToL2Messages);
|
|
85
|
+
|
|
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:
|
|
80
|
-
const l2Block =
|
|
94
|
+
export async function mockEmptyBlock(blockNum: BlockNumber, fork: MerkleTreeWriteOperations) {
|
|
95
|
+
const l2Block = L2BlockNew.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 {
|
|
5
|
-
import type {
|
|
5
|
+
import type { L2BlockNew } 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,15 +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(block:
|
|
48
|
+
handleL2BlockAndMessages(block: L2BlockNew, l1ToL2Messages: Fr[]): Promise<WorldStateStatusFull>;
|
|
46
49
|
|
|
47
50
|
/**
|
|
48
51
|
* Gets a handle that allows reading the latest committed state
|
|
@@ -54,21 +57,21 @@ export interface MerkleTreeAdminDatabase extends ForkMerkleTreeOperations {
|
|
|
54
57
|
* @param toBlockNumber The block number of the new oldest historical block
|
|
55
58
|
* @returns The new WorldStateStatus
|
|
56
59
|
*/
|
|
57
|
-
removeHistoricalBlocks(toBlockNumber:
|
|
60
|
+
removeHistoricalBlocks(toBlockNumber: BlockNumber): Promise<WorldStateStatusFull>;
|
|
58
61
|
|
|
59
62
|
/**
|
|
60
63
|
* Removes all pending blocks down to but not including the given block number
|
|
61
64
|
* @param toBlockNumber The block number of the new tip of the pending chain,
|
|
62
65
|
* @returns The new WorldStateStatus
|
|
63
66
|
*/
|
|
64
|
-
unwindBlocks(toBlockNumber:
|
|
67
|
+
unwindBlocks(toBlockNumber: BlockNumber): Promise<WorldStateStatusFull>;
|
|
65
68
|
|
|
66
69
|
/**
|
|
67
70
|
* Advances the finalized block number to be the number provided
|
|
68
71
|
* @param toBlockNumber The block number that is now the tip of the finalized chain
|
|
69
72
|
* @returns The new WorldStateStatus
|
|
70
73
|
*/
|
|
71
|
-
setFinalized(toBlockNumber:
|
|
74
|
+
setFinalized(toBlockNumber: BlockNumber): Promise<WorldStateStatusSummary>;
|
|
72
75
|
|
|
73
76
|
/**
|
|
74
77
|
* Gets the current status summary of the database.
|