@aztec/stdlib 0.0.0-test.0

package/dest/interfaces/merkle_tree_operations.d.ts

@@ -0,0 +1,226 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import type { Fr } from '@aztec/foundation/fields';
+import { type IndexedTreeLeafPreimage, SiblingPath } from '@aztec/foundation/trees';
+import type { MerkleTreeId } from '../trees/merkle_tree_id.js';
+import type { NullifierLeaf } from '../trees/nullifier_leaf.js';
+import type { PublicDataTreeLeaf } from '../trees/public_data_leaf.js';
+import type { BlockHeader } from '../tx/block_header.js';
+import type { StateReference } from '../tx/state_reference.js';
+/**
+ * Type alias for the nullifier tree ID.
+ */
+export type IndexedTreeId = MerkleTreeId.NULLIFIER_TREE | MerkleTreeId.PUBLIC_DATA_TREE;
+export type FrTreeId = Exclude<MerkleTreeId, IndexedTreeId>;
+/**
+ * Witness data for a leaf update.
+ */
+export interface LeafUpdateWitnessData<N extends number> {
+    /**
+     * Preimage of the leaf before updating.
+     */
+    leafPreimage: IndexedTreeLeafPreimage;
+    /**
+     * Sibling path to prove membership of the leaf.
+     */
+    siblingPath: SiblingPath<N>;
+    /**
+     * The index of the leaf.
+     */
+    index: bigint;
+}
+/**
+ * The result of a batch insertion in an indexed merkle tree.
+ */
+export interface BatchInsertionResult<TreeHeight extends number, SubtreeSiblingPathHeight extends number> {
+    /**
+     * Data for the leaves to be updated when inserting the new ones.
+     */
+    lowLeavesWitnessData?: LeafUpdateWitnessData<TreeHeight>[];
+    /**
+     * Sibling path "pointing to" where the new subtree should be inserted into the tree.
+     */
+    newSubtreeSiblingPath: SiblingPath<SubtreeSiblingPathHeight>;
+    /**
+     * The new leaves being inserted in high to low order. This order corresponds with the order of the low leaves witness.
+     */
+    sortedNewLeaves: Buffer[];
+    /**
+     * The indexes of the sorted new leaves to the original ones.
+     */
+    sortedNewLeavesIndexes: number[];
+}
+/**
+ * The result of a sequential insertion in an indexed merkle tree.
+ */
+export interface SequentialInsertionResult<TreeHeight extends number> {
+    /**
+     * Data for the leaves to be updated when inserting the new ones.
+     */
+    lowLeavesWitnessData: LeafUpdateWitnessData<TreeHeight>[];
+    /**
+     * Data for the inserted leaves
+     */
+    insertionWitnessData: LeafUpdateWitnessData<TreeHeight>[];
+}
+/**
+ *  Defines tree information.
+ */
+export interface TreeInfo {
+    /**
+     * The tree ID.
+     */
+    treeId: MerkleTreeId;
+    /**
+     * The tree root.
+     */
+    root: Buffer;
+    /**
+     * The number of leaves in the tree.
+     */
+    size: bigint;
+    /**
+     * The depth of the tree.
+     */
+    depth: number;
+}
+type LeafTypes = {
+    [MerkleTreeId.NULLIFIER_TREE]: Buffer;
+    [MerkleTreeId.NOTE_HASH_TREE]: Fr;
+    [MerkleTreeId.PUBLIC_DATA_TREE]: Buffer;
+    [MerkleTreeId.L1_TO_L2_MESSAGE_TREE]: Fr;
+    [MerkleTreeId.ARCHIVE]: Fr;
+};
+type LeafValueTypes = {
+    [MerkleTreeId.NULLIFIER_TREE]: NullifierLeaf;
+    [MerkleTreeId.NOTE_HASH_TREE]: Fr;
+    [MerkleTreeId.PUBLIC_DATA_TREE]: PublicDataTreeLeaf;
+    [MerkleTreeId.L1_TO_L2_MESSAGE_TREE]: Fr;
+    [MerkleTreeId.ARCHIVE]: Fr;
+};
+export type MerkleTreeLeafType<ID extends MerkleTreeId> = LeafTypes[ID];
+export type MerkleTreeLeafValue<ID extends MerkleTreeId> = LeafValueTypes[ID];
+/**
+ * Defines the interface for operations on a set of Merkle Trees.
+ */
+export interface MerkleTreeReadOperations {
+    /**
+     * Returns information about the given tree.
+     * @param treeId - The tree to be queried.
+     */
+    getTreeInfo(treeId: MerkleTreeId): Promise<TreeInfo>;
+    /**
+     * Gets the current state reference.
+     */
+    getStateReference(): Promise<StateReference>;
+    /**
+     * Gets the initial header.
+     */
+    getInitialHeader(): BlockHeader;
+    /**
+     * Gets sibling path for a leaf.
+     * @param treeId - The tree to be queried for a sibling path.
+     * @param index - The index of the leaf for which a sibling path should be returned.
+     */
+    getSiblingPath<N extends number>(treeId: MerkleTreeId, index: bigint): Promise<SiblingPath<N>>;
+    /**
+     * Returns the previous index for a given value in an indexed tree.
+     * @param treeId - The tree for which the previous value index is required.
+     * @param value - The value to be queried.
+     */
+    getPreviousValueIndex<ID extends IndexedTreeId>(treeId: ID, value: bigint): Promise<{
+        /**
+         * The index of the found leaf.
+         */
+        index: bigint;
+        /**
+         * A flag indicating if the corresponding leaf's value is equal to `newValue`.
+         */
+        alreadyPresent: boolean;
+    } | undefined>;
+    /**
+     * Returns the data at a specific leaf.
+     * @param treeId - The tree for which leaf data should be returned.
+     * @param index - The index of the leaf required.
+     */
+    getLeafPreimage<ID extends IndexedTreeId>(treeId: ID, index: bigint): Promise<IndexedTreeLeafPreimage | undefined>;
+    /**
+     * Returns the index containing a leaf value.
+     * @param treeId - The tree for which the index should be returned.
+     * @param value - The value to search for in the tree.
+     */
+    findLeafIndices<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[]): Promise<(bigint | undefined)[]>;
+    /**
+     * Returns the first index containing a leaf value after `startIndex`.
+     * @param treeId - The tree for which the index should be returned.
+     * @param value - The value to search for in the tree.
+     * @param startIndex - The index to start searching from (used when skipping nullified messages)
+     */
+    findLeafIndicesAfter<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[], startIndex: bigint): Promise<(bigint | undefined)[]>;
+    /**
+     * Gets the value for a leaf in the tree.
+     * @param treeId - The tree for which the index should be returned.
+     * @param index - The index of the leaf.
+     */
+    getLeafValue<ID extends MerkleTreeId>(treeId: ID, index: bigint): Promise<MerkleTreeLeafType<typeof treeId> | undefined>;
+    /**
+     * Get the block numbers for a set of leaf indices
+     * @param treeId - The tree for which the block numbers should be returned.
+     * @param leafIndices - The indices to be queried.
+     */
+    getBlockNumbersForLeafIndices<ID extends MerkleTreeId>(treeId: ID, leafIndices: bigint[]): Promise<(bigint | undefined)[]>;
+}
+export interface MerkleTreeCheckpointOperations {
+    /**
+     * Checkpoints the current fork state
+     */
+    createCheckpoint(): Promise<void>;
+    /**
+     * Commits the current checkpoint
+     */
+    commitCheckpoint(): Promise<void>;
+    /**
+     * Reverts the current checkpoint
+     */
+    revertCheckpoint(): Promise<void>;
+}
+export interface MerkleTreeWriteOperations extends MerkleTreeReadOperations, MerkleTreeCheckpointOperations {
+    /**
+     * Appends leaves to a given tree.
+     * @param treeId - The tree to be updated.
+     * @param leaves - The set of leaves to be appended.
+     */
+    appendLeaves<ID extends MerkleTreeId>(treeId: ID, leaves: MerkleTreeLeafType<ID>[]): Promise<void>;
+    /**
+     * Inserts the block hash into the archive.
+     * This includes all of the current roots of all of the data trees and the current blocks global vars.
+     * @param header - The header to insert into the archive.
+     */
+    updateArchive(header: BlockHeader): Promise<void>;
+    /**
+     * Batch insert multiple leaves into the tree.
+     * @param leaves - Leaves to insert into the tree.
+     * @param treeId - The tree on which to insert.
+     * @param subtreeHeight - Height of the subtree.
+     * @returns The witness data for the leaves to be updated when inserting the new ones.
+     */
+    batchInsert<TreeHeight extends number, SubtreeSiblingPathHeight extends number, ID extends IndexedTreeId>(treeId: ID, leaves: Buffer[], subtreeHeight: number): Promise<BatchInsertionResult<TreeHeight, SubtreeSiblingPathHeight>>;
+    /**
+     * Inserts multiple leaves into the tree, getting witnesses at every step.
+     * Note: This method doesn't support inserting empty leaves.
+     * @param treeId - The tree on which to insert.
+     * @param leaves - The leaves to insert.
+     * @returns The witnesses for the low leaf updates and the insertions.
+     */
+    sequentialInsert<TreeHeight extends number, ID extends IndexedTreeId>(treeId: ID, leaves: Buffer[]): Promise<SequentialInsertionResult<TreeHeight>>;
+    /**
+     * Closes the database, discarding any uncommitted changes.
+     */
+    close(): Promise<void>;
+}
+/**
+ * Outputs a tree leaves using for debugging purposes.
+ */
+export declare function inspectTree(db: MerkleTreeReadOperations, treeId: MerkleTreeId, log?: import("@aztec/foundation/log").Logger): Promise<void>;
+export {};
+//# sourceMappingURL=merkle_tree_operations.d.ts.map

