@aztec/stdlib 0.0.0-test.1 → 0.0.1-commit.5476d83

package/dest/proofs/chonk_proof.js

@@ -0,0 +1,101 @@
+import { CHONK_PROOF_LENGTH } from '@aztec/constants';
+import { randomBytes } from '@aztec/foundation/crypto';
+import { Fr } from '@aztec/foundation/fields';
+import { bufferSchemaFor } from '@aztec/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
+// CHONK: "Client Honk" - An UltraHonk variant with incremental folding and delayed non-native arithmetic.
+export class ChonkProof {
+    fields;
+    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){
+        this.fields = fields;
+        if (fields.length !== CHONK_PROOF_LENGTH) {
+            throw new Error(`Invalid ChonkProof length: ${fields.length}`);
+        }
+    }
+    attachPublicInputs(publicInputs) {
+        return new ChonkProofWithPublicInputs([
+            ...publicInputs,
+            ...this.fields
+        ]);
+    }
+    isEmpty() {
+        return this.fields.every((field)=>field.isZero());
+    }
+    static empty() {
+        return new ChonkProof(new Array(CHONK_PROOF_LENGTH).fill(Fr.ZERO));
+    }
+    static random() {
+        // NB: Not using Fr.random here because it slows down some tests that require a large number of txs significantly.
+        const reducedFrSize = Fr.SIZE_IN_BYTES - 1;
+        const randomFields = randomBytes(CHONK_PROOF_LENGTH * reducedFrSize);
+        const proof = Array.from({
+            length: CHONK_PROOF_LENGTH
+        }, (_, i)=>new Fr(randomFields.subarray(i * reducedFrSize, (i + 1) * reducedFrSize)));
+        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();
+    }
+    static fromBuffer(buffer) {
+        const reader = BufferReader.asReader(buffer);
+        const proofLength = reader.readNumber();
+        const proof = reader.readArray(proofLength, Fr);
+        return new ChonkProof(proof);
+    }
+    toBuffer() {
+        return serializeToBuffer(this.fields.length, this.fields);
+    }
+}
+export class ChonkProofWithPublicInputs {
+    fieldsWithPublicInputs;
+    constructor(// The proof fields with public inputs.
+    // For recursive verification, use without public inputs via `removePublicInputs()`.
+    fieldsWithPublicInputs){
+        this.fieldsWithPublicInputs = fieldsWithPublicInputs;
+        if (fieldsWithPublicInputs.length < CHONK_PROOF_LENGTH) {
+            throw new Error(`Invalid ChonkProofWithPublicInputs length: ${fieldsWithPublicInputs.length}`);
+        }
+    }
+    getPublicInputs() {
+        const numPublicInputs = this.fieldsWithPublicInputs.length - CHONK_PROOF_LENGTH;
+        return this.fieldsWithPublicInputs.slice(0, numPublicInputs);
+    }
+    removePublicInputs() {
+        const numPublicInputs = this.fieldsWithPublicInputs.length - CHONK_PROOF_LENGTH;
+        return new ChonkProof(this.fieldsWithPublicInputs.slice(numPublicInputs));
+    }
+    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() {
+        return serializeToBuffer(this.fieldsWithPublicInputs.length, 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,5 +1,3 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
 import { Fr } from '@aztec/foundation/fields';
 import { BufferReader } from '@aztec/foundation/serialize';
 /**
@@ -9,14 +7,9 @@ import { BufferReader } from '@aztec/foundation/serialize';
  * 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.
@@ -36,15 +29,18 @@ export declare class Proof {
      *
      * @returns A Buffer containing the serialized proof data in custom format.
      */
-    toBuffer(): Buffer;
+    toBuffer(): Buffer<ArrayBufferLike>;
     /**
      * Serialize the Proof instance to a hex string.
      * @returns The hex string representation of the proof data.
      */
     toString(): `0x${string}`;
+    /**
+     * Returns the proof without the public inputs, but includes the pairing point object as part of the proof.
+     * @returns Proof in bytes form, including the pairing point object at the start.
+     */
     withoutPublicInputs(): Buffer;
     extractPublicInputs(): Fr[];
-    extractAggregationObject(): Fr[];
     /**
      * Deserialize a Proof instance from a hex string.
      * @param str - A hex string to deserialize from.
@@ -62,4 +58,4 @@ export declare class Proof {
  * @returns The empty "proof".
  */
 export declare function makeEmptyProof(): Proof;
-//# sourceMappingURL=proof.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2YuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvcHJvb2YudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLDBCQUEwQixDQUFDO0FBQzlDLE9BQU8sRUFBRSxZQUFZLEVBQXFCLE1BQU0sNkJBQTZCLENBQUM7QUFPOUU7Ozs7O0dBS0c7QUFDSCxxQkFBYSxLQUFLO0lBUVAsTUFBTSxFQUFFLE1BQU07SUFFZCxlQUFlLEVBQUUsTUFBTTtJQVJoQyxRQUFRLENBQUMsWUFBWSxFQUFFLEdBQUcsQ0FBQztJQUUzQjtJQUNFOztPQUVHO0lBQ0ksTUFBTSxFQUFFLE1BQU0sRUFFZCxlQUFlLEVBQUUsTUFBTSxFQUM1QjtJQUVKOzs7Ozs7T0FNRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEdBQUcsS0FBSyxDQU10RDtJQUVEOzs7OztPQUtHO0lBQ0ksUUFBUSw0QkFFZDtJQUVEOzs7T0FHRztJQUNJLFFBQVEsa0JBRWQ7SUFFRDs7O09BR0c7SUFDSSxtQkFBbUIsSUFBSSxNQUFNLENBV25DO0lBS00sbUJBQW1CLElBQUksRUFBRSxFQUFFLENBVWpDO0lBRUQ7Ozs7T0FJRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsR0FBRyxFQUFFLE1BQU0sU0FFNUI7SUFFRCxvREFBb0Q7SUFDN0MsT0FBTyxZQUliO0lBRUQsOEJBQThCO0lBQzlCLE1BQU0sQ0FBQyxLQUFLLFVBRVg7Q0FDRjtBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsY0FBYyxVQUU3QiJ9

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;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"}
+{"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;IAQP,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,7 +1,8 @@
-import { AGGREGATION_OBJECT_LENGTH } from '@aztec/constants';
+import { PAIRING_POINTS_SIZE } from '@aztec/constants';
 import { Fr } from '@aztec/foundation/fields';
 import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
 import { bufferToHex, hexToBuffer } from '@aztec/foundation/string';
+import { strict as assert } from 'assert';
 const EMPTY_PROOF_SIZE = 42;
 /**
  * The Proof class is a wrapper around the circuits proof.
@@ -13,19 +14,11 @@ const EMPTY_PROOF_SIZE = 42;
     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.
@@ -54,19 +47,34 @@ const EMPTY_PROOF_SIZE = 42;
    */ 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)
-        ]);
+    /**
+   * Returns the proof without the public inputs, but includes the pairing point object as part of the proof.
+   * @returns Proof in bytes form, including the pairing point object at the start.
+   */ withoutPublicInputs() {
+        if (this.isEmpty()) {
+            return this.buffer;
+        }
+        // We are indexing to this particular size because we are assuming the proof buffer looks like:
+        // [binary public inputs, binary proof]
+        // Here, we are assuming the pairing point object is the last 16 fields of the public inputs.
+        assert(this.numPublicInputs >= PAIRING_POINTS_SIZE, 'Proof does not contain an aggregation object');
+        const proofStart = Fr.SIZE_IN_BYTES * (this.numPublicInputs - PAIRING_POINTS_SIZE);
+        assert(this.buffer.length >= proofStart, 'Proof buffer is not appropriately sized to call withoutPublicInputs()');
+        return this.buffer.subarray(proofStart);
     }
+    // This function assumes that the proof will contain an aggregation object and look something like:
+    // [binary public inputs, aggregation object, rest of proof]
+    // We are extracting the binary public inputs and reading them as Frs.
     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);
