@aztec/archiver 0.0.0-test.0 → 0.0.1-commit.023c3e5

package/dest/archiver/kv_archiver_store/message_store.d.ts

@@ -1,33 +0,0 @@
-import { Fr } from '@aztec/foundation/fields';
-import type { AztecAsyncKVStore } from '@aztec/kv-store';
-import { InboxLeaf } from '@aztec/stdlib/messaging';
-import type { DataRetrieval } from '../structs/data_retrieval.js';
-/**
- * LMDB implementation of the ArchiverDataStore interface.
- */
-export declare class MessageStore {
-    #private;
-    private db;
-    constructor(db: AztecAsyncKVStore);
-    getTotalL1ToL2MessageCount(): Promise<bigint>;
-    /**
-     * Gets the last L1 block number that emitted new messages.
-     * @returns The last L1 block number processed
-     */
-    getSynchedL1BlockNumber(): Promise<bigint | undefined>;
-    setSynchedL1BlockNumber(l1BlockNumber: bigint): Promise<void>;
-    /**
-     * Append L1 to L2 messages to the store.
-     * @param messages - The L1 to L2 messages to be added to the store and the last processed L1 block.
-     * @returns True if the operation is successful.
-     */
-    addL1ToL2Messages(messages: DataRetrieval<InboxLeaf>): Promise<boolean>;
-    /**
-     * Gets the L1 to L2 message index in the L1 to L2 message tree.
-     * @param l1ToL2Message - The L1 to L2 message.
-     * @returns The index of the L1 to L2 message in the L1 to L2 message tree (undefined if not found).
-     */
-    getL1ToL2MessageIndex(l1ToL2Message: Fr): Promise<bigint | undefined>;
-    getL1ToL2Messages(blockNumber: bigint): Promise<Fr[]>;
-}
-//# sourceMappingURL=message_store.d.ts.map

package/dest/archiver/kv_archiver_store/message_store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"message_store.d.ts","sourceRoot":"","sources":["../../../src/archiver/kv_archiver_store/message_store.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,KAAK,EAAE,iBAAiB,EAAsC,MAAM,iBAAiB,CAAC;AAC7F,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAElE;;GAEG;AACH,qBAAa,YAAY;;IAUX,OAAO,CAAC,EAAE;gBAAF,EAAE,EAAE,iBAAiB;IAOnC,0BAA0B,IAAI,OAAO,CAAC,MAAM,CAAC;IAInD;;;OAGG;IACH,uBAAuB,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAIhD,uBAAuB,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAInE;;;;OAIG;IACH,iBAAiB,CAAC,QAAQ,EAAE,aAAa,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IAsBvE;;;;OAIG;IACH,qBAAqB,CAAC,aAAa,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAI/D,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC;CAqB5D"}

package/dest/archiver/kv_archiver_store/message_store.js

