@aztec/stdlib 0.77.0-testnet-ignition.17

package/dest/parity/root_parity_input.js

@@ -0,0 +1,50 @@
+import { VK_TREE_HEIGHT } from '@aztec/constants';
+import { Fr } from '@aztec/foundation/fields';
+import { schemas } from '@aztec/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
+import { RecursiveProof } from '../proofs/recursive_proof.js';
+import { VerificationKeyAsFields } from '../vks/verification_key.js';
+import { ParityPublicInputs } from './parity_public_inputs.js';
+export class RootParityInput {
+    proof;
+    verificationKey;
+    vkPath;
+    publicInputs;
+    constructor(/** The proof of the execution of the parity circuit. */ proof, /** The circuit's verification key */ verificationKey, /** The vk path in the vk tree*/ vkPath, /** The public inputs of the parity circuit. */ publicInputs){
+        this.proof = proof;
+        this.verificationKey = verificationKey;
+        this.vkPath = vkPath;
+        this.publicInputs = publicInputs;
+    }
+    toBuffer() {
+        return serializeToBuffer(...RootParityInput.getFields(this));
+    }
+    toString() {
+        return bufferToHex(this.toBuffer());
+    }
+    static from(fields) {
+        return new RootParityInput(...RootParityInput.getFields(fields));
+    }
+    static getFields(fields) {
+        return [
+            fields.proof,
+            fields.verificationKey,
+            fields.vkPath,
+            fields.publicInputs
+        ];
+    }
+    static fromBuffer(buffer, expectedSize) {
+        const reader = BufferReader.asReader(buffer);
+        return new RootParityInput(RecursiveProof.fromBuffer(reader, expectedSize), reader.readObject(VerificationKeyAsFields), reader.readArray(VK_TREE_HEIGHT, Fr), reader.readObject(ParityPublicInputs));
+    }
+    static fromString(str, expectedSize) {
+        return RootParityInput.fromBuffer(hexToBuffer(str), expectedSize);
+    }
+    /** Returns a hex representation for JSON serialization. */ toJSON() {
+        return this.toBuffer();
+    }
+    /** Creates an instance from a hex string with expected size. */ static schemaFor(expectedSize) {
+        return schemas.Buffer.transform((buf)=>RootParityInput.fromBuffer(buf, expectedSize));
+    }
+}

package/dest/parity/root_parity_inputs.d.ts

@@ -0,0 +1,39 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { NUM_BASE_PARITY_PER_ROOT_PARITY, RECURSIVE_PROOF_LENGTH } from '@aztec/constants';
+import { BufferReader, type Tuple } from '@aztec/foundation/serialize';
+import { RootParityInput } from './root_parity_input.js';
+export declare class RootParityInputs {
+    /** Public inputs of children and their proofs. */
+    readonly children: Tuple<RootParityInput<typeof RECURSIVE_PROOF_LENGTH>, typeof NUM_BASE_PARITY_PER_ROOT_PARITY>;
+    constructor(
+    /** Public inputs of children and their proofs. */
+    children: Tuple<RootParityInput<typeof RECURSIVE_PROOF_LENGTH>, typeof NUM_BASE_PARITY_PER_ROOT_PARITY>);
+    /**
+     * Serializes the inputs to a buffer.
+     * @returns The inputs serialized to a buffer.
+     */
+    toBuffer(): Buffer;
+    /**
+     * Serializes the inputs to a hex string.
+     * @returns The instance serialized to a hex string.
+     */
+    toString(): `0x${string}`;
+    /**
+     * Deserializes the inputs from a buffer.
+     * @param buffer - The buffer to deserialize from.
+     * @returns A new RootParityInputs instance.
+     */
+    static fromBuffer(buffer: Buffer | BufferReader): RootParityInputs;
+    /**
+     * Deserializes the inputs from a hex string.
+     * @param str - A hex string to deserialize from.
+     * @returns A new RootParityInputs instance.
+     */
+    static fromString(str: string): RootParityInputs;
+    /** Returns a buffer representation for JSON serialization. */
+    toJSON(): Buffer;
+    /** Creates an instance from a hex string. */
+    static get schema(): import("zod").ZodType<RootParityInputs, any, string>;
+}
+//# sourceMappingURL=root_parity_inputs.d.ts.map

