@aztec/prover-client 0.0.1-commit.7b97ef96e → 0.0.1-commit.7cbc774

package/dest/orchestrator/top-tree-orchestrator.js

@@ -0,0 +1,182 @@
+import { BatchedBlobAccumulator } from '@aztec/blob-lib';
+import { BLOBS_PER_CHECKPOINT, FIELDS_PER_BLOB, OUT_HASH_TREE_HEIGHT } from '@aztec/constants';
+import { padArrayEnd } from '@aztec/foundation/collection';
+import { BLS12Point } from '@aztec/foundation/curves/bls12';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { promiseWithResolvers } from '@aztec/foundation/promise';
+import { MerkleTreeCalculator, shaMerkleHash } from '@aztec/foundation/trees';
+import { computeCheckpointOutHash } from '@aztec/stdlib/messaging';
+import { CheckpointRootRollupHints, CheckpointRootRollupPrivateInputs, CheckpointRootSingleBlockRollupPrivateInputs } from '@aztec/stdlib/rollup';
+import { AppendOnlyTreeSnapshot } from '@aztec/stdlib/trees';
+import { getTelemetryClient } from '@aztec/telemetry-client';
+import { buildBlobHints, toProofData } from './block-building-helpers.js';
+import { TopTreeProvingScheduler } from './top-tree-proving-scheduler.js';
+import { TopTreeProvingState } from './top-tree-proving-state.js';
+/**
+ * Sentinel thrown by `cancel` so callers can distinguish reorg-driven cancellation from
+ * a genuine proving failure (and choose to rebuild + retry instead of failing the epoch).
+ */ export class TopTreeCancelledError extends Error {
+    constructor(reason = 'Top-tree proving cancelled'){
+        super(reason);
+        this.name = 'TopTreeCancelledError';
+    }
+}
+/**
+ * Drives proving from checkpoint root rollups through the epoch root rollup. Owns no
+ * world-state forks or tx processing — every input is supplied by the caller.
+ *
+ * Pipelined start: `prove()` does not wait for block-level proving. It pre-computes the
+ * out-hash and blob-accumulator hint chains immediately from archiver-derivable data,
+ * and each checkpoint's root rollup fires the moment its sub-tree's `blockProofs`
+ * promise resolves. Later checkpoints can still be block-level proving in parallel.
+ */ export class TopTreeOrchestrator extends TopTreeProvingScheduler {
+    proverId;
+    state;
+    cancelled;
+    constructor(prover, proverId, enqueueConcurrency, _telemetryClient = getTelemetryClient(), bindings){
+        super(prover, enqueueConcurrency, 'prover-client:top-tree-orchestrator', bindings), this.proverId = proverId, this.cancelled = false;
+    }
+    getProverId() {
+        return this.proverId;
+    }
+    /**
+   * Proves the top tree from per-checkpoint data and pending block-proofs promises.
+   * Resolves with the final epoch proof, or rejects with `TopTreeCancelledError` if
+   * `cancel()` is invoked, or any other error if a circuit fails.
+   */ async prove(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, checkpointData) {
+        if (checkpointData.length !== totalNumCheckpoints) {
+            throw new Error(`checkpointData length (${checkpointData.length}) does not match totalNumCheckpoints (${totalNumCheckpoints}).`);
+        }
+        if (this.state) {
+            throw new Error('TopTreeOrchestrator.prove called twice; construct a new orchestrator per epoch.');
+        }
+        // If cancel() was already called before prove() ran (e.g. a removeCheckpoint that
+        // landed while the caller was still preparing inputs), short-circuit the whole
+        // proving path. Without this, prove() would build its state, the per-checkpoint
+        // .then handlers would all bail on `this.cancelled`, and the completion promise
+        // would never resolve — prove() would hang forever.
+        if (this.cancelled) {
+            throw new TopTreeCancelledError();
+        }
+        const { promise: completionPromise, resolve, reject } = promiseWithResolvers();
+        // The completion promise is awaited inside the try/catch below. Attach a no-op catch
+        // here as well so any spurious unhandled-rejection detection during cancellation
+        // (where reject() can fire synchronously before the await microtask installs a handler)
+        // is silenced.
+        completionPromise.catch(()=>{});
+        const startBlobAccumulator = BatchedBlobAccumulator.newWithChallenges(finalBlobBatchingChallenges);
+        this.state = new TopTreeProvingState(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, startBlobAccumulator, resolve, (reason)=>reject(this.cancelled ? new TopTreeCancelledError(reason) : new Error(reason)));
+        // Compute the full out-hash hint chain and per-checkpoint start blob accumulators
+        // synchronously from archiver data. No proving required.
+        const outHashHints = await this.computeOutHashHints(checkpointData);
+        const checkpointStartBlobs = [];
+        let runningBlobAccumulator = startBlobAccumulator;
+        for (const cd of checkpointData){
+            checkpointStartBlobs.push(runningBlobAccumulator);
+            runningBlobAccumulator = await runningBlobAccumulator.accumulateFields(cd.blobFields);
+        }
+        this.state.setEndBlobAccumulator(runningBlobAccumulator);
+        // For each checkpoint, await its block proofs promise then enqueue the checkpoint root.
+        // Each await runs independently — checkpoints whose sub-trees finish first start their
+        // root proofs first, in parallel with later checkpoints' block-level proving.
+        for(let i = 0; i < checkpointData.length; i++){
+            const cd = checkpointData[i];
+            const checkpointIndex = i;
+            void cd.blockProofs.then((blockProofs)=>{
+                if (this.cancelled || !this.state?.verifyState()) {
+                    return;
+                }
+                this.enqueueCheckpointRoot(this.state, checkpointIndex, blockProofs, cd, outHashHints[i], checkpointStartBlobs[i]);
+            }, (err)=>{
+                if (this.cancelled) {
+                    return;
+                }
+                this.state?.reject(`Sub-tree for checkpoint ${i} failed: ${err}`);
+            });
+        }
+        try {
+            await completionPromise;
+            await this.state.finalizeBatchedBlob();
+            return this.state.getEpochProofResult();
+        } catch (err) {
+            if (this.cancelled) {
+                throw new TopTreeCancelledError();
+            }
+            throw err;
+        }
+    }
+    /**
+   * Cancels in-flight proving. If `abortJobs` is true, each pending broker job is aborted
+   * (used on reorg, when the surviving checkpoint set differs and the in-flight jobs'
+   * inputs are no longer valid). On shutdown the caller passes `false` so jobs remain in
+   * the broker queue for reuse on restart.
+   */ cancel({ abortJobs }) {
+        this.cancelled = true;
+        this.resetSchedulerState(abortJobs);
+        this.state?.cancel();
+    }
+    /** Standard shutdown — preserve the broker queue (`abortJobs: false`). */ cancelInternal() {
+        this.cancel({
+            abortJobs: false
+        });
+    }
+    // --- internal: per-checkpoint enqueue path ---
+    onRootRollupComplete(state) {
+        state.resolve();
+    }
+    enqueueCheckpointRoot(state, checkpointIndex, blockProofs, cd, outHashHint, startBlobAccumulator) {
+        void this.buildCheckpointRootInputs(blockProofs, cd, outHashHint, startBlobAccumulator).then((inputs)=>{
+            this.deferredProving(state, (signal)=>{
+                if (inputs instanceof CheckpointRootSingleBlockRollupPrivateInputs) {
+                    return this.prover.getCheckpointRootSingleBlockRollupProof(inputs, signal, state.epochNumber);
+                }
+                return this.prover.getCheckpointRootRollupProof(inputs, signal, state.epochNumber);
+            }, (result)=>{
+                this.logger.debug(`Completed checkpoint root proof for checkpoint ${checkpointIndex}`);
+                const leafLocation = state.setCheckpointRootRollupProof(checkpointIndex, result);
+                if (state.totalNumCheckpoints === 1) {
+                    this.enqueueEpochPadding(state);
+                } else {
+                    this.checkAndEnqueueNextCheckpointMergeRollup(state, leafLocation);
+                }
+            });
+        });
+    }
+    async buildCheckpointRootInputs(blockProofs, cd, outHashHint, startBlobAccumulator) {
+        const { blobCommitments, blobsHash } = await buildBlobHints(cd.blobFields);
+        const hints = CheckpointRootRollupHints.from({
+            previousBlockHeader: cd.previousBlockHeader,
+            previousArchiveSiblingPath: cd.previousArchiveSiblingPath,
+            previousOutHash: outHashHint.treeSnapshot,
+            newOutHashSiblingPath: outHashHint.siblingPath,
+            startBlobAccumulator: startBlobAccumulator.toBlobAccumulator(),
+            finalBlobChallenges: this.state.finalBlobBatchingChallenges,
+            blobFields: padArrayEnd(cd.blobFields, Fr.ZERO, FIELDS_PER_BLOB * BLOBS_PER_CHECKPOINT),
+            blobCommitments: padArrayEnd(blobCommitments, BLS12Point.ZERO, BLOBS_PER_CHECKPOINT),
+            blobsHash
+        });
+        const proofDatas = blockProofs.map((p)=>toProofData(p));
+        return proofDatas.length === 1 ? new CheckpointRootSingleBlockRollupPrivateInputs(proofDatas[0], hints) : new CheckpointRootRollupPrivateInputs([
+            proofDatas[0],
+            proofDatas[1]
+        ], hints);
+    }
+    async computeOutHashHints(checkpointData) {
+        const treeCalculator = await MerkleTreeCalculator.create(OUT_HASH_TREE_HEIGHT, undefined, (left, right)=>Promise.resolve(shaMerkleHash(left, right)));
+        const computeHint = 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)
+            };
+        };
+        const hints = [];
+        const outHashes = [];
+        for (const cd of checkpointData){
+            hints.push(await computeHint(outHashes));
+            outHashes.push(computeCheckpointOutHash(cd.l2ToL1MsgsPerBlock));
+        }
+        return hints;
+    }
+}

