@aztec/prover-client 5.0.0-private.20260319 → 5.0.0-rc.2

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

@@ -1,20 +1,17 @@
-import { SpongeBlob, encodeCheckpointBlobDataFromBlocks } from '@aztec/blob-lib';
-import { BLOBS_PER_CHECKPOINT, FIELDS_PER_BLOB, NUM_MSGS_PER_BASE_PARITY } from '@aztec/constants';
+import { SpongeBlob } from '@aztec/blob-lib';
+import { NUM_MSGS_PER_BASE_PARITY } from '@aztec/constants';
 import { BlockNumber } from '@aztec/foundation/branded-types';
 import { padArrayEnd } from '@aztec/foundation/collection';
-import { BLS12Point } from '@aztec/foundation/curves/bls12';
 import { Fr } from '@aztec/foundation/curves/bn254';
 import { UnbalancedTreeStore } from '@aztec/foundation/trees';
-import { computeCheckpointOutHash } from '@aztec/stdlib/messaging';
 import { ParityBasePrivateInputs } from '@aztec/stdlib/parity';
-import { BlockMergeRollupPrivateInputs, CheckpointRootRollupHints, CheckpointRootRollupPrivateInputs, CheckpointRootSingleBlockRollupPrivateInputs } from '@aztec/stdlib/rollup';
-import { accumulateBlobs, buildBlobHints, toProofData } from './block-building-helpers.js';
+import { BlockMergeRollupPrivateInputs } from '@aztec/stdlib/rollup';
+import { toProofData } from './block-building-helpers.js';
 import { BlockProvingState } from './block-proving-state.js';
 export class CheckpointProvingState {
     index;
     constants;
     totalNumBlocks;
-    finalBlobBatchingChallenges;
     headerOfLastBlockInPreviousCheckpoint;
     lastArchiveSiblingPath;
     l1ToL2Messages;
@@ -22,28 +19,19 @@ export class CheckpointProvingState {
     lastL1ToL2MessageSubtreeRootSiblingPath;
     newL1ToL2MessageTreeSnapshot;
     newL1ToL2MessageSubtreeRootSiblingPath;
-    parentEpoch;
-    onBlobAccumulatorSet;
+    epochNumber;
+    isAlive;
+    onReject;
     blockProofs;
-    checkpointRootProof;
     blocks;
-    previousOutHashHint;
-    outHash;
-    // The snapshot and sibling path after the checkpoint's out hash is inserted.
-    // Stored here to be retrieved for the next checkpoint when it's added.
-    newOutHashHint;
-    startBlobAccumulator;
-    endBlobAccumulator;
-    blobFields;
     error;
     firstBlockNumber;
-    constructor(index, constants, totalNumBlocks, finalBlobBatchingChallenges, headerOfLastBlockInPreviousCheckpoint, lastArchiveSiblingPath, l1ToL2Messages, // The snapshot and sibling path before the new l1 to l2 message subtree is inserted.
+    constructor(index, constants, totalNumBlocks, headerOfLastBlockInPreviousCheckpoint, lastArchiveSiblingPath, l1ToL2Messages, // The snapshot and sibling path before the new l1 to l2 message subtree is inserted.
     lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, // The snapshot and sibling path after the new l1 to l2 message subtree is inserted.
-    newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath, parentEpoch, onBlobAccumulatorSet){
+    newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath, epochNumber, /** Owner's liveness check. `verifyState()` returns false once this returns false. */ isAlive, /** Owner's failure callback. Invoked from `reject` to surface the error upward. */ onReject){
         this.index = index;
         this.constants = constants;
         this.totalNumBlocks = totalNumBlocks;
-        this.finalBlobBatchingChallenges = finalBlobBatchingChallenges;
         this.headerOfLastBlockInPreviousCheckpoint = headerOfLastBlockInPreviousCheckpoint;
         this.lastArchiveSiblingPath = lastArchiveSiblingPath;
         this.l1ToL2Messages = l1ToL2Messages;
@@ -51,15 +39,13 @@ export class CheckpointProvingState {
         this.lastL1ToL2MessageSubtreeRootSiblingPath = lastL1ToL2MessageSubtreeRootSiblingPath;
         this.newL1ToL2MessageTreeSnapshot = newL1ToL2MessageTreeSnapshot;
         this.newL1ToL2MessageSubtreeRootSiblingPath = newL1ToL2MessageSubtreeRootSiblingPath;
-        this.parentEpoch = parentEpoch;
-        this.onBlobAccumulatorSet = onBlobAccumulatorSet;
+        this.epochNumber = epochNumber;
+        this.isAlive = isAlive;
+        this.onReject = onReject;
         this.blocks = [];
         this.blockProofs = new UnbalancedTreeStore(totalNumBlocks);
         this.firstBlockNumber = BlockNumber(headerOfLastBlockInPreviousCheckpoint.globalVariables.blockNumber + 1);
     }
-    get epochNumber() {
-        return this.parentEpoch.epochNumber;
-    }
     startNewBlock(blockNumber, timestamp, totalNumTxs, lastArchiveTreeSnapshot, lastArchiveSiblingPath) {
         const index = Number(blockNumber) - Number(this.firstBlockNumber);
         if (index >= this.totalNumBlocks) {
@@ -102,60 +88,9 @@ export class CheckpointProvingState {
             provingOutput
         });
     }
-    tryStartProvingCheckpointRoot() {
-        if (this.checkpointRootProof?.isProving) {
-            return false;
-        } else {
-            this.checkpointRootProof = {
-                isProving: true
-            };
-            return true;
-        }
-    }
-    setCheckpointRootRollupProof(provingOutput) {
-        this.checkpointRootProof = {
-            provingOutput
-        };
-        return this.parentEpoch.setCheckpointRootRollupProof(this.index, provingOutput);
-    }
     getBaseParityInputs(baseParityIndex) {
         const messages = padArrayEnd(this.l1ToL2Messages.slice(baseParityIndex * NUM_MSGS_PER_BASE_PARITY, (baseParityIndex + 1) * NUM_MSGS_PER_BASE_PARITY), Fr.ZERO, NUM_MSGS_PER_BASE_PARITY);
-        return new ParityBasePrivateInputs(messages, this.constants.vkTreeRoot);
-    }
-    setOutHashHint(hint) {
-        this.previousOutHashHint = hint;
-    }
-    getOutHashHint() {
-        return this.previousOutHashHint;
-    }
-    accumulateBlockOutHashes() {
-        if (this.isAcceptingBlocks() || this.blocks.some((b)=>!b?.hasEndState())) {
-            return;
-        }
-        if (!this.outHash) {
-            const messagesPerBlock = this.blocks.map((b)=>b.getTxEffects().map((tx)=>tx.l2ToL1Msgs));
-            this.outHash = computeCheckpointOutHash(messagesPerBlock);
-        }
-        return this.outHash;
-    }
-    setOutHashHintForNextCheckpoint(hint) {
-        this.newOutHashHint = hint;
-    }
-    getOutHashHintForNextCheckpoint() {
-        return this.newOutHashHint;
-    }
-    async accumulateBlobs(startBlobAccumulator) {
-        if (this.isAcceptingBlocks() || this.blocks.some((b)=>!b?.hasEndState())) {
-            return;
-        }
-        this.blobFields = encodeCheckpointBlobDataFromBlocks(this.blocks.map((b)=>b.getBlockBlobData()));
-        this.endBlobAccumulator = await accumulateBlobs(this.blobFields, startBlobAccumulator);
-        this.startBlobAccumulator = startBlobAccumulator;
-        await this.onBlobAccumulatorSet(this);
-        return this.endBlobAccumulator;
-    }
-    getEndBlobAccumulator() {
-        return this.endBlobAccumulator;
+        return new ParityBasePrivateInputs(messages, this.constants.vkTreeRoot, this.constants.proverId);
     }
     getParentLocation(location) {
         return this.blockProofs.getParentLocation(location);
@@ -170,41 +105,6 @@ export class CheckpointProvingState {
             toProofData(right)
         ]);
     }
-    getCheckpointRootRollupType() {
-        return this.totalNumBlocks === 1 ? 'rollup-checkpoint-root-single-block' : 'rollup-checkpoint-root';
-    }
-    async getCheckpointRootRollupInputs() {
-        const proofs = this.#getChildProofsForRoot();
-        const nonEmptyProofs = proofs.filter((p)=>!!p);
-        if (proofs.length !== nonEmptyProofs.length) {
-            throw new Error('At least one child is not ready for the checkpoint root rollup.');
-        }
-        if (!this.previousOutHashHint) {
-            throw new Error('Out hash hint is not set.');
-        }
-        if (!this.startBlobAccumulator) {
-            throw new Error('Start blob accumulator is not set.');
-        }
-        // `blobFields` must've been set if `startBlobAccumulator` is set (in `accumulateBlobs`).
-        const blobFields = this.blobFields;
-        const { blobCommitments, blobsHash } = await buildBlobHints(blobFields);
-        const hints = CheckpointRootRollupHints.from({
-            previousBlockHeader: this.headerOfLastBlockInPreviousCheckpoint,
-            previousArchiveSiblingPath: this.lastArchiveSiblingPath,
-            previousOutHash: this.previousOutHashHint.treeSnapshot,
-            newOutHashSiblingPath: this.previousOutHashHint.siblingPath,
-            startBlobAccumulator: this.startBlobAccumulator.toBlobAccumulator(),
-            finalBlobChallenges: this.finalBlobBatchingChallenges,
-            blobFields: padArrayEnd(blobFields, Fr.ZERO, FIELDS_PER_BLOB * BLOBS_PER_CHECKPOINT),
-            blobCommitments: padArrayEnd(blobCommitments, BLS12Point.ZERO, BLOBS_PER_CHECKPOINT),
-            blobsHash
-        });
-        const [left, right] = nonEmptyProofs.map((p)=>toProofData(p));
-        return !right ? new CheckpointRootSingleBlockRollupPrivateInputs(left, hints) : new CheckpointRootRollupPrivateInputs([
-            left,
-            right
-        ], hints);
-    }
     getBlockProvingStateByBlockNumber(blockNumber) {
         const index = Number(blockNumber) - Number(this.firstBlockNumber);
         return this.blocks[index];
@@ -212,12 +112,8 @@ export class CheckpointProvingState {
     isReadyForBlockMerge(location) {
         return !!this.blockProofs.getSibling(location)?.provingOutput;
     }
-    isReadyForCheckpointRoot() {
-        const allChildProofsReady = this.#getChildProofsForRoot().every((p)=>!!p);
-        return allChildProofsReady && !!this.previousOutHashHint && !!this.startBlobAccumulator;
-    }
     verifyState() {
-        return this.parentEpoch.verifyState();
+        return this.isAlive();
     }
     getError() {
         return this.error;
@@ -228,9 +124,12 @@ export class CheckpointProvingState {
     }
     reject(reason) {
         this.error = reason;
-        this.parentEpoch.reject(reason);
+        this.onReject(reason);
     }
-    #getChildProofsForRoot() {
+    /**
+   * Returns the block-level proof outputs that feed into the checkpoint root rollup.
+   * Used by `CheckpointSubTreeOrchestrator` to surface its sub-tree result.
+   */ getSubTreeOutputProofs() {
         const rootLocation = {
             level: 0,
             index: 0
@@ -240,4 +139,7 @@ export class CheckpointProvingState {
         ] // If there's only 1 block, its proof will be stored at the root.
          : this.blockProofs.getChildren(rootLocation).map((c)=>c?.provingOutput);
     }
+    /** Sibling path of the archive tree captured before any block in this checkpoint landed. */ getLastArchiveSiblingPath() {
+        return this.lastArchiveSiblingPath;
+    }
 }

package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts

@@ -0,0 +1,161 @@
+import { type ARCHIVE_HEIGHT, NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH } from '@aztec/constants';
+import { BlockNumber, type EpochNumber } from '@aztec/foundation/branded-types';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import type { LoggerBindings } from '@aztec/foundation/log';
+import type { SerialQueue } from '@aztec/foundation/queue';
+import { type Tuple } from '@aztec/foundation/serialize';
+import { EthAddress } from '@aztec/stdlib/block';
+import type { ForkMerkleTreeOperations, PublicInputsAndRecursiveProof, ReadonlyWorldStateAccess, ServerCircuitProver } from '@aztec/stdlib/interfaces/server';
+import { type BlockRollupPublicInputs, CheckpointConstantData } 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';
+import { CheckpointProvingState } from './checkpoint-proving-state.js';
+import type { ChonkCache } from './chonk-cache.js';
+import { ProvingScheduler } from './proving-scheduler.js';
+/**
+ * Result of proving a single checkpoint's block-level sub-tree.
+ *
+ * Contains the final block-rollup proof outputs that feed the checkpoint root rollup,
+ * plus the archive sibling path captured before any block in the checkpoint landed
+ * (the top-tree needs this to assemble the checkpoint root rollup hints).
+ */
+export type SubTreeResult = {
+    blockProofOutputs: PublicInputsAndRecursiveProof<BlockRollupPublicInputs, typeof NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH>[];
+    previousArchiveSiblingPath: Tuple<Fr, typeof ARCHIVE_HEIGHT>;
+};
+/**
+ * Orchestrates block-level proving for a single checkpoint, stopping at the boundary
+ * where checkpoint root rollup would otherwise begin. Used by the per-checkpoint
+ * `CheckpointProver` in production; the top-tree orchestrator then composes the
+ * sub-tree's block proofs into the epoch proof.
+ *
+ * Wiring: a single-checkpoint mini-proving session is owned by the constructor. The
+ * canonical way to obtain a fully-started sub-tree is the `start` static factory,
+ * which also drives the single internal `startCheckpoint` call. The sub-tree never
+ * escalates past the checkpoint root boundary; `getSubTreeResult()` resolves once
+ * every block-level proof in the checkpoint's tree is ready.
+ */
+export declare class CheckpointSubTreeOrchestrator extends ProvingScheduler {
+    private readonly dbProvider;
+    protected readonly prover: ServerCircuitProver;
+    private readonly proverId;
+    /**
+     * Shared chonk-verifier proof cache. Every chonk-verifier proof started by this
+     * sub-tree lives on the cache and survives the sub-tree's cancellation, so a tx
+     * whose original checkpoint is reorged out and re-appears in a replacement
+     * checkpoint reuses the cached proof.
+     */
+    private readonly chonkCache;
+    /** The epoch this sub-tree proves into. */
+    private readonly epochNumber;
+    private readonly cancelJobsOnStop;
+    /** The single checkpoint proving state this sub-tree owns. Allocated in the `start` factory. */
+    protected provingState: CheckpointProvingState | undefined;
+    private readonly subTreeResult;
+    private readonly metrics;
+    private dbs;
+    constructor(dbProvider: ReadonlyWorldStateAccess & ForkMerkleTreeOperations, prover: ServerCircuitProver, proverId: EthAddress, 
+    /**
+     * Shared chonk-verifier proof cache. Every chonk-verifier proof started by this
+     * sub-tree lives on the cache and survives the sub-tree's cancellation, so a tx
+     * whose original checkpoint is reorged out and re-appears in a replacement
+     * checkpoint reuses the cached proof.
+     */
+    chonkCache: ChonkCache, 
+    /** The epoch this sub-tree proves into. */
+    epochNumber: EpochNumber, cancelJobsOnStop: boolean | undefined, deferredJobQueue: SerialQueue, telemetryClient?: TelemetryClient, bindings?: LoggerBindings);
+    /** Tracks whether `cancel()` has been called; flows into the checkpoint state's isAlive hook. */
+    private cancelled;
+    get tracer(): Tracer;
+    getProverId(): EthAddress;
+    getNumActiveForks(): number;
+    /** Returns a promise that resolves when block-level proving completes for the checkpoint. */
+    getSubTreeResult(): Promise<SubTreeResult>;
+    /**
+     * Returns the archive sibling path captured at the internal checkpoint start.
+     * Available synchronously once `start` has resolved, before block-level proving
+     * completes. The top-tree consumer uses this to assemble checkpoint root rollup hints
+     * up-front so checkpoint root proofs can pipeline against in-flight sub-tree proving.
+     */
+    getPreviousArchiveSiblingPath(): Tuple<Fr, typeof ARCHIVE_HEIGHT>;
+    /**
+     * Constructs and starts a sub-tree for a single checkpoint. The returned sub-tree
+     * has had its single internal checkpoint state allocated; callers proceed directly
+     * to per-block `startNewBlock` / `addTxs` / `setBlockCompleted`.
+     *
+     * If the internal start rejects, the partially-constructed sub-tree is stopped
+     * before the error propagates, so no broker resources leak.
+     */
+    static start(dbProvider: ReadonlyWorldStateAccess & ForkMerkleTreeOperations, prover: ServerCircuitProver, proverId: EthAddress, chonkCache: ChonkCache, epochNumber: EpochNumber, cancelJobsOnStop: boolean, deferredJobQueue: SerialQueue, checkpointConstants: CheckpointConstantData, l1ToL2Messages: Fr[], totalNumBlocks: number, headerOfLastBlockInPreviousCheckpoint: BlockHeader, telemetryClient?: TelemetryClient, bindings?: LoggerBindings): Promise<CheckpointSubTreeOrchestrator>;
+    /**
+     * Kickstart chonk-verifier circuits via the shared `ChonkCache`. The cache owns the
+     * broker job lifecycle, so the proof survives this sub-tree's `cancel()` — a tx that
+     * ends up in a replacement checkpoint after a reorg can pick the cached promise up
+     * and skip re-proving.
+     */
+    startChonkVerifierCircuits(txs: Tx[]): Promise<void>;
+    /**
+     * Starts off a new block.
+     * @param blockNumber - The block number
+     * @param timestamp - The timestamp of the block. Required for empty blocks to construct private inputs.
+     * @param totalNumTxs - The total number of txs in the block.
+     */
+    startNewBlock(blockNumber: BlockNumber, timestamp: UInt64, totalNumTxs: number): Promise<void>;
+    /**
+     * The interface to add simulated transactions to the scheduler. Called at most once per block.
+     * @param txs - The transactions to be proven
+     */
+    addTxs(txs: ProcessedTx[]): Promise<void>;
+    /**
+     * Marks the block as completed.
+     * Computes the block header and updates the archive tree.
+     */
+    setBlockCompleted(blockNumber: BlockNumber, expectedHeader?: BlockHeader): Promise<BlockHeader>;
+    /**
+     * Cancels any further proving. If `cancelJobsOnStop` was set, aborts all pending broker jobs
+     * (used on reorg). Otherwise jobs remain in the broker queue and can be reused on restart.
+     */
+    cancel(): void;
+    protected cancelInternal(): void;
+    private startCheckpoint;
+    private updateL1ToL2MessageTree;
+    private prepareBaseRollupInputs;
+    private enqueueBaseRollup;
+    /**
+     * Route the tx's chonk-verifier dependency through the per-epoch context: read the
+     * cached promise (or enqueue if missing), then `.then(handleResult)` to progress to
+     * the base rollup once the proof lands.
+     */
+    private getOrEnqueueChonkVerifier;
+    private enqueueMergeRollup;
+    private enqueueBlockRootRollup;
+    private enqueueBaseParityCircuit;
+    private checkAndEnqueueRootParityCircuit;
+    private enqueueRootParityCircuit;
+    private enqueueBlockMergeRollup;
+    private checkAndEnqueueNextMergeRollup;
+    private checkAndEnqueueBlockRootRollup;
+    private checkAndEnqueueNextBlockMergeRollup;
+    /**
+     * Sub-tree analogue of the orchestrator's `checkAndEnqueueCheckpointRootRollup`:
+     * resolves the sub-tree promise with the block-level proof outputs once they're all ready,
+     * instead of escalating to the checkpoint root rollup.
+     */
+    private checkAndEnqueueSubTreeResolution;
+    /**
+     * Executes the VM circuit for a public function. Enqueues the base rollup once the
+     * tx's chonk-verifier + VM proofs are both ready.
+     */
+    private enqueueVM;
+    private checkAndEnqueueBaseRollup;
+    protected verifyBuiltBlockAgainstSyncedState(provingState: BlockProvingState): Promise<void>;
+    private getDbForBlock;
+    /**
+     * Wraps a circuit call with a tracer span and circuit attributes. Replaces the
+     * `ProvingScheduler.wrapCircuitCall` indirection that used to live on the abstract base.
+     */
+    private wrapCircuitCall;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY2hlY2twb2ludC1zdWItdHJlZS1vcmNoZXN0cmF0b3IuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9vcmNoZXN0cmF0b3IvY2hlY2twb2ludC1zdWItdHJlZS1vcmNoZXN0cmF0b3IudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxFQUNMLEtBQUssY0FBYyxFQUduQix5Q0FBeUMsRUFFMUMsTUFBTSxrQkFBa0IsQ0FBQztBQUMxQixPQUFPLEVBQUUsV0FBVyxFQUFFLEtBQUssV0FBVyxFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFDaEYsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLGdDQUFnQyxDQUFDO0FBRXBELE9BQU8sS0FBSyxFQUFFLGNBQWMsRUFBRSxNQUFNLHVCQUF1QixDQUFDO0FBRTVELE9BQU8sS0FBSyxFQUFFLFdBQVcsRUFBRSxNQUFNLHlCQUF5QixDQUFDO0FBQzNELE9BQU8sRUFBRSxLQUFLLEtBQUssRUFBZ0IsTUFBTSw2QkFBNkIsQ0FBQztBQUV2RSxPQUFPLEVBQUUsVUFBVSxFQUFFLE1BQU0scUJBQXFCLENBQUM7QUFDakQsT0FBTyxLQUFLLEVBQ1Ysd0JBQXdCLEVBRXhCLDZCQUE2QixFQUM3Qix3QkFBd0IsRUFDeEIsbUJBQW1CLEVBQ3BCLE1BQU0saUNBQWlDLENBQUM7QUFFekMsT0FBTyxFQUVMLEtBQUssdUJBQXVCLEVBSzVCLHNCQUFzQixFQUd2QixNQUFNLHNCQUFzQixDQUFDO0FBRzlCLE9BQU8sS0FBSyxFQUFFLFdBQVcsRUFBRSxXQUFXLEVBQUUsRUFBRSxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFDckUsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0scUJBQXFCLENBQUM7QUFDbEQsT0FBTyxFQUVMLEtBQUssZUFBZSxFQUNwQixLQUFLLE1BQU0sRUFJWixNQUFNLHlCQUF5QixDQUFDO0FBZWpDLE9BQU8sS0FBSyxFQUFFLGlCQUFpQixFQUFFLE1BQU0sMEJBQTBCLENBQUM7QUFDbEUsT0FBTyxFQUFFLHNCQUFzQixFQUFFLE1BQU0sK0JBQStCLENBQUM7QUFDdkUsT0FBTyxLQUFLLEVBQUUsVUFBVSxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFFbkQsT0FBTyxFQUFFLGdCQUFnQixFQUFFLE1BQU0sd0JBQXdCLENBQUM7QUFHMUQ7Ozs7OztHQU1HO0FBQ0gsTUFBTSxNQUFNLGFBQWEsR0FBRztJQUMxQixpQkFBaUIsRUFBRSw2QkFBNkIsQ0FDOUMsdUJBQXVCLEVBQ3ZCLE9BQU8seUNBQXlDLENBQ2pELEVBQUUsQ0FBQztJQUNKLDBCQUEwQixFQUFFLEtBQUssQ0FBQyxFQUFFLEVBQUUsT0FBTyxjQUFjLENBQUMsQ0FBQztDQUM5RCxDQUFDO0FBZUY7Ozs7Ozs7Ozs7O0dBV0c7QUFDSCxxQkFBYSw2QkFBOEIsU0FBUSxnQkFBZ0I7SUFRL0QsT0FBTyxDQUFDLFFBQVEsQ0FBQyxVQUFVO0lBQzNCLFNBQVMsQ0FBQyxRQUFRLENBQUMsTUFBTSxFQUFFLG1CQUFtQjtJQUM5QyxPQUFPLENBQUMsUUFBUSxDQUFDLFFBQVE7SUFDekI7Ozs7O09BS0c7SUFDSCxPQUFPLENBQUMsUUFBUSxDQUFDLFVBQVU7SUFDM0IsMkNBQTJDO0lBQzNDLE9BQU8sQ0FBQyxRQUFRLENBQUMsV0FBVztJQUM1QixPQUFPLENBQUMsUUFBUSxDQUFDLGdCQUFnQjtJQW5CbkMsZ0dBQWdHO0lBQ2hHLFNBQVMsQ0FBQyxZQUFZLEVBQUUsc0JBQXNCLEdBQUcsU0FBUyxDQUFhO0lBQ3ZFLE9BQU8sQ0FBQyxRQUFRLENBQUMsYUFBYSxDQUFzQztJQUNwRSxPQUFPLENBQUMsUUFBUSxDQUFDLE9BQU8sQ0FBNkI7SUFDckQsT0FBTyxDQUFDLEdBQUcsQ0FBMEQ7SUFFckUsWUFDbUIsVUFBVSxFQUFFLHdCQUF3QixHQUFHLHdCQUF3QixFQUM3RCxNQUFNLEVBQUUsbUJBQW1CLEVBQzdCLFFBQVEsRUFBRSxVQUFVO0lBQ3JDOzs7OztPQUtHO0lBQ2MsVUFBVSxFQUFFLFVBQVU7SUFDdkMsMkNBQTJDO0lBQzFCLFdBQVcsRUFBRSxXQUFXLEVBQ3hCLGdCQUFnQixxQkFBaUIsRUFDbEQsZ0JBQWdCLEVBQUUsV0FBVyxFQUM3QixlQUFlLEdBQUUsZUFBc0MsRUFDdkQsUUFBUSxDQUFDLEVBQUUsY0FBYyxFQVMxQjtJQUVELGlHQUFpRztJQUNqRyxPQUFPLENBQUMsU0FBUyxDQUFTO0lBRTFCLElBQVcsTUFBTSxJQUFJLE1BQU0sQ0FFMUI7SUFFTSxXQUFXLElBQUksVUFBVSxDQUUvQjtJQUVNLGlCQUFpQixJQUFJLE1BQU0sQ0FFakM7SUFFRCw2RkFBNkY7SUFDdEYsZ0JBQWdCLElBQUksT0FBTyxDQUFDLGFBQWEsQ0FBQyxDQUVoRDtJQUVEOzs7OztPQUtHO0lBQ0ksNkJBQTZCLElBQUksS0FBSyxDQUFDLEVBQUUsRUFBRSxPQUFPLGNBQWMsQ0FBQyxDQUt2RTtJQUVEOzs7Ozs7O09BT0c7SUFDSCxPQUFvQixLQUFLLENBQ3ZCLFVBQVUsRUFBRSx3QkFBd0IsR0FBRyx3QkFBd0IsRUFDL0QsTUFBTSxFQUFFLG1CQUFtQixFQUMzQixRQUFRLEVBQUUsVUFBVSxFQUNwQixVQUFVLEVBQUUsVUFBVSxFQUN0QixXQUFXLEVBQUUsV0FBVyxFQUN4QixnQkFBZ0IsRUFBRSxPQUFPLEVBQ3pCLGdCQUFnQixFQUFFLFdBQVcsRUFDN0IsbUJBQW1CLEVBQUUsc0JBQXNCLEVBQzNDLGNBQWMsRUFBRSxFQUFFLEVBQUUsRUFDcEIsY0FBYyxFQUFFLE1BQU0sRUFDdEIscUNBQXFDLEVBQUUsV0FBVyxFQUNsRCxlQUFlLEdBQUUsZUFBc0MsRUFDdkQsUUFBUSxDQUFDLEVBQUUsY0FBYyxHQUN4QixPQUFPLENBQUMsNkJBQTZCLENBQUMsQ0F3QnhDO0lBRUQ7Ozs7O09BS0c7SUFDSSwwQkFBMEIsQ0FBQyxHQUFHLEVBQUUsRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQWUxRDtJQUlEOzs7OztPQUtHO0lBSVUsYUFBYSxDQUFDLFdBQVcsRUFBRSxXQUFXLEVBQUUsU0FBUyxFQUFFLE1BQU0sRUFBRSxXQUFXLEVBQUUsTUFBTSxpQkFrRDFGO0lBRUQ7OztPQUdHO0lBSVUsTUFBTSxDQUFDLEdBQUcsRUFBRSxXQUFXLEVBQUUsR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBb0ZyRDtJQUVEOzs7T0FHRztJQUlVLGlCQUFpQixDQUFDLFdBQVcsRUFBRSxXQUFXLEVBQUUsY0FBYyxDQUFDLEVBQUUsV0FBVyxHQUFHLE9BQU8sQ0FBQyxXQUFXLENBQUMsQ0FrRDNHO0lBSUQ7OztPQUdHO0lBQ0ksTUFBTSxTQVdaO0lBRUQsVUFBbUIsY0FBYyxJQUFJLElBQUksQ0FFeEM7WUFTYSxlQUFlO1lBK0NmLHVCQUF1QjtZQTRCdkIsdUJBQXVCO0lBa0NyQyxPQUFPLENBQUMsaUJBQWlCO0lBNkN6Qjs7OztPQUlHO0lBQ0gsT0FBTyxDQUFDLHlCQUF5QjtJQTBDakMsT0FBTyxDQUFDLGtCQUFrQjtJQTRCMUIsT0FBTyxDQUFDLHNCQUFzQjtJQTBEOUIsT0FBTyxDQUFDLHdCQUF3QjtJQStCaEMsT0FBTyxDQUFDLGdDQUFnQztJQVN4QyxPQUFPLENBQUMsd0JBQXdCO0lBNEJoQyxPQUFPLENBQUMsdUJBQXVCO0lBK0IvQixPQUFPLENBQUMsOEJBQThCO0lBWXRDLE9BQU8sQ0FBQyw4QkFBOEI7SUFRdEMsT0FBTyxDQUFDLG1DQUFtQztJQWUzQzs7OztPQUlHO0lBQ0gsT0FBTyxDQUFDLGdDQUFnQztJQWF4Qzs7O09BR0c7SUFDSCxPQUFPLENBQUMsU0FBUztJQTBCakIsT0FBTyxDQUFDLHlCQUF5QjtJQVdqQyxVQUFnQixrQ0FBa0MsQ0FBQyxZQUFZLEVBQUUsaUJBQWlCLGlCQTZDakY7SUFFRCxPQUFPLENBQUMsYUFBYTtJQVFyQjs7O09BR0c7SUFDSCxPQUFPLENBQUMsZUFBZTtDQVl4QiJ9

package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint-sub-tree-orchestrator.d.ts","sourceRoot":"","sources":["../../src/orchestrator/checkpoint-sub-tree-orchestrator.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,cAAc,EAGnB,yCAAyC,EAE1C,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,WAAW,EAAE,KAAK,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAChF,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAEpD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAE5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,KAAK,KAAK,EAAgB,MAAM,6BAA6B,CAAC;AAEvE,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,KAAK,EACV,wBAAwB,EAExB,6BAA6B,EAC7B,wBAAwB,EACxB,mBAAmB,EACpB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAEL,KAAK,uBAAuB,EAK5B,sBAAsB,EAGvB,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;AAClE,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,GAAG;IAC1B,iBAAiB,EAAE,6BAA6B,CAC9C,uBAAuB,EACvB,OAAO,yCAAyC,CACjD,EAAE,CAAC;IACJ,0BAA0B,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC,CAAC;CAC9D,CAAC;AAeF;;;;;;;;;;;GAWG;AACH,qBAAa,6BAA8B,SAAQ,gBAAgB;IAQ/D,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,mBAAmB;IAC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB;;;;;OAKG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,2CAA2C;IAC3C,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAnBnC,gGAAgG;IAChG,SAAS,CAAC,YAAY,EAAE,sBAAsB,GAAG,SAAS,CAAa;IACvE,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAsC;IACpE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA6B;IACrD,OAAO,CAAC,GAAG,CAA0D;IAErE,YACmB,UAAU,EAAE,wBAAwB,GAAG,wBAAwB,EAC7D,MAAM,EAAE,mBAAmB,EAC7B,QAAQ,EAAE,UAAU;IACrC;;;;;OAKG;IACc,UAAU,EAAE,UAAU;IACvC,2CAA2C;IAC1B,WAAW,EAAE,WAAW,EACxB,gBAAgB,qBAAiB,EAClD,gBAAgB,EAAE,WAAW,EAC7B,eAAe,GAAE,eAAsC,EACvD,QAAQ,CAAC,EAAE,cAAc,EAS1B;IAED,iGAAiG;IACjG,OAAO,CAAC,SAAS,CAAS;IAE1B,IAAW,MAAM,IAAI,MAAM,CAE1B;IAEM,WAAW,IAAI,UAAU,CAE/B;IAEM,iBAAiB,IAAI,MAAM,CAEjC;IAED,6FAA6F;IACtF,gBAAgB,IAAI,OAAO,CAAC,aAAa,CAAC,CAEhD;IAED;;;;;OAKG;IACI,6BAA6B,IAAI,KAAK,CAAC,EAAE,EAAE,OAAO,cAAc,CAAC,CAKvE;IAED;;;;;;;OAOG;IACH,OAAoB,KAAK,CACvB,UAAU,EAAE,wBAAwB,GAAG,wBAAwB,EAC/D,MAAM,EAAE,mBAAmB,EAC3B,QAAQ,EAAE,UAAU,EACpB,UAAU,EAAE,UAAU,EACtB,WAAW,EAAE,WAAW,EACxB,gBAAgB,EAAE,OAAO,EACzB,gBAAgB,EAAE,WAAW,EAC7B,mBAAmB,EAAE,sBAAsB,EAC3C,cAAc,EAAE,EAAE,EAAE,EACpB,cAAc,EAAE,MAAM,EACtB,qCAAqC,EAAE,WAAW,EAClD,eAAe,GAAE,eAAsC,EACvD,QAAQ,CAAC,EAAE,cAAc,GACxB,OAAO,CAAC,6BAA6B,CAAC,CAwBxC;IAED;;;;;OAKG;IACI,0BAA0B,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAe1D;IAID;;;;;OAKG;IAIU,aAAa,CAAC,WAAW,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,iBAkD1F;IAED;;;OAGG;IAIU,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAoFrD;IAED;;;OAGG;IAIU,iBAAiB,CAAC,WAAW,EAAE,WAAW,EAAE,cAAc,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAkD3G;IAID;;;OAGG;IACI,MAAM,SAWZ;IAED,UAAmB,cAAc,IAAI,IAAI,CAExC;YASa,eAAe;YA+Cf,uBAAuB;YA4BvB,uBAAuB;IAkCrC,OAAO,CAAC,iBAAiB;IA6CzB;;;;OAIG;IACH,OAAO,CAAC,yBAAyB;IA0CjC,OAAO,CAAC,kBAAkB;IA4B1B,OAAO,CAAC,sBAAsB;IA0D9B,OAAO,CAAC,wBAAwB;IA+BhC,OAAO,CAAC,gCAAgC;IASxC,OAAO,CAAC,wBAAwB;IA4BhC,OAAO,CAAC,uBAAuB;IA+B/B,OAAO,CAAC,8BAA8B;IAYtC,OAAO,CAAC,8BAA8B;IAQtC,OAAO,CAAC,mCAAmC;IAe3C;;;;OAIG;IACH,OAAO,CAAC,gCAAgC;IAaxC;;;OAGG;IACH,OAAO,CAAC,SAAS;IA0BjB,OAAO,CAAC,yBAAyB;IAWjC,UAAgB,kCAAkC,CAAC,YAAY,EAAE,iBAAiB,iBA6CjF;IAED,OAAO,CAAC,aAAa;IAQrB;;;OAGG;IACH,OAAO,CAAC,eAAe;CAYxB"}