package/dest/parity/root_parity_inputs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"root_parity_inputs.d.ts","sourceRoot":"","sources":["../../src/parity/root_parity_inputs.ts"],"names":[],"mappings":";;AAAA,OAAO,EAAE,+BAA+B,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAE3F,OAAO,EAAE,YAAY,EAAE,KAAK,KAAK,EAAqB,MAAM,6BAA6B,CAAC;AAG1F,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAEzD,qBAAa,gBAAgB;IAEzB,kDAAkD;aAClC,QAAQ,EAAE,KAAK,CAC7B,eAAe,CAAC,OAAO,sBAAsB,CAAC,EAC9C,OAAO,+BAA+B,CACvC;;IAJD,kDAAkD;IAClC,QAAQ,EAAE,KAAK,CAC7B,eAAe,CAAC,OAAO,sBAAsB,CAAC,EAC9C,OAAO,+BAA+B,CACvC;IAGH;;;OAGG;IACH,QAAQ;IAIR;;;OAGG;IACH,QAAQ;IAIR;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAU/C;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM;IAI7B,8DAA8D;IAC9D,MAAM;IAIN,6CAA6C;IAC7C,MAAM,KAAK,MAAM,yDAEhB;CACF"}

package/dest/parity/root_parity_inputs.js

@@ -0,0 +1,47 @@
+import { NUM_BASE_PARITY_PER_ROOT_PARITY, RECURSIVE_PROOF_LENGTH } from '@aztec/constants';
+import { bufferSchemaFor } from '@aztec/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
+import { RootParityInput } from './root_parity_input.js';
+export class RootParityInputs {
+    children;
+    constructor(/** Public inputs of children and their proofs. */ children){
+        this.children = children;
+    }
+    /**
+   * Serializes the inputs to a buffer.
+   * @returns The inputs serialized to a buffer.
+   */ toBuffer() {
+        return serializeToBuffer(...this.children);
+    }
+    /**
+   * Serializes the inputs to a hex string.
+   * @returns The instance serialized to a hex string.
+   */ toString() {
+        return bufferToHex(this.toBuffer());
+    }
+    /**
+   * Deserializes the inputs from a buffer.
+   * @param buffer - The buffer to deserialize from.
+   * @returns A new RootParityInputs instance.
+   */ static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        const tuple = Array.from({
+            length: NUM_BASE_PARITY_PER_ROOT_PARITY
+        }, ()=>RootParityInput.fromBuffer(reader, RECURSIVE_PROOF_LENGTH));
+        return new RootParityInputs(tuple);
+    }
+    /**
+   * Deserializes the inputs from a hex string.
+   * @param str - A hex string to deserialize from.
+   * @returns A new RootParityInputs instance.
+   */ static fromString(str) {
+        return RootParityInputs.fromBuffer(hexToBuffer(str));
+    }
+    /** Returns a buffer representation for JSON serialization. */ toJSON() {
+        return this.toBuffer();
+    }
+    /** Creates an instance from a hex string. */ static get schema() {
+        return bufferSchemaFor(RootParityInputs);
+    }
+}

package/dest/proofs/client_ivc_proof.d.ts

@@ -0,0 +1,21 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { BufferReader } from '@aztec/foundation/serialize';
+/**
+ * TODO(https://github.com/AztecProtocol/aztec-packages/issues/7370) refactor this to
+ * eventually we read all these VKs from the data tree instead of passing them
+ */
+export declare class ClientIvcProof {
+    clientIvcProofBuffer: Buffer;
+    clientIvcVkBuffer: Buffer;
+    constructor(clientIvcProofBuffer: Buffer, clientIvcVkBuffer: Buffer);
+    isEmpty(): boolean;
+    static empty(): ClientIvcProof;
+    static fake(fill?: number): ClientIvcProof;
+    static random(): ClientIvcProof;
+    static get schema(): import("zod").ZodType<ClientIvcProof, any, string>;
+    toJSON(): Buffer;
+    static fromBuffer(buffer: Buffer | BufferReader): ClientIvcProof;
+    toBuffer(): Buffer;
+}
+//# sourceMappingURL=client_ivc_proof.d.ts.map

package/dest/proofs/client_ivc_proof.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client_ivc_proof.d.ts","sourceRoot":"","sources":["../../src/proofs/client_ivc_proof.ts"],"names":[],"mappings":";;AAEA,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAK9E;;;GAGG;AACH,qBAAa,cAAc;IAKhB,oBAAoB,EAAE,MAAM;IAC5B,iBAAiB,EAAE,MAAM;gBADzB,oBAAoB,EAAE,MAAM,EAC5B,iBAAiB,EAAE,MAAM;IAG3B,OAAO;IAId,MAAM,CAAC,KAAK;IAIZ,MAAM,CAAC,IAAI,CAAC,IAAI,SAAkC;IAIlD,MAAM,CAAC,MAAM;IAOb,MAAM,KAAK,MAAM,uDAEhB;IAED,MAAM;IAIN,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,cAAc;IAKzD,QAAQ;CAQhB"}