package/dest/orchestrator/top-tree-proving-scheduler.d.ts

@@ -0,0 +1,62 @@
+import type { NESTED_RECURSIVE_PROOF_LENGTH, NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH } from '@aztec/constants';
+import type { EpochNumber } from '@aztec/foundation/branded-types';
+import type { LoggerBindings } from '@aztec/foundation/log';
+import type { TreeNodeLocation } from '@aztec/foundation/trees';
+import type { PublicInputsAndRecursiveProof, ServerCircuitProver } from '@aztec/stdlib/interfaces/server';
+import type { CheckpointMergeRollupPrivateInputs, CheckpointPaddingRollupPrivateInputs, CheckpointRollupPublicInputs, RootRollupPrivateInputs, RootRollupPublicInputs } from '@aztec/stdlib/rollup';
+import { ProvingScheduler, type ProvingStateLike } from './proving-scheduler.js';
+type CheckpointRollupProof = PublicInputsAndRecursiveProof<CheckpointRollupPublicInputs, typeof NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>;
+type RootRollupProof = PublicInputsAndRecursiveProof<RootRollupPublicInputs, typeof NESTED_RECURSIVE_PROOF_LENGTH>;
+/**
+ * State interface required by the top-tree proving drivers (checkpoint-merge → padding →
+ * root-rollup). Both `EpochProvingState` and `TopTreeProvingState` satisfy it structurally;
+ * the per-checkpoint state in `EpochProvingState` (block/tx proving, world-state forks)
+ * is owned outside this surface.
+ */
+export interface TopTreeStateLike extends ProvingStateLike {
+    readonly epochNumber: EpochNumber;
+    readonly totalNumCheckpoints: number;
+    tryStartProvingCheckpointMerge(location: TreeNodeLocation): boolean;
+    setCheckpointMergeRollupProof(location: TreeNodeLocation, provingOutput: CheckpointRollupProof): void;
+    isReadyForCheckpointMerge(location: TreeNodeLocation): boolean;
+    getParentLocation(location: TreeNodeLocation): TreeNodeLocation;
+    getCheckpointMergeRollupInputs(location: TreeNodeLocation): CheckpointMergeRollupPrivateInputs;
+    tryStartProvingPaddingCheckpoint(): boolean;
+    setCheckpointPaddingProof(provingOutput: CheckpointRollupProof): void;
+    getPaddingCheckpointInputs(): CheckpointPaddingRollupPrivateInputs;
+    tryStartProvingRootRollup(): boolean;
+    setRootRollupProof(provingOutput: RootRollupProof): void;
+    isReadyForRootRollup(): boolean;
+    getRootRollupInputs(): RootRollupPrivateInputs;
+}
+/**
+ * Shared scheduling for the top-tree section of epoch proving — checkpoint-merge,
+ * padding (single-checkpoint case), and root rollup. Both `ProvingOrchestrator` and
+ * `TopTreeOrchestrator` extend this; their per-checkpoint-root drivers diverge (one
+ * drains state-derived inputs once block-merge is done, the other builds inputs from
+ * caller-supplied checkpoint data), but the rest of the tree is identical.
+ *
+ * Subclasses provide a `wrapCircuitCall` hook for telemetry (the orchestrator wraps
+ * each call in a span; the top-tree leaves it as identity), and an
+ * `onRootRollupComplete` hook to invoke the right shape of `state.resolve()` —
+ * `EpochProvingState.resolve` takes a `ProvingResult`, `TopTreeProvingState.resolve`
+ * is no-arg.
+ */
+export declare abstract class TopTreeProvingScheduler extends ProvingScheduler {
+    protected readonly prover: ServerCircuitProver;
+    constructor(prover: ServerCircuitProver, enqueueConcurrency: number, loggerName?: string, bindings?: LoggerBindings);
+    /**
+     * Wraps a circuit call for telemetry. Default is identity; the orchestrator overrides
+     * to wrap with `wrapCallbackInSpan`.
+     */
+    protected wrapCircuitCall<T>(_circuitName: string, fn: (signal: AbortSignal) => Promise<T>): (signal: AbortSignal) => Promise<T>;
+    /** Called once the root rollup proof has been set; subclasses call `state.resolve(...)` with the right shape. */
+    protected abstract onRootRollupComplete(state: TopTreeStateLike): void;
+    protected enqueueCheckpointMergeRollup(state: TopTreeStateLike, location: TreeNodeLocation): void;
+    protected enqueueEpochPadding(state: TopTreeStateLike): void;
+    protected enqueueRootRollup(state: TopTreeStateLike): void;
+    protected checkAndEnqueueNextCheckpointMergeRollup(state: TopTreeStateLike, currentLocation: TreeNodeLocation): void;
+    protected checkAndEnqueueRootRollup(state: TopTreeStateLike): void;
+}
+export {};
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidG9wLXRyZWUtcHJvdmluZy1zY2hlZHVsZXIuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9vcmNoZXN0cmF0b3IvdG9wLXRyZWUtcHJvdmluZy1zY2hlZHVsZXIudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxLQUFLLEVBQUUsNkJBQTZCLEVBQUUseUNBQXlDLEVBQUUsTUFBTSxrQkFBa0IsQ0FBQztBQUNqSCxPQUFPLEtBQUssRUFBRSxXQUFXLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUNuRSxPQUFPLEtBQUssRUFBRSxjQUFjLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUM1RCxPQUFPLEtBQUssRUFBRSxnQkFBZ0IsRUFBRSxNQUFNLHlCQUF5QixDQUFDO0FBQ2hFLE9BQU8sS0FBSyxFQUFFLDZCQUE2QixFQUFFLG1CQUFtQixFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFDMUcsT0FBTyxLQUFLLEVBQ1Ysa0NBQWtDLEVBQ2xDLG9DQUFvQyxFQUNwQyw0QkFBNEIsRUFDNUIsdUJBQXVCLEVBQ3ZCLHNCQUFzQixFQUN2QixNQUFNLHNCQUFzQixDQUFDO0FBRTlCLE9BQU8sRUFBRSxnQkFBZ0IsRUFBRSxLQUFLLGdCQUFnQixFQUFFLE1BQU0sd0JBQXdCLENBQUM7QUFFakYsS0FBSyxxQkFBcUIsR0FBRyw2QkFBNkIsQ0FDeEQsNEJBQTRCLEVBQzVCLE9BQU8seUNBQXlDLENBQ2pELENBQUM7QUFFRixLQUFLLGVBQWUsR0FBRyw2QkFBNkIsQ0FBQyxzQkFBc0IsRUFBRSxPQUFPLDZCQUE2QixDQUFDLENBQUM7QUFFbkg7Ozs7O0dBS0c7QUFDSCxNQUFNLFdBQVcsZ0JBQWlCLFNBQVEsZ0JBQWdCO0lBQ3hELFFBQVEsQ0FBQyxXQUFXLEVBQUUsV0FBVyxDQUFDO0lBQ2xDLFFBQVEsQ0FBQyxtQkFBbUIsRUFBRSxNQUFNLENBQUM7SUFFckMsOEJBQThCLENBQUMsUUFBUSxFQUFFLGdCQUFnQixHQUFHLE9BQU8sQ0FBQztJQUNwRSw2QkFBNkIsQ0FBQyxRQUFRLEVBQUUsZ0JBQWdCLEVBQUUsYUFBYSxFQUFFLHFCQUFxQixHQUFHLElBQUksQ0FBQztJQUN0Ryx5QkFBeUIsQ0FBQyxRQUFRLEVBQUUsZ0JBQWdCLEdBQUcsT0FBTyxDQUFDO0lBQy9ELGlCQUFpQixDQUFDLFFBQVEsRUFBRSxnQkFBZ0IsR0FBRyxnQkFBZ0IsQ0FBQztJQUNoRSw4QkFBOEIsQ0FBQyxRQUFRLEVBQUUsZ0JBQWdCLEdBQUcsa0NBQWtDLENBQUM7SUFFL0YsZ0NBQWdDLElBQUksT0FBTyxDQUFDO0lBQzVDLHlCQUF5QixDQUFDLGFBQWEsRUFBRSxxQkFBcUIsR0FBRyxJQUFJLENBQUM7SUFDdEUsMEJBQTBCLElBQUksb0NBQW9DLENBQUM7SUFFbkUseUJBQXlCLElBQUksT0FBTyxDQUFDO0lBQ3JDLGtCQUFrQixDQUFDLGFBQWEsRUFBRSxlQUFlLEdBQUcsSUFBSSxDQUFDO0lBQ3pELG9CQUFvQixJQUFJLE9BQU8sQ0FBQztJQUNoQyxtQkFBbUIsSUFBSSx1QkFBdUIsQ0FBQztDQUNoRDtBQUVEOzs7Ozs7Ozs7Ozs7R0FZRztBQUNILDhCQUFzQix1QkFBd0IsU0FBUSxnQkFBZ0I7SUFFbEUsU0FBUyxDQUFDLFFBQVEsQ0FBQyxNQUFNLEVBQUUsbUJBQW1CO0lBRGhELFlBQ3FCLE1BQU0sRUFBRSxtQkFBbUIsRUFDOUMsa0JBQWtCLEVBQUUsTUFBTSxFQUMxQixVQUFVLENBQUMsRUFBRSxNQUFNLEVBQ25CLFFBQVEsQ0FBQyxFQUFFLGNBQWMsRUFHMUI7SUFFRDs7O09BR0c7SUFDSCxTQUFTLENBQUMsZUFBZSxDQUFDLENBQUMsRUFDekIsWUFBWSxFQUFFLE1BQU0sRUFDcEIsRUFBRSxFQUFFLENBQUMsTUFBTSxFQUFFLFdBQVcsS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLEdBQ3RDLENBQUMsTUFBTSxFQUFFLFdBQVcsS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLENBRXJDO0lBRUQsaUhBQWlIO0lBQ2pILFNBQVMsQ0FBQyxRQUFRLENBQUMsb0JBQW9CLENBQUMsS0FBSyxFQUFFLGdCQUFnQixHQUFHLElBQUksQ0FBQztJQUV2RSxTQUFTLENBQUMsNEJBQTRCLENBQUMsS0FBSyxFQUFFLGdCQUFnQixFQUFFLFFBQVEsRUFBRSxnQkFBZ0IsUUFlekY7SUFFRCxTQUFTLENBQUMsbUJBQW1CLENBQUMsS0FBSyxFQUFFLGdCQUFnQixRQWVwRDtJQUVELFNBQVMsQ0FBQyxpQkFBaUIsQ0FBQyxLQUFLLEVBQUUsZ0JBQWdCLFFBY2xEO0lBRUQsU0FBUyxDQUFDLHdDQUF3QyxDQUFDLEtBQUssRUFBRSxnQkFBZ0IsRUFBRSxlQUFlLEVBQUUsZ0JBQWdCLFFBVTVHO0lBRUQsU0FBUyxDQUFDLHlCQUF5QixDQUFDLEtBQUssRUFBRSxnQkFBZ0IsUUFLMUQ7Q0FDRiJ9

