@aztec/stdlib 0.0.1-fake-ceab37513c → 0.0.1-private.5d121bfd

package/dest/parity/parity_public_inputs.d.ts

@@ -1,4 +1,4 @@
-import { Fr } from '@aztec/foundation/fields';
+import { Fr } from '@aztec/foundation/curves/bn254';
 import { BufferReader } from '@aztec/foundation/serialize';
 import type { FieldsOf } from '@aztec/foundation/types';
 export declare class ParityPublicInputs {
@@ -8,13 +8,17 @@ export declare class ParityPublicInputs {
     convertedRoot: Fr;
     /** Root of the VK tree */
     vkTreeRoot: Fr;
+    /** Prover identity committed to by the circuit, for sybil protection. */
+    proverId: Fr;
     constructor(
     /** Root of the SHA256 tree. */
     shaRoot: Fr, 
     /** Root of the converted tree. */
     convertedRoot: Fr, 
     /** Root of the VK tree */
-    vkTreeRoot: Fr);
+    vkTreeRoot: Fr, 
+    /** Prover identity committed to by the circuit, for sybil protection. */
+    proverId: Fr);
     /**
      * Serializes the inputs to a buffer.
      * @returns The inputs serialized to a buffer.
@@ -38,7 +42,7 @@ export declare class ParityPublicInputs {
      * @param fields - The instance to get the fields from.
      * @returns The instance fields.
      */
-    static getFields(fields: FieldsOf<ParityPublicInputs>): readonly [Fr, Fr, Fr];
+    static getFields(fields: FieldsOf<ParityPublicInputs>): readonly [Fr, Fr, Fr, Fr];
     /**
      * Deserializes the inputs from a buffer.
      * @param buffer - The buffer to deserialize from.
@@ -51,6 +55,6 @@ export declare class ParityPublicInputs {
      * @returns A new ParityPublicInputs instance.
      */
     static fromString(str: string): ParityPublicInputs;
-    static get schema(): import("zod").ZodType<ParityPublicInputs, any, string>;
+    static get schema(): import("zod").ZodType<ParityPublicInputs, string, import("zod/v4/core").$ZodTypeInternals<ParityPublicInputs, string>>;
 }
-//# sourceMappingURL=parity_public_inputs.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicGFyaXR5X3B1YmxpY19pbnB1dHMuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wYXJpdHkvcGFyaXR5X3B1YmxpY19pbnB1dHMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLGdDQUFnQyxDQUFDO0FBRXBELE9BQU8sRUFBRSxZQUFZLEVBQXFCLE1BQU0sNkJBQTZCLENBQUM7QUFFOUUsT0FBTyxLQUFLLEVBQUUsUUFBUSxFQUFFLE1BQU0seUJBQXlCLENBQUM7QUFFeEQscUJBQWEsa0JBQWtCO0lBRTNCLCtCQUErQjtJQUN4QixPQUFPLEVBQUUsRUFBRTtJQUNsQixrQ0FBa0M7SUFDM0IsYUFBYSxFQUFFLEVBQUU7SUFDeEIsMEJBQTBCO0lBQ25CLFVBQVUsRUFBRSxFQUFFO0lBQ3JCLHlFQUF5RTtJQUNsRSxRQUFRLEVBQUUsRUFBRTtJQVJyQjtJQUNFLCtCQUErQjtJQUN4QixPQUFPLEVBQUUsRUFBRTtJQUNsQixrQ0FBa0M7SUFDM0IsYUFBYSxFQUFFLEVBQUU7SUFDeEIsMEJBQTBCO0lBQ25CLFVBQVUsRUFBRSxFQUFFO0lBQ3JCLHlFQUF5RTtJQUNsRSxRQUFRLEVBQUUsRUFBRSxFQUtwQjtJQUVEOzs7T0FHRztJQUNILFFBQVEsNEJBRVA7SUFFRDs7O09BR0c7SUFDSCxRQUFRLGtCQUVQO0lBRUQsdURBQXVEO0lBQ3ZELE1BQU0sNEJBRUw7SUFFRDs7OztPQUlHO0lBQ0gsTUFBTSxDQUFDLElBQUksQ0FBQyxNQUFNLEVBQUUsUUFBUSxDQUFDLGtCQUFrQixDQUFDLEdBQUcsa0JBQWtCLENBRXBFO0lBRUQ7Ozs7T0FJRztJQUNILE1BQU0sQ0FBQyxTQUFTLENBQUMsTUFBTSxFQUFFLFFBQVEsQ0FBQyxrQkFBa0IsQ0FBQyw2QkFFcEQ7SUFFRDs7OztPQUlHO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksc0JBUTlDO0lBRUQ7Ozs7T0FJRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsR0FBRyxFQUFFLE1BQU0sc0JBRTVCO0lBRUQsTUFBTSxLQUFLLE1BQU0sMkhBRWhCO0NBQ0YifQ==

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