+        if (this.isEmpty()) {
+            // return array of this.numPublicInputs 0s
+            return new Array(this.numPublicInputs).fill(Fr.zero());
+        }
+        assert(this.numPublicInputs >= PAIRING_POINTS_SIZE, 'Proof does not contain an aggregation object');
+        const numInnerPublicInputs = this.numPublicInputs - PAIRING_POINTS_SIZE;
+        const reader = BufferReader.asReader(this.buffer.subarray(0, Fr.SIZE_IN_BYTES * numInnerPublicInputs));
+        const publicInputs = reader.readArray(numInnerPublicInputs, Fr);
+        return publicInputs;
     }
     /**
    * Deserialize a Proof instance from a hex string.

package/dest/proofs/proof_data.d.ts

@@ -0,0 +1,21 @@
+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>;
+}
+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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2ZfZGF0YS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3Byb29mcy9wcm9vZl9kYXRhLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLGtCQUFrQixFQUFFLHNCQUFzQixFQUFFLGtDQUFrQyxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFDdkgsT0FBTyxFQUFFLFlBQVksRUFBRSxLQUFLLFVBQVUsRUFBcUIsTUFBTSw2QkFBNkIsQ0FBQztBQUUvRixPQUFPLEVBQUUsY0FBYyxFQUFFLE1BQU0sOEJBQThCLENBQUM7QUFDOUQsT0FBTyxFQUFFLE1BQU0sRUFBRSxNQUFNLGlCQUFpQixDQUFDO0FBRXpDOztHQUVHO0FBQ0gscUJBQWEsU0FBUyxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU07SUFFN0QsWUFBWSxFQUFFLENBQUM7SUFDZixLQUFLLEVBQUUsY0FBYyxDQUFDLFlBQVksQ0FBQztJQUNuQyxNQUFNLEVBQUUsTUFBTTtJQUh2QixZQUNTLFlBQVksRUFBRSxDQUFDLEVBQ2YsS0FBSyxFQUFFLGNBQWMsQ0FBQyxZQUFZLENBQUMsRUFDbkMsTUFBTSxFQUFFLE1BQU0sRUFDbkI7SUFFRyxRQUFRLElBQUksTUFBTSxDQUV4QjtJQUVELE9BQWMsVUFBVSxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU0sRUFDeEUsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEVBQzdCLFlBQVksRUFBRTtRQUNaLFVBQVUsRUFBRSxDQUFDLE1BQU0sRUFBRSxZQUFZLEtBQUssQ0FBQyxDQUFDO0tBQ3pDLEdBQ0EsU0FBUyxDQUFDLENBQUMsRUFBRSxZQUFZLENBQUMsQ0FHNUI7Q0FDRjtBQUVELE1BQU0sTUFBTSxjQUFjLENBQUMsQ0FBQyxTQUFTLFVBQVUsSUFBSSxTQUFTLENBQUMsQ0FBQyxFQUFFLE9BQU8sa0JBQWtCLENBQUMsQ0FBQztBQUUzRixNQUFNLE1BQU0sa0JBQWtCLENBQUMsQ0FBQyxTQUFTLFVBQVUsSUFBSSxTQUFTLENBQUMsQ0FBQyxFQUFFLE9BQU8sc0JBQXNCLENBQUMsQ0FBQztBQUVuRyxNQUFNLE1BQU0sbUJBQW1CLENBQUMsQ0FBQyxTQUFTLFVBQVUsSUFBSSxTQUFTLENBQUMsQ0FBQyxFQUFFLE9BQU8sa0NBQWtDLENBQUMsQ0FBQyJ9

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,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,22 @@
+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));
+    }
+}

package/dest/proofs/proving_request_type.d.ts

@@ -1,16 +1,21 @@
 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
+    PUBLIC_CHONK_VERIFIER = 1,
+    PRIVATE_TX_BASE_ROLLUP = 2,
+    PUBLIC_TX_BASE_ROLLUP = 3,
+    TX_MERGE_ROLLUP = 4,
+    BLOCK_ROOT_FIRST_ROLLUP = 5,
+    BLOCK_ROOT_SINGLE_TX_FIRST_ROLLUP = 6,
+    BLOCK_ROOT_EMPTY_TX_FIRST_ROLLUP = 7,
+    BLOCK_ROOT_ROLLUP = 8,
+    BLOCK_ROOT_SINGLE_TX_ROLLUP = 9,
+    BLOCK_MERGE_ROLLUP = 10,
+    CHECKPOINT_ROOT_ROLLUP = 11,
+    CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP = 12,
+    CHECKPOINT_PADDING_ROLLUP = 13,
+    CHECKPOINT_MERGE_ROLLUP = 14,
+    ROOT_ROLLUP = 15,
+    PARITY_BASE = 16,
+    PARITY_ROOT = 17
 }
-//# sourceMappingURL=proving_request_type.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvdmluZ19yZXF1ZXN0X3R5cGUuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvcHJvdmluZ19yZXF1ZXN0X3R5cGUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsb0JBQVksa0JBQWtCO0lBQzVCLFNBQVMsSUFBQTtJQUNULHFCQUFxQixJQUFBO0lBRXJCLHNCQUFzQixJQUFBO0lBQ3RCLHFCQUFxQixJQUFBO0lBQ3JCLGVBQWUsSUFBQTtJQUNmLHVCQUF1QixJQUFBO0lBQ3ZCLGlDQUFpQyxJQUFBO0lBQ2pDLGdDQUFnQyxJQUFBO0lBQ2hDLGlCQUFpQixJQUFBO0lBQ2pCLDJCQUEyQixJQUFBO0lBQzNCLGtCQUFrQixLQUFBO0lBQ2xCLHNCQUFzQixLQUFBO0lBQ3RCLG1DQUFtQyxLQUFBO0lBQ25DLHlCQUF5QixLQUFBO0lBQ3pCLHVCQUF1QixLQUFBO0lBQ3ZCLFdBQVcsS0FBQTtJQUVYLFdBQVcsS0FBQTtJQUNYLFdBQVcsS0FBQTtDQUNaIn0=

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

@@ -1 +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"}
+{"version":3,"file":"proving_request_type.d.ts","sourceRoot":"","sources":["../../src/proofs/proving_request_type.ts"],"names":[],"mappings":"AAAA,oBAAY,kBAAkB;IAC5B,SAAS,IAAA;IACT,qBAAqB,IAAA;IAErB,sBAAsB,IAAA;IACtB,qBAAqB,IAAA;IACrB,eAAe,IAAA;IACf,uBAAuB,IAAA;IACvB,iCAAiC,IAAA;IACjC,gCAAgC,IAAA;IAChC,iBAAiB,IAAA;IACjB,2BAA2B,IAAA;IAC3B,kBAAkB,KAAA;IAClB,sBAAsB,KAAA;IACtB,mCAAmC,KAAA;IACnC,yBAAyB,KAAA;IACzB,uBAAuB,KAAA;IACvB,WAAW,KAAA;IAEX,WAAW,KAAA;IACX,WAAW,KAAA;CACZ"}

package/dest/proofs/proving_request_type.js

@@ -1,15 +1,21 @@
 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";
+    ProvingRequestType[ProvingRequestType["PUBLIC_CHONK_VERIFIER"] = 1] = "PUBLIC_CHONK_VERIFIER";
+    ProvingRequestType[ProvingRequestType["PRIVATE_TX_BASE_ROLLUP"] = 2] = "PRIVATE_TX_BASE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["PUBLIC_TX_BASE_ROLLUP"] = 3] = "PUBLIC_TX_BASE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["TX_MERGE_ROLLUP"] = 4] = "TX_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_FIRST_ROLLUP"] = 5] = "BLOCK_ROOT_FIRST_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_SINGLE_TX_FIRST_ROLLUP"] = 6] = "BLOCK_ROOT_SINGLE_TX_FIRST_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_EMPTY_TX_FIRST_ROLLUP"] = 7] = "BLOCK_ROOT_EMPTY_TX_FIRST_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_ROLLUP"] = 8] = "BLOCK_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_SINGLE_TX_ROLLUP"] = 9] = "BLOCK_ROOT_SINGLE_TX_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_MERGE_ROLLUP"] = 10] = "BLOCK_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_ROOT_ROLLUP"] = 11] = "CHECKPOINT_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP"] = 12] = "CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_PADDING_ROLLUP"] = 13] = "CHECKPOINT_PADDING_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_MERGE_ROLLUP"] = 14] = "CHECKPOINT_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["ROOT_ROLLUP"] = 15] = "ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["PARITY_BASE"] = 16] = "PARITY_BASE";
+    ProvingRequestType[ProvingRequestType["PARITY_ROOT"] = 17] = "PARITY_ROOT";
     return ProvingRequestType;
 }({});

package/dest/proofs/recursive_proof.d.ts

@@ -1,5 +1,3 @@
-/// <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';
@@ -14,17 +12,8 @@ import { Proof } from './proof.js';
  * 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(
@@ -54,7 +43,7 @@ export declare class RecursiveProof<N extends number> {
      *
      * @returns A Buffer containing the serialized proof data in custom format.
      */