@@ -1,85 +0,0 @@
-import { L1_TO_L2_MSG_SUBTREE_HEIGHT } from '@aztec/constants';
-import { Fr } from '@aztec/foundation/fields';
-import { createLogger } from '@aztec/foundation/log';
-import { InboxLeaf } from '@aztec/stdlib/messaging';
-/**
- * LMDB implementation of the ArchiverDataStore interface.
- */ export class MessageStore {
-    db;
-    #l1ToL2Messages;
-    #l1ToL2MessageIndices;
-    #lastSynchedL1Block;
-    #totalMessageCount;
-    #log;
-    #l1ToL2MessagesSubtreeSize;
-    constructor(db){
-        this.db = db;
-        this.#log = createLogger('archiver:message_store');
-        this.#l1ToL2MessagesSubtreeSize = 2 ** L1_TO_L2_MSG_SUBTREE_HEIGHT;
-        this.#l1ToL2Messages = db.openMap('archiver_l1_to_l2_messages');
-        this.#l1ToL2MessageIndices = db.openMap('archiver_l1_to_l2_message_indices');
-        this.#lastSynchedL1Block = db.openSingleton('archiver_last_l1_block_new_messages');
-        this.#totalMessageCount = db.openSingleton('archiver_l1_to_l2_message_count');
-    }
-    async getTotalL1ToL2MessageCount() {
-        return await this.#totalMessageCount.getAsync() ?? 0n;
-    }
-    /**
-   * Gets the last L1 block number that emitted new messages.
-   * @returns The last L1 block number processed
-   */ getSynchedL1BlockNumber() {
-        return this.#lastSynchedL1Block.getAsync();
-    }
-    async setSynchedL1BlockNumber(l1BlockNumber) {
-        await this.#lastSynchedL1Block.set(l1BlockNumber);
-    }
-    /**
-   * Append L1 to L2 messages to the store.
-   * @param messages - The L1 to L2 messages to be added to the store and the last processed L1 block.
-   * @returns True if the operation is successful.
-   */ addL1ToL2Messages(messages) {
-        return this.db.transactionAsync(async ()=>{
-            const lastL1BlockNumber = await this.#lastSynchedL1Block.getAsync() ?? 0n;
-            if (lastL1BlockNumber >= messages.lastProcessedL1BlockNumber) {
-                return false;
-            }
-            await this.#lastSynchedL1Block.set(messages.lastProcessedL1BlockNumber);
-            for (const message of messages.retrievedData){
-                const key = `${message.index}`;
-                await this.#l1ToL2Messages.set(key, message.leaf.toBuffer());
-                await this.#l1ToL2MessageIndices.set(message.leaf.toString(), message.index);
-            }
-            const lastTotalMessageCount = await this.getTotalL1ToL2MessageCount();
-            await this.#totalMessageCount.set(lastTotalMessageCount + BigInt(messages.retrievedData.length));
-            return true;
-        });
-    }
-    /**
-   * Gets the L1 to L2 message index in the L1 to L2 message tree.
-   * @param l1ToL2Message - The L1 to L2 message.
-   * @returns The index of the L1 to L2 message in the L1 to L2 message tree (undefined if not found).
-   */ getL1ToL2MessageIndex(l1ToL2Message) {
-        return this.#l1ToL2MessageIndices.getAsync(l1ToL2Message.toString());
-    }
-    async getL1ToL2Messages(blockNumber) {
-        const messages = [];
-        let undefinedMessageFound = false;
-        const startIndex = Number(InboxLeaf.smallestIndexFromL2Block(blockNumber));
-        for(let i = startIndex; i < startIndex + this.#l1ToL2MessagesSubtreeSize; i++){
-            // This is inefficient but probably fine for now.
-            const key = `${i}`;
-            const message = await this.#l1ToL2Messages.getAsync(key);
-            if (message) {
-                if (undefinedMessageFound) {
-                    throw new Error(`L1 to L2 message gap found in block ${blockNumber}`);
-                }
-                messages.push(Fr.fromBuffer(message));
-            } else {
-                undefinedMessageFound = true;
-            // We continue iterating over messages here to verify that there are no more messages after the undefined one.
-            // --> If this was the case this would imply there is some issue with log fetching.
-            }
-        }
-        return messages;
-    }
-}

package/dest/archiver/kv_archiver_store/nullifier_store.d.ts

@@ -1,12 +0,0 @@
-import type { Fr } from '@aztec/foundation/fields';
-import type { AztecAsyncKVStore } from '@aztec/kv-store';
-import type { InBlock, L2Block } from '@aztec/stdlib/block';
-export declare class NullifierStore {
-    #private;
-    private db;
-    constructor(db: AztecAsyncKVStore);
-    addNullifiers(blocks: L2Block[]): Promise<boolean>;
-    deleteNullifiers(blocks: L2Block[]): Promise<boolean>;
-    findNullifiersIndexesWithBlock(blockNumber: number, nullifiers: Fr[]): Promise<(InBlock<bigint> | undefined)[]>;
-}
-//# sourceMappingURL=nullifier_store.d.ts.map

