@aztec-labs/stdlib 6.0.0-nightly.20260829

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

@@ -0,0 +1 @@
+{"version":3,"file":"l1_publish_info.d.ts","sourceRoot":"","sources":["../../src/interfaces/l1_publish_info.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,eAAe,EAAE,MAAM,uCAAuC,CAAC;AAExE;;;;;;;GAOG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,SAAS,EAAE,KAAK,CAAA;CAAE,GACpB;IAAE,SAAS,EAAE,IAAI,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnF,eAAO,MAAM,mBAAmB;;;;;;;mBAQ9B,CAAC;AAEH,gHAAgH;AAChH,wBAAgB,gCAAgC,CAAC,IAAI,EAAE,eAAe,GAAG,SAAS,GAAG,aAAa,CAUjG"}

package/dest/interfaces/l1_publish_info.js

@@ -0,0 +1,26 @@
+import { schemas } from '@aztec-labs/foundation/schemas';
+import { z } from 'zod';
+export const L1PublishInfoSchema = z.union([
+    z.object({
+        published: z.literal(false)
+    }),
+    z.object({
+        published: z.literal(true),
+        blockNumber: schemas.BigInt,
+        timestamp: schemas.BigInt,
+        blockHash: z.string()
+    })
+]);
+/** Projects the internal {@link L1PublishedData} (or its absence) to the public {@link L1PublishInfo} shape. */ export function l1PublishInfoFromL1PublishedData(data) {
+    if (!data) {
+        return {
+            published: false
+        };
+    }
+    return {
+        published: true,
+        blockNumber: data.blockNumber,
+        timestamp: data.timestamp,
+        blockHash: data.blockHash
+    };
+}

package/dest/interfaces/l2_logs_source.d.ts

@@ -0,0 +1,29 @@
+import type { BlockNumber } from '@aztec-labs/foundation/branded-types';
+import type { LogResult } from '../logs/log_result.js';
+import type { PrivateLogsQuery, PublicLogsQuery } from '../logs/logs_query.js';
+/**
+ * Interface of classes allowing for the retrieval of logs.
+ *
+ * The return type is always the widest {@link LogResult} shape (noteHashes/nullifiers optional). To
+ * narrow at the call site after passing `includeEffects: true`, use the typed wrapper functions in
+ * `pxe/src/tagging/get_all_logs_by_tags.ts` (or cast — the wire payload is the widest shape, so a
+ * stricter generic on this interface would not survive the JSON-RPC boundary anyway).
+ */
+export interface L2LogsSource {
+    /**
+     * Gets private logs matching the given tags. Returns one inner array per element of `query.tags`, in
+     * input order. An empty inner array means no logs matched that tag.
+     */
+    getPrivateLogsByTags(query: PrivateLogsQuery): Promise<LogResult[][]>;
+    /**
+     * Gets public logs matching the given tags for the given contract. Returns one inner array per element
+     * of `query.tags`, in input order. An empty inner array means no logs matched that tag.
+     */
+    getPublicLogsByTags(query: PublicLogsQuery): Promise<LogResult[][]>;
+    /**
+     * Gets the number of the latest L2 block processed by the implementation.
+     * @returns The number of the latest L2 block processed by the implementation.
+     */
+    getBlockNumber(): Promise<BlockNumber>;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibDJfbG9nc19zb3VyY2UuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9pbnRlcmZhY2VzL2wyX2xvZ3Nfc291cmNlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLFdBQVcsRUFBRSxNQUFNLHNDQUFzQyxDQUFDO0FBRXhFLE9BQU8sS0FBSyxFQUFFLFNBQVMsRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBQ3ZELE9BQU8sS0FBSyxFQUFFLGdCQUFnQixFQUFFLGVBQWUsRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBRS9FOzs7Ozs7O0dBT0c7QUFDSCxNQUFNLFdBQVcsWUFBWTtJQUMzQjs7O09BR0c7SUFDSCxvQkFBb0IsQ0FBQyxLQUFLLEVBQUUsZ0JBQWdCLEdBQUcsT0FBTyxDQUFDLFNBQVMsRUFBRSxFQUFFLENBQUMsQ0FBQztJQUV0RTs7O09BR0c7SUFDSCxtQkFBbUIsQ0FBQyxLQUFLLEVBQUUsZUFBZSxHQUFHLE9BQU8sQ0FBQyxTQUFTLEVBQUUsRUFBRSxDQUFDLENBQUM7SUFFcEU7OztPQUdHO0lBQ0gsY0FBYyxJQUFJLE9BQU8sQ0FBQyxXQUFXLENBQUMsQ0FBQztDQUN4QyJ9

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

@@ -0,0 +1 @@
+{"version":3,"file":"l2_logs_source.d.ts","sourceRoot":"","sources":["../../src/interfaces/l2_logs_source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sCAAsC,CAAC;AAExE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAE/E;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAEtE;;;OAGG;IACH,mBAAmB,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAEpE;;;OAGG;IACH,cAAc,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC;CACxC"}

package/dest/interfaces/l2_logs_source.js

@@ -0,0 +1,8 @@
+/**
+ * Interface of classes allowing for the retrieval of logs.
+ *
+ * The return type is always the widest {@link LogResult} shape (noteHashes/nullifiers optional). To
+ * narrow at the call site after passing `includeEffects: true`, use the typed wrapper functions in
+ * `pxe/src/tagging/get_all_logs_by_tags.ts` (or cast — the wire payload is the widest shape, so a
+ * stricter generic on this interface would not survive the JSON-RPC boundary anyway).
+ */ export { };

package/dest/interfaces/merkle_tree_operations.d.ts

@@ -0,0 +1,239 @@
+import type { BlockNumber } from '@aztec-labs/foundation/branded-types';
+import type { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { type IndexedTreeLeafPreimage, SiblingPath } from '@aztec-labs/foundation/trees';
+import type { BlockHash } from '../block/block_hash.js';
+import type { MerkleTreeId, TreeHeights } 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';
+import type { WorldStateRevision } from '../world-state/world_state_revision.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]: BlockHash;
+};
+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]: BlockHash;
+};
+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 the current revision.
+     */
+    getRevision(): WorldStateRevision;
+    /**
+     * Returns the IPC path of the underlying aztec-wsdb process. External AVM simulators use this to
+     * connect to the same world state instance that the TS layer is using.
+     */
+    getIpcPath(): string;
+    /**
+     * 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<ID extends MerkleTreeId>(treeId: ID, index: bigint): Promise<SiblingPath<TreeHeights[ID]>>;
+    /**
+     * 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 sibling paths for the given leaf values
+     * @param treeId - The tree for which the index should be returned.
+     * @param values - The values to search for in the tree.
+     */
+    findSiblingPaths<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[]): Promise<({
+        path: SiblingPath<TreeHeights[ID]>;
+        index: 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<(BlockNumber | undefined)[]>;
+}
+export interface MerkleTreeCheckpointOperations {
+    /** Checkpoints the current fork state. Returns the depth of the new checkpoint. */
+    createCheckpoint(): Promise<number>;
+    /** Commits the current checkpoint. */
+    commitCheckpoint(): Promise<void>;
+    /** Reverts the current checkpoint. */
+    revertCheckpoint(): Promise<void>;
+    /** Commits all checkpoints above the given depth, leaving checkpoint depth at the given value. */
+    commitAllCheckpointsTo(depth: number): Promise<void>;
+    /** Reverts all checkpoints above the given depth, leaving checkpoint depth at the given value. */
+    revertAllCheckpointsTo(depth: number): Promise<void>;
+}
+export interface MerkleTreeWriteOperations extends MerkleTreeReadOperations, MerkleTreeCheckpointOperations, AsyncDisposable {
+    /**
+     * 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-labs/foundation/log").Logger): Promise<void>;
+export {};
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibWVya2xlX3RyZWVfb3BlcmF0aW9ucy5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2ludGVyZmFjZXMvbWVya2xlX3RyZWVfb3BlcmF0aW9ucy50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxXQUFXLEVBQUUsTUFBTSxzQ0FBc0MsQ0FBQztBQUN4RSxPQUFPLEtBQUssRUFBRSxFQUFFLEVBQUUsTUFBTSxxQ0FBcUMsQ0FBQztBQUU5RCxPQUFPLEVBQUUsS0FBSyx1QkFBdUIsRUFBRSxXQUFXLEVBQUUsTUFBTSw4QkFBOEIsQ0FBQztBQUV6RixPQUFPLEtBQUssRUFBRSxTQUFTLEVBQUUsTUFBTSx3QkFBd0IsQ0FBQztBQUN4RCxPQUFPLEtBQUssRUFBRSxZQUFZLEVBQUUsV0FBVyxFQUFFLE1BQU0sNEJBQTRCLENBQUM7QUFDNUUsT0FBTyxLQUFLLEVBQUUsYUFBYSxFQUFFLE1BQU0sNEJBQTRCLENBQUM7QUFDaEUsT0FBTyxLQUFLLEVBQUUsa0JBQWtCLEVBQUUsTUFBTSw4QkFBOEIsQ0FBQztBQUN2RSxPQUFPLEtBQUssRUFBRSxXQUFXLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUN6RCxPQUFPLEtBQUssRUFBRSxjQUFjLEVBQUUsTUFBTSwwQkFBMEIsQ0FBQztBQUMvRCxPQUFPLEtBQUssRUFBRSxrQkFBa0IsRUFBRSxNQUFNLHdDQUF3QyxDQUFDO0FBRWpGOztHQUVHO0FBQ0gsTUFBTSxNQUFNLGFBQWEsR0FBRyxZQUFZLENBQUMsY0FBYyxHQUFHLFlBQVksQ0FBQyxnQkFBZ0IsQ0FBQztBQUV4RixNQUFNLE1BQU0sUUFBUSxHQUFHLE9BQU8sQ0FBQyxZQUFZLEVBQUUsYUFBYSxDQUFDLENBQUM7QUFFNUQ7O0dBRUc7QUFDSCxNQUFNLFdBQVcscUJBQXFCLENBQUMsQ0FBQyxTQUFTLE1BQU07SUFDckQ7O09BRUc7SUFDSCxZQUFZLEVBQUUsdUJBQXVCLENBQUM7SUFDdEM7O09BRUc7SUFDSCxXQUFXLEVBQUUsV0FBVyxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQzVCOztPQUVHO0lBQ0gsS0FBSyxFQUFFLE1BQU0sQ0FBQztDQUNmO0FBRUQ7O0dBRUc7QUFDSCxNQUFNLFdBQVcsb0JBQW9CLENBQUMsVUFBVSxTQUFTLE1BQU0sRUFBRSx3QkFBd0IsU0FBUyxNQUFNO0lBQ3RHOztPQUVHO0lBQ0gsb0JBQW9CLENBQUMsRUFBRSxxQkFBcUIsQ0FBQyxVQUFVLENBQUMsRUFBRSxDQUFDO0lBQzNEOztPQUVHO0lBQ0gscUJBQXFCLEVBQUUsV0FBVyxDQUFDLHdCQUF3QixDQUFDLENBQUM7SUFDN0Q7O09BRUc7SUFDSCxlQUFlLEVBQUUsTUFBTSxFQUFFLENBQUM7SUFDMUI7O09BRUc7SUFDSCxzQkFBc0IsRUFBRSxNQUFNLEVBQUUsQ0FBQztDQUNsQztBQUVEOztHQUVHO0FBQ0gsTUFBTSxXQUFXLHlCQUF5QixDQUFDLFVBQVUsU0FBUyxNQUFNO0lBQ2xFOztPQUVHO0lBQ0gsb0JBQW9CLEVBQUUscUJBQXFCLENBQUMsVUFBVSxDQUFDLEVBQUUsQ0FBQztJQUMxRDs7T0FFRztJQUNILG9CQUFvQixFQUFFLHFCQUFxQixDQUFDLFVBQVUsQ0FBQyxFQUFFLENBQUM7Q0FDM0Q7QUFFRDs7R0FFRztBQUNILE1BQU0sV0FBVyxRQUFRO0lBQ3ZCOztPQUVHO0lBQ0gsTUFBTSxFQUFFLFlBQVksQ0FBQztJQUNyQjs7T0FFRztJQUNILElBQUksRUFBRSxNQUFNLENBQUM7SUFDYjs7T0FFRztJQUNILElBQUksRUFBRSxNQUFNLENBQUM7SUFFYjs7T0FFRztJQUNILEtBQUssRUFBRSxNQUFNLENBQUM7Q0FDZjtBQUVELEtBQUssU0FBUyxHQUFHO0lBQ2YsQ0FBQyxZQUFZLENBQUMsY0FBYyxDQUFDLEVBQUUsTUFBTSxDQUFDO0lBQ3RDLENBQUMsWUFBWSxDQUFDLGNBQWMsQ0FBQyxFQUFFLEVBQUUsQ0FBQztJQUNsQyxDQUFDLFlBQVksQ0FBQyxnQkFBZ0IsQ0FBQyxFQUFFLE1BQU0sQ0FBQztJQUN4QyxDQUFDLFlBQVksQ0FBQyxxQkFBcUIsQ0FBQyxFQUFFLEVBQUUsQ0FBQztJQUN6QyxDQUFDLFlBQVksQ0FBQyxPQUFPLENBQUMsRUFBRSxTQUFTLENBQUM7Q0FDbkMsQ0FBQztBQUVGLEtBQUssY0FBYyxHQUFHO0lBQ3BCLENBQUMsWUFBWSxDQUFDLGNBQWMsQ0FBQyxFQUFFLGFBQWEsQ0FBQztJQUM3QyxDQUFDLFlBQVksQ0FBQyxjQUFjLENBQUMsRUFBRSxFQUFFLENBQUM7SUFDbEMsQ0FBQyxZQUFZLENBQUMsZ0JBQWdCLENBQUMsRUFBRSxrQkFBa0IsQ0FBQztJQUNwRCxDQUFDLFlBQVksQ0FBQyxxQkFBcUIsQ0FBQyxFQUFFLEVBQUUsQ0FBQztJQUN6QyxDQUFDLFlBQVksQ0FBQyxPQUFPLENBQUMsRUFBRSxTQUFTLENBQUM7Q0FDbkMsQ0FBQztBQUVGLE1BQU0sTUFBTSxrQkFBa0IsQ0FBQyxFQUFFLFNBQVMsWUFBWSxJQUFJLFNBQVMsQ0FBQyxFQUFFLENBQUMsQ0FBQztBQUV4RSxNQUFNLE1BQU0sbUJBQW1CLENBQUMsRUFBRSxTQUFTLFlBQVksSUFBSSxjQUFjLENBQUMsRUFBRSxDQUFDLENBQUM7QUFFOUU7O0dBRUc7QUFDSCxNQUFNLFdBQVcsd0JBQXdCO0lBQ3ZDOzs7T0FHRztJQUNILFdBQVcsQ0FBQyxNQUFNLEVBQUUsWUFBWSxHQUFHLE9BQU8sQ0FBQyxRQUFRLENBQUMsQ0FBQztJQUVyRDs7T0FFRztJQUNILGlCQUFpQixJQUFJLE9BQU8sQ0FBQyxjQUFjLENBQUMsQ0FBQztJQUU3Qzs7T0FFRztJQUNILGdCQUFnQixJQUFJLFdBQVcsQ0FBQztJQUVoQzs7T0FFRztJQUNILFdBQVcsSUFBSSxrQkFBa0IsQ0FBQztJQUVsQzs7O09BR0c7SUFDSCxVQUFVLElBQUksTUFBTSxDQUFDO0lBRXJCOzs7O09BSUc7SUFDSCxjQUFjLENBQUMsRUFBRSxTQUFTLFlBQVksRUFBRSxNQUFNLEVBQUUsRUFBRSxFQUFFLEtBQUssRUFBRSxNQUFNLEdBQUcsT0FBTyxDQUFDLFdBQVcsQ0FBQyxXQUFXLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBRTFHOzs7O09BSUc7SUFDSCxxQkFBcUIsQ0FBQyxFQUFFLFNBQVMsYUFBYSxFQUM1QyxNQUFNLEVBQUUsRUFBRSxFQUNWLEtBQUssRUFBRSxNQUFNLEdBQ1osT0FBTyxDQUNOO1FBQ0Usa0NBQWtDO1FBQ2xDLEtBQUssRUFBRSxNQUFNLENBQUM7UUFDZCxrRkFBa0Y7UUFDbEYsY0FBYyxFQUFFLE9BQU8sQ0FBQztLQUN6QixHQUNELFNBQVMsQ0FDWixDQUFDO0lBRUY7Ozs7T0FJRztJQUNILGVBQWUsQ0FBQyxFQUFFLFNBQVMsYUFBYSxFQUFFLE1BQU0sRUFBRSxFQUFFLEVBQUUsS0FBSyxFQUFFLE1BQU0sR0FBRyxPQUFPLENBQUMsdUJBQXVCLEdBQUcsU0FBUyxDQUFDLENBQUM7SUFFbkg7Ozs7T0FJRztJQUNILGVBQWUsQ0FBQyxFQUFFLFNBQVMsWUFBWSxFQUNyQyxNQUFNLEVBQUUsRUFBRSxFQUNWLE1BQU0sRUFBRSxrQkFBa0IsQ0FBQyxFQUFFLENBQUMsRUFBRSxHQUMvQixPQUFPLENBQUMsQ0FBQyxNQUFNLEdBQUcsU0FBUyxDQUFDLEVBQUUsQ0FBQyxDQUFDO0lBRW5DOzs7O09BSUc7SUFDSCxnQkFBZ0IsQ0FBQyxFQUFFLFNBQVMsWUFBWSxFQUN0QyxNQUFNLEVBQUUsRUFBRSxFQUNWLE1BQU0sRUFBRSxrQkFBa0IsQ0FBQyxFQUFFLENBQUMsRUFBRSxHQUMvQixPQUFPLENBQUMsQ0FBQztRQUFFLElBQUksRUFBRSxXQUFXLENBQUMsV0FBVyxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBQUM7UUFBQyxLQUFLLEVBQUUsTUFBTSxDQUFBO0tBQUUsR0FBRyxTQUFTLENBQUMsRUFBRSxDQUFDLENBQUM7SUFFbEY7Ozs7O09BS0c7SUFDSCxvQkFBb0IsQ0FBQyxFQUFFLFNBQVMsWUFBWSxFQUMxQyxNQUFNLEVBQUUsRUFBRSxFQUNWLE1BQU0sRUFBRSxrQkFBa0IsQ0FBQyxFQUFFLENBQUMsRUFBRSxFQUNoQyxVQUFVLEVBQUUsTUFBTSxHQUNqQixPQUFPLENBQUMsQ0FBQyxNQUFNLEdBQUcsU0FBUyxDQUFDLEVBQUUsQ0FBQyxDQUFDO0lBRW5DOzs7O09BSUc7SUFDSCxZQUFZLENBQUMsRUFBRSxTQUFTLFlBQVksRUFDbEMsTUFBTSxFQUFFLEVBQUUsRUFDVixLQUFLLEVBQUUsTUFBTSxHQUNaLE9BQU8sQ0FBQyxrQkFBa0IsQ0FBQyxPQUFPLE1BQU0sQ0FBQyxHQUFHLFNBQVMsQ0FBQyxDQUFDO0lBRTFEOzs7O09BSUc7SUFDSCw2QkFBNkIsQ0FBQyxFQUFFLFNBQVMsWUFBWSxFQUNuRCxNQUFNLEVBQUUsRUFBRSxFQUNWLFdBQVcsRUFBRSxNQUFNLEVBQUUsR0FDcEIsT0FBTyxDQUFDLENBQUMsV0FBVyxHQUFHLFNBQVMsQ0FBQyxFQUFFLENBQUMsQ0FBQztDQUN6QztBQUVELE1BQU0sV0FBVyw4QkFBOEI7SUFDN0MsbUZBQW1GO0lBQ25GLGdCQUFnQixJQUFJLE9BQU8sQ0FBQyxNQUFNLENBQUMsQ0FBQztJQUVwQyxzQ0FBc0M7SUFDdEMsZ0JBQWdCLElBQUksT0FBTyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRWxDLHNDQUFzQztJQUN0QyxnQkFBZ0IsSUFBSSxPQUFPLENBQUMsSUFBSSxDQUFDLENBQUM7SUFFbEMsa0dBQWtHO0lBQ2xHLHNCQUFzQixDQUFDLEtBQUssRUFBRSxNQUFNLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRXJELGtHQUFrRztJQUNsRyxzQkFBc0IsQ0FBQyxLQUFLLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FBQztDQUN0RDtBQUVELE1BQU0sV0FBVyx5QkFDZixTQUFRLHdCQUF3QixFQUM5Qiw4QkFBOEIsRUFDOUIsZUFBZTtJQUNqQjs7OztPQUlHO0lBQ0gsWUFBWSxDQUFDLEVBQUUsU0FBUyxZQUFZLEVBQUUsTUFBTSxFQUFFLEVBQUUsRUFBRSxNQUFNLEVBQUUsa0JBQWtCLENBQUMsRUFBRSxDQUFDLEVBQUUsR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBQUM7SUFFbkc7Ozs7T0FJRztJQUNILGFBQWEsQ0FBQyxNQUFNLEVBQUUsV0FBVyxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUVsRDs7Ozs7O09BTUc7SUFDSCxXQUFXLENBQUMsVUFBVSxTQUFTLE1BQU0sRUFBRSx3QkFBd0IsU0FBUyxNQUFNLEVBQUUsRUFBRSxTQUFTLGFBQWEsRUFDdEcsTUFBTSxFQUFFLEVBQUUsRUFDVixNQUFNLEVBQUUsTUFBTSxFQUFFLEVBQ2hCLGFBQWEsRUFBRSxNQUFNLEdBQ3BCLE9BQU8sQ0FBQyxvQkFBb0IsQ0FBQyxVQUFVLEVBQUUsd0JBQXdCLENBQUMsQ0FBQyxDQUFDO0lBRXZFOzs7Ozs7T0FNRztJQUNILGdCQUFnQixDQUFDLFVBQVUsU0FBUyxNQUFNLEVBQUUsRUFBRSxTQUFTLGFBQWEsRUFDbEUsTUFBTSxFQUFFLEVBQUUsRUFDVixNQUFNLEVBQUUsTUFBTSxFQUFFLEdBQ2YsT0FBTyxDQUFDLHlCQUF5QixDQUFDLFVBQVUsQ0FBQyxDQUFDLENBQUM7SUFFbEQ7O09BRUc7SUFDSCxLQUFLLElBQUksT0FBTyxDQUFDLElBQUksQ0FBQyxDQUFDO0NBQ3hCO0FBRUQ7O0dBRUc7QUFDSCx3QkFBc0IsV0FBVyxDQUMvQixFQUFFLEVBQUUsd0JBQXdCLEVBQzVCLE1BQU0sRUFBRSxZQUFZLEVBQ3BCLEdBQUcsOENBQXFDLGlCQVV6QyJ9

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,WAAW,EAAE,MAAM,sCAAsC,CAAC;AACxE,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,qCAAqC,CAAC;AAE9D,OAAO,EAAE,KAAK,uBAAuB,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAEzF,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAC5E,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;AAC/D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAEjF;;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,SAAS,CAAC;CACnC,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,SAAS,CAAC;CACnC,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;;OAEG;IACH,WAAW,IAAI,kBAAkB,CAAC;IAElC;;;OAGG;IACH,UAAU,IAAI,MAAM,CAAC;IAErB;;;;OAIG;IACH,cAAc,CAAC,EAAE,SAAS,YAAY,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAE1G;;;;OAIG;IACH,qBAAqB,CAAC,EAAE,SAAS,aAAa,EAC5C,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CACN;QACE,kCAAkC;QAClC,KAAK,EAAE,MAAM,CAAC;QACd,kFAAkF;QAClF,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;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,SAAS,YAAY,EACtC,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAC/B,OAAO,CAAC,CAAC;QAAE,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAElF;;;;;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,WAAW,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,8BAA8B;IAC7C,mFAAmF;IACnF,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAEpC,sCAAsC;IACtC,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAElC,sCAAsC;IACtC,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAElC,kGAAkG;IAClG,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAErD,kGAAkG;IAClG,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACtD;AAED,MAAM,WAAW,yBACf,SAAQ,wBAAwB,EAC9B,8BAA8B,EAC9B,eAAe;IACjB;;;;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,8CAAqC,iBAUzC"}

package/dest/interfaces/merkle_tree_operations.js

@@ -0,0 +1,13 @@
+import { createLogger } from '@aztec-labs/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=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicDJwLWJvb3RzdHJhcC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2ludGVyZmFjZXMvcDJwLWJvb3RzdHJhcC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFFQSxPQUFPLEtBQUssRUFBRSxZQUFZLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQUV4RCw2Q0FBNkM7QUFDN0MsTUFBTSxXQUFXLGVBQWU7SUFDOUI7O09BRUc7SUFDSCxhQUFhLElBQUksT0FBTyxDQUFDLE1BQU0sQ0FBQyxDQUFDO0lBRWpDOztPQUVHO0lBQ0gsZUFBZSxJQUFJLE9BQU8sQ0FBQyxNQUFNLEVBQUUsQ0FBQyxDQUFDO0NBQ3RDO0FBRUQsZUFBTyxNQUFNLHFCQUFxQixFQUFFLFlBQVksQ0FBQyxlQUFlLENBRy9ELENBQUMifQ==

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,11 @@
+import { z } from 'zod';
+export const P2PBootstrapApiSchema = {
+    getEncodedEnr: z.function({
+        input: z.tuple([]),
+        output: z.string()
+    }),
+    getRoutingTable: z.function({
+        input: z.tuple([]),
+        output: z.array(z.string())
+    })
+};

package/dest/interfaces/p2p.d.ts

@@ -0,0 +1,111 @@
+import type { CheckpointProposalHash, SlotNumber } from '@aztec-labs/foundation/branded-types';
+import { z } from 'zod';
+import { BlockProposal } from '../p2p/block_proposal.js';
+import { CheckpointAttestation } from '../p2p/checkpoint_attestation.js';
+import { type CheckpointProposalCore } from '../p2p/checkpoint_proposal.js';
+import { type ApiSchemaFor } from '../schemas/index.js';
+import { Tx } from '../tx/tx.js';
+import { TxHash } from '../tx/tx_hash.js';
+import { type GetTxByHashOptions } from './get_tx_by_hash_options.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;
+};
+export declare const PeerInfoSchema: z.ZodDiscriminatedUnion<[z.ZodObject<{
+    status: z.ZodLiteral<"connected">;
+    score: z.ZodNumber;
+    id: z.ZodString;
+}, z.core.$strip>, z.ZodObject<{
+    status: z.ZodLiteral<"dialing">;
+    dialStatus: z.ZodString;
+    id: z.ZodString;
+    addresses: z.ZodArray<z.ZodString>;
+}, z.core.$strip>, z.ZodObject<{
+    status: z.ZodLiteral<"cached">;
+    id: z.ZodString;
+    addresses: z.ZodArray<z.ZodString>;
+    enr: z.ZodString;
+    dialAttempts: z.ZodNumber;
+}, z.core.$strip>], "status">;
+/** Connectivity of the p2p stack: whether it is enabled at all, and how many peers are currently connected. */
+export type P2PConnectivity = {
+    /** False when the node runs without a p2p stack (eg sandbox or single-node setups). */
+    enabled: boolean;
+    /** Number of peers currently connected. Always zero when p2p is disabled. */
+    connectedPeers: number;
+};
+export declare const P2PConnectivitySchema: z.ZodObject<{
+    enabled: z.ZodBoolean;
+    connectedPeers: z.ZodNumber;
+}, z.core.$strip>;
+/** Exposed API to the P2P module. */
+export interface P2PApi {
+    /**
+     * Returns all pending transactions in the transaction pool. The txs' proofs are stripped unless
+     * `includeProof` is set.
+     * @param limit - The number of items to returns
+     * @param after - The last known pending tx. Used for pagination
+     * @param options - Options for the returned txs (eg whether to include their proofs).
+     * @returns An array of Txs.
+     */
+    getPendingTxs(limit?: number, after?: TxHash, options?: GetTxByHashOptions): Promise<Tx[]>;
+    /** Returns the number of pending txs in the p2p tx pool. */
+    getPendingTxCount(): Promise<number>;
+    /**
+     * 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[]>;
+    /**
+     * Returns whether the p2p stack is enabled on this node, and the number of peers it is connected to.
+     * Nodes running without p2p report `enabled: false`, so consumers can tell a disabled stack apart from a
+     * stack that is enabled but has no peers.
+     */
+    getP2PConnectivity(): Promise<P2PConnectivity>;
+    /**
+     * Queries the Attestation pool for checkpoint attestations for the given slot.
+     *
+     * @param slot - the slot to query
+     * @param proposalPayloadHash - hex-encoded keccak256 of the target proposal's signed
+     *        payload (`CheckpointProposal.getPayloadHash()`). When provided, only
+     *        attestations whose own signed payload hashes to the same value are returned.
+     *        When omitted, all attestations for the slot are returned.
+     * @returns CheckpointAttestations
+     */
+    getCheckpointAttestationsForSlot(slot: SlotNumber, proposalPayloadHash?: CheckpointProposalHash): Promise<CheckpointAttestation[]>;
+}
+export type ProposalsForSlot = {
+    blockProposals: BlockProposal[];
+    checkpointProposals: CheckpointProposalCore[];
+};
+export interface P2PClient extends P2PApi {
+    /** Manually adds checkpoint attestations to the p2p client attestation pool. */
+    addOwnCheckpointAttestations(attestations: CheckpointAttestation[]): Promise<void>;
+    /** Returns retained signed proposals for a slot. */
+    getProposalsForSlot(slot: SlotNumber): Promise<ProposalsForSlot>;
+    /** Returns whether a checkpoint proposal was retained for a slot. */
+    hasCheckpointProposalForSlot(slot: SlotNumber): Promise<boolean>;
+}
+export declare const BlockProposalSchema: z.ZodType<never, string, z.core.$ZodTypeInternals<never, string>>;
+export declare const CheckpointProposalSchema: z.ZodType<never, string, z.core.$ZodTypeInternals<never, string>>;
+export declare const ProposalsForSlotSchema: z.ZodObject<{
+    blockProposals: z.ZodArray<z.ZodType<never, string, z.core.$ZodTypeInternals<never, string>>>;
+    checkpointProposals: z.ZodArray<z.ZodType<never, string, z.core.$ZodTypeInternals<never, string>>>;
+}, z.core.$strip>;
+export declare const P2PApiSchema: ApiSchemaFor<P2PApi>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicDJwLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvaW50ZXJmYWNlcy9wMnAudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxLQUFLLEVBQUUsc0JBQXNCLEVBQUUsVUFBVSxFQUFFLE1BQU0sc0NBQXNDLENBQUM7QUFFL0YsT0FBTyxFQUFFLENBQUMsRUFBRSxNQUFNLEtBQUssQ0FBQztBQUV4QixPQUFPLEVBQUUsYUFBYSxFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFDekQsT0FBTyxFQUFFLHFCQUFxQixFQUFFLE1BQU0sa0NBQWtDLENBQUM7QUFDekUsT0FBTyxFQUFzQixLQUFLLHNCQUFzQixFQUFFLE1BQU0sK0JBQStCLENBQUM7QUFDaEcsT0FBTyxFQUFFLEtBQUssWUFBWSxFQUFxQixNQUFNLHFCQUFxQixDQUFDO0FBQzNFLE9BQU8sRUFBRSxFQUFFLEVBQUUsTUFBTSxhQUFhLENBQUM7QUFDakMsT0FBTyxFQUFFLE1BQU0sRUFBRSxNQUFNLGtCQUFrQixDQUFDO0FBRTFDLE9BQU8sRUFBRSxLQUFLLGtCQUFrQixFQUE0QixNQUFNLDZCQUE2QixDQUFDO0FBRWhHLE1BQU0sTUFBTSxRQUFRLEdBQ2hCO0lBQUUsTUFBTSxFQUFFLFdBQVcsQ0FBQztJQUFDLEtBQUssRUFBRSxNQUFNLENBQUM7SUFBQyxFQUFFLEVBQUUsTUFBTSxDQUFBO0NBQUUsR0FDbEQ7SUFBRSxNQUFNLEVBQUUsU0FBUyxDQUFDO0lBQUMsVUFBVSxFQUFFLE1BQU0sQ0FBQztJQUFDLEVBQUUsRUFBRSxNQUFNLENBQUM7SUFBQyxTQUFTLEVBQUUsTUFBTSxFQUFFLENBQUE7Q0FBRSxHQUMxRTtJQUFFLE1BQU0sRUFBRSxRQUFRLENBQUM7SUFBQyxFQUFFLEVBQUUsTUFBTSxDQUFDO0lBQUMsU0FBUyxFQUFFLE1BQU0sRUFBRSxDQUFDO0lBQUMsR0FBRyxFQUFFLE1BQU0sQ0FBQztJQUFDLFlBQVksRUFBRSxNQUFNLENBQUE7Q0FBRSxDQUFDO0FBRTdGLGVBQU8sTUFBTSxjQUFjOzs7Ozs7Ozs7Ozs7Ozs7NkJBVXpCLENBQUM7QUFFSCwrR0FBK0c7QUFDL0csTUFBTSxNQUFNLGVBQWUsR0FBRztJQUM1Qix1RkFBdUY7SUFDdkYsT0FBTyxFQUFFLE9BQU8sQ0FBQztJQUNqQiw2RUFBNkU7SUFDN0UsY0FBYyxFQUFFLE1BQU0sQ0FBQztDQUN4QixDQUFDO0FBRUYsZUFBTyxNQUFNLHFCQUFxQjs7O2lCQUdoQyxDQUFDO0FBRUgscUNBQXFDO0FBQ3JDLE1BQU0sV0FBVyxNQUFNO0lBQ3JCOzs7Ozs7O09BT0c7SUFDSCxhQUFhLENBQUMsS0FBSyxDQUFDLEVBQUUsTUFBTSxFQUFFLEtBQUssQ0FBQyxFQUFFLE1BQU0sRUFBRSxPQUFPLENBQUMsRUFBRSxrQkFBa0IsR0FBRyxPQUFPLENBQUMsRUFBRSxFQUFFLENBQUMsQ0FBQztJQUUzRiw0REFBNEQ7SUFDNUQsaUJBQWlCLElBQUksT0FBTyxDQUFDLE1BQU0sQ0FBQyxDQUFDO0lBRXJDOztPQUVHO0lBQ0gsYUFBYSxJQUFJLE9BQU8sQ0FBQyxNQUFNLEdBQUcsU0FBUyxDQUFDLENBQUM7SUFFN0M7O09BRUc7SUFDSCxRQUFRLENBQUMsY0FBYyxDQUFDLEVBQUUsT0FBTyxHQUFHLE9BQU8sQ0FBQyxRQUFRLEVBQUUsQ0FBQyxDQUFDO0lBRXhEOzs7O09BSUc7SUFDSCxrQkFBa0IsSUFBSSxPQUFPLENBQUMsZUFBZSxDQUFDLENBQUM7SUFFL0M7Ozs7Ozs7OztPQVNHO0lBQ0gsZ0NBQWdDLENBQzlCLElBQUksRUFBRSxVQUFVLEVBQ2hCLG1CQUFtQixDQUFDLEVBQUUsc0JBQXNCLEdBQzNDLE9BQU8sQ0FBQyxxQkFBcUIsRUFBRSxDQUFDLENBQUM7Q0FDckM7QUFFRCxNQUFNLE1BQU0sZ0JBQWdCLEdBQUc7SUFDN0IsY0FBYyxFQUFFLGFBQWEsRUFBRSxDQUFDO0lBQ2hDLG1CQUFtQixFQUFFLHNCQUFzQixFQUFFLENBQUM7Q0FDL0MsQ0FBQztBQUVGLE1BQU0sV0FBVyxTQUFVLFNBQVEsTUFBTTtJQUN2QyxnRkFBZ0Y7SUFDaEYsNEJBQTRCLENBQUMsWUFBWSxFQUFFLHFCQUFxQixFQUFFLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRW5GLG9EQUFvRDtJQUNwRCxtQkFBbUIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE9BQU8sQ0FBQyxnQkFBZ0IsQ0FBQyxDQUFDO0lBRWpFLHFFQUFxRTtJQUNyRSw0QkFBNEIsQ0FBQyxJQUFJLEVBQUUsVUFBVSxHQUFHLE9BQU8sQ0FBQyxPQUFPLENBQUMsQ0FBQztDQUNsRTtBQUlELGVBQU8sTUFBTSxtQkFBbUIsbUVBQWlDLENBQUM7QUFDbEUsZUFBTyxNQUFNLHdCQUF3QixtRUFBc0MsQ0FBQztBQUU1RSxlQUFPLE1BQU0sc0JBQXNCOzs7aUJBR2pDLENBQUM7QUFFSCxlQUFPLE1BQU0sWUFBWSxFQUFFLFlBQVksQ0FBQyxNQUFNLENBcUI3QyxDQUFDIn0=

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

@@ -0,0 +1 @@
+{"version":3,"file":"p2p.d.ts","sourceRoot":"","sources":["../../src/interfaces/p2p.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAE/F,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,EAAsB,KAAK,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAChG,OAAO,EAAE,KAAK,YAAY,EAAqB,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,EAAE,EAAE,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,OAAO,EAAE,KAAK,kBAAkB,EAA4B,MAAM,6BAA6B,CAAC;AAEhG,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;AAE7F,eAAO,MAAM,cAAc;;;;;;;;;;;;;;;6BAUzB,CAAC;AAEH,+GAA+G;AAC/G,MAAM,MAAM,eAAe,GAAG;IAC5B,uFAAuF;IACvF,OAAO,EAAE,OAAO,CAAC;IACjB,6EAA6E;IAC7E,cAAc,EAAE,MAAM,CAAC;CACxB,CAAC;AAEF,eAAO,MAAM,qBAAqB;;;iBAGhC,CAAC;AAEH,qCAAqC;AACrC,MAAM,WAAW,MAAM;IACrB;;;;;;;OAOG;IACH,aAAa,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;IAE3F,4DAA4D;IAC5D,iBAAiB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAErC;;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;IAExD;;;;OAIG;IACH,kBAAkB,IAAI,OAAO,CAAC,eAAe,CAAC,CAAC;IAE/C;;;;;;;;;OASG;IACH,gCAAgC,CAC9B,IAAI,EAAE,UAAU,EAChB,mBAAmB,CAAC,EAAE,sBAAsB,GAC3C,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;CACrC;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B,cAAc,EAAE,aAAa,EAAE,CAAC;IAChC,mBAAmB,EAAE,sBAAsB,EAAE,CAAC;CAC/C,CAAC;AAEF,MAAM,WAAW,SAAU,SAAQ,MAAM;IACvC,gFAAgF;IAChF,4BAA4B,CAAC,YAAY,EAAE,qBAAqB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnF,oDAAoD;IACpD,mBAAmB,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAEjE,qEAAqE;IACrE,4BAA4B,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CAClE;AAID,eAAO,MAAM,mBAAmB,mEAAiC,CAAC;AAClE,eAAO,MAAM,wBAAwB,mEAAsC,CAAC;AAE5E,eAAO,MAAM,sBAAsB;;;iBAGjC,CAAC;AAEH,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,MAAM,CAqB7C,CAAC"}

package/dest/interfaces/p2p.js

@@ -0,0 +1,76 @@
+import { bufferSchemaFor } from '@aztec-labs/foundation/schemas';
+import { z } from 'zod';
+import { BlockProposal } from '../p2p/block_proposal.js';
+import { CheckpointAttestation } from '../p2p/checkpoint_attestation.js';
+import { CheckpointProposal } from '../p2p/checkpoint_proposal.js';
+import { optional, schemas } from '../schemas/index.js';
+import { Tx } from '../tx/tx.js';
+import { TxHash } from '../tx/tx_hash.js';
+import { MAX_RPC_TXS_LEN } from './api_limit.js';
+import { GetTxByHashOptionsSchema } from './get_tx_by_hash_options.js';
+export 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 P2PConnectivitySchema = z.object({
+    enabled: z.boolean(),
+    connectedPeers: z.number()
+});
+const MAX_PROPOSALS_FOR_SLOT_RPC_LEN = 256;
+export const BlockProposalSchema = bufferSchemaFor(BlockProposal);
+export const CheckpointProposalSchema = bufferSchemaFor(CheckpointProposal);
+export const ProposalsForSlotSchema = z.object({
+    blockProposals: z.array(BlockProposalSchema).max(MAX_PROPOSALS_FOR_SLOT_RPC_LEN),
+    checkpointProposals: z.array(CheckpointProposalSchema).max(MAX_PROPOSALS_FOR_SLOT_RPC_LEN)
+});
+export const P2PApiSchema = {
+    getCheckpointAttestationsForSlot: z.function({
+        input: z.tuple([
+            schemas.SlotNumber,
+            optional(z.string().regex(/^0x[0-9a-fA-F]+$/))
+        ]),
+        output: z.array(CheckpointAttestation.schema)
+    }),
+    getPendingTxs: z.function({
+        input: z.tuple([
+            optional(z.number().gte(1).lte(MAX_RPC_TXS_LEN).default(MAX_RPC_TXS_LEN)),
+            optional(TxHash.schema),
+            optional(GetTxByHashOptionsSchema)
+        ]),
+        output: z.array(Tx.schema)
+    }),
+    getPendingTxCount: z.function({
+        input: z.tuple([]),
+        output: schemas.Integer
+    }),
+    getEncodedEnr: z.function({
+        input: z.tuple([]),
+        output: z.string().optional()
+    }),
+    getPeers: z.function({
+        input: z.tuple([
+            optional(z.boolean())
+        ]),
+        output: z.array(PeerInfoSchema)
+    }),
+    getP2PConnectivity: z.function({
+        input: z.tuple([]),
+        output: P2PConnectivitySchema
+    })
+};