@aztec-labs/stdlib 6.0.0-nightly.20260829

package/dest/proofs/proof.d.ts

@@ -0,0 +1,64 @@
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { BufferReader } from '@aztec-labs/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;
+    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<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[];
+    /**
+     * 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=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2YuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvcHJvb2YudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLHFDQUFxQyxDQUFDO0FBQ3pELE9BQU8sRUFBRSxZQUFZLEVBQXFCLE1BQU0sa0NBQWtDLENBQUM7QUFNbkY7Ozs7O0dBS0c7QUFDSCxxQkFBYSxLQUFLO0lBS2Q7O09BRUc7SUFDSSxNQUFNLEVBQUUsTUFBTTtJQUVkLGVBQWUsRUFBRSxNQUFNO0lBUmhDLFFBQVEsQ0FBQyxZQUFZLEVBQUUsR0FBRyxDQUFDO0lBRTNCO0lBQ0U7O09BRUc7SUFDSSxNQUFNLEVBQUUsTUFBTSxFQUVkLGVBQWUsRUFBRSxNQUFNLEVBQzVCO0lBRUo7Ozs7OztPQU1HO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksR0FBRyxLQUFLLENBTXREO0lBRUQ7Ozs7O09BS0c7SUFDSSxRQUFRLDRCQUVkO0lBRUQ7OztPQUdHO0lBQ0ksUUFBUSxrQkFFZDtJQUVEOzs7T0FHRztJQUNJLG1CQUFtQixJQUFJLE1BQU0sQ0FXbkM7SUFLTSxtQkFBbUIsSUFBSSxFQUFFLEVBQUUsQ0FVakM7SUFFRDs7OztPQUlHO0lBQ0gsTUFBTSxDQUFDLFVBQVUsQ0FBQyxHQUFHLEVBQUUsTUFBTSxTQUU1QjtJQUVELG9EQUFvRDtJQUM3QyxPQUFPLFlBSWI7SUFFRCw4QkFBOEI7SUFDOUIsTUFBTSxDQUFDLEtBQUssVUFFWDtDQUNGO0FBRUQ7Ozs7R0FJRztBQUNILHdCQUFnQixjQUFjLFVBRTdCIn0=

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,qCAAqC,CAAC;AACzD,OAAO,EAAE,YAAY,EAAqB,MAAM,kCAAkC,CAAC;AAMnF;;;;;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

@@ -0,0 +1,99 @@
+import { PAIRING_POINTS_SIZE } from '@aztec-labs/constants';
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { BufferReader, serializeToBuffer } from '@aztec-labs/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec-labs/foundation/string';
+import { strict as assert } from 'assert';
+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;
+    constructor(/**
+     * Holds the serialized proof data in a binary buffer format.
+     */ buffer, numPublicInputs){
+        this.buffer = buffer;
+        this.numPublicInputs = numPublicInputs;
+    }
+    /**
+   * 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());
+    }
+    /**
+   * 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() {
+        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.
+   * @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/proof_data.d.ts

@@ -0,0 +1,33 @@
+import type { CHONK_PROOF_LENGTH, RECURSIVE_PROOF_LENGTH, RECURSIVE_ROLLUP_HONK_PROOF_LENGTH } from '@aztec-labs/constants';
+import { BufferReader, type Bufferable } from '@aztec-labs/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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvb2ZfZGF0YS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3Byb29mcy9wcm9vZl9kYXRhLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUNWLGtCQUFrQixFQUNsQixzQkFBc0IsRUFDdEIsa0NBQWtDLEVBQ25DLE1BQU0sdUJBQXVCLENBQUM7QUFDL0IsT0FBTyxFQUFFLFlBQVksRUFBRSxLQUFLLFVBQVUsRUFBcUIsTUFBTSxrQ0FBa0MsQ0FBQztBQUVwRyxPQUFPLEVBQUUsY0FBYyxFQUFFLE1BQU0sOEJBQThCLENBQUM7QUFDOUQsT0FBTyxFQUFFLE1BQU0sRUFBRSxNQUFNLGlCQUFpQixDQUFDO0FBRXpDOztHQUVHO0FBQ0gscUJBQWEsU0FBUyxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU07SUFFN0QsWUFBWSxFQUFFLENBQUM7SUFDZixLQUFLLEVBQUUsY0FBYyxDQUFDLFlBQVksQ0FBQztJQUNuQyxNQUFNLEVBQUUsTUFBTTtJQUh2QixZQUNTLFlBQVksRUFBRSxDQUFDLEVBQ2YsS0FBSyxFQUFFLGNBQWMsQ0FBQyxZQUFZLENBQUMsRUFDbkMsTUFBTSxFQUFFLE1BQU0sRUFDbkI7SUFFRyxRQUFRLElBQUksTUFBTSxDQUV4QjtJQUVELE9BQWMsVUFBVSxDQUFDLENBQUMsU0FBUyxVQUFVLEVBQUUsWUFBWSxTQUFTLE1BQU0sRUFDeEUsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEVBQzdCLFlBQVksRUFBRTtRQUNaLFVBQVUsRUFBRSxDQUFDLE1BQU0sRUFBRSxZQUFZLEtBQUssQ0FBQyxDQUFDO0tBQ3pDLEdBQ0EsU0FBUyxDQUFDLENBQUMsRUFBRSxZQUFZLENBQUMsQ0FHNUI7Q0FDRjtBQUVEOztHQUVHO0FBQ0gscUJBQWEsbUJBQW1CLENBQUMsQ0FBQyxTQUFTLFVBQVUsRUFBRSxZQUFZLFNBQVMsTUFBTTtJQUV2RSxZQUFZLEVBQUUsQ0FBQztJQUNmLEtBQUssRUFBRSxjQUFjLENBQUMsWUFBWSxDQUFDO0lBRjVDLFlBQ1MsWUFBWSxFQUFFLENBQUMsRUFDZixLQUFLLEVBQUUsY0FBYyxDQUFDLFlBQVksQ0FBQyxFQUN4QztJQUVHLFFBQVEsSUFBSSxNQUFNLENBRXhCO0lBRUQsT0FBYyxVQUFVLENBQUMsQ0FBQyxTQUFTLFVBQVUsRUFBRSxZQUFZLFNBQVMsTUFBTSxFQUN4RSxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksRUFDN0IsWUFBWSxFQUFFO1FBQ1osVUFBVSxFQUFFLENBQUMsTUFBTSxFQUFFLFlBQVksS0FBSyxDQUFDLENBQUM7S0FDekMsR0FDQSxtQkFBbUIsQ0FBQyxDQUFDLEVBQUUsWUFBWSxDQUFDLENBR3RDO0NBQ0Y7QUFFRCxNQUFNLE1BQU0sY0FBYyxDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLGtCQUFrQixDQUFDLENBQUM7QUFFM0YsTUFBTSxNQUFNLGtCQUFrQixDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLHNCQUFzQixDQUFDLENBQUM7QUFFbkcsTUFBTSxNQUFNLG1CQUFtQixDQUFDLENBQUMsU0FBUyxVQUFVLElBQUksU0FBUyxDQUFDLENBQUMsRUFBRSxPQUFPLGtDQUFrQyxDQUFDLENBQUMifQ==

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,EACV,kBAAkB,EAClB,sBAAsB,EACtB,kCAAkC,EACnC,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,KAAK,UAAU,EAAqB,MAAM,kCAAkC,CAAC;AAEpG,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-labs/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));
+    }
+}

package/dest/proofs/proving_request_type.d.ts

@@ -0,0 +1,18 @@
+export declare enum ProvingRequestType {
+    PUBLIC_VM = 0,
+    PUBLIC_CHONK_VERIFIER = 1,
+    PRIVATE_TX_BASE_ROLLUP = 2,
+    PUBLIC_TX_BASE_ROLLUP = 3,
+    TX_MERGE_ROLLUP = 4,
+    BLOCK_ROOT_ROLLUP = 5,
+    BLOCK_ROOT_SINGLE_TX_ROLLUP = 6,
+    BLOCK_ROOT_NO_TXS_ROLLUP = 7,
+    BLOCK_MERGE_ROLLUP = 8,
+    CHECKPOINT_ROOT_ROLLUP = 9,
+    CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP = 10,
+    CHECKPOINT_PADDING_ROLLUP = 11,
+    CHECKPOINT_MERGE_ROLLUP = 12,
+    ROOT_ROLLUP = 13,
+    INBOX_PARITY = 14
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJvdmluZ19yZXF1ZXN0X3R5cGUuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9wcm9vZnMvcHJvdmluZ19yZXF1ZXN0X3R5cGUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsb0JBQVksa0JBQWtCO0lBQzVCLFNBQVMsSUFBQTtJQUNULHFCQUFxQixJQUFBO0lBRXJCLHNCQUFzQixJQUFBO0lBQ3RCLHFCQUFxQixJQUFBO0lBQ3JCLGVBQWUsSUFBQTtJQUNmLGlCQUFpQixJQUFBO0lBQ2pCLDJCQUEyQixJQUFBO0lBQzNCLHdCQUF3QixJQUFBO0lBQ3hCLGtCQUFrQixJQUFBO0lBQ2xCLHNCQUFzQixJQUFBO0lBQ3RCLG1DQUFtQyxLQUFBO0lBQ25DLHlCQUF5QixLQUFBO0lBQ3pCLHVCQUF1QixLQUFBO0lBQ3ZCLFdBQVcsS0FBQTtJQUVYLFlBQVksS0FBQTtDQUNiIn0=

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;IACT,qBAAqB,IAAA;IAErB,sBAAsB,IAAA;IACtB,qBAAqB,IAAA;IACrB,eAAe,IAAA;IACf,iBAAiB,IAAA;IACjB,2BAA2B,IAAA;IAC3B,wBAAwB,IAAA;IACxB,kBAAkB,IAAA;IAClB,sBAAsB,IAAA;IACtB,mCAAmC,KAAA;IACnC,yBAAyB,KAAA;IACzB,uBAAuB,KAAA;IACvB,WAAW,KAAA;IAEX,YAAY,KAAA;CACb"}

package/dest/proofs/proving_request_type.js

@@ -0,0 +1,18 @@
+export var ProvingRequestType = /*#__PURE__*/ function(ProvingRequestType) {
+    ProvingRequestType[ProvingRequestType["PUBLIC_VM"] = 0] = "PUBLIC_VM";
+    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_ROLLUP"] = 5] = "BLOCK_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_SINGLE_TX_ROLLUP"] = 6] = "BLOCK_ROOT_SINGLE_TX_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_ROOT_NO_TXS_ROLLUP"] = 7] = "BLOCK_ROOT_NO_TXS_ROLLUP";
+    ProvingRequestType[ProvingRequestType["BLOCK_MERGE_ROLLUP"] = 8] = "BLOCK_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_ROOT_ROLLUP"] = 9] = "CHECKPOINT_ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP"] = 10] = "CHECKPOINT_ROOT_SINGLE_BLOCK_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_PADDING_ROLLUP"] = 11] = "CHECKPOINT_PADDING_ROLLUP";
+    ProvingRequestType[ProvingRequestType["CHECKPOINT_MERGE_ROLLUP"] = 12] = "CHECKPOINT_MERGE_ROLLUP";
+    ProvingRequestType[ProvingRequestType["ROOT_ROLLUP"] = 13] = "ROOT_ROLLUP";
+    ProvingRequestType[ProvingRequestType["INBOX_PARITY"] = 14] = "INBOX_PARITY";
+    return ProvingRequestType;
+}({});