package/dest/archiver/kv_archiver_store/nullifier_store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"nullifier_store.d.ts","sourceRoot":"","sources":["../../../src/archiver/kv_archiver_store/nullifier_store.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAEnD,OAAO,KAAK,EAAE,iBAAiB,EAAiB,MAAM,iBAAiB,CAAC;AACxE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE5D,qBAAa,cAAc;;IAMb,OAAO,CAAC,EAAE;gBAAF,EAAE,EAAE,iBAAiB;IAMnC,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IA0BlD,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAerD,8BAA8B,CAClC,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,EAAE,EAAE,GACf,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;CAkC5C"}

package/dest/archiver/kv_archiver_store/nullifier_store.js

@@ -1,73 +0,0 @@
-import { MAX_NULLIFIERS_PER_TX } from '@aztec/constants';
-import { createLogger } from '@aztec/foundation/log';
-export class NullifierStore {
-    db;
-    #nullifiersToBlockNumber;
-    #nullifiersToBlockHash;
-    #nullifiersToIndex;
-    #log;
-    constructor(db){
-        this.db = db;
-        this.#log = createLogger('archiver:log_store');
-        this.#nullifiersToBlockNumber = db.openMap('archiver_nullifiers_to_block_number');
-        this.#nullifiersToBlockHash = db.openMap('archiver_nullifiers_to_block_hash');
-        this.#nullifiersToIndex = db.openMap('archiver_nullifiers_to_index');
-    }
-    async addNullifiers(blocks) {
-        const blockHashes = await Promise.all(blocks.map((block)=>block.hash()));
-        await this.db.transactionAsync(async ()=>{
-            await Promise.all(blocks.map((block, i)=>{
-                const dataStartIndexForBlock = block.header.state.partial.nullifierTree.nextAvailableLeafIndex - block.body.txEffects.length * MAX_NULLIFIERS_PER_TX;
-                return Promise.all(block.body.txEffects.map((txEffects, txIndex)=>{
-                    const dataStartIndexForTx = dataStartIndexForBlock + txIndex * MAX_NULLIFIERS_PER_TX;
-                    return Promise.all(txEffects.nullifiers.map(async (nullifier, nullifierIndex)=>{
-                        await this.#nullifiersToBlockNumber.set(nullifier.toString(), block.number);
-                        await this.#nullifiersToBlockHash.set(nullifier.toString(), blockHashes[i].toString());
-                        await this.#nullifiersToIndex.set(nullifier.toString(), dataStartIndexForTx + nullifierIndex);
-                    }));
-                }));
-            }));
-        });
-        return true;
-    }
-    async deleteNullifiers(blocks) {
-        await this.db.transactionAsync(async ()=>{
-            for (const block of blocks){
-                for (const nullifier of block.body.txEffects.flatMap((tx)=>tx.nullifiers)){
-                    await Promise.all([
-                        this.#nullifiersToBlockNumber.delete(nullifier.toString()),
-                        this.#nullifiersToBlockHash.delete(nullifier.toString()),
-                        this.#nullifiersToIndex.delete(nullifier.toString())
-                    ]);
-                }
-            }
-        });
-        return true;
-    }
-    async findNullifiersIndexesWithBlock(blockNumber, nullifiers) {
-        const asStrings = nullifiers.map((x)=>x.toString());
-        const maybeNullifiers = await Promise.all(asStrings.map(async (nullifier)=>{
-            const [data, l2BlockNumber, l2BlockHash] = await Promise.all([
-                this.#nullifiersToIndex.getAsync(nullifier),
-                this.#nullifiersToBlockNumber.getAsync(nullifier),
-                this.#nullifiersToBlockHash.getAsync(nullifier)
-            ]);
-            return {
-                data,
-                l2BlockNumber,
-                l2BlockHash
-            };
-        }));
-        return maybeNullifiers.map(({ data, l2BlockNumber, l2BlockHash })=>{
-            if (data === undefined || l2BlockNumber === undefined || l2BlockHash === undefined || l2BlockNumber > blockNumber) {
-                return undefined;
-            } else {
-                return {
-                    data: BigInt(data),
-                    l2BlockNumber,
-                    l2BlockHash
-                };
-            }
-        });
-    }
-}