package/dest/interfaces/merkle_tree_operations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merkle_tree_operations.d.ts","sourceRoot":"","sources":["../../src/interfaces/merkle_tree_operations.ts"],"names":[],"mappings":";;AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAEnD,OAAO,EAAE,KAAK,uBAAuB,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEpF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AACvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE/D;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,YAAY,CAAC,cAAc,GAAG,YAAY,CAAC,gBAAgB,CAAC;AAExF,MAAM,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;AAE5D;;GAEG;AACH,MAAM,WAAW,qBAAqB,CAAC,CAAC,SAAS,MAAM;IACrD;;OAEG;IACH,YAAY,EAAE,uBAAuB,CAAC;IACtC;;OAEG;IACH,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5B;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB,CAAC,UAAU,SAAS,MAAM,EAAE,wBAAwB,SAAS,MAAM;IACtG;;OAEG;IACH,oBAAoB,CAAC,EAAE,qBAAqB,CAAC,UAAU,CAAC,EAAE,CAAC;IAC3D;;OAEG;IACH,qBAAqB,EAAE,WAAW,CAAC,wBAAwB,CAAC,CAAC;IAC7D;;OAEG;IACH,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B;;OAEG;IACH,sBAAsB,EAAE,MAAM,EAAE,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB,CAAC,UAAU,SAAS,MAAM;IAClE;;OAEG;IACH,oBAAoB,EAAE,qBAAqB,CAAC,UAAU,CAAC,EAAE,CAAC;IAC1D;;OAEG;IACH,oBAAoB,EAAE,qBAAqB,CAAC,UAAU,CAAC,EAAE,CAAC;CAC3D;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB;;OAEG;IACH,MAAM,EAAE,YAAY,CAAC;IACrB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED,KAAK,SAAS,GAAG;IACf,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACtC,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;IAClC,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACxC,CAAC,YAAY,CAAC,qBAAqB,CAAC,EAAE,EAAE,CAAC;IACzC,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;CAC5B,CAAC;AAEF,KAAK,cAAc,GAAG;IACpB,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,aAAa,CAAC;IAC7C,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC;IAClC,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,kBAAkB,CAAC;IACpD,CAAC,YAAY,CAAC,qBAAqB,CAAC,EAAE,EAAE,CAAC;IACzC,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;CAC5B,CAAC;AAEF,MAAM,MAAM,kBAAkB,CAAC,EAAE,SAAS,YAAY,IAAI,SAAS,CAAC,EAAE,CAAC,CAAC;AAExE,MAAM,MAAM,mBAAmB,CAAC,EAAE,SAAS,YAAY,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC;AAE9E;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC;;;OAGG;IACH,WAAW,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAErD;;OAEG;IACH,iBAAiB,IAAI,OAAO,CAAC,cAAc,CAAC,CAAC;IAE7C;;OAEG;IACH,gBAAgB,IAAI,WAAW,CAAC;IAEhC;;;;OAIG;IACH,cAAc,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/F;;;;OAIG;IACH,qBAAqB,CAAC,EAAE,SAAS,aAAa,EAC5C,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CACN;QACE;;WAEG;QACH,KAAK,EAAE,MAAM,CAAC;QACd;;WAEG;QACH,cAAc,EAAE,OAAO,CAAC;KACzB,GACD,SAAS,CACZ,CAAC;IAEF;;;;OAIG;IACH,eAAe,CAAC,EAAE,SAAS,aAAa,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,uBAAuB,GAAG,SAAS,CAAC,CAAC;IAEnH;;;;OAIG;IACH,eAAe,CAAC,EAAE,SAAS,YAAY,EACrC,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAC/B,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAEnC;;;;;OAKG;IACH,oBAAoB,CAAC,EAAE,SAAS,YAAY,EAC1C,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,EAChC,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAEnC;;;;OAIG;IACH,YAAY,CAAC,EAAE,SAAS,YAAY,EAClC,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,CAAC,OAAO,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC;IAE1D;;;;OAIG;IACH,6BAA6B,CAAC,EAAE,SAAS,YAAY,EACnD,MAAM,EAAE,EAAE,EACV,WAAW,EAAE,MAAM,EAAE,GACpB,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,8BAA8B;IAC7C;;OAEG;IACH,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAElC;;OAEG;IACH,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAElC;;OAEG;IACH,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACnC;AAED,MAAM,WAAW,yBAA0B,SAAQ,wBAAwB,EAAE,8BAA8B;IACzG;;;;OAIG;IACH,YAAY,CAAC,EAAE,SAAS,YAAY,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnG;;;;OAIG;IACH,aAAa,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAElD;;;;;;OAMG;IACH,WAAW,CAAC,UAAU,SAAS,MAAM,EAAE,wBAAwB,SAAS,MAAM,EAAE,EAAE,SAAS,aAAa,EACtG,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,MAAM,EAAE,EAChB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAAC,CAAC;IAEvE;;;;;;OAMG;IACH,gBAAgB,CAAC,UAAU,SAAS,MAAM,EAAE,EAAE,SAAS,aAAa,EAClE,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,MAAM,EAAE,GACf,OAAO,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAC,CAAC;IAElD;;OAEG;IACH,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACxB;AAED;;GAEG;AACH,wBAAsB,WAAW,CAC/B,EAAE,EAAE,wBAAwB,EAC5B,MAAM,EAAE,YAAY,EACpB,GAAG,yCAAqC,iBAUzC"}

