@aztec/archiver 0.0.1-commit.b33fc05d0 → 0.0.1-commit.b3d3157a
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 +248 -76
- 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 +46 -32
- 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 +19 -10
- 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 +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 +166 -116
- package/dest/modules/instrumentation.d.ts +7 -2
- package/dest/modules/instrumentation.d.ts.map +1 -1
- package/dest/modules/instrumentation.js +25 -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 +414 -213
- 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 +165 -66
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +648 -233
- 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 +24 -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 +37 -2
- 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 +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 +15 -3
- package/dest/test/fake_l1_state.d.ts.map +1 -1
- package/dest/test/fake_l1_state.js +88 -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 +315 -83
- package/src/config.ts +24 -11
- package/src/errors.ts +117 -2
- package/src/factory.ts +54 -28
- package/src/index.ts +18 -2
- package/src/l1/calldata_retriever.ts +16 -5
- package/src/l1/data_retrieval.ts +36 -45
- 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 +201 -147
- package/src/modules/instrumentation.ts +28 -8
- package/src/modules/l1_synchronizer.ts +549 -254
- package/src/modules/outbox_trees_resolver.ts +199 -0
- package/src/modules/validation.ts +10 -9
- package/src/store/block_store.ts +807 -285
- package/src/store/contract_class_store.ts +31 -103
- package/src/store/contract_instance_store.ts +51 -5
- 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 +301 -559
- 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 +111 -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 -363
- package/dest/store/kv_archiver_store.d.ts.map +0 -1
- package/dest/store/kv_archiver_store.js +0 -476
- package/src/store/kv_archiver_store.ts +0 -689
|
@@ -0,0 +1,132 @@
|
|
|
1
|
+
import { BlockNumber } from '@aztec/foundation/branded-types';
|
|
2
|
+
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
3
|
+
import { BlockHash } from '@aztec/stdlib/block';
|
|
4
|
+
import { TxHash } from '@aztec/stdlib/tx';
|
|
5
|
+
|
|
6
|
+
export const NUMERIC_HEX_LEN = 8;
|
|
7
|
+
export const SEP = '-';
|
|
8
|
+
|
|
9
|
+
/**
|
|
10
|
+
* Sentinel appended after a numeric hex segment to build an end bound strictly greater than any
|
|
11
|
+
* real key for that namespace. `'g'` sorts lexicographically after every hex digit (`0`-`9`, `a`-`f`),
|
|
12
|
+
* so `prefix + '-g'` is a clean exclusive upper bound.
|
|
13
|
+
*/
|
|
14
|
+
export const HEX_SENTINEL = 'g';
|
|
15
|
+
|
|
16
|
+
export type ParsedKeyTail = {
|
|
17
|
+
blockNumber: BlockNumber;
|
|
18
|
+
txIndexWithinBlock: number;
|
|
19
|
+
logIndexWithinTx: number;
|
|
20
|
+
};
|
|
21
|
+
|
|
22
|
+
/**
|
|
23
|
+
* Per-kind stored value layout (no msgpackr):
|
|
24
|
+
* txHash(32) ++ blockHash(32) ++ blockTimestamp(u64 BE = 8) ++ logDataLen(u32 BE = 4) ++ logData[i].toBuffer()...
|
|
25
|
+
* `blockNumber`, `txIndexWithinBlock`, and `logIndexWithinTx` are decoded from the composite key.
|
|
26
|
+
*/
|
|
27
|
+
export type StoredLogValue = {
|
|
28
|
+
txHash: TxHash;
|
|
29
|
+
blockHash: BlockHash;
|
|
30
|
+
blockTimestamp: bigint;
|
|
31
|
+
logData: Fr[];
|
|
32
|
+
};
|
|
33
|
+
|
|
34
|
+
/** Returns the 64-char lowercase hex representation of a field, stripping the `0x` prefix. */
|
|
35
|
+
export function fieldHex(value: Fr | { toString: () => string }): string {
|
|
36
|
+
// Fr.toString() and AztecAddress.toString() both return `0x` + 64 lowercase hex chars.
|
|
37
|
+
return value.toString().slice(2);
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
/** Encodes a number as 8-char zero-padded lowercase hex (matches a u32 big-endian byte buffer's lex order). */
|
|
41
|
+
export function u32Hex(n: number): string {
|
|
42
|
+
return n.toString(16).padStart(NUMERIC_HEX_LEN, '0');
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
/**
|
|
46
|
+
* Encodes the composite primary key as `prefix-block-txIdx-logIdx` where `prefix` is the leading
|
|
47
|
+
* segment (`tag` for private; `contract-tag` for public) and the trailing triple is fixed-width
|
|
48
|
+
* 8-char zero-padded hex so byte-order matches `(blockNumber, txIndexWithinBlock, logIndexWithinTx)`.
|
|
49
|
+
*/
|
|
50
|
+
export function encodeKey(prefix: string, blockNumber: number, txIndex: number, logIndex: number): string {
|
|
51
|
+
return `${prefix}${SEP}${u32Hex(blockNumber)}${SEP}${u32Hex(txIndex)}${SEP}${u32Hex(logIndex)}`;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
/**
|
|
55
|
+
* Decodes the trailing `(blockNumber, txIndexWithinBlock, logIndexWithinTx)` triple from a composite
|
|
56
|
+
* key. The leading prefix segments are ignored — we only ever read them off the input query, never
|
|
57
|
+
* back off the key.
|
|
58
|
+
*/
|
|
59
|
+
export function decodeKeyTail(key: string): ParsedKeyTail {
|
|
60
|
+
const parts = key.split(SEP);
|
|
61
|
+
const len = parts.length;
|
|
62
|
+
return {
|
|
63
|
+
blockNumber: BlockNumber(parseInt(parts[len - 3], 16)),
|
|
64
|
+
txIndexWithinBlock: parseInt(parts[len - 2], 16),
|
|
65
|
+
logIndexWithinTx: parseInt(parts[len - 1], 16),
|
|
66
|
+
};
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
/**
|
|
70
|
+
* Exclusive end bound for a `(contract, tag)`-prefix scan. With an `upperBlockExclusive` we cut at
|
|
71
|
+
* `(prefix, upper, 0, 0)`. With no bound we use `prefix + '-' + HEX_SENTINEL`, which sorts strictly
|
|
72
|
+
* after every real key under `prefix` (`g` is greater than any hex digit).
|
|
73
|
+
*/
|
|
74
|
+
export function endOfTagRange(prefix: string, upperBlockExclusive: number | undefined): string {
|
|
75
|
+
if (upperBlockExclusive === undefined) {
|
|
76
|
+
return `${prefix}${SEP}${HEX_SENTINEL}`;
|
|
77
|
+
}
|
|
78
|
+
return encodeKey(prefix, upperBlockExclusive, 0, 0);
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
/**
|
|
82
|
+
* Exclusive end bound for a tx-strict scan: every key strictly inside `(prefix, txBlk, txIdx, *)`.
|
|
83
|
+
* `prefix-block-txIdx-` followed by the hex sentinel is the first key past every real logIndex for
|
|
84
|
+
* this tx and strictly less than the next tx's first key.
|
|
85
|
+
*/
|
|
86
|
+
export function endOfTxRange(prefix: string, txBlk: number, txIdx: number): string {
|
|
87
|
+
return `${prefix}${SEP}${u32Hex(txBlk)}${SEP}${u32Hex(txIdx)}${SEP}${HEX_SENTINEL}`;
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
/**
|
|
91
|
+
* Returns the smallest string strictly greater than a fully-encoded composite key. The encoded key
|
|
92
|
+
* ends in a hex digit, and `'g'` sorts strictly after any hex digit, so appending `'g'` is the
|
|
93
|
+
* smallest possible successor in our key alphabet. Used to turn an inclusive cursor into an
|
|
94
|
+
* exclusive `start`.
|
|
95
|
+
*/
|
|
96
|
+
export function incKey(key: string): string {
|
|
97
|
+
return key + HEX_SENTINEL;
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
export function encodeValue(value: StoredLogValue): Buffer {
|
|
101
|
+
const head = Buffer.allocUnsafe(32 + 32 + 8 + 4);
|
|
102
|
+
value.txHash.toBuffer().copy(head, 0);
|
|
103
|
+
value.blockHash.toBuffer().copy(head, 32);
|
|
104
|
+
head.writeBigUInt64BE(value.blockTimestamp, 64);
|
|
105
|
+
head.writeUInt32BE(value.logData.length, 72);
|
|
106
|
+
const fieldBufs = value.logData.map(f => f.toBuffer());
|
|
107
|
+
return Buffer.concat([head, ...fieldBufs]);
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
export function decodeValue(buffer: Buffer | Uint8Array): StoredLogValue {
|
|
111
|
+
const buf = Buffer.isBuffer(buffer) ? buffer : Buffer.from(buffer.buffer, buffer.byteOffset, buffer.byteLength);
|
|
112
|
+
let off = 0;
|
|
113
|
+
const txHash = TxHash.fromBuffer(buf.subarray(off, off + 32));
|
|
114
|
+
off += 32;
|
|
115
|
+
const blockHash = BlockHash.fromBuffer(buf.subarray(off, off + 32));
|
|
116
|
+
off += 32;
|
|
117
|
+
const blockTimestamp = buf.readBigUInt64BE(off);
|
|
118
|
+
off += 8;
|
|
119
|
+
const logDataLen = buf.readUInt32BE(off);
|
|
120
|
+
off += 4;
|
|
121
|
+
const logData: Fr[] = new Array(logDataLen);
|
|
122
|
+
for (let i = 0; i < logDataLen; i++) {
|
|
123
|
+
logData[i] = Fr.fromBuffer(buf.subarray(off, off + 32));
|
|
124
|
+
off += 32;
|
|
125
|
+
}
|
|
126
|
+
return { txHash, blockHash, blockTimestamp, logData };
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
/** Encodes the public-log key prefix as `contractHex-tagHex`. */
|
|
130
|
+
export function encodePublicPrefix(contractHex: string, tagHex: string): string {
|
|
131
|
+
return `${contractHex}${SEP}${tagHex}`;
|
|
132
|
+
}
|
|
@@ -14,6 +14,7 @@ import {
|
|
|
14
14
|
} from '@aztec/kv-store';
|
|
15
15
|
import { InboxLeaf } from '@aztec/stdlib/messaging';
|
|
16
16
|
|
|
17
|
+
import { L1ToL2MessagesNotReadyError } from '../errors.js';
|
|
17
18
|
import {
|
|
18
19
|
type InboxMessage,
|
|
19
20
|
deserializeInboxMessage,
|
|
@@ -40,6 +41,10 @@ export class MessageStore {
|
|
|
40
41
|
#lastSynchedL1Block: AztecAsyncSingleton<Buffer>;
|
|
41
42
|
/** Stores total messages stored */
|
|
42
43
|
#totalMessageCount: AztecAsyncSingleton<bigint>;
|
|
44
|
+
/** Stores the checkpoint number whose message tree is currently being filled on L1. */
|
|
45
|
+
#inboxTreeInProgress: AztecAsyncSingleton<bigint>;
|
|
46
|
+
/** Stores the L1 finalized block as of the last successful message sync. */
|
|
47
|
+
#messagesFinalizedL1Block: AztecAsyncSingleton<Buffer>;
|
|
43
48
|
|
|
44
49
|
#log = createLogger('archiver:message_store');
|
|
45
50
|
|
|
@@ -48,6 +53,8 @@ export class MessageStore {
|
|
|
48
53
|
this.#l1ToL2MessageIndices = db.openMap('archiver_l1_to_l2_message_indices');
|
|
49
54
|
this.#lastSynchedL1Block = db.openSingleton('archiver_last_l1_block_id');
|
|
50
55
|
this.#totalMessageCount = db.openSingleton('archiver_l1_to_l2_message_count');
|
|
56
|
+
this.#inboxTreeInProgress = db.openSingleton('archiver_inbox_tree_in_progress');
|
|
57
|
+
this.#messagesFinalizedL1Block = db.openSingleton('archiver_messages_finalized_l1_block');
|
|
51
58
|
}
|
|
52
59
|
|
|
53
60
|
public async getTotalL1ToL2MessageCount(): Promise<bigint> {
|
|
@@ -71,6 +78,26 @@ export class MessageStore {
|
|
|
71
78
|
await this.#lastSynchedL1Block.set(buffer);
|
|
72
79
|
}
|
|
73
80
|
|
|
81
|
+
/** Gets the L1 finalized block as of the last successful message sync. */
|
|
82
|
+
public async getMessagesFinalizedL1Block(): Promise<L1BlockId | undefined> {
|
|
83
|
+
const buffer = await this.#messagesFinalizedL1Block.getAsync();
|
|
84
|
+
if (!buffer) {
|
|
85
|
+
return undefined;
|
|
86
|
+
}
|
|
87
|
+
const reader = BufferReader.asReader(buffer);
|
|
88
|
+
return { l1BlockNumber: reader.readUInt256(), l1BlockHash: Buffer32.fromBuffer(reader.readBytes(Buffer32.SIZE)) };
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
/** Monotonically advances the persisted L1 finalized block for message sync. Never regresses. */
|
|
92
|
+
private async maybeAdvanceFinalizedL1Block(l1Block: L1BlockId): Promise<void> {
|
|
93
|
+
const existing = await this.getMessagesFinalizedL1Block();
|
|
94
|
+
if (existing && l1Block.l1BlockNumber <= existing.l1BlockNumber) {
|
|
95
|
+
return;
|
|
96
|
+
}
|
|
97
|
+
const buffer = serializeToBuffer([l1Block.l1BlockNumber, l1Block.l1BlockHash]);
|
|
98
|
+
await this.#messagesFinalizedL1Block.set(buffer);
|
|
99
|
+
}
|
|
100
|
+
|
|
74
101
|
/**
|
|
75
102
|
* Append L1 to L2 messages to the store.
|
|
76
103
|
* Requires new messages to be in order and strictly after the last message added.
|
|
@@ -157,15 +184,6 @@ export class MessageStore {
|
|
|
157
184
|
lastMessage = message;
|
|
158
185
|
}
|
|
159
186
|
|
|
160
|
-
// Update the L1 sync point to that of the last message added.
|
|
161
|
-
const currentSyncPoint = await this.getSynchedL1Block();
|
|
162
|
-
if (!currentSyncPoint || currentSyncPoint.l1BlockNumber < lastMessage!.l1BlockNumber) {
|
|
163
|
-
await this.setSynchedL1Block({
|
|
164
|
-
l1BlockNumber: lastMessage!.l1BlockNumber,
|
|
165
|
-
l1BlockHash: lastMessage!.l1BlockHash,
|
|
166
|
-
});
|
|
167
|
-
}
|
|
168
|
-
|
|
169
187
|
// Update total message count with the number of inserted messages.
|
|
170
188
|
await this.increaseTotalMessageCount(messageCount);
|
|
171
189
|
});
|
|
@@ -185,7 +203,39 @@ export class MessageStore {
|
|
|
185
203
|
return msg ? deserializeInboxMessage(msg) : undefined;
|
|
186
204
|
}
|
|
187
205
|
|
|
206
|
+
/** Returns the inbox tree-in-progress checkpoint number from L1, or undefined if not yet set. */
|
|
207
|
+
public getInboxTreeInProgress(): Promise<bigint | undefined> {
|
|
208
|
+
return this.#inboxTreeInProgress.getAsync();
|
|
209
|
+
}
|
|
210
|
+
|
|
211
|
+
/**
|
|
212
|
+
* Atomically updates the message sync state: the L1 sync point, the inbox tree-in-progress marker, and
|
|
213
|
+
* (optionally) the L1 finalized block as of this sync. The finalized block is advanced monotonically.
|
|
214
|
+
*/
|
|
215
|
+
public setMessageSyncState(
|
|
216
|
+
l1Block: L1BlockId,
|
|
217
|
+
treeInProgress: bigint | undefined,
|
|
218
|
+
finalizedL1Block?: L1BlockId,
|
|
219
|
+
): Promise<void> {
|
|
220
|
+
return this.db.transactionAsync(async () => {
|
|
221
|
+
await this.setSynchedL1Block(l1Block);
|
|
222
|
+
if (treeInProgress !== undefined) {
|
|
223
|
+
await this.#inboxTreeInProgress.set(treeInProgress);
|
|
224
|
+
} else {
|
|
225
|
+
await this.#inboxTreeInProgress.delete();
|
|
226
|
+
}
|
|
227
|
+
if (finalizedL1Block !== undefined) {
|
|
228
|
+
await this.maybeAdvanceFinalizedL1Block(finalizedL1Block);
|
|
229
|
+
}
|
|
230
|
+
});
|
|
231
|
+
}
|
|
232
|
+
|
|
188
233
|
public async getL1ToL2Messages(checkpointNumber: CheckpointNumber): Promise<Fr[]> {
|
|
234
|
+
const treeInProgress = await this.#inboxTreeInProgress.getAsync();
|
|
235
|
+
if (treeInProgress !== undefined && BigInt(checkpointNumber) >= treeInProgress) {
|
|
236
|
+
throw new L1ToL2MessagesNotReadyError(checkpointNumber, treeInProgress);
|
|
237
|
+
}
|
|
238
|
+
|
|
189
239
|
const messages: Fr[] = [];
|
|
190
240
|
|
|
191
241
|
const [startIndex, endIndex] = InboxLeaf.indexRangeForCheckpoint(checkpointNumber);
|
|
@@ -1,5 +1,6 @@
|
|
|
1
1
|
import type { BlobClientInterface } from '@aztec/blob-client/client';
|
|
2
2
|
import { type Blob, getBlobsPerL1Block, getPrefixedEthBlobCommitments } from '@aztec/blob-lib';
|
|
3
|
+
import { INITIAL_CHECKPOINT_NUMBER } from '@aztec/constants';
|
|
3
4
|
import type { CheckpointProposedLog, InboxContract, MessageSentLog, RollupContract } from '@aztec/ethereum/contracts';
|
|
4
5
|
import { MULTI_CALL_3_ADDRESS } from '@aztec/ethereum/contracts';
|
|
5
6
|
import type { ViemPublicClient } from '@aztec/ethereum/types';
|
|
@@ -14,12 +15,8 @@ import { CommitteeAttestation, CommitteeAttestationsAndSigners, L2Block } from '
|
|
|
14
15
|
import { Checkpoint } from '@aztec/stdlib/checkpoint';
|
|
15
16
|
import { getSlotAtTimestamp } from '@aztec/stdlib/epoch-helpers';
|
|
16
17
|
import { InboxLeaf } from '@aztec/stdlib/messaging';
|
|
17
|
-
import { ConsensusPayload,
|
|
18
|
-
import {
|
|
19
|
-
makeAndSignCommitteeAttestationsAndSigners,
|
|
20
|
-
makeCheckpointAttestationFromCheckpoint,
|
|
21
|
-
mockCheckpointAndMessages,
|
|
22
|
-
} from '@aztec/stdlib/testing';
|
|
18
|
+
import { ConsensusPayload, getHashedSignaturePayloadTypedData } from '@aztec/stdlib/p2p';
|
|
19
|
+
import { mockCheckpointAndMessages } from '@aztec/stdlib/testing';
|
|
23
20
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
24
21
|
|
|
25
22
|
import { type MockProxy, mock } from 'jest-mock-extended';
|
|
@@ -150,8 +147,10 @@ export class FakeL1State {
|
|
|
150
147
|
// Computed from checkpoints based on L1 block visibility
|
|
151
148
|
private pendingCheckpointNumber: CheckpointNumber = CheckpointNumber(0);
|
|
152
149
|
|
|
153
|
-
// The L1 block number reported as "finalized" (defaults to the start block)
|
|
154
|
-
|
|
150
|
+
// The L1 block number reported as "finalized" (defaults to the start block).
|
|
151
|
+
// `undefined` simulates the startup window on a fresh devnet where
|
|
152
|
+
// `getBlock({ blockTag: 'finalized' })` fails with "finalized block not found".
|
|
153
|
+
private finalizedL1BlockNumber: bigint | undefined;
|
|
155
154
|
|
|
156
155
|
constructor(private readonly config: FakeL1StateConfig) {
|
|
157
156
|
this.l1BlockNumber = config.l1StartBlock;
|
|
@@ -287,8 +286,11 @@ export class FakeL1State {
|
|
|
287
286
|
this.updatePendingCheckpointNumber();
|
|
288
287
|
}
|
|
289
288
|
|
|
290
|
-
/**
|
|
291
|
-
|
|
289
|
+
/**
|
|
290
|
+
* Sets the L1 block number that will be reported as "finalized". Pass `undefined` to
|
|
291
|
+
* simulate a chain that does not yet have a finalized block (devnet startup).
|
|
292
|
+
*/
|
|
293
|
+
setFinalizedL1BlockNumber(blockNumber: bigint | undefined): void {
|
|
292
294
|
this.finalizedL1BlockNumber = blockNumber;
|
|
293
295
|
}
|
|
294
296
|
|
|
@@ -331,6 +333,21 @@ export class FakeL1State {
|
|
|
331
333
|
this.updatePendingCheckpointNumber();
|
|
332
334
|
}
|
|
333
335
|
|
|
336
|
+
/**
|
|
337
|
+
* Moves a checkpoint to a different L1 block number (simulates L1 reorg that
|
|
338
|
+
* re-includes the same checkpoint transaction in a different block).
|
|
339
|
+
* The checkpoint content stays the same — only the L1 metadata changes.
|
|
340
|
+
* Auto-updates pending status.
|
|
341
|
+
*/
|
|
342
|
+
moveCheckpointToL1Block(checkpointNumber: CheckpointNumber, newL1BlockNumber: bigint): void {
|
|
343
|
+
for (const cpData of this.checkpoints) {
|
|
344
|
+
if (cpData.checkpointNumber === checkpointNumber) {
|
|
345
|
+
cpData.l1BlockNumber = newL1BlockNumber;
|
|
346
|
+
}
|
|
347
|
+
}
|
|
348
|
+
this.updatePendingCheckpointNumber();
|
|
349
|
+
}
|
|
350
|
+
|
|
334
351
|
/**
|
|
335
352
|
* Removes messages after a given total index (simulates L1 reorg).
|
|
336
353
|
* Auto-updates rolling hash.
|
|
@@ -450,21 +467,44 @@ export class FakeL1State {
|
|
|
450
467
|
createMockInboxContract(_publicClient: MockProxy<ViemPublicClient>): MockProxy<InboxContract> {
|
|
451
468
|
const mockInbox = mock<InboxContract>();
|
|
452
469
|
|
|
453
|
-
mockInbox.getState.mockImplementation(() =>
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
470
|
+
mockInbox.getState.mockImplementation((opts: { blockTag?: string; blockNumber?: bigint } = {}) => {
|
|
471
|
+
// Filter messages visible at the given block number (or all if not specified)
|
|
472
|
+
const blockNumber = opts.blockNumber ?? this.l1BlockNumber;
|
|
473
|
+
const visibleMessages = this.messages.filter(m => m.l1BlockNumber <= blockNumber);
|
|
474
|
+
|
|
475
|
+
// treeInProgress must be > any sealed checkpoint. On L1, a checkpoint can only be proposed
|
|
476
|
+
// after its messages are sealed, so treeInProgress > checkpointNumber for all published checkpoints.
|
|
477
|
+
const maxFromMessages =
|
|
478
|
+
visibleMessages.length > 0 ? Math.max(...visibleMessages.map(m => Number(m.checkpointNumber))) + 1 : 0;
|
|
479
|
+
const maxFromCheckpoints =
|
|
480
|
+
this.checkpoints.length > 0
|
|
481
|
+
? Math.max(
|
|
482
|
+
...this.checkpoints
|
|
483
|
+
.filter(cp => !cp.pruned && cp.l1BlockNumber <= blockNumber)
|
|
484
|
+
.map(cp => Number(cp.checkpointNumber)),
|
|
485
|
+
0,
|
|
486
|
+
) + 1
|
|
487
|
+
: 0;
|
|
488
|
+
const treeInProgress = Math.max(maxFromMessages, maxFromCheckpoints, INITIAL_CHECKPOINT_NUMBER);
|
|
489
|
+
|
|
490
|
+
// Compute rolling hash only for visible messages
|
|
491
|
+
const rollingHash =
|
|
492
|
+
visibleMessages.length > 0 ? visibleMessages[visibleMessages.length - 1].rollingHash : Buffer16.ZERO;
|
|
493
|
+
|
|
494
|
+
return Promise.resolve({
|
|
495
|
+
messagesRollingHash: rollingHash,
|
|
496
|
+
totalMessagesInserted: BigInt(visibleMessages.length),
|
|
497
|
+
treeInProgress: BigInt(treeInProgress),
|
|
498
|
+
});
|
|
499
|
+
});
|
|
460
500
|
|
|
461
501
|
// Mock the wrapper methods for fetching message events
|
|
462
502
|
mockInbox.getMessageSentEvents.mockImplementation((fromBlock: bigint, toBlock: bigint) =>
|
|
463
503
|
Promise.resolve(this.getMessageSentLogs(fromBlock, toBlock)),
|
|
464
504
|
);
|
|
465
505
|
|
|
466
|
-
mockInbox.getMessageSentEventByHash.mockImplementation((
|
|
467
|
-
Promise.resolve(this.
|
|
506
|
+
mockInbox.getMessageSentEventByHash.mockImplementation((msgHash: string, aroundL1BlockNumber: bigint) =>
|
|
507
|
+
Promise.resolve(this.getMessageSentLogByHash(msgHash, aroundL1BlockNumber) as MessageSentLog),
|
|
468
508
|
);
|
|
469
509
|
|
|
470
510
|
return mockInbox;
|
|
@@ -475,11 +515,19 @@ export class FakeL1State {
|
|
|
475
515
|
const publicClient = mock<ViemPublicClient>();
|
|
476
516
|
|
|
477
517
|
publicClient.getChainId.mockResolvedValue(1);
|
|
518
|
+
// Several consumers (CalldataRetriever, ArchiverL1Synchronizer) derive the EIP-712 signing
|
|
519
|
+
// context from `publicClient.chain.id`. Pin it so it matches `getSignatureContext()` below.
|
|
520
|
+
(publicClient as unknown as { chain: { id: number } }).chain = { id: 1 };
|
|
478
521
|
publicClient.getBlockNumber.mockImplementation(() => Promise.resolve(this.l1BlockNumber));
|
|
479
522
|
|
|
480
523
|
publicClient.getBlock.mockImplementation((async (args: { blockNumber?: bigint; blockTag?: string } = {}) => {
|
|
481
524
|
let blockNum: bigint;
|
|
482
525
|
if (args.blockTag === 'finalized') {
|
|
526
|
+
if (this.finalizedL1BlockNumber === undefined) {
|
|
527
|
+
throw Object.assign(new Error('finalized block not found'), {
|
|
528
|
+
details: 'finalized block not found',
|
|
529
|
+
});
|
|
530
|
+
}
|
|
483
531
|
blockNum = this.finalizedL1BlockNumber;
|
|
484
532
|
} else {
|
|
485
533
|
blockNum = args.blockNumber ?? (await publicClient.getBlockNumber());
|
|
@@ -505,10 +553,10 @@ export class FakeL1State {
|
|
|
505
553
|
createMockBlobClient(): MockProxy<BlobClientInterface> {
|
|
506
554
|
const blobClient = mock<BlobClientInterface>();
|
|
507
555
|
|
|
508
|
-
// The blockId is the
|
|
556
|
+
// The blockId is the L1 block hash, which we derive from the L1 block number
|
|
509
557
|
blobClient.getBlobSidecar.mockImplementation((blockId: `0x${string}`) =>
|
|
510
558
|
Promise.resolve(
|
|
511
|
-
this.checkpoints.find(cpData => cpData.
|
|
559
|
+
this.checkpoints.find(cpData => Buffer32.fromBigInt(cpData.l1BlockNumber).toString() === blockId)?.blobs ?? [],
|
|
512
560
|
),
|
|
513
561
|
);
|
|
514
562
|
|
|
@@ -584,13 +632,38 @@ export class FakeL1State {
|
|
|
584
632
|
}));
|
|
585
633
|
}
|
|
586
634
|
|
|
635
|
+
private getMessageSentLogByHash(msgHash: string, aroundL1BlockNumber: bigint): MessageSentLog | undefined {
|
|
636
|
+
const msg = this.messages.find(
|
|
637
|
+
msg =>
|
|
638
|
+
msg.leaf.toString() === msgHash &&
|
|
639
|
+
msg.l1BlockNumber >= aroundL1BlockNumber - 5n &&
|
|
640
|
+
msg.l1BlockNumber <= aroundL1BlockNumber + 5n,
|
|
641
|
+
);
|
|
642
|
+
if (!msg) {
|
|
643
|
+
return undefined;
|
|
644
|
+
}
|
|
645
|
+
return {
|
|
646
|
+
l1BlockNumber: msg.l1BlockNumber,
|
|
647
|
+
l1BlockHash: Buffer32.fromBigInt(msg.l1BlockNumber),
|
|
648
|
+
l1TransactionHash: `0x${msg.l1BlockNumber.toString(16)}` as `0x${string}`,
|
|
649
|
+
args: {
|
|
650
|
+
checkpointNumber: msg.checkpointNumber,
|
|
651
|
+
index: msg.index,
|
|
652
|
+
leaf: msg.leaf,
|
|
653
|
+
rollingHash: msg.rollingHash,
|
|
654
|
+
},
|
|
655
|
+
};
|
|
656
|
+
}
|
|
657
|
+
|
|
587
658
|
private async makeRollupTx(
|
|
588
659
|
checkpoint: Checkpoint,
|
|
589
660
|
signers: Secp256k1Signer[],
|
|
590
661
|
): Promise<{ tx: Transaction; attestationsHash: Buffer32; payloadDigest: Buffer32 }> {
|
|
662
|
+
const signatureContext = this.getSignatureContext();
|
|
663
|
+
const consensusPayload = ConsensusPayload.fromCheckpoint(checkpoint, signatureContext);
|
|
664
|
+
const attestationDigest = getHashedSignaturePayloadTypedData(consensusPayload);
|
|
591
665
|
const attestations = signers
|
|
592
|
-
.map(signer =>
|
|
593
|
-
.map(attestation => CommitteeAttestation.fromSignature(attestation.signature))
|
|
666
|
+
.map(signer => CommitteeAttestation.fromSignature(signer.sign(attestationDigest)))
|
|
594
667
|
.map(committeeAttestation => committeeAttestation.toViem());
|
|
595
668
|
|
|
596
669
|
const header = checkpoint.header.toViem();
|
|
@@ -598,11 +671,15 @@ export class FakeL1State {
|
|
|
598
671
|
const archive = toHex(checkpoint.archive.root.toBuffer());
|
|
599
672
|
const attestationsAndSigners = new CommitteeAttestationsAndSigners(
|
|
600
673
|
attestations.map(attestation => CommitteeAttestation.fromViem(attestation)),
|
|
674
|
+
signatureContext,
|
|
601
675
|
);
|
|
602
676
|
|
|
603
|
-
|
|
604
|
-
|
|
605
|
-
|
|
677
|
+
// Fall back to a random signer when no attesters are provided, so tests that
|
|
678
|
+
// don't care about the proposer identity (e.g. sync tests) still produce a
|
|
679
|
+
// valid-looking signature for the attestationsAndSigners struct.
|
|
680
|
+
const proposerSigner = signers[0] ?? Secp256k1Signer.random();
|
|
681
|
+
const attestationsAndSignersSignature = proposerSigner.sign(
|
|
682
|
+
getHashedSignaturePayloadTypedData(attestationsAndSigners),
|
|
606
683
|
);
|
|
607
684
|
|
|
608
685
|
const packedAttestations = attestationsAndSigners.getPackedAttestations();
|
|
@@ -643,9 +720,7 @@ export class FakeL1State {
|
|
|
643
720
|
);
|
|
644
721
|
|
|
645
722
|
// Compute payloadDigest (same logic as CalldataRetriever)
|
|
646
|
-
const
|
|
647
|
-
const payloadToSign = consensusPayload.getPayloadToSign(SignatureDomainSeparator.checkpointAttestation);
|
|
648
|
-
const payloadDigest = Buffer32.fromString(keccak256(payloadToSign));
|
|
723
|
+
const payloadDigest = getHashedSignaturePayloadTypedData(consensusPayload);
|
|
649
724
|
|
|
650
725
|
const tx = {
|
|
651
726
|
input: multiCallInput,
|
|
@@ -657,6 +732,13 @@ export class FakeL1State {
|
|
|
657
732
|
return { tx, attestationsHash, payloadDigest };
|
|
658
733
|
}
|
|
659
734
|
|
|
735
|
+
private getSignatureContext() {
|
|
736
|
+
return {
|
|
737
|
+
chainId: 1,
|
|
738
|
+
rollupAddress: this.config.rollupAddress,
|
|
739
|
+
};
|
|
740
|
+
}
|
|
741
|
+
|
|
660
742
|
/** Extracts the CommitteeAttestations struct definition from RollupAbi for hash computation. */
|
|
661
743
|
private getCommitteeAttestationsStructDef(): AbiParameter {
|
|
662
744
|
const proposeFunction = RollupAbi.find(item => item.type === 'function' && item.name === 'propose') as
|