package/dest/archiver/memory_archiver_store/l1_to_l2_message_store.d.ts

@@ -1,23 +0,0 @@
-import type { Fr } from '@aztec/foundation/fields';
-import { InboxLeaf } from '@aztec/stdlib/messaging';
-/**
- * A simple in-memory implementation of an L1 to L2 message store.
- */
-export declare class L1ToL2MessageStore {
-    #private;
-    /**
-     * A map pointing from a key in a "messageIndex" format to the corresponding L1 to L2 message hash.
-     */
-    protected store: Map<string, Fr>;
-    constructor();
-    getTotalL1ToL2MessageCount(): bigint;
-    addMessage(message: InboxLeaf): void;
-    getMessages(blockNumber: bigint): Fr[];
-    /**
-     * Gets the L1 to L2 message index in the L1 to L2 message tree.
-     * @param l1ToL2Message - The L1 to L2 message.
-     * @returns The index of the L1 to L2 message in the L1 to L2 message tree (undefined if not found).
-     */
-    getMessageIndex(l1ToL2Message: Fr): bigint | undefined;
-}
-//# sourceMappingURL=l1_to_l2_message_store.d.ts.map

package/dest/archiver/memory_archiver_store/l1_to_l2_message_store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"l1_to_l2_message_store.d.ts","sourceRoot":"","sources":["../../../src/archiver/memory_archiver_store/l1_to_l2_message_store.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD;;GAEG;AACH,qBAAa,kBAAkB;;IAC7B;;OAEG;IACH,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAa;;IAM7C,0BAA0B,IAAI,MAAM;IAIpC,UAAU,CAAC,OAAO,EAAE,SAAS;IAI7B,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,EAAE,EAAE;IAsBtC;;;;OAIG;IACH,eAAe,CAAC,aAAa,EAAE,EAAE,GAAG,MAAM,GAAG,SAAS;CAQvD"}

package/dest/archiver/memory_archiver_store/l1_to_l2_message_store.js

@@ -1,49 +0,0 @@
-import { L1_TO_L2_MSG_SUBTREE_HEIGHT } from '@aztec/constants';
-import { InboxLeaf } from '@aztec/stdlib/messaging';
-/**
- * A simple in-memory implementation of an L1 to L2 message store.
- */ export class L1ToL2MessageStore {
-    /**
-   * A map pointing from a key in a "messageIndex" format to the corresponding L1 to L2 message hash.
-   */ store = new Map();
-    #l1ToL2MessagesSubtreeSize = 2 ** L1_TO_L2_MSG_SUBTREE_HEIGHT;
-    constructor(){}
-    getTotalL1ToL2MessageCount() {
-        return BigInt(this.store.size);
-    }
-    addMessage(message) {
-        this.store.set(`${message.index}`, message.leaf);
-    }
-    getMessages(blockNumber) {
-        const messages = [];
-        let undefinedMessageFound = false;
-        const startIndex = Number(InboxLeaf.smallestIndexFromL2Block(blockNumber));
-        for(let i = startIndex; i < startIndex + this.#l1ToL2MessagesSubtreeSize; i++){
-            // This is inefficient but probably fine for now.
-            const message = this.store.get(`${i}`);
-            if (message) {
-                if (undefinedMessageFound) {
-                    throw new Error(`L1 to L2 message gap found in block ${blockNumber}`);
-                }
-                messages.push(message);
-            } else {
-                undefinedMessageFound = true;
-            // We continue iterating over messages here to verify that there are no more messages after the undefined one.
-            // --> If this was the case this would imply there is some issue with log fetching.
-            }
-        }
-        return messages;
-    }
-    /**
-   * Gets the L1 to L2 message index in the L1 to L2 message tree.
-   * @param l1ToL2Message - The L1 to L2 message.
-   * @returns The index of the L1 to L2 message in the L1 to L2 message tree (undefined if not found).
-   */ getMessageIndex(l1ToL2Message) {
-        for (const [key, message] of this.store.entries()){
-            if (message.equals(l1ToL2Message)) {
-                return BigInt(key);
-            }
-        }
-        return undefined;
-    }
-}