package/dest/interfaces/merkle_tree_operations.js

@@ -0,0 +1,13 @@
+import { createLogger } from '@aztec/foundation/log';
+/**
+ * Outputs a tree leaves using for debugging purposes.
+ */ export async function inspectTree(db, treeId, log = createLogger('types:inspect-tree')) {
+    const info = await db.getTreeInfo(treeId);
+    const output = [
+        `Tree id=${treeId} size=${info.size} root=0x${info.root.toString('hex')}`
+    ];
+    for(let i = 0; i < info.size; i++){
+        output.push(` Leaf ${i}: ${await db.getLeafValue(treeId, BigInt(i)).then((x)=>x?.toString('hex') ?? '[undefined]')}`);
+    }
+    log.info(output.join('\n'));
+}

package/dest/interfaces/p2p-bootstrap.d.ts

@@ -0,0 +1,14 @@
+import type { ApiSchemaFor } from '../schemas/index.js';
+/** Exposed API to the P2P bootstrap node. */
+export interface P2PBootstrapApi {
+    /**
+     * Returns the ENR for this node.
+     */
+    getEncodedEnr(): Promise<string>;
+    /**
+     * Returns ENRs for all nodes in the routing table.
+     */
+    getRoutingTable(): Promise<string[]>;
+}
+export declare const P2PBootstrapApiSchema: ApiSchemaFor<P2PBootstrapApi>;
+//# sourceMappingURL=p2p-bootstrap.d.ts.map

