@aztec/prover-client 0.0.0-test.1 → 0.0.1-commit.023c3e5

package/dest/orchestrator/epoch-proving-state.js

@@ -1,8 +1,11 @@
-import { VK_TREE_HEIGHT } from '@aztec/constants';
-import { MembershipWitness, UnbalancedTreeStore } from '@aztec/foundation/trees';
-import { getVKIndex, getVKSiblingPath } from '@aztec/noir-protocol-circuits-types/vk-tree';
-import { BlockMergeRollupInputs, PreviousRollupBlockData, RootRollupInputs } from '@aztec/stdlib/rollup';
-import { BlockProvingState } from './block-proving-state.js';
+import { BatchedBlobAccumulator } from '@aztec/blob-lib';
+import { OUT_HASH_TREE_HEIGHT } from '@aztec/constants';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { MerkleTreeCalculator, UnbalancedTreeStore, shaMerkleHash } from '@aztec/foundation/trees';
+import { CheckpointMergeRollupPrivateInputs, CheckpointPaddingRollupPrivateInputs, RootRollupPrivateInputs } from '@aztec/stdlib/rollup';
+import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
+import { toProofData } from './block-building-helpers.js';
+import { CheckpointProvingState } from './checkpoint-proving-state.js';
 var PROVING_STATE_LIFECYCLE = /*#__PURE__*/ function(PROVING_STATE_LIFECYCLE) {
     PROVING_STATE_LIFECYCLE[PROVING_STATE_LIFECYCLE["PROVING_STATE_CREATED"] = 0] = "PROVING_STATE_CREATED";
     PROVING_STATE_LIFECYCLE[PROVING_STATE_LIFECYCLE["PROVING_STATE_FULL"] = 1] = "PROVING_STATE_FULL";
@@ -17,106 +20,211 @@ var PROVING_STATE_LIFECYCLE = /*#__PURE__*/ function(PROVING_STATE_LIFECYCLE) {
  * Captures resolve and reject callbacks to provide a promise base interface to the consumer of our proving.
  */ export class EpochProvingState {
     epochNumber;
-    firstBlockNumber;
-    totalNumBlocks;
+    totalNumCheckpoints;
+    finalBlobBatchingChallenges;
+    onCheckpointBlobAccumulatorSet;
     completionCallback;
     rejectionCallback;
-    blockRootOrMergeProvingOutputs;
-    paddingBlockRootProvingOutput;
-    rootRollupProvingOutput;
+    checkpointProofs;
+    checkpointPaddingProof;
+    rootRollupProof;
+    checkpoints;
+    startBlobAccumulator;
+    endBlobAccumulator;
+    finalBatchedBlob;
     provingStateLifecycle;
-    // Map from tx hash to tube proof promise. Used when kickstarting tube proofs before tx processing.
-    cachedTubeProofs;
-    blocks;
-    constructor(epochNumber, firstBlockNumber, totalNumBlocks, completionCallback, rejectionCallback){
+    // Map from tx hash to chonk verifier proof promise. Used when kickstarting chonk verifier proofs before tx processing.
+    cachedChonkVerifierProofs;
+    constructor(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, onCheckpointBlobAccumulatorSet, completionCallback, rejectionCallback){
         this.epochNumber = epochNumber;
-        this.firstBlockNumber = firstBlockNumber;
-        this.totalNumBlocks = totalNumBlocks;
+        this.totalNumCheckpoints = totalNumCheckpoints;
+        this.finalBlobBatchingChallenges = finalBlobBatchingChallenges;
+        this.onCheckpointBlobAccumulatorSet = onCheckpointBlobAccumulatorSet;
         this.completionCallback = completionCallback;
         this.rejectionCallback = rejectionCallback;
+        this.checkpoints = [];
         this.provingStateLifecycle = 0;
-        this.cachedTubeProofs = new Map();
-        this.blocks = [];
-        this.blockRootOrMergeProvingOutputs = new UnbalancedTreeStore(totalNumBlocks);
+        this.cachedChonkVerifierProofs = new Map();
+        this.checkpointProofs = new UnbalancedTreeStore(totalNumCheckpoints);
+        this.startBlobAccumulator = BatchedBlobAccumulator.newWithChallenges(finalBlobBatchingChallenges);
     }
     // Adds a block to the proving state, returns its index
     // Will update the proving life cycle if this is the last block
-    startNewBlock(globalVariables, l1ToL2Messages, l1ToL2MessageSubtreeSiblingPath, l1ToL2MessageTreeSnapshotAfterInsertion, lastArchiveSnapshot, newArchiveSiblingPath, previousBlockHeader) {
-        const index = globalVariables.blockNumber.toNumber() - this.firstBlockNumber;
-        const block = new BlockProvingState(index, globalVariables, l1ToL2Messages, l1ToL2MessageSubtreeSiblingPath, l1ToL2MessageTreeSnapshotAfterInsertion, lastArchiveSnapshot, newArchiveSiblingPath, previousBlockHeader, this);
-        this.blocks[index] = block;
-        if (this.blocks.filter((b)=>!!b).length === this.totalNumBlocks) {
+    startNewCheckpoint(checkpointIndex, constants, totalNumBlocks, previousBlockHeader, lastArchiveSiblingPath, l1ToL2Messages, lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath) {
+        if (checkpointIndex >= this.totalNumCheckpoints) {
+            throw new Error(`Unable to start a new checkpoint at index ${checkpointIndex}. Expected at most ${this.totalNumCheckpoints} checkpoints.`);
+        }
+        const checkpoint = new CheckpointProvingState(checkpointIndex, constants, totalNumBlocks, this.finalBlobBatchingChallenges, previousBlockHeader, lastArchiveSiblingPath, l1ToL2Messages, lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath, this, this.onCheckpointBlobAccumulatorSet);
+        this.checkpoints[checkpointIndex] = checkpoint;
+        if (this.checkpoints.filter((c)=>!!c).length === this.totalNumCheckpoints) {
             this.provingStateLifecycle = 1;
         }
-        return block;
+        return checkpoint;
+    }
+    getCheckpointProvingState(index) {
+        return this.checkpoints[index];
+    }
+    getCheckpointProvingStateByBlockNumber(blockNumber) {
+        return this.checkpoints.find((c)=>c && Number(blockNumber) >= Number(c.firstBlockNumber) && Number(blockNumber) < Number(c.firstBlockNumber) + c.totalNumBlocks);
+    }
+    getBlockProvingStateByBlockNumber(blockNumber) {
+        return this.getCheckpointProvingStateByBlockNumber(blockNumber)?.getBlockProvingStateByBlockNumber(blockNumber);
     }
     // Returns true if this proving state is still valid, false otherwise
     verifyState() {
         return this.provingStateLifecycle === 0 || this.provingStateLifecycle === 1;
     }
-    // Returns true if we are still able to accept blocks, false otherwise
-    isAcceptingBlocks() {
-        return this.provingStateLifecycle === 0;
+    // Returns true if we are still able to accept checkpoints, false otherwise.
+    isAcceptingCheckpoints() {
+        return this.checkpoints.filter((c)=>!!c).length < this.totalNumCheckpoints;
     }
-    setBlockRootRollupProof(blockIndex, proof) {
-        return this.blockRootOrMergeProvingOutputs.setLeaf(blockIndex, proof);
+    setCheckpointRootRollupProof(checkpointIndex, provingOutput) {
+        return this.checkpointProofs.setLeaf(checkpointIndex, {
+            provingOutput
+        });
     }
-    setBlockMergeRollupProof(location, proof) {
-        this.blockRootOrMergeProvingOutputs.setNode(location, proof);
+    tryStartProvingCheckpointMerge(location) {
+        if (this.checkpointProofs.getNode(location)?.isProving) {
+            return false;
+        } else {
+            this.checkpointProofs.setNode(location, {
+                isProving: true
+            });
+            return true;
+        }
     }
-    setRootRollupProof(proof) {
-        this.rootRollupProvingOutput = proof;
+    setCheckpointMergeRollupProof(location, provingOutput) {
+        this.checkpointProofs.setNode(location, {
+            provingOutput
+        });
+    }
+    tryStartProvingRootRollup() {
+        if (this.rootRollupProof?.isProving) {
+            return false;
+        } else {
+            this.rootRollupProof = {
+                isProving: true
+            };
+            return true;
+        }
     }
-    setPaddingBlockRootProof(proof) {
-        this.paddingBlockRootProvingOutput = proof;
+    setRootRollupProof(provingOutput) {
+        this.rootRollupProof = {
+            provingOutput
+        };
+    }
+    tryStartProvingPaddingCheckpoint() {
+        if (this.checkpointPaddingProof?.isProving) {
+            return false;
+        } else {
+            this.checkpointPaddingProof = {
+                isProving: true
+            };
+            return true;
+        }
+    }
+    setCheckpointPaddingProof(provingOutput) {
+        this.checkpointPaddingProof = {
+            provingOutput
+        };
+    }
+    async accumulateCheckpointOutHashes() {
+        const treeCalculator = await MerkleTreeCalculator.create(OUT_HASH_TREE_HEIGHT, undefined, (left, right)=>Promise.resolve(shaMerkleHash(left, right)));
+        const computeOutHashHint = async (leaves)=>{
+            const tree = await treeCalculator.computeTree(leaves.map((l)=>l.toBuffer()));
+            const nextAvailableLeafIndex = leaves.length;
+            return {
+                treeSnapshot: new AppendOnlyTreeSnapshot(Fr.fromBuffer(tree.root), nextAvailableLeafIndex),
+                siblingPath: tree.getSiblingPath(nextAvailableLeafIndex).map(Fr.fromBuffer)
+            };
+        };
+        let hint = this.checkpoints[0]?.getOutHashHint();
+        const outHashes = [];
+        for(let i = 0; i < this.totalNumCheckpoints; i++){
+            const checkpoint = this.checkpoints[i];
+            if (!checkpoint) {
+                break;
+            }
+            // If hints are not set yet, it must be the first checkpoint. Compute the hints with an empty tree.
+            hint ??= await computeOutHashHint([]);
+            checkpoint.setOutHashHint(hint);
+            // Get the out hash for this checkpoint.
+            const outHash = checkpoint.accumulateBlockOutHashes();
+            if (!outHash) {
+                break;
+            }
+            outHashes.push(outHash);
+            // Get or create hints for the next checkpoint.
+            hint = checkpoint.getOutHashHintForNextCheckpoint() ?? await computeOutHashHint(outHashes);
+            checkpoint.setOutHashHintForNextCheckpoint(hint);
+        }
+    }
+    async setBlobAccumulators() {
+        let previousAccumulator = this.startBlobAccumulator;
+        // Accumulate blobs as far as we can for this epoch.
+        for(let i = 0; i < this.totalNumCheckpoints; i++){
+            const checkpoint = this.checkpoints[i];
+            if (!checkpoint) {
+                break;
+            }
+            const endAccumulator = checkpoint.getEndBlobAccumulator() || await checkpoint.accumulateBlobs(previousAccumulator);
+            if (!endAccumulator) {
+                break;
+            }
+            previousAccumulator = endAccumulator;
+            // If this is the last checkpoint, set the end blob accumulator.
+            if (i === this.totalNumCheckpoints - 1) {
+                this.endBlobAccumulator = endAccumulator;
+            }
+        }
+    }
+    async finalizeBatchedBlob() {
+        if (!this.endBlobAccumulator) {
+            throw new Error('End blob accumulator not ready.');
+        }
+        this.finalBatchedBlob = await this.endBlobAccumulator.finalize(true);
     }
     getParentLocation(location) {
-        return this.blockRootOrMergeProvingOutputs.getParentLocation(location);
+        return this.checkpointProofs.getParentLocation(location);
     }
-    getBlockMergeRollupInputs(mergeLocation) {
-        const [left, right] = this.blockRootOrMergeProvingOutputs.getChildren(mergeLocation);
+    getCheckpointMergeRollupInputs(mergeLocation) {
+        const [left, right] = this.checkpointProofs.getChildren(mergeLocation).map((c)=>c?.provingOutput);
         if (!left || !right) {
-            throw new Error('At lease one child is not ready.');
+            throw new Error('At least one child is not ready for the checkpoint merge rollup.');
         }
-        return new BlockMergeRollupInputs([
-            this.#getPreviousRollupData(left),
-            this.#getPreviousRollupData(right)
+        return new CheckpointMergeRollupPrivateInputs([
+            toProofData(left),
+            toProofData(right)
         ]);
     }
-    getRootRollupInputs(proverId) {
+    getRootRollupInputs() {
         const [left, right] = this.#getChildProofsForRoot();
         if (!left || !right) {
-            throw new Error('At lease one child is not ready.');
+            throw new Error('At least one child is not ready for the root rollup.');
         }
-        return RootRollupInputs.from({
-            previousRollupData: [
-                this.#getPreviousRollupData(left),
-                this.#getPreviousRollupData(right)
-            ],
-            proverId
+        return RootRollupPrivateInputs.from({
+            previousRollups: [
+                toProofData(left),
+                toProofData(right)
+            ]
         });
     }
-    getPaddingBlockRootInputs(proverId) {
-        if (!this.blocks[0]?.isComplete()) {
-            throw new Error('Epoch needs one completed block in order to be padded.');
-        }
-        return this.blocks[0].getPaddingBlockRootInputs(proverId);
-    }
-    // Returns a specific transaction proving state
-    getBlockProvingStateByBlockNumber(blockNumber) {
-        return this.blocks.find((block)=>block?.blockNumber === blockNumber);
+    getPaddingCheckpointInputs() {
+        return new CheckpointPaddingRollupPrivateInputs();
     }
     getEpochProofResult() {
-        if (!this.rootRollupProvingOutput) {
+        const provingOutput = this.rootRollupProof?.provingOutput;
+        if (!provingOutput || !this.finalBatchedBlob) {
             throw new Error('Unable to get epoch proof result. Root rollup is not ready.');
         }
         return {
-            proof: this.rootRollupProvingOutput.proof.binaryProof,
-            publicInputs: this.rootRollupProvingOutput.inputs
+            proof: provingOutput.proof.binaryProof,
+            publicInputs: provingOutput.inputs,
+            batchedBlobInputs: this.finalBatchedBlob
         };
     }
-    isReadyForBlockMerge(location) {
-        return this.blockRootOrMergeProvingOutputs.getSibling(location) !== undefined;
+    isReadyForCheckpointMerge(location) {
+        return !!this.checkpointProofs.getSibling(location)?.provingOutput;
     }
     // Returns true if we have sufficient inputs to execute the block root rollup
     isReadyForRootRollup() {
@@ -151,13 +259,9 @@ var PROVING_STATE_LIFECYCLE = /*#__PURE__*/ function(PROVING_STATE_LIFECYCLE) {
             index: 0
         };
         // If there's only 1 block, its block root proof will be stored at the root.
-        return this.totalNumBlocks === 1 ? [
-            this.blockRootOrMergeProvingOutputs.getNode(rootLocation),
-            this.paddingBlockRootProvingOutput
-        ] : this.blockRootOrMergeProvingOutputs.getChildren(rootLocation);
-    }
-    #getPreviousRollupData({ inputs, proof, verificationKey }) {
-        const leafIndex = getVKIndex(verificationKey.keyAsFields);
-        return new PreviousRollupBlockData(inputs, proof, verificationKey.keyAsFields, new MembershipWitness(VK_TREE_HEIGHT, BigInt(leafIndex), getVKSiblingPath(leafIndex)));
+        return this.totalNumCheckpoints === 1 ? [
+            this.checkpointProofs.getNode(rootLocation)?.provingOutput,
+            this.checkpointPaddingProof?.provingOutput
+        ] : this.checkpointProofs.getChildren(rootLocation).map((c)=>c?.provingOutput);
     }
 }

package/dest/orchestrator/index.d.ts

@@ -1,2 +1,2 @@
 export { ProvingOrchestrator } from './orchestrator.js';
-//# sourceMappingURL=index.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9vcmNoZXN0cmF0b3IvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxFQUFFLG1CQUFtQixFQUFFLE1BQU0sbUJBQW1CLENBQUMifQ==

package/dest/orchestrator/orchestrator.d.ts

@@ -1,9 +1,15 @@
-import { Fr } from '@aztec/foundation/fields';
-import { L2Block } from '@aztec/stdlib/block';
-import type { EpochProver, ForkMerkleTreeOperations, ServerCircuitProver } from '@aztec/stdlib/interfaces/server';
-import { type AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
-import { type BlockHeader, type GlobalVariables, type ProcessedTx, type Tx } from '@aztec/stdlib/tx';
+import { BatchedBlob, FinalBlobBatchingChallenges } from '@aztec/blob-lib/types';
+import { BlockNumber, EpochNumber } from '@aztec/foundation/branded-types';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { type LoggerBindings } from '@aztec/foundation/log';
+import { EthAddress } from '@aztec/stdlib/block';
+import type { EpochProver, ForkMerkleTreeOperations, ReadonlyWorldStateAccess, ServerCircuitProver } from '@aztec/stdlib/interfaces/server';
+import type { Proof } from '@aztec/stdlib/proofs';
+import { CheckpointConstantData, RootRollupPublicInputs } from '@aztec/stdlib/rollup';
+import type { BlockHeader, ProcessedTx, Tx } from '@aztec/stdlib/tx';
+import type { UInt64 } from '@aztec/stdlib/types';
 import { type TelemetryClient, type Tracer } from '@aztec/telemetry-client';
+import type { BlockProvingState } from './block-proving-state.js';
 /**
  * Implements an event driven proving scheduler to build the recursive proof tree. The idea being:
  * 1. Transactions are provided to the scheduler post simulation.
@@ -21,59 +27,67 @@ export declare class ProvingOrchestrator implements EpochProver {
     private dbProvider;
     private prover;
     private readonly proverId;
+    private readonly cancelJobsOnStop;
     private provingState;
     private pendingProvingJobs;
     private provingPromise;
     private metrics;
     private dbs;
-    constructor(dbProvider: ForkMerkleTreeOperations, prover: ServerCircuitProver, proverId?: Fr, telemetryClient?: TelemetryClient);
+    private logger;
+    constructor(dbProvider: ReadonlyWorldStateAccess & ForkMerkleTreeOperations, prover: ServerCircuitProver, proverId: EthAddress, cancelJobsOnStop?: boolean, telemetryClient?: TelemetryClient, bindings?: LoggerBindings);
     get tracer(): Tracer;
-    getProverId(): Fr;
+    getProverId(): EthAddress;
+    getNumActiveForks(): number;
     stop(): Promise<void>;
-    startNewEpoch(epochNumber: number, firstBlockNumber: number, totalNumBlocks: number): void;
+    startNewEpoch(epochNumber: EpochNumber, totalNumCheckpoints: number, finalBlobBatchingChallenges: FinalBlobBatchingChallenges): void;
+    /**
+     * Starts a new checkpoint.
+     * @param checkpointIndex - The index of the checkpoint in the epoch.
+     * @param constants - The constants for this checkpoint.
+     * @param l1ToL2Messages - The set of L1 to L2 messages to be inserted at the beginning of this checkpoint.
+     * @param totalNumBlocks - The total number of blocks expected in the checkpoint (must be at least one).
+     * @param headerOfLastBlockInPreviousCheckpoint - The header of the last block in the previous checkpoint.
+     */
+    startNewCheckpoint(checkpointIndex: number, constants: CheckpointConstantData, l1ToL2Messages: Fr[], totalNumBlocks: number, headerOfLastBlockInPreviousCheckpoint: BlockHeader): Promise<void>;
     /**
      * Starts off a new block
-     * @param globalVariables - The global variables for the block
-     * @param l1ToL2Messages - The l1 to l2 messages for the block
-     * @returns A proving ticket, containing a promise notifying of proving completion
+     * @param blockNumber - The block number
+     * @param timestamp - The timestamp of the block. This is only required for constructing the private inputs for the
+     * block that doesn't have any txs.
+     * @param totalNumTxs - The total number of txs in the block
      */
-    startNewBlock(globalVariables: GlobalVariables, l1ToL2Messages: Fr[], previousBlockHeader: BlockHeader): Promise<void>;
+    startNewBlock(blockNumber: BlockNumber, timestamp: UInt64, totalNumTxs: number): Promise<void>;
     /**
      * The interface to add simulated transactions to the scheduler. This can only be called once per block.
      * @param txs - The transactions to be proven
      */
     addTxs(txs: ProcessedTx[]): Promise<void>;
     /**
-     * Kickstarts tube circuits for the specified txs. These will be used during epoch proving.
-     * Note that if the tube circuits are not started this way, they will be started nontheless after processing.
+     * Kickstarts chonk verifier circuits for the specified txs. These will be used during epoch proving.
+     * Note that if the chonk verifier circuits are not started this way, they will be started nontheless after processing.
      */
-    startTubeCircuits(txs: Tx[]): Promise<void>;
+    startChonkVerifierCircuits(txs: Tx[]): Promise<void>;
     /**
      * Marks the block as completed.
      * Computes the block header and updates the archive tree.
      */
-    setBlockCompleted(blockNumber: number, expectedHeader?: BlockHeader): Promise<L2Block>;
-    /** Returns the block as built for a given index. */
-    getBlock(index: number): L2Block;
-    private buildBlock;
-    protected verifyBuiltBlockAgainstSyncedState(l2Block: L2Block, newArchive: AppendOnlyTreeSnapshot): Promise<void>;
+    setBlockCompleted(blockNumber: BlockNumber, expectedHeader?: BlockHeader): Promise<BlockHeader>;
+    protected verifyBuiltBlockAgainstSyncedState(provingState: BlockProvingState): Promise<void>;
     /**
-     * Cancel any further proving
+     * Cancel any further proving.
+     * If cancelJobsOnStop is true, aborts all pending jobs with the broker (which marks them as 'Aborted').
+     * If cancelJobsOnStop is false (default), jobs remain in the broker queue and can be reused on restart/reorg.
      */
     cancel(): void;
     /**
      * Returns the proof for the current epoch.
      */
-    finaliseEpoch(): Promise<{
-        proof: import("@aztec/stdlib/proofs").Proof;
-        publicInputs: import("@aztec/stdlib/rollup").RootRollupPublicInputs;
+    finalizeEpoch(): Promise<{
+        publicInputs: RootRollupPublicInputs;
+        proof: Proof;
+        batchedBlobInputs: BatchedBlob;
     }>;
-    /**
-     * Starts the proving process for the given transaction and adds it to our state
-     * @param tx - The transaction whose proving we wish to commence
-     * @param provingState - The proving state being worked on
-     */
-    private prepareTransaction;
+    private cleanupDBFork;
     /**
      * Enqueue a job to be scheduled
      * @param provingState - The proving state object being operated on
@@ -81,22 +95,26 @@ export declare class ProvingOrchestrator implements EpochProver {
      * @param job - The actual job, returns a promise notifying of the job's completion
      */
     private deferredProving;
-    private prepareBaseParityInputs;
+    private updateL1ToL2MessageTree;
     private prepareBaseRollupInputs;
     private enqueueBaseRollup;
-    private getOrEnqueueTube;
-    private doEnqueueTube;
+    private getOrEnqueueChonkVerifier;
+    private doEnqueueChonkVerifier;
     private enqueueMergeRollup;
     private enqueueBlockRootRollup;
     private enqueueBaseParityCircuit;
     private checkAndEnqueueRootParityCircuit;
     private enqueueRootParityCircuit;
     private enqueueBlockMergeRollup;
+    private enqueueCheckpointRootRollup;
+    private enqueueCheckpointMergeRollup;
     private enqueueEpochPadding;
     private enqueueRootRollup;
     private checkAndEnqueueNextMergeRollup;
     private checkAndEnqueueBlockRootRollup;
     private checkAndEnqueueNextBlockMergeRollup;
+    private checkAndEnqueueCheckpointRootRollup;
+    private checkAndEnqueueNextCheckpointMergeRollup;
     private checkAndEnqueueRootRollup;
     /**
      * Executes the VM circuit for a public function, will enqueue the corresponding kernel if the
@@ -105,6 +123,6 @@ export declare class ProvingOrchestrator implements EpochProver {
      * @param txIndex - The index of the transaction being proven
      */
     private enqueueVM;
-    private checkAndEnqueueNextTxCircuit;
+    private checkAndEnqueueBaseRollup;
 }
-//# sourceMappingURL=orchestrator.d.ts.map
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoib3JjaGVzdHJhdG9yLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvb3JjaGVzdHJhdG9yL29yY2hlc3RyYXRvci50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsV0FBVyxFQUFFLDJCQUEyQixFQUFjLE1BQU0sdUJBQXVCLENBQUM7QUFRN0YsT0FBTyxFQUFFLFdBQVcsRUFBRSxXQUFXLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUUzRSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFFcEQsT0FBTyxFQUFlLEtBQUssY0FBYyxFQUFnQixNQUFNLHVCQUF1QixDQUFDO0FBTXZGLE9BQU8sRUFBRSxVQUFVLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQUNqRCxPQUFPLEtBQUssRUFDVixXQUFXLEVBQ1gsd0JBQXdCLEVBR3hCLHdCQUF3QixFQUN4QixtQkFBbUIsRUFDcEIsTUFBTSxpQ0FBaUMsQ0FBQztBQUN6QyxPQUFPLEtBQUssRUFBRSxLQUFLLEVBQUUsTUFBTSxzQkFBc0IsQ0FBQztBQUNsRCxPQUFPLEVBTUwsc0JBQXNCLEVBS3RCLHNCQUFzQixFQUN2QixNQUFNLHNCQUFzQixDQUFDO0FBRzlCLE9BQU8sS0FBSyxFQUFFLFdBQVcsRUFBRSxXQUFXLEVBQUUsRUFBRSxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFDckUsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0scUJBQXFCLENBQUM7QUFDbEQsT0FBTyxFQUVMLEtBQUssZUFBZSxFQUNwQixLQUFLLE1BQU0sRUFJWixNQUFNLHlCQUF5QixDQUFDO0FBZWpDLE9BQU8sS0FBSyxFQUFFLGlCQUFpQixFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFXbEU7Ozs7Ozs7OztHQVNHO0FBRUg7O0dBRUc7QUFDSCxxQkFBYSxtQkFBb0IsWUFBVyxXQUFXO0lBV25ELE9BQU8sQ0FBQyxVQUFVO0lBQ2xCLE9BQU8sQ0FBQyxNQUFNO0lBQ2QsT0FBTyxDQUFDLFFBQVEsQ0FBQyxRQUFRO0lBQ3pCLE9BQU8sQ0FBQyxRQUFRLENBQUMsZ0JBQWdCO0lBYm5DLE9BQU8sQ0FBQyxZQUFZLENBQTRDO0lBQ2hFLE9BQU8sQ0FBQyxrQkFBa0IsQ0FBeUI7SUFFbkQsT0FBTyxDQUFDLGNBQWMsQ0FBaUQ7SUFDdkUsT0FBTyxDQUFDLE9BQU8sQ0FBNkI7SUFFNUMsT0FBTyxDQUFDLEdBQUcsQ0FBK0M7SUFDMUQsT0FBTyxDQUFDLE1BQU0sQ0FBUztJQUV2QixZQUNVLFVBQVUsRUFBRSx3QkFBd0IsR0FBRyx3QkFBd0IsRUFDL0QsTUFBTSxFQUFFLG1CQUFtQixFQUNsQixRQUFRLEVBQUUsVUFBVSxFQUNwQixnQkFBZ0IsR0FBRSxPQUFlLEVBQ2xELGVBQWUsR0FBRSxlQUFzQyxFQUN2RCxRQUFRLENBQUMsRUFBRSxjQUFjLEVBSTFCO0lBRUQsSUFBSSxNQUFNLElBQUksTUFBTSxDQUVuQjtJQUVNLFdBQVcsSUFBSSxVQUFVLENBRS9CO0lBRU0saUJBQWlCLFdBRXZCO0lBRU0sSUFBSSxJQUFJLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FHM0I7SUFFTSxhQUFhLENBQ2xCLFdBQVcsRUFBRSxXQUFXLEVBQ3hCLG1CQUFtQixFQUFFLE1BQU0sRUFDM0IsMkJBQTJCLEVBQUUsMkJBQTJCLFFBb0J6RDtJQUVEOzs7Ozs7O09BT0c7SUFDVSxrQkFBa0IsQ0FDN0IsZUFBZSxFQUFFLE1BQU0sRUFDdkIsU0FBUyxFQUFFLHNCQUFzQixFQUNqQyxjQUFjLEVBQUUsRUFBRSxFQUFFLEVBQ3BCLGNBQWMsRUFBRSxNQUFNLEVBQ3RCLHFDQUFxQyxFQUFFLFdBQVcsaUJBd0NuRDtJQUVEOzs7Ozs7T0FNRztJQUlVLGFBQWEsQ0FBQyxXQUFXLEVBQUUsV0FBVyxFQUFFLFNBQVMsRUFBRSxNQUFNLEVBQUUsV0FBVyxFQUFFLE1BQU0saUJBMkQxRjtJQUVEOzs7T0FHRztJQUlVLE1BQU0sQ0FBQyxHQUFHLEVBQUUsV0FBVyxFQUFFLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQXdGckQ7SUFFRDs7O09BR0c7SUFFSSwwQkFBMEIsQ0FBQyxHQUFHLEVBQUUsRUFBRSxFQUFFLGlCQXNCMUM7SUFFRDs7O09BR0c7SUFJVSxpQkFBaUIsQ0FBQyxXQUFXLEVBQUUsV0FBVyxFQUFFLGNBQWMsQ0FBQyxFQUFFLFdBQVcsR0FBRyxPQUFPLENBQUMsV0FBVyxDQUFDLENBNEMzRztJQUdELFVBQWdCLGtDQUFrQyxDQUFDLFlBQVksRUFBRSxpQkFBaUIsaUJBZ0RqRjtJQUVEOzs7O09BSUc7SUFDSSxNQUFNLFNBUVo7SUFFRDs7T0FFRztJQUNVLGFBQWEsSUFBSSxPQUFPLENBQUM7UUFDcEMsWUFBWSxFQUFFLHNCQUFzQixDQUFDO1FBQ3JDLEtBQUssRUFBRSxLQUFLLENBQUM7UUFDYixpQkFBaUIsRUFBRSxXQUFXLENBQUM7S0FDaEMsQ0FBQyxDQW9CRDtZQUVhLGFBQWE7SUFrQjNCOzs7OztPQUtHO0lBQ0gsT0FBTyxDQUFDLGVBQWU7WUF3RFQsdUJBQXVCO1lBbUN2Qix1QkFBdUI7SUFrQ3JDLE9BQU8sQ0FBQyxpQkFBaUI7SUFxRHpCLE9BQU8sQ0FBQyx5QkFBeUI7SUErQmpDLE9BQU8sQ0FBQyxzQkFBc0I7SUFpQzlCLE9BQU8sQ0FBQyxrQkFBa0I7SUErQjFCLE9BQU8sQ0FBQyxzQkFBc0I7SUE0RDlCLE9BQU8sQ0FBQyx3QkFBd0I7SUFrQ2hDLE9BQU8sQ0FBQyxnQ0FBZ0M7SUFVeEMsT0FBTyxDQUFDLHdCQUF3QjtJQWdDaEMsT0FBTyxDQUFDLHVCQUF1QjtJQTZCL0IsT0FBTyxDQUFDLDJCQUEyQjtJQTREbkMsT0FBTyxDQUFDLDRCQUE0QjtJQStCcEMsT0FBTyxDQUFDLG1CQUFtQjtJQWtDM0IsT0FBTyxDQUFDLGlCQUFpQjtJQTRCekIsT0FBTyxDQUFDLDhCQUE4QjtJQWF0QyxPQUFPLENBQUMsOEJBQThCO0lBU3RDLE9BQU8sQ0FBQyxtQ0FBbUM7SUFhM0MsT0FBTyxDQUFDLG1DQUFtQztJQVEzQyxPQUFPLENBQUMsd0NBQXdDO0lBYWhELE9BQU8sQ0FBQyx5QkFBeUI7SUFTakM7Ozs7O09BS0c7SUFDSCxPQUFPLENBQUMsU0FBUztJQTJCakIsT0FBTyxDQUFDLHlCQUF5QjtDQVdsQyJ9

package/dest/orchestrator/orchestrator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"orchestrator.d.ts","sourceRoot":"","sources":["../../src/orchestrator/orchestrator.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAQ9C,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,KAAK,EACV,WAAW,EACX,wBAAwB,EAGxB,mBAAmB,EACpB,MAAM,iCAAiC,CAAC;AAWzC,OAAO,EAAE,KAAK,sBAAsB,EAAgB,MAAM,qBAAqB,CAAC;AAChF,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,eAAe,EAAE,KAAK,WAAW,EAAE,KAAK,EAAE,EAAmB,MAAM,kBAAkB,CAAC;AAEtH,OAAO,EAEL,KAAK,eAAe,EACpB,KAAK,MAAM,EAIZ,MAAM,yBAAyB,CAAC;AAoBjC;;;;;;;;;GASG;AAEH;;GAEG;AACH,qBAAa,mBAAoB,YAAW,WAAW;IASnD,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAV3B,OAAO,CAAC,YAAY,CAA4C;IAChE,OAAO,CAAC,kBAAkB,CAAyB;IAEnD,OAAO,CAAC,cAAc,CAAiD;IACvE,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,GAAG,CAAqD;gBAGtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,mBAAmB,EAClB,QAAQ,GAAE,EAAY,EACvC,eAAe,GAAE,eAAsC;IAKzD,IAAI,MAAM,IAAI,MAAM,CAEnB;IAEM,WAAW,IAAI,EAAE;IAIjB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAKrB,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM;IAW1F;;;;;OAKG;IAIU,aAAa,CAAC,eAAe,EAAE,eAAe,EAAE,cAAc,EAAE,EAAE,EAAE,EAAE,mBAAmB,EAAE,WAAW;IAyCnH;;;OAGG;IAIU,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAiDtD;;;OAGG;IAEU,iBAAiB,CAAC,GAAG,EAAE,EAAE,EAAE;IAcxC;;;OAGG;IAIU,iBAAiB,CAAC,WAAW,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC;IAyBnG,oDAAoD;IAC7C,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;YAQzB,UAAU;cAqCR,kCAAkC,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,sBAAsB;IAWvG;;OAEG;IACI,MAAM;IAQb;;OAEG;IACU,aAAa;;;;IAoB1B;;;;OAIG;YACW,kBAAkB;IAShC;;;;;OAKG;IACH,OAAO,CAAC,eAAe;YAwDT,uBAAuB;YA+BvB,uBAAuB;IAmCrC,OAAO,CAAC,iBAAiB;IA+CzB,OAAO,CAAC,gBAAgB;IA0BxB,OAAO,CAAC,aAAa;IA6BrB,OAAO,CAAC,kBAAkB;YA2BZ,sBAAsB;IA2DpC,OAAO,CAAC,wBAAwB;IAwBhC,OAAO,CAAC,gCAAgC;IAUxC,OAAO,CAAC,wBAAwB;IA4BhC,OAAO,CAAC,uBAAuB;YA0BjB,mBAAmB;IA8BjC,OAAO,CAAC,iBAAiB;YA6BX,8BAA8B;YAa9B,8BAA8B;IAyB5C,OAAO,CAAC,mCAAmC;IAa3C,OAAO,CAAC,yBAAyB;IASjC;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IA8CjB,OAAO,CAAC,4BAA4B;CAWrC"}
+{"version":3,"file":"orchestrator.d.ts","sourceRoot":"","sources":["../../src/orchestrator/orchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,2BAA2B,EAAc,MAAM,uBAAuB,CAAC;AAQ7F,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAE3E,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAEpD,OAAO,EAAe,KAAK,cAAc,EAAgB,MAAM,uBAAuB,CAAC;AAMvF,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,KAAK,EACV,WAAW,EACX,wBAAwB,EAGxB,wBAAwB,EACxB,mBAAmB,EACpB,MAAM,iCAAiC,CAAC;AACzC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAML,sBAAsB,EAKtB,sBAAsB,EACvB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AACrE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,EAEL,KAAK,eAAe,EACpB,KAAK,MAAM,EAIZ,MAAM,yBAAyB,CAAC;AAejC,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAWlE;;;;;;;;;GASG;AAEH;;GAEG;AACH,qBAAa,mBAAoB,YAAW,WAAW;IAWnD,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAbnC,OAAO,CAAC,YAAY,CAA4C;IAChE,OAAO,CAAC,kBAAkB,CAAyB;IAEnD,OAAO,CAAC,cAAc,CAAiD;IACvE,OAAO,CAAC,OAAO,CAA6B;IAE5C,OAAO,CAAC,GAAG,CAA+C;IAC1D,OAAO,CAAC,MAAM,CAAS;IAEvB,YACU,UAAU,EAAE,wBAAwB,GAAG,wBAAwB,EAC/D,MAAM,EAAE,mBAAmB,EAClB,QAAQ,EAAE,UAAU,EACpB,gBAAgB,GAAE,OAAe,EAClD,eAAe,GAAE,eAAsC,EACvD,QAAQ,CAAC,EAAE,cAAc,EAI1B;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAEM,WAAW,IAAI,UAAU,CAE/B;IAEM,iBAAiB,WAEvB;IAEM,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAG3B;IAEM,aAAa,CAClB,WAAW,EAAE,WAAW,EACxB,mBAAmB,EAAE,MAAM,EAC3B,2BAA2B,EAAE,2BAA2B,QAoBzD;IAED;;;;;;;OAOG;IACU,kBAAkB,CAC7B,eAAe,EAAE,MAAM,EACvB,SAAS,EAAE,sBAAsB,EACjC,cAAc,EAAE,EAAE,EAAE,EACpB,cAAc,EAAE,MAAM,EACtB,qCAAqC,EAAE,WAAW,iBAwCnD;IAED;;;;;;OAMG;IAIU,aAAa,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,iBA2D1F;IAED;;;OAGG;IAIU,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAwFrD;IAED;;;OAGG;IAEI,0BAA0B,CAAC,GAAG,EAAE,EAAE,EAAE,iBAsB1C;IAED;;;OAGG;IAIU,iBAAiB,CAAC,WAAW,EAAE,WAAW,EAAE,cAAc,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CA4C3G;IAGD,UAAgB,kCAAkC,CAAC,YAAY,EAAE,iBAAiB,iBAgDjF;IAED;;;;OAIG;IACI,MAAM,SAQZ;IAED;;OAEG;IACU,aAAa,IAAI,OAAO,CAAC;QACpC,YAAY,EAAE,sBAAsB,CAAC;QACrC,KAAK,EAAE,KAAK,CAAC;QACb,iBAAiB,EAAE,WAAW,CAAC;KAChC,CAAC,CAoBD;YAEa,aAAa;IAkB3B;;;;;OAKG;IACH,OAAO,CAAC,eAAe;YAwDT,uBAAuB;YAmCvB,uBAAuB;IAkCrC,OAAO,CAAC,iBAAiB;IAqDzB,OAAO,CAAC,yBAAyB;IA+BjC,OAAO,CAAC,sBAAsB;IAiC9B,OAAO,CAAC,kBAAkB;IA+B1B,OAAO,CAAC,sBAAsB;IA4D9B,OAAO,CAAC,wBAAwB;IAkChC,OAAO,CAAC,gCAAgC;IAUxC,OAAO,CAAC,wBAAwB;IAgChC,OAAO,CAAC,uBAAuB;IA6B/B,OAAO,CAAC,2BAA2B;IA4DnC,OAAO,CAAC,4BAA4B;IA+BpC,OAAO,CAAC,mBAAmB;IAkC3B,OAAO,CAAC,iBAAiB;IA4BzB,OAAO,CAAC,8BAA8B;IAatC,OAAO,CAAC,8BAA8B;IAStC,OAAO,CAAC,mCAAmC;IAa3C,OAAO,CAAC,mCAAmC;IAQ3C,OAAO,CAAC,wCAAwC;IAahD,OAAO,CAAC,yBAAyB;IASjC;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IA2BjB,OAAO,CAAC,yBAAyB;CAWlC"}