package/dest/proofs/client_ivc_proof.js

@@ -0,0 +1,44 @@
+import { randomBytes } from '@aztec/foundation/crypto';
+import { bufferSchemaFor } from '@aztec/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+const CLIENT_IVC_PROOF_LENGTH = 172052;
+const CLIENT_IVC_VK_LENGTH = 2730;
+/**
+ * TODO(https://github.com/AztecProtocol/aztec-packages/issues/7370) refactor this to
+ * eventually we read all these VKs from the data tree instead of passing them
+ */ export class ClientIvcProof {
+    clientIvcProofBuffer;
+    clientIvcVkBuffer;
+    constructor(// produced by the sequencer when making the tube proof
+    // TODO(https://github.com/AztecProtocol/aztec-packages/issues/7370): Need to precompute private kernel tail VK so we can verify this immediately in the tx pool
+    // which parts of these are needed to quickly verify that we have a correct IVC proof
+    clientIvcProofBuffer, clientIvcVkBuffer){
+        this.clientIvcProofBuffer = clientIvcProofBuffer;
+        this.clientIvcVkBuffer = clientIvcVkBuffer;
+    }
+    isEmpty() {
+        return this.clientIvcProofBuffer.length === 0;
+    }
+    static empty() {
+        return new ClientIvcProof(Buffer.from(''), Buffer.from(''));
+    }
+    static fake(fill = Math.floor(Math.random() * 255)) {
+        return new ClientIvcProof(Buffer.alloc(1, fill), Buffer.alloc(1, fill));
+    }
+    static random() {
+        return new ClientIvcProof(Buffer.from(randomBytes(CLIENT_IVC_PROOF_LENGTH)), Buffer.from(randomBytes(CLIENT_IVC_VK_LENGTH)));
+    }
+    static get schema() {
+        return bufferSchemaFor(ClientIvcProof);
+    }
+    toJSON() {
+        return this.toBuffer();
+    }
+    static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        return new ClientIvcProof(reader.readBuffer(), reader.readBuffer());
+    }
+    toBuffer() {
+        return serializeToBuffer(this.clientIvcProofBuffer.length, this.clientIvcProofBuffer, this.clientIvcVkBuffer.length, this.clientIvcVkBuffer);
+    }
+}

package/dest/proofs/index.d.ts

@@ -0,0 +1,5 @@
+export * from './recursive_proof.js';
+export * from './client_ivc_proof.js';
+export * from './proof.js';
+export * from './proving_request_type.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/proofs/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC;AACtC,cAAc,YAAY,CAAC;AAC3B,cAAc,2BAA2B,CAAC"}

package/dest/proofs/index.js

@@ -0,0 +1,4 @@
+export * from './recursive_proof.js';
+export * from './client_ivc_proof.js';
+export * from './proof.js';
+export * from './proving_request_type.js';

package/dest/proofs/proof.d.ts