package/dest/interfaces/p2p-bootstrap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"p2p-bootstrap.d.ts","sourceRoot":"","sources":["../../src/interfaces/p2p-bootstrap.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAExD,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B;;OAEG;IACH,aAAa,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAEjC;;OAEG;IACH,eAAe,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CACtC;AAED,eAAO,MAAM,qBAAqB,EAAE,YAAY,CAAC,eAAe,CAG/D,CAAC"}

package/dest/interfaces/p2p-bootstrap.js

@@ -0,0 +1,5 @@
+import { z } from 'zod';
+export const P2PBootstrapApiSchema = {
+    getEncodedEnr: z.function().returns(z.string()),
+    getRoutingTable: z.function().returns(z.array(z.string()))
+};

package/dest/interfaces/p2p.d.ts

@@ -0,0 +1,49 @@
+import { BlockAttestation } from '../p2p/block_attestation.js';
+import type { P2PClientType } from '../p2p/client_type.js';
+import { type ApiSchemaFor } from '../schemas/index.js';
+import { Tx } from '../tx/tx.js';
+export type PeerInfo = {
+    status: 'connected';
+    score: number;
+    id: string;
+} | {
+    status: 'dialing';
+    dialStatus: string;
+    id: string;
+    addresses: string[];
+} | {
+    status: 'cached';
+    id: string;
+    addresses: string[];
+    enr: string;
+    dialAttempts: number;
+};
+/** Exposed API to the P2P module. */
+export interface P2PApiWithoutAttestations {
+    /**
+     * Returns all pending transactions in the transaction pool.
+     * @returns An array of Txs.
+     */
+    getPendingTxs(): Promise<Tx[]>;
+    /**
+     * Returns the ENR for this node, if any.
+     */
+    getEncodedEnr(): Promise<string | undefined>;
+    /**
+     * Returns info for all connected, dialing, and cached peers.
+     */
+    getPeers(includePending?: boolean): Promise<PeerInfo[]>;
+}
+export interface P2PClient extends P2PApiWithoutAttestations {
+    /**
+     * Queries the Attestation pool for attestations for the given slot
+     *
+     * @param slot - the slot to query
+     * @param proposalId - the proposal id to query, or undefined to query all proposals for the slot
+     * @returns BlockAttestations
+     */
+    getAttestationsForSlot(slot: bigint, proposalId?: string): Promise<BlockAttestation[]>;
+}
+export type P2PApi<T extends P2PClientType = P2PClientType.Full> = T extends P2PClientType.Full ? P2PClient & P2PApiWithoutAttestations : P2PApiWithoutAttestations;
+export declare const P2PApiSchema: ApiSchemaFor<P2PApi>;
+//# sourceMappingURL=p2p.d.ts.map