package/dest/archiver/memory_archiver_store/memory_archiver_store.d.ts

@@ -1,175 +0,0 @@
-import { Fr } from '@aztec/foundation/fields';
-import { FunctionSelector } from '@aztec/stdlib/abi';
-import type { AztecAddress } from '@aztec/stdlib/aztec-address';
-import { type InBlock, type L2Block } from '@aztec/stdlib/block';
-import type { ContractClassPublic, ContractInstanceUpdateWithAddress, ContractInstanceWithAddress, ExecutablePrivateFunctionWithMembershipProof, UnconstrainedFunctionWithMembershipProof } from '@aztec/stdlib/contract';
-import type { GetContractClassLogsResponse, GetPublicLogsResponse } from '@aztec/stdlib/interfaces/client';
-import { type LogFilter, type PrivateLog, TxScopedL2Log } from '@aztec/stdlib/logs';
-import type { InboxLeaf } from '@aztec/stdlib/messaging';
-import { type BlockHeader, TxEffect, TxHash, TxReceipt } from '@aztec/stdlib/tx';
-import type { ArchiverDataStore, ArchiverL1SynchPoint } from '../archiver_store.js';
-import type { DataRetrieval } from '../structs/data_retrieval.js';
-import type { L1Published } from '../structs/published.js';
-/**
- * Simple, in-memory implementation of an archiver data store.
- */
-export declare class MemoryArchiverStore implements ArchiverDataStore {
-    #private;
-    /** The max number of logs that can be obtained in 1 "getPublicLogs" call. */
-    readonly maxLogs: number;
-    /**
-     * An array containing all the L2 blocks that have been fetched so far.
-     */
-    private l2Blocks;
-    /**
-     * An array containing all the tx effects in the L2 blocks that have been fetched so far.
-     */
-    private txEffects;
-    private taggedLogs;
-    private logTagsPerBlock;
-    private privateLogsPerBlock;
-    private publicLogsPerBlock;
-    private contractClassLogsPerBlock;
-    private blockScopedNullifiers;
-    /**
-     * Contains all L1 to L2 messages.
-     */
-    private l1ToL2Messages;
-    private contractClasses;
-    private bytecodeCommitments;
-    private privateFunctions;
-    private unconstrainedFunctions;
-    private contractInstances;
-    private contractInstanceUpdates;
-    private lastL1BlockNewBlocks;
-    private lastL1BlockNewMessages;
-    private lastProvenL2BlockNumber;
-    private lastProvenL2EpochNumber;
-    private functionNames;
-    constructor(
-    /** The max number of logs that can be obtained in 1 "getPublicLogs" call. */
-    maxLogs: number);
-    getContractClass(id: Fr): Promise<ContractClassPublic | undefined>;
-    getContractClassIds(): Promise<Fr[]>;
-    getContractInstance(address: AztecAddress): Promise<ContractInstanceWithAddress | undefined>;
-    getBytecodeCommitment(contractClassId: Fr): Promise<Fr | undefined>;
-    addFunctions(contractClassId: Fr, newPrivateFunctions: ExecutablePrivateFunctionWithMembershipProof[], newUnconstrainedFunctions: UnconstrainedFunctionWithMembershipProof[]): Promise<boolean>;
-    addContractClasses(data: ContractClassPublic[], bytecodeCommitments: Fr[], blockNumber: number): Promise<boolean>;
-    deleteContractClasses(data: ContractClassPublic[], blockNumber: number): Promise<boolean>;
-    addContractInstances(data: ContractInstanceWithAddress[], _blockNumber: number): Promise<boolean>;
-    deleteContractInstances(data: ContractInstanceWithAddress[], _blockNumber: number): Promise<boolean>;
-    addContractInstanceUpdates(data: ContractInstanceUpdateWithAddress[], blockNumber: number): Promise<boolean>;
-    deleteContractInstanceUpdates(data: ContractInstanceUpdateWithAddress[], blockNumber: number): Promise<boolean>;
-    /**
-     * Append new blocks to the store's list.
-     * @param blocks - The L2 blocks to be added to the store and the last processed L1 block.
-     * @returns True if the operation is successful.
-     */
-    addBlocks(blocks: L1Published<L2Block>[]): Promise<boolean>;
-    /**
-     * Unwinds blocks from the database
-     * @param from -  The tip of the chain, passed for verification purposes,
-     *                ensuring that we don't end up deleting something we did not intend
-     * @param blocksToUnwind - The number of blocks we are to unwind
-     * @returns True if the operation is successful
-     */
-    unwindBlocks(from: number, blocksToUnwind: number): Promise<boolean>;
-    /**
-     * Append new logs to the store's list.
-     * @param block - The block for which to add the logs.
-     * @returns True if the operation is successful.
-     */
-    addLogs(blocks: L2Block[]): Promise<boolean>;
-    deleteLogs(blocks: L2Block[]): Promise<boolean>;
-    addNullifiers(blocks: L2Block[]): Promise<boolean>;
-    deleteNullifiers(blocks: L2Block[]): Promise<boolean>;
-    findNullifiersIndexesWithBlock(blockNumber: number, nullifiers: Fr[]): Promise<(InBlock<bigint> | undefined)[]>;
-    getTotalL1ToL2MessageCount(): Promise<bigint>;
-    /**
-     * Append L1 to L2 messages to the store.
-     * @param messages - The L1 to L2 messages to be added to the store and the last processed L1 block.
-     * @returns True if the operation is successful.
-     */
-    addL1ToL2Messages(messages: DataRetrieval<InboxLeaf>): Promise<boolean>;
-    /**
-     * Gets the L1 to L2 message index in the L1 to L2 message tree.
-     * @param l1ToL2Message - The L1 to L2 message.
-     * @returns The index of the L1 to L2 message in the L1 to L2 message tree (undefined if not found).
-     */
-    getL1ToL2MessageIndex(l1ToL2Message: Fr): Promise<bigint | undefined>;
-    /**
-     * Gets up to `limit` amount of L2 blocks starting from `from`.
-     * @param from - Number of the first block to return (inclusive).
-     * @param limit - The number of blocks to return.
-     * @returns The requested L2 blocks.
-     * @remarks When "from" is smaller than genesis block number, blocks from the beginning are returned.
-     */
-    getBlocks(from: number, limit: number): Promise<L1Published<L2Block>[]>;
-    getBlockHeaders(from: number, limit: number): Promise<BlockHeader[]>;
-    /**
-     * Gets a tx effect.
-     * @param txHash - The txHash of the tx effect.
-     * @returns The requested tx effect.
-     */
-    getTxEffect(txHash: TxHash): Promise<InBlock<TxEffect> | undefined>;
-    /**
-     * Gets a receipt of a settled tx.
-     * @param txHash - The hash of a tx we try to get the receipt for.
-     * @returns The requested tx receipt (or undefined if not found).
-     */
-    getSettledTxReceipt(txHash: TxHash): Promise<TxReceipt | undefined>;
-    /**
-     * Gets L1 to L2 message (to be) included in a given block.
-     * @param blockNumber - L2 block number to get messages for.
-     * @returns The L1 to L2 messages/leaves of the messages subtree (throws if not found).
-     */
-    getL1ToL2Messages(blockNumber: bigint): Promise<Fr[]>;
-    /**
-     * Retrieves all private logs from up to `limit` blocks, starting from the block number `from`.
-     * @param from - The block number from which to begin retrieving logs.
-     * @param limit - The maximum number of blocks to retrieve logs from.
-     * @returns An array of private logs from the specified range of blocks.
-     */
-    getPrivateLogs(from: number, limit: number): Promise<PrivateLog[]>;
-    /**
-     * Gets all logs that match any of the received tags (i.e. logs with their first field equal to a tag).
-     * @param tags - The tags to filter the logs by.
-     * @returns For each received tag, an array of matching logs is returned. An empty array implies no logs match
-     * that tag.
-     */
-    getLogsByTags(tags: Fr[]): Promise<TxScopedL2Log[][]>;
-    /**
-     * Gets public logs based on the provided filter.
-     * @param filter - The filter to apply to the logs.
-     * @returns The requested logs.
-     * @remarks Works by doing an intersection of all params in the filter.
-     */
-    getPublicLogs(filter: LogFilter): Promise<GetPublicLogsResponse>;
-    /**
-     * Gets contract class logs based on the provided filter.
-     * NB: clone of the above fn, but for contract class logs
-     * @param filter - The filter to apply to the logs.
-     * @returns The requested logs.
-     * @remarks Works by doing an intersection of all params in the filter.
-     */
-    getContractClassLogs(filter: LogFilter): Promise<GetContractClassLogsResponse>;
-    getLastBlockNumber(): number;
-    /**
-     * Gets the number of the latest L2 block processed.
-     * @returns The number of the latest L2 block processed.
-     */
-    getSynchedL2BlockNumber(): Promise<number>;
-    getProvenL2BlockNumber(): Promise<number>;
-    setProvenL2BlockNumber(l2BlockNumber: number): Promise<void>;
-    setBlockSynchedL1BlockNumber(l1BlockNumber: bigint): Promise<void>;
-    setMessageSynchedL1BlockNumber(l1BlockNumber: bigint): Promise<void>;
-    getSynchPoint(): Promise<ArchiverL1SynchPoint>;
-    getContractFunctionName(_address: AztecAddress, selector: FunctionSelector): Promise<string | undefined>;
-    registerContractFunctionSignatures(_address: AztecAddress, signatures: string[]): Promise<void>;
-    estimateSize(): Promise<{
-        mappingSize: number;
-        actualSize: number;
-        numItems: number;
-    }>;
-}
-//# sourceMappingURL=memory_archiver_store.d.ts.map