package/dest/orchestrator/top-tree-proving-scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"top-tree-proving-scheduler.d.ts","sourceRoot":"","sources":["../../src/orchestrator/top-tree-proving-scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,6BAA6B,EAAE,yCAAyC,EAAE,MAAM,kBAAkB,CAAC;AACjH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AACnE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,KAAK,EAAE,6BAA6B,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAC1G,OAAO,KAAK,EACV,kCAAkC,EAClC,oCAAoC,EACpC,4BAA4B,EAC5B,uBAAuB,EACvB,sBAAsB,EACvB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,gBAAgB,EAAE,KAAK,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAEjF,KAAK,qBAAqB,GAAG,6BAA6B,CACxD,4BAA4B,EAC5B,OAAO,yCAAyC,CACjD,CAAC;AAEF,KAAK,eAAe,GAAG,6BAA6B,CAAC,sBAAsB,EAAE,OAAO,6BAA6B,CAAC,CAAC;AAEnH;;;;;GAKG;AACH,MAAM,WAAW,gBAAiB,SAAQ,gBAAgB;IACxD,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAClC,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;IAErC,8BAA8B,CAAC,QAAQ,EAAE,gBAAgB,GAAG,OAAO,CAAC;IACpE,6BAA6B,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,EAAE,qBAAqB,GAAG,IAAI,CAAC;IACtG,yBAAyB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,OAAO,CAAC;IAC/D,iBAAiB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,gBAAgB,CAAC;IAChE,8BAA8B,CAAC,QAAQ,EAAE,gBAAgB,GAAG,kCAAkC,CAAC;IAE/F,gCAAgC,IAAI,OAAO,CAAC;IAC5C,yBAAyB,CAAC,aAAa,EAAE,qBAAqB,GAAG,IAAI,CAAC;IACtE,0BAA0B,IAAI,oCAAoC,CAAC;IAEnE,yBAAyB,IAAI,OAAO,CAAC;IACrC,kBAAkB,CAAC,aAAa,EAAE,eAAe,GAAG,IAAI,CAAC;IACzD,oBAAoB,IAAI,OAAO,CAAC;IAChC,mBAAmB,IAAI,uBAAuB,CAAC;CAChD;AAED;;;;;;;;;;;;GAYG;AACH,8BAAsB,uBAAwB,SAAQ,gBAAgB;IAElE,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,mBAAmB;IADhD,YACqB,MAAM,EAAE,mBAAmB,EAC9C,kBAAkB,EAAE,MAAM,EAC1B,UAAU,CAAC,EAAE,MAAM,EACnB,QAAQ,CAAC,EAAE,cAAc,EAG1B;IAED;;;OAGG;IACH,SAAS,CAAC,eAAe,CAAC,CAAC,EACzB,YAAY,EAAE,MAAM,EACpB,EAAE,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,GACtC,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,CAErC;IAED,iHAAiH;IACjH,SAAS,CAAC,QAAQ,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAEvE,SAAS,CAAC,4BAA4B,CAAC,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,gBAAgB,QAezF;IAED,SAAS,CAAC,mBAAmB,CAAC,KAAK,EAAE,gBAAgB,QAepD;IAED,SAAS,CAAC,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,QAclD;IAED,SAAS,CAAC,wCAAwC,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,gBAAgB,QAU5G;IAED,SAAS,CAAC,yBAAyB,CAAC,KAAK,EAAE,gBAAgB,QAK1D;CACF"}