@@ -1 +1 @@
-{"version":3,"file":"parity_public_inputs.d.ts","sourceRoot":"","sources":["../../src/parity/parity_public_inputs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAExD,qBAAa,kBAAkB;IAE3B,+BAA+B;IACxB,OAAO,EAAE,EAAE;IAClB,kCAAkC;IAC3B,aAAa,EAAE,EAAE;IACxB,0BAA0B;IACnB,UAAU,EAAE,EAAE;;IALrB,+BAA+B;IACxB,OAAO,EAAE,EAAE;IAClB,kCAAkC;IAC3B,aAAa,EAAE,EAAE;IACxB,0BAA0B;IACnB,UAAU,EAAE,EAAE;IAOvB;;;OAGG;IACH,QAAQ;IAIR;;;OAGG;IACH,QAAQ;IAIR,uDAAuD;IACvD,MAAM;IAIN;;;;OAIG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,kBAAkB;IAIrE;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,kBAAkB,CAAC;IAIrD;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAK/C;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM;IAI7B,MAAM,KAAK,MAAM,2DAEhB;CACF"}
+{"version":3,"file":"parity_public_inputs.d.ts","sourceRoot":"","sources":["../../src/parity/parity_public_inputs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAEpD,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAExD,qBAAa,kBAAkB;IAE3B,+BAA+B;IACxB,OAAO,EAAE,EAAE;IAClB,kCAAkC;IAC3B,aAAa,EAAE,EAAE;IACxB,0BAA0B;IACnB,UAAU,EAAE,EAAE;IACrB,yEAAyE;IAClE,QAAQ,EAAE,EAAE;IARrB;IACE,+BAA+B;IACxB,OAAO,EAAE,EAAE;IAClB,kCAAkC;IAC3B,aAAa,EAAE,EAAE;IACxB,0BAA0B;IACnB,UAAU,EAAE,EAAE;IACrB,yEAAyE;IAClE,QAAQ,EAAE,EAAE,EAKpB;IAED;;;OAGG;IACH,QAAQ,4BAEP;IAED;;;OAGG;IACH,QAAQ,kBAEP;IAED,uDAAuD;IACvD,MAAM,4BAEL;IAED;;;;OAIG;IACH,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAAG,kBAAkB,CAEpE;IAED;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,kBAAkB,CAAC,6BAEpD;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,sBAQ9C;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,sBAE5B;IAED,MAAM,KAAK,MAAM,2HAEhB;CACF"}

package/dest/parity/parity_public_inputs.js

@@ -1,4 +1,4 @@
-import { Fr } from '@aztec/foundation/fields';
+import { Fr } from '@aztec/foundation/curves/bn254';
 import { bufferSchemaFor } from '@aztec/foundation/schemas';
 import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
 import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
@@ -6,10 +6,12 @@ export class ParityPublicInputs {
     shaRoot;
     convertedRoot;
     vkTreeRoot;
-    constructor(/** Root of the SHA256 tree. */ shaRoot, /** Root of the converted tree. */ convertedRoot, /** Root of the VK tree */ vkTreeRoot){
+    proverId;
+    constructor(/** Root of the SHA256 tree. */ shaRoot, /** Root of the converted tree. */ convertedRoot, /** Root of the VK tree */ vkTreeRoot, /** Prover identity committed to by the circuit, for sybil protection. */ proverId){
         this.shaRoot = shaRoot;
         this.convertedRoot = convertedRoot;
         this.vkTreeRoot = vkTreeRoot;
+        this.proverId = proverId;
         if (shaRoot.toBuffer()[0] != 0) {
             throw new Error(`shaRoot buffer must be 31 bytes. Got 32 bytes`);
         }
@@ -44,7 +46,8 @@ export class ParityPublicInputs {
         return [
             fields.shaRoot,
             fields.convertedRoot,
-            fields.vkTreeRoot
+            fields.vkTreeRoot,
+            fields.proverId
         ];
     }
     /**
@@ -53,7 +56,7 @@ export class ParityPublicInputs {
    * @returns A new ParityPublicInputs instance.
    */ static fromBuffer(buffer) {
         const reader = BufferReader.asReader(buffer);
-        return new ParityPublicInputs(reader.readObject(Fr), reader.readObject(Fr), Fr.fromBuffer(reader));
+        return new ParityPublicInputs(reader.readObject(Fr), reader.readObject(Fr), Fr.fromBuffer(reader), Fr.fromBuffer(reader));
     }
     /**
    * Deserializes the inputs from a hex string.

package/dest/parity/parity_root_private_inputs.d.ts

@@ -0,0 +1,39 @@
+import { NUM_BASE_PARITY_PER_ROOT_PARITY } from '@aztec/constants';
+import { BufferReader, type Tuple } from '@aztec/foundation/serialize';
+import { type UltraHonkProofData } from '../proofs/proof_data.js';
+import { ParityPublicInputs } from './parity_public_inputs.js';
+export type ParityBaseProofData = UltraHonkProofData<ParityPublicInputs>;
+export declare class ParityRootPrivateInputs {
+    /** Public inputs of the parity base circuits and their proofs and vk data. */
+    readonly children: Tuple<ParityBaseProofData, typeof NUM_BASE_PARITY_PER_ROOT_PARITY>;
+    constructor(
+    /** Public inputs of the parity base circuits and their proofs and vk data. */
+    children: Tuple<ParityBaseProofData, typeof NUM_BASE_PARITY_PER_ROOT_PARITY>);
+    /**
+     * Serializes the inputs to a buffer.
+     * @returns The inputs serialized to a buffer.
+     */
+    toBuffer(): Buffer<ArrayBufferLike>;
+    /**
+     * 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 ParityRootPrivateInputs instance.
+     */
+    static fromBuffer(buffer: Buffer | BufferReader): ParityRootPrivateInputs;
+    /**
+     * Deserializes the inputs from a hex string.
+     * @param str - A hex string to deserialize from.
+     * @returns A new ParityRootPrivateInputs instance.
+     */
+    static fromString(str: string): ParityRootPrivateInputs;
+    /** Returns a buffer representation for JSON serialization. */
+    toJSON(): Buffer<ArrayBufferLike>;
+    /** Creates an instance from a hex string. */
+    static get schema(): import("zod").ZodType<ParityRootPrivateInputs, string, import("zod/v4/core").$ZodTypeInternals<ParityRootPrivateInputs, string>>;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicGFyaXR5X3Jvb3RfcHJpdmF0ZV9pbnB1dHMuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wYXJpdHkvcGFyaXR5X3Jvb3RfcHJpdmF0ZV9pbnB1dHMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLCtCQUErQixFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFHbkUsT0FBTyxFQUFFLFlBQVksRUFBRSxLQUFLLEtBQUssRUFBcUIsTUFBTSw2QkFBNkIsQ0FBQztBQUcxRixPQUFPLEVBQWEsS0FBSyxrQkFBa0IsRUFBRSxNQUFNLHlCQUF5QixDQUFDO0FBQzdFLE9BQU8sRUFBRSxrQkFBa0IsRUFBRSxNQUFNLDJCQUEyQixDQUFDO0FBRS9ELE1BQU0sTUFBTSxtQkFBbUIsR0FBRyxrQkFBa0IsQ0FBQyxrQkFBa0IsQ0FBQyxDQUFDO0FBRXpFLHFCQUFhLHVCQUF1QjtJQUVoQyw4RUFBOEU7YUFDOUQsUUFBUSxFQUFFLEtBQUssQ0FBQyxtQkFBbUIsRUFBRSxPQUFPLCtCQUErQixDQUFDO0lBRjlGO0lBQ0UsOEVBQThFO0lBQzlELFFBQVEsRUFBRSxLQUFLLENBQUMsbUJBQW1CLEVBQUUsT0FBTywrQkFBK0IsQ0FBQyxFQUMxRjtJQUVKOzs7T0FHRztJQUNILFFBQVEsNEJBRVA7SUFFRDs7O09BR0c7SUFDSCxRQUFRLGtCQUVQO0lBRUQ7Ozs7T0FJRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLDJCQUs5QztJQUVEOzs7O09BSUc7SUFDSCxNQUFNLENBQUMsVUFBVSxDQUFDLEdBQUcsRUFBRSxNQUFNLDJCQUU1QjtJQUVELDhEQUE4RDtJQUM5RCxNQUFNLDRCQUVMO0lBRUQsNkNBQTZDO0lBQzdDLE1BQU0sS0FBSyxNQUFNLHFJQUVoQjtDQUNGIn0=

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

@@ -0,0 +1 @@
+{"version":3,"file":"parity_root_private_inputs.d.ts","sourceRoot":"","sources":["../../src/parity/parity_root_private_inputs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,+BAA+B,EAAE,MAAM,kBAAkB,CAAC;AAGnE,OAAO,EAAE,YAAY,EAAE,KAAK,KAAK,EAAqB,MAAM,6BAA6B,CAAC;AAG1F,OAAO,EAAa,KAAK,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7E,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/D,MAAM,MAAM,mBAAmB,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,CAAC;AAEzE,qBAAa,uBAAuB;IAEhC,8EAA8E;aAC9D,QAAQ,EAAE,KAAK,CAAC,mBAAmB,EAAE,OAAO,+BAA+B,CAAC;IAF9F;IACE,8EAA8E;IAC9D,QAAQ,EAAE,KAAK,CAAC,mBAAmB,EAAE,OAAO,+BAA+B,CAAC,EAC1F;IAEJ;;;OAGG;IACH,QAAQ,4BAEP;IAED;;;OAGG;IACH,QAAQ,kBAEP;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,2BAK9C;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,2BAE5B;IAED,8DAA8D;IAC9D,MAAM,4BAEL;IAED,6CAA6C;IAC7C,MAAM,KAAK,MAAM,qIAEhB;CACF"}

package/dest/parity/{root_parity_inputs.js → parity_root_private_inputs.js}

@@ -1,18 +1,20 @@
-import { NUM_BASE_PARITY_PER_ROOT_PARITY, RECURSIVE_PROOF_LENGTH } from '@aztec/constants';
+import { NUM_BASE_PARITY_PER_ROOT_PARITY } from '@aztec/constants';
+import { makeTuple } from '@aztec/foundation/array';
 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 {
+import { ProofData } from '../proofs/proof_data.js';
+import { ParityPublicInputs } from './parity_public_inputs.js';
+export class ParityRootPrivateInputs {
     children;
-    constructor(/** Public inputs of children and their proofs. */ children){
+    constructor(/** Public inputs of the parity base circuits and their proofs and vk data. */ children){
         this.children = children;
     }
     /**
    * Serializes the inputs to a buffer.
    * @returns The inputs serialized to a buffer.
    */ toBuffer() {
-        return serializeToBuffer(...this.children);
+        return serializeToBuffer(this.children);
     }
     /**
    * Serializes the inputs to a hex string.
@@ -23,25 +25,22 @@ export class RootParityInputs {
     /**
    * Deserializes the inputs from a buffer.
    * @param buffer - The buffer to deserialize from.
-   * @returns A new RootParityInputs instance.
+   * @returns A new ParityRootPrivateInputs 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);
+        return new ParityRootPrivateInputs(makeTuple(NUM_BASE_PARITY_PER_ROOT_PARITY, ()=>ProofData.fromBuffer(reader, ParityPublicInputs)));
     }
     /**
    * Deserializes the inputs from a hex string.
    * @param str - A hex string to deserialize from.
-   * @returns A new RootParityInputs instance.
+   * @returns A new ParityRootPrivateInputs instance.
    */ static fromString(str) {
-        return RootParityInputs.fromBuffer(hexToBuffer(str));
+        return ParityRootPrivateInputs.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);
+        return bufferSchemaFor(ParityRootPrivateInputs);
     }
 }

package/dest/proofs/chonk_proof.d.ts

@@ -0,0 +1,78 @@
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { BufferReader, BufferSink } from '@aztec/foundation/serialize';
+/**
+ * Serialization format detection for ChonkProof is value-based on the leading uint32:
+ *   - EMPTY:                 [0: uint32]                              → total = 4 bytes
+ *   - UNCOMPRESSED (legacy): [field_count=1632: uint32] [fields...]  → total ≈ 52KB (>= 40KB)
+ *   - COMPRESSED:            [byte_count: uint32] [compressed_bytes] → total ≈ 35KB (< 40KB)
+ *
+ * Detection from the first uint32: 0 means an empty proof (no fields); CHONK_PROOF_LENGTH
+ * (1632) means legacy format (field count); any other value is the compressed byte count.
+ * A real compressed proof always has a non-zero byte count, so 0 is an unambiguous sentinel
+ * for the empty case. The old uncompressed format is never smaller than 40KB; compressed
+ * proofs are always smaller than 40KB.
+ */
+export declare class ChonkProof {
+    fields: Fr[];
+    /**
+     * Optional compressed proof bytes from chonk compression (point compression + u256 encoding).
+     * When set, toBuffer() will serialize in compressed format (~1.7x smaller).
+     * When reading from compressed format, this is populated and fields are decompressed on demand.
+     */
+    compressedProof?: Buffer;
+    constructor(fields: Fr[], compressedProof?: Buffer);
+    attachPublicInputs(publicInputs: Fr[]): ChonkProofWithPublicInputs;
+    isEmpty(): boolean;
+    static empty(): ChonkProof;
+    static random(): ChonkProof;
+    static get schema(): import("zod").ZodType<ChonkProof, string, import("zod/v4/core").$ZodTypeInternals<ChonkProof, string>>;
+    toJSON(): Buffer<ArrayBufferLike>;
+    /**
+     * Deserialize a ChonkProof from a buffer.
+     * Supports both legacy (field elements) and compressed (chonk compression) formats.
+     *
+     * Value-based format detection on the leading uint32:
+     *   - First uint32 == 0: empty proof (no fields), total = 4 bytes
+     *   - First uint32 == CHONK_PROOF_LENGTH (1632): legacy format, read field elements
+     *     Total proof data ≈ 52KB (always >= 40KB)
+     *   - Otherwise: compressed format, first uint32 is byte count of compressed data
+     *     Total proof data ≈ 35KB (always < 40KB)
+     */
+    static fromBuffer(buffer: Buffer | BufferReader): ChonkProof;
+    /**
+     * Create a ChonkProof from compressed bytes by decompressing via the BarretenbergSync API.
+     * The compressed format uses point compression and u256 encoding (from PR #20645).
+     *
+     * @param compressed - Compressed proof bytes from chonk compression
+     * @returns ChonkProof with both fields and compressed bytes populated
+     */
+    static fromCompressedBytes(compressed: Buffer): ChonkProof;
+    /**
+     * Serialize the proof to a buffer.
+     * If compressed bytes are available, uses the compressed format (~1.7x smaller).
+     * Otherwise falls back to legacy field element format.
+     */
+    toBuffer(): Buffer;
+    toBuffer(sink: BufferSink): void;
+}
+export declare class ChonkProofWithPublicInputs {
+    fieldsWithPublicInputs: Fr[];
+    /**
+     * Optional compressed proof bytes (covers the full proof WITH public inputs).
+     * Set by the prover when using chonk compression. Flows through to ChonkProof
+     * via removePublicInputs() so the Tx can serialize in compressed format.
+     */
+    compressedProof?: Buffer;
+    constructor(fieldsWithPublicInputs: Fr[]);
+    getPublicInputs(): Fr[];
+    removePublicInputs(): ChonkProof;
+    isEmpty(): boolean;
+    static empty(): ChonkProofWithPublicInputs;
+    static get schema(): import("zod").ZodType<ChonkProofWithPublicInputs, string, import("zod/v4/core").$ZodTypeInternals<ChonkProofWithPublicInputs, string>>;
+    toJSON(): Buffer<ArrayBufferLike>;
+    static fromBuffer(buffer: Buffer | BufferReader): ChonkProofWithPublicInputs;
+    toBuffer(): Buffer;
+    toBuffer(sink: BufferSink): void;
+    static fromBufferArray(fields: Uint8Array[]): ChonkProofWithPublicInputs;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY2hvbmtfcHJvb2YuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvY2hvbmtfcHJvb2YudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBSUEsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLGdDQUFnQyxDQUFDO0FBRXBELE9BQU8sRUFBRSxZQUFZLEVBQUUsVUFBVSxFQUFFLE1BQU0sNkJBQTZCLENBQUM7QUFFdkU7Ozs7Ozs7Ozs7O0dBV0c7QUFHSCxxQkFBYSxVQUFVO0lBWVosTUFBTSxFQUFFLEVBQUUsRUFBRTtJQVhyQjs7OztPQUlHO0lBQ0ksZUFBZSxDQUFDLEVBQUUsTUFBTSxDQUFDO0lBRWhDLFlBSVMsTUFBTSxFQUFFLEVBQUUsRUFBRSxFQUNuQixlQUFlLENBQUMsRUFBRSxNQUFNLEVBT3pCO0lBRU0sa0JBQWtCLENBQUMsWUFBWSxFQUFFLEVBQUUsRUFBRSw4QkFFM0M7SUFFTSxPQUFPLFlBRWI7SUFFRCxNQUFNLENBQUMsS0FBSyxlQUVYO0lBRUQsTUFBTSxDQUFDLE1BQU0sZUFZWjtJQUVELE1BQU0sS0FBSyxNQUFNLDJHQUVoQjtJQUdELE1BQU0sNEJBRUw7SUFFRDs7Ozs7Ozs7OztPQVVHO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksR0FBRyxVQUFVLENBcUIzRDtJQUVEOzs7Ozs7T0FNRztJQUNILE1BQU0sQ0FBQyxtQkFBbUIsQ0FBQyxVQUFVLEVBQUUsTUFBTSxHQUFHLFVBQVUsQ0FrQnpEO0lBRUQ7Ozs7T0FJRztJQUNJLFFBQVEsSUFBSSxNQUFNLENBQUM7SUFDbkIsUUFBUSxDQUFDLElBQUksRUFBRSxVQUFVLEdBQUcsSUFBSSxDQUFDO0NBa0J6QztBQUVELHFCQUFhLDBCQUEwQjtJQVc1QixzQkFBc0IsRUFBRSxFQUFFLEVBQUU7SUFWckM7Ozs7T0FJRztJQUNJLGVBQWUsQ0FBQyxFQUFFLE1BQU0sQ0FBQztJQUVoQyxZQUdTLHNCQUFzQixFQUFFLEVBQUUsRUFBRSxFQU1wQztJQUVNLGVBQWUsU0FNckI7SUFFTSxrQkFBa0IsZUFPeEI7SUFFTSxPQUFPLFlBRWI7SUFFRCxNQUFNLENBQUMsS0FBSywrQkFFWDtJQUVELE1BQU0sS0FBSyxNQUFNLDJJQUVoQjtJQUdELE1BQU0sNEJBRUw7SUFFRCxNQUFNLENBQUMsVUFBVSxDQUFDLE1BQU0sRUFBRSxNQUFNLEdBQUcsWUFBWSxHQUFHLDBCQUEwQixDQUszRTtJQUVNLFFBQVEsSUFBSSxNQUFNLENBQUM7SUFDbkIsUUFBUSxDQUFDLElBQUksRUFBRSxVQUFVLEdBQUcsSUFBSSxDQUFDO0lBVXhDLE1BQU0sQ0FBQyxlQUFlLENBQUMsTUFBTSxFQUFFLFVBQVUsRUFBRSxHQUFHLDBCQUEwQixDQUd2RTtDQUNGIn0=

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

@@ -0,0 +1 @@
+{"version":3,"file":"chonk_proof.d.ts","sourceRoot":"","sources":["../../src/proofs/chonk_proof.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAEpD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEvE;;;;;;;;;;;GAWG;AAGH,qBAAa,UAAU;IAYZ,MAAM,EAAE,EAAE,EAAE;IAXrB;;;;OAIG;IACI,eAAe,CAAC,EAAE,MAAM,CAAC;IAEhC,YAIS,MAAM,EAAE,EAAE,EAAE,EACnB,eAAe,CAAC,EAAE,MAAM,EAOzB;IAEM,kBAAkB,CAAC,YAAY,EAAE,EAAE,EAAE,8BAE3C;IAEM,OAAO,YAEb;IAED,MAAM,CAAC,KAAK,eAEX;IAED,MAAM,CAAC,MAAM,eAYZ;IAED,MAAM,KAAK,MAAM,2GAEhB;IAGD,MAAM,4BAEL;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,UAAU,CAqB3D;IAED;;;;;;OAMG;IACH,MAAM,CAAC,mBAAmB,CAAC,UAAU,EAAE,MAAM,GAAG,UAAU,CAkBzD;IAED;;;;OAIG;IACI,QAAQ,IAAI,MAAM,CAAC;IACnB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;CAkBzC;AAED,qBAAa,0BAA0B;IAW5B,sBAAsB,EAAE,EAAE,EAAE;IAVrC;;;;OAIG;IACI,eAAe,CAAC,EAAE,MAAM,CAAC;IAEhC,YAGS,sBAAsB,EAAE,EAAE,EAAE,EAMpC;IAEM,eAAe,SAMrB;IAEM,kBAAkB,eAOxB;IAEM,OAAO,YAEb;IAED,MAAM,CAAC,KAAK,+BAEX;IAED,MAAM,KAAK,MAAM,2IAEhB;IAGD,MAAM,4BAEL;IAED,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,0BAA0B,CAK3E;IAEM,QAAQ,IAAI,MAAM,CAAC;IACnB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAUxC,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,0BAA0B,CAGvE;CACF"}

package/dest/proofs/chonk_proof.js

@@ -0,0 +1,203 @@
+import { BarretenbergSync, flattenChonkProofFields } from '@aztec/bb.js';
+import { CHONK_PROOF_LENGTH } from '@aztec/constants';
+import { times } from '@aztec/foundation/collection';
+import { randomBytes } from '@aztec/foundation/crypto/random';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { bufferSchemaFor } from '@aztec/foundation/schemas';
+import { BufferReader, BufferSink } from '@aztec/foundation/serialize';
+/**
+ * Serialization format detection for ChonkProof is value-based on the leading uint32:
+ *   - EMPTY:                 [0: uint32]                              → total = 4 bytes
+ *   - UNCOMPRESSED (legacy): [field_count=1632: uint32] [fields...]  → total ≈ 52KB (>= 40KB)
+ *   - COMPRESSED:            [byte_count: uint32] [compressed_bytes] → total ≈ 35KB (< 40KB)
+ *
+ * Detection from the first uint32: 0 means an empty proof (no fields); CHONK_PROOF_LENGTH
+ * (1632) means legacy format (field count); any other value is the compressed byte count.
+ * A real compressed proof always has a non-zero byte count, so 0 is an unambiguous sentinel
+ * for the empty case. The old uncompressed format is never smaller than 40KB; compressed
+ * proofs are always smaller than 40KB.
+ */ // CHONK: "Client Honk" - An UltraHonk variant with incremental folding and delayed non-native arithmetic.
+export class ChonkProof {
+    fields;
+    /**
+   * Optional compressed proof bytes from chonk compression (point compression + u256 encoding).
+   * When set, toBuffer() will serialize in compressed format (~1.7x smaller).
+   * When reading from compressed format, this is populated and fields are decompressed on demand.
+   */ compressedProof;
+    constructor(// The proof fields.
+    // For native verification, attach public inputs via `attachPublicInputs(publicInputs)`.
+    // Not using Tuple here due to the length being too high.
+    fields, compressedProof){
+        this.fields = fields;
+        // An empty proof (no fields) is a valid placeholder; see ChonkProof.empty().
+        if (fields.length !== 0 && fields.length !== CHONK_PROOF_LENGTH) {
+            throw new Error(`Invalid ChonkProof length: ${fields.length}`);
+        }
+        this.compressedProof = compressedProof;
+    }
+    attachPublicInputs(publicInputs) {
+        return new ChonkProofWithPublicInputs([
+            ...publicInputs,
+            ...this.fields
+        ]);
+    }
+    isEmpty() {
+        return this.fields.every((field)=>field.isZero());
+    }
+    static empty() {
+        return new ChonkProof([]);
+    }
+    static random() {
+        // NB: Not using Fr.random here because it slows down some tests that require a large number of txs significantly.
+        // NB2: generate one fewer random bytes to not have to deal with buffers representing numbers greater than the field modulus
+        // NB3: a chonk proof can be compressed. Simulate this by filling 1/4 of the proof with zero data
+        const reducedFrSize = Fr.SIZE_IN_BYTES - 1;
+        const nonZeroFields = Math.floor(3 * CHONK_PROOF_LENGTH / 4);
+        const randomFields = randomBytes(nonZeroFields * Fr.SIZE_IN_BYTES);
+        const proof = [
+            ...times(nonZeroFields, (i)=>new Fr(randomFields.subarray(i * reducedFrSize, (i + 1) * reducedFrSize))),
+            ...times(CHONK_PROOF_LENGTH - nonZeroFields, ()=>Fr.ZERO)
+        ];
+        return new ChonkProof(proof);
+    }
+    static get schema() {
+        return bufferSchemaFor(ChonkProof);
+    }
+    // We use this in tandem with the bufferSchemaFor to serialize to base64 strings.
+    toJSON() {
+        return this.toBuffer();
+    }
+    /**
+   * Deserialize a ChonkProof from a buffer.
+   * Supports both legacy (field elements) and compressed (chonk compression) formats.
+   *
+   * Value-based format detection on the leading uint32:
+   *   - First uint32 == 0: empty proof (no fields), total = 4 bytes
+   *   - First uint32 == CHONK_PROOF_LENGTH (1632): legacy format, read field elements
+   *     Total proof data ≈ 52KB (always >= 40KB)
+   *   - Otherwise: compressed format, first uint32 is byte count of compressed data
+   *     Total proof data ≈ 35KB (always < 40KB)
+   */ static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        const firstUint32 = reader.readNumber();
+        if (firstUint32 === 0) {
+            // Empty format: a zero length encodes an empty proof.
+            return ChonkProof.empty();
+        }
+        if (firstUint32 === CHONK_PROOF_LENGTH) {
+            // Legacy format: firstUint32 is the field count (1632)
+            // Widen to `number` to prevent TS from narrowing to literal 1632,
+            // which would cause Tuple<Fr, 1632> to exceed the recursion limit.
+            const fieldCount = firstUint32;
+            const proof = reader.readArray(fieldCount, Fr);
+            return new ChonkProof(proof);
+        }
+        // Compressed format: firstUint32 is the compressed byte count
+        const compressedBytes = reader.readBytes(firstUint32);
+        return ChonkProof.fromCompressedBytes(Buffer.from(compressedBytes));
+    }
+    /**
+   * Create a ChonkProof from compressed bytes by decompressing via the BarretenbergSync API.
+   * The compressed format uses point compression and u256 encoding (from PR #20645).
+   *
+   * @param compressed - Compressed proof bytes from chonk compression
+   * @returns ChonkProof with both fields and compressed bytes populated
+   */ static fromCompressedBytes(compressed) {
+        const api = BarretenbergSync.getSingleton();
+        const result = api.chonkDecompressProof({
+            compressedProof: new Uint8Array(compressed)
+        });
+        // Flatten the structured bb.js ChonkProof into flat Fr[] field elements
+        const flatFields = flattenChonkProofFields(result.proof);
+        const fields = flatFields.map((f)=>Fr.fromBuffer(Buffer.from(f)));
+        // The decompressed proof includes public inputs in hidingOinkProof.
+        // Since ChonkProof stores fields WITHOUT public inputs, strip them.
+        // The number of public inputs = total fields - CHONK_PROOF_LENGTH
+        if (fields.length > CHONK_PROOF_LENGTH) {
+            const numPubInputs = fields.length - CHONK_PROOF_LENGTH;
+            const proofFields = fields.slice(numPubInputs);
+            return new ChonkProof(proofFields, compressed);
+        }
+        return new ChonkProof(fields, compressed);
+    }
+    toBuffer(sink) {
+        if (!sink) {
+            return BufferSink.serialize(this);
+        }
+        if (this.compressedProof) {
+            // Compressed format: [compressed_byte_count: uint32] [compressed_bytes]
+            sink.writeNumber(this.compressedProof.length);
+            sink.writeBytes(this.compressedProof);
+            return;
+        }
+        // Legacy / empty format: [field_count: uint32] [fields...]. fields.length === 0 emits the empty
+        // sentinel (a lone zero uint32) that ChonkProof.fromBuffer detects; fields.length === CHONK_PROOF_LENGTH
+        // is the full legacy form. The writeFields fast path skips per-element sinkable dispatch on the 1632
+        // leaves and is a no-op when the array is empty.
+        sink.writeNumber(this.fields.length);
+        sink.writeFields(this.fields);
+    }
+}
+export class ChonkProofWithPublicInputs {
+    fieldsWithPublicInputs;
+    /**
+   * Optional compressed proof bytes (covers the full proof WITH public inputs).
+   * Set by the prover when using chonk compression. Flows through to ChonkProof
+   * via removePublicInputs() so the Tx can serialize in compressed format.
+   */ compressedProof;
+    constructor(// The proof fields with public inputs.
+    // For recursive verification, use without public inputs via `removePublicInputs()`.
+    fieldsWithPublicInputs){
+        this.fieldsWithPublicInputs = fieldsWithPublicInputs;
+        // An empty proof (no fields) is a valid placeholder; see ChonkProofWithPublicInputs.empty().
+        if (fieldsWithPublicInputs.length !== 0 && fieldsWithPublicInputs.length < CHONK_PROOF_LENGTH) {
+            throw new Error(`Invalid ChonkProofWithPublicInputs length: ${fieldsWithPublicInputs.length}`);
+        }
+    }
+    getPublicInputs() {
+        if (this.fieldsWithPublicInputs.length === 0) {
+            return [];
+        }
+        const numPublicInputs = this.fieldsWithPublicInputs.length - CHONK_PROOF_LENGTH;
+        return this.fieldsWithPublicInputs.slice(0, numPublicInputs);
+    }
+    removePublicInputs() {
+        if (this.fieldsWithPublicInputs.length === 0) {
+            return new ChonkProof([], this.compressedProof);
+        }
+        const numPublicInputs = this.fieldsWithPublicInputs.length - CHONK_PROOF_LENGTH;
+        // Flow compressed proof bytes through so the ChonkProof can serialize efficiently
+        return new ChonkProof(this.fieldsWithPublicInputs.slice(numPublicInputs), this.compressedProof);
+    }
+    isEmpty() {
+        return this.fieldsWithPublicInputs.every((field)=>field.isZero());
+    }
+    static empty() {
+        return ChonkProof.empty().attachPublicInputs([]);
+    }
+    static get schema() {
+        return bufferSchemaFor(ChonkProofWithPublicInputs);
+    }
+    // We use this in tandem with the bufferSchemaFor to serialize to base64 strings.
+    toJSON() {
+        return this.toBuffer();
+    }
+    static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        const proofLength = reader.readNumber();
+        const proof = reader.readArray(proofLength, Fr);
+        return new ChonkProofWithPublicInputs(proof);
+    }
+    toBuffer(sink) {
+        if (!sink) {
+            return BufferSink.serialize(this);
+        }
+        sink.writeNumber(this.fieldsWithPublicInputs.length);
+        sink.writeFields(this.fieldsWithPublicInputs);
+    }
+    // Called when constructing from bb proving results.
+    static fromBufferArray(fields) {
+        const proof = fields.map((field)=>Fr.fromBuffer(Buffer.from(field)));
+        return new ChonkProofWithPublicInputs(proof);
+    }
+}

package/dest/proofs/index.d.ts

@@ -1,5 +1,6 @@
 export * from './recursive_proof.js';
-export * from './client_ivc_proof.js';
+export * from './chonk_proof.js';
 export * from './proof.js';
+export * from './proof_data.js';
 export * from './proving_request_type.js';
-//# sourceMappingURL=index.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsY0FBYyxzQkFBc0IsQ0FBQztBQUNyQyxjQUFjLGtCQUFrQixDQUFDO0FBQ2pDLGNBQWMsWUFBWSxDQUFDO0FBQzNCLGNBQWMsaUJBQWlCLENBQUM7QUFDaEMsY0FBYywyQkFBMkIsQ0FBQyJ9

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

@@ -1 +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"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/proofs/index.ts"],"names":[],"mappings":"AAAA,cAAc,sBAAsB,CAAC;AACrC,cAAc,kBAAkB,CAAC;AACjC,cAAc,YAAY,CAAC;AAC3B,cAAc,iBAAiB,CAAC;AAChC,cAAc,2BAA2B,CAAC"}

package/dest/proofs/index.js

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

package/dest/proofs/proof.d.ts

@@ -1,4 +1,4 @@
-import { Fr } from '@aztec/foundation/fields';
+import { Fr } from '@aztec/foundation/curves/bn254';
 import { BufferReader } from '@aztec/foundation/serialize';
 /**
  * The Proof class is a wrapper around the circuits proof.
@@ -61,4 +61,4 @@ export declare class Proof {
  * @returns The empty "proof".
  */
 export declare function makeEmptyProof(): Proof;
-//# sourceMappingURL=proof.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2YuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvcHJvb2YudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLGdDQUFnQyxDQUFDO0FBQ3BELE9BQU8sRUFBRSxZQUFZLEVBQXFCLE1BQU0sNkJBQTZCLENBQUM7QUFPOUU7Ozs7O0dBS0c7QUFDSCxxQkFBYSxLQUFLO0lBS2Q7O09BRUc7SUFDSSxNQUFNLEVBQUUsTUFBTTtJQUVkLGVBQWUsRUFBRSxNQUFNO0lBUmhDLFFBQVEsQ0FBQyxZQUFZLEVBQUUsR0FBRyxDQUFDO0lBRTNCO0lBQ0U7O09BRUc7SUFDSSxNQUFNLEVBQUUsTUFBTSxFQUVkLGVBQWUsRUFBRSxNQUFNLEVBQzVCO0lBRUo7Ozs7OztPQU1HO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksR0FBRyxLQUFLLENBTXREO0lBRUQ7Ozs7O09BS0c7SUFDSSxRQUFRLDRCQUVkO0lBRUQ7OztPQUdHO0lBQ0ksUUFBUSxrQkFFZDtJQUVEOzs7T0FHRztJQUNJLG1CQUFtQixJQUFJLE1BQU0sQ0FXbkM7SUFLTSxtQkFBbUIsSUFBSSxFQUFFLEVBQUUsQ0FVakM7SUFFRDs7OztPQUlHO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxTQUU1QjtJQUVELG9EQUFvRDtJQUM3QyxPQUFPLFlBSWI7SUFFRCw4QkFBOEI7SUFDOUIsTUFBTSxDQUFDLEtBQUssVUFFWDtDQUNGO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixjQUFjLFVBRTdCIn0=

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

@@ -1 +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;AAO9E;;;;;GAKG;AACH,qBAAa,KAAK;IAKd;;OAEG;IACI,MAAM,EAAE,MAAM;IAEd,eAAe,EAAE,MAAM;IARhC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC;;IAGzB;;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;IAIf;;;OAGG;IACI,mBAAmB,IAAI,MAAM;IAgB7B,mBAAmB,IAAI,EAAE,EAAE;IAYlC;;;;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"}
+{"version":3,"file":"proof.d.ts","sourceRoot":"","sources":["../../src/proofs/proof.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,EAAE,YAAY,EAAqB,MAAM,6BAA6B,CAAC;AAO9E;;;;;GAKG;AACH,qBAAa,KAAK;IAKd;;OAEG;IACI,MAAM,EAAE,MAAM;IAEd,eAAe,EAAE,MAAM;IARhC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC;IAE3B;IACE;;OAEG;IACI,MAAM,EAAE,MAAM,EAEd,eAAe,EAAE,MAAM,EAC5B;IAEJ;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,KAAK,CAMtD;IAED;;;;;OAKG;IACI,QAAQ,4BAEd;IAED;;;OAGG;IACI,QAAQ,kBAEd;IAED;;;OAGG;IACI,mBAAmB,IAAI,MAAM,CAWnC;IAKM,mBAAmB,IAAI,EAAE,EAAE,CAUjC;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,SAE5B;IAED,oDAAoD;IAC7C,OAAO,YAIb;IAED,8BAA8B;IAC9B,MAAM,CAAC,KAAK,UAEX;CACF;AAED;;;;GAIG;AACH,wBAAgB,cAAc,UAE7B"}

package/dest/proofs/proof.js

@@ -1,5 +1,5 @@
 import { PAIRING_POINTS_SIZE } from '@aztec/constants';
-import { Fr } from '@aztec/foundation/fields';
+import { Fr } from '@aztec/foundation/curves/bn254';
 import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
 import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
 import { strict as assert } from 'assert';

package/dest/proofs/proof_data.d.ts

@@ -0,0 +1,33 @@
+import type { CHONK_PROOF_LENGTH, RECURSIVE_PROOF_LENGTH, RECURSIVE_ROLLUP_HONK_PROOF_LENGTH } from '@aztec/constants';
+import { BufferReader, type Bufferable } from '@aztec/foundation/serialize';
+import { RecursiveProof } from '../proofs/recursive_proof.js';
+import { VkData } from '../vks/index.js';
+/**
+ * Represents the data of a recursive proof.
+ */
+export declare class ProofData<T extends Bufferable, PROOF_LENGTH extends number> {
+    publicInputs: T;
+    proof: RecursiveProof<PROOF_LENGTH>;
+    vkData: VkData;
+    constructor(publicInputs: T, proof: RecursiveProof<PROOF_LENGTH>, vkData: VkData);
+    toBuffer(): Buffer;
+    static fromBuffer<T extends Bufferable, PROOF_LENGTH extends number>(buffer: Buffer | BufferReader, publicInputs: {
+        fromBuffer: (reader: BufferReader) => T;
+    }): ProofData<T, PROOF_LENGTH>;
+}
+/**
+ * Represents the data of a recursive proof for a circuit with a fixed verification key.
+ */
+export declare class ProofDataForFixedVk<T extends Bufferable, PROOF_LENGTH extends number> {
+    publicInputs: T;
+    proof: RecursiveProof<PROOF_LENGTH>;
+    constructor(publicInputs: T, proof: RecursiveProof<PROOF_LENGTH>);
+    toBuffer(): Buffer;
+    static fromBuffer<T extends Bufferable, PROOF_LENGTH extends number>(buffer: Buffer | BufferReader, publicInputs: {
+        fromBuffer: (reader: BufferReader) => T;
+    }): ProofDataForFixedVk<T, PROOF_LENGTH>;
+}
+export type ChonkProofData<T extends Bufferable> = ProofData<T, typeof CHONK_PROOF_LENGTH>;
+export type UltraHonkProofData<T extends Bufferable> = ProofData<T, typeof RECURSIVE_PROOF_LENGTH>;
+export type RollupHonkProofData<T extends Bufferable> = ProofData<T, typeof RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2ZfZGF0YS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3Byb29mcy9wcm9vZl9kYXRhLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLGtCQUFrQixFQUFFLHNCQUFzQixFQUFFLGtDQUFrQyxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFDdkgsT0FBTyxFQUFFLFlBQVksRUFBRSxLQUFLLFVBQVUsRUFBcUIsTUFBTSw2QkFBNkIsQ0FBQztBQUUvRixPQUFPLEVBQUUsY0FBYyxFQUFFLE1BQU0sOEJBQThCLENBQUM7QUFDOUQsT0FBTyxFQUFFLE1BQU0sRUFBRSxNQUFNLGlCQUFpQixDQUFDO0FBRXpDOztHQUVHO0FBQ0gscUJBQWEsU0FBUyxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU07SUFFN0QsWUFBWSxFQUFFLENBQUM7SUFDZixLQUFLLEVBQUUsY0FBYyxDQUFDLFlBQVksQ0FBQztJQUNuQyxNQUFNLEVBQUUsTUFBTTtJQUh2QixZQUNTLFlBQVksRUFBRSxDQUFDLEVBQ2YsS0FBSyxFQUFFLGNBQWMsQ0FBQyxZQUFZLENBQUMsRUFDbkMsTUFBTSxFQUFFLE1BQU0sRUFDbkI7SUFFRyxRQUFRLElBQUksTUFBTSxDQUV4QjtJQUVELE9BQWMsVUFBVSxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU0sRUFDeEUsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEVBQzdCLFlBQVksRUFBRTtRQUNaLFVBQVUsRUFBRSxDQUFDLE1BQU0sRUFBRSxZQUFZLEtBQUssQ0FBQyxDQUFDO0tBQ3pDLEdBQ0EsU0FBUyxDQUFDLENBQUMsRUFBRSxZQUFZLENBQUMsQ0FHNUI7Q0FDRjtBQUVEOztHQUVHO0FBQ0gscUJBQWEsbUJBQW1CLENBQUMsQ0FBQyxTQUFTLFVBQVUsRUFBRSxZQUFZLFNBQVMsTUFBTTtJQUV2RSxZQUFZLEVBQUUsQ0FBQztJQUNmLEtBQUssRUFBRSxjQUFjLENBQUMsWUFBWSxDQUFDO0lBRjVDLFlBQ1MsWUFBWSxFQUFFLENBQUMsRUFDZixLQUFLLEVBQUUsY0FBYyxDQUFDLFlBQVksQ0FBQyxFQUN4QztJQUVHLFFBQVEsSUFBSSxNQUFNLENBRXhCO0lBRUQsT0FBYyxVQUFVLENBQUMsQ0FBQyxTQUFTLFVBQVUsRUFBRSxZQUFZLFNBQVMsTUFBTSxFQUN4RSxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksRUFDN0IsWUFBWSxFQUFFO1FBQ1osVUFBVSxFQUFFLENBQUMsTUFBTSxFQUFFLFlBQVksS0FBSyxDQUFDLENBQUM7S0FDekMsR0FDQSxtQkFBbUIsQ0FBQyxDQUFDLEVBQUUsWUFBWSxDQUFDLENBR3RDO0NBQ0Y7QUFFRCxNQUFNLE1BQU0sY0FBYyxDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLGtCQUFrQixDQUFDLENBQUM7QUFFM0YsTUFBTSxNQUFNLGtCQUFrQixDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLHNCQUFzQixDQUFDLENBQUM7QUFFbkcsTUFBTSxNQUFNLG1CQUFtQixDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLGtDQUFrQyxDQUFDLENBQUMifQ==

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

@@ -0,0 +1 @@
+{"version":3,"file":"proof_data.d.ts","sourceRoot":"","sources":["../../src/proofs/proof_data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,kCAAkC,EAAE,MAAM,kBAAkB,CAAC;AACvH,OAAO,EAAE,YAAY,EAAE,KAAK,UAAU,EAAqB,MAAM,6BAA6B,CAAC;AAE/F,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEzC;;GAEG;AACH,qBAAa,SAAS,CAAC,CAAC,SAAS,UAAU,EAAE,YAAY,SAAS,MAAM;IAE7D,YAAY,EAAE,CAAC;IACf,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC;IACnC,MAAM,EAAE,MAAM;IAHvB,YACS,YAAY,EAAE,CAAC,EACf,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC,EACnC,MAAM,EAAE,MAAM,EACnB;IAEG,QAAQ,IAAI,MAAM,CAExB;IAED,OAAc,UAAU,CAAC,CAAC,SAAS,UAAU,EAAE,YAAY,SAAS,MAAM,EACxE,MAAM,EAAE,MAAM,GAAG,YAAY,EAC7B,YAAY,EAAE;QACZ,UAAU,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,CAAC,CAAC;KACzC,GACA,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,CAG5B;CACF;AAED;;GAEG;AACH,qBAAa,mBAAmB,CAAC,CAAC,SAAS,UAAU,EAAE,YAAY,SAAS,MAAM;IAEvE,YAAY,EAAE,CAAC;IACf,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC;IAF5C,YACS,YAAY,EAAE,CAAC,EACf,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC,EACxC;IAEG,QAAQ,IAAI,MAAM,CAExB;IAED,OAAc,UAAU,CAAC,CAAC,SAAS,UAAU,EAAE,YAAY,SAAS,MAAM,EACxE,MAAM,EAAE,MAAM,GAAG,YAAY,EAC7B,YAAY,EAAE;QACZ,UAAU,EAAE,CAAC,MAAM,EAAE,YAAY,KAAK,CAAC,CAAC;KACzC,GACA,mBAAmB,CAAC,CAAC,EAAE,YAAY,CAAC,CAGtC;CACF;AAED,MAAM,MAAM,cAAc,CAAC,CAAC,SAAS,UAAU,IAAI,SAAS,CAAC,CAAC,EAAE,OAAO,kBAAkB,CAAC,CAAC;AAE3F,MAAM,MAAM,kBAAkB,CAAC,CAAC,SAAS,UAAU,IAAI,SAAS,CAAC,CAAC,EAAE,OAAO,sBAAsB,CAAC,CAAC;AAEnG,MAAM,MAAM,mBAAmB,CAAC,CAAC,SAAS,UAAU,IAAI,SAAS,CAAC,CAAC,EAAE,OAAO,kCAAkC,CAAC,CAAC"}

package/dest/proofs/proof_data.js

@@ -0,0 +1,39 @@
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+import { RecursiveProof } from '../proofs/recursive_proof.js';
+import { VkData } from '../vks/index.js';
+/**
+ * Represents the data of a recursive proof.
+ */ export class ProofData {
+    publicInputs;
+    proof;
+    vkData;
+    constructor(publicInputs, proof, vkData){
+        this.publicInputs = publicInputs;
+        this.proof = proof;
+        this.vkData = vkData;
+    }
+    toBuffer() {
+        return serializeToBuffer(this.publicInputs, this.proof, this.vkData);
+    }
+    static fromBuffer(buffer, publicInputs) {
+        const reader = BufferReader.asReader(buffer);
+        return new ProofData(reader.readObject(publicInputs), RecursiveProof.fromBuffer(reader), reader.readObject(VkData));
+    }
+}
+/**
+ * Represents the data of a recursive proof for a circuit with a fixed verification key.
+ */ export class ProofDataForFixedVk {
+    publicInputs;
+    proof;
+    constructor(publicInputs, proof){
+        this.publicInputs = publicInputs;
+        this.proof = proof;
+    }
+    toBuffer() {
+        return serializeToBuffer(this.publicInputs, this.proof);
+    }
+    static fromBuffer(buffer, publicInputs) {
+        const reader = BufferReader.asReader(buffer);
+        return new ProofDataForFixedVk(reader.readObject(publicInputs), RecursiveProof.fromBuffer(reader));
+    }
+}