@aztec/archiver 0.0.1-commit.2448fdb → 0.0.1-commit.2606882
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 -11
- package/dest/archiver.d.ts +53 -16
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +229 -68
- package/dest/config.d.ts +4 -1
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +21 -14
- package/dest/errors.d.ts +50 -2
- package/dest/errors.d.ts.map +1 -1
- package/dest/errors.js +74 -2
- package/dest/factory.d.ts +13 -7
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +33 -24
- 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 +2 -1
- package/dest/l1/calldata_retriever.d.ts.map +1 -1
- package/dest/l1/calldata_retriever.js +15 -5
- package/dest/l1/data_retrieval.d.ts +24 -12
- package/dest/l1/data_retrieval.d.ts.map +1 -1
- package/dest/l1/data_retrieval.js +36 -37
- 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 +40 -0
- package/dest/modules/data_source_base.d.ts +71 -47
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +269 -137
- package/dest/modules/data_store_updater.d.ts +30 -13
- package/dest/modules/data_store_updater.d.ts.map +1 -1
- package/dest/modules/data_store_updater.js +126 -109
- package/dest/modules/instrumentation.d.ts +18 -2
- package/dest/modules/instrumentation.d.ts.map +1 -1
- package/dest/modules/instrumentation.js +35 -7
- package/dest/modules/l1_synchronizer.d.ts +11 -6
- package/dest/modules/l1_synchronizer.d.ts.map +1 -1
- package/dest/modules/l1_synchronizer.js +418 -216
- package/dest/modules/outbox_trees_resolver.d.ts +62 -0
- package/dest/modules/outbox_trees_resolver.d.ts.map +1 -0
- package/dest/modules/outbox_trees_resolver.js +162 -0
- package/dest/modules/validation.d.ts +4 -3
- package/dest/modules/validation.d.ts.map +1 -1
- package/dest/modules/validation.js +6 -6
- package/dest/store/block_store.d.ts +164 -66
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +605 -235
- 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 +18 -66
- 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 +31 -0
- 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 +259 -443
- package/dest/store/log_store_codec.d.ts +70 -0
- package/dest/store/log_store_codec.d.ts.map +1 -0
- package/dest/store/log_store_codec.js +101 -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 +50 -8
- package/dest/test/fake_l1_state.d.ts +8 -3
- package/dest/test/fake_l1_state.d.ts.map +1 -1
- package/dest/test/fake_l1_state.js +75 -18
- package/dest/test/mock_l1_to_l2_message_source.d.ts +1 -1
- package/dest/test/mock_l1_to_l2_message_source.d.ts.map +1 -1
- package/dest/test/mock_l1_to_l2_message_source.js +2 -1
- package/dest/test/mock_l2_block_source.d.ts +51 -50
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +244 -181
- package/dest/test/noop_l1_archiver.d.ts +10 -6
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +22 -9
- package/package.json +14 -14
- package/src/archiver.ts +293 -75
- package/src/config.ts +24 -11
- package/src/errors.ts +117 -2
- package/src/factory.ts +40 -23
- package/src/index.ts +18 -2
- package/src/l1/calldata_retriever.ts +16 -5
- package/src/l1/data_retrieval.ts +52 -53
- package/src/l1/validate_historical_logs.ts +140 -0
- package/src/modules/contract_data_source_adapter.ts +55 -0
- package/src/modules/data_source_base.ts +341 -174
- package/src/modules/data_store_updater.ts +152 -137
- package/src/modules/instrumentation.ts +48 -8
- package/src/modules/l1_synchronizer.ts +556 -262
- package/src/modules/outbox_trees_resolver.ts +199 -0
- package/src/modules/validation.ts +10 -9
- package/src/store/block_store.ts +750 -285
- package/src/store/contract_class_store.ts +24 -100
- package/src/store/contract_instance_store.ts +43 -0
- 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 +297 -609
- package/src/store/log_store_codec.ts +132 -0
- package/src/store/message_store.ts +59 -9
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +96 -29
- package/src/test/mock_l1_to_l2_message_source.ts +1 -0
- package/src/test/mock_l2_block_source.ts +299 -232
- package/src/test/noop_l1_archiver.ts +42 -9
- package/dest/store/kv_archiver_store.d.ts +0 -362
- package/dest/store/kv_archiver_store.d.ts.map +0 -1
- package/dest/store/kv_archiver_store.js +0 -475
- package/src/store/kv_archiver_store.ts +0 -685
|
@@ -1,25 +1,24 @@
|
|
|
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';
|
|
11
|
-
import { getEpochAtSlot } from '@aztec/stdlib/epoch-helpers';
|
|
9
|
+
import { BlockHash, Body, CommitteeAttestation, GENESIS_CHECKPOINT_HEADER_HASH, L2Block, deserializeValidateCheckpointResult, serializeValidateCheckpointResult } from '@aztec/stdlib/block';
|
|
10
|
+
import { Checkpoint, L1PublishedData } from '@aztec/stdlib/checkpoint';
|
|
12
11
|
import { CheckpointHeader } from '@aztec/stdlib/rollup';
|
|
13
12
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
14
|
-
import { BlockHeader, TxHash,
|
|
15
|
-
import { BlockAlreadyCheckpointedError, BlockArchiveNotConsistentError, BlockIndexNotSequentialError, BlockNotFoundError, BlockNumberNotSequentialError, CannotOverwriteCheckpointedBlockError, CheckpointNotFoundError, CheckpointNumberNotSequentialError, InitialCheckpointNumberNotSequentialError } from '../errors.js';
|
|
16
|
-
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';
|
|
17
15
|
/**
|
|
18
16
|
* LMDB-based block storage for the archiver.
|
|
19
17
|
*/ export class BlockStore {
|
|
20
18
|
db;
|
|
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;
|
|
@@ -30,6 +29,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
30
29
|
/** Index mapping a contract's address (as a string) to its location in a block */ #contractIndex;
|
|
31
30
|
/** Index mapping block hash to block number */ #blockHashIndex;
|
|
32
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;
|
|
33
34
|
#log;
|
|
34
35
|
constructor(db){
|
|
35
36
|
this.db = db;
|
|
@@ -46,6 +47,9 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
46
47
|
this.#pendingChainValidationStatus = db.openSingleton('archiver_pending_chain_validation_status');
|
|
47
48
|
this.#checkpoints = db.openMap('archiver_checkpoints');
|
|
48
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');
|
|
49
53
|
}
|
|
50
54
|
/**
|
|
51
55
|
* Returns the finalized L2 block number. An L2 block is finalized when it was proven
|
|
@@ -75,13 +79,15 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
75
79
|
const blockIndex = block.indexWithinCheckpoint;
|
|
76
80
|
const blockLastArchive = block.header.lastArchive.root;
|
|
77
81
|
// Extract the latest block and checkpoint numbers
|
|
78
|
-
const previousBlockNumber = await this.
|
|
79
|
-
const
|
|
82
|
+
const previousBlockNumber = await this.getLatestL2BlockNumber();
|
|
83
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
80
84
|
// Verify we're not overwriting checkpointed blocks
|
|
81
85
|
const lastCheckpointedBlockNumber = await this.getCheckpointedL2BlockNumber();
|
|
82
86
|
if (!opts.force && blockNumber <= lastCheckpointedBlockNumber) {
|
|
83
87
|
// Check if the proposed block matches the already-checkpointed one
|
|
84
|
-
const existingBlock = await this.
|
|
88
|
+
const existingBlock = await this.getBlockData({
|
|
89
|
+
number: BlockNumber(blockNumber)
|
|
90
|
+
});
|
|
85
91
|
if (existingBlock && existingBlock.archive.root.equals(block.archive.root)) {
|
|
86
92
|
throw new BlockAlreadyCheckpointedError(blockNumber);
|
|
87
93
|
}
|
|
@@ -91,12 +97,22 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
91
97
|
if (!opts.force && previousBlockNumber !== blockNumber - 1) {
|
|
92
98
|
throw new BlockNumberNotSequentialError(blockNumber, previousBlockNumber);
|
|
93
99
|
}
|
|
94
|
-
//
|
|
95
|
-
|
|
96
|
-
|
|
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);
|
|
97
111
|
}
|
|
98
112
|
// Extract the previous block if there is one and see if it is for the same checkpoint or not
|
|
99
|
-
const previousBlockResult = await this.
|
|
113
|
+
const previousBlockResult = await this.getBlockData({
|
|
114
|
+
number: previousBlockNumber
|
|
115
|
+
});
|
|
100
116
|
let expectedBlockIndex = 0;
|
|
101
117
|
let previousBlockIndex = undefined;
|
|
102
118
|
if (previousBlockResult !== undefined) {
|
|
@@ -106,7 +122,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
106
122
|
expectedBlockIndex = previousBlockIndex + 1;
|
|
107
123
|
}
|
|
108
124
|
if (!previousBlockResult.archive.root.equals(blockLastArchive)) {
|
|
109
|
-
throw new BlockArchiveNotConsistentError(blockNumber, previousBlockResult.
|
|
125
|
+
throw new BlockArchiveNotConsistentError(blockNumber, previousBlockResult.header.globalVariables.blockNumber, blockLastArchive, previousBlockResult.archive.root);
|
|
110
126
|
}
|
|
111
127
|
}
|
|
112
128
|
// Now check that the block has the expected index value
|
|
@@ -118,7 +134,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
118
134
|
});
|
|
119
135
|
}
|
|
120
136
|
/**
|
|
121
|
-
* Append new
|
|
137
|
+
* Append new checkpoints to the store's list.
|
|
122
138
|
* @param checkpoints - The L2 checkpoints to be added to the store.
|
|
123
139
|
* @returns True if the operation is successful.
|
|
124
140
|
*/ async addCheckpoints(checkpoints, opts = {}) {
|
|
@@ -144,27 +160,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
144
160
|
} else if (previousCheckpointNumber !== firstCheckpointNumber - 1 && !opts.force) {
|
|
145
161
|
throw new InitialCheckpointNumberNotSequentialError(firstCheckpointNumber, previousCheckpointNumber);
|
|
146
162
|
}
|
|
147
|
-
//
|
|
148
|
-
|
|
149
|
-
let previousCheckpointData = undefined;
|
|
150
|
-
if (currentFirstCheckpointNumber - 1 !== INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
151
|
-
// There should be a previous checkpoint
|
|
152
|
-
previousCheckpointData = await this.getCheckpointData(CheckpointNumber(currentFirstCheckpointNumber - 1));
|
|
153
|
-
if (previousCheckpointData === undefined) {
|
|
154
|
-
throw new CheckpointNotFoundError(CheckpointNumber(currentFirstCheckpointNumber - 1));
|
|
155
|
-
}
|
|
156
|
-
}
|
|
157
|
-
let previousBlockNumber = undefined;
|
|
158
|
-
let previousBlock = undefined;
|
|
159
|
-
// If we have a previous checkpoint then we need to get the previous block number
|
|
160
|
-
if (previousCheckpointData !== undefined) {
|
|
161
|
-
previousBlockNumber = BlockNumber(previousCheckpointData.startBlock + previousCheckpointData.blockCount - 1);
|
|
162
|
-
previousBlock = await this.getBlock(previousBlockNumber);
|
|
163
|
-
if (previousBlock === undefined) {
|
|
164
|
-
// We should be able to get the required previous block
|
|
165
|
-
throw new BlockNotFoundError(previousBlockNumber);
|
|
166
|
-
}
|
|
167
|
-
}
|
|
163
|
+
// Get the last block of the previous checkpoint for archive chaining
|
|
164
|
+
let previousBlock = await this.getPreviousCheckpointBlock(checkpoints[0].checkpoint.number);
|
|
168
165
|
// Iterate over checkpoints array and insert them, checking that the block numbers are sequential.
|
|
169
166
|
let previousCheckpoint = undefined;
|
|
170
167
|
for (const checkpoint of checkpoints){
|
|
@@ -172,33 +169,13 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
172
169
|
throw new CheckpointNumberNotSequentialError(checkpoint.checkpoint.number, previousCheckpoint.checkpoint.number);
|
|
173
170
|
}
|
|
174
171
|
previousCheckpoint = checkpoint;
|
|
175
|
-
//
|
|
172
|
+
// Validate block sequencing, indexes, and archive chaining
|
|
173
|
+
this.validateCheckpointBlocks(checkpoint.checkpoint.blocks, previousBlock);
|
|
174
|
+
// Store every block in the database (may already exist, but L1 data is authoritative)
|
|
176
175
|
for(let i = 0; i < checkpoint.checkpoint.blocks.length; i++){
|
|
177
|
-
|
|
178
|
-
if (previousBlock) {
|
|
179
|
-
// The blocks should have a sequential block number
|
|
180
|
-
if (previousBlock.number !== block.number - 1) {
|
|
181
|
-
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
182
|
-
}
|
|
183
|
-
// If the blocks are for the same checkpoint then they should have sequential indexes
|
|
184
|
-
if (previousBlock.checkpointNumber === block.checkpointNumber && previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
|
|
185
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
186
|
-
}
|
|
187
|
-
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
188
|
-
throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
|
|
189
|
-
}
|
|
190
|
-
} else {
|
|
191
|
-
// No previous block, must be block 1 at checkpoint index 0
|
|
192
|
-
if (block.indexWithinCheckpoint !== 0) {
|
|
193
|
-
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
194
|
-
}
|
|
195
|
-
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
196
|
-
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
197
|
-
}
|
|
198
|
-
}
|
|
199
|
-
previousBlock = block;
|
|
200
|
-
await this.addBlockToDatabase(block, checkpoint.checkpoint.number, i);
|
|
176
|
+
await this.addBlockToDatabase(checkpoint.checkpoint.blocks[i], checkpoint.checkpoint.number, i);
|
|
201
177
|
}
|
|
178
|
+
previousBlock = checkpoint.checkpoint.blocks.at(-1);
|
|
202
179
|
// Store the checkpoint in the database
|
|
203
180
|
await this.#checkpoints.set(checkpoint.checkpoint.number, {
|
|
204
181
|
header: checkpoint.checkpoint.header.toBuffer(),
|
|
@@ -208,12 +185,18 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
208
185
|
attestations: checkpoint.attestations.map((attestation)=>attestation.toBuffer()),
|
|
209
186
|
checkpointNumber: checkpoint.checkpoint.number,
|
|
210
187
|
startBlock: checkpoint.checkpoint.blocks[0].number,
|
|
211
|
-
blockCount: checkpoint.checkpoint.blocks.length
|
|
188
|
+
blockCount: checkpoint.checkpoint.blocks.length,
|
|
189
|
+
feeAssetPriceModifier: checkpoint.checkpoint.feeAssetPriceModifier.toString()
|
|
212
190
|
});
|
|
213
191
|
// Update slot-to-checkpoint index
|
|
214
192
|
await this.#slotToCheckpoint.set(checkpoint.checkpoint.header.slotNumber, checkpoint.checkpoint.number);
|
|
193
|
+
// Remove proposed checkpoint if it exists, since L1 is authoritative
|
|
194
|
+
await this.#proposedCheckpoints.delete(checkpoint.checkpoint.number);
|
|
195
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
196
|
+
// (e.g. invalid attestations) is now being ingested as valid, so its descendants are allowed.
|
|
197
|
+
await this.removeRejectedCheckpointByArchiveRoot(checkpoint.checkpoint.archive.root);
|
|
215
198
|
}
|
|
216
|
-
await this
|
|
199
|
+
await this.advanceSynchedL1BlockNumber(checkpoints[checkpoints.length - 1].l1.blockNumber);
|
|
217
200
|
return true;
|
|
218
201
|
});
|
|
219
202
|
}
|
|
@@ -242,13 +225,67 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
242
225
|
attestations: incoming.attestations.map((a)=>a.toBuffer()),
|
|
243
226
|
checkpointNumber: incoming.checkpoint.number,
|
|
244
227
|
startBlock: incoming.checkpoint.blocks[0].number,
|
|
245
|
-
blockCount: incoming.checkpoint.blocks.length
|
|
228
|
+
blockCount: incoming.checkpoint.blocks.length,
|
|
229
|
+
feeAssetPriceModifier: incoming.checkpoint.feeAssetPriceModifier.toString()
|
|
246
230
|
});
|
|
247
231
|
// Update the sync point to reflect the new L1 block
|
|
248
|
-
await this
|
|
232
|
+
await this.advanceSynchedL1BlockNumber(incoming.l1.blockNumber);
|
|
249
233
|
}
|
|
250
234
|
return checkpoints.slice(i);
|
|
251
235
|
}
|
|
236
|
+
/**
|
|
237
|
+
* Gets the last block of the checkpoint before the given one.
|
|
238
|
+
* Returns undefined if there is no previous checkpoint (i.e. genesis).
|
|
239
|
+
*/ async getPreviousCheckpointBlock(checkpointNumber) {
|
|
240
|
+
const previousCheckpointNumber = CheckpointNumber(checkpointNumber - 1);
|
|
241
|
+
if (previousCheckpointNumber === INITIAL_CHECKPOINT_NUMBER - 1) {
|
|
242
|
+
return undefined;
|
|
243
|
+
}
|
|
244
|
+
// Check across both proposed and mined checkpoints
|
|
245
|
+
const predecessor = await this.getProposedCheckpointByNumber(previousCheckpointNumber) ?? await this.getCheckpointData(previousCheckpointNumber);
|
|
246
|
+
if (!predecessor) {
|
|
247
|
+
throw new CheckpointNotFoundError(previousCheckpointNumber);
|
|
248
|
+
}
|
|
249
|
+
const previousBlockNumber = BlockNumber(predecessor.startBlock + predecessor.blockCount - 1);
|
|
250
|
+
const previousBlock = await this.getBlock({
|
|
251
|
+
number: previousBlockNumber
|
|
252
|
+
});
|
|
253
|
+
if (previousBlock === undefined) {
|
|
254
|
+
throw new BlockNotFoundError(previousBlockNumber);
|
|
255
|
+
}
|
|
256
|
+
return previousBlock;
|
|
257
|
+
}
|
|
258
|
+
/**
|
|
259
|
+
* Validates that blocks are sequential, have correct indexes, and chain via archive roots.
|
|
260
|
+
* This is the same validation used for both confirmed checkpoints (addCheckpoints) and
|
|
261
|
+
* proposed checkpoints (addProposedCheckpoint).
|
|
262
|
+
*/ validateCheckpointBlocks(blocks, previousBlock) {
|
|
263
|
+
for (const block of blocks){
|
|
264
|
+
if (previousBlock) {
|
|
265
|
+
if (previousBlock.number !== block.number - 1) {
|
|
266
|
+
throw new BlockNumberNotSequentialError(block.number, previousBlock.number);
|
|
267
|
+
}
|
|
268
|
+
if (previousBlock.checkpointNumber === block.checkpointNumber) {
|
|
269
|
+
if (previousBlock.indexWithinCheckpoint !== block.indexWithinCheckpoint - 1) {
|
|
270
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
271
|
+
}
|
|
272
|
+
} else if (block.indexWithinCheckpoint !== 0) {
|
|
273
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, previousBlock.indexWithinCheckpoint);
|
|
274
|
+
}
|
|
275
|
+
if (!previousBlock.archive.root.equals(block.header.lastArchive.root)) {
|
|
276
|
+
throw new BlockArchiveNotConsistentError(block.number, previousBlock.number, block.header.lastArchive.root, previousBlock.archive.root);
|
|
277
|
+
}
|
|
278
|
+
} else {
|
|
279
|
+
if (block.indexWithinCheckpoint !== 0) {
|
|
280
|
+
throw new BlockIndexNotSequentialError(block.indexWithinCheckpoint, undefined);
|
|
281
|
+
}
|
|
282
|
+
if (block.number !== INITIAL_L2_BLOCK_NUM) {
|
|
283
|
+
throw new BlockNumberNotSequentialError(block.number, undefined);
|
|
284
|
+
}
|
|
285
|
+
}
|
|
286
|
+
previousBlock = block;
|
|
287
|
+
}
|
|
288
|
+
}
|
|
252
289
|
async addBlockToDatabase(block, checkpointNumber, indexWithinCheckpoint) {
|
|
253
290
|
const blockHash = await block.hash();
|
|
254
291
|
await this.#blocks.set(block.number, {
|
|
@@ -263,7 +300,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
263
300
|
data: block.body.txEffects[i],
|
|
264
301
|
l2BlockNumber: block.number,
|
|
265
302
|
l2BlockHash: blockHash,
|
|
266
|
-
txIndexInBlock: i
|
|
303
|
+
txIndexInBlock: i,
|
|
304
|
+
slotNumber: block.header.globalVariables.slotNumber
|
|
267
305
|
};
|
|
268
306
|
await this.#txEffects.set(txEffect.data.txHash.toString(), serializeIndexedTxEffect(txEffect));
|
|
269
307
|
}
|
|
@@ -326,6 +364,8 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
326
364
|
await this.#checkpoints.delete(c);
|
|
327
365
|
this.#log.debug(`Removed checkpoint ${c}`);
|
|
328
366
|
}
|
|
367
|
+
// Evict all pending checkpoints > checkpointNumber (their base chain no longer exists)
|
|
368
|
+
await this.evictProposedCheckpointsFrom(CheckpointNumber(checkpointNumber + 1));
|
|
329
369
|
return {
|
|
330
370
|
blocksRemoved
|
|
331
371
|
};
|
|
@@ -362,6 +402,20 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
362
402
|
}
|
|
363
403
|
return result;
|
|
364
404
|
}
|
|
405
|
+
/**
|
|
406
|
+
* Returns the checkpoint numbers for all checkpoints whose slot falls within the given range (inclusive).
|
|
407
|
+
* Lighter than {@link getCheckpointDataForSlotRange} when callers only need to identify which
|
|
408
|
+
* checkpoints fall in the range and will fetch full data for at most a few of them.
|
|
409
|
+
*/ async getCheckpointNumbersForSlotRange(startSlot, endSlot) {
|
|
410
|
+
const result = [];
|
|
411
|
+
for await (const [, checkpointNumber] of this.#slotToCheckpoint.entriesAsync({
|
|
412
|
+
start: startSlot,
|
|
413
|
+
end: endSlot + 1
|
|
414
|
+
})){
|
|
415
|
+
result.push(CheckpointNumber(checkpointNumber));
|
|
416
|
+
}
|
|
417
|
+
return result;
|
|
418
|
+
}
|
|
365
419
|
checkpointDataFromCheckpointStorage(checkpointStorage) {
|
|
366
420
|
return {
|
|
367
421
|
header: CheckpointHeader.fromBuffer(checkpointStorage.header),
|
|
@@ -370,6 +424,7 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
370
424
|
checkpointNumber: CheckpointNumber(checkpointStorage.checkpointNumber),
|
|
371
425
|
startBlock: BlockNumber(checkpointStorage.startBlock),
|
|
372
426
|
blockCount: checkpointStorage.blockCount,
|
|
427
|
+
feeAssetPriceModifier: BigInt(checkpointStorage.feeAssetPriceModifier),
|
|
373
428
|
l1: L1PublishedData.fromBuffer(checkpointStorage.l1),
|
|
374
429
|
attestations: checkpointStorage.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf))
|
|
375
430
|
};
|
|
@@ -418,10 +473,12 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
418
473
|
return await this.db.transactionAsync(async ()=>{
|
|
419
474
|
const removedBlocks = [];
|
|
420
475
|
// Get the latest block number to determine the range
|
|
421
|
-
const latestBlockNumber = await this.
|
|
476
|
+
const latestBlockNumber = await this.getLatestL2BlockNumber();
|
|
422
477
|
// Iterate from blockNumber + 1 to latestBlockNumber
|
|
423
478
|
for(let bn = blockNumber + 1; bn <= latestBlockNumber; bn++){
|
|
424
|
-
const block = await this.getBlock(
|
|
479
|
+
const block = await this.getBlock({
|
|
480
|
+
number: BlockNumber(bn)
|
|
481
|
+
});
|
|
425
482
|
if (block === undefined) {
|
|
426
483
|
this.#log.warn(`Cannot remove block ${bn} from the store since we don't have it`);
|
|
427
484
|
continue;
|
|
@@ -445,13 +502,6 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
445
502
|
return BlockNumber(checkpointStorage.startBlock + checkpointStorage.blockCount - 1);
|
|
446
503
|
}
|
|
447
504
|
}
|
|
448
|
-
async getLatestBlockNumber() {
|
|
449
|
-
const [latestBlocknumber] = await toArray(this.#blocks.keysAsync({
|
|
450
|
-
reverse: true,
|
|
451
|
-
limit: 1
|
|
452
|
-
}));
|
|
453
|
-
return typeof latestBlocknumber === 'number' ? BlockNumber(latestBlocknumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
454
|
-
}
|
|
455
505
|
async getLatestCheckpointNumber() {
|
|
456
506
|
const [latestCheckpointNumber] = await toArray(this.#checkpoints.keysAsync({
|
|
457
507
|
reverse: true,
|
|
@@ -462,143 +512,171 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
462
512
|
}
|
|
463
513
|
return CheckpointNumber(latestCheckpointNumber);
|
|
464
514
|
}
|
|
465
|
-
async
|
|
466
|
-
const
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
|
|
470
|
-
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
const block = await this.getBlockFromBlockStorage(number, blockStorage);
|
|
475
|
-
if (!block) {
|
|
476
|
-
return undefined;
|
|
515
|
+
async hasProposedCheckpoint() {
|
|
516
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
517
|
+
limit: 1
|
|
518
|
+
}));
|
|
519
|
+
return key !== undefined;
|
|
520
|
+
}
|
|
521
|
+
/** Deletes all pending proposed checkpoints from storage. */ async deleteProposedCheckpoints() {
|
|
522
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()){
|
|
523
|
+
await this.#proposedCheckpoints.delete(key);
|
|
477
524
|
}
|
|
478
|
-
return new CheckpointedL2Block(CheckpointNumber(checkpoint.checkpointNumber), block, L1PublishedData.fromBuffer(checkpoint.l1), checkpoint.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf)));
|
|
479
525
|
}
|
|
480
526
|
/**
|
|
481
|
-
*
|
|
482
|
-
*
|
|
483
|
-
*
|
|
484
|
-
* @
|
|
485
|
-
|
|
486
|
-
|
|
487
|
-
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
491
|
-
|
|
492
|
-
|
|
493
|
-
const checkpointedBlock = new CheckpointedL2Block(CheckpointNumber(checkpoint.checkpointNumber), block, L1PublishedData.fromBuffer(checkpoint.l1), checkpoint.attestations.map((buf)=>CommitteeAttestation.fromBuffer(buf)));
|
|
494
|
-
yield checkpointedBlock;
|
|
495
|
-
}
|
|
527
|
+
* Promotes a specific pending checkpoint to a confirmed checkpoint entry.
|
|
528
|
+
* This persists the checkpoint to the store, removes only that pending entry, and updates the L1 sync point.
|
|
529
|
+
* Remaining pending entries (e.g. N+1, N+2) are left intact — they chain off the just-promoted one.
|
|
530
|
+
* @param checkpointNumber - The checkpoint number to promote.
|
|
531
|
+
* @param l1 - L1 published data for the checkpoint.
|
|
532
|
+
* @param attestations - Committee attestations.
|
|
533
|
+
* @param expectedArchiveRoot - Archive root guard against races.
|
|
534
|
+
*/ async promoteProposedToCheckpointed(checkpointNumber, l1, attestations, expectedArchiveRoot) {
|
|
535
|
+
return await this.db.transactionAsync(async ()=>{
|
|
536
|
+
const proposed = await this.getProposedCheckpointByNumber(checkpointNumber);
|
|
537
|
+
if (!proposed) {
|
|
538
|
+
throw new NoProposedCheckpointToPromoteError();
|
|
496
539
|
}
|
|
497
|
-
|
|
540
|
+
if (!proposed.archive.root.equals(expectedArchiveRoot)) {
|
|
541
|
+
throw new ProposedCheckpointArchiveRootMismatchError(expectedArchiveRoot, proposed.archive.root);
|
|
542
|
+
}
|
|
543
|
+
// Verify sequentiality: promoted checkpoint must follow the latest confirmed one
|
|
544
|
+
const latestCheckpointNumber = await this.getLatestCheckpointNumber();
|
|
545
|
+
if (latestCheckpointNumber !== proposed.checkpointNumber - 1) {
|
|
546
|
+
throw new ProposedCheckpointPromotionNotSequentialError(proposed.checkpointNumber, latestCheckpointNumber);
|
|
547
|
+
}
|
|
548
|
+
// Write the checkpoint entry
|
|
549
|
+
await this.#checkpoints.set(proposed.checkpointNumber, {
|
|
550
|
+
header: proposed.header.toBuffer(),
|
|
551
|
+
archive: proposed.archive.toBuffer(),
|
|
552
|
+
checkpointOutHash: proposed.checkpointOutHash.toBuffer(),
|
|
553
|
+
l1: l1.toBuffer(),
|
|
554
|
+
attestations: attestations.map((attestation)=>attestation.toBuffer()),
|
|
555
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
556
|
+
startBlock: proposed.startBlock,
|
|
557
|
+
blockCount: proposed.blockCount,
|
|
558
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
|
|
559
|
+
});
|
|
560
|
+
// Update the slot-to-checkpoint index
|
|
561
|
+
await this.#slotToCheckpoint.set(proposed.header.slotNumber, proposed.checkpointNumber);
|
|
562
|
+
// Remove only this pending entry — remaining entries N+1, N+2, ... stay valid
|
|
563
|
+
await this.#proposedCheckpoints.delete(proposed.checkpointNumber);
|
|
564
|
+
// Drop any rejected entry for this archive root: a checkpoint that was previously rejected
|
|
565
|
+
// (e.g. invalid attestations) is now being promoted as valid, so its descendants are allowed.
|
|
566
|
+
await this.removeRejectedCheckpointByArchiveRoot(proposed.archive.root);
|
|
567
|
+
// Update the last synced L1 block
|
|
568
|
+
await this.advanceSynchedL1BlockNumber(l1.blockNumber);
|
|
569
|
+
});
|
|
498
570
|
}
|
|
499
|
-
|
|
500
|
-
|
|
501
|
-
|
|
571
|
+
/**
|
|
572
|
+
* Returns the latest pending checkpoint (highest-numbered entry), or undefined if none.
|
|
573
|
+
* No fallback to confirmed.
|
|
574
|
+
*/ async getLastProposedCheckpoint() {
|
|
575
|
+
const [key] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
576
|
+
reverse: true,
|
|
577
|
+
limit: 1
|
|
578
|
+
}));
|
|
579
|
+
if (key === undefined) {
|
|
502
580
|
return undefined;
|
|
503
581
|
}
|
|
504
|
-
|
|
582
|
+
const stored = await this.#proposedCheckpoints.getAsync(key);
|
|
583
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
505
584
|
}
|
|
506
|
-
async
|
|
507
|
-
const
|
|
508
|
-
|
|
509
|
-
return undefined;
|
|
510
|
-
}
|
|
511
|
-
return this.getCheckpointedBlock(BlockNumber(blockNumber));
|
|
585
|
+
/** Returns the pending checkpoint for a specific checkpoint number, or undefined if not found. */ async getProposedCheckpointByNumber(n) {
|
|
586
|
+
const stored = await this.#proposedCheckpoints.getAsync(n);
|
|
587
|
+
return stored ? this.convertToProposedCheckpointData(stored) : undefined;
|
|
512
588
|
}
|
|
513
589
|
/**
|
|
514
|
-
*
|
|
515
|
-
*
|
|
516
|
-
*
|
|
517
|
-
|
|
518
|
-
|
|
519
|
-
|
|
520
|
-
|
|
521
|
-
|
|
522
|
-
yield block;
|
|
590
|
+
* Returns the pending checkpoint whose header slot matches the given slot, or undefined if not found.
|
|
591
|
+
* Iterates `#proposedCheckpoints` rather than reading an index because the map carries 0–1 entries
|
|
592
|
+
* in normal operation (bounded by the proposer pipelining window). Returns the first match.
|
|
593
|
+
*/ async getProposedCheckpointBySlot(slot) {
|
|
594
|
+
for await (const [, stored] of this.#proposedCheckpoints.entriesAsync()){
|
|
595
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
596
|
+
if (header.slotNumber === slot) {
|
|
597
|
+
return this.convertToProposedCheckpointData(stored);
|
|
523
598
|
}
|
|
524
599
|
}
|
|
600
|
+
return undefined;
|
|
525
601
|
}
|
|
526
602
|
/**
|
|
527
|
-
*
|
|
528
|
-
*
|
|
529
|
-
*
|
|
530
|
-
*/ async
|
|
531
|
-
const
|
|
532
|
-
|
|
533
|
-
|
|
603
|
+
* Evicts all pending checkpoints with checkpoint number >= fromNumber.
|
|
604
|
+
* Used for divergent-mined-checkpoint cleanup: when L1 mines checkpoint N with a different archive,
|
|
605
|
+
* all pending >= N must be evicted since they chain off the now-invalid pending N.
|
|
606
|
+
*/ async evictProposedCheckpointsFrom(fromNumber) {
|
|
607
|
+
const keysToDelete = [];
|
|
608
|
+
for await (const key of this.#proposedCheckpoints.keysAsync()){
|
|
609
|
+
if (key >= fromNumber) {
|
|
610
|
+
keysToDelete.push(key);
|
|
611
|
+
}
|
|
534
612
|
}
|
|
535
|
-
|
|
536
|
-
|
|
537
|
-
/**
|
|
538
|
-
* Gets block metadata (without tx data) by archive root.
|
|
539
|
-
* @param archive - The archive root of the block to return.
|
|
540
|
-
* @returns The requested block data.
|
|
541
|
-
*/ async getBlockDataByArchive(archive) {
|
|
542
|
-
const blockNumber = await this.#blockArchiveIndex.getAsync(archive.toString());
|
|
543
|
-
if (blockNumber === undefined) {
|
|
544
|
-
return undefined;
|
|
613
|
+
for (const key of keysToDelete){
|
|
614
|
+
await this.#proposedCheckpoints.delete(key);
|
|
545
615
|
}
|
|
546
|
-
return this.getBlockData(BlockNumber(blockNumber));
|
|
547
616
|
}
|
|
548
617
|
/**
|
|
549
|
-
* Gets
|
|
550
|
-
*
|
|
551
|
-
*
|
|
552
|
-
*/ async
|
|
553
|
-
const
|
|
554
|
-
if (!
|
|
555
|
-
return
|
|
618
|
+
* Gets the checkpoint at the proposed tip:
|
|
619
|
+
* - latest pending checkpoint if any exist
|
|
620
|
+
* - fallsback to latest confirmed checkpoint otherwise
|
|
621
|
+
*/ async getLastCheckpoint() {
|
|
622
|
+
const latest = await this.getLastProposedCheckpoint();
|
|
623
|
+
if (!latest) {
|
|
624
|
+
return this.getCheckpointData(await this.getLatestCheckpointNumber());
|
|
556
625
|
}
|
|
557
|
-
return
|
|
626
|
+
return latest;
|
|
627
|
+
}
|
|
628
|
+
convertToProposedCheckpointData(stored) {
|
|
629
|
+
return {
|
|
630
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
631
|
+
header: CheckpointHeader.fromBuffer(stored.header),
|
|
632
|
+
archive: AppendOnlyTreeSnapshot.fromBuffer(stored.archive),
|
|
633
|
+
checkpointOutHash: Fr.fromBuffer(stored.checkpointOutHash),
|
|
634
|
+
startBlock: BlockNumber(stored.startBlock),
|
|
635
|
+
blockCount: stored.blockCount,
|
|
636
|
+
totalManaUsed: BigInt(stored.totalManaUsed),
|
|
637
|
+
feeAssetPriceModifier: BigInt(stored.feeAssetPriceModifier)
|
|
638
|
+
};
|
|
558
639
|
}
|
|
559
640
|
/**
|
|
560
|
-
*
|
|
561
|
-
* @
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
return undefined;
|
|
641
|
+
* Attempts to get the proposedCheckpoint's number, if there is not one, then fallback to the latest confirmed checkpoint number.
|
|
642
|
+
* @returns CheckpointNumber
|
|
643
|
+
*/ async getProposedCheckpointNumber() {
|
|
644
|
+
const proposed = await this.getLastCheckpoint();
|
|
645
|
+
if (!proposed) {
|
|
646
|
+
return await this.getLatestCheckpointNumber();
|
|
567
647
|
}
|
|
568
|
-
return
|
|
648
|
+
return CheckpointNumber(proposed.checkpointNumber);
|
|
569
649
|
}
|
|
570
650
|
/**
|
|
571
|
-
*
|
|
572
|
-
* @
|
|
573
|
-
|
|
574
|
-
|
|
575
|
-
|
|
576
|
-
|
|
577
|
-
return undefined;
|
|
651
|
+
* Attempts to get the proposedCheckpoint's block number, if there is not one, then fallback to the checkpointed block number
|
|
652
|
+
* @returns BlockNumber
|
|
653
|
+
*/ async getProposedCheckpointL2BlockNumber() {
|
|
654
|
+
const proposed = await this.getLastCheckpoint();
|
|
655
|
+
if (!proposed) {
|
|
656
|
+
return await this.getCheckpointedL2BlockNumber();
|
|
578
657
|
}
|
|
579
|
-
return
|
|
658
|
+
return BlockNumber(proposed.startBlock + proposed.blockCount - 1);
|
|
580
659
|
}
|
|
581
|
-
/**
|
|
582
|
-
|
|
583
|
-
|
|
584
|
-
|
|
585
|
-
|
|
586
|
-
const blockNumber = await this
|
|
660
|
+
/** Returns the checkpoint number that contains the given slot (or undefined if not found). */ async getCheckpointNumberBySlot(slot) {
|
|
661
|
+
const checkpointNumber = await this.#slotToCheckpoint.getAsync(slot);
|
|
662
|
+
return checkpointNumber === undefined ? undefined : CheckpointNumber(checkpointNumber);
|
|
663
|
+
}
|
|
664
|
+
/** Gets a single L2 block matching the given resolved query. */ async getBlock(query) {
|
|
665
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
587
666
|
if (blockNumber === undefined) {
|
|
588
667
|
return undefined;
|
|
589
668
|
}
|
|
590
669
|
const blockStorage = await this.#blocks.getAsync(blockNumber);
|
|
591
|
-
if (!blockStorage
|
|
670
|
+
if (!blockStorage) {
|
|
592
671
|
return undefined;
|
|
593
672
|
}
|
|
594
|
-
return
|
|
673
|
+
return this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
595
674
|
}
|
|
596
|
-
/**
|
|
597
|
-
|
|
598
|
-
|
|
599
|
-
|
|
600
|
-
|
|
601
|
-
const blockNumber = await this.#blockArchiveIndex.getAsync(archive.toString());
|
|
675
|
+
/** Gets a collection of L2 blocks for a resolved range. */ getBlocks(query) {
|
|
676
|
+
return toArray(this.iterateBlocks(query));
|
|
677
|
+
}
|
|
678
|
+
/** Gets single block metadata matching the given resolved query. */ async getBlockData(query) {
|
|
679
|
+
const blockNumber = await this.getBlockNumber(query);
|
|
602
680
|
if (blockNumber === undefined) {
|
|
603
681
|
return undefined;
|
|
604
682
|
}
|
|
@@ -606,20 +684,30 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
606
684
|
if (!blockStorage || !blockStorage.header) {
|
|
607
685
|
return undefined;
|
|
608
686
|
}
|
|
609
|
-
return
|
|
687
|
+
return this.getBlockDataFromBlockStorage(blockStorage);
|
|
610
688
|
}
|
|
611
|
-
/**
|
|
612
|
-
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
|
|
619
|
-
|
|
620
|
-
|
|
689
|
+
/** Gets a collection of block metadata entries for a resolved range. */ getBlocksData(query) {
|
|
690
|
+
return toArray(this.iterateBlocksData(query));
|
|
691
|
+
}
|
|
692
|
+
/** Async iterator over L2 blocks for a resolved range. */ async *iterateBlocks(query) {
|
|
693
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
694
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)){
|
|
695
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
696
|
+
break;
|
|
697
|
+
}
|
|
698
|
+
const block = await this.getBlockFromBlockStorage(blockNumber, blockStorage);
|
|
699
|
+
if (block) {
|
|
700
|
+
yield block;
|
|
621
701
|
}
|
|
622
|
-
|
|
702
|
+
}
|
|
703
|
+
}
|
|
704
|
+
/** Async iterator over block metadata for a resolved range. */ async *iterateBlocksData(query) {
|
|
705
|
+
const cap = query.onlyCheckpointed ? await this.getCheckpointedL2BlockNumber() : undefined;
|
|
706
|
+
for await (const [blockNumber, blockStorage] of this.getBlockStorages(query.from, query.limit)){
|
|
707
|
+
if (cap !== undefined && blockNumber > cap) {
|
|
708
|
+
break;
|
|
709
|
+
}
|
|
710
|
+
yield this.getBlockDataFromBlockStorage(blockStorage);
|
|
623
711
|
}
|
|
624
712
|
}
|
|
625
713
|
async *getBlockStorages(start, limit) {
|
|
@@ -635,11 +723,27 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
635
723
|
];
|
|
636
724
|
}
|
|
637
725
|
}
|
|
726
|
+
/** Resolves a ResolvedBlockQuery discriminant to a block number, or undefined if not found. */ async getBlockNumber(query) {
|
|
727
|
+
let blockNumber;
|
|
728
|
+
if ('number' in query) {
|
|
729
|
+
blockNumber = query.number;
|
|
730
|
+
} else if ('hash' in query) {
|
|
731
|
+
const n = await this.#blockHashIndex.getAsync(query.hash.toString());
|
|
732
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
733
|
+
} else {
|
|
734
|
+
const n = await this.#blockArchiveIndex.getAsync(query.archive.toString());
|
|
735
|
+
blockNumber = n !== undefined ? BlockNumber(n) : undefined;
|
|
736
|
+
}
|
|
737
|
+
if (blockNumber === undefined) {
|
|
738
|
+
return undefined;
|
|
739
|
+
}
|
|
740
|
+
return blockNumber;
|
|
741
|
+
}
|
|
638
742
|
getBlockDataFromBlockStorage(blockStorage) {
|
|
639
743
|
return {
|
|
640
744
|
header: BlockHeader.fromBuffer(blockStorage.header),
|
|
641
745
|
archive: AppendOnlyTreeSnapshot.fromBuffer(blockStorage.archive),
|
|
642
|
-
blockHash:
|
|
746
|
+
blockHash: BlockHash.fromBuffer(blockStorage.blockHash),
|
|
643
747
|
checkpointNumber: CheckpointNumber(blockStorage.checkpointNumber),
|
|
644
748
|
indexWithinCheckpoint: IndexWithinCheckpoint(blockStorage.indexWithinCheckpoint)
|
|
645
749
|
};
|
|
@@ -683,36 +787,6 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
683
787
|
return deserializeIndexedTxEffect(buffer);
|
|
684
788
|
}
|
|
685
789
|
/**
|
|
686
|
-
* Gets a receipt of a settled tx.
|
|
687
|
-
* @param txHash - The hash of a tx we try to get the receipt for.
|
|
688
|
-
* @returns The requested tx receipt (or undefined if not found).
|
|
689
|
-
*/ async getSettledTxReceipt(txHash, l1Constants) {
|
|
690
|
-
const txEffect = await this.getTxEffect(txHash);
|
|
691
|
-
if (!txEffect) {
|
|
692
|
-
return undefined;
|
|
693
|
-
}
|
|
694
|
-
const blockNumber = BlockNumber(txEffect.l2BlockNumber);
|
|
695
|
-
// Use existing archiver methods to determine finalization level
|
|
696
|
-
const [provenBlockNumber, checkpointedBlockNumber, finalizedBlockNumber, blockData] = await Promise.all([
|
|
697
|
-
this.getProvenBlockNumber(),
|
|
698
|
-
this.getCheckpointedL2BlockNumber(),
|
|
699
|
-
this.getFinalizedL2BlockNumber(),
|
|
700
|
-
this.getBlockData(blockNumber)
|
|
701
|
-
]);
|
|
702
|
-
let status;
|
|
703
|
-
if (blockNumber <= finalizedBlockNumber) {
|
|
704
|
-
status = TxStatus.FINALIZED;
|
|
705
|
-
} else if (blockNumber <= provenBlockNumber) {
|
|
706
|
-
status = TxStatus.PROVEN;
|
|
707
|
-
} else if (blockNumber <= checkpointedBlockNumber) {
|
|
708
|
-
status = TxStatus.CHECKPOINTED;
|
|
709
|
-
} else {
|
|
710
|
-
status = TxStatus.PROPOSED;
|
|
711
|
-
}
|
|
712
|
-
const epochNumber = blockData && l1Constants ? getEpochAtSlot(blockData.header.globalVariables.slotNumber, l1Constants) : undefined;
|
|
713
|
-
return new TxReceipt(txHash, status, TxReceipt.executionResultFromRevertCode(txEffect.data.revertCode), undefined, txEffect.data.transactionFee.toBigInt(), txEffect.l2BlockHash, blockNumber, epochNumber);
|
|
714
|
-
}
|
|
715
|
-
/**
|
|
716
790
|
* Looks up which block included the requested tx effect.
|
|
717
791
|
* @param txHash - The txHash of the tx.
|
|
718
792
|
* @returns The block number and index of the tx.
|
|
@@ -721,13 +795,50 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
721
795
|
if (!txEffect) {
|
|
722
796
|
return undefined;
|
|
723
797
|
}
|
|
724
|
-
|
|
798
|
+
// Read only the IndexedTxEffect header (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4)`); the
|
|
799
|
+
// large tail (the full TxEffect with logs etc.) is irrelevant here.
|
|
800
|
+
const view = Buffer.from(txEffect.buffer, txEffect.byteOffset, txEffect.byteLength);
|
|
801
|
+
const l2BlockNumber = view.readUInt32BE(32);
|
|
802
|
+
const txIndexInBlock = view.readUInt32BE(36);
|
|
725
803
|
return [
|
|
726
804
|
l2BlockNumber,
|
|
727
805
|
txIndexInBlock
|
|
728
806
|
];
|
|
729
807
|
}
|
|
730
808
|
/**
|
|
809
|
+
* Batched, partial deserializer that fetches `noteHashes` and `nullifiers` (all of them) for the given
|
|
810
|
+
* txs. For each input txHash, returns a `[noteHashes, nullifiers]` tuple. Returns `[[], []]` for any
|
|
811
|
+
* unknown txHash. Preserves input order. Used by the log read path when `includeEffects` is set to
|
|
812
|
+
* attach effect data on demand without paying for a full {@link TxEffect} deserialization.
|
|
813
|
+
*
|
|
814
|
+
* The on-disk `IndexedTxEffect` layout starts with a fixed-length header
|
|
815
|
+
* (`blockHash(32) + l2BlockNumber(4) + txIndexInBlock(4) + slotNumber(4) + revertCode(1) + txHash(32) +
|
|
816
|
+
* transactionFee(32)` = 109 bytes), followed by `noteHashes` and `nullifiers` (both u8-length-prefixed `Fr`
|
|
817
|
+
* vectors). We
|
|
818
|
+
* skip the header, then read the two vectors, and stop — the large tail (`l2ToL1Msgs`,
|
|
819
|
+
* `publicDataWrites`, `privateLogs`, `publicLogs`, `contractClassLogs`) is never touched.
|
|
820
|
+
*/ getNoteHashesAndNullifiers(txHashes) {
|
|
821
|
+
return Promise.all(txHashes.map(async (txHash)=>{
|
|
822
|
+
const buffer = await this.#txEffects.getAsync(txHash.toString());
|
|
823
|
+
if (!buffer) {
|
|
824
|
+
return [
|
|
825
|
+
[],
|
|
826
|
+
[]
|
|
827
|
+
];
|
|
828
|
+
}
|
|
829
|
+
const reader = BufferReader.asReader(buffer);
|
|
830
|
+
// Skip the fixed-length header: blockHash + l2BlockNumber + txIndexInBlock + slotNumber + revertCode +
|
|
831
|
+
// txHash + transactionFee.
|
|
832
|
+
reader.readBytes(32 + 4 + 4 + 4 + 1 + 32 + 32);
|
|
833
|
+
const noteHashes = reader.readVectorUint8Prefix(Fr);
|
|
834
|
+
const nullifiers = reader.readVectorUint8Prefix(Fr);
|
|
835
|
+
return [
|
|
836
|
+
noteHashes,
|
|
837
|
+
nullifiers
|
|
838
|
+
];
|
|
839
|
+
}));
|
|
840
|
+
}
|
|
841
|
+
/**
|
|
731
842
|
* Looks up which block deployed a particular contract.
|
|
732
843
|
* @param contractAddress - The address of the contract to look up.
|
|
733
844
|
* @returns The block number and index of the contract.
|
|
@@ -753,6 +864,152 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
753
864
|
return typeof lastBlockNumber === 'number' ? BlockNumber(lastBlockNumber) : BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
754
865
|
}
|
|
755
866
|
/**
|
|
867
|
+
* Resolves all five L2 chain tips (proposed, proposedCheckpoint, checkpointed, proven, finalized)
|
|
868
|
+
* in a single read-only transaction so the snapshot is internally consistent. Each underlying
|
|
869
|
+
* record is read at most once: latest block, latest confirmed checkpoint, and latest pending
|
|
870
|
+
* checkpoint are each loaded directly (no separate "find the number, then look up data" hop),
|
|
871
|
+
* the proven/finalized checkpoint singletons are read once and their storage entries are
|
|
872
|
+
* reused if they coincide with the latest checkpoint, and per-tip block hashes are deduped
|
|
873
|
+
* when two tips land on the same block (e.g. finalized == proven, or proposedCheckpoint falls
|
|
874
|
+
* back to checkpointed when no pending checkpoint exists).
|
|
875
|
+
*
|
|
876
|
+
* The result is guaranteed to satisfy `finalized <= proven <= checkpointed <= proposed` (by
|
|
877
|
+
* block number). Genesis is represented by `(INITIAL_L2_BLOCK_NUM - 1)` and the supplied
|
|
878
|
+
* `genesisBlockHash`, paired with the synthetic genesis checkpoint id.
|
|
879
|
+
*
|
|
880
|
+
* @param genesisBlockHash - Block hash to report for the synthetic pre-initial block (used when
|
|
881
|
+
* a tip is still at genesis).
|
|
882
|
+
*/ async getL2TipsData(genesisBlockHash) {
|
|
883
|
+
return await this.db.transactionAsync(async ()=>{
|
|
884
|
+
// Define genesis tips
|
|
885
|
+
const genesisBlockNumber = BlockNumber(INITIAL_L2_BLOCK_NUM - 1);
|
|
886
|
+
const genesisCheckpointNumber = CheckpointNumber(INITIAL_CHECKPOINT_NUMBER - 1);
|
|
887
|
+
const genesisBlockId = {
|
|
888
|
+
number: genesisBlockNumber,
|
|
889
|
+
hash: genesisBlockHash.toString()
|
|
890
|
+
};
|
|
891
|
+
const genesisCheckpointId = {
|
|
892
|
+
number: genesisCheckpointNumber,
|
|
893
|
+
hash: GENESIS_CHECKPOINT_HEADER_HASH.toString()
|
|
894
|
+
};
|
|
895
|
+
const genesisTip = {
|
|
896
|
+
block: genesisBlockId,
|
|
897
|
+
checkpoint: genesisCheckpointId
|
|
898
|
+
};
|
|
899
|
+
// Load latest block and checkpoint entries
|
|
900
|
+
const [latestBlockEntry] = await toArray(this.#blocks.entriesAsync({
|
|
901
|
+
reverse: true,
|
|
902
|
+
limit: 1
|
|
903
|
+
}));
|
|
904
|
+
const [proposedCheckpointEntry] = await toArray(this.#proposedCheckpoints.entriesAsync({
|
|
905
|
+
reverse: true,
|
|
906
|
+
limit: 1
|
|
907
|
+
}));
|
|
908
|
+
const [latestCheckpointEntry] = await toArray(this.#checkpoints.entriesAsync({
|
|
909
|
+
reverse: true,
|
|
910
|
+
limit: 1
|
|
911
|
+
}));
|
|
912
|
+
const latestCheckpointNumber = latestCheckpointEntry ? CheckpointNumber(latestCheckpointEntry[0]) : genesisCheckpointNumber;
|
|
913
|
+
// Load proven and finalized checkpoint number pointers
|
|
914
|
+
const [provenRaw, finalizedRaw] = await Promise.all([
|
|
915
|
+
this.#lastProvenCheckpoint.getAsync(),
|
|
916
|
+
this.#lastFinalizedCheckpoint.getAsync()
|
|
917
|
+
]);
|
|
918
|
+
// Clamp to enforce finalized <= proven <= checkpointed.
|
|
919
|
+
const provenCheckpointNumber = CheckpointNumber(Math.min(provenRaw ?? 0, latestCheckpointNumber));
|
|
920
|
+
const finalizedCheckpointNumber = CheckpointNumber(Math.min(finalizedRaw ?? 0, provenCheckpointNumber));
|
|
921
|
+
// Avoid loading the same checkpoint more than once
|
|
922
|
+
const checkpointStorageCache = new Map();
|
|
923
|
+
if (latestCheckpointEntry) {
|
|
924
|
+
checkpointStorageCache.set(CheckpointNumber(latestCheckpointEntry[0]), latestCheckpointEntry[1]);
|
|
925
|
+
}
|
|
926
|
+
const loadCheckpointStorage = async (n)=>{
|
|
927
|
+
if (n === 0) {
|
|
928
|
+
return undefined;
|
|
929
|
+
}
|
|
930
|
+
if (!checkpointStorageCache.has(n)) {
|
|
931
|
+
const checkpointStorage = await this.#checkpoints.getAsync(n);
|
|
932
|
+
if (!checkpointStorage) {
|
|
933
|
+
throw new CheckpointNotFoundError(n);
|
|
934
|
+
}
|
|
935
|
+
checkpointStorageCache.set(n, checkpointStorage);
|
|
936
|
+
}
|
|
937
|
+
return checkpointStorageCache.get(n);
|
|
938
|
+
};
|
|
939
|
+
// Load proven and finalized checkpoint storage entries
|
|
940
|
+
const provenCheckpoint = await loadCheckpointStorage(provenCheckpointNumber);
|
|
941
|
+
const finalizedCheckpoint = await loadCheckpointStorage(finalizedCheckpointNumber);
|
|
942
|
+
// Avoid loading the same block hash multiple times when tips land on the same block
|
|
943
|
+
const blockHashCache = new Map();
|
|
944
|
+
blockHashCache.set(genesisBlockNumber, genesisBlockHash.toString());
|
|
945
|
+
if (latestBlockEntry) {
|
|
946
|
+
blockHashCache.set(latestBlockEntry[0], BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString());
|
|
947
|
+
}
|
|
948
|
+
const loadBlockHash = async (n)=>{
|
|
949
|
+
if (!blockHashCache.has(n)) {
|
|
950
|
+
const blockStorage = await this.#blocks.getAsync(n);
|
|
951
|
+
if (!blockStorage) {
|
|
952
|
+
throw new BlockNotFoundError(n);
|
|
953
|
+
}
|
|
954
|
+
const blockHash = BlockHash.fromBuffer(blockStorage.blockHash).toString();
|
|
955
|
+
blockHashCache.set(n, blockHash);
|
|
956
|
+
}
|
|
957
|
+
return blockHashCache.get(n);
|
|
958
|
+
};
|
|
959
|
+
// Build proposed chain tip (this one has block only, no checkpoint)
|
|
960
|
+
const proposedBlockId = latestBlockEntry === undefined ? genesisBlockId : {
|
|
961
|
+
number: BlockNumber(latestBlockEntry[0]),
|
|
962
|
+
hash: BlockHash.fromBuffer(latestBlockEntry[1].blockHash).toString()
|
|
963
|
+
};
|
|
964
|
+
// Build other tips from checkpoint data, reading corresponding block data from the cache
|
|
965
|
+
const buildTipFromCheckpoint = async (stored)=>{
|
|
966
|
+
if (!stored) {
|
|
967
|
+
return genesisTip;
|
|
968
|
+
}
|
|
969
|
+
const blockNumber = BlockNumber(stored.startBlock + stored.blockCount - 1);
|
|
970
|
+
const blockHash = await loadBlockHash(blockNumber);
|
|
971
|
+
const header = CheckpointHeader.fromBuffer(stored.header);
|
|
972
|
+
return {
|
|
973
|
+
block: {
|
|
974
|
+
number: blockNumber,
|
|
975
|
+
hash: blockHash
|
|
976
|
+
},
|
|
977
|
+
checkpoint: {
|
|
978
|
+
number: CheckpointNumber(stored.checkpointNumber),
|
|
979
|
+
hash: header.hash().toString()
|
|
980
|
+
}
|
|
981
|
+
};
|
|
982
|
+
};
|
|
983
|
+
const checkpointedTip = await buildTipFromCheckpoint(latestCheckpointEntry?.[1]);
|
|
984
|
+
const provenTip = await buildTipFromCheckpoint(provenCheckpoint);
|
|
985
|
+
const finalizedTip = await buildTipFromCheckpoint(finalizedCheckpoint);
|
|
986
|
+
// Proposed checkpoint falls back to the checkpoint tip if it's not set. And if local storage is
|
|
987
|
+
// inconsistent and the proposed checkpoint is behind the checkpointed tip, we patch that and
|
|
988
|
+
// report the checkpointed tip as the proposed checkpoint to maintain the invariant.
|
|
989
|
+
const proposedCheckpointTip = proposedCheckpointEntry === undefined || proposedCheckpointEntry[0] <= latestCheckpointNumber ? checkpointedTip : await buildTipFromCheckpoint(proposedCheckpointEntry[1]);
|
|
990
|
+
// A checkpointed block past the latest stored block would mean a checkpoint
|
|
991
|
+
// references blocks that aren't in blocks.
|
|
992
|
+
if (proposedBlockId.number < checkpointedTip.block.number) {
|
|
993
|
+
throw new Error(`Inconsistent block store: latest block ${proposedBlockId.number} is behind checkpointed block ${checkpointedTip.block.number}`);
|
|
994
|
+
}
|
|
995
|
+
// Assert that checkpoint numbers are increasing
|
|
996
|
+
if (finalizedTip.checkpoint.number > provenTip.checkpoint.number || provenTip.checkpoint.number > checkpointedTip.checkpoint.number || checkpointedTip.checkpoint.number > proposedCheckpointTip.checkpoint.number) {
|
|
997
|
+
throw new Error(`Inconsistent checkpoint numbers in chain tips: finalized=${finalizedTip.checkpoint.number} proven=${provenTip.checkpoint.number} checkpointed=${checkpointedTip.checkpoint.number} proposed=${proposedCheckpointTip.checkpoint.number}`);
|
|
998
|
+
}
|
|
999
|
+
// Assert block numbers are increasing
|
|
1000
|
+
if (finalizedTip.block.number > provenTip.block.number || provenTip.block.number > checkpointedTip.block.number || checkpointedTip.block.number > proposedCheckpointTip.block.number || proposedCheckpointTip.block.number > proposedBlockId.number) {
|
|
1001
|
+
throw new Error(`Inconsistent block numbers in chain tips: finalized=${finalizedTip.block.number} proven=${provenTip.block.number} checkpointed=${checkpointedTip.block.number} proposedCheckpoint=${proposedCheckpointTip.block.number} proposed=${proposedBlockId.number}`);
|
|
1002
|
+
}
|
|
1003
|
+
return {
|
|
1004
|
+
proposed: proposedBlockId,
|
|
1005
|
+
proposedCheckpoint: proposedCheckpointTip,
|
|
1006
|
+
checkpointed: checkpointedTip,
|
|
1007
|
+
proven: provenTip,
|
|
1008
|
+
finalized: finalizedTip
|
|
1009
|
+
};
|
|
1010
|
+
});
|
|
1011
|
+
}
|
|
1012
|
+
/**
|
|
756
1013
|
* Gets the most recent L1 block processed.
|
|
757
1014
|
* @returns The L1 block that published the latest L2 block
|
|
758
1015
|
*/ getSynchedL1BlockNumber() {
|
|
@@ -761,23 +1018,70 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
761
1018
|
setSynchedL1BlockNumber(l1BlockNumber) {
|
|
762
1019
|
return this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
763
1020
|
}
|
|
1021
|
+
/**
|
|
1022
|
+
* Adds a proposed checkpoint to the pending queue.
|
|
1023
|
+
* Accepts proposed.checkpointNumber === latestTip + 1, where latestTip is the highest of
|
|
1024
|
+
* confirmed and the highest pending checkpoint number.
|
|
1025
|
+
* Computes archive and checkpointOutHash from the stored blocks.
|
|
1026
|
+
*/ async addProposedCheckpoint(proposed) {
|
|
1027
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1028
|
+
const confirmed = await this.getLatestCheckpointNumber();
|
|
1029
|
+
const [latestPendingKey] = await toArray(this.#proposedCheckpoints.keysAsync({
|
|
1030
|
+
reverse: true,
|
|
1031
|
+
limit: 1
|
|
1032
|
+
}));
|
|
1033
|
+
const latestTip = CheckpointNumber(latestPendingKey !== undefined ? Math.max(latestPendingKey, confirmed) : confirmed);
|
|
1034
|
+
if (proposed.checkpointNumber !== latestTip + 1) {
|
|
1035
|
+
throw new ProposedCheckpointNotSequentialError(proposed.checkpointNumber, latestTip);
|
|
1036
|
+
}
|
|
1037
|
+
// Ensure the predecessor block (from pending or confirmed chain) exists
|
|
1038
|
+
const previousBlock = await this.getPreviousCheckpointBlock(proposed.checkpointNumber);
|
|
1039
|
+
const blocks = [];
|
|
1040
|
+
for(let i = 0; i < proposed.blockCount; i++){
|
|
1041
|
+
const block = await this.getBlock({
|
|
1042
|
+
number: BlockNumber(proposed.startBlock + i)
|
|
1043
|
+
});
|
|
1044
|
+
if (!block) {
|
|
1045
|
+
throw new BlockNotFoundError(proposed.startBlock + i);
|
|
1046
|
+
}
|
|
1047
|
+
blocks.push(block);
|
|
1048
|
+
}
|
|
1049
|
+
this.validateCheckpointBlocks(blocks, previousBlock);
|
|
1050
|
+
const archive = blocks[blocks.length - 1].archive;
|
|
1051
|
+
const checkpointOutHash = Checkpoint.getCheckpointOutHash(blocks);
|
|
1052
|
+
await this.#proposedCheckpoints.set(proposed.checkpointNumber, {
|
|
1053
|
+
header: proposed.header.toBuffer(),
|
|
1054
|
+
archive: archive.toBuffer(),
|
|
1055
|
+
checkpointOutHash: checkpointOutHash.toBuffer(),
|
|
1056
|
+
checkpointNumber: proposed.checkpointNumber,
|
|
1057
|
+
startBlock: proposed.startBlock,
|
|
1058
|
+
blockCount: proposed.blockCount,
|
|
1059
|
+
totalManaUsed: proposed.totalManaUsed.toString(),
|
|
1060
|
+
feeAssetPriceModifier: proposed.feeAssetPriceModifier.toString()
|
|
1061
|
+
});
|
|
1062
|
+
});
|
|
1063
|
+
}
|
|
764
1064
|
async getProvenCheckpointNumber() {
|
|
765
|
-
|
|
766
|
-
|
|
767
|
-
|
|
768
|
-
|
|
769
|
-
|
|
1065
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1066
|
+
const [latestCheckpointNumber, provenCheckpointNumber] = await Promise.all([
|
|
1067
|
+
this.getLatestCheckpointNumber(),
|
|
1068
|
+
this.#lastProvenCheckpoint.getAsync()
|
|
1069
|
+
]);
|
|
1070
|
+
return (provenCheckpointNumber ?? 0) > latestCheckpointNumber ? latestCheckpointNumber : CheckpointNumber(provenCheckpointNumber ?? 0);
|
|
1071
|
+
});
|
|
770
1072
|
}
|
|
771
1073
|
async setProvenCheckpointNumber(checkpointNumber) {
|
|
772
1074
|
const result = await this.#lastProvenCheckpoint.set(checkpointNumber);
|
|
773
1075
|
return result;
|
|
774
1076
|
}
|
|
775
1077
|
async getFinalizedCheckpointNumber() {
|
|
776
|
-
|
|
777
|
-
|
|
778
|
-
|
|
779
|
-
|
|
780
|
-
|
|
1078
|
+
return await this.db.transactionAsync(async ()=>{
|
|
1079
|
+
const [provenCheckpointNumber, finalizedCheckpointNumber] = await Promise.all([
|
|
1080
|
+
this.getProvenCheckpointNumber(),
|
|
1081
|
+
this.#lastFinalizedCheckpoint.getAsync()
|
|
1082
|
+
]);
|
|
1083
|
+
return (finalizedCheckpointNumber ?? 0) > provenCheckpointNumber ? provenCheckpointNumber : CheckpointNumber(finalizedCheckpointNumber ?? 0);
|
|
1084
|
+
});
|
|
781
1085
|
}
|
|
782
1086
|
setFinalizedCheckpointNumber(checkpointNumber) {
|
|
783
1087
|
return this.#lastFinalizedCheckpoint.set(checkpointNumber);
|
|
@@ -815,4 +1119,70 @@ export { TxReceipt } from '@aztec/stdlib/tx';
|
|
|
815
1119
|
await this.#pendingChainValidationStatus.delete();
|
|
816
1120
|
}
|
|
817
1121
|
}
|
|
1122
|
+
/** Records a rejected-checkpoint entry, keyed by its own archive root. */ async addRejectedCheckpoint(entry) {
|
|
1123
|
+
const archiveRootHex = entry.archiveRoot.toString();
|
|
1124
|
+
await this.#rejectedCheckpoints.set(archiveRootHex, {
|
|
1125
|
+
checkpointNumber: entry.checkpointNumber,
|
|
1126
|
+
archiveRoot: entry.archiveRoot.toBuffer(),
|
|
1127
|
+
parentArchiveRoot: entry.parentArchiveRoot.toBuffer(),
|
|
1128
|
+
slotNumber: entry.slotNumber,
|
|
1129
|
+
l1: entry.l1.toBuffer(),
|
|
1130
|
+
reason: entry.reason
|
|
1131
|
+
});
|
|
1132
|
+
await this.#rejectedCheckpointsByNumber.set(entry.checkpointNumber, archiveRootHex);
|
|
1133
|
+
await this.advanceSynchedL1BlockNumber(entry.l1.blockNumber);
|
|
1134
|
+
}
|
|
1135
|
+
/** Returns the rejected-checkpoint entry with the given archive root, or undefined if not present. */ async getRejectedCheckpointByArchiveRoot(archiveRoot) {
|
|
1136
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRoot.toString());
|
|
1137
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1138
|
+
}
|
|
1139
|
+
/** Returns the rejected-checkpoint entry recorded for the given checkpoint number, or undefined if none. */ async getRejectedCheckpointByNumber(checkpointNumber) {
|
|
1140
|
+
const archiveRootHex = await this.#rejectedCheckpointsByNumber.getAsync(checkpointNumber);
|
|
1141
|
+
if (archiveRootHex === undefined) {
|
|
1142
|
+
return undefined;
|
|
1143
|
+
}
|
|
1144
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1145
|
+
return stored ? this.rejectedCheckpointFromStorage(stored) : undefined;
|
|
1146
|
+
}
|
|
1147
|
+
/** Returns the highest checkpoint number recorded across all rejected entries, or `INITIAL_CHECKPOINT_NUMBER - 1` if none. */ async getLatestRejectedCheckpointNumber() {
|
|
1148
|
+
const [latest] = await toArray(this.#rejectedCheckpointsByNumber.keysAsync({
|
|
1149
|
+
reverse: true,
|
|
1150
|
+
limit: 1
|
|
1151
|
+
}));
|
|
1152
|
+
return CheckpointNumber(latest ?? INITIAL_CHECKPOINT_NUMBER - 1);
|
|
1153
|
+
}
|
|
1154
|
+
/** Removes a rejected-checkpoint entry by its archive root (used when an entry no longer matches L1). */ async removeRejectedCheckpointByArchiveRoot(archiveRoot) {
|
|
1155
|
+
const archiveRootHex = archiveRoot.toString();
|
|
1156
|
+
const stored = await this.#rejectedCheckpoints.getAsync(archiveRootHex);
|
|
1157
|
+
await this.#rejectedCheckpoints.delete(archiveRootHex);
|
|
1158
|
+
if (stored) {
|
|
1159
|
+
// Only clear the by-number index if it still points at this archive root, so a distinct
|
|
1160
|
+
// entry that shares the checkpoint number (e.g. an L1 reorg replacement) is not dropped.
|
|
1161
|
+
const indexed = await this.#rejectedCheckpointsByNumber.getAsync(stored.checkpointNumber);
|
|
1162
|
+
if (indexed === archiveRootHex) {
|
|
1163
|
+
await this.#rejectedCheckpointsByNumber.delete(stored.checkpointNumber);
|
|
1164
|
+
}
|
|
1165
|
+
}
|
|
1166
|
+
}
|
|
1167
|
+
/**
|
|
1168
|
+
* Advances the stored last-synched L1 block number to `l1BlockNumber` only if it is strictly
|
|
1169
|
+
* greater than the current value. Use this whenever ingesting checkpoint-shaped data so the
|
|
1170
|
+
* sync pointer never walks backwards on out-of-order writes (e.g. an invalid checkpoint
|
|
1171
|
+
* advance followed by a valid-checkpoint commit landing at an earlier L1 block).
|
|
1172
|
+
*/ async advanceSynchedL1BlockNumber(l1BlockNumber) {
|
|
1173
|
+
const current = await this.#lastSynchedL1Block.getAsync();
|
|
1174
|
+
if (current === undefined || l1BlockNumber > current) {
|
|
1175
|
+
await this.#lastSynchedL1Block.set(l1BlockNumber);
|
|
1176
|
+
}
|
|
1177
|
+
}
|
|
1178
|
+
rejectedCheckpointFromStorage(stored) {
|
|
1179
|
+
return {
|
|
1180
|
+
checkpointNumber: CheckpointNumber(stored.checkpointNumber),
|
|
1181
|
+
archiveRoot: Fr.fromBuffer(stored.archiveRoot),
|
|
1182
|
+
parentArchiveRoot: Fr.fromBuffer(stored.parentArchiveRoot),
|
|
1183
|
+
slotNumber: SlotNumber(stored.slotNumber),
|
|
1184
|
+
l1: L1PublishedData.fromBuffer(stored.l1),
|
|
1185
|
+
reason: stored.reason
|
|
1186
|
+
};
|
|
1187
|
+
}
|
|
818
1188
|
}
|