@@ -0,0 +1,65 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { Fr } from '@aztec/foundation/fields';
+import { BufferReader } from '@aztec/foundation/serialize';
+/**
+ * The Proof class is a wrapper around the circuits proof.
+ * Underlying it is a buffer of proof data in a form a barretenberg prover understands.
+ * It provides methods to easily create, serialize, and deserialize the proof data for efficient
+ * communication and storage.
+ */
+export declare class Proof {
+    /**
+     * Holds the serialized proof data in a binary buffer format.
+     */
+    buffer: Buffer;
+    numPublicInputs: number;
+    readonly __proofBrand: any;
+    private readonly metadataOffset;
+    private readonly publicInputsOffset;
+    constructor(
+    /**
+     * Holds the serialized proof data in a binary buffer format.
+     */
+    buffer: Buffer, numPublicInputs: number);
+    /**
+     * Create a Proof from a Buffer or BufferReader.
+     * Expects a length-encoding.
+     *
+     * @param buffer - A Buffer or BufferReader containing the length-encoded proof data.
+     * @returns A Proof instance containing the decoded proof data.
+     */
+    static fromBuffer(buffer: Buffer | BufferReader): Proof;
+    /**
+     * Convert the Proof instance to a custom Buffer format.
+     * This function serializes the Proof's buffer length and data sequentially into a new Buffer.
+     *
+     * @returns A Buffer containing the serialized proof data in custom format.
+     */
+    toBuffer(): Buffer;
+    /**
+     * Serialize the Proof instance to a hex string.
+     * @returns The hex string representation of the proof data.
+     */
+    toString(): `0x${string}`;
+    withoutPublicInputs(): Buffer;
+    extractPublicInputs(): Fr[];
+    extractAggregationObject(): Fr[];
+    /**
+     * Deserialize a Proof instance from a hex string.
+     * @param str - A hex string to deserialize from.
+     * @returns - A new Proof instance.
+     */
+    static fromString(str: string): Proof;
+    /** Returns whether this proof is actually empty. */
+    isEmpty(): boolean;
+    /** Returns an empty proof. */
+    static empty(): Proof;
+}
+/**
+ * Makes an empty proof.
+ * Note: Used for local devnet milestone where we are not proving anything yet.
+ * @returns The empty "proof".
+ */
+export declare function makeEmptyProof(): Proof;
+//# sourceMappingURL=proof.d.ts.map

package/dest/proofs/proof.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proof.d.ts","sourceRoot":"","sources":["../../src/proofs/proof.ts"],"names":[],"mappings":";;AACA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAK9E;;;;;GAKG;AACH,qBAAa,KAAK;IAYd;;OAEG;IACI,MAAM,EAAE,MAAM;IAEd,eAAe,EAAE,MAAM;IAfhC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC;IAI3B,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAK;IAGpC,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAO;;IAGxC;;OAEG;IACI,MAAM,EAAE,MAAM,EAEd,eAAe,EAAE,MAAM;IAGhC;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,KAAK;IAQvD;;;;;OAKG;IACI,QAAQ;IAIf;;;OAGG;IACI,QAAQ;IAIR,mBAAmB,IAAI,MAAM;IAO7B,mBAAmB,IAAI,EAAE,EAAE;IAO3B,wBAAwB,IAAI,EAAE,EAAE;IAKvC;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM;IAI7B,oDAAoD;IAC7C,OAAO;IAMd,8BAA8B;IAC9B,MAAM,CAAC,KAAK;CAGb;AAED;;;;GAIG;AACH,wBAAgB,cAAc,UAE7B"}

package/dest/proofs/proof.js

@@ -0,0 +1,91 @@
+import { AGGREGATION_OBJECT_LENGTH } from '@aztec/constants';
+import { Fr } from '@aztec/foundation/fields';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
+const EMPTY_PROOF_SIZE = 42;
+/**
+ * The Proof class is a wrapper around the circuits proof.
+ * Underlying it is a buffer of proof data in a form a barretenberg prover understands.
+ * It provides methods to easily create, serialize, and deserialize the proof data for efficient
+ * communication and storage.
+ */ export class Proof {
+    buffer;
+    numPublicInputs;
+    // Make sure this type is not confused with other buffer wrappers
+    __proofBrand;
+    // Honk proofs start with a 4 byte length prefix
+    // the proof metadata starts immediately after
+    metadataOffset;
+    // the metadata is 3 Frs long
+    // the public inputs are after it
+    publicInputsOffset;
+    constructor(/**
+     * Holds the serialized proof data in a binary buffer format.
+     */ buffer, numPublicInputs){
+        this.buffer = buffer;
+        this.numPublicInputs = numPublicInputs;
+        this.metadataOffset = 4;
+        this.publicInputsOffset = 100;
+    }
+    /**
+   * Create a Proof from a Buffer or BufferReader.
+   * Expects a length-encoding.
+   *
+   * @param buffer - A Buffer or BufferReader containing the length-encoded proof data.
+   * @returns A Proof instance containing the decoded proof data.
+   */ static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        const size = reader.readNumber();
+        const buf = reader.readBytes(size);
+        const numPublicInputs = reader.readNumber();
+        return new Proof(buf, numPublicInputs);
+    }
+    /**
+   * Convert the Proof instance to a custom Buffer format.
+   * This function serializes the Proof's buffer length and data sequentially into a new Buffer.
+   *
+   * @returns A Buffer containing the serialized proof data in custom format.
+   */ toBuffer() {
+        return serializeToBuffer(this.buffer.length, this.buffer, this.numPublicInputs);
+    }
+    /**
+   * Serialize the Proof instance to a hex string.
+   * @returns The hex string representation of the proof data.
+   */ toString() {
+        return bufferToHex(this.toBuffer());
+    }
+    withoutPublicInputs() {
+        return Buffer.concat([
+            this.buffer.subarray(this.metadataOffset, this.publicInputsOffset),
+            this.buffer.subarray(this.publicInputsOffset + Fr.SIZE_IN_BYTES * this.numPublicInputs)
+        ]);
+    }
+    extractPublicInputs() {
+        const reader = BufferReader.asReader(this.buffer.subarray(this.publicInputsOffset, this.publicInputsOffset + Fr.SIZE_IN_BYTES * this.numPublicInputs));
+        return reader.readArray(this.numPublicInputs, Fr);
+    }
+    extractAggregationObject() {
+        const publicInputs = this.extractPublicInputs();
+        return publicInputs.slice(-1 * AGGREGATION_OBJECT_LENGTH);
+    }
+    /**
+   * Deserialize a Proof instance from a hex string.
+   * @param str - A hex string to deserialize from.
+   * @returns - A new Proof instance.
+   */ static fromString(str) {
+        return Proof.fromBuffer(hexToBuffer(str));
+    }
+    /** Returns whether this proof is actually empty. */ isEmpty() {
+        return this.buffer.length === EMPTY_PROOF_SIZE && this.buffer.every((byte)=>byte === 0) && this.numPublicInputs === 0;
+    }
+    /** Returns an empty proof. */ static empty() {
+        return makeEmptyProof();
+    }
+}
+/**
+ * Makes an empty proof.
+ * Note: Used for local devnet milestone where we are not proving anything yet.
+ * @returns The empty "proof".
+ */ export function makeEmptyProof() {
+    return new Proof(Buffer.alloc(EMPTY_PROOF_SIZE, 0), 0);
+}

