@aztec/foundation 0.76.4 → 0.77.0-testnet-ignition.21

package/dest/transport/transport_server.d.ts

@@ -1,4 +1,4 @@
-import { type Listener } from './interface/listener.js';
+import type { Listener } from './interface/listener.js';
 /**
  * Keeps track of clients, providing a broadcast, and request/response api with multiplexing.
  */

package/dest/transport/transport_server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"transport_server.d.ts","sourceRoot":"","sources":["../../src/transport/transport_server.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAIxD;;GAEG;AACH,qBAAa,eAAe,CAAC,OAAO;IAGtB,OAAO,CAAC,QAAQ;IAAY,OAAO,CAAC,YAAY;IAF5D,OAAO,CAAC,OAAO,CAAgB;gBAEX,QAAQ,EAAE,QAAQ,EAAU,YAAY,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,OAAO,CAAC,GAAG,CAAC;IAE5F;;;;OAIG;IACH,KAAK;IAKL;;;OAGG;IACH,IAAI;IAIJ;;;;;;;OAOG;IACG,SAAS,CAAC,GAAG,EAAE,OAAO;IAI5B;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;IAcvB;;;;;OAKG;IACH,OAAO,CAAC,sBAAsB;IAe9B;;;;;;;;OAQG;YACW,mBAAmB;CAalC"}
+{"version":3,"file":"transport_server.d.ts","sourceRoot":"","sources":["../../src/transport/transport_server.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAIxD;;GAEG;AACH,qBAAa,eAAe,CAAC,OAAO;IAGtB,OAAO,CAAC,QAAQ;IAAY,OAAO,CAAC,YAAY;IAF5D,OAAO,CAAC,OAAO,CAAgB;gBAEX,QAAQ,EAAE,QAAQ,EAAU,YAAY,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,OAAO,CAAC,GAAG,CAAC;IAE5F;;;;OAIG;IACH,KAAK;IAKL;;;OAGG;IACH,IAAI;IAIJ;;;;;;;OAOG;IACG,SAAS,CAAC,GAAG,EAAE,OAAO;IAI5B;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;IAcvB;;;;;OAKG;IACH,OAAO,CAAC,sBAAsB;IAe9B;;;;;;;;OAQG;YACW,mBAAmB;CAalC"}

package/dest/transport/transport_server.js

@@ -1,52 +1,52 @@
 import { isTransferDescriptor } from './interface/transferable.js';
 /**
  * Keeps track of clients, providing a broadcast, and request/response api with multiplexing.
- */
-export class TransportServer {
-    constructor(listener, msgHandlerFn) {
+ */ export class TransportServer {
+    listener;
+    msgHandlerFn;
+    sockets;
+    constructor(listener, msgHandlerFn){
         this.listener = listener;
         this.msgHandlerFn = msgHandlerFn;
         this.sockets = [];
     }
     /**
-     * Starts the TransportServer, allowing it to accept new connections and handle incoming messages.
-     * The server will listen for 'new_socket' events from the underlying listener and invoke the provided message handler function
-     * for each received message. The server remains active until the 'stop' method is called.
-     */
-    start() {
-        this.listener.on('new_socket', client => this.handleNewSocket(client));
+   * Starts the TransportServer, allowing it to accept new connections and handle incoming messages.
+   * The server will listen for 'new_socket' events from the underlying listener and invoke the provided message handler function
+   * for each received message. The server remains active until the 'stop' method is called.
+   */ start() {
+        this.listener.on('new_socket', (client)=>this.handleNewSocket(client));
         this.listener.open();
     }
     /**
-     * Stops accepting new connections. It doesn't close existing sockets.
-     * It's expected the clients will gracefully complete by closing their end, sending an `undefined` message.
-     */
-    stop() {
+   * Stops accepting new connections. It doesn't close existing sockets.
+   * It's expected the clients will gracefully complete by closing their end, sending an `undefined` message.
+   */ stop() {
         this.listener.close();
     }
     /**
-     * Sends a broadcast message to all connected clients.
-     * The given payload will be sent to all the clients currently connected to the TransportServer.
-     * It waits for all the messages to be sent and resolves when they are all sent successfully.
-     *
-     * @param msg - The payload to broadcast to all connected clients.
-     * @returns A Promise that resolves when all messages have been sent successfully.
-     */
-    async broadcast(msg) {
-        await Promise.all(this.sockets.map(s => s.send({ payload: msg })));
+   * Sends a broadcast message to all connected clients.
+   * The given payload will be sent to all the clients currently connected to the TransportServer.
+   * It waits for all the messages to be sent and resolves when they are all sent successfully.
+   *
+   * @param msg - The payload to broadcast to all connected clients.
+   * @returns A Promise that resolves when all messages have been sent successfully.
+   */ async broadcast(msg) {
+        await Promise.all(this.sockets.map((s)=>s.send({
+                payload: msg
+            })));
     }
     /**
-     * Handles the addition of a new socket to the server by registering a message handler for the client
-     * and adding the socket to the list of active sockets. The message handler processes incoming messages
-     * from the client, including detecting client disconnection and removing the closed socket.
-     *
-     * @param socket - The new Socket instance that has connected to the server.
-     */
-    handleNewSocket(socket) {
-        socket.registerHandler(async (msg) => {
+   * Handles the addition of a new socket to the server by registering a message handler for the client
+   * and adding the socket to the list of active sockets. The message handler processes incoming messages
+   * from the client, including detecting client disconnection and removing the closed socket.
+   *
+   * @param socket - The new Socket instance that has connected to the server.
+   */ handleNewSocket(socket) {
+        socket.registerHandler(async (msg)=>{
             if (msg === undefined) {
                 // Client socket has closed. Remove it from the list of sockets. Call close on it for any cleanup.
-                const socketIndex = this.sockets.findIndex(s => s === socket);
+                const socketIndex = this.sockets.findIndex((s)=>s === socket);
                 const [closingSocket] = this.sockets.splice(socketIndex, 1);
                 closingSocket.close();
                 return;
@@ -56,46 +56,59 @@ export class TransportServer {
         this.sockets.push(socket);
     }
     /**
-     * Detect the 'transferables' argument to our socket from our message
-     * handler return type.
-     * @param data - The compound payload data.
-     * @returns The split data and transferables.
-     */
-    getPayloadAndTransfers(data) {
+   * Detect the 'transferables' argument to our socket from our message
+   * handler return type.
+   * @param data - The compound payload data.
+   * @returns The split data and transferables.
+   */ getPayloadAndTransfers(data) {
         if (isTransferDescriptor(data)) {
             // We treat PayloadWithTransfers specially so that we're able to
             // attach transferables while keeping a simple return-type based usage
-            return [data.send, data.transferables];
+            return [
+                data.send,
+                data.transferables
+            ];
         }
         if (data instanceof Uint8Array) {
             // We may want to devise a better solution to this. We maybe given a view over a non cloneable/transferrable
             // ArrayBuffer (such as a view over wasm memory). In this case we want to take a copy, and then transfer it.
             const respPayload = data instanceof Uint8Array && ArrayBuffer.isView(data) ? new Uint8Array(data) : data;
-            const transferables = data instanceof Uint8Array ? [respPayload.buffer] : [];
-            return [respPayload, transferables];
+            const transferables = data instanceof Uint8Array ? [
+                respPayload.buffer
+            ] : [];
+            return [
+                respPayload,
+                transferables
+            ];
         }
-        return [data, []];
+        return [
+            data,
+            []
+        ];
     }
     /**
-     * Handles incoming socket messages, processing the request and sending back a response.
-     * This function is responsible for invoking the registered message handler function with the received
-     * payload, extracting the result and transferables, and sending a response message back to the client.
-     * In case of an error during message handling, it sends an error response with the stack trace.
-     *
-     * @param socket - The Socket instance from which the message was received.
-     * @param msg - The RequestMessage object containing the message ID and payload.
-     */
-    async handleSocketMessage(socket, { msgId, payload }) {
+   * Handles incoming socket messages, processing the request and sending back a response.
+   * This function is responsible for invoking the registered message handler function with the received
+   * payload, extracting the result and transferables, and sending a response message back to the client.
+   * In case of an error during message handling, it sends an error response with the stack trace.
+   *
+   * @param socket - The Socket instance from which the message was received.
+   * @param msg - The RequestMessage object containing the message ID and payload.
+   */ async handleSocketMessage(socket, { msgId, payload }) {
         try {
             const data = await this.msgHandlerFn(payload);
             const [respPayload, transferables] = this.getPayloadAndTransfers(data);
-            const rep = { msgId, payload: respPayload };
+            const rep = {
+                msgId,
+                payload: respPayload
+            };
             await socket.send(rep, transferables);
-        }
-        catch (err) {
-            const rep = { msgId, error: err.stack };
+        } catch (err) {
+            const rep = {
+                msgId,
+                error: err.stack
+            };
             await socket.send(rep);
         }
     }
 }
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHJhbnNwb3J0X3NlcnZlci5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy90cmFuc3BvcnQvdHJhbnNwb3J0X3NlcnZlci50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFHQSxPQUFPLEVBQUUsb0JBQW9CLEVBQUUsTUFBTSw2QkFBNkIsQ0FBQztBQUVuRTs7R0FFRztBQUNILE1BQU0sT0FBTyxlQUFlO0lBRzFCLFlBQW9CLFFBQWtCLEVBQVUsWUFBNEM7UUFBeEUsYUFBUSxHQUFSLFFBQVEsQ0FBVTtRQUFVLGlCQUFZLEdBQVosWUFBWSxDQUFnQztRQUZwRixZQUFPLEdBQWEsRUFBRSxDQUFDO0lBRWdFLENBQUM7SUFFaEc7Ozs7T0FJRztJQUNILEtBQUs7UUFDSCxJQUFJLENBQUMsUUFBUSxDQUFDLEVBQUUsQ0FBQyxZQUFZLEVBQUUsTUFBTSxDQUFDLEVBQUUsQ0FBQyxJQUFJLENBQUMsZUFBZSxDQUFDLE1BQU0sQ0FBQyxDQUFDLENBQUM7UUFDdkUsSUFBSSxDQUFDLFFBQVEsQ0FBQyxJQUFJLEVBQUUsQ0FBQztJQUN2QixDQUFDO0lBRUQ7OztPQUdHO0lBQ0gsSUFBSTtRQUNGLElBQUksQ0FBQyxRQUFRLENBQUMsS0FBSyxFQUFFLENBQUM7SUFDeEIsQ0FBQztJQUVEOzs7Ozs7O09BT0c7SUFDSCxLQUFLLENBQUMsU0FBUyxDQUFDLEdBQVk7UUFDMUIsTUFBTSxPQUFPLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxPQUFPLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQyxFQUFFLENBQUMsQ0FBQyxDQUFDLElBQUksQ0FBQyxFQUFFLE9BQU8sRUFBRSxHQUFHLEVBQUUsQ0FBQyxDQUFDLENBQUMsQ0FBQztJQUNyRSxDQUFDO0lBRUQ7Ozs7OztPQU1HO0lBQ0ssZUFBZSxDQUFDLE1BQWM7UUFDcEMsTUFBTSxDQUFDLGVBQWUsQ0FBQyxLQUFLLEVBQUMsR0FBRyxFQUFDLEVBQUU7WUFDakMsSUFBSSxHQUFHLEtBQUssU0FBUyxFQUFFLENBQUM7Z0JBQ3RCLGtHQUFrRztnQkFDbEcsTUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLE9BQU8sQ0FBQyxTQUFTLENBQUMsQ0FBQyxDQUFDLEVBQUUsQ0FBQyxDQUFDLEtBQUssTUFBTSxDQUFDLENBQUM7Z0JBQzlELE1BQU0sQ0FBQyxhQUFhLENBQUMsR0FBRyxJQUFJLENBQUMsT0FBTyxDQUFDLE1BQU0sQ0FBQyxXQUFXLEVBQUUsQ0FBQyxDQUFDLENBQUM7Z0JBQzVELGFBQWEsQ0FBQyxLQUFLLEVBQUUsQ0FBQztnQkFDdEIsT0FBTztZQUNULENBQUM7WUFDRCxPQUFPLE1BQU0sSUFBSSxDQUFDLG1CQUFtQixDQUFDLE1BQU0sRUFBRSxHQUFHLENBQUMsQ0FBQztRQUNyRCxDQUFDLENBQUMsQ0FBQztRQUNILElBQUksQ0FBQyxPQUFPLENBQUMsSUFBSSxDQUFDLE1BQU0sQ0FBQyxDQUFDO0lBQzVCLENBQUM7SUFFRDs7Ozs7T0FLRztJQUNLLHNCQUFzQixDQUFDLElBQVM7UUFDdEMsSUFBSSxvQkFBb0IsQ0FBQyxJQUFJLENBQUMsRUFBRSxDQUFDO1lBQy9CLGdFQUFnRTtZQUNoRSxzRUFBc0U7WUFDdEUsT0FBTyxDQUFDLElBQUksQ0FBQyxJQUFJLEVBQUUsSUFBSSxDQUFDLGFBQWEsQ0FBQyxDQUFDO1FBQ3pDLENBQUM7UUFDRCxJQUFJLElBQUksWUFBWSxVQUFVLEVBQUUsQ0FBQztZQUMvQiw0R0FBNEc7WUFDNUcsNEdBQTRHO1lBQzVHLE1BQU0sV0FBVyxHQUFHLElBQUksWUFBWSxVQUFVLElBQUksV0FBVyxDQUFDLE1BQU0sQ0FBQyxJQUFJLENBQUMsQ0FBQyxDQUFDLENBQUMsSUFBSSxVQUFVLENBQUMsSUFBSSxDQUFDLENBQUMsQ0FBQyxDQUFDLElBQUksQ0FBQztZQUN6RyxNQUFNLGFBQWEsR0FBRyxJQUFJLFlBQVksVUFBVSxDQUFDLENBQUMsQ0FBQyxDQUFDLFdBQVcsQ0FBQyxNQUFNLENBQUMsQ0FBQyxDQUFDLENBQUMsRUFBRSxDQUFDO1lBQzdFLE9BQU8sQ0FBQyxXQUFXLEVBQUUsYUFBYSxDQUFDLENBQUM7UUFDdEMsQ0FBQztRQUNELE9BQU8sQ0FBQyxJQUFJLEVBQUUsRUFBRSxDQUFDLENBQUM7SUFDcEIsQ0FBQztJQUNEOzs7Ozs7OztPQVFHO0lBQ0ssS0FBSyxDQUFDLG1CQUFtQixDQUFDLE1BQWMsRUFBRSxFQUFFLEtBQUssRUFBRSxPQUFPLEVBQTJCO1FBQzNGLElBQUksQ0FBQztZQUNILE1BQU0sSUFBSSxHQUFHLE1BQU0sSUFBSSxDQUFDLFlBQVksQ0FBQyxPQUFPLENBQUMsQ0FBQztZQUU5QyxNQUFNLENBQUMsV0FBVyxFQUFFLGFBQWEsQ0FBQyxHQUFHLElBQUksQ0FBQyxzQkFBc0IsQ0FBQyxJQUFJLENBQUMsQ0FBQztZQUN2RSxNQUFNLEdBQUcsR0FBNkIsRUFBRSxLQUFLLEVBQUUsT0FBTyxFQUFFLFdBQVcsRUFBRSxDQUFDO1lBRXRFLE1BQU0sTUFBTSxDQUFDLElBQUksQ0FBQyxHQUFHLEVBQUUsYUFBYSxDQUFDLENBQUM7UUFDeEMsQ0FBQztRQUFDLE9BQU8sR0FBUSxFQUFFLENBQUM7WUFDbEIsTUFBTSxHQUFHLEdBQTZCLEVBQUUsS0FBSyxFQUFFLEtBQUssRUFBRSxHQUFHLENBQUMsS0FBSyxFQUFFLENBQUM7WUFDbEUsTUFBTSxNQUFNLENBQUMsSUFBSSxDQUFDLEdBQUcsQ0FBQyxDQUFDO1FBQ3pCLENBQUM7SUFDSCxDQUFDO0NBQ0YifQ==

package/dest/trees/hasher.d.ts

@@ -0,0 +1,39 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+/**
+ * Defines hasher interface used by Merkle trees.
+ */
+export interface Hasher {
+    /**
+     * Hash two arrays.
+     * @param lhs - The first array.
+     * @param rhs - The second array.
+     * @returns The new 32-byte hash.
+     */
+    hash(lhs: Uint8Array, rhs: Uint8Array): Buffer;
+    /**
+     * Hashes an array of buffers.
+     * @param inputs - The array of buffers to hash.
+     * @returns The resulting 32-byte hash.
+     */
+    hashInputs(inputs: Buffer[]): Buffer;
+}
+/**
+ * Defines an async hasher interface used by Merkle trees.
+ */
+export interface AsyncHasher {
+    /**
+     * Hash two arrays.
+     * @param lhs - The first array.
+     * @param rhs - The second array.
+     * @returns The new 32-byte hash.
+     */
+    hash(lhs: Uint8Array, rhs: Uint8Array): Promise<Buffer>;
+    /**
+     * Hashes an array of buffers.
+     * @param inputs - The array of buffers to hash.
+     * @returns The resulting 32-byte hash.
+     */
+    hashInputs(inputs: Buffer[]): Promise<Buffer>;
+}
+//# sourceMappingURL=hasher.d.ts.map

package/dest/trees/hasher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hasher.d.ts","sourceRoot":"","sources":["../../src/trees/hasher.ts"],"names":[],"mappings":";;AAAA;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB;;;;;OAKG;IACH,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM,CAAC;IAE/C;;;;OAIG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;CACtC;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;OAKG;IACH,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAExD;;;;OAIG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CAC/C"}

package/dest/trees/hasher.js

@@ -0,0 +1,5 @@
+/**
+ * Defines hasher interface used by Merkle trees.
+ */ /**
+ * Defines an async hasher interface used by Merkle trees.
+ */ export { };

package/dest/trees/index.d.ts

@@ -1,59 +1,11 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
 export * from './unbalanced_merkle_tree.js';
 export * from './unbalanced_tree_store.js';
-/**
- * A leaf of an indexed merkle tree.
- */
-export interface IndexedTreeLeaf {
-    /**
-     * Returns key of the leaf. It's used for indexing.
-     */
-    getKey(): bigint;
-    /**
-     * Serializes the leaf into a buffer.
-     */
-    toBuffer(): Buffer;
-    /**
-     * Returns true if the leaf is empty.
-     */
-    isEmpty(): boolean;
-    /**
-     * Updates the leaf with the data of another leaf.
-     * @param another - The leaf to update to.
-     * @returns The updated leaf.
-     */
-    updateTo(another: IndexedTreeLeaf): IndexedTreeLeaf;
-}
-/**
- * Preimage of a merkle tree leaf.
- */
-export interface TreeLeafPreimage {
-    /**
-     * Returns key of the leaf corresponding to this preimage.
-     */
-    getKey(): bigint;
-    /**
-     * Returns the preimage as a leaf.
-     */
-    asLeaf(): IndexedTreeLeaf;
-    /**
-     * Serializes the preimage into a buffer.
-     */
-    toBuffer(): Buffer;
-    /**
-     * Serializes the preimage to an array of buffers for hashing.
-     */
-    toHashInputs(): Buffer[];
-}
-/**
- * Preimage of an indexed merkle tree leaf.
- */
-export interface IndexedTreeLeafPreimage extends TreeLeafPreimage {
-    getNextKey(): bigint;
-    /**
-     * Returns the index of the next leaf.
-     */
-    getNextIndex(): bigint;
-}
+export * from './merkle_tree_calculator.js';
+export * from './merkle_tree.js';
+export * from './indexed_merkle_tree_calculator.js';
+export * from './indexed_merkle_tree.js';
+export * from './sibling_path.js';
+export * from './membership_witness.js';
+export * from './hasher.js';
+export * from './indexed_tree_leaf.js';
 //# sourceMappingURL=index.d.ts.map

package/dest/trees/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/trees/index.ts"],"names":[],"mappings":";;AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,4BAA4B,CAAC;AAE3C;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;OAEG;IACH,MAAM,IAAI,MAAM,CAAC;IACjB;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IACnB;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG,eAAe,CAAC;CACrD;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,MAAM,IAAI,MAAM,CAAC;IACjB;;OAEG;IACH,MAAM,IAAI,eAAe,CAAC;IAC1B;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IACnB;;OAEG;IACH,YAAY,IAAI,MAAM,EAAE,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,uBAAwB,SAAQ,gBAAgB;IAC/D,UAAU,IAAI,MAAM,CAAC;IACrB;;OAEG;IACH,YAAY,IAAI,MAAM,CAAC;CACxB"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/trees/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,4BAA4B,CAAC;AAC3C,cAAc,6BAA6B,CAAC;AAC5C,cAAc,kBAAkB,CAAC;AACjC,cAAc,qCAAqC,CAAC;AACpD,cAAc,0BAA0B,CAAC;AACzC,cAAc,mBAAmB,CAAC;AAClC,cAAc,yBAAyB,CAAC;AACxC,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC"}

package/dest/trees/index.js

@@ -1,3 +1,10 @@
 export * from './unbalanced_merkle_tree.js';
 export * from './unbalanced_tree_store.js';
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvdHJlZXMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyw2QkFBNkIsQ0FBQztBQUM1QyxjQUFjLDRCQUE0QixDQUFDIn0=
+export * from './merkle_tree_calculator.js';
+export * from './merkle_tree.js';
+export * from './indexed_merkle_tree_calculator.js';
+export * from './indexed_merkle_tree.js';
+export * from './sibling_path.js';
+export * from './membership_witness.js';
+export * from './hasher.js';
+export * from './indexed_tree_leaf.js';

package/dest/trees/indexed_merkle_tree.d.ts

@@ -0,0 +1,13 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import type { IndexedTreeLeafPreimage } from './indexed_tree_leaf.js';
+import { MembershipWitness } from './membership_witness.js';
+import { MerkleTree } from './merkle_tree.js';
+/** A simple immutable indexed merkle tree container. Use a IndexedMerkleTreeCalculator to create a new instance from a set of leaves. */
+export declare class IndexedMerkleTree<T extends IndexedTreeLeafPreimage, N extends number> extends MerkleTree {
+    readonly leafPreimages: T[];
+    constructor(height: N, nodes: Buffer[], leafPreimages: T[]);
+    getLowLeaf(value: bigint): T;
+    getMembershipWitness(leafIndexOrLeaf: number | Buffer): MembershipWitness<N>;
+}
+//# sourceMappingURL=indexed_merkle_tree.d.ts.map

package/dest/trees/indexed_merkle_tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexed_merkle_tree.d.ts","sourceRoot":"","sources":["../../src/trees/indexed_merkle_tree.ts"],"names":[],"mappings":";;AAEA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtE,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C,yIAAyI;AACzI,qBAAa,iBAAiB,CAAC,CAAC,SAAS,uBAAuB,EAAE,CAAC,SAAS,MAAM,CAAE,SAAQ,UAAU;aAC5C,aAAa,EAAE,CAAC,EAAE;gBAA9D,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAkB,aAAa,EAAE,CAAC,EAAE;IAInE,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAc5B,oBAAoB,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC;CASpF"}

package/dest/trees/indexed_merkle_tree.js

@@ -0,0 +1,27 @@
+import { Fr } from '../fields/index.js';
+import { assertLength } from '../serialize/index.js';
+import { MembershipWitness } from './membership_witness.js';
+import { MerkleTree } from './merkle_tree.js';
+/** A simple immutable indexed merkle tree container. Use a IndexedMerkleTreeCalculator to create a new instance from a set of leaves. */ export class IndexedMerkleTree extends MerkleTree {
+    leafPreimages;
+    constructor(height, nodes, leafPreimages){
+        super(height, nodes), this.leafPreimages = leafPreimages;
+    }
+    getLowLeaf(value) {
+        let lowLeaf;
+        this.leafPreimages.forEach((leaf)=>{
+            if (leaf.getKey() < value && (leaf.getNextKey() > value || leaf.getNextKey() == BigInt(0))) {
+                lowLeaf = leaf;
+            }
+        });
+        if (!lowLeaf) {
+            throw new Error(`Couldn't find low leaf for ${value}`);
+        }
+        return lowLeaf;
+    }
+    getMembershipWitness(leafIndexOrLeaf) {
+        const index = Buffer.isBuffer(leafIndexOrLeaf) ? this.getIndex(leafIndexOrLeaf) : leafIndexOrLeaf;
+        const siblingPath = this.getSiblingPath(index);
+        return new MembershipWitness(this.height, BigInt(index), assertLength(siblingPath.map(Fr.fromBuffer), this.height));
+    }
+}

package/dest/trees/indexed_merkle_tree_calculator.d.ts

@@ -0,0 +1,23 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import type { IndexedTreeLeafPreimage } from '@aztec/foundation/trees';
+import type { AsyncHasher } from './hasher.js';
+import { IndexedMerkleTree } from './indexed_merkle_tree.js';
+interface LeafPreimageFactory<T extends IndexedTreeLeafPreimage> {
+    fromBuffer(buffer: Buffer): T;
+}
+/**
+ * Indexed merkle tree calculator.
+ */
+export declare class IndexedMerkleTreeCalculator<T extends IndexedTreeLeafPreimage, N extends number> {
+    private height;
+    private zeroHashes;
+    private hasher;
+    private factory;
+    private constructor();
+    static create<T extends IndexedTreeLeafPreimage, N extends number>(height: N, hasher: AsyncHasher, factory: LeafPreimageFactory<T>, zeroLeaf?: Buffer): Promise<IndexedMerkleTreeCalculator<T, N>>;
+    computeTree(values: Buffer[]): Promise<IndexedMerkleTree<T, N>>;
+    computeTreeRoot(leaves?: Buffer[]): Promise<Buffer>;
+}
+export {};
+//# sourceMappingURL=indexed_merkle_tree_calculator.d.ts.map

package/dest/trees/indexed_merkle_tree_calculator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexed_merkle_tree_calculator.d.ts","sourceRoot":"","sources":["../../src/trees/indexed_merkle_tree_calculator.ts"],"names":[],"mappings":";;AAEA,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAEvE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAE7D,UAAU,mBAAmB,CAAC,CAAC,SAAS,uBAAuB;IAC7D,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC;CAC/B;AAED;;GAEG;AACH,qBAAa,2BAA2B,CAAC,CAAC,SAAS,uBAAuB,EAAE,CAAC,SAAS,MAAM;IAExF,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,OAAO;IAJjB,OAAO;WAOM,MAAM,CAAC,CAAC,SAAS,uBAAuB,EAAE,CAAC,SAAS,MAAM,EACrE,MAAM,EAAE,CAAC,EACT,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,mBAAmB,CAAC,CAAC,CAAC,EAC/B,QAAQ,SAAmB;IASvB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAuC/D,eAAe,CAAC,MAAM,GAAE,MAAM,EAAO,GAAG,OAAO,CAAC,MAAM,CAAC;CAmB9D"}

package/dest/trees/indexed_merkle_tree_calculator.js

@@ -0,0 +1,83 @@
+import { toBigIntBE } from '@aztec/foundation/bigint-buffer';
+import { numToUInt32BE } from '@aztec/foundation/serialize';
+import { IndexedMerkleTree } from './indexed_merkle_tree.js';
+/**
+ * Indexed merkle tree calculator.
+ */ export class IndexedMerkleTreeCalculator {
+    height;
+    zeroHashes;
+    hasher;
+    factory;
+    constructor(height, zeroHashes, hasher, factory){
+        this.height = height;
+        this.zeroHashes = zeroHashes;
+        this.hasher = hasher;
+        this.factory = factory;
+    }
+    static async create(height, hasher, factory, zeroLeaf = Buffer.alloc(32)) {
+        const zeroHashes = [
+            zeroLeaf
+        ];
+        for(let i = 0; i < height; i++){
+            zeroHashes.push(await hasher.hash(zeroHashes[i], zeroHashes[i]));
+        }
+        return new IndexedMerkleTreeCalculator(height, zeroHashes, hasher, factory);
+    }
+    async computeTree(values) {
+        if (!values.find((v)=>toBigIntBE(v) == BigInt(0))) {
+            // If we have no zero value, add one to form the zero leaf
+            values = [
+                Buffer.alloc(32),
+                ...values
+            ];
+        }
+        const sorted = values.map((v, i)=>({
+                value: v,
+                index: i
+            })).sort((a, b)=>Number(toBigIntBE(b.value) - toBigIntBE(a.value)));
+        const indexedLeaves = sorted.map((item, i)=>({
+                leaf: this.factory.fromBuffer(Buffer.concat([
+                    item.value,
+                    ...i == 0 ? [
+                        Buffer.alloc(32),
+                        Buffer.alloc(32)
+                    ] : [
+                        sorted[i - 1].value,
+                        numToUInt32BE(sorted[i - 1].index, 32)
+                    ]
+                ])),
+                index: item.index
+            }));
+        const resortedIndexedLeaves = indexedLeaves.sort((a, b)=>a.index - b.index).map((item)=>item.leaf);
+        let leaves = await Promise.all(resortedIndexedLeaves.map((l)=>this.hasher.hashInputs(l.toHashInputs())));
+        let result = leaves.slice();
+        for(let i = 0; i < this.height; ++i){
+            const numLeaves = 2 ** (this.height - i);
+            const newLeaves = [];
+            for(let j = 0; j < leaves.length / 2; ++j){
+                const l = leaves[j * 2];
+                const r = leaves[j * 2 + 1] || this.zeroHashes[i];
+                newLeaves[j] = await this.hasher.hash(l, r);
+            }
+            result = result.concat(new Array(numLeaves - leaves.length).fill(this.zeroHashes[i]), newLeaves);
+            leaves = newLeaves;
+        }
+        return new IndexedMerkleTree(this.height, result, resortedIndexedLeaves);
+    }
+    async computeTreeRoot(leaves = []) {
+        if (leaves.length === 0) {
+            return this.zeroHashes[this.zeroHashes.length - 1];
+        }
+        leaves = leaves.slice();
+        for(let i = 0; i < this.height; ++i){
+            let j = 0;
+            for(; j < leaves.length / 2; ++j){
+                const l = leaves[j * 2];
+                const r = leaves[j * 2 + 1] || this.zeroHashes[i];
+                leaves[j] = await this.hasher.hash(l, r);
+            }
+            leaves = leaves.slice(0, j);
+        }
+        return leaves[0];
+    }
+}

package/dest/trees/indexed_tree_leaf.d.ts

@@ -0,0 +1,57 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+/**
+ * A leaf of an indexed merkle tree.
+ */
+export interface IndexedTreeLeaf {
+    /**
+     * Returns key of the leaf. It's used for indexing.
+     */
+    getKey(): bigint;
+    /**
+     * Serializes the leaf into a buffer.
+     */
+    toBuffer(): Buffer;
+    /**
+     * Returns true if the leaf is empty.
+     */
+    isEmpty(): boolean;
+    /**
+     * Updates the leaf with the data of another leaf.
+     * @param another - The leaf to update to.
+     * @returns The updated leaf.
+     */
+    updateTo(another: IndexedTreeLeaf): IndexedTreeLeaf;
+}
+/**
+ * Preimage of a merkle tree leaf.
+ */
+export interface TreeLeafPreimage {
+    /**
+     * Returns key of the leaf corresponding to this preimage.
+     */
+    getKey(): bigint;
+    /**
+     * Returns the preimage as a leaf.
+     */
+    asLeaf(): IndexedTreeLeaf;
+    /**
+     * Serializes the preimage into a buffer.
+     */
+    toBuffer(): Buffer;
+    /**
+     * Serializes the preimage to an array of buffers for hashing.
+     */
+    toHashInputs(): Buffer[];
+}
+/**
+ * Preimage of an indexed merkle tree leaf.
+ */
+export interface IndexedTreeLeafPreimage extends TreeLeafPreimage {
+    getNextKey(): bigint;
+    /**
+     * Returns the index of the next leaf.
+     */
+    getNextIndex(): bigint;
+}
+//# sourceMappingURL=indexed_tree_leaf.d.ts.map

package/dest/trees/indexed_tree_leaf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexed_tree_leaf.d.ts","sourceRoot":"","sources":["../../src/trees/indexed_tree_leaf.ts"],"names":[],"mappings":";;AAAA;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;OAEG;IACH,MAAM,IAAI,MAAM,CAAC;IACjB;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IACnB;;OAEG;IACH,OAAO,IAAI,OAAO,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG,eAAe,CAAC;CACrD;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,MAAM,IAAI,MAAM,CAAC;IACjB;;OAEG;IACH,MAAM,IAAI,eAAe,CAAC;IAC1B;;OAEG;IACH,QAAQ,IAAI,MAAM,CAAC;IACnB;;OAEG;IACH,YAAY,IAAI,MAAM,EAAE,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,uBAAwB,SAAQ,gBAAgB;IAC/D,UAAU,IAAI,MAAM,CAAC;IACrB;;OAEG;IACH,YAAY,IAAI,MAAM,CAAC;CACxB"}

package/dest/trees/indexed_tree_leaf.js

@@ -0,0 +1,5 @@
+/**
+ * A leaf of an indexed merkle tree.
+ */ /**
+ * Preimage of an indexed merkle tree leaf.
+ */ export { };

package/dest/trees/membership_witness.d.ts

@@ -0,0 +1,62 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { Fr } from '../fields/fields.js';
+import { BufferReader, type Tuple } from '../serialize/index.js';
+import type { SiblingPath } from './sibling_path.js';
+/**
+ * Contains information which can be used to prove that a leaf is a member of a Merkle tree.
+ */
+export declare class MembershipWitness<N extends number> {
+    /**
+     * Index of a leaf in the Merkle tree.
+     */
+    leafIndex: bigint;
+    /**
+     * Sibling path of the leaf in the Merkle tree.
+     */
+    siblingPath: Tuple<Fr, N>;
+    constructor(
+    /**
+     * Size of the sibling path (number of fields it contains).
+     */
+    pathSize: N, 
+    /**
+     * Index of a leaf in the Merkle tree.
+     */
+    leafIndex: bigint, 
+    /**
+     * Sibling path of the leaf in the Merkle tree.
+     */
+    siblingPath: Tuple<Fr, N>);
+    toBuffer(): Buffer;
+    /**
+     * Creates a random membership witness. Used for testing purposes.
+     * @param pathSize - Number of fields in the sibling path.
+     * @returns Random membership witness.
+     */
+    static random<N extends number>(pathSize: N): MembershipWitness<N>;
+    /**
+     * Creates a membership witness whose sibling path is full of zero fields.
+     * @param pathSize - Number of fields in the sibling path.
+     * @param leafIndex - Index of the leaf in the Merkle tree.
+     * @returns Membership witness with zero sibling path.
+     */
+    static empty<N extends number>(pathSize: N, leafIndex?: bigint): MembershipWitness<N>;
+    static fromBufferArray<N extends number>(leafIndex: bigint, siblingPath: Tuple<Buffer, N>): MembershipWitness<N>;
+    /**
+     * Deserializes from a buffer or reader, corresponding to a write in cpp.
+     * @param buffer - Buffer or reader to read from.
+     * @returns The deserialized `MembershipWitness`.
+     */
+    static fromBuffer<N extends number>(buffer: Buffer | BufferReader, size: N): MembershipWitness<N>;
+    /**
+     * Creates a deserializer object for a MembershipWitness with a given size.
+     * @param size - Expected size of the witness.
+     * @returns A deserializer object.
+     */
+    static deserializer<N extends number>(size: N): {
+        fromBuffer(buffer: Buffer | BufferReader): MembershipWitness<N>;
+    };
+    static fromSiblingPath<N extends number>(leafIndex: bigint, siblingPath: SiblingPath<N>): MembershipWitness<N>;
+}
+//# sourceMappingURL=membership_witness.d.ts.map

package/dest/trees/membership_witness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"membership_witness.d.ts","sourceRoot":"","sources":["../../src/trees/membership_witness.ts"],"names":[],"mappings":";;AAEA,OAAO,EAAE,EAAE,EAAE,MAAM,qBAAqB,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,KAAK,KAAK,EAAqB,MAAM,uBAAuB,CAAC;AACpF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErD;;GAEG;AACH,qBAAa,iBAAiB,CAAC,CAAC,SAAS,MAAM;IAM3C;;OAEG;IACI,SAAS,EAAE,MAAM;IACxB;;OAEG;IACI,WAAW,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;;IAXhC;;OAEG;IACH,QAAQ,EAAE,CAAC;IACX;;OAEG;IACI,SAAS,EAAE,MAAM;IACxB;;OAEG;IACI,WAAW,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IAKlC,QAAQ;IAIR;;;;OAIG;WACW,MAAM,CAAC,CAAC,SAAS,MAAM,EAAE,QAAQ,EAAE,CAAC;IAUlD;;;;;OAKG;WACW,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,SAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC;IAOxF,MAAM,CAAC,eAAe,CAAC,CAAC,SAAS,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC;IAQhH;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE,IAAI,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC;IAOjG;;;;OAIG;IACH,MAAM,CAAC,YAAY,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG;QAAE,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;KAAE;IAWnH,MAAM,CAAC,eAAe,CAAC,CAAC,SAAS,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC;CAG/G"}