@aztec/archiver 5.0.0-private.20260319 → 5.0.0-rc.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +19 -13
- package/dest/archiver.d.ts +71 -15
- package/dest/archiver.d.ts.map +1 -1
- package/dest/archiver.js +268 -74
- package/dest/config.d.ts +7 -3
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +39 -16
- package/dest/errors.d.ts +44 -10
- package/dest/errors.d.ts.map +1 -1
- package/dest/errors.js +66 -12
- package/dest/factory.d.ts +12 -7
- package/dest/factory.d.ts.map +1 -1
- package/dest/factory.js +40 -25
- 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 +32 -0
- package/dest/modules/data_source_base.d.ts +72 -48
- package/dest/modules/data_source_base.d.ts.map +1 -1
- package/dest/modules/data_source_base.js +266 -143
- 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 +172 -117
- 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 +437 -217
- 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 +24 -5
- package/dest/modules/validation.d.ts.map +1 -1
- package/dest/modules/validation.js +40 -15
- 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 +638 -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 +36 -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 +48 -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 -40
- package/dest/store/log_store.d.ts.map +1 -1
- package/dest/store/log_store.js +257 -480
- package/dest/store/log_store_codec.d.ts +78 -0
- package/dest/store/log_store_codec.d.ts.map +1 -0
- package/dest/store/log_store_codec.js +110 -0
- package/dest/store/message_store.d.ts +9 -3
- package/dest/store/message_store.d.ts.map +1 -1
- package/dest/store/message_store.js +39 -10
- 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 +80 -18
- package/dest/test/mock_l2_block_source.d.ts +48 -50
- package/dest/test/mock_l2_block_source.d.ts.map +1 -1
- package/dest/test/mock_l2_block_source.js +223 -179
- package/dest/test/mock_structs.d.ts +1 -1
- package/dest/test/mock_structs.d.ts.map +1 -1
- package/dest/test/mock_structs.js +2 -2
- package/dest/test/noop_l1_archiver.d.ts +14 -6
- package/dest/test/noop_l1_archiver.d.ts.map +1 -1
- package/dest/test/noop_l1_archiver.js +25 -9
- package/package.json +14 -14
- package/src/archiver.ts +353 -80
- package/src/config.ts +43 -20
- package/src/errors.ts +103 -18
- package/src/factory.ts +56 -24
- package/src/index.ts +18 -2
- package/src/l1/calldata_retriever.ts +16 -5
- package/src/l1/data_retrieval.ts +38 -46
- package/src/l1/validate_historical_logs.ts +140 -0
- package/src/modules/contract_data_source_adapter.ts +46 -0
- package/src/modules/data_source_base.ts +340 -189
- package/src/modules/data_store_updater.ts +211 -148
- package/src/modules/instrumentation.ts +28 -8
- package/src/modules/l1_synchronizer.ts +583 -255
- package/src/modules/outbox_trees_resolver.ts +199 -0
- package/src/modules/validation.ts +81 -21
- package/src/store/block_store.ts +792 -285
- package/src/store/contract_class_store.ts +43 -103
- package/src/store/contract_instance_store.ts +62 -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 +296 -652
- package/src/store/log_store_codec.ts +143 -0
- package/src/store/message_store.ts +43 -12
- package/src/structs/inbox_message.ts +1 -1
- package/src/test/fake_l1_state.ts +99 -27
- package/src/test/mock_l2_block_source.ts +279 -233
- package/src/test/mock_structs.ts +5 -2
- package/src/test/noop_l1_archiver.ts +52 -9
- package/dest/store/kv_archiver_store.d.ts +0 -367
- package/dest/store/kv_archiver_store.d.ts.map +0 -1
- package/dest/store/kv_archiver_store.js +0 -481
- package/src/store/kv_archiver_store.ts +0 -697
|
@@ -0,0 +1,78 @@
|
|
|
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
|
+
export declare const NUMERIC_HEX_LEN = 8;
|
|
6
|
+
export declare const SEP = "-";
|
|
7
|
+
/**
|
|
8
|
+
* Sentinel appended after a numeric hex segment to build an end bound strictly greater than any
|
|
9
|
+
* real key for that namespace. `'g'` sorts lexicographically after every hex digit (`0`-`9`, `a`-`f`),
|
|
10
|
+
* so `prefix + '-g'` is a clean exclusive upper bound.
|
|
11
|
+
*/
|
|
12
|
+
export declare const HEX_SENTINEL = "g";
|
|
13
|
+
export type ParsedKeyTail = {
|
|
14
|
+
blockNumber: BlockNumber;
|
|
15
|
+
txIndexWithinBlock: number;
|
|
16
|
+
logIndexWithinTx: number;
|
|
17
|
+
};
|
|
18
|
+
/**
|
|
19
|
+
* Per-kind stored value layout (no msgpackr):
|
|
20
|
+
* txHash(32) ++ blockHash(32) ++ blockTimestamp(u64 BE = 8) ++ logDataLen(u32 BE = 4) ++ logData[i].toBuffer()...
|
|
21
|
+
* `blockNumber`, `txIndexWithinBlock`, and `logIndexWithinTx` are decoded from the composite key.
|
|
22
|
+
*/
|
|
23
|
+
export type StoredLogValue = {
|
|
24
|
+
txHash: TxHash;
|
|
25
|
+
blockHash: BlockHash;
|
|
26
|
+
blockTimestamp: bigint;
|
|
27
|
+
logData: Fr[];
|
|
28
|
+
};
|
|
29
|
+
/** Returns the 64-char lowercase hex representation of a field, stripping the `0x` prefix. */
|
|
30
|
+
export declare function fieldHex(value: Fr | {
|
|
31
|
+
toString: () => string;
|
|
32
|
+
}): string;
|
|
33
|
+
/**
|
|
34
|
+
* Tag prefix for a log: the hex of its first field, or the empty string when the log carries no fields.
|
|
35
|
+
* A protocol-valid public log can have zero fields (e.g. a raw AVM `EMITPUBLICLOG` with `logSize = 0`),
|
|
36
|
+
* which has no tag to index by. Encoding it under the empty tag keeps it retrievable via the per-block
|
|
37
|
+
* read (and droppable on reorg) while never matching a real 64-hex-char tag query — instead of reading
|
|
38
|
+
* `fields[0]` off an empty array and aborting the whole block-ingestion transaction.
|
|
39
|
+
*/
|
|
40
|
+
export declare function tagHexForLog(fields: Fr[]): string;
|
|
41
|
+
/** Encodes a number as 8-char zero-padded lowercase hex (matches a u32 big-endian byte buffer's lex order). */
|
|
42
|
+
export declare function u32Hex(n: number): string;
|
|
43
|
+
/**
|
|
44
|
+
* Encodes the composite primary key as `prefix-block-txIdx-logIdx` where `prefix` is the leading
|
|
45
|
+
* segment (`tag` for private; `contract-tag` for public) and the trailing triple is fixed-width
|
|
46
|
+
* 8-char zero-padded hex so byte-order matches `(blockNumber, txIndexWithinBlock, logIndexWithinTx)`.
|
|
47
|
+
*/
|
|
48
|
+
export declare function encodeKey(prefix: string, blockNumber: number, txIndex: number, logIndex: number): string;
|
|
49
|
+
/**
|
|
50
|
+
* Decodes the trailing `(blockNumber, txIndexWithinBlock, logIndexWithinTx)` triple from a composite
|
|
51
|
+
* key. The leading prefix segments are ignored — we only ever read them off the input query, never
|
|
52
|
+
* back off the key.
|
|
53
|
+
*/
|
|
54
|
+
export declare function decodeKeyTail(key: string): ParsedKeyTail;
|
|
55
|
+
/**
|
|
56
|
+
* Exclusive end bound for a `(contract, tag)`-prefix scan. With an `upperBlockExclusive` we cut at
|
|
57
|
+
* `(prefix, upper, 0, 0)`. With no bound we use `prefix + '-' + HEX_SENTINEL`, which sorts strictly
|
|
58
|
+
* after every real key under `prefix` (`g` is greater than any hex digit).
|
|
59
|
+
*/
|
|
60
|
+
export declare function endOfTagRange(prefix: string, upperBlockExclusive: number | undefined): string;
|
|
61
|
+
/**
|
|
62
|
+
* Exclusive end bound for a tx-strict scan: every key strictly inside `(prefix, txBlk, txIdx, *)`.
|
|
63
|
+
* `prefix-block-txIdx-` followed by the hex sentinel is the first key past every real logIndex for
|
|
64
|
+
* this tx and strictly less than the next tx's first key.
|
|
65
|
+
*/
|
|
66
|
+
export declare function endOfTxRange(prefix: string, txBlk: number, txIdx: number): string;
|
|
67
|
+
/**
|
|
68
|
+
* Returns the smallest string strictly greater than a fully-encoded composite key. The encoded key
|
|
69
|
+
* ends in a hex digit, and `'g'` sorts strictly after any hex digit, so appending `'g'` is the
|
|
70
|
+
* smallest possible successor in our key alphabet. Used to turn an inclusive cursor into an
|
|
71
|
+
* exclusive `start`.
|
|
72
|
+
*/
|
|
73
|
+
export declare function incKey(key: string): string;
|
|
74
|
+
export declare function encodeValue(value: StoredLogValue): Buffer;
|
|
75
|
+
export declare function decodeValue(buffer: Buffer | Uint8Array): StoredLogValue;
|
|
76
|
+
/** Encodes the public-log key prefix as `contractHex-tagHex`. */
|
|
77
|
+
export declare function encodePublicPrefix(contractHex: string, tagHex: string): string;
|
|
78
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibG9nX3N0b3JlX2NvZGVjLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvc3RvcmUvbG9nX3N0b3JlX2NvZGVjLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBRSxXQUFXLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUM5RCxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFDcEQsT0FBTyxFQUFFLFNBQVMsRUFBRSxNQUFNLHFCQUFxQixDQUFDO0FBQ2hELE9BQU8sRUFBRSxNQUFNLEVBQUUsTUFBTSxrQkFBa0IsQ0FBQztBQUUxQyxlQUFPLE1BQU0sZUFBZSxJQUFJLENBQUM7QUFDakMsZUFBTyxNQUFNLEdBQUcsTUFBTSxDQUFDO0FBRXZCOzs7O0dBSUc7QUFDSCxlQUFPLE1BQU0sWUFBWSxNQUFNLENBQUM7QUFFaEMsTUFBTSxNQUFNLGFBQWEsR0FBRztJQUMxQixXQUFXLEVBQUUsV0FBVyxDQUFDO0lBQ3pCLGtCQUFrQixFQUFFLE1BQU0sQ0FBQztJQUMzQixnQkFBZ0IsRUFBRSxNQUFNLENBQUM7Q0FDMUIsQ0FBQztBQUVGOzs7O0dBSUc7QUFDSCxNQUFNLE1BQU0sY0FBYyxHQUFHO0lBQzNCLE1BQU0sRUFBRSxNQUFNLENBQUM7SUFDZixTQUFTLEVBQUUsU0FBUyxDQUFDO0lBQ3JCLGNBQWMsRUFBRSxNQUFNLENBQUM7SUFDdkIsT0FBTyxFQUFFLEVBQUUsRUFBRSxDQUFDO0NBQ2YsQ0FBQztBQUVGLDhGQUE4RjtBQUM5Rix3QkFBZ0IsUUFBUSxDQUFDLEtBQUssRUFBRSxFQUFFLEdBQUc7SUFBRSxRQUFRLEVBQUUsTUFBTSxNQUFNLENBQUE7Q0FBRSxHQUFHLE1BQU0sQ0FHdkU7QUFFRDs7Ozs7O0dBTUc7QUFDSCx3QkFBZ0IsWUFBWSxDQUFDLE1BQU0sRUFBRSxFQUFFLEVBQUUsR0FBRyxNQUFNLENBRWpEO0FBRUQsK0dBQStHO0FBQy9HLHdCQUFnQixNQUFNLENBQUMsQ0FBQyxFQUFFLE1BQU0sR0FBRyxNQUFNLENBRXhDO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixTQUFTLENBQUMsTUFBTSxFQUFFLE1BQU0sRUFBRSxXQUFXLEVBQUUsTUFBTSxFQUFFLE9BQU8sRUFBRSxNQUFNLEVBQUUsUUFBUSxFQUFFLE1BQU0sR0FBRyxNQUFNLENBRXhHO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixhQUFhLENBQUMsR0FBRyxFQUFFLE1BQU0sR0FBRyxhQUFhLENBUXhEO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixhQUFhLENBQUMsTUFBTSxFQUFFLE1BQU0sRUFBRSxtQkFBbUIsRUFBRSxNQUFNLEdBQUcsU0FBUyxHQUFHLE1BQU0sQ0FLN0Y7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLFlBQVksQ0FBQyxNQUFNLEVBQUUsTUFBTSxFQUFFLEtBQUssRUFBRSxNQUFNLEVBQUUsS0FBSyxFQUFFLE1BQU0sR0FBRyxNQUFNLENBRWpGO0FBRUQ7Ozs7O0dBS0c7QUFDSCx3QkFBZ0IsTUFBTSxDQUFDLEdBQUcsRUFBRSxNQUFNLEdBQUcsTUFBTSxDQUUxQztBQUVELHdCQUFnQixXQUFXLENBQUMsS0FBSyxFQUFFLGNBQWMsR0FBRyxNQUFNLENBUXpEO0FBRUQsd0JBQWdCLFdBQVcsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFVBQVUsR0FBRyxjQUFjLENBaUJ2RTtBQUVELGlFQUFpRTtBQUNqRSx3QkFBZ0Isa0JBQWtCLENBQUMsV0FBVyxFQUFFLE1BQU0sRUFBRSxNQUFNLEVBQUUsTUFBTSxHQUFHLE1BQU0sQ0FFOUUifQ==
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"log_store_codec.d.ts","sourceRoot":"","sources":["../../src/store/log_store_codec.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC9D,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,eAAO,MAAM,eAAe,IAAI,CAAC;AACjC,eAAO,MAAM,GAAG,MAAM,CAAC;AAEvB;;;;GAIG;AACH,eAAO,MAAM,YAAY,MAAM,CAAC;AAEhC,MAAM,MAAM,aAAa,GAAG;IAC1B,WAAW,EAAE,WAAW,CAAC;IACzB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;CAC1B,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,SAAS,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,EAAE,EAAE,CAAC;CACf,CAAC;AAEF,8FAA8F;AAC9F,wBAAgB,QAAQ,CAAC,KAAK,EAAE,EAAE,GAAG;IAAE,QAAQ,EAAE,MAAM,MAAM,CAAA;CAAE,GAAG,MAAM,CAGvE;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,EAAE,EAAE,GAAG,MAAM,CAEjD;AAED,+GAA+G;AAC/G,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAExC;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAExG;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,CAQxD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,mBAAmB,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAK7F;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAEjF;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAE1C;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAQzD;AAED,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,GAAG,cAAc,CAiBvE;AAED,iEAAiE;AACjE,wBAAgB,kBAAkB,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAE9E"}
|
|
@@ -0,0 +1,110 @@
|
|
|
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
|
+
export const NUMERIC_HEX_LEN = 8;
|
|
6
|
+
export const SEP = '-';
|
|
7
|
+
/**
|
|
8
|
+
* Sentinel appended after a numeric hex segment to build an end bound strictly greater than any
|
|
9
|
+
* real key for that namespace. `'g'` sorts lexicographically after every hex digit (`0`-`9`, `a`-`f`),
|
|
10
|
+
* so `prefix + '-g'` is a clean exclusive upper bound.
|
|
11
|
+
*/ export const HEX_SENTINEL = 'g';
|
|
12
|
+
/** Returns the 64-char lowercase hex representation of a field, stripping the `0x` prefix. */ export function fieldHex(value) {
|
|
13
|
+
// Fr.toString() and AztecAddress.toString() both return `0x` + 64 lowercase hex chars.
|
|
14
|
+
return value.toString().slice(2);
|
|
15
|
+
}
|
|
16
|
+
/**
|
|
17
|
+
* Tag prefix for a log: the hex of its first field, or the empty string when the log carries no fields.
|
|
18
|
+
* A protocol-valid public log can have zero fields (e.g. a raw AVM `EMITPUBLICLOG` with `logSize = 0`),
|
|
19
|
+
* which has no tag to index by. Encoding it under the empty tag keeps it retrievable via the per-block
|
|
20
|
+
* read (and droppable on reorg) while never matching a real 64-hex-char tag query — instead of reading
|
|
21
|
+
* `fields[0]` off an empty array and aborting the whole block-ingestion transaction.
|
|
22
|
+
*/ export function tagHexForLog(fields) {
|
|
23
|
+
return fields.length > 0 ? fieldHex(fields[0]) : '';
|
|
24
|
+
}
|
|
25
|
+
/** Encodes a number as 8-char zero-padded lowercase hex (matches a u32 big-endian byte buffer's lex order). */ export function u32Hex(n) {
|
|
26
|
+
return n.toString(16).padStart(NUMERIC_HEX_LEN, '0');
|
|
27
|
+
}
|
|
28
|
+
/**
|
|
29
|
+
* Encodes the composite primary key as `prefix-block-txIdx-logIdx` where `prefix` is the leading
|
|
30
|
+
* segment (`tag` for private; `contract-tag` for public) and the trailing triple is fixed-width
|
|
31
|
+
* 8-char zero-padded hex so byte-order matches `(blockNumber, txIndexWithinBlock, logIndexWithinTx)`.
|
|
32
|
+
*/ export function encodeKey(prefix, blockNumber, txIndex, logIndex) {
|
|
33
|
+
return `${prefix}${SEP}${u32Hex(blockNumber)}${SEP}${u32Hex(txIndex)}${SEP}${u32Hex(logIndex)}`;
|
|
34
|
+
}
|
|
35
|
+
/**
|
|
36
|
+
* Decodes the trailing `(blockNumber, txIndexWithinBlock, logIndexWithinTx)` triple from a composite
|
|
37
|
+
* key. The leading prefix segments are ignored — we only ever read them off the input query, never
|
|
38
|
+
* back off the key.
|
|
39
|
+
*/ export function decodeKeyTail(key) {
|
|
40
|
+
const parts = key.split(SEP);
|
|
41
|
+
const len = parts.length;
|
|
42
|
+
return {
|
|
43
|
+
blockNumber: BlockNumber(parseInt(parts[len - 3], 16)),
|
|
44
|
+
txIndexWithinBlock: parseInt(parts[len - 2], 16),
|
|
45
|
+
logIndexWithinTx: parseInt(parts[len - 1], 16)
|
|
46
|
+
};
|
|
47
|
+
}
|
|
48
|
+
/**
|
|
49
|
+
* Exclusive end bound for a `(contract, tag)`-prefix scan. With an `upperBlockExclusive` we cut at
|
|
50
|
+
* `(prefix, upper, 0, 0)`. With no bound we use `prefix + '-' + HEX_SENTINEL`, which sorts strictly
|
|
51
|
+
* after every real key under `prefix` (`g` is greater than any hex digit).
|
|
52
|
+
*/ export function endOfTagRange(prefix, upperBlockExclusive) {
|
|
53
|
+
if (upperBlockExclusive === undefined) {
|
|
54
|
+
return `${prefix}${SEP}${HEX_SENTINEL}`;
|
|
55
|
+
}
|
|
56
|
+
return encodeKey(prefix, upperBlockExclusive, 0, 0);
|
|
57
|
+
}
|
|
58
|
+
/**
|
|
59
|
+
* Exclusive end bound for a tx-strict scan: every key strictly inside `(prefix, txBlk, txIdx, *)`.
|
|
60
|
+
* `prefix-block-txIdx-` followed by the hex sentinel is the first key past every real logIndex for
|
|
61
|
+
* this tx and strictly less than the next tx's first key.
|
|
62
|
+
*/ export function endOfTxRange(prefix, txBlk, txIdx) {
|
|
63
|
+
return `${prefix}${SEP}${u32Hex(txBlk)}${SEP}${u32Hex(txIdx)}${SEP}${HEX_SENTINEL}`;
|
|
64
|
+
}
|
|
65
|
+
/**
|
|
66
|
+
* Returns the smallest string strictly greater than a fully-encoded composite key. The encoded key
|
|
67
|
+
* ends in a hex digit, and `'g'` sorts strictly after any hex digit, so appending `'g'` is the
|
|
68
|
+
* smallest possible successor in our key alphabet. Used to turn an inclusive cursor into an
|
|
69
|
+
* exclusive `start`.
|
|
70
|
+
*/ export function incKey(key) {
|
|
71
|
+
return key + HEX_SENTINEL;
|
|
72
|
+
}
|
|
73
|
+
export function encodeValue(value) {
|
|
74
|
+
const head = Buffer.allocUnsafe(32 + 32 + 8 + 4);
|
|
75
|
+
value.txHash.toBuffer().copy(head, 0);
|
|
76
|
+
value.blockHash.toBuffer().copy(head, 32);
|
|
77
|
+
head.writeBigUInt64BE(value.blockTimestamp, 64);
|
|
78
|
+
head.writeUInt32BE(value.logData.length, 72);
|
|
79
|
+
const fieldBufs = value.logData.map((f)=>f.toBuffer());
|
|
80
|
+
return Buffer.concat([
|
|
81
|
+
head,
|
|
82
|
+
...fieldBufs
|
|
83
|
+
]);
|
|
84
|
+
}
|
|
85
|
+
export function decodeValue(buffer) {
|
|
86
|
+
const buf = Buffer.isBuffer(buffer) ? buffer : Buffer.from(buffer.buffer, buffer.byteOffset, buffer.byteLength);
|
|
87
|
+
let off = 0;
|
|
88
|
+
const txHash = TxHash.fromBuffer(buf.subarray(off, off + 32));
|
|
89
|
+
off += 32;
|
|
90
|
+
const blockHash = BlockHash.fromBuffer(buf.subarray(off, off + 32));
|
|
91
|
+
off += 32;
|
|
92
|
+
const blockTimestamp = buf.readBigUInt64BE(off);
|
|
93
|
+
off += 8;
|
|
94
|
+
const logDataLen = buf.readUInt32BE(off);
|
|
95
|
+
off += 4;
|
|
96
|
+
const logData = new Array(logDataLen);
|
|
97
|
+
for(let i = 0; i < logDataLen; i++){
|
|
98
|
+
logData[i] = Fr.fromBuffer(buf.subarray(off, off + 32));
|
|
99
|
+
off += 32;
|
|
100
|
+
}
|
|
101
|
+
return {
|
|
102
|
+
txHash,
|
|
103
|
+
blockHash,
|
|
104
|
+
blockTimestamp,
|
|
105
|
+
logData
|
|
106
|
+
};
|
|
107
|
+
}
|
|
108
|
+
/** Encodes the public-log key prefix as `contractHex-tagHex`. */ export function encodePublicPrefix(contractHex, tagHex) {
|
|
109
|
+
return `${contractHex}${SEP}${tagHex}`;
|
|
110
|
+
}
|
|
@@ -16,6 +16,9 @@ export declare class MessageStore {
|
|
|
16
16
|
getSynchedL1Block(): Promise<L1BlockId | undefined>;
|
|
17
17
|
/** Sets the last L1 block synced */
|
|
18
18
|
setSynchedL1Block(l1Block: L1BlockId): Promise<void>;
|
|
19
|
+
/** Gets the L1 finalized block as of the last successful message sync. */
|
|
20
|
+
getMessagesFinalizedL1Block(): Promise<L1BlockId | undefined>;
|
|
21
|
+
private maybeAdvanceFinalizedL1Block;
|
|
19
22
|
/**
|
|
20
23
|
* Append L1 to L2 messages to the store.
|
|
21
24
|
* Requires new messages to be in order and strictly after the last message added.
|
|
@@ -31,8 +34,11 @@ export declare class MessageStore {
|
|
|
31
34
|
getLastMessage(): Promise<InboxMessage | undefined>;
|
|
32
35
|
/** Returns the inbox tree-in-progress checkpoint number from L1, or undefined if not yet set. */
|
|
33
36
|
getInboxTreeInProgress(): Promise<bigint | undefined>;
|
|
34
|
-
/**
|
|
35
|
-
|
|
37
|
+
/**
|
|
38
|
+
* Atomically updates the message sync state: the L1 sync point, the inbox tree-in-progress marker, and
|
|
39
|
+
* (optionally) the L1 finalized block as of this sync. The finalized block is advanced monotonically.
|
|
40
|
+
*/
|
|
41
|
+
setMessageSyncState(l1Block: L1BlockId, treeInProgress: bigint | undefined, finalizedL1Block?: L1BlockId): Promise<void>;
|
|
36
42
|
getL1ToL2Messages(checkpointNumber: CheckpointNumber): Promise<Fr[]>;
|
|
37
43
|
iterateL1ToL2Messages(range?: CustomRange<bigint>): AsyncIterableIterator<InboxMessage>;
|
|
38
44
|
removeL1ToL2Messages(startIndex: bigint): Promise<void>;
|
|
@@ -41,4 +47,4 @@ export declare class MessageStore {
|
|
|
41
47
|
private leafToIndexKey;
|
|
42
48
|
private increaseTotalMessageCount;
|
|
43
49
|
}
|
|
44
|
-
//# sourceMappingURL=data:application/json;base64,
|
|
50
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibWVzc2FnZV9zdG9yZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3N0b3JlL21lc3NhZ2Vfc3RvcmUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxLQUFLLEVBQUUsU0FBUyxFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFDMUQsT0FBTyxFQUFFLGdCQUFnQixFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFFbkUsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLGdDQUFnQyxDQUFDO0FBSXBELE9BQU8sRUFDTCxLQUFLLGlCQUFpQixFQUd0QixLQUFLLFdBQVcsRUFFakIsTUFBTSxpQkFBaUIsQ0FBQztBQUl6QixPQUFPLEVBQ0wsS0FBSyxZQUFZLEVBSWxCLE1BQU0sNkJBQTZCLENBQUM7QUFFckMscUJBQWEsaUJBQWtCLFNBQVEsS0FBSzthQUd4QixZQUFZLEVBQUUsWUFBWTtJQUY1QyxZQUNFLE9BQU8sRUFBRSxNQUFNLEVBQ0MsWUFBWSxFQUFFLFlBQVksRUFJM0M7Q0FDRjtBQUVELHFCQUFhLFlBQVk7O0lBZ0JYLE9BQU8sQ0FBQyxFQUFFO0lBQXRCLFlBQW9CLEVBQUUsRUFBRSxpQkFBaUIsRUFPeEM7SUFFWSwwQkFBMEIsSUFBSSxPQUFPLENBQUMsTUFBTSxDQUFDLENBRXpEO0lBRUQscUNBQXFDO0lBQ3hCLGlCQUFpQixJQUFJLE9BQU8sQ0FBQyxTQUFTLEdBQUcsU0FBUyxDQUFDLENBUS9EO0lBRUQsb0NBQW9DO0lBQ3ZCLGlCQUFpQixDQUFDLE9BQU8sRUFBRSxTQUFTLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQUdoRTtJQUVELDBFQUEwRTtJQUM3RCwyQkFBMkIsSUFBSSxPQUFPLENBQUMsU0FBUyxHQUFHLFNBQVMsQ0FBQyxDQU96RTtZQUdhLDRCQUE0QjtJQVMxQzs7OztPQUlHO0lBQ0ksaUJBQWlCLENBQUMsUUFBUSxFQUFFLFlBQVksRUFBRSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FvRmhFO0lBRUQ7Ozs7T0FJRztJQUNJLHFCQUFxQixDQUFDLGFBQWEsRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLE1BQU0sR0FBRyxTQUFTLENBQUMsQ0FFM0U7SUFFWSxjQUFjLElBQUksT0FBTyxDQUFDLFlBQVksR0FBRyxTQUFTLENBQUMsQ0FHL0Q7SUFFRCxpR0FBaUc7SUFDMUYsc0JBQXNCLElBQUksT0FBTyxDQUFDLE1BQU0sR0FBRyxTQUFTLENBQUMsQ0FFM0Q7SUFFRDs7O09BR0c7SUFDSSxtQkFBbUIsQ0FDeEIsT0FBTyxFQUFFLFNBQVMsRUFDbEIsY0FBYyxFQUFFLE1BQU0sR0FBRyxTQUFTLEVBQ2xDLGdCQUFnQixDQUFDLEVBQUUsU0FBUyxHQUMzQixPQUFPLENBQUMsSUFBSSxDQUFDLENBWWY7SUFFWSxpQkFBaUIsQ0FBQyxnQkFBZ0IsRUFBRSxnQkFBZ0IsR0FBRyxPQUFPLENBQUMsRUFBRSxFQUFFLENBQUMsQ0E0QmhGO0lBRWEscUJBQXFCLENBQUMsS0FBSyxHQUFFLFdBQVcsQ0FBQyxNQUFNLENBQU0sR0FBRyxxQkFBcUIsQ0FBQyxZQUFZLENBQUMsQ0FLeEc7SUFFTSxvQkFBb0IsQ0FBQyxVQUFVLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FnQjdEO0lBRU0sa0NBQWtDLENBQUMsc0JBQXNCLEVBQUUsZ0JBQWdCLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQUlqRztJQUVELE9BQU8sQ0FBQyxVQUFVO0lBSWxCLE9BQU8sQ0FBQyxjQUFjO1lBSVIseUJBQXlCO0NBU3hDIn0=
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"message_store.d.ts","sourceRoot":"","sources":["../../src/store/message_store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AAEnE,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAIpD,OAAO,EACL,KAAK,iBAAiB,EAGtB,KAAK,WAAW,EAEjB,MAAM,iBAAiB,CAAC;AAIzB,OAAO,EACL,KAAK,YAAY,EAIlB,MAAM,6BAA6B,CAAC;AAErC,qBAAa,iBAAkB,SAAQ,KAAK;aAGxB,YAAY,EAAE,YAAY;IAF5C,YACE,OAAO,EAAE,MAAM,EACC,YAAY,EAAE,YAAY,EAI3C;CACF;AAED,qBAAa,YAAY;;
|
|
1
|
+
{"version":3,"file":"message_store.d.ts","sourceRoot":"","sources":["../../src/store/message_store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AAEnE,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAIpD,OAAO,EACL,KAAK,iBAAiB,EAGtB,KAAK,WAAW,EAEjB,MAAM,iBAAiB,CAAC;AAIzB,OAAO,EACL,KAAK,YAAY,EAIlB,MAAM,6BAA6B,CAAC;AAErC,qBAAa,iBAAkB,SAAQ,KAAK;aAGxB,YAAY,EAAE,YAAY;IAF5C,YACE,OAAO,EAAE,MAAM,EACC,YAAY,EAAE,YAAY,EAI3C;CACF;AAED,qBAAa,YAAY;;IAgBX,OAAO,CAAC,EAAE;IAAtB,YAAoB,EAAE,EAAE,iBAAiB,EAOxC;IAEY,0BAA0B,IAAI,OAAO,CAAC,MAAM,CAAC,CAEzD;IAED,qCAAqC;IACxB,iBAAiB,IAAI,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,CAQ/D;IAED,oCAAoC;IACvB,iBAAiB,CAAC,OAAO,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAGhE;IAED,0EAA0E;IAC7D,2BAA2B,IAAI,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,CAOzE;YAGa,4BAA4B;IAS1C;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAoFhE;IAED;;;;OAIG;IACI,qBAAqB,CAAC,aAAa,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAE3E;IAEY,cAAc,IAAI,OAAO,CAAC,YAAY,GAAG,SAAS,CAAC,CAG/D;IAED,iGAAiG;IAC1F,sBAAsB,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAE3D;IAED;;;OAGG;IACI,mBAAmB,CACxB,OAAO,EAAE,SAAS,EAClB,cAAc,EAAE,MAAM,GAAG,SAAS,EAClC,gBAAgB,CAAC,EAAE,SAAS,GAC3B,OAAO,CAAC,IAAI,CAAC,CAYf;IAEY,iBAAiB,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CA4BhF;IAEa,qBAAqB,CAAC,KAAK,GAAE,WAAW,CAAC,MAAM,CAAM,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAKxG;IAEM,oBAAoB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAgB7D;IAEM,kCAAkC,CAAC,sBAAsB,EAAE,gBAAgB,GAAG,OAAO,CAAC,IAAI,CAAC,CAIjG;IAED,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,cAAc;YAIR,yBAAyB;CASxC"}
|
|
@@ -21,6 +21,7 @@ export class MessageStore {
|
|
|
21
21
|
/** Stores L1 block number and hash of the L1 synchpoint */ #lastSynchedL1Block;
|
|
22
22
|
/** Stores total messages stored */ #totalMessageCount;
|
|
23
23
|
/** Stores the checkpoint number whose message tree is currently being filled on L1. */ #inboxTreeInProgress;
|
|
24
|
+
/** Stores the L1 finalized block as of the last successful message sync. */ #messagesFinalizedL1Block;
|
|
24
25
|
#log;
|
|
25
26
|
constructor(db){
|
|
26
27
|
this.db = db;
|
|
@@ -30,6 +31,7 @@ export class MessageStore {
|
|
|
30
31
|
this.#lastSynchedL1Block = db.openSingleton('archiver_last_l1_block_id');
|
|
31
32
|
this.#totalMessageCount = db.openSingleton('archiver_l1_to_l2_message_count');
|
|
32
33
|
this.#inboxTreeInProgress = db.openSingleton('archiver_inbox_tree_in_progress');
|
|
34
|
+
this.#messagesFinalizedL1Block = db.openSingleton('archiver_messages_finalized_l1_block');
|
|
33
35
|
}
|
|
34
36
|
async getTotalL1ToL2MessageCount() {
|
|
35
37
|
return await this.#totalMessageCount.getAsync() ?? 0n;
|
|
@@ -52,6 +54,28 @@ export class MessageStore {
|
|
|
52
54
|
]);
|
|
53
55
|
await this.#lastSynchedL1Block.set(buffer);
|
|
54
56
|
}
|
|
57
|
+
/** Gets the L1 finalized block as of the last successful message sync. */ async getMessagesFinalizedL1Block() {
|
|
58
|
+
const buffer = await this.#messagesFinalizedL1Block.getAsync();
|
|
59
|
+
if (!buffer) {
|
|
60
|
+
return undefined;
|
|
61
|
+
}
|
|
62
|
+
const reader = BufferReader.asReader(buffer);
|
|
63
|
+
return {
|
|
64
|
+
l1BlockNumber: reader.readUInt256(),
|
|
65
|
+
l1BlockHash: Buffer32.fromBuffer(reader.readBytes(Buffer32.SIZE))
|
|
66
|
+
};
|
|
67
|
+
}
|
|
68
|
+
/** Monotonically advances the persisted L1 finalized block for message sync. Never regresses. */ async maybeAdvanceFinalizedL1Block(l1Block) {
|
|
69
|
+
const existing = await this.getMessagesFinalizedL1Block();
|
|
70
|
+
if (existing && l1Block.l1BlockNumber <= existing.l1BlockNumber) {
|
|
71
|
+
return;
|
|
72
|
+
}
|
|
73
|
+
const buffer = serializeToBuffer([
|
|
74
|
+
l1Block.l1BlockNumber,
|
|
75
|
+
l1Block.l1BlockHash
|
|
76
|
+
]);
|
|
77
|
+
await this.#messagesFinalizedL1Block.set(buffer);
|
|
78
|
+
}
|
|
55
79
|
/**
|
|
56
80
|
* Append L1 to L2 messages to the store.
|
|
57
81
|
* Requires new messages to be in order and strictly after the last message added.
|
|
@@ -101,14 +125,6 @@ export class MessageStore {
|
|
|
101
125
|
this.#log.trace(`Inserted L1 to L2 message ${message.leaf} with index ${message.index} into the store`);
|
|
102
126
|
lastMessage = message;
|
|
103
127
|
}
|
|
104
|
-
// Update the L1 sync point to that of the last message added.
|
|
105
|
-
const currentSyncPoint = await this.getSynchedL1Block();
|
|
106
|
-
if (!currentSyncPoint || currentSyncPoint.l1BlockNumber < lastMessage.l1BlockNumber) {
|
|
107
|
-
await this.setSynchedL1Block({
|
|
108
|
-
l1BlockNumber: lastMessage.l1BlockNumber,
|
|
109
|
-
l1BlockHash: lastMessage.l1BlockHash
|
|
110
|
-
});
|
|
111
|
-
}
|
|
112
128
|
// Update total message count with the number of inserted messages.
|
|
113
129
|
await this.increaseTotalMessageCount(messageCount);
|
|
114
130
|
});
|
|
@@ -130,8 +146,21 @@ export class MessageStore {
|
|
|
130
146
|
/** Returns the inbox tree-in-progress checkpoint number from L1, or undefined if not yet set. */ getInboxTreeInProgress() {
|
|
131
147
|
return this.#inboxTreeInProgress.getAsync();
|
|
132
148
|
}
|
|
133
|
-
/**
|
|
134
|
-
|
|
149
|
+
/**
|
|
150
|
+
* Atomically updates the message sync state: the L1 sync point, the inbox tree-in-progress marker, and
|
|
151
|
+
* (optionally) the L1 finalized block as of this sync. The finalized block is advanced monotonically.
|
|
152
|
+
*/ setMessageSyncState(l1Block, treeInProgress, finalizedL1Block) {
|
|
153
|
+
return this.db.transactionAsync(async ()=>{
|
|
154
|
+
await this.setSynchedL1Block(l1Block);
|
|
155
|
+
if (treeInProgress !== undefined) {
|
|
156
|
+
await this.#inboxTreeInProgress.set(treeInProgress);
|
|
157
|
+
} else {
|
|
158
|
+
await this.#inboxTreeInProgress.delete();
|
|
159
|
+
}
|
|
160
|
+
if (finalizedL1Block !== undefined) {
|
|
161
|
+
await this.maybeAdvanceFinalizedL1Block(finalizedL1Block);
|
|
162
|
+
}
|
|
163
|
+
});
|
|
135
164
|
}
|
|
136
165
|
async getL1ToL2Messages(checkpointNumber) {
|
|
137
166
|
const treeInProgress = await this.#inboxTreeInProgress.getAsync();
|
|
@@ -126,8 +126,11 @@ export declare class FakeL1State {
|
|
|
126
126
|
* Auto-updates pending checkpoint number based on visible checkpoints.
|
|
127
127
|
*/
|
|
128
128
|
setL1BlockNumber(blockNumber: bigint): void;
|
|
129
|
-
/**
|
|
130
|
-
|
|
129
|
+
/**
|
|
130
|
+
* Sets the L1 block number that will be reported as "finalized". Pass `undefined` to
|
|
131
|
+
* simulate a chain that does not yet have a finalized block (devnet startup).
|
|
132
|
+
*/
|
|
133
|
+
setFinalizedL1BlockNumber(blockNumber: bigint | undefined): void;
|
|
131
134
|
/** Marks a checkpoint as proven. Updates provenCheckpointNumber. */
|
|
132
135
|
markCheckpointAsProven(checkpointNumber: CheckpointNumber): void;
|
|
133
136
|
/**
|
|
@@ -144,6 +147,13 @@ export declare class FakeL1State {
|
|
|
144
147
|
* Auto-updates pending status.
|
|
145
148
|
*/
|
|
146
149
|
removeCheckpoint(checkpointNumber: CheckpointNumber): void;
|
|
150
|
+
/**
|
|
151
|
+
* Moves a checkpoint to a different L1 block number (simulates L1 reorg that
|
|
152
|
+
* re-includes the same checkpoint transaction in a different block).
|
|
153
|
+
* The checkpoint content stays the same — only the L1 metadata changes.
|
|
154
|
+
* Auto-updates pending status.
|
|
155
|
+
*/
|
|
156
|
+
moveCheckpointToL1Block(checkpointNumber: CheckpointNumber, newL1BlockNumber: bigint): void;
|
|
147
157
|
/**
|
|
148
158
|
* Removes messages after a given total index (simulates L1 reorg).
|
|
149
159
|
* Auto-updates rolling hash.
|
|
@@ -192,11 +202,13 @@ export declare class FakeL1State {
|
|
|
192
202
|
private getNextBlockNumber;
|
|
193
203
|
private getCheckpointProposedLogs;
|
|
194
204
|
private getMessageSentLogs;
|
|
205
|
+
private getMessageSentLogByHash;
|
|
195
206
|
private makeRollupTx;
|
|
207
|
+
private getSignatureContext;
|
|
196
208
|
/** Extracts the CommitteeAttestations struct definition from RollupAbi for hash computation. */
|
|
197
209
|
private getCommitteeAttestationsStructDef;
|
|
198
210
|
private makeVersionedBlobHashes;
|
|
199
211
|
private makeBlobsFromCheckpoint;
|
|
200
212
|
}
|
|
201
213
|
export {};
|
|
202
|
-
//# sourceMappingURL=data:application/json;base64,
|
|
214
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZmFrZV9sMV9zdGF0ZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3Rlc3QvZmFrZV9sMV9zdGF0ZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxtQkFBbUIsRUFBRSxNQUFNLDJCQUEyQixDQUFDO0FBQ3JFLE9BQU8sRUFBRSxLQUFLLElBQUksRUFBcUQsTUFBTSxpQkFBaUIsQ0FBQztBQUUvRixPQUFPLEtBQUssRUFBeUIsYUFBYSxFQUFrQixjQUFjLEVBQUUsTUFBTSwyQkFBMkIsQ0FBQztBQUV0SCxPQUFPLEtBQUssRUFBRSxnQkFBZ0IsRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBQzlELE9BQU8sRUFBb0IsZ0JBQWdCLEVBQUUsVUFBVSxFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFFakcsT0FBTyxFQUFFLGVBQWUsRUFBRSxNQUFNLDJDQUEyQyxDQUFDO0FBQzVFLE9BQU8sRUFBRSxFQUFFLEVBQUUsTUFBTSxnQ0FBZ0MsQ0FBQztBQUNwRCxPQUFPLEVBQUUsVUFBVSxFQUFFLE1BQU0sK0JBQStCLENBQUM7QUFHM0QsT0FBTyxFQUF5RCxPQUFPLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQUNyRyxPQUFPLEVBQUUsVUFBVSxFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFLdEQsT0FBTyxFQUFFLHNCQUFzQixFQUFFLE1BQU0scUJBQXFCLENBQUM7QUFFN0QsT0FBTyxFQUFFLEtBQUssU0FBUyxFQUFRLE1BQU0sb0JBQW9CLENBQUM7QUFjMUQsMkNBQTJDO0FBQzNDLE1BQU0sTUFBTSxpQkFBaUIsR0FBRztJQUM5Qiw0QkFBNEI7SUFDNUIsa0JBQWtCLEVBQUUsRUFBRSxDQUFDO0lBQ3ZCLDZCQUE2QjtJQUM3QixZQUFZLEVBQUUsTUFBTSxDQUFDO0lBQ3JCLGtDQUFrQztJQUNsQyxhQUFhLEVBQUUsTUFBTSxDQUFDO0lBQ3RCLHlDQUF5QztJQUN6QyxvQkFBb0IsRUFBRSxNQUFNLENBQUM7SUFDN0IseUNBQXlDO0lBQ3pDLGFBQWEsRUFBRSxVQUFVLENBQUM7SUFDMUIsd0NBQXdDO0lBQ3hDLFlBQVksRUFBRSxVQUFVLENBQUM7SUFDekIscUNBQXFDO0lBQ3JDLFlBQVksRUFBRSxNQUFNLENBQUM7Q0FDdEIsQ0FBQztBQUVGLHVDQUF1QztBQUN2QyxLQUFLLG9CQUFvQixHQUFHO0lBQzFCLHFEQUFxRDtJQUNyRCxhQUFhLEVBQUUsTUFBTSxDQUFDO0lBQ3RCLHdEQUF3RDtJQUN4RCxTQUFTLENBQUMsRUFBRSxNQUFNLENBQUM7SUFDbkIsOENBQThDO0lBQzlDLE1BQU0sQ0FBQyxFQUFFLE9BQU8sRUFBRSxDQUFDO0lBQ25CLG1EQUFtRDtJQUNuRCxXQUFXLENBQUMsRUFBRSxNQUFNLENBQUM7SUFDckIsb0ZBQW9GO0lBQ3BGLFVBQVUsQ0FBQyxFQUFFLE1BQU0sQ0FBQztJQUNwQiw4Q0FBOEM7SUFDOUMsT0FBTyxDQUFDLEVBQUUsZUFBZSxFQUFFLENBQUM7SUFDNUIsNEJBQTRCO0lBQzVCLFVBQVUsQ0FBQyxFQUFFLFVBQVUsQ0FBQztJQUN4QixpQ0FBaUM7SUFDakMsZUFBZSxDQUFDLEVBQUUsc0JBQXNCLENBQUM7SUFDekMsb0NBQW9DO0lBQ3BDLFNBQVMsQ0FBQyxFQUFFLE1BQU0sQ0FBQztJQUNuQiw4Q0FBOEM7SUFDOUMsaUJBQWlCLENBQUMsRUFBRSxNQUFNLENBQUM7SUFDM0IsMkVBQTJFO0lBQzNFLHFCQUFxQixDQUFDLEVBQUUsTUFBTSxDQUFDO0NBQ2hDLENBQUM7QUFFRix1Q0FBdUM7QUFDdkMsS0FBSyxtQkFBbUIsR0FBRztJQUN6Qix1Q0FBdUM7SUFDdkMsVUFBVSxFQUFFLFVBQVUsQ0FBQztJQUN2QixpREFBaUQ7SUFDakQsUUFBUSxFQUFFLEVBQUUsRUFBRSxDQUFDO0NBQ2hCLENBQUM7QUE0QkY7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7O0dBb0JHO0FBQ0gscUJBQWEsV0FBVztJQW9CVixPQUFPLENBQUMsUUFBUSxDQUFDLE1BQU07SUFuQm5DLE9BQU8sQ0FBQyxRQUFRLENBQUMsR0FBRyxDQUF5QztJQUM3RCxPQUFPLENBQUMsYUFBYSxDQUFTO0lBQzlCLE9BQU8sQ0FBQyxXQUFXLENBQXdCO0lBQzNDLE9BQU8sQ0FBQyxRQUFRLENBQXFCO0lBQ3JDLE9BQU8sQ0FBQyxtQkFBbUIsQ0FBMkI7SUFDdEQsT0FBTyxDQUFDLFdBQVcsQ0FBeUI7SUFDNUMsT0FBTyxDQUFDLHNCQUFzQixDQUF5QztJQUN2RSxPQUFPLENBQUMsbUJBQW1CLENBQWE7SUFDeEMsT0FBTyxDQUFDLE9BQU8sQ0FBYztJQUM3QixPQUFPLENBQUMsY0FBYyxDQUFrQjtJQUd4QyxPQUFPLENBQUMsdUJBQXVCLENBQXlDO0lBS3hFLE9BQU8sQ0FBQyxzQkFBc0IsQ0FBcUI7SUFFbkQsWUFBNkIsTUFBTSxFQUFFLGlCQUFpQixFQUlyRDtJQUVEOzs7Ozs7T0FNRztJQUNILFdBQVcsQ0FBQyxnQkFBZ0IsRUFBRSxnQkFBZ0IsRUFBRSxhQUFhLEVBQUUsTUFBTSxFQUFFLGFBQWEsRUFBRSxFQUFFLEVBQUUsR0FBRyxJQUFJLENBYWhHO0lBRUQ7Ozs7T0FJRztJQUNVLFVBQVUsQ0FBQyxnQkFBZ0IsRUFBRSxnQkFBZ0IsRUFBRSxPQUFPLEVBQUUsT0FBTyxDQUFDLG9CQUFvQixDQUFDLHNCQUVqRztJQUVEOzs7O09BSUc7SUFDVSxhQUFhLENBQ3hCLGdCQUFnQixFQUFFLGdCQUFnQixFQUNsQyxPQUFPLEVBQUUsb0JBQW9CLEdBQzVCLE9BQU8sQ0FBQyxtQkFBbUIsQ0FBQyxDQXVDOUI7SUFFRCx5RUFBeUU7SUFDekUsT0FBTyxDQUFDLHlCQUF5QjtJQTBCakMsbUZBQW1GO0lBQzVFLGtCQUFrQixDQUFDLGFBQWEsRUFBRSxNQUFNLEdBQUcsVUFBVSxDQUczRDtJQUVELHFGQUFxRjtJQUM5RSxxQkFBcUIsQ0FBQyxhQUFhLEVBQUUsTUFBTSxHQUFHLE1BQU0sQ0FHMUQ7SUFFRDs7O09BR0c7SUFDSCxnQkFBZ0IsQ0FBQyxXQUFXLEVBQUUsTUFBTSxHQUFHLElBQUksQ0FHMUM7SUFFRDs7O09BR0c7SUFDSCx5QkFBeUIsQ0FBQyxXQUFXLEVBQUUsTUFBTSxHQUFHLFNBQVMsR0FBRyxJQUFJLENBRS9EO0lBRUQsb0VBQW9FO0lBQ3BFLHNCQUFzQixDQUFDLGdCQUFnQixFQUFFLGdCQUFnQixHQUFHLElBQUksQ0FFL0Q7SUFFRDs7T0FFRztJQUNILGtDQUFrQyxDQUFDLFNBQVMsRUFBRSxNQUFNLEdBQUcsZ0JBQWdCLENBU3RFO0lBRUQsaUVBQWlFO0lBQ2pFLHNCQUFzQixDQUFDLElBQUksRUFBRSxNQUFNLEdBQUcsSUFBSSxDQUV6QztJQUVELDhFQUE4RTtJQUM5RSxXQUFXLENBQUMsS0FBSyxFQUFFLE9BQU8sR0FBRyxJQUFJLENBRWhDO0lBRUQ7Ozs7T0FJRztJQUNILGdCQUFnQixDQUFDLGdCQUFnQixFQUFFLGdCQUFnQixHQUFHLElBQUksQ0FHekQ7SUFFRDs7Ozs7T0FLRztJQUNILHVCQUF1QixDQUFDLGdCQUFnQixFQUFFLGdCQUFnQixFQUFFLGdCQUFnQixFQUFFLE1BQU0sR0FBRyxJQUFJLENBTzFGO0lBRUQ7OztPQUdHO0lBQ0gsbUJBQW1CLENBQUMsVUFBVSxFQUFFLE1BQU0sR0FBRyxJQUFJLENBSTVDO0lBRUQ7Ozs7T0FJRztJQUNILHNCQUFzQixDQUFDLGdCQUFnQixFQUFFLGdCQUFnQixHQUFHLElBQUksQ0FPL0Q7SUFFRDs7O09BR0c7SUFDSCxxQkFBcUIsQ0FBQyxXQUFXLEVBQUUsTUFBTSxFQUFFLFNBQVMsRUFBRSxNQUFNLEdBQUcsSUFBSSxDQU1sRTtJQUVEOztPQUVHO0lBQ0gsMkJBQTJCLENBQUMsS0FBSyxFQUFFLE1BQU0sRUFBRSxTQUFTLEVBQUUsTUFBTSxHQUFHLElBQUksQ0FJbEU7SUFFRCxrQ0FBa0M7SUFDbEMsZUFBZSxJQUFJO1FBQ2pCLHNCQUFzQixFQUFFLGdCQUFnQixDQUFDO1FBQ3pDLHVCQUF1QixFQUFFLGdCQUFnQixDQUFDO1FBQzFDLGFBQWEsRUFBRSxFQUFFLENBQUM7UUFDbEIsY0FBYyxFQUFFLEVBQUUsQ0FBQztLQUNwQixDQU9BO0lBRUQsNkRBQTZEO0lBQzdELGNBQWMsSUFBSSxzQkFBc0IsQ0FFdkM7SUFFRCwrRUFBK0U7SUFDL0UsYUFBYSxDQUFDLGdCQUFnQixFQUFFLGdCQUFnQixHQUFHLFVBQVUsR0FBRyxTQUFTLENBRXhFO0lBRUQsc0NBQXNDO0lBQ3RDLFdBQVcsQ0FBQyxnQkFBZ0IsRUFBRSxnQkFBZ0IsR0FBRyxFQUFFLEVBQUUsQ0FFcEQ7SUFFRCx1Q0FBdUM7SUFDdkMsa0JBQWtCLENBQUMsZ0JBQWdCLEVBQUUsZ0JBQWdCLEdBQUcsSUFBSSxFQUFFLENBRTdEO0lBRUQsbUVBQW1FO0lBQ25FLHdCQUF3QixDQUFDLGFBQWEsRUFBRSxTQUFTLENBQUMsZ0JBQWdCLENBQUMsR0FBRyxTQUFTLENBQUMsY0FBYyxDQUFDLENBZ0M5RjtJQUVELGtFQUFrRTtJQUNsRSx1QkFBdUIsQ0FBQyxhQUFhLEVBQUUsU0FBUyxDQUFDLGdCQUFnQixDQUFDLEdBQUcsU0FBUyxDQUFDLGFBQWEsQ0FBQyxDQTRDNUY7SUFFRCxpRUFBaUU7SUFDakUsc0JBQXNCLElBQUksU0FBUyxDQUFDLGdCQUFnQixDQUFDLENBb0NwRDtJQUVELCtEQUErRDtJQUMvRCxvQkFBb0IsSUFBSSxTQUFTLENBQUMsbUJBQW1CLENBQUMsQ0FhckQ7SUFFRCxPQUFPLENBQUMsNkJBQTZCO0lBTXJDLE9BQU8sQ0FBQyxZQUFZO0lBZXBCLE9BQU8sQ0FBQyxrQkFBa0I7SUFRMUIsT0FBTyxDQUFDLHlCQUF5QjtJQWlCakMsT0FBTyxDQUFDLGtCQUFrQjtJQXFCMUIsT0FBTyxDQUFDLHVCQUF1QjtZQXVCakIsWUFBWTtJQTZFMUIsT0FBTyxDQUFDLG1CQUFtQjtJQU8zQixnR0FBZ0c7SUFDaEcsT0FBTyxDQUFDLGlDQUFpQztZQWtCM0IsdUJBQXVCO1lBTXZCLHVCQUF1QjtDQUd0QyJ9
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"fake_l1_state.d.ts","sourceRoot":"","sources":["../../src/test/fake_l1_state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AACrE,OAAO,EAAE,KAAK,IAAI,EAAqD,MAAM,iBAAiB,CAAC;AAE/F,OAAO,KAAK,EAAyB,aAAa,EAAkB,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAEtH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAoB,gBAAgB,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAEjG,OAAO,EAAE,eAAe,EAAE,MAAM,2CAA2C,CAAC;AAC5E,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAG3D,OAAO,EAAyD,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACrG,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;
|
|
1
|
+
{"version":3,"file":"fake_l1_state.d.ts","sourceRoot":"","sources":["../../src/test/fake_l1_state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AACrE,OAAO,EAAE,KAAK,IAAI,EAAqD,MAAM,iBAAiB,CAAC;AAE/F,OAAO,KAAK,EAAyB,aAAa,EAAkB,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAEtH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAoB,gBAAgB,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAEjG,OAAO,EAAE,eAAe,EAAE,MAAM,2CAA2C,CAAC;AAC5E,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAG3D,OAAO,EAAyD,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACrG,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAKtD,OAAO,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAE7D,OAAO,EAAE,KAAK,SAAS,EAAQ,MAAM,oBAAoB,CAAC;AAc1D,2CAA2C;AAC3C,MAAM,MAAM,iBAAiB,GAAG;IAC9B,4BAA4B;IAC5B,kBAAkB,EAAE,EAAE,CAAC;IACvB,6BAA6B;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,kCAAkC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,yCAAyC;IACzC,oBAAoB,EAAE,MAAM,CAAC;IAC7B,yCAAyC;IACzC,aAAa,EAAE,UAAU,CAAC;IAC1B,wCAAwC;IACxC,YAAY,EAAE,UAAU,CAAC;IACzB,qCAAqC;IACrC,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC;AAEF,uCAAuC;AACvC,KAAK,oBAAoB,GAAG;IAC1B,qDAAqD;IACrD,aAAa,EAAE,MAAM,CAAC;IACtB,wDAAwD;IACxD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,8CAA8C;IAC9C,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;IACnB,mDAAmD;IACnD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oFAAoF;IACpF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,8CAA8C;IAC9C,OAAO,CAAC,EAAE,eAAe,EAAE,CAAC;IAC5B,4BAA4B;IAC5B,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iCAAiC;IACjC,eAAe,CAAC,EAAE,sBAAsB,CAAC;IACzC,oCAAoC;IACpC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,8CAA8C;IAC9C,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,2EAA2E;IAC3E,qBAAqB,CAAC,EAAE,MAAM,CAAC;CAChC,CAAC;AAEF,uCAAuC;AACvC,KAAK,mBAAmB,GAAG;IACzB,uCAAuC;IACvC,UAAU,EAAE,UAAU,CAAC;IACvB,iDAAiD;IACjD,QAAQ,EAAE,EAAE,EAAE,CAAC;CAChB,CAAC;AA4BF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,WAAW;IAoBV,OAAO,CAAC,QAAQ,CAAC,MAAM;IAnBnC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAyC;IAC7D,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,WAAW,CAAwB;IAC3C,OAAO,CAAC,QAAQ,CAAqB;IACrC,OAAO,CAAC,mBAAmB,CAA2B;IACtD,OAAO,CAAC,WAAW,CAAyB;IAC5C,OAAO,CAAC,sBAAsB,CAAyC;IACvE,OAAO,CAAC,mBAAmB,CAAa;IACxC,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,cAAc,CAAkB;IAGxC,OAAO,CAAC,uBAAuB,CAAyC;IAKxE,OAAO,CAAC,sBAAsB,CAAqB;IAEnD,YAA6B,MAAM,EAAE,iBAAiB,EAIrD;IAED;;;;;;OAMG;IACH,WAAW,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,EAAE,GAAG,IAAI,CAahG;IAED;;;;OAIG;IACU,UAAU,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,OAAO,EAAE,OAAO,CAAC,oBAAoB,CAAC,sBAEjG;IAED;;;;OAIG;IACU,aAAa,CACxB,gBAAgB,EAAE,gBAAgB,EAClC,OAAO,EAAE,oBAAoB,GAC5B,OAAO,CAAC,mBAAmB,CAAC,CAuC9B;IAED,yEAAyE;IACzE,OAAO,CAAC,yBAAyB;IA0BjC,mFAAmF;IAC5E,kBAAkB,CAAC,aAAa,EAAE,MAAM,GAAG,UAAU,CAG3D;IAED,qFAAqF;IAC9E,qBAAqB,CAAC,aAAa,EAAE,MAAM,GAAG,MAAM,CAG1D;IAED;;;OAGG;IACH,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAG1C;IAED;;;OAGG;IACH,yBAAyB,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAE/D;IAED,oEAAoE;IACpE,sBAAsB,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI,CAE/D;IAED;;OAEG;IACH,kCAAkC,CAAC,SAAS,EAAE,MAAM,GAAG,gBAAgB,CAStE;IAED,iEAAiE;IACjE,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAEzC;IAED,8EAA8E;IAC9E,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAEhC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI,CAGzD;IAED;;;;;OAKG;IACH,uBAAuB,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAO1F;IAED;;;OAGG;IACH,mBAAmB,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAI5C;IAED;;;;OAIG;IACH,sBAAsB,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI,CAO/D;IAED;;;OAGG;IACH,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAMlE;IAED;;OAEG;IACH,2BAA2B,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAIlE;IAED,kCAAkC;IAClC,eAAe,IAAI;QACjB,sBAAsB,EAAE,gBAAgB,CAAC;QACzC,uBAAuB,EAAE,gBAAgB,CAAC;QAC1C,aAAa,EAAE,EAAE,CAAC;QAClB,cAAc,EAAE,EAAE,CAAC;KACpB,CAOA;IAED,6DAA6D;IAC7D,cAAc,IAAI,sBAAsB,CAEvC;IAED,+EAA+E;IAC/E,aAAa,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,UAAU,GAAG,SAAS,CAExE;IAED,sCAAsC;IACtC,WAAW,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,EAAE,EAAE,CAEpD;IAED,uCAAuC;IACvC,kBAAkB,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,IAAI,EAAE,CAE7D;IAED,mEAAmE;IACnE,wBAAwB,CAAC,aAAa,EAAE,SAAS,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC,cAAc,CAAC,CAgC9F;IAED,kEAAkE;IAClE,uBAAuB,CAAC,aAAa,EAAE,SAAS,CAAC,gBAAgB,CAAC,GAAG,SAAS,CAAC,aAAa,CAAC,CA4C5F;IAED,iEAAiE;IACjE,sBAAsB,IAAI,SAAS,CAAC,gBAAgB,CAAC,CAoCpD;IAED,+DAA+D;IAC/D,oBAAoB,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAarD;IAED,OAAO,CAAC,6BAA6B;IAMrC,OAAO,CAAC,YAAY;IAepB,OAAO,CAAC,kBAAkB;IAQ1B,OAAO,CAAC,yBAAyB;IAiBjC,OAAO,CAAC,kBAAkB;IAqB1B,OAAO,CAAC,uBAAuB;YAuBjB,YAAY;IA6E1B,OAAO,CAAC,mBAAmB;IAO3B,gGAAgG;IAChG,OAAO,CAAC,iCAAiC;YAkB3B,uBAAuB;YAMvB,uBAAuB;CAGtC"}
|
|
@@ -3,13 +3,14 @@ import { INITIAL_CHECKPOINT_NUMBER } from '@aztec/constants';
|
|
|
3
3
|
import { MULTI_CALL_3_ADDRESS } from '@aztec/ethereum/contracts';
|
|
4
4
|
import { CheckpointNumber } from '@aztec/foundation/branded-types';
|
|
5
5
|
import { Buffer16, Buffer32 } from '@aztec/foundation/buffer';
|
|
6
|
+
import { Secp256k1Signer } from '@aztec/foundation/crypto/secp256k1-signer';
|
|
6
7
|
import { createLogger } from '@aztec/foundation/log';
|
|
7
8
|
import { RollupAbi } from '@aztec/l1-artifacts';
|
|
8
9
|
import { CommitteeAttestation, CommitteeAttestationsAndSigners } from '@aztec/stdlib/block';
|
|
9
10
|
import { getSlotAtTimestamp } from '@aztec/stdlib/epoch-helpers';
|
|
10
11
|
import { InboxLeaf } from '@aztec/stdlib/messaging';
|
|
11
|
-
import { ConsensusPayload,
|
|
12
|
-
import {
|
|
12
|
+
import { ConsensusPayload, getHashedSignaturePayloadTypedData } from '@aztec/stdlib/p2p';
|
|
13
|
+
import { mockCheckpointAndMessages } from '@aztec/stdlib/testing';
|
|
13
14
|
import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
|
|
14
15
|
import { mock } from 'jest-mock-extended';
|
|
15
16
|
import { encodeAbiParameters, encodeFunctionData, keccak256, multicall3Abi, toHex } from 'viem';
|
|
@@ -48,7 +49,9 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
48
49
|
canPruneResult;
|
|
49
50
|
// Computed from checkpoints based on L1 block visibility
|
|
50
51
|
pendingCheckpointNumber;
|
|
51
|
-
// The L1 block number reported as "finalized" (defaults to the start block)
|
|
52
|
+
// The L1 block number reported as "finalized" (defaults to the start block).
|
|
53
|
+
// `undefined` simulates the startup window on a fresh devnet where
|
|
54
|
+
// `getBlock({ blockTag: 'finalized' })` fails with "finalized block not found".
|
|
52
55
|
finalizedL1BlockNumber;
|
|
53
56
|
constructor(config){
|
|
54
57
|
this.config = config;
|
|
@@ -161,7 +164,10 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
161
164
|
this.l1BlockNumber = blockNumber;
|
|
162
165
|
this.updatePendingCheckpointNumber();
|
|
163
166
|
}
|
|
164
|
-
/**
|
|
167
|
+
/**
|
|
168
|
+
* Sets the L1 block number that will be reported as "finalized". Pass `undefined` to
|
|
169
|
+
* simulate a chain that does not yet have a finalized block (devnet startup).
|
|
170
|
+
*/ setFinalizedL1BlockNumber(blockNumber) {
|
|
165
171
|
this.finalizedL1BlockNumber = blockNumber;
|
|
166
172
|
}
|
|
167
173
|
/** Marks a checkpoint as proven. Updates provenCheckpointNumber. */ markCheckpointAsProven(checkpointNumber) {
|
|
@@ -194,6 +200,19 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
194
200
|
this.updatePendingCheckpointNumber();
|
|
195
201
|
}
|
|
196
202
|
/**
|
|
203
|
+
* Moves a checkpoint to a different L1 block number (simulates L1 reorg that
|
|
204
|
+
* re-includes the same checkpoint transaction in a different block).
|
|
205
|
+
* The checkpoint content stays the same — only the L1 metadata changes.
|
|
206
|
+
* Auto-updates pending status.
|
|
207
|
+
*/ moveCheckpointToL1Block(checkpointNumber, newL1BlockNumber) {
|
|
208
|
+
for (const cpData of this.checkpoints){
|
|
209
|
+
if (cpData.checkpointNumber === checkpointNumber) {
|
|
210
|
+
cpData.l1BlockNumber = newL1BlockNumber;
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
this.updatePendingCheckpointNumber();
|
|
214
|
+
}
|
|
215
|
+
/**
|
|
197
216
|
* Removes messages after a given total index (simulates L1 reorg).
|
|
198
217
|
* Auto-updates rolling hash.
|
|
199
218
|
*/ removeMessagesAfter(totalIndex) {
|
|
@@ -279,30 +298,45 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
279
298
|
}
|
|
280
299
|
/** Creates mock InboxContract that reads from this fake state. */ createMockInboxContract(_publicClient) {
|
|
281
300
|
const mockInbox = mock();
|
|
282
|
-
mockInbox.getState.mockImplementation(()=>{
|
|
301
|
+
mockInbox.getState.mockImplementation((opts = {})=>{
|
|
302
|
+
// Filter messages visible at the given block number (or all if not specified)
|
|
303
|
+
const blockNumber = opts.blockNumber ?? this.l1BlockNumber;
|
|
304
|
+
const visibleMessages = this.messages.filter((m)=>m.l1BlockNumber <= blockNumber);
|
|
283
305
|
// treeInProgress must be > any sealed checkpoint. On L1, a checkpoint can only be proposed
|
|
284
306
|
// after its messages are sealed, so treeInProgress > checkpointNumber for all published checkpoints.
|
|
285
|
-
const maxFromMessages =
|
|
286
|
-
const maxFromCheckpoints = this.checkpoints.length > 0 ? Math.max(...this.checkpoints.filter((cp)=>!cp.pruned).map((cp)=>Number(cp.checkpointNumber))) + 1 : 0;
|
|
307
|
+
const maxFromMessages = visibleMessages.length > 0 ? Math.max(...visibleMessages.map((m)=>Number(m.checkpointNumber))) + 1 : 0;
|
|
308
|
+
const maxFromCheckpoints = this.checkpoints.length > 0 ? Math.max(...this.checkpoints.filter((cp)=>!cp.pruned && cp.l1BlockNumber <= blockNumber).map((cp)=>Number(cp.checkpointNumber)), 0) + 1 : 0;
|
|
287
309
|
const treeInProgress = Math.max(maxFromMessages, maxFromCheckpoints, INITIAL_CHECKPOINT_NUMBER);
|
|
310
|
+
// Compute rolling hash only for visible messages
|
|
311
|
+
const rollingHash = visibleMessages.length > 0 ? visibleMessages[visibleMessages.length - 1].rollingHash : Buffer16.ZERO;
|
|
288
312
|
return Promise.resolve({
|
|
289
|
-
messagesRollingHash:
|
|
290
|
-
totalMessagesInserted: BigInt(
|
|
313
|
+
messagesRollingHash: rollingHash,
|
|
314
|
+
totalMessagesInserted: BigInt(visibleMessages.length),
|
|
291
315
|
treeInProgress: BigInt(treeInProgress)
|
|
292
316
|
});
|
|
293
317
|
});
|
|
294
318
|
// Mock the wrapper methods for fetching message events
|
|
295
319
|
mockInbox.getMessageSentEvents.mockImplementation((fromBlock, toBlock)=>Promise.resolve(this.getMessageSentLogs(fromBlock, toBlock)));
|
|
296
|
-
mockInbox.getMessageSentEventByHash.mockImplementation((
|
|
320
|
+
mockInbox.getMessageSentEventByHash.mockImplementation((msgHash, aroundL1BlockNumber)=>Promise.resolve(this.getMessageSentLogByHash(msgHash, aroundL1BlockNumber)));
|
|
297
321
|
return mockInbox;
|
|
298
322
|
}
|
|
299
323
|
/** Creates mock PublicClient that reads from this fake state. */ createMockPublicClient() {
|
|
300
324
|
const publicClient = mock();
|
|
301
325
|
publicClient.getChainId.mockResolvedValue(1);
|
|
326
|
+
// Several consumers (CalldataRetriever, ArchiverL1Synchronizer) derive the EIP-712 signing
|
|
327
|
+
// context from `publicClient.chain.id`. Pin it so it matches `getSignatureContext()` below.
|
|
328
|
+
publicClient.chain = {
|
|
329
|
+
id: 1
|
|
330
|
+
};
|
|
302
331
|
publicClient.getBlockNumber.mockImplementation(()=>Promise.resolve(this.l1BlockNumber));
|
|
303
332
|
publicClient.getBlock.mockImplementation(async (args = {})=>{
|
|
304
333
|
let blockNum;
|
|
305
334
|
if (args.blockTag === 'finalized') {
|
|
335
|
+
if (this.finalizedL1BlockNumber === undefined) {
|
|
336
|
+
throw Object.assign(new Error('finalized block not found'), {
|
|
337
|
+
details: 'finalized block not found'
|
|
338
|
+
});
|
|
339
|
+
}
|
|
306
340
|
blockNum = this.finalizedL1BlockNumber;
|
|
307
341
|
} else {
|
|
308
342
|
blockNum = args.blockNumber ?? await publicClient.getBlockNumber();
|
|
@@ -319,8 +353,8 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
319
353
|
}
|
|
320
354
|
/** Creates mock BlobClient that reads from this fake state. */ createMockBlobClient() {
|
|
321
355
|
const blobClient = mock();
|
|
322
|
-
// The blockId is the
|
|
323
|
-
blobClient.getBlobSidecar.mockImplementation((blockId)=>Promise.resolve(this.checkpoints.find((cpData)=>cpData.
|
|
356
|
+
// The blockId is the L1 block hash, which we derive from the L1 block number
|
|
357
|
+
blobClient.getBlobSidecar.mockImplementation((blockId)=>Promise.resolve(this.checkpoints.find((cpData)=>Buffer32.fromBigInt(cpData.l1BlockNumber).toString() === blockId)?.blobs ?? []));
|
|
324
358
|
blobClient.testSources.mockResolvedValue(undefined);
|
|
325
359
|
return blobClient;
|
|
326
360
|
}
|
|
@@ -371,13 +405,37 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
371
405
|
}
|
|
372
406
|
}));
|
|
373
407
|
}
|
|
408
|
+
getMessageSentLogByHash(msgHash, aroundL1BlockNumber) {
|
|
409
|
+
const msg = this.messages.find((msg)=>msg.leaf.toString() === msgHash && msg.l1BlockNumber >= aroundL1BlockNumber - 5n && msg.l1BlockNumber <= aroundL1BlockNumber + 5n);
|
|
410
|
+
if (!msg) {
|
|
411
|
+
return undefined;
|
|
412
|
+
}
|
|
413
|
+
return {
|
|
414
|
+
l1BlockNumber: msg.l1BlockNumber,
|
|
415
|
+
l1BlockHash: Buffer32.fromBigInt(msg.l1BlockNumber),
|
|
416
|
+
l1TransactionHash: `0x${msg.l1BlockNumber.toString(16)}`,
|
|
417
|
+
args: {
|
|
418
|
+
checkpointNumber: msg.checkpointNumber,
|
|
419
|
+
index: msg.index,
|
|
420
|
+
leaf: msg.leaf,
|
|
421
|
+
rollingHash: msg.rollingHash
|
|
422
|
+
}
|
|
423
|
+
};
|
|
424
|
+
}
|
|
374
425
|
async makeRollupTx(checkpoint, signers) {
|
|
375
|
-
const
|
|
426
|
+
const signatureContext = this.getSignatureContext();
|
|
427
|
+
const consensusPayload = ConsensusPayload.fromCheckpoint(checkpoint, signatureContext);
|
|
428
|
+
const attestationDigest = getHashedSignaturePayloadTypedData(consensusPayload);
|
|
429
|
+
const attestations = signers.map((signer)=>CommitteeAttestation.fromSignature(signer.sign(attestationDigest))).map((committeeAttestation)=>committeeAttestation.toViem());
|
|
376
430
|
const header = checkpoint.header.toViem();
|
|
377
431
|
const blobInput = getPrefixedEthBlobCommitments(await getBlobsPerL1Block(checkpoint.toBlobFields()));
|
|
378
432
|
const archive = toHex(checkpoint.archive.root.toBuffer());
|
|
379
|
-
const attestationsAndSigners = new CommitteeAttestationsAndSigners(attestations.map((attestation)=>CommitteeAttestation.fromViem(attestation)));
|
|
380
|
-
|
|
433
|
+
const attestationsAndSigners = new CommitteeAttestationsAndSigners(attestations.map((attestation)=>CommitteeAttestation.fromViem(attestation)), signatureContext);
|
|
434
|
+
// Fall back to a random signer when no attesters are provided, so tests that
|
|
435
|
+
// don't care about the proposer identity (e.g. sync tests) still produce a
|
|
436
|
+
// valid-looking signature for the attestationsAndSigners struct.
|
|
437
|
+
const proposerSigner = signers[0] ?? Secp256k1Signer.random();
|
|
438
|
+
const attestationsAndSignersSignature = proposerSigner.sign(getHashedSignaturePayloadTypedData(attestationsAndSigners));
|
|
381
439
|
const packedAttestations = attestationsAndSigners.getPackedAttestations();
|
|
382
440
|
const rollupInput = encodeFunctionData({
|
|
383
441
|
abi: RollupAbi,
|
|
@@ -416,9 +474,7 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
416
474
|
packedAttestations
|
|
417
475
|
])));
|
|
418
476
|
// Compute payloadDigest (same logic as CalldataRetriever)
|
|
419
|
-
const
|
|
420
|
-
const payloadToSign = consensusPayload.getPayloadToSign(SignatureDomainSeparator.checkpointAttestation);
|
|
421
|
-
const payloadDigest = Buffer32.fromString(keccak256(payloadToSign));
|
|
477
|
+
const payloadDigest = getHashedSignaturePayloadTypedData(consensusPayload);
|
|
422
478
|
const tx = {
|
|
423
479
|
input: multiCallInput,
|
|
424
480
|
hash: archive,
|
|
@@ -431,6 +487,12 @@ import { updateRollingHash } from '../structs/inbox_message.js';
|
|
|
431
487
|
payloadDigest
|
|
432
488
|
};
|
|
433
489
|
}
|
|
490
|
+
getSignatureContext() {
|
|
491
|
+
return {
|
|
492
|
+
chainId: 1,
|
|
493
|
+
rollupAddress: this.config.rollupAddress
|
|
494
|
+
};
|
|
495
|
+
}
|
|
434
496
|
/** Extracts the CommitteeAttestations struct definition from RollupAbi for hash computation. */ getCommitteeAttestationsStructDef() {
|
|
435
497
|
const proposeFunction = RollupAbi.find((item)=>item.type === 'function' && item.name === 'propose');
|
|
436
498
|
if (!proposeFunction) {
|