package/dest/proofs/proving_request_type.d.ts

@@ -0,0 +1,16 @@
+export declare enum ProvingRequestType {
+    PUBLIC_VM = 0,
+    PRIVATE_BASE_ROLLUP = 1,
+    PUBLIC_BASE_ROLLUP = 2,
+    MERGE_ROLLUP = 3,
+    EMPTY_BLOCK_ROOT_ROLLUP = 4,
+    BLOCK_ROOT_ROLLUP = 5,
+    SINGLE_TX_BLOCK_ROOT_ROLLUP = 6,
+    BLOCK_MERGE_ROLLUP = 7,
+    ROOT_ROLLUP = 8,
+    BASE_PARITY = 9,
+    ROOT_PARITY = 10,
+    /** Recursive Client IVC verification to connect private to public or rollup */
+    TUBE_PROOF = 11
+}
+//# sourceMappingURL=proving_request_type.d.ts.map

package/dest/proofs/proving_request_type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proving_request_type.d.ts","sourceRoot":"","sources":["../../src/proofs/proving_request_type.ts"],"names":[],"mappings":"AAAA,oBAAY,kBAAkB;IAC5B,SAAS,IAAA;IAET,mBAAmB,IAAA;IACnB,kBAAkB,IAAA;IAClB,YAAY,IAAA;IACZ,uBAAuB,IAAA;IACvB,iBAAiB,IAAA;IACjB,2BAA2B,IAAA;IAC3B,kBAAkB,IAAA;IAClB,WAAW,IAAA;IAEX,WAAW,IAAA;IACX,WAAW,KAAA;IACX,+EAA+E;IAC/E,UAAU,KAAA;CACX"}

package/dest/proofs/proving_request_type.js

@@ -0,0 +1,15 @@
+export var ProvingRequestType = /*#__PURE__*/ function(ProvingRequestType) {
+    ProvingRequestType[ProvingRequestType["PUBLIC_VM"] = 0] = "PUBLIC_VM";
+    ProvingRequestType[ProvingRequestType["PRIVATE_BASE_ROLLUP"] = 1] = "PRIVATE_BASE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["PUBLIC_BASE_ROLLUP"] = 2] = "PUBLIC_BASE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["MERGE_ROLLUP"] = 3] = "MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["EMPTY_BLOCK_ROOT_ROLLUP"] = 4] = "EMPTY_BLOCK_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_ROLLUP"] = 5] = "BLOCK_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["SINGLE_TX_BLOCK_ROOT_ROLLUP"] = 6] = "SINGLE_TX_BLOCK_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_MERGE_ROLLUP"] = 7] = "BLOCK_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["ROOT_ROLLUP"] = 8] = "ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BASE_PARITY"] = 9] = "BASE_PARITY";
+    ProvingRequestType[ProvingRequestType["ROOT_PARITY"] = 10] = "ROOT_PARITY";
+    /** Recursive Client IVC verification to connect private to public or rollup */ ProvingRequestType[ProvingRequestType["TUBE_PROOF"] = 11] = "TUBE_PROOF";
+    return ProvingRequestType;
+}({});

