@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,38 +1,39 @@
|
|
|
1
1
|
import { INITIAL_CHECKPOINT_NUMBER, INITIAL_L2_BLOCK_NUM } from '@aztec/constants';
|
|
2
|
-
import { BlockNumber, CheckpointNumber, IndexWithinCheckpoint } from '@aztec/foundation/branded-types';
|
|
2
|
+
import { BlockNumber, CheckpointNumber, IndexWithinCheckpoint, SlotNumber } from '@aztec/foundation/branded-types';
|
|
3
3
|
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
4
4
|
import { toArray } from '@aztec/foundation/iterable';
|
|
5
5
|
import { createLogger } from '@aztec/foundation/log';
|
|
6
6
|
import { BufferReader } from '@aztec/foundation/serialize';
|
|
7
7
|
import { bufferToHex } from '@aztec/foundation/string';
|
|
8
8
|
import { isDefined } from '@aztec/foundation/types';
|
|
9
|
-
import {
|
|
10
|
-
import { L1PublishedData } from '@aztec/stdlib/checkpoint';
|
|
9
|
+
import { BlockHash, Body, CommitteeAttestation, GENESIS_CHECKPOINT_HEADER_HASH, L2Block, deserializeValidateCheckpointResult, serializeValidateCheckpointResult } from '@aztec/stdlib/block';
|
|
10
|
+
import { Checkpoint, L1PublishedData } from '@aztec/stdlib/checkpoint';
|
|
11
11
|
import { CheckpointHeader } from '@aztec/stdlib/rollup';
|
|
12
12
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
13
|
-
import { BlockHeader, TxHash,
|
|
14
|
-
import { BlockArchiveNotConsistentError, BlockIndexNotSequentialError, BlockNotFoundError, BlockNumberNotSequentialError, CannotOverwriteCheckpointedBlockError, CheckpointNotFoundError,
|
|
15
|
-
export { TxReceipt } from '@aztec/stdlib/tx';
|
|
13
|
+
import { BlockHeader, TxHash, deserializeIndexedTxEffect, serializeIndexedTxEffect } from '@aztec/stdlib/tx';
|
|
14
|
+
import { BlockAlreadyCheckpointedError, BlockArchiveNotConsistentError, BlockCheckpointNumberNotSequentialError, BlockIndexNotSequentialError, BlockNotFoundError, BlockNumberNotSequentialError, CannotOverwriteCheckpointedBlockError, CheckpointNotFoundError, CheckpointNumberNotSequentialError, InitialCheckpointNumberNotSequentialError, NoProposedCheckpointToPromoteError, ProposedCheckpointArchiveRootMismatchError, ProposedCheckpointNotSequentialError, ProposedCheckpointPromotionNotSequentialError } from '../errors.js';
|
|
16
15
|
/**
|
|
17
16
|
* LMDB-based block storage for the archiver.
|
|
18
17
|
*/ export class BlockStore {
|
|
19
18
|
db;
|
|
20
|
-
l1Constants;
|
|
21
19
|
/** Map block number to block data */ #blocks;
|
|
22
|
-
/** Map checkpoint number
|
|
20
|
+
/** Map keyed by checkpoint number holding proposed (locally-validated, not yet L1-confirmed) checkpoints. */ #proposedCheckpoints;
|
|
21
|
+
/** Map checkpoint number to checkpoint data for mined checkpoints only */ #checkpoints;
|
|
23
22
|
/** Map slot number to checkpoint number, for looking up checkpoints by slot range. */ #slotToCheckpoint;
|
|
24
23
|
/** Map block hash to list of tx hashes */ #blockTxs;
|
|
25
24
|
/** Tx hash to serialized IndexedTxEffect */ #txEffects;
|
|
26
25
|
/** Stores L1 block number in which the last processed L2 block was included */ #lastSynchedL1Block;
|
|
27
26
|
/** Stores last proven checkpoint */ #lastProvenCheckpoint;
|
|
27
|
+
/** Stores last finalized checkpoint (proven at or before the finalized L1 block) */ #lastFinalizedCheckpoint;
|
|
28
28
|
/** Stores the pending chain validation status */ #pendingChainValidationStatus;
|
|
29
29
|
/** Index mapping a contract's address (as a string) to its location in a block */ #contractIndex;
|
|
30
30
|
/** Index mapping block hash to block number */ #blockHashIndex;
|
|
31
31
|
/** Index mapping block archive to block number */ #blockArchiveIndex;
|
|
32
|
+
/** Map rejected checkpoints (due to invalid attestations) by archive root */ #rejectedCheckpoints;
|
|
33
|
+
/** Index mapping a rejected checkpoint's number to its archive root, so the latest can be read in reverse order */ #rejectedCheckpointsByNumber;
|
|
32
34
|
#log;
|
|
33
|
-
constructor(db
|
|
35
|
+
constructor(db){
|
|
34
36
|
this.db = db;
|
|
35
|
-
this.l1Constants = l1Constants;
|
|
36
37
|
this.#log = createLogger('archiver:block_store');
|
|
37
38
|
this.#blocks = db.openMap('archiver_blocks');
|
|
38
39
|
this.#blockTxs = db.openMap('archiver_block_txs');
|
|
@@ -42,128 +43,128 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
42
43
|
this.#blockArchiveIndex = db.openMap('archiver_block_archive_index');
|
|
43
44
|
this.#lastSynchedL1Block = db.openSingleton('archiver_last_synched_l1_block');
|
|
44
45
|
this.#lastProvenCheckpoint = db.openSingleton('archiver_last_proven_l2_checkpoint');
|
|
46
|
+
this.#lastFinalizedCheckpoint = db.openSingleton('archiver_last_finalized_l2_checkpoint');
|
|
45
47
|
this.#pendingChainValidationStatus = db.openSingleton('archiver_pending_chain_validation_status');
|
|
46
48
|
this.#checkpoints = db.openMap('archiver_checkpoints');
|
|
47
49
|
this.#slotToCheckpoint = db.openMap('archiver_slot_to_checkpoint');
|
|
50
|
+
this.#proposedCheckpoints = db.openMap('archiver_proposed_checkpoints');
|
|
51
|
+
this.#rejectedCheckpoints = db.openMap('archiver_rejected_checkpoints');
|
|
52
|
+
this.#rejectedCheckpointsByNumber = db.openMap('archiver_rejected_checkpoints_by_number');
|
|
48
53
|
}
|
|
49
54
|
/**
|
|
50
|
-
*
|
|
51
|
-
*
|
|
52
|
-
* TODO(#13569): Compute proper finalized block number based on L1 finalized block.
|
|
53
|
-
* TODO(palla/mbps): Even the provisional computation is wrong, since it should subtract checkpoints, not blocks
|
|
55
|
+
* Returns the finalized L2 block number. An L2 block is finalized when it was proven
|
|
56
|
+
* in an L1 block that has itself been finalized on Ethereum.
|
|
54
57
|
* @returns The finalized block number.
|
|
55
58
|
*/ async getFinalizedL2BlockNumber() {
|
|
56
|
-
const
|
|
57
|
-
|
|
59
|
+
const finalizedCheckpointNumber = await this.getFinalizedCheckpointNumber();
|
|
60
|
+
if (finalizedCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
61
|
+
return BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
62
|
+
}
|
|
63
|
+
const checkpointStorage = await this.#checkpoints.getAsync(finalizedCheckpointNumber);
|
|
64
|
+
if (!checkpointStorage) {
|
|
65
|
+
throw new CheckpointNotFoundError(finalizedCheckpointNumber);
|
|
66
|
+
}
|
|
67
|
+
return BlockNumber(checkpointStorage.startBlock + checkpointStorage.blockCount - 1);
|
|
58
68
|
}
|
|
59
69
|
/**
|
|
60
|
-
* Append new proposed
|
|
61
|
-
*
|
|
70
|
+
* Append a new proposed block to the store.
|
|
71
|
+
* This is an uncheckpointed block that has been proposed by the sequencer but not yet included in a checkpoint on L1.
|
|
62
72
|
* For checkpointed blocks (already published to L1), use addCheckpoints() instead.
|
|
63
|
-
* @param
|
|
73
|
+
* @param block - The proposed L2 block to be added to the store.
|
|
64
74
|
* @returns True if the operation is successful.
|
|
65
|
-
*/ async
|
|
66
|
-
if (blocks.length === 0) {
|
|
67
|
-
return true;
|
|
68
|
-
}
|
|
75
|
+
*/ async addProposedBlock(block, opts = {}) {
|
|
69
76
|
return await this.db.transactionAsync(async ()=>{
|
|
70
|
-
|
|
71
|
-
const
|
|
72
|
-
const
|
|
73
|
-
const
|
|
74
|
-
const firstBlockLastArchive = blocks[0].header.lastArchive.root;
|
|
77
|
+
const blockNumber = block.number;
|
|
78
|
+
const blockCheckpointNumber = block.checkpointNumber;
|
|
79
|
+
const blockIndex = block.indexWithinCheckpoint;
|
|
80
|
+
const blockLastArchive = block.header.lastArchive.root;
|
|
75
81
|
// Extract the latest block and checkpoint numbers
|
|
76
|
-
const previousBlockNumber = await this.
|
|
77
|
-
const
|
|
82
|
+
const previousBlockNumber = await this.getLatestL2BlockNumber();
|
|
83
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
78
84
|
// Verify we're not overwriting checkpointed blocks
|
|
79
85
|
const lastCheckpointedBlockNumber = await this.getCheckpointedL2BlockNumber();
|
|
80
|
-
if (!opts.force &&
|
|
81
|
-
|
|
86
|
+
if (!opts.force && blockNumber <= lastCheckpointedBlockNumber) {
|
|
87
|
+
// Check if the proposed block matches the already-checkpointed one
|
|
88
|
+
const existingBlock = await this.getBlockData({
|
|
89
|
+
number: BlockNumber(blockNumber)
|
|
90
|
+
});
|
|
91
|
+
if (existingBlock && existingBlock.archive.root.equals(block.archive.root)) {
|
|
92
|
+
throw new BlockAlreadyCheckpointedError(blockNumber);
|
|
93
|
+
}
|
|
94
|
+
throw new CannotOverwriteCheckpointedBlockError(blockNumber, lastCheckpointedBlockNumber);
|
|
82
95
|
}
|
|
83
|
-
// Check that the
|
|
84
|
-
if (!opts.force && previousBlockNumber !==
|
|
85
|
-
throw new
|
|
96
|
+
// Check that the block number is the expected one
|
|
97
|
+
if (!opts.force && previousBlockNumber !== blockNumber - 1) {
|
|
98
|
+
throw new BlockNumberNotSequentialError(blockNumber, previousBlockNumber);
|
|
86
99
|
}
|
|
87
|
-
//
|
|
88
|
-
|
|
89
|
-
|
|
100
|
+
// Accept the block if either the confirmed checkpoint or a pending checkpoint matches
|
|
101
|
+
// the expected predecessor. We look for a pending entry at exactly blockCheckpointNumber - 1.
|
|
102
|
+
const expectedCheckpointNumber = blockCheckpointNumber - 1;
|
|
103
|
+
const hasPendingAtExpected = await this.#proposedCheckpoints.hasAsync(expectedCheckpointNumber);
|
|
104
|
+
if (!opts.force && latestCheckpointNumber !== expectedCheckpointNumber && !hasPendingAtExpected) {
|
|
105
|
+
const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
106
|
+
reverse: true,
|
|
107
|
+
limit: 1
|
|
108
|
+
}));
|
|
109
|
+
const previous = CheckpointNumber(Math.max(latestCheckpointNumber, latestPendingKey ?? 0));
|
|
110
|
+
throw new BlockCheckpointNumberNotSequentialError(BlockNumber(blockNumber), blockCheckpointNumber, previous);
|
|
90
111
|
}
|
|
91
112
|
// Extract the previous block if there is one and see if it is for the same checkpoint or not
|
|
92
|
-
const previousBlockResult = await this.
|
|
93
|
-
|
|
113
|
+
const previousBlockResult = await this.getBlockData({
|
|
114
|
+
number: previousBlockNumber
|
|
115
|
+
});
|
|
116
|
+
let expectedBlockIndex = 0;
|
|
94
117
|
let previousBlockIndex = undefined;
|
|
95
118
|
if (previousBlockResult !== undefined) {
|
|
96
|
-
if (previousBlockResult.checkpointNumber ===
|
|
119
|
+
if (previousBlockResult.checkpointNumber === blockCheckpointNumber) {
|
|
97
120
|
// The previous block is for the same checkpoint, therefore our index should follow it
|
|
98
121
|
previousBlockIndex = previousBlockResult.indexWithinCheckpoint;
|
|
99
|
-
|
|
122
|
+
expectedBlockIndex = previousBlockIndex + 1;
|
|
100
123
|
}
|
|
101
|
-
if (!previousBlockResult.archive.root.equals(
|
|
102
|
-
throw new BlockArchiveNotConsistentError(
|
|
124
|
+
if (!previousBlockResult.archive.root.equals(blockLastArchive)) {
|
|
125
|
+
throw new BlockArchiveNotConsistentError(blockNumber, previousBlockResult.header.globalVariables.blockNumber, blockLastArchive, previousBlockResult.archive.root);
|
|
103
126
|
}
|
|
104
127
|
}
|
|
105
|
-
// Now check that the
|
|
106
|
-
if (!opts.force &&
|
|
107
|
-
throw new BlockIndexNotSequentialError(
|
|
108
|
-
}
|
|
109
|
-
// Iterate over blocks array and insert them, checking that the block numbers and indexes are sequential. Also check they are for the correct checkpoint.
|
|
110
|
-
let previousBlock = undefined;
|
|
111
|
-
for (const block of blocks){
|
|
112
|
-
if (!opts.force && previousBlock) {
|
|
113
|
-
if (previousBlock.number + 1 !== block.number) {
|
|
114
|
-
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
115
|
-
}
|
|
116
|
-
if (previousBlock.indexWithinCheckpoint + 1 !== block.indexWithinCheckpoint) {
|
|
117
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
118
|
-
}
|
|
119
|
-
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
120
|
-
throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
|
|
121
|
-
}
|
|
122
|
-
}
|
|
123
|
-
if (!opts.force && firstBlockCheckpointNumber !== block.checkpointNumber) {
|
|
124
|
-
throw new CheckpointNumberNotConsistentError(block.checkpointNumber, firstBlockCheckpointNumber);
|
|
125
|
-
}
|
|
126
|
-
previousBlock = block;
|
|
127
|
-
await this.addBlockToDatabase(block, block.checkpointNumber, block.indexWithinCheckpoint);
|
|
128
|
+
// Now check that the block has the expected index value
|
|
129
|
+
if (!opts.force && expectedBlockIndex !== blockIndex) {
|
|
130
|
+
throw new BlockIndexNotSequentialError(blockIndex, previousBlockIndex);
|
|
128
131
|
}
|
|
132
|
+
await this.addBlockToDatabase(block, block.checkpointNumber, block.indexWithinCheckpoint);
|
|
129
133
|
return true;
|
|
130
134
|
});
|
|
131
135
|
}
|
|
132
136
|
/**
|
|
133
|
-
* Append new
|
|
137
|
+
* Append new checkpoints to the store's list.
|
|
138
|
+
* Checkpoints at the start of the batch that are already stored (e.g. re-included by an L1 reorg)
|
|
139
|
+
* are accepted if their archive root matches: their L1 metadata is updated but they are not
|
|
140
|
+
* re-inserted, and they are excluded from the returned array.
|
|
134
141
|
* @param checkpoints - The L2 checkpoints to be added to the store.
|
|
135
|
-
* @returns
|
|
142
|
+
* @returns The checkpoints that were actually inserted (excluding already-stored ones).
|
|
136
143
|
*/ async addCheckpoints(checkpoints, opts = {}) {
|
|
137
144
|
if (checkpoints.length === 0) {
|
|
138
|
-
return
|
|
145
|
+
return [];
|
|
139
146
|
}
|
|
140
147
|
return await this.db.transactionAsync(async ()=>{
|
|
141
|
-
// Check that the checkpoint immediately before the first block to be added is present in the store.
|
|
142
148
|
const firstCheckpointNumber = checkpoints[0].checkpoint.number;
|
|
143
149
|
const previousCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
previousCheckpointData = await this.getCheckpointData(previousCheckpointNumber);
|
|
152
|
-
if (previousCheckpointData === undefined) {
|
|
153
|
-
throw new CheckpointNotFoundError(previousCheckpointNumber);
|
|
150
|
+
// Handle already-stored checkpoints at the start of the batch.
|
|
151
|
+
// This can happen after an L1 reorg re-includes a checkpoint in a different L1 block.
|
|
152
|
+
// We accept them if archives match (same content) and update their L1 metadata.
|
|
153
|
+
if (!opts.force && firstCheckpointNumber <= previousCheckpointNumber) {
|
|
154
|
+
checkpoints = await this.skipOrUpdateAlreadyStoredCheckpoints(checkpoints, previousCheckpointNumber);
|
|
155
|
+
if (checkpoints.length === 0) {
|
|
156
|
+
return [];
|
|
154
157
|
}
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
if (previousCheckpointData !== undefined) {
|
|
160
|
-
previousBlockNumber = BlockNumber(previousCheckpointData.startBlock + previousCheckpointData.blockCount - 1);
|
|
161
|
-
previousBlock = await this.getBlock(previousBlockNumber);
|
|
162
|
-
if (previousBlock === undefined) {
|
|
163
|
-
// We should be able to get the required previous block
|
|
164
|
-
throw new BlockNotFoundError(previousBlockNumber);
|
|
158
|
+
// Re-check sequentiality after skipping
|
|
159
|
+
const newFirstNumber = checkpoints[0].checkpoint.number;
|
|
160
|
+
if (previousCheckpointNumber !== newFirstNumber - 1) {
|
|
161
|
+
throw new InitialCheckpointNumberNotSequentialError(newFirstNumber, previousCheckpointNumber);
|
|
165
162
|
}
|
|
163
|
+
} else if (previousCheckpointNumber !== firstCheckpointNumber - 1 && !opts.force) {
|
|
164
|
+
throw new InitialCheckpointNumberNotSequentialError(firstCheckpointNumber, previousCheckpointNumber);
|
|
166
165
|
}
|
|
166
|
+
// Get the last block of the previous checkpoint for archive chaining
|
|
167
|
+
let previousBlock = await this.getPreviousCheckpointBlock(checkpoints[0].checkpoint.number);
|
|
167
168
|
// Iterate over checkpoints array and insert them, checking that the block numbers are sequential.
|
|
168
169
|
let previousCheckpoint = undefined;
|
|
169
170
|
for (const checkpoint of checkpoints){
|
|
@@ -171,33 +172,13 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
171
172
|
throw new CheckpointNumberNotSequentialError(checkpoint.checkpoint.number, previousCheckpoint.checkpoint.number);
|
|
172
173
|
}
|
|
173
174
|
previousCheckpoint = checkpoint;
|
|
174
|
-
//
|
|
175
|
+
// Validate block sequencing, indexes, and archive chaining
|
|
176
|
+
this.validateCheckpointBlocks(checkpoint.checkpoint.blocks, previousBlock);
|
|
177
|
+
// Store every block in the database (may already exist, but L1 data is authoritative)
|
|
175
178
|
for(let i = 0; i < checkpoint.checkpoint.blocks.length; i++){
|
|
176
|
-
|
|
177
|
-
if (previousBlock) {
|
|
178
|
-
// The blocks should have a sequential block number
|
|
179
|
-
if (previousBlock.number !== block.number - 1) {
|
|
180
|
-
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
181
|
-
}
|
|
182
|
-
// If the blocks are for the same checkpoint then they should have sequential indexes
|
|
183
|
-
if (previousBlock.checkpointNumber === block.checkpointNumber && previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
|
|
184
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
185
|
-
}
|
|
186
|
-
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
187
|
-
throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
|
|
188
|
-
}
|
|
189
|
-
} else {
|
|
190
|
-
// No previous block, must be block 1 at checkpoint index 0
|
|
191
|
-
if (block.indexWithinCheckpoint !== 0) {
|
|
192
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
193
|
-
}
|
|
194
|
-
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
195
|
-
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
196
|
-
}
|
|
197
|
-
}
|
|
198
|
-
previousBlock = block;
|
|
199
|
-
await this.addBlockToDatabase(block, checkpoint.checkpoint.number, i);
|
|
179
|
+
await this.addBlockToDatabase(checkpoint.checkpoint.blocks[i], checkpoint.checkpoint.number, i);
|
|
200
180
|
}
|
|
181
|
+
previousBlock = checkpoint.checkpoint.blocks.at(-1);
|
|
201
182
|
// Store the checkpoint in the database
|
|
202
183
|
await this.#checkpoints.set(checkpoint.checkpoint.number, {
|
|
203
184
|
header: checkpoint.checkpoint.header.toBuffer(),
|
|
@@ -207,14 +188,106 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
207
188
|
attestations: checkpoint.attestations.map((attestation)=>attestation.toBuffer()),
|
|
208
189
|
checkpointNumber: checkpoint.checkpoint.number,
|
|
209
190
|
startBlock: checkpoint.checkpoint.blocks[0].number,
|
|
210
|
-
blockCount: checkpoint.checkpoint.blocks.length
|
|
191
|
+
blockCount: checkpoint.checkpoint.blocks.length,
|
|
192
|
+
feeAssetPriceModifier: checkpoint.checkpoint.feeAssetPriceModifier.toString()
|
|
211
193
|
});
|
|
212
194
|
// Update slot-to-checkpoint index
|
|
213
195
|
await this.#slotToCheckpoint.set(checkpoint.checkpoint.header.slotNumber, checkpoint.checkpoint.number);
|
|
196
|
+
// Remove proposed checkpoint if it exists, since L1 is authoritative
|
|
197
|
+
await this.#proposedCheckpoints.delete(checkpoint.checkpoint.number);
|
|
198
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
199
|
+
// (e.g. invalid attestations) is now being ingested as valid, so its descendants are allowed.
|
|
200
|
+
await this.removeRejectedCheckpointByArchiveRoot(checkpoint.checkpoint.archive.root);
|
|
214
201
|
}
|
|
215
|
-
await this
|
|
216
|
-
return
|
|
202
|
+
await this.advanceSynchedL1BlockNumber(checkpoints[checkpoints.length - 1].l1.blockNumber);
|
|
203
|
+
return checkpoints;
|
|
204
|
+
});
|
|
205
|
+
}
|
|
206
|
+
/**
|
|
207
|
+
* Handles checkpoints at the start of a batch that are already stored (e.g. due to L1 reorg).
|
|
208
|
+
* Verifies the archive root matches, updates L1 metadata, and returns only the new checkpoints.
|
|
209
|
+
*/ async skipOrUpdateAlreadyStoredCheckpoints(checkpoints, latestStored) {
|
|
210
|
+
let i = 0;
|
|
211
|
+
for(; i < checkpoints.length && checkpoints[i].checkpoint.number <= latestStored; i++){
|
|
212
|
+
const incoming = checkpoints[i];
|
|
213
|
+
const stored = await this.getCheckpointData(incoming.checkpoint.number);
|
|
214
|
+
if (!stored) {
|
|
215
|
+
break;
|
|
216
|
+
}
|
|
217
|
+
// Verify the checkpoint content matches (archive root)
|
|
218
|
+
if (!stored.archive.root.equals(incoming.checkpoint.archive.root)) {
|
|
219
|
+
throw new Error(`Checkpoint ${incoming.checkpoint.number} already exists in store but with a different archive root. ` + `Stored: ${stored.archive.root}, incoming: ${incoming.checkpoint.archive.root}`);
|
|
220
|
+
}
|
|
221
|
+
// Update L1 metadata and attestations for the already-stored checkpoint
|
|
222
|
+
this.#log.warn(`Checkpoint ${incoming.checkpoint.number} already stored, updating L1 info ` + `(L1 block ${stored.l1.blockNumber} -> ${incoming.l1.blockNumber})`);
|
|
223
|
+
await this.#checkpoints.set(incoming.checkpoint.number, {
|
|
224
|
+
header: incoming.checkpoint.header.toBuffer(),
|
|
225
|
+
archive: incoming.checkpoint.archive.toBuffer(),
|
|
226
|
+
checkpointOutHash: incoming.checkpoint.getCheckpointOutHash().toBuffer(),
|
|
227
|
+
l1: incoming.l1.toBuffer(),
|
|
228
|
+
attestations: incoming.attestations.map((a)=>a.toBuffer()),
|
|
229
|
+
checkpointNumber: incoming.checkpoint.number,
|
|
230
|
+
startBlock: incoming.checkpoint.blocks[0].number,
|
|
231
|
+
blockCount: incoming.checkpoint.blocks.length,
|
|
232
|
+
feeAssetPriceModifier: incoming.checkpoint.feeAssetPriceModifier.toString()
|
|
233
|
+
});
|
|
234
|
+
// Update the sync point to reflect the new L1 block
|
|
235
|
+
await this.advanceSynchedL1BlockNumber(incoming.l1.blockNumber);
|
|
236
|
+
}
|
|
237
|
+
return checkpoints.slice(i);
|
|
238
|
+
}
|
|
239
|
+
/**
|
|
240
|
+
* Gets the last block of the checkpoint before the given one.
|
|
241
|
+
* Returns undefined if there is no previous checkpoint (i.e. genesis).
|
|
242
|
+
*/ async getPreviousCheckpointBlock(checkpointNumber) {
|
|
243
|
+
const previousCheckpointNumber = CheckpointNumber(checkpointNumber - 1);
|
|
244
|
+
if (previousCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
245
|
+
return undefined;
|
|
246
|
+
}
|
|
247
|
+
// Check across both proposed and mined checkpoints
|
|
248
|
+
const predecessor = await this.getProposedCheckpointByNumber(previousCheckpointNumber) ?? await this.getCheckpointData(previousCheckpointNumber);
|
|
249
|
+
if (!predecessor) {
|
|
250
|
+
throw new CheckpointNotFoundError(previousCheckpointNumber);
|
|
251
|
+
}
|
|
252
|
+
const previousBlockNumber = BlockNumber(predecessor.startBlock + predecessor.blockCount - 1);
|
|
253
|
+
const previousBlock = await this.getBlock({
|
|
254
|
+
number: previousBlockNumber
|
|
217
255
|
});
|
|
256
|
+
if (previousBlock === undefined) {
|
|
257
|
+
throw new BlockNotFoundError(previousBlockNumber);
|
|
258
|
+
}
|
|
259
|
+
return previousBlock;
|
|
260
|
+
}
|
|
261
|
+
/**
|
|
262
|
+
* Validates that blocks are sequential, have correct indexes, and chain via archive roots.
|
|
263
|
+
* This is the same validation used for both confirmed checkpoints (addCheckpoints) and
|
|
264
|
+
* proposed checkpoints (addProposedCheckpoint).
|
|
265
|
+
*/ validateCheckpointBlocks(blocks, previousBlock) {
|
|
266
|
+
for (const block of blocks){
|
|
267
|
+
if (previousBlock) {
|
|
268
|
+
if (previousBlock.number !== block.number - 1) {
|
|
269
|
+
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
270
|
+
}
|
|
271
|
+
if (previousBlock.checkpointNumber === block.checkpointNumber) {
|
|
272
|
+
if (previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
|
|
273
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
274
|
+
}
|
|
275
|
+
} else if (block.indexWithinCheckpoint !== 0) {
|
|
276
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
277
|
+
}
|
|
278
|
+
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
279
|
+
throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
|
|
280
|
+
}
|
|
281
|
+
} else {
|
|
282
|
+
if (block.indexWithinCheckpoint !== 0) {
|
|
283
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
284
|
+
}
|
|
285
|
+
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
286
|
+
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
287
|
+
}
|
|
288
|
+
}
|
|
289
|
+
previousBlock = block;
|
|
290
|
+
}
|
|
218
291
|
}
|
|
219
292
|
async addBlockToDatabase(block, checkpointNumber, indexWithinCheckpoint) {
|
|
220
293
|
const blockHash = await block.hash();
|
|
@@ -230,7 +303,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
230
303
|
data: block.body.txEffects[i],
|
|
231
304
|
l2BlockNumber: block.number,
|
|
232
305
|
l2BlockHash: blockHash,
|
|
233
|
-
txIndexInBlock: i
|
|
306
|
+
txIndexInBlock: i,
|
|
307
|
+
slotNumber: block.header.globalVariables.slotNumber
|
|
234
308
|
};
|
|
235
309
|
await this.#txEffects.set(txEffect.data.txHash.toString(), serializeIndexedTxEffect(txEffect));
|
|
236
310
|
}
|
|
@@ -239,17 +313,51 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
239
313
|
await this.#blockHashIndex.set(blockHash.toString(), block.number);
|
|
240
314
|
await this.#blockArchiveIndex.set(block.archive.root.toString(), block.number);
|
|
241
315
|
}
|
|
242
|
-
/** Deletes a block and all associated data (tx effects, indices). */ async deleteBlock(
|
|
316
|
+
/** Deletes a block and all associated data (tx effects, indices). */ async deleteBlock(blockNumber, blockStorage) {
|
|
243
317
|
// Delete the block from the main blocks map
|
|
244
|
-
await this.#blocks.delete(
|
|
245
|
-
|
|
246
|
-
|
|
318
|
+
await this.#blocks.delete(blockNumber);
|
|
319
|
+
const blockHash = bufferToHex(blockStorage.blockHash);
|
|
320
|
+
// Delete the tx effects of the block's txs, skipping entries that no longer point at this block: if
|
|
321
|
+
// another stored block also contains the tx, the entry points at that block, and deleting it here would
|
|
322
|
+
// orphan that block's index. Honest chains never store the same tx twice (duplicate nullifiers are
|
|
323
|
+
// rejected at build, re-execution, and world-state sync), so the store must not turn such a state into
|
|
324
|
+
// corruption of the surviving block if it ever appears.
|
|
325
|
+
const blockTxsBuffer = await this.#blockTxs.getAsync(blockHash);
|
|
326
|
+
if (blockTxsBuffer !== undefined) {
|
|
327
|
+
const reader = BufferReader.asReader(blockTxsBuffer);
|
|
328
|
+
const txHashes = [];
|
|
329
|
+
while(!reader.isEmpty()){
|
|
330
|
+
txHashes.push(reader.readObject(TxHash).toString());
|
|
331
|
+
}
|
|
332
|
+
await Promise.all(txHashes.map((txHash)=>this.deleteTxEffect(txHash, blockStorage.blockHash)));
|
|
333
|
+
}
|
|
247
334
|
// Delete block txs mapping
|
|
248
|
-
const blockHash = (await block.hash()).toString();
|
|
249
335
|
await this.#blockTxs.delete(blockHash);
|
|
250
336
|
// Clean up indices
|
|
251
337
|
await this.#blockHashIndex.delete(blockHash);
|
|
252
|
-
await this.#blockArchiveIndex.delete(
|
|
338
|
+
await this.#blockArchiveIndex.delete(AppendOnlyTreeSnapshot.fromBuffer(blockStorage.archive).root.toString());
|
|
339
|
+
}
|
|
340
|
+
/** Deletes a tx effect only if it is still owned by (points at) the given block. */ async deleteTxEffect(txHash, blockHash) {
|
|
341
|
+
const stored = await this.#txEffects.getAsync(txHash);
|
|
342
|
+
if (stored === undefined) {
|
|
343
|
+
this.#log.warn(`Missing tx effect for tx ${txHash} while removing its block`, {
|
|
344
|
+
txHash,
|
|
345
|
+
blockHash: bufferToHex(blockHash)
|
|
346
|
+
});
|
|
347
|
+
return;
|
|
348
|
+
}
|
|
349
|
+
// An IndexedTxEffect starts with the owning block hash (32 bytes) — see getTxLocation.
|
|
350
|
+
if (!Buffer.from(stored.buffer, stored.byteOffset, 32).equals(blockHash)) {
|
|
351
|
+
// Fires only when two stored blocks listed the same tx — a state upstream validation should make
|
|
352
|
+
// unreachable. Keep the entry (it belongs to the surviving block) but flag the duplication loudly.
|
|
353
|
+
this.#log.warn(`Tx effect for tx ${txHash} is owned by a block other than the one being removed`, {
|
|
354
|
+
txHash,
|
|
355
|
+
removedBlockHash: bufferToHex(blockHash),
|
|
356
|
+
owningBlockHash: bufferToHex(Buffer.from(stored.buffer, stored.byteOffset, 32))
|
|
357
|
+
});
|
|
358
|
+
return;
|
|
359
|
+
}
|
|
360
|
+
await this.#txEffects.delete(txHash);
|
|
253
361
|
}
|
|
254
362
|
/**
|
|
255
363
|
* Removes all checkpoints with checkpoint number > checkpointNumber.
|
|
@@ -293,6 +401,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
293
401
|
await this.#checkpoints.delete(c);
|
|
294
402
|
this.#log.debug(`Removed checkpoint ${c}`);
|
|
295
403
|
}
|
|
404
|
+
// Evict all pending checkpoints > checkpointNumber (their base chain no longer exists)
|
|
405
|
+
await this.evictProposedCheckpointsFrom(CheckpointNumber(checkpointNumber + 1));
|
|
296
406
|
return {
|
|
297
407
|
blocksRemoved
|
|
298
408
|
};
|
|
@@ -316,6 +426,31 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
316
426
|
}
|
|
317
427
|
return checkpoints;
|
|
318
428
|
}
|
|
429
|
+
/**
|
|
430
|
+
* Returns up to `limit` checkpoints anchored at `fromSlot`, ordered nearest-first, walking the slot index.
|
|
431
|
+
* With `reverse`, takes the checkpoints at or before `fromSlot` (descending by slot); otherwise the
|
|
432
|
+
* checkpoints at or after it (ascending). `limit: 1, reverse: true` yields the latest checkpoint at or
|
|
433
|
+
* before the slot in a single range scan.
|
|
434
|
+
*/ async getCheckpointsBySlot(fromSlot, limit, reverse) {
|
|
435
|
+
// The KV range bounds are direction-dependent: forward is [start, end), reverse is (start, end], so a
|
|
436
|
+
// reverse scan uses `end: fromSlot` (inclusive) with no +1 to include the checkpoint at fromSlot itself.
|
|
437
|
+
const range = reverse ? {
|
|
438
|
+
end: fromSlot,
|
|
439
|
+
reverse: true,
|
|
440
|
+
limit
|
|
441
|
+
} : {
|
|
442
|
+
start: fromSlot,
|
|
443
|
+
limit
|
|
444
|
+
};
|
|
445
|
+
const result = [];
|
|
446
|
+
for await (const [, checkpointNumber] of this.#slotToCheckpoint.entriesAsync(range)){
|
|
447
|
+
const checkpointStorage = await this.#checkpoints.getAsync(checkpointNumber);
|
|
448
|
+
if (checkpointStorage) {
|
|
449
|
+
result.push(this.checkpointDataFromCheckpointStorage(checkpointStorage));
|
|
450
|
+
}
|
|
451
|
+
}
|
|
452
|
+
return result;
|
|
453
|
+
}
|
|
319
454
|
/** Returns checkpoint data for all checkpoints whose slot falls within the given range (inclusive). */ async getCheckpointDataForSlotRange(startSlot, endSlot) {
|
|
320
455
|
const result = [];
|
|
321
456
|
for await (const [, checkpointNumber] of this.#slotToCheckpoint.entriesAsync({
|
|
@@ -329,6 +464,20 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
329
464
|
}
|
|
330
465
|
return result;
|
|
331
466
|
}
|
|
467
|
+
/**
|
|
468
|
+
* Returns the checkpoint numbers for all checkpoints whose slot falls within the given range (inclusive).
|
|
469
|
+
* Lighter than {@link getCheckpointDataForSlotRange} when callers only need to identify which
|
|
470
|
+
* checkpoints fall in the range and will fetch full data for at most a few of them.
|
|
471
|
+
*/ async getCheckpointNumbersForSlotRange(startSlot, endSlot) {
|
|
472
|
+
const result = [];
|
|
473
|
+
for await (const [, checkpointNumber] of this.#slotToCheckpoint.entriesAsync({
|
|
474
|
+
start: startSlot,
|
|
475
|
+
end: endSlot + 1
|
|
476
|
+
})){
|
|
477
|
+
result.push(CheckpointNumber(checkpointNumber));
|
|
478
|
+
}
|
|
479
|
+
return result;
|
|
480
|
+
}
|
|
332
481
|
checkpointDataFromCheckpointStorage(checkpointStorage) {
|
|
333
482
|
return {
|
|
334
483
|
header: CheckpointHeader.fromBuffer(checkpointStorage.header),
|
|
@@ -337,6 +486,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
337
486
|
checkpointNumber: CheckpointNumber(checkpointStorage.checkpointNumber),
|
|
338
487
|
startBlock: BlockNumber(checkpointStorage.startBlock),
|
|
339
488
|
blockCount: checkpointStorage.blockCount,
|
|
489
|
+
feeAssetPriceModifier: BigInt(checkpointStorage.feeAssetPriceModifier),
|
|
340
490
|
l1: L1PublishedData.fromBuffer(checkpointStorage.l1),
|
|
341
491
|
attestations: checkpointStorage.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf))
|
|
342
492
|
};
|
|
@@ -385,17 +535,25 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
385
535
|
return await this.db.transactionAsync(async ()=>{
|
|
386
536
|
const removedBlocks = [];
|
|
387
537
|
// Get the latest block number to determine the range
|
|
388
|
-
const latestBlockNumber = await this.
|
|
538
|
+
const latestBlockNumber = await this.getLatestL2BlockNumber();
|
|
389
539
|
// Iterate from blockNumber + 1 to latestBlockNumber
|
|
390
540
|
for(let bn = blockNumber + 1; bn <= latestBlockNumber; bn++){
|
|
391
|
-
const
|
|
392
|
-
if (
|
|
541
|
+
const blockStorage = await this.#blocks.getAsync(bn);
|
|
542
|
+
if (blockStorage === undefined) {
|
|
393
543
|
this.#log.warn(`Cannot remove block ${bn} from the store since we don't have it`);
|
|
394
544
|
continue;
|
|
395
545
|
}
|
|
396
|
-
|
|
397
|
-
|
|
398
|
-
this
|
|
546
|
+
// Load the full block for the returned list when possible, but clean up from the raw row regardless:
|
|
547
|
+
// a block whose body can no longer be fully loaded must still release its row, tx effects, and indices,
|
|
548
|
+
// or later inserts at this number leave stale tx-effect entries pointing into the new chain.
|
|
549
|
+
const block = await this.getBlockFromBlockStorage(bn, blockStorage);
|
|
550
|
+
if (block !== undefined) {
|
|
551
|
+
removedBlocks.push(block);
|
|
552
|
+
} else {
|
|
553
|
+
this.#log.warn(`Removing block ${bn} whose body could not be fully loaded`);
|
|
554
|
+
}
|
|
555
|
+
await this.deleteBlock(bn, blockStorage);
|
|
556
|
+
this.#log.debug(`Removed block ${bn} ${bufferToHex(blockStorage.blockHash)}`);
|
|
399
557
|
}
|
|
400
558
|
return removedBlocks;
|
|
401
559
|
});
|
|
@@ -412,13 +570,6 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
412
570
|
return BlockNumber(checkpointStorage.startBlock + checkpointStorage.blockCount - 1);
|
|
413
571
|
}
|
|
414
572
|
}
|
|
415
|
-
async getLatestBlockNumber() {
|
|
416
|
-
const [latestBlocknumber] = await toArray(this.#blocks.keysAsync({
|
|
417
|
-
reverse: true,
|
|
418
|
-
limit: 1
|
|
419
|
-
}));
|
|
420
|
-
return typeof latestBlocknumber === 'number' ? BlockNumber(latestBlocknumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
421
|
-
}
|
|
422
573
|
async getLatestCheckpointNumber() {
|
|
423
574
|
const [latestCheckpointNumber] = await toArray(this.#checkpoints.keysAsync({
|
|
424
575
|
reverse: true,
|
|
@@ -429,143 +580,171 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
429
580
|
}
|
|
430
581
|
return CheckpointNumber(latestCheckpointNumber);
|
|
431
582
|
}
|
|
432
|
-
async
|
|
433
|
-
const
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
const block = await this.getBlockFromBlockStorage(number, blockStorage);
|
|
442
|
-
if (!block) {
|
|
443
|
-
return undefined;
|
|
583
|
+
async hasProposedCheckpoint() {
|
|
584
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
585
|
+
limit: 1
|
|
586
|
+
}));
|
|
587
|
+
return key !== undefined;
|
|
588
|
+
}
|
|
589
|
+
/** Deletes all pending proposed checkpoints from storage. */ async deleteProposedCheckpoints() {
|
|
590
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()){
|
|
591
|
+
await this.#proposedCheckpoints.delete(key);
|
|
444
592
|
}
|
|
445
|
-
return new CheckpointedL2Block(CheckpointNumber(checkpoint.checkpointNumber), block, L1PublishedData.fromBuffer(checkpoint.l1), checkpoint.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf)));
|
|
446
593
|
}
|
|
447
594
|
/**
|
|
448
|
-
*
|
|
449
|
-
*
|
|
450
|
-
*
|
|
451
|
-
* @
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
const checkpointedBlock = new CheckpointedL2Block(CheckpointNumber(checkpoint.checkpointNumber), block, L1PublishedData.fromBuffer(checkpoint.l1), checkpoint.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf)));
|
|
461
|
-
yield checkpointedBlock;
|
|
462
|
-
}
|
|
595
|
+
* Promotes a specific pending checkpoint to a confirmed checkpoint entry.
|
|
596
|
+
* This persists the checkpoint to the store, removes only that pending entry, and updates the L1 sync point.
|
|
597
|
+
* Remaining pending entries (e.g. N+1, N+2) are left intact — they chain off the just-promoted one.
|
|
598
|
+
* @param checkpointNumber - The checkpoint number to promote.
|
|
599
|
+
* @param l1 - L1 published data for the checkpoint.
|
|
600
|
+
* @param attestations - Committee attestations.
|
|
601
|
+
* @param expectedArchiveRoot - Archive root guard against races.
|
|
602
|
+
*/ async promoteProposedToCheckpointed(checkpointNumber, l1, attestations, expectedArchiveRoot) {
|
|
603
|
+
return await this.db.transactionAsync(async ()=>{
|
|
604
|
+
const proposed = await this.getProposedCheckpointByNumber(checkpointNumber);
|
|
605
|
+
if (!proposed) {
|
|
606
|
+
throw new NoProposedCheckpointToPromoteError();
|
|
463
607
|
}
|
|
464
|
-
|
|
608
|
+
if (!proposed.archive.root.equals(expectedArchiveRoot)) {
|
|
609
|
+
throw new ProposedCheckpointArchiveRootMismatchError(expectedArchiveRoot, proposed.archive.root);
|
|
610
|
+
}
|
|
611
|
+
// Verify sequentiality: promoted checkpoint must follow the latest confirmed one
|
|
612
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
613
|
+
if (latestCheckpointNumber !== proposed.checkpointNumber - 1) {
|
|
614
|
+
throw new ProposedCheckpointPromotionNotSequentialError(proposed.checkpointNumber, latestCheckpointNumber);
|
|
615
|
+
}
|
|
616
|
+
// Write the checkpoint entry
|
|
617
|
+
await this.#checkpoints.set(proposed.checkpointNumber, {
|
|
618
|
+
header: proposed.header.toBuffer(),
|
|
619
|
+
archive: proposed.archive.toBuffer(),
|
|
620
|
+
checkpointOutHash: proposed.checkpointOutHash.toBuffer(),
|
|
621
|
+
l1: l1.toBuffer(),
|
|
622
|
+
attestations: attestations.map((attestation)=>attestation.toBuffer()),
|
|
623
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
624
|
+
startBlock: proposed.startBlock,
|
|
625
|
+
blockCount: proposed.blockCount,
|
|
626
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
|
|
627
|
+
});
|
|
628
|
+
// Update the slot-to-checkpoint index
|
|
629
|
+
await this.#slotToCheckpoint.set(proposed.header.slotNumber, proposed.checkpointNumber);
|
|
630
|
+
// Remove only this pending entry — remaining entries N+1, N+2, ... stay valid
|
|
631
|
+
await this.#proposedCheckpoints.delete(proposed.checkpointNumber);
|
|
632
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
633
|
+
// (e.g. invalid attestations) is now being promoted as valid, so its descendants are allowed.
|
|
634
|
+
await this.removeRejectedCheckpointByArchiveRoot(proposed.archive.root);
|
|
635
|
+
// Update the last synced L1 block
|
|
636
|
+
await this.advanceSynchedL1BlockNumber(l1.blockNumber);
|
|
637
|
+
});
|
|
465
638
|
}
|
|
466
|
-
|
|
467
|
-
|
|
468
|
-
|
|
639
|
+
/**
|
|
640
|
+
* Returns the latest pending checkpoint (highest-numbered entry), or undefined if none.
|
|
641
|
+
* No fallback to confirmed.
|
|
642
|
+
*/ async getLastProposedCheckpoint() {
|
|
643
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
644
|
+
reverse: true,
|
|
645
|
+
limit: 1
|
|
646
|
+
}));
|
|
647
|
+
if (key === undefined) {
|
|
469
648
|
return undefined;
|
|
470
649
|
}
|
|
471
|
-
|
|
650
|
+
const stored = await this.#proposedCheckpoints.getAsync(key);
|
|
651
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
472
652
|
}
|
|
473
|
-
async
|
|
474
|
-
const
|
|
475
|
-
|
|
476
|
-
return undefined;
|
|
477
|
-
}
|
|
478
|
-
return this.getCheckpointedBlock(BlockNumber(blockNumber));
|
|
653
|
+
/** Returns the pending checkpoint for a specific checkpoint number, or undefined if not found. */ async getProposedCheckpointByNumber(n) {
|
|
654
|
+
const stored = await this.#proposedCheckpoints.getAsync(n);
|
|
655
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
479
656
|
}
|
|
480
657
|
/**
|
|
481
|
-
*
|
|
482
|
-
*
|
|
483
|
-
*
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
yield block;
|
|
658
|
+
* Returns the pending checkpoint whose header slot matches the given slot, or undefined if not found.
|
|
659
|
+
* Iterates `#proposedCheckpoints` rather than reading an index because the map carries 0–1 entries
|
|
660
|
+
* in normal operation (bounded by the proposer pipelining window). Returns the first match.
|
|
661
|
+
*/ async getProposedCheckpointBySlot(slot) {
|
|
662
|
+
for await (const [, stored] of this.#proposedCheckpoints.entriesAsync()){
|
|
663
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
664
|
+
if (header.slotNumber === slot) {
|
|
665
|
+
return this.convertToProposedCheckpointData(stored);
|
|
490
666
|
}
|
|
491
667
|
}
|
|
668
|
+
return undefined;
|
|
492
669
|
}
|
|
493
670
|
/**
|
|
494
|
-
*
|
|
495
|
-
*
|
|
496
|
-
*
|
|
497
|
-
*/ async
|
|
498
|
-
const
|
|
499
|
-
|
|
500
|
-
|
|
671
|
+
* Evicts all pending checkpoints with checkpoint number >= fromNumber.
|
|
672
|
+
* Used for divergent-mined-checkpoint cleanup: when L1 mines checkpoint N with a different archive,
|
|
673
|
+
* all pending >= N must be evicted since they chain off the now-invalid pending N.
|
|
674
|
+
*/ async evictProposedCheckpointsFrom(fromNumber) {
|
|
675
|
+
const keysToDelete = [];
|
|
676
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()){
|
|
677
|
+
if (key >= fromNumber) {
|
|
678
|
+
keysToDelete.push(key);
|
|
679
|
+
}
|
|
501
680
|
}
|
|
502
|
-
|
|
503
|
-
|
|
504
|
-
/**
|
|
505
|
-
* Gets block metadata (without tx data) by archive root.
|
|
506
|
-
* @param archive - The archive root of the block to return.
|
|
507
|
-
* @returns The requested block data.
|
|
508
|
-
*/ async getBlockDataByArchive(archive) {
|
|
509
|
-
const blockNumber = await this.#blockArchiveIndex.getAsync(archive.toString());
|
|
510
|
-
if (blockNumber === undefined) {
|
|
511
|
-
return undefined;
|
|
681
|
+
for (const key of keysToDelete){
|
|
682
|
+
await this.#proposedCheckpoints.delete(key);
|
|
512
683
|
}
|
|
513
|
-
return this.getBlockData(BlockNumber(blockNumber));
|
|
514
684
|
}
|
|
515
685
|
/**
|
|
516
|
-
* Gets
|
|
517
|
-
*
|
|
518
|
-
*
|
|
519
|
-
*/ async
|
|
520
|
-
const
|
|
521
|
-
if (!
|
|
522
|
-
return
|
|
686
|
+
* Gets the checkpoint at the proposed tip:
|
|
687
|
+
* - latest pending checkpoint if any exist
|
|
688
|
+
* - fallsback to latest confirmed checkpoint otherwise
|
|
689
|
+
*/ async getLastCheckpoint() {
|
|
690
|
+
const latest = await this.getLastProposedCheckpoint();
|
|
691
|
+
if (!latest) {
|
|
692
|
+
return this.getCheckpointData(await this.getLatestCheckpointNumber());
|
|
523
693
|
}
|
|
524
|
-
return
|
|
694
|
+
return latest;
|
|
695
|
+
}
|
|
696
|
+
convertToProposedCheckpointData(stored) {
|
|
697
|
+
return {
|
|
698
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
699
|
+
header: CheckpointHeader.fromBuffer(stored.header),
|
|
700
|
+
archive: AppendOnlyTreeSnapshot.fromBuffer(stored.archive),
|
|
701
|
+
checkpointOutHash: Fr.fromBuffer(stored.checkpointOutHash),
|
|
702
|
+
startBlock: BlockNumber(stored.startBlock),
|
|
703
|
+
blockCount: stored.blockCount,
|
|
704
|
+
totalManaUsed: BigInt(stored.totalManaUsed),
|
|
705
|
+
feeAssetPriceModifier: BigInt(stored.feeAssetPriceModifier)
|
|
706
|
+
};
|
|
525
707
|
}
|
|
526
708
|
/**
|
|
527
|
-
*
|
|
528
|
-
* @
|
|
529
|
-
|
|
530
|
-
|
|
531
|
-
|
|
532
|
-
|
|
533
|
-
return undefined;
|
|
709
|
+
* Attempts to get the proposedCheckpoint's number, if there is not one, then fallback to the latest confirmed checkpoint number.
|
|
710
|
+
* @returns CheckpointNumber
|
|
711
|
+
*/ async getProposedCheckpointNumber() {
|
|
712
|
+
const proposed = await this.getLastCheckpoint();
|
|
713
|
+
if (!proposed) {
|
|
714
|
+
return await this.getLatestCheckpointNumber();
|
|
534
715
|
}
|
|
535
|
-
return
|
|
716
|
+
return CheckpointNumber(proposed.checkpointNumber);
|
|
536
717
|
}
|
|
537
718
|
/**
|
|
538
|
-
*
|
|
539
|
-
* @
|
|
540
|
-
|
|
541
|
-
|
|
542
|
-
|
|
543
|
-
|
|
544
|
-
return undefined;
|
|
719
|
+
* Attempts to get the proposedCheckpoint's block number, if there is not one, then fallback to the checkpointed block number
|
|
720
|
+
* @returns BlockNumber
|
|
721
|
+
*/ async getProposedCheckpointL2BlockNumber() {
|
|
722
|
+
const proposed = await this.getLastCheckpoint();
|
|
723
|
+
if (!proposed) {
|
|
724
|
+
return await this.getCheckpointedL2BlockNumber();
|
|
545
725
|
}
|
|
546
|
-
return
|
|
726
|
+
return BlockNumber(proposed.startBlock + proposed.blockCount - 1);
|
|
547
727
|
}
|
|
548
|
-
/**
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
const blockNumber = await this
|
|
728
|
+
/** Returns the checkpoint number that contains the given slot (or undefined if not found). */ async getCheckpointNumberBySlot(slot) {
|
|
729
|
+
const checkpointNumber = await this.#slotToCheckpoint.getAsync(slot);
|
|
730
|
+
return checkpointNumber === undefined ? undefined : CheckpointNumber(checkpointNumber);
|
|
731
|
+
}
|
|
732
|
+
/** Gets a single L2 block matching the given resolved query. */ async getBlock(query) {
|
|
733
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
554
734
|
if (blockNumber === undefined) {
|
|
555
735
|
return undefined;
|
|
556
736
|
}
|
|
557
737
|
const blockStorage = await this.#blocks.getAsync(blockNumber);
|
|
558
|
-
if (!blockStorage
|
|
738
|
+
if (!blockStorage) {
|
|
559
739
|
return undefined;
|
|
560
740
|
}
|
|
561
|
-
return
|
|
741
|
+
return this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
562
742
|
}
|
|
563
|
-
/**
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
const blockNumber = await this.#blockArchiveIndex.getAsync(archive.toString());
|
|
743
|
+
/** Gets a collection of L2 blocks for a resolved range. */ getBlocks(query) {
|
|
744
|
+
return toArray(this.iterateBlocks(query));
|
|
745
|
+
}
|
|
746
|
+
/** Gets single block metadata matching the given resolved query. */ async getBlockData(query) {
|
|
747
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
569
748
|
if (blockNumber === undefined) {
|
|
570
749
|
return undefined;
|
|
571
750
|
}
|
|
@@ -573,20 +752,30 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
573
752
|
if (!blockStorage || !blockStorage.header) {
|
|
574
753
|
return undefined;
|
|
575
754
|
}
|
|
576
|
-
return
|
|
755
|
+
return this.getBlockDataFromBlockStorage(blockStorage);
|
|
577
756
|
}
|
|
578
|
-
/**
|
|
579
|
-
|
|
580
|
-
|
|
581
|
-
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
|
|
587
|
-
|
|
757
|
+
/** Gets a collection of block metadata entries for a resolved range. */ getBlocksData(query) {
|
|
758
|
+
return toArray(this.iterateBlocksData(query));
|
|
759
|
+
}
|
|
760
|
+
/** Async iterator over L2 blocks for a resolved range. */ async *iterateBlocks(query) {
|
|
761
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
762
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)){
|
|
763
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
764
|
+
break;
|
|
765
|
+
}
|
|
766
|
+
const block = await this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
767
|
+
if (block) {
|
|
768
|
+
yield block;
|
|
588
769
|
}
|
|
589
|
-
|
|
770
|
+
}
|
|
771
|
+
}
|
|
772
|
+
/** Async iterator over block metadata for a resolved range. */ async *iterateBlocksData(query) {
|
|
773
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
774
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)){
|
|
775
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
776
|
+
break;
|
|
777
|
+
}
|
|
778
|
+
yield this.getBlockDataFromBlockStorage(blockStorage);
|
|
590
779
|
}
|
|
591
780
|
}
|
|
592
781
|
async *getBlockStorages(start, limit) {
|
|
@@ -602,11 +791,27 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
602
791
|
];
|
|
603
792
|
}
|
|
604
793
|
}
|
|
794
|
+
/** Resolves a ResolvedBlockQuery discriminant to a block number, or undefined if not found. */ async getBlockNumber(query) {
|
|
795
|
+
let blockNumber;
|
|
796
|
+
if ('number' in query) {
|
|
797
|
+
blockNumber = query.number;
|
|
798
|
+
} else if ('hash' in query) {
|
|
799
|
+
const n = await this.#blockHashIndex.getAsync(query.hash.toString());
|
|
800
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
801
|
+
} else {
|
|
802
|
+
const n = await this.#blockArchiveIndex.getAsync(query.archive.toString());
|
|
803
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
804
|
+
}
|
|
805
|
+
if (blockNumber === undefined) {
|
|
806
|
+
return undefined;
|
|
807
|
+
}
|
|
808
|
+
return blockNumber;
|
|
809
|
+
}
|
|
605
810
|
getBlockDataFromBlockStorage(blockStorage) {
|
|
606
811
|
return {
|
|
607
812
|
header: BlockHeader.fromBuffer(blockStorage.header),
|
|
608
813
|
archive: AppendOnlyTreeSnapshot.fromBuffer(blockStorage.archive),
|
|
609
|
-
blockHash:
|
|
814
|
+
blockHash: BlockHash.fromBuffer(blockStorage.blockHash),
|
|
610
815
|
checkpointNumber: CheckpointNumber(blockStorage.checkpointNumber),
|
|
611
816
|
indexWithinCheckpoint: IndexWithinCheckpoint(blockStorage.indexWithinCheckpoint)
|
|
612
817
|
};
|
|
@@ -650,34 +855,6 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
650
855
|
return deserializeIndexedTxEffect(buffer);
|
|
651
856
|
}
|
|
652
857
|
/**
|
|
653
|
-
* Gets a receipt of a settled tx.
|
|
654
|
-
* @param txHash - The hash of a tx we try to get the receipt for.
|
|
655
|
-
* @returns The requested tx receipt (or undefined if not found).
|
|
656
|
-
*/ async getSettledTxReceipt(txHash) {
|
|
657
|
-
const txEffect = await this.getTxEffect(txHash);
|
|
658
|
-
if (!txEffect) {
|
|
659
|
-
return undefined;
|
|
660
|
-
}
|
|
661
|
-
const blockNumber = BlockNumber(txEffect.l2BlockNumber);
|
|
662
|
-
// Use existing archiver methods to determine finalization level
|
|
663
|
-
const [provenBlockNumber, checkpointedBlockNumber, finalizedBlockNumber] = await Promise.all([
|
|
664
|
-
this.getProvenBlockNumber(),
|
|
665
|
-
this.getCheckpointedL2BlockNumber(),
|
|
666
|
-
this.getFinalizedL2BlockNumber()
|
|
667
|
-
]);
|
|
668
|
-
let status;
|
|
669
|
-
if (blockNumber <= finalizedBlockNumber) {
|
|
670
|
-
status = TxStatus.FINALIZED;
|
|
671
|
-
} else if (blockNumber <= provenBlockNumber) {
|
|
672
|
-
status = TxStatus.PROVEN;
|
|
673
|
-
} else if (blockNumber <= checkpointedBlockNumber) {
|
|
674
|
-
status = TxStatus.CHECKPOINTED;
|
|
675
|
-
} else {
|
|
676
|
-
status = TxStatus.PROPOSED;
|
|
677
|
-
}
|
|
678
|
-
return new TxReceipt(txHash, status, TxReceipt.executionResultFromRevertCode(txEffect.data.revertCode), undefined, txEffect.data.transactionFee.toBigInt(), txEffect.l2BlockHash, blockNumber);
|
|
679
|
-
}
|
|
680
|
-
/**
|
|
681
858
|
* Looks up which block included the requested tx effect.
|
|
682
859
|
* @param txHash - The txHash of the tx.
|
|
683
860
|
* @returns The block number and index of the tx.
|
|
@@ -686,13 +863,50 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
686
863
|
if (!txEffect) {
|
|
687
864
|
return undefined;
|
|
688
865
|
}
|
|
689
|
-
|
|
866
|
+
// Read only the IndexedTxEffect header (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4)`); the
|
|
867
|
+
// large tail (the full TxEffect with logs etc.) is irrelevant here.
|
|
868
|
+
const view = Buffer.from(txEffect.buffer, txEffect.byteOffset, txEffect.byteLength);
|
|
869
|
+
const l2BlockNumber = view.readUInt32BE(32);
|
|
870
|
+
const txIndexInBlock = view.readUInt32BE(36);
|
|
690
871
|
return [
|
|
691
872
|
l2BlockNumber,
|
|
692
873
|
txIndexInBlock
|
|
693
874
|
];
|
|
694
875
|
}
|
|
695
876
|
/**
|
|
877
|
+
* Batched, partial deserializer that fetches `noteHashes` and `nullifiers` (all of them) for the given
|
|
878
|
+
* txs. For each input txHash, returns a `[noteHashes, nullifiers]` tuple. Returns `[[], []]` for any
|
|
879
|
+
* unknown txHash. Preserves input order. Used by the log read path when `includeEffects` is set to
|
|
880
|
+
* attach effect data on demand without paying for a full {@link TxEffect} deserialization.
|
|
881
|
+
*
|
|
882
|
+
* The on-disk `IndexedTxEffect` layout starts with a fixed-length header
|
|
883
|
+
* (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4) + slotNumber(4) + revertCode(1) + txHash(32) +
|
|
884
|
+
* transactionFee(32)` = 109 bytes), followed by `noteHashes` and `nullifiers` (both u8-length-prefixed `Fr`
|
|
885
|
+
* vectors). We
|
|
886
|
+
* skip the header, then read the two vectors, and stop — the large tail (`l2ToL1Msgs`,
|
|
887
|
+
* `publicDataWrites`, `privateLogs`, `publicLogs`, `contractClassLogs`) is never touched.
|
|
888
|
+
*/ getNoteHashesAndNullifiers(txHashes) {
|
|
889
|
+
return Promise.all(txHashes.map(async (txHash)=>{
|
|
890
|
+
const buffer = await this.#txEffects.getAsync(txHash.toString());
|
|
891
|
+
if (!buffer) {
|
|
892
|
+
return [
|
|
893
|
+
[],
|
|
894
|
+
[]
|
|
895
|
+
];
|
|
896
|
+
}
|
|
897
|
+
const reader = BufferReader.asReader(buffer);
|
|
898
|
+
// Skip the fixed-length header: blockHash + l2BlockNumber + txIndexInBlock + slotNumber + revertCode +
|
|
899
|
+
// txHash + transactionFee.
|
|
900
|
+
reader.readBytes(32 + 4 + 4 + 4 + 1 + 32 + 32);
|
|
901
|
+
const noteHashes = reader.readVectorUint8Prefix(Fr);
|
|
902
|
+
const nullifiers = reader.readVectorUint8Prefix(Fr);
|
|
903
|
+
return [
|
|
904
|
+
noteHashes,
|
|
905
|
+
nullifiers
|
|
906
|
+
];
|
|
907
|
+
}));
|
|
908
|
+
}
|
|
909
|
+
/**
|
|
696
910
|
* Looks up which block deployed a particular contract.
|
|
697
911
|
* @param contractAddress - The address of the contract to look up.
|
|
698
912
|
* @returns The block number and index of the contract.
|
|
@@ -718,6 +932,142 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
718
932
|
return typeof lastBlockNumber === 'number' ? BlockNumber(lastBlockNumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
719
933
|
}
|
|
720
934
|
/**
|
|
935
|
+
* Resolves all four L2 chain tips (proposed, checkpointed, proven, finalized) in a single
|
|
936
|
+
* read-only transaction so the snapshot is internally consistent. Each underlying record is
|
|
937
|
+
* read at most once: latest block and latest confirmed checkpoint are loaded directly (no
|
|
938
|
+
* separate "find the number, then look up data" hop), the proven/finalized checkpoint
|
|
939
|
+
* singletons are read once and their storage entries are reused if they coincide with the
|
|
940
|
+
* latest checkpoint, and per-tip block hashes are deduped when two tips land on the same block
|
|
941
|
+
* (e.g. finalized == proven).
|
|
942
|
+
*
|
|
943
|
+
* The result is guaranteed to satisfy `finalized <= proven <= checkpointed <= proposed` (by
|
|
944
|
+
* block number). Genesis is represented by `(INITIAL_L2_BLOCK_NUM - 1)` and the supplied
|
|
945
|
+
* `genesisBlockHash`, paired with the synthetic genesis checkpoint id.
|
|
946
|
+
*
|
|
947
|
+
* @param genesisBlockHash - Block hash to report for the synthetic pre-initial block (used when
|
|
948
|
+
* a tip is still at genesis).
|
|
949
|
+
*/ async getL2TipsData(genesisBlockHash) {
|
|
950
|
+
return await this.db.transactionAsync(async ()=>{
|
|
951
|
+
// Define genesis tips
|
|
952
|
+
const genesisBlockNumber = BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
953
|
+
const genesisCheckpointNumber = CheckpointNumber(INITIAL_CHECKPOINT_NUMBER - 1);
|
|
954
|
+
const genesisBlockId = {
|
|
955
|
+
number: genesisBlockNumber,
|
|
956
|
+
hash: genesisBlockHash.toString()
|
|
957
|
+
};
|
|
958
|
+
const genesisCheckpointId = {
|
|
959
|
+
number: genesisCheckpointNumber,
|
|
960
|
+
hash: GENESIS_CHECKPOINT_HEADER_HASH.toString()
|
|
961
|
+
};
|
|
962
|
+
const genesisTip = {
|
|
963
|
+
block: genesisBlockId,
|
|
964
|
+
checkpoint: genesisCheckpointId
|
|
965
|
+
};
|
|
966
|
+
// Load latest block and checkpoint entries
|
|
967
|
+
const [latestBlockEntry] = await toArray(this.#blocks.entriesAsync({
|
|
968
|
+
reverse: true,
|
|
969
|
+
limit: 1
|
|
970
|
+
}));
|
|
971
|
+
const [latestCheckpointEntry] = await toArray(this.#checkpoints.entriesAsync({
|
|
972
|
+
reverse: true,
|
|
973
|
+
limit: 1
|
|
974
|
+
}));
|
|
975
|
+
const latestCheckpointNumber = latestCheckpointEntry ? CheckpointNumber(latestCheckpointEntry[0]) : genesisCheckpointNumber;
|
|
976
|
+
// Load proven and finalized checkpoint number pointers
|
|
977
|
+
const [provenRaw, finalizedRaw] = await Promise.all([
|
|
978
|
+
this.#lastProvenCheckpoint.getAsync(),
|
|
979
|
+
this.#lastFinalizedCheckpoint.getAsync()
|
|
980
|
+
]);
|
|
981
|
+
// Clamp to enforce finalized <= proven <= checkpointed.
|
|
982
|
+
const provenCheckpointNumber = CheckpointNumber(Math.min(provenRaw ?? 0, latestCheckpointNumber));
|
|
983
|
+
const finalizedCheckpointNumber = CheckpointNumber(Math.min(finalizedRaw ?? 0, provenCheckpointNumber));
|
|
984
|
+
// Avoid loading the same checkpoint more than once
|
|
985
|
+
const checkpointStorageCache = new Map();
|
|
986
|
+
if (latestCheckpointEntry) {
|
|
987
|
+
checkpointStorageCache.set(CheckpointNumber(latestCheckpointEntry[0]), latestCheckpointEntry[1]);
|
|
988
|
+
}
|
|
989
|
+
const loadCheckpointStorage = async (n)=>{
|
|
990
|
+
if (n === 0) {
|
|
991
|
+
return undefined;
|
|
992
|
+
}
|
|
993
|
+
if (!checkpointStorageCache.has(n)) {
|
|
994
|
+
const checkpointStorage = await this.#checkpoints.getAsync(n);
|
|
995
|
+
if (!checkpointStorage) {
|
|
996
|
+
throw new CheckpointNotFoundError(n);
|
|
997
|
+
}
|
|
998
|
+
checkpointStorageCache.set(n, checkpointStorage);
|
|
999
|
+
}
|
|
1000
|
+
return checkpointStorageCache.get(n);
|
|
1001
|
+
};
|
|
1002
|
+
// Load proven and finalized checkpoint storage entries
|
|
1003
|
+
const provenCheckpoint = await loadCheckpointStorage(provenCheckpointNumber);
|
|
1004
|
+
const finalizedCheckpoint = await loadCheckpointStorage(finalizedCheckpointNumber);
|
|
1005
|
+
// Avoid loading the same block hash multiple times when tips land on the same block
|
|
1006
|
+
const blockHashCache = new Map();
|
|
1007
|
+
blockHashCache.set(genesisBlockNumber, genesisBlockHash.toString());
|
|
1008
|
+
if (latestBlockEntry) {
|
|
1009
|
+
blockHashCache.set(latestBlockEntry[0], BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString());
|
|
1010
|
+
}
|
|
1011
|
+
const loadBlockHash = async (n)=>{
|
|
1012
|
+
if (!blockHashCache.has(n)) {
|
|
1013
|
+
const blockStorage = await this.#blocks.getAsync(n);
|
|
1014
|
+
if (!blockStorage) {
|
|
1015
|
+
throw new BlockNotFoundError(n);
|
|
1016
|
+
}
|
|
1017
|
+
const blockHash = BlockHash.fromBuffer(blockStorage.blockHash).toString();
|
|
1018
|
+
blockHashCache.set(n, blockHash);
|
|
1019
|
+
}
|
|
1020
|
+
return blockHashCache.get(n);
|
|
1021
|
+
};
|
|
1022
|
+
// Build proposed chain tip (this one has block only, no checkpoint)
|
|
1023
|
+
const proposedBlockId = latestBlockEntry === undefined ? genesisBlockId : {
|
|
1024
|
+
number: BlockNumber(latestBlockEntry[0]),
|
|
1025
|
+
hash: BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString()
|
|
1026
|
+
};
|
|
1027
|
+
// Build other tips from checkpoint data, reading corresponding block data from the cache
|
|
1028
|
+
const buildTipFromCheckpoint = async (stored)=>{
|
|
1029
|
+
if (!stored) {
|
|
1030
|
+
return genesisTip;
|
|
1031
|
+
}
|
|
1032
|
+
const blockNumber = BlockNumber(stored.startBlock + stored.blockCount - 1);
|
|
1033
|
+
const blockHash = await loadBlockHash(blockNumber);
|
|
1034
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
1035
|
+
return {
|
|
1036
|
+
block: {
|
|
1037
|
+
number: blockNumber,
|
|
1038
|
+
hash: blockHash
|
|
1039
|
+
},
|
|
1040
|
+
checkpoint: {
|
|
1041
|
+
number: CheckpointNumber(stored.checkpointNumber),
|
|
1042
|
+
hash: header.hash().toString()
|
|
1043
|
+
}
|
|
1044
|
+
};
|
|
1045
|
+
};
|
|
1046
|
+
const checkpointedTip = await buildTipFromCheckpoint(latestCheckpointEntry?.[1]);
|
|
1047
|
+
const provenTip = await buildTipFromCheckpoint(provenCheckpoint);
|
|
1048
|
+
const finalizedTip = await buildTipFromCheckpoint(finalizedCheckpoint);
|
|
1049
|
+
// A checkpointed block past the latest stored block would mean a checkpoint
|
|
1050
|
+
// references blocks that aren't in blocks.
|
|
1051
|
+
if (proposedBlockId.number < checkpointedTip.block.number) {
|
|
1052
|
+
throw new Error(`Inconsistent block store: latest block ${proposedBlockId.number} is behind checkpointed block ${checkpointedTip.block.number}`);
|
|
1053
|
+
}
|
|
1054
|
+
// Assert that checkpoint numbers are increasing
|
|
1055
|
+
if (finalizedTip.checkpoint.number > provenTip.checkpoint.number || provenTip.checkpoint.number > checkpointedTip.checkpoint.number) {
|
|
1056
|
+
throw new Error(`Inconsistent checkpoint numbers in chain tips: finalized=${finalizedTip.checkpoint.number} proven=${provenTip.checkpoint.number} checkpointed=${checkpointedTip.checkpoint.number}`);
|
|
1057
|
+
}
|
|
1058
|
+
// Assert block numbers are increasing
|
|
1059
|
+
if (finalizedTip.block.number > provenTip.block.number || provenTip.block.number > checkpointedTip.block.number || checkpointedTip.block.number > proposedBlockId.number) {
|
|
1060
|
+
throw new Error(`Inconsistent block numbers in chain tips: finalized=${finalizedTip.block.number} proven=${provenTip.block.number} checkpointed=${checkpointedTip.block.number} proposed=${proposedBlockId.number}`);
|
|
1061
|
+
}
|
|
1062
|
+
return {
|
|
1063
|
+
proposed: proposedBlockId,
|
|
1064
|
+
checkpointed: checkpointedTip,
|
|
1065
|
+
proven: provenTip,
|
|
1066
|
+
finalized: finalizedTip
|
|
1067
|
+
};
|
|
1068
|
+
});
|
|
1069
|
+
}
|
|
1070
|
+
/**
|
|
721
1071
|
* Gets the most recent L1 block processed.
|
|
722
1072
|
* @returns The L1 block that published the latest L2 block
|
|
723
1073
|
*/ getSynchedL1BlockNumber() {
|
|
@@ -726,17 +1076,74 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
726
1076
|
setSynchedL1BlockNumber(l1BlockNumber) {
|
|
727
1077
|
return this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
728
1078
|
}
|
|
1079
|
+
/**
|
|
1080
|
+
* Adds a proposed checkpoint to the pending queue.
|
|
1081
|
+
* Accepts proposed.checkpointNumber === latestTip + 1, where latestTip is the highest of
|
|
1082
|
+
* confirmed and the highest pending checkpoint number.
|
|
1083
|
+
* Computes archive and checkpointOutHash from the stored blocks.
|
|
1084
|
+
*/ async addProposedCheckpoint(proposed) {
|
|
1085
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1086
|
+
const confirmed = await this.getLatestCheckpointNumber();
|
|
1087
|
+
const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
1088
|
+
reverse: true,
|
|
1089
|
+
limit: 1
|
|
1090
|
+
}));
|
|
1091
|
+
const latestTip = CheckpointNumber(latestPendingKey !== undefined ? Math.max(latestPendingKey, confirmed) : confirmed);
|
|
1092
|
+
if (proposed.checkpointNumber !== latestTip + 1) {
|
|
1093
|
+
throw new ProposedCheckpointNotSequentialError(proposed.checkpointNumber, latestTip);
|
|
1094
|
+
}
|
|
1095
|
+
// Ensure the predecessor block (from pending or confirmed chain) exists
|
|
1096
|
+
const previousBlock = await this.getPreviousCheckpointBlock(proposed.checkpointNumber);
|
|
1097
|
+
const blocks = [];
|
|
1098
|
+
for(let i = 0; i < proposed.blockCount; i++){
|
|
1099
|
+
const block = await this.getBlock({
|
|
1100
|
+
number: BlockNumber(proposed.startBlock + i)
|
|
1101
|
+
});
|
|
1102
|
+
if (!block) {
|
|
1103
|
+
throw new BlockNotFoundError(proposed.startBlock + i);
|
|
1104
|
+
}
|
|
1105
|
+
blocks.push(block);
|
|
1106
|
+
}
|
|
1107
|
+
this.validateCheckpointBlocks(blocks, previousBlock);
|
|
1108
|
+
const archive = blocks[blocks.length - 1].archive;
|
|
1109
|
+
const checkpointOutHash = Checkpoint.getCheckpointOutHash(blocks);
|
|
1110
|
+
await this.#proposedCheckpoints.set(proposed.checkpointNumber, {
|
|
1111
|
+
header: proposed.header.toBuffer(),
|
|
1112
|
+
archive: archive.toBuffer(),
|
|
1113
|
+
checkpointOutHash: checkpointOutHash.toBuffer(),
|
|
1114
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
1115
|
+
startBlock: proposed.startBlock,
|
|
1116
|
+
blockCount: proposed.blockCount,
|
|
1117
|
+
totalManaUsed: proposed.totalManaUsed.toString(),
|
|
1118
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
|
|
1119
|
+
});
|
|
1120
|
+
});
|
|
1121
|
+
}
|
|
729
1122
|
async getProvenCheckpointNumber() {
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
1123
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1124
|
+
const [latestCheckpointNumber, provenCheckpointNumber] = await Promise.all([
|
|
1125
|
+
this.getLatestCheckpointNumber(),
|
|
1126
|
+
this.#lastProvenCheckpoint.getAsync()
|
|
1127
|
+
]);
|
|
1128
|
+
return (provenCheckpointNumber ?? 0) > latestCheckpointNumber ? latestCheckpointNumber : CheckpointNumber(provenCheckpointNumber ?? 0);
|
|
1129
|
+
});
|
|
735
1130
|
}
|
|
736
1131
|
async setProvenCheckpointNumber(checkpointNumber) {
|
|
737
1132
|
const result = await this.#lastProvenCheckpoint.set(checkpointNumber);
|
|
738
1133
|
return result;
|
|
739
1134
|
}
|
|
1135
|
+
async getFinalizedCheckpointNumber() {
|
|
1136
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1137
|
+
const [provenCheckpointNumber, finalizedCheckpointNumber] = await Promise.all([
|
|
1138
|
+
this.getProvenCheckpointNumber(),
|
|
1139
|
+
this.#lastFinalizedCheckpoint.getAsync()
|
|
1140
|
+
]);
|
|
1141
|
+
return (finalizedCheckpointNumber ?? 0) > provenCheckpointNumber ? provenCheckpointNumber : CheckpointNumber(finalizedCheckpointNumber ?? 0);
|
|
1142
|
+
});
|
|
1143
|
+
}
|
|
1144
|
+
setFinalizedCheckpointNumber(checkpointNumber) {
|
|
1145
|
+
return this.#lastFinalizedCheckpoint.set(checkpointNumber);
|
|
1146
|
+
}
|
|
740
1147
|
#computeBlockRange(start, limit) {
|
|
741
1148
|
if (limit < 1) {
|
|
742
1149
|
throw new Error(`Invalid limit: ${limit}`);
|
|
@@ -770,4 +1177,70 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
770
1177
|
await this.#pendingChainValidationStatus.delete();
|
|
771
1178
|
}
|
|
772
1179
|
}
|
|
1180
|
+
/** Records a rejected-checkpoint entry, keyed by its own archive root. */ async addRejectedCheckpoint(entry) {
|
|
1181
|
+
const archiveRootHex = entry.archiveRoot.toString();
|
|
1182
|
+
await this.#rejectedCheckpoints.set(archiveRootHex, {
|
|
1183
|
+
checkpointNumber: entry.checkpointNumber,
|
|
1184
|
+
archiveRoot: entry.archiveRoot.toBuffer(),
|
|
1185
|
+
parentArchiveRoot: entry.parentArchiveRoot.toBuffer(),
|
|
1186
|
+
slotNumber: entry.slotNumber,
|
|
1187
|
+
l1: entry.l1.toBuffer(),
|
|
1188
|
+
reason: entry.reason
|
|
1189
|
+
});
|
|
1190
|
+
await this.#rejectedCheckpointsByNumber.set(entry.checkpointNumber, archiveRootHex);
|
|
1191
|
+
await this.advanceSynchedL1BlockNumber(entry.l1.blockNumber);
|
|
1192
|
+
}
|
|
1193
|
+
/** Returns the rejected-checkpoint entry with the given archive root, or undefined if not present. */ async getRejectedCheckpointByArchiveRoot(archiveRoot) {
|
|
1194
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRoot.toString());
|
|
1195
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1196
|
+
}
|
|
1197
|
+
/** Returns the rejected-checkpoint entry recorded for the given checkpoint number, or undefined if none. */ async getRejectedCheckpointByNumber(checkpointNumber) {
|
|
1198
|
+
const archiveRootHex = await this.#rejectedCheckpointsByNumber.getAsync(checkpointNumber);
|
|
1199
|
+
if (archiveRootHex === undefined) {
|
|
1200
|
+
return undefined;
|
|
1201
|
+
}
|
|
1202
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1203
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1204
|
+
}
|
|
1205
|
+
/** Returns the highest checkpoint number recorded across all rejected entries, or `INITIAL_CHECKPOINT_NUMBER - 1` if none. */ async getLatestRejectedCheckpointNumber() {
|
|
1206
|
+
const [latest] = await toArray(this.#rejectedCheckpointsByNumber.keysAsync({
|
|
1207
|
+
reverse: true,
|
|
1208
|
+
limit: 1
|
|
1209
|
+
}));
|
|
1210
|
+
return CheckpointNumber(latest ?? INITIAL_CHECKPOINT_NUMBER - 1);
|
|
1211
|
+
}
|
|
1212
|
+
/** Removes a rejected-checkpoint entry by its archive root (used when an entry no longer matches L1). */ async removeRejectedCheckpointByArchiveRoot(archiveRoot) {
|
|
1213
|
+
const archiveRootHex = archiveRoot.toString();
|
|
1214
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1215
|
+
await this.#rejectedCheckpoints.delete(archiveRootHex);
|
|
1216
|
+
if (stored) {
|
|
1217
|
+
// Only clear the by-number index if it still points at this archive root, so a distinct
|
|
1218
|
+
// entry that shares the checkpoint number (e.g. an L1 reorg replacement) is not dropped.
|
|
1219
|
+
const indexed = await this.#rejectedCheckpointsByNumber.getAsync(stored.checkpointNumber);
|
|
1220
|
+
if (indexed === archiveRootHex) {
|
|
1221
|
+
await this.#rejectedCheckpointsByNumber.delete(stored.checkpointNumber);
|
|
1222
|
+
}
|
|
1223
|
+
}
|
|
1224
|
+
}
|
|
1225
|
+
/**
|
|
1226
|
+
* Advances the stored last-synched L1 block number to `l1BlockNumber` only if it is strictly
|
|
1227
|
+
* greater than the current value. Use this whenever ingesting checkpoint-shaped data so the
|
|
1228
|
+
* sync pointer never walks backwards on out-of-order writes (e.g. an invalid checkpoint
|
|
1229
|
+
* advance followed by a valid-checkpoint commit landing at an earlier L1 block).
|
|
1230
|
+
*/ async advanceSynchedL1BlockNumber(l1BlockNumber) {
|
|
1231
|
+
const current = await this.#lastSynchedL1Block.getAsync();
|
|
1232
|
+
if (current === undefined || l1BlockNumber > current) {
|
|
1233
|
+
await this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
1234
|
+
}
|
|
1235
|
+
}
|
|
1236
|
+
rejectedCheckpointFromStorage(stored) {
|
|
1237
|
+
return {
|
|
1238
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
1239
|
+
archiveRoot: Fr.fromBuffer(stored.archiveRoot),
|
|
1240
|
+
parentArchiveRoot: Fr.fromBuffer(stored.parentArchiveRoot),
|
|
1241
|
+
slotNumber: SlotNumber(stored.slotNumber),
|
|
1242
|
+
l1: L1PublishedData.fromBuffer(stored.l1),
|
|
1243
|
+
reason: stored.reason
|
|
1244
|
+
};
|
|
1245
|
+
}
|
|
773
1246
|
}
|