package/dest/orchestrator/top-tree-proving-scheduler.js

@@ -0,0 +1,73 @@
+import { ProvingScheduler } from './proving-scheduler.js';
+/**
+ * Shared scheduling for the top-tree section of epoch proving — checkpoint-merge,
+ * padding (single-checkpoint case), and root rollup. Both `ProvingOrchestrator` and
+ * `TopTreeOrchestrator` extend this; their per-checkpoint-root drivers diverge (one
+ * drains state-derived inputs once block-merge is done, the other builds inputs from
+ * caller-supplied checkpoint data), but the rest of the tree is identical.
+ *
+ * Subclasses provide a `wrapCircuitCall` hook for telemetry (the orchestrator wraps
+ * each call in a span; the top-tree leaves it as identity), and an
+ * `onRootRollupComplete` hook to invoke the right shape of `state.resolve()` —
+ * `EpochProvingState.resolve` takes a `ProvingResult`, `TopTreeProvingState.resolve`
+ * is no-arg.
+ */ export class TopTreeProvingScheduler extends ProvingScheduler {
+    prover;
+    constructor(prover, enqueueConcurrency, loggerName, bindings){
+        super(enqueueConcurrency, loggerName, bindings), this.prover = prover;
+    }
+    /**
+   * Wraps a circuit call for telemetry. Default is identity; the orchestrator overrides
+   * to wrap with `wrapCallbackInSpan`.
+   */ wrapCircuitCall(_circuitName, fn) {
+        return fn;
+    }
+    enqueueCheckpointMergeRollup(state, location) {
+        if (!state.verifyState() || !state.tryStartProvingCheckpointMerge(location)) {
+            return;
+        }
+        const inputs = state.getCheckpointMergeRollupInputs(location);
+        this.deferredProving(state, this.wrapCircuitCall('rollup-checkpoint-merge', (signal)=>this.prover.getCheckpointMergeRollupProof(inputs, signal, state.epochNumber)), (result)=>{
+            state.setCheckpointMergeRollupProof(location, result);
+            this.checkAndEnqueueNextCheckpointMergeRollup(state, location);
+        });
+    }
+    enqueueEpochPadding(state) {
+        if (!state.verifyState() || !state.tryStartProvingPaddingCheckpoint()) {
+            return;
+        }
+        const inputs = state.getPaddingCheckpointInputs();
+        this.deferredProving(state, this.wrapCircuitCall('rollup-checkpoint-padding', (signal)=>this.prover.getCheckpointPaddingRollupProof(inputs, signal, state.epochNumber)), (result)=>{
+            state.setCheckpointPaddingProof(result);
+            this.checkAndEnqueueRootRollup(state);
+        });
+    }
+    enqueueRootRollup(state) {
+        if (!state.verifyState() || !state.tryStartProvingRootRollup()) {
+            return;
+        }
+        const inputs = state.getRootRollupInputs();
+        this.deferredProving(state, this.wrapCircuitCall('rollup-root', (signal)=>this.prover.getRootRollupProof(inputs, signal, state.epochNumber)), (result)=>{
+            this.logger.verbose(`Completed root rollup for epoch ${state.epochNumber}`);
+            state.setRootRollupProof(result);
+            this.onRootRollupComplete(state);
+        });
+    }
+    checkAndEnqueueNextCheckpointMergeRollup(state, currentLocation) {
+        if (!state.isReadyForCheckpointMerge(currentLocation)) {
+            return;
+        }
+        const parentLocation = state.getParentLocation(currentLocation);
+        if (parentLocation.level === 0) {
+            this.checkAndEnqueueRootRollup(state);
+        } else {
+            this.enqueueCheckpointMergeRollup(state, parentLocation);
+        }
+    }
+    checkAndEnqueueRootRollup(state) {
+        if (!state.isReadyForRootRollup()) {
+            return;
+        }
+        this.enqueueRootRollup(state);
+    }
+}