package/dest/proofs/recursive_proof.d.ts

@@ -0,0 +1,101 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { Fr } from '@aztec/foundation/fields';
+import { BufferReader } from '@aztec/foundation/serialize';
+import { Proof } from './proof.js';
+/**
+ * The Recursive proof class is a wrapper around the circuit's proof.
+ * We store the proof in 2 forms for convenience. The first is in the 'fields' format.
+ * This is a list of fields, for which there are distinct lengths based on the level of recursion.
+ * This 'fields' version does not contain the circuits public inputs
+ * We also store the raw binary proof which van be directly verified.
+ *
+ * The 'fieldsValid' member is set to false in the case where this object is constructed solely from the 'binary' proof
+ * This is usually when the proof has been received from clients and signals to provers that the 'fields' version needs to be generated
+ */
+export declare class RecursiveProof<N extends number> {
+    /**
+     * Holds the serialized proof data in an array of fields, this is without the public inputs
+     */
+    proof: Fr[];
+    /**
+     * Holds the serialized proof data in a binary buffer, this contains the public inputs
+     */
+    binaryProof: Proof;
+    /**
+     * This flag determines if the 'proof' member is valid, or if we need to generate it from the 'binaryProof' first
+     */
+    fieldsValid: boolean;
+    proofLength: N;
+    constructor(
+    /**
+     * Holds the serialized proof data in an array of fields, this is without the public inputs
+     */
+    proof: Fr[], 
+    /**
+     * Holds the serialized proof data in a binary buffer, this contains the public inputs
+     */
+    binaryProof: Proof, 
+    /**
+     * This flag determines if the 'proof' member is valid, or if we need to generate it from the 'binaryProof' first
+     */
+    fieldsValid: boolean, proofLength: N);
+    /**
+     * Create a Proof from a Buffer or BufferReader.
+     * Expects a length-encoding.
+     *
+     * @param buffer - A Buffer or BufferReader containing the length-encoded proof data.
+     * @returns A Proof instance containing the decoded proof data.
+     */
+    static fromBuffer<N extends number>(buffer: Buffer | BufferReader, expectedSize?: N): RecursiveProof<N>;
+    /**
+     * Convert the Proof instance to a custom Buffer format.
+     * This function serializes the Proof's buffer length and data sequentially into a new Buffer.
+     *
+     * @returns A Buffer containing the serialized proof data in custom format.
+     */
+    toBuffer(): Buffer;
+    /**
+     * Serialize the Proof instance to a hex string.
+     * @returns The hex string representation of the proof data.
+     */
+    toString(): `0x${string}`;
+    /**
+     * Deserialize a Proof instance from a hex string.
+     * @param str - A hex string to deserialize from.
+     * @returns - A new Proof instance.
+     */
+    static fromString<N extends number>(str: string, expectedSize?: N): RecursiveProof<N>;
+    /** Returns a buffer representation for JSON serialization. */
+    toJSON(): Buffer;
+    /** Creates an instance from a hex string with expected size. */
+    static schemaFor<N extends number>(expectedSize?: N): import("zod").ZodEffects<import("zod").ZodUnion<[import("zod").ZodEffects<import("zod").ZodEffects<import("zod").ZodString, string, string>, Buffer, string>, import("zod").ZodEffects<import("zod").ZodObject<{
+        type: import("zod").ZodLiteral<"Buffer">;
+        data: import("zod").ZodArray<import("zod").ZodNumber, "many">;
+    }, "strip", import("zod").ZodTypeAny, {
+        type: "Buffer";
+        data: number[];
+    }, {
+        type: "Buffer";
+        data: number[];
+    }>, Buffer, {
+        type: "Buffer";
+        data: number[];
+    }>]>, RecursiveProof<N>, string | {
+        type: "Buffer";
+        data: number[];
+    }>;
+}
+/**
+ * Makes an empty proof.
+ * Note: Used for local devnet milestone where we are not proving anything yet.
+ * @returns The empty "proof".
+ */
+export declare function makeEmptyRecursiveProof<N extends number>(size: N): RecursiveProof<N>;
+export declare function makeRecursiveProof<PROOF_LENGTH extends number>(size: PROOF_LENGTH, seed?: number): RecursiveProof<PROOF_LENGTH>;
+/**
+ * Makes an instance of the recursive proof from a binary only proof
+ * @returns The proof object
+ */
+export declare function makeRecursiveProofFromBinary<PROOF_LENGTH extends number>(proof: Proof, size: PROOF_LENGTH): RecursiveProof<PROOF_LENGTH>;
+//# sourceMappingURL=recursive_proof.d.ts.map