package/dest/interfaces/p2p.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"p2p.d.ts","sourceRoot":"","sources":["../../src/interfaces/p2p.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,KAAK,YAAY,EAAqB,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,EAAE,EAAE,MAAM,aAAa,CAAC;AAEjC,MAAM,MAAM,QAAQ,GAChB;IAAE,MAAM,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAClD;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,GAC1E;IAAE,MAAM,EAAE,QAAQ,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAAC;AAc7F,qCAAqC;AACrC,MAAM,WAAW,yBAAyB;IACxC;;;OAGG;IACH,aAAa,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;IAE/B;;OAEG;IACH,aAAa,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IAE7C;;OAEG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;CACzD;AAED,MAAM,WAAW,SAAU,SAAQ,yBAAyB;IAC1D;;;;;;OAMG;IACH,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;CACxF;AAED,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,aAAa,GAAG,aAAa,CAAC,IAAI,IAAI,CAAC,SAAS,aAAa,CAAC,IAAI,GAC3F,SAAS,GAAG,yBAAyB,GACrC,yBAAyB,CAAC;AAE9B,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,MAAM,CAQ7C,CAAC"}

package/dest/interfaces/p2p.js

@@ -0,0 +1,30 @@
+import { z } from 'zod';
+import { BlockAttestation } from '../p2p/block_attestation.js';
+import { optional, schemas } from '../schemas/index.js';
+import { Tx } from '../tx/tx.js';
+const PeerInfoSchema = z.discriminatedUnion('status', [
+    z.object({
+        status: z.literal('connected'),
+        score: z.number(),
+        id: z.string()
+    }),
+    z.object({
+        status: z.literal('dialing'),
+        dialStatus: z.string(),
+        id: z.string(),
+        addresses: z.array(z.string())
+    }),
+    z.object({
+        status: z.literal('cached'),
+        id: z.string(),
+        addresses: z.array(z.string()),
+        enr: z.string(),
+        dialAttempts: z.number()
+    })
+]);
+export const P2PApiSchema = {
+    getAttestationsForSlot: z.function().args(schemas.BigInt, optional(z.string())).returns(z.array(BlockAttestation.schema)),
+    getPendingTxs: z.function().returns(z.array(Tx.schema)),
+    getEncodedEnr: z.function().returns(z.string().optional()),
+    getPeers: z.function().args(optional(z.boolean())).returns(z.array(PeerInfoSchema))
+};

package/dest/interfaces/private_kernel_prover.d.ts