package/dest/orchestrator/top-tree-proving-state.d.ts

@@ -0,0 +1,61 @@
+import type { BatchedBlob, BatchedBlobAccumulator, FinalBlobBatchingChallenges } from '@aztec/blob-lib';
+import type { NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH } from '@aztec/constants';
+import { EpochNumber } from '@aztec/foundation/branded-types';
+import { type TreeNodeLocation } from '@aztec/foundation/trees';
+import type { PublicInputsAndRecursiveProof } from '@aztec/stdlib/interfaces/server';
+import type { Proof } from '@aztec/stdlib/proofs';
+import { CheckpointMergeRollupPrivateInputs, CheckpointPaddingRollupPrivateInputs, CheckpointRollupPublicInputs, RootRollupPrivateInputs, type RootRollupPublicInputs } from '@aztec/stdlib/rollup';
+/**
+ * Lean top-tree-only state. Owns the merge tree of checkpoint root proofs, the
+ * single-checkpoint padding proof slot, the final root rollup proof, and the blob
+ * accumulator endpoints needed to finalise the epoch's batched blob proof.
+ *
+ * Constructed with `totalNumCheckpoints` and `finalBlobBatchingChallenges` upfront —
+ * by the time the top tree starts, all checkpoints are known and the challenges are
+ * derivable from their blob fields.
+ */
+export declare class TopTreeProvingState {
+    #private;
+    readonly epochNumber: EpochNumber;
+    readonly totalNumCheckpoints: number;
+    readonly finalBlobBatchingChallenges: FinalBlobBatchingChallenges;
+    readonly startBlobAccumulator: BatchedBlobAccumulator;
+    private readonly completionCallback;
+    private readonly rejectionCallback;
+    private checkpointProofs;
+    private checkpointPaddingProof;
+    private rootRollupProof;
+    private endBlobAccumulator;
+    private finalBatchedBlob;
+    private lifecycle;
+    constructor(epochNumber: EpochNumber, totalNumCheckpoints: number, finalBlobBatchingChallenges: FinalBlobBatchingChallenges, startBlobAccumulator: BatchedBlobAccumulator, completionCallback: () => void, rejectionCallback: (reason: string) => void);
+    setCheckpointRootRollupProof(checkpointIndex: number, provingOutput: PublicInputsAndRecursiveProof<CheckpointRollupPublicInputs, typeof NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>): TreeNodeLocation;
+    tryStartProvingCheckpointMerge(location: TreeNodeLocation): boolean;
+    setCheckpointMergeRollupProof(location: TreeNodeLocation, provingOutput: PublicInputsAndRecursiveProof<CheckpointRollupPublicInputs, typeof NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>): void;
+    isReadyForCheckpointMerge(location: TreeNodeLocation): boolean;
+    getParentLocation(location: TreeNodeLocation): TreeNodeLocation;
+    getCheckpointMergeRollupInputs(mergeLocation: TreeNodeLocation): CheckpointMergeRollupPrivateInputs;
+    tryStartProvingPaddingCheckpoint(): boolean;
+    setCheckpointPaddingProof(provingOutput: PublicInputsAndRecursiveProof<CheckpointRollupPublicInputs, typeof NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>): void;
+    getPaddingCheckpointInputs(): CheckpointPaddingRollupPrivateInputs;
+    tryStartProvingRootRollup(): boolean;
+    setRootRollupProof(provingOutput: PublicInputsAndRecursiveProof<RootRollupPublicInputs>): void;
+    isReadyForRootRollup(): boolean;
+    getRootRollupInputs(): RootRollupPrivateInputs;
+    /**
+     * Sets the end-of-epoch blob accumulator, computed by the top-tree orchestrator
+     * from the surviving checkpoints' blob fields. Required before `finalizeBatchedBlob`.
+     */
+    setEndBlobAccumulator(accumulator: BatchedBlobAccumulator): void;
+    finalizeBatchedBlob(): Promise<void>;
+    getEpochProofResult(): {
+        proof: Proof;
+        publicInputs: RootRollupPublicInputs;
+        batchedBlobInputs: BatchedBlob;
+    };
+    verifyState(): boolean;
+    resolve(): void;
+    reject(reason: string): void;
+    cancel(): void;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidG9wLXRyZWUtcHJvdmluZy1zdGF0ZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL29yY2hlc3RyYXRvci90b3AtdHJlZS1wcm92aW5nLXN0YXRlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sS0FBSyxFQUFFLFdBQVcsRUFBRSxzQkFBc0IsRUFBRSwyQkFBMkIsRUFBRSxNQUFNLGlCQUFpQixDQUFDO0FBQ3hHLE9BQU8sS0FBSyxFQUFpQyx5Q0FBeUMsRUFBRSxNQUFNLGtCQUFrQixDQUFDO0FBQ2pILE9BQU8sRUFBRSxXQUFXLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUM5RCxPQUFPLEVBQUUsS0FBSyxnQkFBZ0IsRUFBdUIsTUFBTSx5QkFBeUIsQ0FBQztBQUNyRixPQUFPLEtBQUssRUFBRSw2QkFBNkIsRUFBRSxNQUFNLGlDQUFpQyxDQUFDO0FBQ3JGLE9BQU8sS0FBSyxFQUFFLEtBQUssRUFBRSxNQUFNLHNCQUFzQixDQUFDO0FBQ2xELE9BQU8sRUFDTCxrQ0FBa0MsRUFDbEMsb0NBQW9DLEVBQ3BDLDRCQUE0QixFQUM1Qix1QkFBdUIsRUFDdkIsS0FBSyxzQkFBc0IsRUFDNUIsTUFBTSxzQkFBc0IsQ0FBQztBQVc5Qjs7Ozs7Ozs7R0FRRztBQUNILHFCQUFhLG1CQUFtQjs7YUFhWixXQUFXLEVBQUUsV0FBVzthQUN4QixtQkFBbUIsRUFBRSxNQUFNO2FBQzNCLDJCQUEyQixFQUFFLDJCQUEyQjthQUN4RCxvQkFBb0IsRUFBRSxzQkFBc0I7SUFDNUQsT0FBTyxDQUFDLFFBQVEsQ0FBQyxrQkFBa0I7SUFDbkMsT0FBTyxDQUFDLFFBQVEsQ0FBQyxpQkFBaUI7SUFqQnBDLE9BQU8sQ0FBQyxnQkFBZ0IsQ0FFdEI7SUFDRixPQUFPLENBQUMsc0JBQXNCLENBRWhCO0lBQ2QsT0FBTyxDQUFDLGVBQWUsQ0FBdUY7SUFDOUcsT0FBTyxDQUFDLGtCQUFrQixDQUFxQztJQUMvRCxPQUFPLENBQUMsZ0JBQWdCLENBQTBCO0lBQ2xELE9BQU8sQ0FBQyxTQUFTLENBQThCO0lBRS9DLFlBQ2tCLFdBQVcsRUFBRSxXQUFXLEVBQ3hCLG1CQUFtQixFQUFFLE1BQU0sRUFDM0IsMkJBQTJCLEVBQUUsMkJBQTJCLEVBQ3hELG9CQUFvQixFQUFFLHNCQUFzQixFQUMzQyxrQkFBa0IsRUFBRSxNQUFNLElBQUksRUFDOUIsaUJBQWlCLEVBQUUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxLQUFLLElBQUksRUFNN0Q7SUFJTSw0QkFBNEIsQ0FDakMsZUFBZSxFQUFFLE1BQU0sRUFDdkIsYUFBYSxFQUFFLDZCQUE2QixDQUMxQyw0QkFBNEIsRUFDNUIsT0FBTyx5Q0FBeUMsQ0FDakQsR0FDQSxnQkFBZ0IsQ0FFbEI7SUFJTSw4QkFBOEIsQ0FBQyxRQUFRLEVBQUUsZ0JBQWdCLFdBTS9EO0lBRU0sNkJBQTZCLENBQ2xDLFFBQVEsRUFBRSxnQkFBZ0IsRUFDMUIsYUFBYSxFQUFFLDZCQUE2QixDQUMxQyw0QkFBNEIsRUFDNUIsT0FBTyx5Q0FBeUMsQ0FDakQsUUFHRjtJQUVNLHlCQUF5QixDQUFDLFFBQVEsRUFBRSxnQkFBZ0IsV0FFMUQ7SUFFTSxpQkFBaUIsQ0FBQyxRQUFRLEVBQUUsZ0JBQWdCLG9CQUVsRDtJQUVNLDhCQUE4QixDQUFDLGFBQWEsRUFBRSxnQkFBZ0Isc0NBTXBFO0lBSU0sZ0NBQWdDLFlBTXRDO0lBRU0seUJBQXlCLENBQzlCLGFBQWEsRUFBRSw2QkFBNkIsQ0FDMUMsNEJBQTRCLEVBQzVCLE9BQU8seUNBQXlDLENBQ2pELFFBR0Y7SUFFTSwwQkFBMEIseUNBRWhDO0lBSU0seUJBQXlCLFlBTS9CO0lBRU0sa0JBQWtCLENBQUMsYUFBYSxFQUFFLDZCQUE2QixDQUFDLHNCQUFzQixDQUFDLFFBRTdGO0lBRU0sb0JBQW9CLFlBRzFCO0lBRU0sbUJBQW1CLDRCQVF6QjtJQUlEOzs7T0FHRztJQUNJLHFCQUFxQixDQUFDLFdBQVcsRUFBRSxzQkFBc0IsUUFFL0Q7SUFFWSxtQkFBbUIsa0JBSy9CO0lBRU0sbUJBQW1CLElBQUk7UUFBRSxLQUFLLEVBQUUsS0FBSyxDQUFDO1FBQUMsWUFBWSxFQUFFLHNCQUFzQixDQUFDO1FBQUMsaUJBQWlCLEVBQUUsV0FBVyxDQUFBO0tBQUUsQ0FVbkg7SUFJTSxXQUFXLFlBRWpCO0lBRU0sT0FBTyxTQU1iO0lBRU0sTUFBTSxDQUFDLE1BQU0sRUFBRSxNQUFNLFFBTTNCO0lBRU0sTUFBTSxTQUVaO0NBUUYifQ==

package/dest/orchestrator/top-tree-proving-state.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"top-tree-proving-state.d.ts","sourceRoot":"","sources":["../../src/orchestrator/top-tree-proving-state.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,sBAAsB,EAAE,2BAA2B,EAAE,MAAM,iBAAiB,CAAC;AACxG,OAAO,KAAK,EAAiC,yCAAyC,EAAE,MAAM,kBAAkB,CAAC;AACjH,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC9D,OAAO,EAAE,KAAK,gBAAgB,EAAuB,MAAM,yBAAyB,CAAC;AACrF,OAAO,KAAK,EAAE,6BAA6B,EAAE,MAAM,iCAAiC,CAAC;AACrF,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,kCAAkC,EAClC,oCAAoC,EACpC,4BAA4B,EAC5B,uBAAuB,EACvB,KAAK,sBAAsB,EAC5B,MAAM,sBAAsB,CAAC;AAW9B;;;;;;;;GAQG;AACH,qBAAa,mBAAmB;;aAaZ,WAAW,EAAE,WAAW;aACxB,mBAAmB,EAAE,MAAM;aAC3B,2BAA2B,EAAE,2BAA2B;aACxD,oBAAoB,EAAE,sBAAsB;IAC5D,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IACnC,OAAO,CAAC,QAAQ,CAAC,iBAAiB;IAjBpC,OAAO,CAAC,gBAAgB,CAEtB;IACF,OAAO,CAAC,sBAAsB,CAEhB;IACd,OAAO,CAAC,eAAe,CAAuF;IAC9G,OAAO,CAAC,kBAAkB,CAAqC;IAC/D,OAAO,CAAC,gBAAgB,CAA0B;IAClD,OAAO,CAAC,SAAS,CAA8B;IAE/C,YACkB,WAAW,EAAE,WAAW,EACxB,mBAAmB,EAAE,MAAM,EAC3B,2BAA2B,EAAE,2BAA2B,EACxD,oBAAoB,EAAE,sBAAsB,EAC3C,kBAAkB,EAAE,MAAM,IAAI,EAC9B,iBAAiB,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,EAM7D;IAIM,4BAA4B,CACjC,eAAe,EAAE,MAAM,EACvB,aAAa,EAAE,6BAA6B,CAC1C,4BAA4B,EAC5B,OAAO,yCAAyC,CACjD,GACA,gBAAgB,CAElB;IAIM,8BAA8B,CAAC,QAAQ,EAAE,gBAAgB,WAM/D;IAEM,6BAA6B,CAClC,QAAQ,EAAE,gBAAgB,EAC1B,aAAa,EAAE,6BAA6B,CAC1C,4BAA4B,EAC5B,OAAO,yCAAyC,CACjD,QAGF;IAEM,yBAAyB,CAAC,QAAQ,EAAE,gBAAgB,WAE1D;IAEM,iBAAiB,CAAC,QAAQ,EAAE,gBAAgB,oBAElD;IAEM,8BAA8B,CAAC,aAAa,EAAE,gBAAgB,sCAMpE;IAIM,gCAAgC,YAMtC;IAEM,yBAAyB,CAC9B,aAAa,EAAE,6BAA6B,CAC1C,4BAA4B,EAC5B,OAAO,yCAAyC,CACjD,QAGF;IAEM,0BAA0B,yCAEhC;IAIM,yBAAyB,YAM/B;IAEM,kBAAkB,CAAC,aAAa,EAAE,6BAA6B,CAAC,sBAAsB,CAAC,QAE7F;IAEM,oBAAoB,YAG1B;IAEM,mBAAmB,4BAQzB;IAID;;;OAGG;IACI,qBAAqB,CAAC,WAAW,EAAE,sBAAsB,QAE/D;IAEY,mBAAmB,kBAK/B;IAEM,mBAAmB,IAAI;QAAE,KAAK,EAAE,KAAK,CAAC;QAAC,YAAY,EAAE,sBAAsB,CAAC;QAAC,iBAAiB,EAAE,WAAW,CAAA;KAAE,CAUnH;IAIM,WAAW,YAEjB;IAEM,OAAO,SAMb;IAEM,MAAM,CAAC,MAAM,EAAE,MAAM,QAM3B;IAEM,MAAM,SAEZ;CAQF"}

package/dest/orchestrator/top-tree-proving-state.js

@@ -0,0 +1,185 @@
+import { UnbalancedTreeStore } from '@aztec/foundation/trees';
+import { CheckpointMergeRollupPrivateInputs, CheckpointPaddingRollupPrivateInputs, RootRollupPrivateInputs } from '@aztec/stdlib/rollup';
+import { toProofData } from './block-building-helpers.js';
+var TOP_TREE_LIFECYCLE = /*#__PURE__*/ function(TOP_TREE_LIFECYCLE) {
+    TOP_TREE_LIFECYCLE[TOP_TREE_LIFECYCLE["CREATED"] = 0] = "CREATED";
+    TOP_TREE_LIFECYCLE[TOP_TREE_LIFECYCLE["RESOLVED"] = 1] = "RESOLVED";
+    TOP_TREE_LIFECYCLE[TOP_TREE_LIFECYCLE["REJECTED"] = 2] = "REJECTED";
+    return TOP_TREE_LIFECYCLE;
+}(TOP_TREE_LIFECYCLE || {});
+/**
+ * Lean top-tree-only state. Owns the merge tree of checkpoint root proofs, the
+ * single-checkpoint padding proof slot, the final root rollup proof, and the blob
+ * accumulator endpoints needed to finalise the epoch's batched blob proof.
+ *
+ * Constructed with `totalNumCheckpoints` and `finalBlobBatchingChallenges` upfront —
+ * by the time the top tree starts, all checkpoints are known and the challenges are
+ * derivable from their blob fields.
+ */ export class TopTreeProvingState {
+    epochNumber;
+    totalNumCheckpoints;
+    finalBlobBatchingChallenges;
+    startBlobAccumulator;
+    completionCallback;
+    rejectionCallback;
+    checkpointProofs;
+    checkpointPaddingProof;
+    rootRollupProof;
+    endBlobAccumulator;
+    finalBatchedBlob;
+    lifecycle;
+    constructor(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, startBlobAccumulator, completionCallback, rejectionCallback){
+        this.epochNumber = epochNumber;
+        this.totalNumCheckpoints = totalNumCheckpoints;
+        this.finalBlobBatchingChallenges = finalBlobBatchingChallenges;
+        this.startBlobAccumulator = startBlobAccumulator;
+        this.completionCallback = completionCallback;
+        this.rejectionCallback = rejectionCallback;
+        this.lifecycle = 0;
+        if (totalNumCheckpoints < 1) {
+            throw new Error(`TopTreeProvingState requires at least one checkpoint; got ${totalNumCheckpoints}.`);
+        }
+        this.checkpointProofs = new UnbalancedTreeStore(totalNumCheckpoints);
+    }
+    // --- checkpoint root rollup ---
+    setCheckpointRootRollupProof(checkpointIndex, provingOutput) {
+        return this.checkpointProofs.setLeaf(checkpointIndex, {
+            provingOutput
+        });
+    }
+    // --- checkpoint merge rollup ---
+    tryStartProvingCheckpointMerge(location) {
+        if (this.checkpointProofs.getNode(location)?.isProving) {
+            return false;
+        }
+        this.checkpointProofs.setNode(location, {
+            isProving: true
+        });
+        return true;
+    }
+    setCheckpointMergeRollupProof(location, provingOutput) {
+        this.checkpointProofs.setNode(location, {
+            provingOutput
+        });
+    }
+    isReadyForCheckpointMerge(location) {
+        return !!this.checkpointProofs.getSibling(location)?.provingOutput;
+    }
+    getParentLocation(location) {
+        return this.checkpointProofs.getParentLocation(location);
+    }
+    getCheckpointMergeRollupInputs(mergeLocation) {
+        const [left, right] = this.checkpointProofs.getChildren(mergeLocation).map((c)=>c?.provingOutput);
+        if (!left || !right) {
+            throw new Error('At least one child is not ready for the checkpoint merge rollup.');
+        }
+        return new CheckpointMergeRollupPrivateInputs([
+            toProofData(left),
+            toProofData(right)
+        ]);
+    }
+    // --- padding (single-checkpoint case) ---
+    tryStartProvingPaddingCheckpoint() {
+        if (this.checkpointPaddingProof?.isProving) {
+            return false;
+        }
+        this.checkpointPaddingProof = {
+            isProving: true
+        };
+        return true;
+    }
+    setCheckpointPaddingProof(provingOutput) {
+        this.checkpointPaddingProof = {
+            provingOutput
+        };
+    }
+    getPaddingCheckpointInputs() {
+        return new CheckpointPaddingRollupPrivateInputs();
+    }
+    // --- root rollup ---
+    tryStartProvingRootRollup() {
+        if (this.rootRollupProof?.isProving) {
+            return false;
+        }
+        this.rootRollupProof = {
+            isProving: true
+        };
+        return true;
+    }
+    setRootRollupProof(provingOutput) {
+        this.rootRollupProof = {
+            provingOutput
+        };
+    }
+    isReadyForRootRollup() {
+        const childProofs = this.#getChildProofsForRoot();
+        return childProofs.every((p)=>!!p);
+    }
+    getRootRollupInputs() {
+        const [left, right] = this.#getChildProofsForRoot();
+        if (!left || !right) {
+            throw new Error('At least one child is not ready for the root rollup.');
+        }
+        return RootRollupPrivateInputs.from({
+            previousRollups: [
+                toProofData(left),
+                toProofData(right)
+            ]
+        });
+    }
+    // --- blob accumulator finalisation ---
+    /**
+   * Sets the end-of-epoch blob accumulator, computed by the top-tree orchestrator
+   * from the surviving checkpoints' blob fields. Required before `finalizeBatchedBlob`.
+   */ setEndBlobAccumulator(accumulator) {
+        this.endBlobAccumulator = accumulator;
+    }
+    async finalizeBatchedBlob() {
+        if (!this.endBlobAccumulator) {
+            throw new Error('End blob accumulator not set; call setEndBlobAccumulator before finalize.');
+        }
+        this.finalBatchedBlob = await this.endBlobAccumulator.finalize(true);
+    }
+    getEpochProofResult() {
+        const provingOutput = this.rootRollupProof?.provingOutput;
+        if (!provingOutput || !this.finalBatchedBlob) {
+            throw new Error('Top-tree proof not ready; root rollup or batched blob missing.');
+        }
+        return {
+            proof: provingOutput.proof.binaryProof,
+            publicInputs: provingOutput.inputs,
+            batchedBlobInputs: this.finalBatchedBlob
+        };
+    }
+    // --- lifecycle ---
+    verifyState() {
+        return this.lifecycle === 0;
+    }
+    resolve() {
+        if (!this.verifyState()) {
+            return;
+        }
+        this.lifecycle = 1;
+        this.completionCallback();
+    }
+    reject(reason) {
+        if (!this.verifyState()) {
+            return;
+        }
+        this.lifecycle = 2;
+        this.rejectionCallback(reason);
+    }
+    cancel() {
+        this.reject('Top-tree proving cancelled');
+    }
+    #getChildProofsForRoot() {
+        const rootLocation = {
+            level: 0,
+            index: 0
+        };
+        return this.totalNumCheckpoints === 1 ? [
+            this.checkpointProofs.getNode(rootLocation)?.provingOutput,
+            this.checkpointPaddingProof?.provingOutput
+        ] : this.checkpointProofs.getChildren(rootLocation).map((c)=>c?.provingOutput);
+    }
+}