package/dest/archiver/memory_archiver_store/memory_archiver_store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory_archiver_store.d.ts","sourceRoot":"","sources":["../../../src/archiver/memory_archiver_store/memory_archiver_store.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAA4B,MAAM,qBAAqB,CAAC;AAC3F,OAAO,KAAK,EACV,mBAAmB,EAEnB,iCAAiC,EACjC,2BAA2B,EAC3B,4CAA4C,EAC5C,wCAAwC,EACzC,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,4BAA4B,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAC3G,OAAO,EAIL,KAAK,SAAS,EAEd,KAAK,UAAU,EAEf,aAAa,EACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,KAAK,WAAW,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAEjF,OAAO,KAAK,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AACpF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAClE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAK3D;;GAEG;AACH,qBAAa,mBAAoB,YAAW,iBAAiB;;IAoDzD,6EAA6E;aAC7D,OAAO,EAAE,MAAM;IApDjC;;OAEG;IACH,OAAO,CAAC,QAAQ,CAA8B;IAE9C;;OAEG;IACH,OAAO,CAAC,SAAS,CAA2B;IAE5C,OAAO,CAAC,UAAU,CAA2C;IAE7D,OAAO,CAAC,eAAe,CAAgC;IAEvD,OAAO,CAAC,mBAAmB,CAAwC;IAEnE,OAAO,CAAC,kBAAkB,CAAuC;IAEjE,OAAO,CAAC,yBAAyB,CAA8C;IAE/E,OAAO,CAAC,qBAAqB,CAAqF;IAElH;;OAEG;IACH,OAAO,CAAC,cAAc,CAA4B;IAElD,OAAO,CAAC,eAAe,CAA8D;IAErF,OAAO,CAAC,mBAAmB,CAA8B;IAEzD,OAAO,CAAC,gBAAgB,CAA0E;IAElG,OAAO,CAAC,sBAAsB,CAAsE;IAEpG,OAAO,CAAC,iBAAiB,CAAuD;IAEhF,OAAO,CAAC,uBAAuB,CAA0D;IAEzF,OAAO,CAAC,oBAAoB,CAAiC;IAE7D,OAAO,CAAC,sBAAsB,CAAiC;IAE/D,OAAO,CAAC,uBAAuB,CAAa;IAC5C,OAAO,CAAC,uBAAuB,CAAa;IAE5C,OAAO,CAAC,aAAa,CAA6B;;IAKhD,6EAA6E;IAC7D,OAAO,EAAE,MAAM;IAG1B,gBAAgB,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC;IAWlE,mBAAmB,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;IAIpC,mBAAmB,CAAC,OAAO,EAAE,YAAY,GAAG,OAAO,CAAC,2BAA2B,GAAG,SAAS,CAAC;IAoB5F,qBAAqB,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS,CAAC;IAInE,YAAY,CACjB,eAAe,EAAE,EAAE,EACnB,mBAAmB,EAAE,4CAA4C,EAAE,EACnE,yBAAyB,EAAE,wCAAwC,EAAE,GACpE,OAAO,CAAC,OAAO,CAAC;IAkBZ,kBAAkB,CACvB,IAAI,EAAE,mBAAmB,EAAE,EAC3B,mBAAmB,EAAE,EAAE,EAAE,EACzB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,OAAO,CAAC;IAgBZ,qBAAqB,CAAC,IAAI,EAAE,mBAAmB,EAAE,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAWzF,oBAAoB,CAAC,IAAI,EAAE,2BAA2B,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAOjG,uBAAuB,CAAC,IAAI,EAAE,2BAA2B,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAOpG,0BAA0B,CAAC,IAAI,EAAE,iCAAiC,EAAE,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAc5G,6BAA6B,CAClC,IAAI,EAAE,iCAAiC,EAAE,EACzC,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,OAAO,CAAC;IAUnB;;;;OAIG;IACU,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAgBxE;;;;;;OAMG;IACU,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAiFjF;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAc5C,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAkBzC,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAsBxD,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC;IAWrD,8BAA8B,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;IAe/G,0BAA0B,IAAI,OAAO,CAAC,MAAM,CAAC;IAI7C;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,aAAa,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IAe9E;;;;OAIG;IACH,qBAAqB,CAAC,aAAa,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAIrE;;;;;;OAMG;IACI,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;IAkBjE,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAKjF;;;;OAIG;IACI,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;IAK1E;;;;OAIG;IACU,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;IAkBhF;;;;OAIG;IACH,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC;IAIrD;;;;;OAKG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAwBlE;;;;;OAKG;IACH,aAAa,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;IAKrD;;;;;OAKG;IACH,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC,qBAAqB,CAAC;IA6EhE;;;;;;OAMG;IACH,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC,4BAA4B,CAAC;IA+E9E,kBAAkB,IAAI,MAAM;IAO5B;;;OAGG;IACI,uBAAuB,IAAI,OAAO,CAAC,MAAM,CAAC;IAI1C,sBAAsB,IAAI,OAAO,CAAC,MAAM,CAAC;IAIzC,sBAAsB,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKnE,4BAA4B,CAAC,aAAa,EAAE,MAAM;IAKlD,8BAA8B,CAAC,aAAa,EAAE,MAAM;IAK7C,aAAa,IAAI,OAAO,CAAC,oBAAoB,CAAC;IAO9C,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,gBAAgB,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAIlG,kCAAkC,CAAC,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAWrG,YAAY,IAAI,OAAO,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAG9F"}