package/dest/proofs/recursive_proof.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive_proof.d.ts","sourceRoot":"","sources":["../../src/proofs/recursive_proof.ts"],"names":[],"mappings":";;AACA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAG9E,OAAO,EAAE,KAAK,EAAkB,MAAM,YAAY,CAAC;AAEnD;;;;;;;;;GASG;AACH,qBAAa,cAAc,CAAC,CAAC,SAAS,MAAM;IAExC;;OAEG;IACI,KAAK,EAAE,EAAE,EAAE;IAElB;;OAEG;IACI,WAAW,EAAE,KAAK;IACzB;;OAEG;IACI,WAAW,EAAE,OAAO;IACpB,WAAW,EAAE,CAAC;;IAbrB;;OAEG;IACI,KAAK,EAAE,EAAE,EAAE;IAElB;;OAEG;IACI,WAAW,EAAE,KAAK;IACzB;;OAEG;IACI,WAAW,EAAE,OAAO,EACpB,WAAW,EAAE,CAAC;IAOvB;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE,YAAY,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;IAcvG;;;;;OAKG;IACI,QAAQ;IAIf;;;OAGG;IACI,QAAQ;IAIf;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;IAIrF,8DAA8D;IAC9D,MAAM;IAIN,gEAAgE;IAChE,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC;;;;;;;;;;;;;;;;CAGpD;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,qBAEhE;AAED,wBAAgB,kBAAkB,CAAC,YAAY,SAAS,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,SAAI,gCAO3F;AAED;;;GAGG;AACH,wBAAgB,4BAA4B,CAAC,YAAY,SAAS,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,gCAEzG"}

package/dest/proofs/recursive_proof.js