-    toBuffer(): Buffer;
+    toBuffer(): Buffer<ArrayBufferLike>;
     /**
      * Serialize the Proof instance to a hex string.
      * @returns The hex string representation of the proof data.
@@ -67,24 +56,9 @@ export declare class RecursiveProof<N extends number> {
      */
     static fromString<N extends number>(str: string, expectedSize?: N): RecursiveProof<N>;
     /** Returns a buffer representation for JSON serialization. */
-    toJSON(): Buffer;
+    toJSON(): Buffer<ArrayBufferLike>;
     /** 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[];
-    }>;
+    static schemaFor<N extends number>(expectedSize?: N): import("zod").ZodEffects<import("@aztec/foundation/schemas").ZodFor<Buffer<ArrayBufferLike>>, RecursiveProof<N>, any>;
 }
 /**
  * Makes an empty proof.
@@ -98,4 +72,4 @@ export declare function makeRecursiveProof<PROOF_LENGTH extends number>(size: PR
  * @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
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicmVjdXJzaXZlX3Byb29mLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvcHJvb2ZzL3JlY3Vyc2l2ZV9wcm9vZi50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFDQSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFFOUMsT0FBTyxFQUFFLFlBQVksRUFBcUIsTUFBTSw2QkFBNkIsQ0FBQztBQUc5RSxPQUFPLEVBQUUsS0FBSyxFQUFrQixNQUFNLFlBQVksQ0FBQztBQUVuRDs7Ozs7Ozs7O0dBU0c7QUFDSCxxQkFBYSxjQUFjLENBQUMsQ0FBQyxTQUFTLE1BQU07SUFLakMsS0FBSyxFQUFFLEVBQUUsRUFBRTtJQUtYLFdBQVcsRUFBRSxLQUFLO0lBSWxCLFdBQVcsRUFBRSxPQUFPO0lBQ3BCLFdBQVcsRUFBRSxDQUFDO0lBZHZCO0lBQ0U7O09BRUc7SUFDSSxLQUFLLEVBQUUsRUFBRSxFQUFFO0lBRWxCOztPQUVHO0lBQ0ksV0FBVyxFQUFFLEtBQUs7SUFDekI7O09BRUc7SUFDSSxXQUFXLEVBQUUsT0FBTyxFQUNwQixXQUFXLEVBQUUsQ0FBQyxFQUt0QjtJQUVEOzs7Ozs7T0FNRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsQ0FBQyxTQUFTLE1BQU0sRUFBRSxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksRUFBRSxZQUFZLENBQUMsRUFBRSxDQUFDLEdBQUcsY0FBYyxDQUFDLENBQUMsQ0FBQyxDQVl0RztJQUVEOzs7OztPQUtHO0lBQ0ksUUFBUSw0QkFFZDtJQUVEOzs7T0FHRztJQUNJLFFBQVEsa0JBRWQ7SUFFRDs7OztPQUlHO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxDQUFDLFNBQVMsTUFBTSxFQUFFLEdBQUcsRUFBRSxNQUFNLEVBQUUsWUFBWSxDQUFDLEVBQUUsQ0FBQyxHQUFHLGNBQWMsQ0FBQyxDQUFDLENBQUMsQ0FFcEY7SUFFRCw4REFBOEQ7SUFDOUQsTUFBTSw0QkFFTDtJQUVELGdFQUFnRTtJQUNoRSxNQUFNLENBQUMsU0FBUyxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsWUFBWSxDQUFDLEVBQUUsQ0FBQyx5SEFFbEQ7Q0FDRjtBQUVEOzs7O0dBSUc7QUFDSCx3QkFBZ0IsdUJBQXVCLENBQUMsQ0FBQyxTQUFTLE1BQU0sRUFBRSxJQUFJLEVBQUUsQ0FBQyxxQkFFaEU7QUFFRCx3QkFBZ0Isa0JBQWtCLENBQUMsWUFBWSxTQUFTLE1BQU0sRUFBRSxJQUFJLEVBQUUsWUFBWSxFQUFFLElBQUksU0FBSSxnQ0FPM0Y7QUFFRDs7O0dBR0c7QUFDSCx3QkFBZ0IsNEJBQTRCLENBQUMsWUFBWSxTQUFTLE1BQU0sRUFBRSxLQUFLLEVBQUUsS0FBSyxFQUFFLElBQUksRUFBRSxZQUFZLGdDQUV6RyJ9

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

@@ -1 +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"}
+{"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;IAKjC,KAAK,EAAE,EAAE,EAAE;IAKX,WAAW,EAAE,KAAK;IAIlB,WAAW,EAAE,OAAO;IACpB,WAAW,EAAE,CAAC;IAdvB;IACE;;OAEG;IACI,KAAK,EAAE,EAAE,EAAE;IAElB;;OAEG;IACI,WAAW,EAAE,KAAK;IACzB;;OAEG;IACI,WAAW,EAAE,OAAO,EACpB,WAAW,EAAE,CAAC,EAKtB;IAED;;;;;;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,CAYtG;IAED;;;;;OAKG;IACI,QAAQ,4BAEd;IAED;;;OAGG;IACI,QAAQ,kBAEd;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAEpF;IAED,8DAA8D;IAC9D,MAAM,4BAEL;IAED,gEAAgE;IAChE,MAAM,CAAC,SAAS,CAAC,CAAC,SAAS,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,yHAElD;CACF;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/rollup/avm_proof_data.d.ts

@@ -1,17 +1,7 @@
-/// <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 { AVM_V2_PROOF_LENGTH_IN_FIELDS_PADDED } from '@aztec/constants';
+import { Fr } from '@aztec/foundation/fields';
 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
+import type { ProofData } from '../proofs/proof_data.js';
+export type AvmProofData = ProofData<AvmCircuitPublicInputs, typeof AVM_V2_PROOF_LENGTH_IN_FIELDS_PADDED>;
+export declare function enhanceProofWithPiValidationFlag(proof: Fr[], skipPublicInputsValidation: boolean): Fr[];
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXZtX3Byb29mX2RhdGEuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9yb2xsdXAvYXZtX3Byb29mX2RhdGEudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLG9DQUFvQyxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFDeEUsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLDBCQUEwQixDQUFDO0FBRTlDLE9BQU8sRUFBRSxzQkFBc0IsRUFBRSxNQUFNLHFDQUFxQyxDQUFDO0FBQzdFLE9BQU8sS0FBSyxFQUFFLFNBQVMsRUFBRSxNQUFNLHlCQUF5QixDQUFDO0FBRXpELE1BQU0sTUFBTSxZQUFZLEdBQUcsU0FBUyxDQUFDLHNCQUFzQixFQUFFLE9BQU8sb0NBQW9DLENBQUMsQ0FBQztBQUcxRyx3QkFBZ0IsZ0NBQWdDLENBQUMsS0FBSyxFQUFFLEVBQUUsRUFBRSxFQUFFLDBCQUEwQixFQUFFLE9BQU8sR0FBRyxFQUFFLEVBQUUsQ0FHdkcifQ==

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

@@ -1 +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"}
+{"version":3,"file":"avm_proof_data.d.ts","sourceRoot":"","sources":["../../src/rollup/avm_proof_data.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oCAAoC,EAAE,MAAM,kBAAkB,CAAC;AACxE,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAC7E,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEzD,MAAM,MAAM,YAAY,GAAG,SAAS,CAAC,sBAAsB,EAAE,OAAO,oCAAoC,CAAC,CAAC;AAG1G,wBAAgB,gCAAgC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,0BAA0B,EAAE,OAAO,GAAG,EAAE,EAAE,CAGvG"}

package/dest/rollup/avm_proof_data.js

@@ -1,25 +1,9 @@
-import { AVM_PROOF_LENGTH_IN_FIELDS } from '@aztec/constants';
-import { BufferReader, serializeToBuffer } from '@aztec/foundation/serialize';
-import { AvmCircuitPublicInputs } from '../avm/avm_circuit_public_inputs.js';
-import { RecursiveProof, makeEmptyRecursiveProof } from '../proofs/recursive_proof.js';
-import { VkWitnessData } from '../vks/vk_witness_data.js';
-export class AvmProofData {
-    publicInputs;
-    proof;
-    vkData;
-    constructor(publicInputs, proof, vkData){
-        this.publicInputs = publicInputs;
-        this.proof = proof;
-        this.vkData = vkData;
-    }
-    static fromBuffer(buffer) {
-        const reader = BufferReader.asReader(buffer);
-        return new AvmProofData(reader.readObject(AvmCircuitPublicInputs), RecursiveProof.fromBuffer(reader), reader.readObject(VkWitnessData));
-    }
-    toBuffer() {
-        return serializeToBuffer(this.publicInputs, this.proof, this.vkData);
-    }
-    static empty() {
-        return new AvmProofData(AvmCircuitPublicInputs.empty(), makeEmptyRecursiveProof(AVM_PROOF_LENGTH_IN_FIELDS), VkWitnessData.empty());
-    }
+import { AVM_V2_PROOF_LENGTH_IN_FIELDS_PADDED } from '@aztec/constants';
+import { Fr } from '@aztec/foundation/fields';
+// TODO(#14234)[Unconditional PIs validation]: remove this function.
+export function enhanceProofWithPiValidationFlag(proof, skipPublicInputsValidation) {
+    const skipPublicInputsField = skipPublicInputsValidation ? new Fr(1) : new Fr(0);
+    return [
+        skipPublicInputsField
+    ].concat(proof).slice(0, AVM_V2_PROOF_LENGTH_IN_FIELDS_PADDED);
 }