package/dest/proofs/recursive_proof.d.ts

@@ -0,0 +1,84 @@
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { BufferReader } from '@aztec-labs/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<ArrayBufferLike>;
+    /**
+     * 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<ArrayBufferLike>;
+    /** Creates an instance from a hex string with expected size. */
+    static schemaFor<N extends number>(expectedSize?: N): import("zod").ZodPipe<import("@aztec-labs/foundation/schemas").ZodFor<Buffer<ArrayBufferLike>>, import("zod").ZodTransform<RecursiveProof<N>, Buffer<ArrayBufferLike>>>;
+}
+/**
+ * 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=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicmVjdXJzaXZlX3Byb29mLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvcHJvb2ZzL3JlY3Vyc2l2ZV9wcm9vZi50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFDQSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0scUNBQXFDLENBQUM7QUFFekQsT0FBTyxFQUFFLFlBQVksRUFBcUIsTUFBTSxrQ0FBa0MsQ0FBQztBQUduRixPQUFPLEVBQUUsS0FBSyxFQUFrQixNQUFNLFlBQVksQ0FBQztBQUVuRDs7Ozs7Ozs7O0dBU0c7QUFDSCxxQkFBYSxjQUFjLENBQUMsQ0FBQyxTQUFTLE1BQU07SUFFeEM7O09BRUc7SUFDSSxLQUFLLEVBQUUsRUFBRSxFQUFFO0lBRWxCOztPQUVHO0lBQ0ksV0FBVyxFQUFFLEtBQUs7SUFDekI7O09BRUc7SUFDSSxXQUFXLEVBQUUsT0FBTztJQUNwQixXQUFXLEVBQUUsQ0FBQztJQWR2QjtJQUNFOztPQUVHO0lBQ0ksS0FBSyxFQUFFLEVBQUUsRUFBRTtJQUVsQjs7T0FFRztJQUNJLFdBQVcsRUFBRSxLQUFLO0lBQ3pCOztPQUVHO0lBQ0ksV0FBVyxFQUFFLE9BQU8sRUFDcEIsV0FBVyxFQUFFLENBQUMsRUFLdEI7SUFFRDs7Ozs7O09BTUc7SUFDSCxNQUFNLENBQUMsVUFBVSxDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsTUFBTSxFQUFFLE1BQU0sR0FBRyxZQUFZLEVBQUUsWUFBWSxDQUFDLEVBQUUsQ0FBQyxHQUFHLGNBQWMsQ0FBQyxDQUFDLENBQUMsQ0FZdEc7SUFFRDs7Ozs7T0FLRztJQUNJLFFBQVEsNEJBRWQ7SUFFRDs7O09BR0c7SUFDSSxRQUFRLGtCQUVkO0lBRUQ7Ozs7T0FJRztJQUNILE1BQU0sQ0FBQyxVQUFVLENBQUMsQ0FBQyxTQUFTLE1BQU0sRUFBRSxHQUFHLEVBQUUsTUFBTSxFQUFFLFlBQVksQ0FBQyxFQUFFLENBQUMsR0FBRyxjQUFjLENBQUMsQ0FBQyxDQUFDLENBRXBGO0lBRUQsOERBQThEO0lBQzlELE1BQU0sNEJBRUw7SUFFRCxnRUFBZ0U7SUFDaEUsTUFBTSxDQUFDLFNBQVMsQ0FBQyxDQUFDLFNBQVMsTUFBTSxFQUFFLFlBQVksQ0FBQyxFQUFFLENBQUMsMktBRWxEO0NBQ0Y7QUFFRDs7OztHQUlHO0FBQ0gsd0JBQWdCLHVCQUF1QixDQUFDLENBQUMsU0FBUyxNQUFNLEVBQUUsSUFBSSxFQUFFLENBQUMscUJBRWhFO0FBRUQsd0JBQWdCLGtCQUFrQixDQUFDLFlBQVksU0FBUyxNQUFNLEVBQUUsSUFBSSxFQUFFLFlBQVksRUFBRSxJQUFJLFNBQUksZ0NBTzNGO0FBRUQ7OztHQUdHO0FBQ0gsd0JBQWdCLDRCQUE0QixDQUFDLFlBQVksU0FBUyxNQUFNLEVBQUUsS0FBSyxFQUFFLEtBQUssRUFBRSxJQUFJLEVBQUUsWUFBWSxnQ0FFekcifQ==

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,qCAAqC,CAAC;AAEzD,OAAO,EAAE,YAAY,EAAqB,MAAM,kCAAkC,CAAC;AAGnF,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;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,2KAElD;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/proofs/recursive_proof.js

@@ -0,0 +1,93 @@
+import { makeTuple } from '@aztec-labs/foundation/array';
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { schemas } from '@aztec-labs/foundation/schemas';
+import { BufferReader, serializeToBuffer } from '@aztec-labs/foundation/serialize';
+import { bufferToHex, hexToBuffer } from '@aztec-labs/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,5 @@
+import { AVM_V2_PROOF_LENGTH_IN_FIELDS } from '@aztec-labs/constants';
+import { AvmCircuitPublicInputs } from '../avm/avm_circuit_public_inputs.js';
+import type { ProofDataForFixedVk } from '../proofs/proof_data.js';
+export type AvmProofData = ProofDataForFixedVk<AvmCircuitPublicInputs, typeof AVM_V2_PROOF_LENGTH_IN_FIELDS>;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYXZtX3Byb29mX2RhdGEuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9yb2xsdXAvYXZtX3Byb29mX2RhdGEudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLDZCQUE2QixFQUFFLE1BQU0sdUJBQXVCLENBQUM7QUFFdEUsT0FBTyxFQUFFLHNCQUFzQixFQUFFLE1BQU0scUNBQXFDLENBQUM7QUFDN0UsT0FBTyxLQUFLLEVBQUUsbUJBQW1CLEVBQUUsTUFBTSx5QkFBeUIsQ0FBQztBQUVuRSxNQUFNLE1BQU0sWUFBWSxHQUFHLG1CQUFtQixDQUFDLHNCQUFzQixFQUFFLE9BQU8sNkJBQTZCLENBQUMsQ0FBQyJ9

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,6BAA6B,EAAE,MAAM,uBAAuB,CAAC;AAEtE,OAAO,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAC7E,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAEnE,MAAM,MAAM,YAAY,GAAG,mBAAmB,CAAC,sBAAsB,EAAE,OAAO,6BAA6B,CAAC,CAAC"}

package/dest/rollup/avm_proof_data.js

@@ -0,0 +1 @@
+export { };

package/dest/rollup/base_rollup_hints.d.ts

@@ -0,0 +1,137 @@
+import { SpongeBlob } from '@aztec-labs/blob-lib/types';
+import { ARCHIVE_HEIGHT, MAX_CONTRACT_CLASS_LOGS_PER_TX } from '@aztec-labs/constants';
+import { Fr } from '@aztec-labs/foundation/curves/bn254';
+import { BufferReader, type Tuple } from '@aztec-labs/foundation/serialize';
+import type { FieldsOf } from '@aztec-labs/foundation/types';
+import { ContractClassLogFields } from '../logs/index.js';
+import { AppendOnlyTreeSnapshot } from '../trees/append_only_tree_snapshot.js';
+import { PublicDataTreeLeafPreimage } from '../trees/public_data_leaf.js';
+import { PartialStateReference } from '../tx/partial_state_reference.js';
+import { BlockConstantData } from './block_constant_data.js';
+import { TreeSnapshotDiffHints } from './tree_snapshot_diff_hints.js';
+export type BaseRollupHints = PrivateBaseRollupHints | PublicBaseRollupHints;
+export declare class PrivateBaseRollupHints {
+    /**
+     * Partial state reference at the start of the rollup.
+     */
+    start: PartialStateReference;
+    /**
+     * Sponge state to absorb blob inputs at the start of the rollup.
+     */
+    startSpongeBlob: SpongeBlob;
+    /**
+     * Hints used while proving state diff validity.
+     */
+    treeSnapshotDiffHints: TreeSnapshotDiffHints;
+    /**
+     * Public data tree leaf preimage for accessing the balance of the fee payer.
+     */
+    feePayerBalanceLeafPreimage: PublicDataTreeLeafPreimage;
+    /**
+     * Membership witnesses of blocks referred by each of the 2 kernels.
+     */
+    anchorBlockArchiveSiblingPath: Tuple<Fr, typeof ARCHIVE_HEIGHT>;
+    /**
+     * Preimages to the kernel's contractClassLogsHashes.
+     */
+    contractClassLogsFields: Tuple<ContractClassLogFields, typeof MAX_CONTRACT_CLASS_LOGS_PER_TX>;
+    /**
+     * Data which is not modified by the base rollup circuit.
+     */
+    constants: BlockConstantData;
+    constructor(
+    /**
+     * Partial state reference at the start of the rollup.
+     */
+    start: PartialStateReference, 
+    /**
+     * Sponge state to absorb blob inputs at the start of the rollup.
+     */
+    startSpongeBlob: SpongeBlob, 
+    /**
+     * Hints used while proving state diff validity.
+     */
+    treeSnapshotDiffHints: TreeSnapshotDiffHints, 
+    /**
+     * Public data tree leaf preimage for accessing the balance of the fee payer.
+     */
+    feePayerBalanceLeafPreimage: PublicDataTreeLeafPreimage, 
+    /**
+     * Membership witnesses of blocks referred by each of the 2 kernels.
+     */
+    anchorBlockArchiveSiblingPath: Tuple<Fr, typeof ARCHIVE_HEIGHT>, 
+    /**
+     * Preimages to the kernel's contractClassLogsHashes.
+     */
+    contractClassLogsFields: Tuple<ContractClassLogFields, typeof MAX_CONTRACT_CLASS_LOGS_PER_TX>, 
+    /**
+     * Data which is not modified by the base rollup circuit.
+     */
+    constants: BlockConstantData);
+    static from(fields: FieldsOf<PrivateBaseRollupHints>): PrivateBaseRollupHints;
+    static getFields(fields: FieldsOf<PrivateBaseRollupHints>): readonly [PartialStateReference, SpongeBlob, TreeSnapshotDiffHints, PublicDataTreeLeafPreimage, [Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr], [ContractClassLogFields], BlockConstantData];
+    /**
+     * 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}`;
+    static fromBuffer(buffer: Buffer | BufferReader): PrivateBaseRollupHints;
+    static fromString(str: string): PrivateBaseRollupHints;
+    static empty(): PrivateBaseRollupHints;
+}
+export declare class PublicBaseRollupHints {
+    /**
+     * Sponge state to absorb blob inputs at the start of the rollup.
+     */
+    startSpongeBlob: SpongeBlob;
+    /**
+     * Archive tree snapshot at the very beginning of the block containing this base rollup.
+     */
+    lastArchive: AppendOnlyTreeSnapshot;
+    /**
+     * Membership witnesses of blocks referred by each of the 2 kernels.
+     */
+    anchorBlockArchiveSiblingPath: Tuple<Fr, typeof ARCHIVE_HEIGHT>;
+    /**
+     * Preimages to the kernel's contractClassLogsHashes.
+     */
+    contractClassLogsFields: Tuple<ContractClassLogFields, typeof MAX_CONTRACT_CLASS_LOGS_PER_TX>;
+    constructor(
+    /**
+     * Sponge state to absorb blob inputs at the start of the rollup.
+     */
+    startSpongeBlob: SpongeBlob, 
+    /**
+     * Archive tree snapshot at the very beginning of the block containing this base rollup.
+     */
+    lastArchive: AppendOnlyTreeSnapshot, 
+    /**
+     * Membership witnesses of blocks referred by each of the 2 kernels.
+     */
+    anchorBlockArchiveSiblingPath: Tuple<Fr, typeof ARCHIVE_HEIGHT>, 
+    /**
+     * Preimages to the kernel's contractClassLogsHashes.
+     */
+    contractClassLogsFields: Tuple<ContractClassLogFields, typeof MAX_CONTRACT_CLASS_LOGS_PER_TX>);
+    static from(fields: FieldsOf<PublicBaseRollupHints>): PublicBaseRollupHints;
+    static getFields(fields: FieldsOf<PublicBaseRollupHints>): readonly [SpongeBlob, AppendOnlyTreeSnapshot, [Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr, Fr], [ContractClassLogFields]];
+    /**
+     * 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}`;
+    static fromBuffer(buffer: Buffer | BufferReader): PublicBaseRollupHints;
+    static fromString(str: string): PublicBaseRollupHints;
+    static empty(): PublicBaseRollupHints;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYmFzZV9yb2xsdXBfaGludHMuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9yb2xsdXAvYmFzZV9yb2xsdXBfaGludHMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLFVBQVUsRUFBRSxNQUFNLDRCQUE0QixDQUFDO0FBQ3hELE9BQU8sRUFBRSxjQUFjLEVBQUUsOEJBQThCLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUV2RixPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0scUNBQXFDLENBQUM7QUFDekQsT0FBTyxFQUFFLFlBQVksRUFBRSxLQUFLLEtBQUssRUFBcUIsTUFBTSxrQ0FBa0MsQ0FBQztBQUUvRixPQUFPLEtBQUssRUFBRSxRQUFRLEVBQUUsTUFBTSw4QkFBOEIsQ0FBQztBQUU3RCxPQUFPLEVBQUUsc0JBQXNCLEVBQUUsTUFBTSxrQkFBa0IsQ0FBQztBQUMxRCxPQUFPLEVBQUUsc0JBQXNCLEVBQUUsTUFBTSx1Q0FBdUMsQ0FBQztBQUMvRSxPQUFPLEVBQUUsMEJBQTBCLEVBQUUsTUFBTSw4QkFBOEIsQ0FBQztBQUMxRSxPQUFPLEVBQUUscUJBQXFCLEVBQUUsTUFBTSxrQ0FBa0MsQ0FBQztBQUN6RSxPQUFPLEVBQUUsaUJBQWlCLEVBQUUsTUFBTSwwQkFBMEIsQ0FBQztBQUM3RCxPQUFPLEVBQUUscUJBQXFCLEVBQUUsTUFBTSwrQkFBK0IsQ0FBQztBQUV0RSxNQUFNLE1BQU0sZUFBZSxHQUFHLHNCQUFzQixHQUFHLHFCQUFxQixDQUFDO0FBRTdFLHFCQUFhLHNCQUFzQjtJQUUvQjs7T0FFRztJQUNJLEtBQUssRUFBRSxxQkFBcUI7SUFDbkM7O09BRUc7SUFDSSxlQUFlLEVBQUUsVUFBVTtJQUNsQzs7T0FFRztJQUNJLHFCQUFxQixFQUFFLHFCQUFxQjtJQUNuRDs7T0FFRztJQUNJLDJCQUEyQixFQUFFLDBCQUEwQjtJQUM5RDs7T0FFRztJQUNJLDZCQUE2QixFQUFFLEtBQUssQ0FBQyxFQUFFLEVBQUUsT0FBTyxjQUFjLENBQUM7SUFDdEU7O09BRUc7SUFDSSx1QkFBdUIsRUFBRSxLQUFLLENBQUMsc0JBQXNCLEVBQUUsT0FBTyw4QkFBOEIsQ0FBQztJQUNwRzs7T0FFRztJQUNJLFNBQVMsRUFBRSxpQkFBaUI7SUE1QnJDO0lBQ0U7O09BRUc7SUFDSSxLQUFLLEVBQUUscUJBQXFCO0lBQ25DOztPQUVHO0lBQ0ksZUFBZSxFQUFFLFVBQVU7SUFDbEM7O09BRUc7SUFDSSxxQkFBcUIsRUFBRSxxQkFBcUI7SUFDbkQ7O09BRUc7SUFDSSwyQkFBMkIsRUFBRSwwQkFBMEI7SUFDOUQ7O09BRUc7SUFDSSw2QkFBNkIsRUFBRSxLQUFLLENBQUMsRUFBRSxFQUFFLE9BQU8sY0FBYyxDQUFDO0lBQ3RFOztPQUVHO0lBQ0ksdUJBQXVCLEVBQUUsS0FBSyxDQUFDLHNCQUFzQixFQUFFLE9BQU8sOEJBQThCLENBQUM7SUFDcEc7O09BRUc7SUFDSSxTQUFTLEVBQUUsaUJBQWlCLEVBQ2pDO0lBRUosTUFBTSxDQUFDLElBQUksQ0FBQyxNQUFNLEVBQUUsUUFBUSxDQUFDLHNCQUFzQixDQUFDLEdBQUcsc0JBQXNCLENBRTVFO0lBRUQsTUFBTSxDQUFDLFNBQVMsQ0FBQyxNQUFNLEVBQUUsUUFBUSxDQUFDLHNCQUFzQixDQUFDLDBRQVV4RDtJQUVEOzs7T0FHRztJQUNILFFBQVEsNEJBRVA7SUFFRDs7O09BR0c7SUFDSCxRQUFRLGtCQUVQO0lBRUQsTUFBTSxDQUFDLFVBQVUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFlBQVksR0FBRyxzQkFBc0IsQ0FXdkU7SUFFRCxNQUFNLENBQUMsVUFBVSxDQUFDLEdBQUcsRUFBRSxNQUFNLDBCQUU1QjtJQUVELE1BQU0sQ0FBQyxLQUFLLDJCQVVYO0NBQ0Y7QUFFRCxxQkFBYSxxQkFBcUI7SUFFOUI7O09BRUc7SUFDSSxlQUFlLEVBQUUsVUFBVTtJQUNsQzs7T0FFRztJQUNJLFdBQVcsRUFBRSxzQkFBc0I7SUFDMUM7O09BRUc7SUFDSSw2QkFBNkIsRUFBRSxLQUFLLENBQUMsRUFBRSxFQUFFLE9BQU8sY0FBYyxDQUFDO0lBQ3RFOztPQUVHO0lBQ0ksdUJBQXVCLEVBQUUsS0FBSyxDQUFDLHNCQUFzQixFQUFFLE9BQU8sOEJBQThCLENBQUM7SUFoQnRHO0lBQ0U7O09BRUc7SUFDSSxlQUFlLEVBQUUsVUFBVTtJQUNsQzs7T0FFRztJQUNJLFdBQVcsRUFBRSxzQkFBc0I7SUFDMUM7O09BRUc7SUFDSSw2QkFBNkIsRUFBRSxLQUFLLENBQUMsRUFBRSxFQUFFLE9BQU8sY0FBYyxDQUFDO0lBQ3RFOztPQUVHO0lBQ0ksdUJBQXVCLEVBQUUsS0FBSyxDQUFDLHNCQUFzQixFQUFFLE9BQU8sOEJBQThCLENBQUMsRUFDbEc7SUFFSixNQUFNLENBQUMsSUFBSSxDQUFDLE1BQU0sRUFBRSxRQUFRLENBQUMscUJBQXFCLENBQUMsR0FBRyxxQkFBcUIsQ0FFMUU7SUFFRCxNQUFNLENBQUMsU0FBUyxDQUFDLE1BQU0sRUFBRSxRQUFRLENBQUMscUJBQXFCLENBQUMscU1BT3ZEO0lBRUQ7OztPQUdHO0lBQ0gsUUFBUSw0QkFFUDtJQUVEOzs7T0FHRztJQUNILFFBQVEsa0JBRVA7SUFFRCxNQUFNLENBQUMsVUFBVSxDQUFDLE1BQU0sRUFBRSxNQUFNLEdBQUcsWUFBWSxHQUFHLHFCQUFxQixDQVF0RTtJQUVELE1BQU0sQ0FBQyxVQUFVLENBQUMsR0FBRyxFQUFFLE1BQU0seUJBRTVCO0lBRUQsTUFBTSxDQUFDLEtBQUssMEJBT1g7Q0FDRiJ9

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

@@ -0,0 +1 @@
+{"version":3,"file":"base_rollup_hints.d.ts","sourceRoot":"","sources":["../../src/rollup/base_rollup_hints.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,8BAA8B,EAAE,MAAM,uBAAuB,CAAC;AAEvF,OAAO,EAAE,EAAE,EAAE,MAAM,qCAAqC,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,KAAK,KAAK,EAAqB,MAAM,kCAAkC,CAAC;AAE/F,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAE7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAC1D,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,qBAAqB,EAAE,MAAM,kCAAkC,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AAEtE,MAAM,MAAM,eAAe,GAAG,sBAAsB,GAAG,qBAAqB,CAAC;AAE7E,qBAAa,sBAAsB;IAE/B;;OAEG;IACI,KAAK,EAAE,qBAAqB;IACnC;;OAEG;IACI,eAAe,EAAE,UAAU;IAClC;;OAEG;IACI,qBAAqB,EAAE,qBAAqB;IACnD;;OAEG;IACI,2BAA2B,EAAE,0BAA0B;IAC9D;;OAEG;IACI,6BAA6B,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC;IACtE;;OAEG;IACI,uBAAuB,EAAE,KAAK,CAAC,sBAAsB,EAAE,OAAO,8BAA8B,CAAC;IACpG;;OAEG;IACI,SAAS,EAAE,iBAAiB;IA5BrC;IACE;;OAEG;IACI,KAAK,EAAE,qBAAqB;IACnC;;OAEG;IACI,eAAe,EAAE,UAAU;IAClC;;OAEG;IACI,qBAAqB,EAAE,qBAAqB;IACnD;;OAEG;IACI,2BAA2B,EAAE,0BAA0B;IAC9D;;OAEG;IACI,6BAA6B,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC;IACtE;;OAEG;IACI,uBAAuB,EAAE,KAAK,CAAC,sBAAsB,EAAE,OAAO,8BAA8B,CAAC;IACpG;;OAEG;IACI,SAAS,EAAE,iBAAiB,EACjC;IAEJ,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,sBAAsB,CAAC,GAAG,sBAAsB,CAE5E;IAED,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,sBAAsB,CAAC,0QAUxD;IAED;;;OAGG;IACH,QAAQ,4BAEP;IAED;;;OAGG;IACH,QAAQ,kBAEP;IAED,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,sBAAsB,CAWvE;IAED,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,0BAE5B;IAED,MAAM,CAAC,KAAK,2BAUX;CACF;AAED,qBAAa,qBAAqB;IAE9B;;OAEG;IACI,eAAe,EAAE,UAAU;IAClC;;OAEG;IACI,WAAW,EAAE,sBAAsB;IAC1C;;OAEG;IACI,6BAA6B,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC;IACtE;;OAEG;IACI,uBAAuB,EAAE,KAAK,CAAC,sBAAsB,EAAE,OAAO,8BAA8B,CAAC;IAhBtG;IACE;;OAEG;IACI,eAAe,EAAE,UAAU;IAClC;;OAEG;IACI,WAAW,EAAE,sBAAsB;IAC1C;;OAEG;IACI,6BAA6B,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC;IACtE;;OAEG;IACI,uBAAuB,EAAE,KAAK,CAAC,sBAAsB,EAAE,OAAO,8BAA8B,CAAC,EAClG;IAEJ,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,qBAAqB,CAAC,GAAG,qBAAqB,CAE1E;IAED,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,qBAAqB,CAAC,qMAOvD;IAED;;;OAGG;IACH,QAAQ,4BAEP;IAED;;;OAGG;IACH,QAAQ,kBAEP;IAED,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,qBAAqB,CAQtE;IAED,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,yBAE5B;IAED,MAAM,CAAC,KAAK,0BAOX;CACF"}