@aztec/archiver 0.0.1-commit.7b97ef96e → 0.0.1-commit.7cbc774
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 +36 -17
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +257 -75
- package/dest/config.d.ts +6 -3
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +23 -15
- package/dest/errors.d.ts +55 -9
- package/dest/errors.d.ts.map +1 -1
- package/dest/errors.js +81 -14
- package/dest/factory.d.ts +13 -9
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +48 -39
- package/dest/index.d.ts +11 -3
- package/dest/index.d.ts.map +1 -1
- package/dest/index.js +10 -2
- package/dest/l1/bin/retrieve-calldata.js +32 -28
- package/dest/l1/calldata_retriever.d.ts +71 -53
- package/dest/l1/calldata_retriever.d.ts.map +1 -1
- package/dest/l1/calldata_retriever.js +190 -262
- package/dest/l1/data_retrieval.d.ts +24 -16
- package/dest/l1/data_retrieval.d.ts.map +1 -1
- package/dest/l1/data_retrieval.js +39 -45
- package/dest/l1/spire_proposer.d.ts +5 -5
- package/dest/l1/spire_proposer.d.ts.map +1 -1
- package/dest/l1/spire_proposer.js +9 -17
- 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 +70 -46
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +270 -135
- package/dest/modules/data_store_updater.d.ts +42 -17
- package/dest/modules/data_store_updater.d.ts.map +1 -1
- package/dest/modules/data_store_updater.js +191 -122
- 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 +12 -11
- package/dest/modules/l1_synchronizer.d.ts.map +1 -1
- package/dest/modules/l1_synchronizer.js +439 -207
- 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 +174 -70
- package/dest/store/block_store.d.ts.map +1 -1
- package/dest/store/block_store.js +696 -250
- 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 +51 -9
- package/dest/test/fake_l1_state.d.ts +22 -1
- package/dest/test/fake_l1_state.d.ts.map +1 -1
- package/dest/test/fake_l1_state.js +152 -24
- 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 +52 -46
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +246 -170
- package/dest/test/mock_structs.d.ts +4 -1
- package/dest/test/mock_structs.d.ts.map +1 -1
- package/dest/test/mock_structs.js +13 -1
- package/dest/test/noop_l1_archiver.d.ts +12 -6
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +26 -9
- package/package.json +14 -14
- package/src/archiver.ts +313 -75
- package/src/config.ts +32 -12
- package/src/errors.ts +122 -21
- package/src/factory.ts +54 -30
- package/src/index.ts +18 -2
- package/src/l1/README.md +25 -68
- package/src/l1/bin/retrieve-calldata.ts +40 -27
- package/src/l1/calldata_retriever.ts +243 -384
- package/src/l1/data_retrieval.ts +55 -69
- package/src/l1/spire_proposer.ts +7 -15
- 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 +336 -171
- package/src/modules/data_store_updater.ts +224 -154
- package/src/modules/instrumentation.ts +48 -8
- package/src/modules/l1_synchronizer.ts +579 -254
- package/src/modules/validation.ts +10 -9
- package/src/store/block_store.ts +865 -290
- 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 +60 -10
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +198 -35
- package/src/test/mock_l1_to_l2_message_source.ts +1 -0
- package/src/test/mock_l2_block_source.ts +309 -205
- package/src/test/mock_structs.ts +20 -6
- package/src/test/noop_l1_archiver.ts +39 -9
- package/dest/store/kv_archiver_store.d.ts +0 -354
- package/dest/store/kv_archiver_store.d.ts.map +0 -1
- package/dest/store/kv_archiver_store.js +0 -464
- package/src/store/kv_archiver_store.ts +0 -671
|
@@ -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.
|
|
@@ -137,7 +164,7 @@ export class MessageStore {
|
|
|
137
164
|
);
|
|
138
165
|
}
|
|
139
166
|
|
|
140
|
-
// Check the first message in a
|
|
167
|
+
// Check the first message in a checkpoint has the correct index.
|
|
141
168
|
if (
|
|
142
169
|
(!lastMessage || message.checkpointNumber > lastMessage.checkpointNumber) &&
|
|
143
170
|
message.index !== expectedStart
|
|
@@ -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,15 +15,21 @@ 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 {
|
|
18
|
-
|
|
19
|
-
makeCheckpointAttestationFromCheckpoint,
|
|
20
|
-
mockCheckpointAndMessages,
|
|
21
|
-
} from '@aztec/stdlib/testing';
|
|
18
|
+
import { ConsensusPayload, getHashedSignaturePayloadTypedData } from '@aztec/stdlib/p2p';
|
|
19
|
+
import { mockCheckpointAndMessages } from '@aztec/stdlib/testing';
|
|
22
20
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
23
21
|
|
|
24
22
|
import { type MockProxy, mock } from 'jest-mock-extended';
|
|
25
|
-
import {
|
|
23
|
+
import {
|
|
24
|
+
type AbiParameter,
|
|
25
|
+
type FormattedBlock,
|
|
26
|
+
type Transaction,
|
|
27
|
+
encodeAbiParameters,
|
|
28
|
+
encodeFunctionData,
|
|
29
|
+
keccak256,
|
|
30
|
+
multicall3Abi,
|
|
31
|
+
toHex,
|
|
32
|
+
} from 'viem';
|
|
26
33
|
|
|
27
34
|
import { updateRollingHash } from '../structs/inbox_message.js';
|
|
28
35
|
|
|
@@ -87,6 +94,10 @@ type CheckpointData = {
|
|
|
87
94
|
blobHashes: `0x${string}`[];
|
|
88
95
|
blobs: Blob[];
|
|
89
96
|
signers: Secp256k1Signer[];
|
|
97
|
+
/** Hash of the packed attestations, matching what the L1 event emits. */
|
|
98
|
+
attestationsHash: Buffer32;
|
|
99
|
+
/** Payload digest, matching what the L1 event emits. */
|
|
100
|
+
payloadDigest: Buffer32;
|
|
90
101
|
/** If true, archiveAt will ignore it */
|
|
91
102
|
pruned?: boolean;
|
|
92
103
|
};
|
|
@@ -136,8 +147,14 @@ export class FakeL1State {
|
|
|
136
147
|
// Computed from checkpoints based on L1 block visibility
|
|
137
148
|
private pendingCheckpointNumber: CheckpointNumber = CheckpointNumber(0);
|
|
138
149
|
|
|
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;
|
|
154
|
+
|
|
139
155
|
constructor(private readonly config: FakeL1StateConfig) {
|
|
140
156
|
this.l1BlockNumber = config.l1StartBlock;
|
|
157
|
+
this.finalizedL1BlockNumber = config.l1StartBlock;
|
|
141
158
|
this.lastArchive = new AppendOnlyTreeSnapshot(config.genesisArchiveRoot, 1);
|
|
142
159
|
}
|
|
143
160
|
|
|
@@ -194,8 +211,8 @@ export class FakeL1State {
|
|
|
194
211
|
// Store the messages internally so they match the checkpoint's inHash
|
|
195
212
|
this.addMessages(checkpointNumber, messagesL1BlockNumber, messages);
|
|
196
213
|
|
|
197
|
-
// Create the transaction and
|
|
198
|
-
const tx = await this.makeRollupTx(checkpoint, signers);
|
|
214
|
+
// Create the transaction, blobs, and event hashes
|
|
215
|
+
const { tx, attestationsHash, payloadDigest } = await this.makeRollupTx(checkpoint, signers);
|
|
199
216
|
const blobHashes = await this.makeVersionedBlobHashes(checkpoint);
|
|
200
217
|
const blobs = await this.makeBlobsFromCheckpoint(checkpoint);
|
|
201
218
|
|
|
@@ -208,6 +225,8 @@ export class FakeL1State {
|
|
|
208
225
|
blobHashes,
|
|
209
226
|
blobs,
|
|
210
227
|
signers,
|
|
228
|
+
attestationsHash,
|
|
229
|
+
payloadDigest,
|
|
211
230
|
});
|
|
212
231
|
|
|
213
232
|
// Update last archive for auto-chaining
|
|
@@ -267,11 +286,33 @@ export class FakeL1State {
|
|
|
267
286
|
this.updatePendingCheckpointNumber();
|
|
268
287
|
}
|
|
269
288
|
|
|
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 {
|
|
294
|
+
this.finalizedL1BlockNumber = blockNumber;
|
|
295
|
+
}
|
|
296
|
+
|
|
270
297
|
/** Marks a checkpoint as proven. Updates provenCheckpointNumber. */
|
|
271
298
|
markCheckpointAsProven(checkpointNumber: CheckpointNumber): void {
|
|
272
299
|
this.provenCheckpointNumber = checkpointNumber;
|
|
273
300
|
}
|
|
274
301
|
|
|
302
|
+
/**
|
|
303
|
+
* Simulates what `rollup.getProvenCheckpointNumber({ blockNumber: atL1Block })` would return.
|
|
304
|
+
*/
|
|
305
|
+
getProvenCheckpointNumberAtL1Block(atL1Block: bigint): CheckpointNumber {
|
|
306
|
+
if (this.provenCheckpointNumber === 0) {
|
|
307
|
+
return CheckpointNumber(0);
|
|
308
|
+
}
|
|
309
|
+
const checkpoint = this.checkpoints.find(cp => cp.checkpointNumber === this.provenCheckpointNumber);
|
|
310
|
+
if (checkpoint && checkpoint.l1BlockNumber <= atL1Block) {
|
|
311
|
+
return this.provenCheckpointNumber;
|
|
312
|
+
}
|
|
313
|
+
return CheckpointNumber(0);
|
|
314
|
+
}
|
|
315
|
+
|
|
275
316
|
/** Sets the target committee size for attestation validation. */
|
|
276
317
|
setTargetCommitteeSize(size: number): void {
|
|
277
318
|
this.targetCommitteeSize = size;
|
|
@@ -292,6 +333,21 @@ export class FakeL1State {
|
|
|
292
333
|
this.updatePendingCheckpointNumber();
|
|
293
334
|
}
|
|
294
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
|
+
|
|
295
351
|
/**
|
|
296
352
|
* Removes messages after a given total index (simulates L1 reorg).
|
|
297
353
|
* Auto-updates rolling hash.
|
|
@@ -390,6 +446,11 @@ export class FakeL1State {
|
|
|
390
446
|
});
|
|
391
447
|
});
|
|
392
448
|
|
|
449
|
+
mockRollup.getProvenCheckpointNumber.mockImplementation((options?: { blockNumber?: bigint }) => {
|
|
450
|
+
const atBlock = options?.blockNumber ?? this.l1BlockNumber;
|
|
451
|
+
return Promise.resolve(this.getProvenCheckpointNumberAtL1Block(atBlock));
|
|
452
|
+
});
|
|
453
|
+
|
|
393
454
|
mockRollup.canPruneAtTime.mockImplementation(() => Promise.resolve(this.canPruneResult));
|
|
394
455
|
|
|
395
456
|
// Mock the wrapper method for fetching checkpoint events
|
|
@@ -406,21 +467,44 @@ export class FakeL1State {
|
|
|
406
467
|
createMockInboxContract(_publicClient: MockProxy<ViemPublicClient>): MockProxy<InboxContract> {
|
|
407
468
|
const mockInbox = mock<InboxContract>();
|
|
408
469
|
|
|
409
|
-
mockInbox.getState.mockImplementation(() =>
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
|
|
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
|
+
});
|
|
416
500
|
|
|
417
501
|
// Mock the wrapper methods for fetching message events
|
|
418
502
|
mockInbox.getMessageSentEvents.mockImplementation((fromBlock: bigint, toBlock: bigint) =>
|
|
419
503
|
Promise.resolve(this.getMessageSentLogs(fromBlock, toBlock)),
|
|
420
504
|
);
|
|
421
505
|
|
|
422
|
-
mockInbox.getMessageSentEventByHash.mockImplementation((
|
|
423
|
-
Promise.resolve(this.
|
|
506
|
+
mockInbox.getMessageSentEventByHash.mockImplementation((msgHash: string, aroundL1BlockNumber: bigint) =>
|
|
507
|
+
Promise.resolve(this.getMessageSentLogByHash(msgHash, aroundL1BlockNumber) as MessageSentLog),
|
|
424
508
|
);
|
|
425
509
|
|
|
426
510
|
return mockInbox;
|
|
@@ -431,12 +515,23 @@ export class FakeL1State {
|
|
|
431
515
|
const publicClient = mock<ViemPublicClient>();
|
|
432
516
|
|
|
433
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 };
|
|
434
521
|
publicClient.getBlockNumber.mockImplementation(() => Promise.resolve(this.l1BlockNumber));
|
|
435
522
|
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
523
|
+
publicClient.getBlock.mockImplementation((async (args: { blockNumber?: bigint; blockTag?: string } = {}) => {
|
|
524
|
+
let blockNum: bigint;
|
|
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
|
+
}
|
|
531
|
+
blockNum = this.finalizedL1BlockNumber;
|
|
532
|
+
} else {
|
|
533
|
+
blockNum = args.blockNumber ?? (await publicClient.getBlockNumber());
|
|
534
|
+
}
|
|
440
535
|
return {
|
|
441
536
|
number: blockNum,
|
|
442
537
|
timestamp: BigInt(blockNum) * BigInt(this.config.ethereumSlotDuration) + this.config.l1GenesisTime,
|
|
@@ -458,10 +553,10 @@ export class FakeL1State {
|
|
|
458
553
|
createMockBlobClient(): MockProxy<BlobClientInterface> {
|
|
459
554
|
const blobClient = mock<BlobClientInterface>();
|
|
460
555
|
|
|
461
|
-
// The blockId is the
|
|
556
|
+
// The blockId is the L1 block hash, which we derive from the L1 block number
|
|
462
557
|
blobClient.getBlobSidecar.mockImplementation((blockId: `0x${string}`) =>
|
|
463
558
|
Promise.resolve(
|
|
464
|
-
this.checkpoints.find(cpData => cpData.
|
|
559
|
+
this.checkpoints.find(cpData => Buffer32.fromBigInt(cpData.l1BlockNumber).toString() === blockId)?.blobs ?? [],
|
|
465
560
|
),
|
|
466
561
|
);
|
|
467
562
|
|
|
@@ -510,10 +605,8 @@ export class FakeL1State {
|
|
|
510
605
|
checkpointNumber: cpData.checkpointNumber,
|
|
511
606
|
archive: cpData.checkpoint.archive.root,
|
|
512
607
|
versionedBlobHashes: cpData.blobHashes.map(h => Buffer.from(h.slice(2), 'hex')),
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
payloadDigest: undefined,
|
|
516
|
-
attestationsHash: undefined,
|
|
608
|
+
attestationsHash: cpData.attestationsHash,
|
|
609
|
+
payloadDigest: cpData.payloadDigest,
|
|
517
610
|
},
|
|
518
611
|
}));
|
|
519
612
|
}
|
|
@@ -539,10 +632,38 @@ export class FakeL1State {
|
|
|
539
632
|
}));
|
|
540
633
|
}
|
|
541
634
|
|
|
542
|
-
private
|
|
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
|
+
|
|
658
|
+
private async makeRollupTx(
|
|
659
|
+
checkpoint: Checkpoint,
|
|
660
|
+
signers: Secp256k1Signer[],
|
|
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);
|
|
543
665
|
const attestations = signers
|
|
544
|
-
.map(signer =>
|
|
545
|
-
.map(attestation => CommitteeAttestation.fromSignature(attestation.signature))
|
|
666
|
+
.map(signer => CommitteeAttestation.fromSignature(signer.sign(attestationDigest)))
|
|
546
667
|
.map(committeeAttestation => committeeAttestation.toViem());
|
|
547
668
|
|
|
548
669
|
const header = checkpoint.header.toViem();
|
|
@@ -550,13 +671,19 @@ export class FakeL1State {
|
|
|
550
671
|
const archive = toHex(checkpoint.archive.root.toBuffer());
|
|
551
672
|
const attestationsAndSigners = new CommitteeAttestationsAndSigners(
|
|
552
673
|
attestations.map(attestation => CommitteeAttestation.fromViem(attestation)),
|
|
674
|
+
signatureContext,
|
|
553
675
|
);
|
|
554
676
|
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
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),
|
|
558
683
|
);
|
|
559
684
|
|
|
685
|
+
const packedAttestations = attestationsAndSigners.getPackedAttestations();
|
|
686
|
+
|
|
560
687
|
const rollupInput = encodeFunctionData({
|
|
561
688
|
abi: RollupAbi,
|
|
562
689
|
functionName: 'propose',
|
|
@@ -566,7 +693,7 @@ export class FakeL1State {
|
|
|
566
693
|
archive,
|
|
567
694
|
oracleInput: { feeAssetPriceModifier: 0n },
|
|
568
695
|
},
|
|
569
|
-
|
|
696
|
+
packedAttestations,
|
|
570
697
|
attestationsAndSigners.getSigners().map(signer => signer.toString()),
|
|
571
698
|
attestationsAndSignersSignature.toViemSignature(),
|
|
572
699
|
blobInput,
|
|
@@ -587,12 +714,48 @@ export class FakeL1State {
|
|
|
587
714
|
],
|
|
588
715
|
});
|
|
589
716
|
|
|
590
|
-
|
|
717
|
+
// Compute attestationsHash (same logic as CalldataRetriever)
|
|
718
|
+
const attestationsHash = Buffer32.fromString(
|
|
719
|
+
keccak256(encodeAbiParameters([this.getCommitteeAttestationsStructDef()], [packedAttestations])),
|
|
720
|
+
);
|
|
721
|
+
|
|
722
|
+
// Compute payloadDigest (same logic as CalldataRetriever)
|
|
723
|
+
const payloadDigest = getHashedSignaturePayloadTypedData(consensusPayload);
|
|
724
|
+
|
|
725
|
+
const tx = {
|
|
591
726
|
input: multiCallInput,
|
|
592
727
|
hash: archive,
|
|
593
728
|
blockHash: archive,
|
|
594
729
|
to: MULTI_CALL_3_ADDRESS as `0x${string}`,
|
|
595
730
|
} as Transaction<bigint, number>;
|
|
731
|
+
|
|
732
|
+
return { tx, attestationsHash, payloadDigest };
|
|
733
|
+
}
|
|
734
|
+
|
|
735
|
+
private getSignatureContext() {
|
|
736
|
+
return {
|
|
737
|
+
chainId: 1,
|
|
738
|
+
rollupAddress: this.config.rollupAddress,
|
|
739
|
+
};
|
|
740
|
+
}
|
|
741
|
+
|
|
742
|
+
/** Extracts the CommitteeAttestations struct definition from RollupAbi for hash computation. */
|
|
743
|
+
private getCommitteeAttestationsStructDef(): AbiParameter {
|
|
744
|
+
const proposeFunction = RollupAbi.find(item => item.type === 'function' && item.name === 'propose') as
|
|
745
|
+
| { type: 'function'; name: string; inputs: readonly AbiParameter[] }
|
|
746
|
+
| undefined;
|
|
747
|
+
|
|
748
|
+
if (!proposeFunction) {
|
|
749
|
+
throw new Error('propose function not found in RollupAbi');
|
|
750
|
+
}
|
|
751
|
+
|
|
752
|
+
const attestationsParam = proposeFunction.inputs.find(param => param.name === '_attestations');
|
|
753
|
+
if (!attestationsParam) {
|
|
754
|
+
throw new Error('_attestations parameter not found in propose function');
|
|
755
|
+
}
|
|
756
|
+
|
|
757
|
+
const tupleParam = attestationsParam as unknown as { type: 'tuple'; components?: readonly AbiParameter[] };
|
|
758
|
+
return { type: 'tuple', components: tupleParam.components || [] } as AbiParameter;
|
|
596
759
|
}
|
|
597
760
|
|
|
598
761
|
private async makeVersionedBlobHashes(checkpoint: Checkpoint): Promise<`0x${string}`[]> {
|