@@ -0,0 +1,93 @@
+import { makeTuple } from '@aztec/foundation/array';
+import { Fr } from '@aztec/foundation/fields';
+import { schemas } from '@aztec/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
+import { Proof, makeEmptyProof } from './proof.js';
+/**
+ * The Recursive proof class is a wrapper around the circuit's proof.
+ * We store the proof in 2 forms for convenience. The first is in the 'fields' format.
+ * This is a list of fields, for which there are distinct lengths based on the level of recursion.
+ * This 'fields' version does not contain the circuits public inputs
+ * We also store the raw binary proof which van be directly verified.
+ *
+ * The 'fieldsValid' member is set to false in the case where this object is constructed solely from the 'binary' proof
+ * This is usually when the proof has been received from clients and signals to provers that the 'fields' version needs to be generated
+ */ export class RecursiveProof {
+    proof;
+    binaryProof;
+    fieldsValid;
+    proofLength;
+    constructor(/**
+     * Holds the serialized proof data in an array of fields, this is without the public inputs
+     */ proof, /**
+     * Holds the serialized proof data in a binary buffer, this contains the public inputs
+     */ binaryProof, /**
+     * This flag determines if the 'proof' member is valid, or if we need to generate it from the 'binaryProof' first
+     */ fieldsValid, proofLength){
+        this.proof = proof;
+        this.binaryProof = binaryProof;
+        this.fieldsValid = fieldsValid;
+        this.proofLength = proofLength;
+        if (proof.length !== proofLength) {
+            throw new Error(`Proof length ${proof.length} does not match expected length ${proofLength}.`);
+        }
+    }
+    /**
+   * Create a Proof from a Buffer or BufferReader.
+   * Expects a length-encoding.
+   *
+   * @param buffer - A Buffer or BufferReader containing the length-encoded proof data.
+   * @returns A Proof instance containing the decoded proof data.
+   */ static fromBuffer(buffer, expectedSize) {
+        const reader = BufferReader.asReader(buffer);
+        const size = reader.readNumber();
+        if (typeof expectedSize === 'number' && expectedSize !== size) {
+            throw new Error(`Expected proof length ${expectedSize}, got ${size}`);
+        }
+        return new RecursiveProof(reader.readArray(size, Fr), Proof.fromBuffer(reader), reader.readBoolean(), size);
+    }
+    /**
+   * Convert the Proof instance to a custom Buffer format.
+   * This function serializes the Proof's buffer length and data sequentially into a new Buffer.
+   *
+   * @returns A Buffer containing the serialized proof data in custom format.
+   */ toBuffer() {
+        return serializeToBuffer(this.proof.length, this.proof, this.binaryProof, this.fieldsValid);
+    }
+    /**
+   * Serialize the Proof instance to a hex string.
+   * @returns The hex string representation of the proof data.
+   */ toString() {
+        return bufferToHex(this.toBuffer());
+    }
+    /**
+   * Deserialize a Proof instance from a hex string.
+   * @param str - A hex string to deserialize from.
+   * @returns - A new Proof instance.
+   */ static fromString(str, expectedSize) {
+        return RecursiveProof.fromBuffer(hexToBuffer(str), expectedSize);
+    }
+    /** Returns a buffer representation for JSON serialization. */ toJSON() {
+        return this.toBuffer();
+    }
+    /** Creates an instance from a hex string with expected size. */ static schemaFor(expectedSize) {
+        return schemas.Buffer.transform((b)=>RecursiveProof.fromBuffer(b, expectedSize));
+    }
+}
+/**
+ * Makes an empty proof.
+ * Note: Used for local devnet milestone where we are not proving anything yet.
+ * @returns The empty "proof".
+ */ export function makeEmptyRecursiveProof(size) {
+    return new RecursiveProof(makeTuple(size, Fr.zero), makeEmptyProof(), true, size);
+}
+export function makeRecursiveProof(size, seed = 1) {
+    return new RecursiveProof(makeTuple(size, (i)=>new Fr(i), seed), makeEmptyProof(), true, size);
+}
+/**
+ * Makes an instance of the recursive proof from a binary only proof
+ * @returns The proof object
+ */ export function makeRecursiveProofFromBinary(proof, size) {
+    return new RecursiveProof(makeTuple(size, Fr.zero), proof, false, size);
+}

package/dest/rollup/avm_proof_data.d.ts

@@ -0,0 +1,17 @@
+/// <reference types="node" resolution-mode="require"/>
+/// <reference types="node" resolution-mode="require"/>
+import { AVM_PROOF_LENGTH_IN_FIELDS } from '@aztec/constants';
+import { BufferReader } from '@aztec/foundation/serialize';
+import { AvmCircuitPublicInputs } from '../avm/avm_circuit_public_inputs.js';
+import { RecursiveProof } from '../proofs/recursive_proof.js';
+import { VkWitnessData } from '../vks/vk_witness_data.js';
+export declare class AvmProofData {
+    publicInputs: AvmCircuitPublicInputs;
+    proof: RecursiveProof<typeof AVM_PROOF_LENGTH_IN_FIELDS>;
+    vkData: VkWitnessData;
+    constructor(publicInputs: AvmCircuitPublicInputs, proof: RecursiveProof<typeof AVM_PROOF_LENGTH_IN_FIELDS>, vkData: VkWitnessData);
+    static fromBuffer(buffer: Buffer | BufferReader): AvmProofData;
+    toBuffer(): Buffer;
+    static empty(): AvmProofData;
+}
+//# sourceMappingURL=avm_proof_data.d.ts.map

package/dest/rollup/avm_proof_data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"avm_proof_data.d.ts","sourceRoot":"","sources":["../../src/rollup/avm_proof_data.ts"],"names":[],"mappings":";;AAAA,OAAO,EAAE,0BAA0B,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAC7E,OAAO,EAAE,cAAc,EAA2B,MAAM,8BAA8B,CAAC;AACvF,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,qBAAa,YAAY;IAEd,YAAY,EAAE,sBAAsB;IACpC,KAAK,EAAE,cAAc,CAAC,OAAO,0BAA0B,CAAC;IACxD,MAAM,EAAE,aAAa;gBAFrB,YAAY,EAAE,sBAAsB,EACpC,KAAK,EAAE,cAAc,CAAC,OAAO,0BAA0B,CAAC,EACxD,MAAM,EAAE,aAAa;IAG9B,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAS/C,QAAQ;IAIR,MAAM,CAAC,KAAK;CAOb"}