@@ -0,0 +1,81 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import type { WitnessMap } from '@noir-lang/acvm_js';
+import type { PrivateKernelCircuitPublicInputs, PrivateKernelInitCircuitPrivateInputs, PrivateKernelInnerCircuitPrivateInputs, PrivateKernelResetCircuitPrivateInputs, PrivateKernelSimulateOutput, PrivateKernelTailCircuitPrivateInputs, PrivateKernelTailCircuitPublicInputs } from '../kernel/index.js';
+import type { ClientIvcProof } from '../proofs/client_ivc_proof.js';
+/**
+ * PrivateKernelProver provides functionality to simulate and validate circuits, and retrieve
+ * siloed commitments necessary for maintaining transaction privacy and security on the network.
+ */
+export interface PrivateKernelProver {
+    /**
+     * Creates a proof output for a given signed transaction request and private call data for the first iteration.
+     *
+     * @param privateKernelInputsInit - The private data structure for the initial iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and the kernel proof.
+     */
+    generateInitOutput(privateKernelInputsInit: PrivateKernelInitCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Executes the first kernel iteration without generating a proof.
+     *
+     * @param privateKernelInputsInit - The private data structure for the initial iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and an empty kernel proof.
+     */
+    simulateInit(privateKernelInputsInit: PrivateKernelInitCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Creates a proof output for a given previous kernel data and private call data for an inner iteration.
+     *
+     * @param privateKernelInputsInner - The private input data structure for the inner iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and the kernel proof.
+     */
+    generateInnerOutput(privateKernelInputsInner: PrivateKernelInnerCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Executes an inner kernel iteration without generating a proof.
+     *
+     * @param privateKernelInputsInit - The private data structure for the initial iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and an empty kernel proof.
+     */
+    simulateInner(privateKernelInputsInner: PrivateKernelInnerCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Creates a proof output by resetting the arrays using the reset circuit.
+     *
+     * @param privateKernelInputsTail - The private input data structure for the reset circuit.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and the kernel proof.
+     */
+    generateResetOutput(privateKernelInputsReset: PrivateKernelResetCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Executes the reset circuit without generating a proof
+     *
+     * @param privateKernelInputsTail - The private input data structure for the reset circuit.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs an empty kernel proof.
+     */
+    simulateReset(privateKernelInputsReset: PrivateKernelResetCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>>;
+    /**
+     * Creates a proof output based on the last inner kernel iteration kernel data for the final ordering iteration.
+     *
+     * @param privateKernelInputsTail - The private input data structure for the final ordering iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs and the kernel proof.
+     */
+    generateTailOutput(privateKernelInputsTail: PrivateKernelTailCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelTailCircuitPublicInputs>>;
+    /**
+     * Executes the final ordering iteration circuit.
+     *
+     * @param privateKernelInputsTail - The private input data structure for the final ordering iteration.
+     * @returns A Promise resolving to a ProofOutput object containing public inputs an empty kernel proof.
+     */
+    simulateTail(privateKernelInputsTail: PrivateKernelTailCircuitPrivateInputs): Promise<PrivateKernelSimulateOutput<PrivateKernelTailCircuitPublicInputs>>;
+    /**
+     * Based of a program stack, create a folding proof.
+     * @param acirs The program bytecode.
+     * @param witnessStack The witnessses for each program bytecode.
+     */
+    createClientIvcProof(acirs: Buffer[], witnessStack: WitnessMap[]): Promise<ClientIvcProof>;
+    /**
+     * Compute the gate count for a given circuit.
+     * @param bytecode - The circuit bytecode in gzipped bincode format
+     * @param circuitName - The name of the circuit
+     * @returns A Promise resolving to the gate count
+     */
+    computeGateCountForCircuit(bytecode: Buffer, circuitName: string): Promise<number>;
+}
+//# sourceMappingURL=private_kernel_prover.d.ts.map

package/dest/interfaces/private_kernel_prover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"private_kernel_prover.d.ts","sourceRoot":"","sources":["../../src/interfaces/private_kernel_prover.ts"],"names":[],"mappings":";;AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD,OAAO,KAAK,EACV,gCAAgC,EAChC,qCAAqC,EACrC,sCAAsC,EACtC,sCAAsC,EACtC,2BAA2B,EAC3B,qCAAqC,EACrC,oCAAoC,EACrC,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAEpE;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC;;;;;OAKG;IACH,kBAAkB,CAChB,uBAAuB,EAAE,qCAAqC,GAC7D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,YAAY,CACV,uBAAuB,EAAE,qCAAqC,GAC7D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,mBAAmB,CACjB,wBAAwB,EAAE,sCAAsC,GAC/D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,aAAa,CACX,wBAAwB,EAAE,sCAAsC,GAC/D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,mBAAmB,CACjB,wBAAwB,EAAE,sCAAsC,GAC/D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,aAAa,CACX,wBAAwB,EAAE,sCAAsC,GAC/D,OAAO,CAAC,2BAA2B,CAAC,gCAAgC,CAAC,CAAC,CAAC;IAE1E;;;;;OAKG;IACH,kBAAkB,CAChB,uBAAuB,EAAE,qCAAqC,GAC7D,OAAO,CAAC,2BAA2B,CAAC,oCAAoC,CAAC,CAAC,CAAC;IAE9E;;;;;OAKG;IACH,YAAY,CACV,uBAAuB,EAAE,qCAAqC,GAC7D,OAAO,CAAC,2BAA2B,CAAC,oCAAoC,CAAC,CAAC,CAAC;IAE9E;;;;OAIG;IACH,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IAE3F;;;;;OAKG;IACH,0BAA0B,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACpF"}

package/dest/interfaces/private_kernel_prover.js

@@ -0,0 +1,4 @@
+/**
+ * PrivateKernelProver provides functionality to simulate and validate circuits, and retrieve
+ * siloed commitments necessary for maintaining transaction privacy and security on the network.
+ */ export { };

package/dest/interfaces/processed-tx-handler.d.ts

@@ -0,0 +1,10 @@
+import type { ProcessedTx } from '../tx/processed_tx.js';
+/** Receives processed txs as part of block simulation or proving. */
+export interface ProcessedTxHandler {
+    /**
+     * Handles processed txs.
+     * @param txs - The transactions to be handled.
+     */
+    addTxs(txs: ProcessedTx[]): Promise<void>;
+}
+//# sourceMappingURL=processed-tx-handler.d.ts.map

package/dest/interfaces/processed-tx-handler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"processed-tx-handler.d.ts","sourceRoot":"","sources":["../../src/interfaces/processed-tx-handler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD,qEAAqE;AACrE,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC3C"}

package/dest/interfaces/processed-tx-handler.js

@@ -0,0 +1 @@
+/** Receives processed txs as part of block simulation or proving. */ export { };

package/dest/interfaces/prover-agent.d.ts

@@ -0,0 +1,11 @@
+import type { ApiSchemaFor } from '../schemas/index.js';
+export interface ProverAgentApi {
+    setMaxConcurrency(maxConcurrency: number): Promise<void>;
+    isRunning(): Promise<boolean>;
+    getCurrentJobs(): Promise<{
+        id: string;
+        type: string;
+    }[]>;
+}
+export declare const ProverAgentApiSchema: ApiSchemaFor<ProverAgentApi>;
+//# sourceMappingURL=prover-agent.d.ts.map

package/dest/interfaces/prover-agent.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover-agent.d.ts","sourceRoot":"","sources":["../../src/interfaces/prover-agent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAExD,MAAM,WAAW,cAAc;IAC7B,iBAAiB,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEzD,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAE9B,cAAc,IAAI,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC,CAAC;CAC3D;AAED,eAAO,MAAM,oBAAoB,EAAE,YAAY,CAAC,cAAc,CAO7D,CAAC"}

package/dest/interfaces/prover-agent.js

@@ -0,0 +1,9 @@
+import { z } from 'zod';
+export const ProverAgentApiSchema = {
+    setMaxConcurrency: z.function().args(z.number().min(1).int()).returns(z.void()),
+    isRunning: z.function().args().returns(z.boolean()),
+    getCurrentJobs: z.function().args().returns(z.array(z.object({
+        id: z.string(),
+        type: z.string()
+    })))
+};

package/dest/interfaces/prover-broker.d.ts

@@ -0,0 +1,68 @@
+import type { ProvingRequestType } from '../proofs/proving_request_type.js';
+import type { ProofUri, ProvingJob, ProvingJobId, ProvingJobStatus } from './proving-job.js';
+/**
+ * An interface for the proving orchestrator. The producer uses this to enqueue jobs for agents
+ */
+export interface ProvingJobProducer {
+    /**
+     * Enqueues a proving job
+     * @param job - The job to enqueue
+     */
+    enqueueProvingJob(job: ProvingJob): Promise<ProvingJobStatus>;
+    /**
+     * Cancels a proving job.
+     * @param id - The ID of the job to cancel
+     */
+    cancelProvingJob(id: ProvingJobId): Promise<void>;
+    /**
+     * Returns the current status fof the proving job
+     * @param id - The ID of the job to get the status of
+     */
+    getProvingJobStatus(id: ProvingJobId): Promise<ProvingJobStatus>;
+    /**
+     * Returns the ids of jobs that have been completed since the last call
+     * Also returns the set of provided job ids that are completed
+     * @param ids - The set of job ids to check for completion
+     */
+    getCompletedJobs(ids: ProvingJobId[]): Promise<ProvingJobId[]>;
+}
+export type ProvingJobFilter = {
+    allowList: ProvingRequestType[];
+};
+export type GetProvingJobResponse = {
+    job: ProvingJob;
+    time: number;
+};
+/**
+ * An interface for proving agents to request jobs and report results
+ */
+export interface ProvingJobConsumer {
+    /**
+     * Gets a proving job to work on
+     * @param filter - Optional filter for the type of job to get
+     */
+    getProvingJob(filter?: ProvingJobFilter): Promise<GetProvingJobResponse | undefined>;
+    /**
+     * Marks a proving job as successful
+     * @param id - The ID of the job to report success for
+     * @param result - The result of the job
+     */
+    reportProvingJobSuccess(id: ProvingJobId, result: ProofUri, filter?: ProvingJobFilter): Promise<GetProvingJobResponse | undefined>;
+    /**
+     * Marks a proving job as errored
+     * @param id - The ID of the job to report an error for
+     * @param err - The error that occurred while processing the job
+     * @param retry - Whether to retry the job
+     */
+    reportProvingJobError(id: ProvingJobId, err: string, retry?: boolean, filter?: ProvingJobFilter): Promise<GetProvingJobResponse | undefined>;
+    /**
+     * Sends a heartbeat to the broker to indicate that the agent is still working on the given proving job
+     * @param id - The ID of the job to report progress for
+     * @param startedAt - The unix epoch when the job was started
+     * @param filter - Optional filter for the type of job to get
+     */
+    reportProvingJobProgress(id: ProvingJobId, startedAt: number, filter?: ProvingJobFilter): Promise<GetProvingJobResponse | undefined>;
+}
+export interface ProvingJobBroker extends ProvingJobProducer, ProvingJobConsumer {
+}
+//# sourceMappingURL=prover-broker.d.ts.map

package/dest/interfaces/prover-broker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover-broker.d.ts","sourceRoot":"","sources":["../../src/interfaces/prover-broker.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AAC5E,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAE7F;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,iBAAiB,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAE9D;;;OAGG;IACH,gBAAgB,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAElD;;;OAGG;IACH,mBAAmB,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAEjE;;;;OAIG;IACH,gBAAgB,CAAC,GAAG,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;CAChE;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B,SAAS,EAAE,kBAAkB,EAAE,CAAC;CACjC,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IAClC,GAAG,EAAE,UAAU,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,aAAa,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;IAErF;;;;OAIG;IACH,uBAAuB,CACrB,EAAE,EAAE,YAAY,EAChB,MAAM,EAAE,QAAQ,EAChB,MAAM,CAAC,EAAE,gBAAgB,GACxB,OAAO,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;IAE9C;;;;;OAKG;IACH,qBAAqB,CACnB,EAAE,EAAE,YAAY,EAChB,GAAG,EAAE,MAAM,EACX,KAAK,CAAC,EAAE,OAAO,EACf,MAAM,CAAC,EAAE,gBAAgB,GACxB,OAAO,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;IAE9C;;;;;OAKG;IACH,wBAAwB,CACtB,EAAE,EAAE,YAAY,EAChB,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,gBAAgB,GACxB,OAAO,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;CAC/C;AAED,MAAM,WAAW,gBAAiB,SAAQ,kBAAkB,EAAE,kBAAkB;CAAG"}

package/dest/interfaces/prover-broker.js

@@ -0,0 +1 @@
+export { };

package/dest/interfaces/prover-client.d.ts

@@ -0,0 +1,76 @@
+import { type ConfigMappingsType } from '@aztec/foundation/config';
+import { Fr } from '@aztec/foundation/fields';
+import { z } from 'zod';
+import { type ZodFor } from '../schemas/index.js';
+import type { TxHash } from '../tx/tx_hash.js';
+import type { EpochProver } from './epoch-prover.js';
+import type { ProvingJobConsumer } from './prover-broker.js';
+export type ActualProverConfig = {
+    /** Whether to construct real proofs */
+    realProofs: boolean;
+    /** The type of artificial delay to introduce */
+    proverTestDelayType: 'fixed' | 'realistic';
+    /** If using fixed delay, the time each operation takes. */
+    proverTestDelayMs: number;
+    /** If using realistic delays, what percentage of realistic times to apply. */
+    proverTestDelayFactor: number;
+};
+/**
+ * The prover configuration.
+ */
+export type ProverConfig = ActualProverConfig & {
+    /** The URL to the Aztec node to take proving jobs from */
+    nodeUrl?: string;
+    /** Identifier of the prover */
+    proverId: Fr;
+    /** Number of proving agents to start within the prover. */
+    proverAgentCount: number;
+    /** Store for failed proof inputs. */
+    failedProofStore?: string;
+};
+export declare const ProverConfigSchema: z.ZodObject<{
+    nodeUrl: z.ZodOptional<z.ZodString>;
+    realProofs: z.ZodBoolean;
+    proverId: ZodFor<Fr>;
+    proverTestDelayType: z.ZodEnum<["fixed", "realistic"]>;
+    proverTestDelayMs: z.ZodNumber;
+    proverTestDelayFactor: z.ZodNumber;
+    proverAgentCount: z.ZodNumber;
+}, "strip", z.ZodTypeAny, {
+    proverId: Fr;
+    realProofs: boolean;
+    proverTestDelayType: "fixed" | "realistic";
+    proverTestDelayMs: number;
+    proverTestDelayFactor: number;
+    proverAgentCount: number;
+    nodeUrl?: string | undefined;
+}, {
+    realProofs: boolean;
+    proverTestDelayType: "fixed" | "realistic";
+    proverTestDelayMs: number;
+    proverTestDelayFactor: number;
+    proverAgentCount: number;
+    proverId?: any;
+    nodeUrl?: string | undefined;
+}>;
+export declare const proverConfigMappings: ConfigMappingsType<ProverConfig>;
+/**
+ * The interface to the prover client.
+ * Provides the ability to generate proofs and build rollups.
+ */
+export interface EpochProverManager {
+    createEpochProver(): EpochProver;
+    start(): Promise<void>;
+    stop(): Promise<void>;
+    getProvingJobSource(): ProvingJobConsumer;
+    getProverId(): Fr;
+    updateProverConfig(config: Partial<ProverConfig>): Promise<void>;
+}
+export declare class BlockProofError extends Error {
+    #private;
+    readonly txHashes: TxHash[];
+    name: string;
+    constructor(message: string, txHashes: TxHash[]);
+    static isBlockProofError(err: any): err is BlockProofError;
+}
+//# sourceMappingURL=prover-client.d.ts.map