@aztec/prover-client 0.0.1-commit.993d240 → 0.0.1-commit.9a89641

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

@@ -1,269 +0,0 @@
-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";
-    PROVING_STATE_LIFECYCLE[PROVING_STATE_LIFECYCLE["PROVING_STATE_RESOLVED"] = 2] = "PROVING_STATE_RESOLVED";
-    PROVING_STATE_LIFECYCLE[PROVING_STATE_LIFECYCLE["PROVING_STATE_REJECTED"] = 3] = "PROVING_STATE_REJECTED";
-    return PROVING_STATE_LIFECYCLE;
-}(PROVING_STATE_LIFECYCLE || {});
-/**
- * The current state of the proving schedule for an epoch.
- * Contains the raw inputs and intermediate state to generate every constituent proof in the tree.
- * Carries an identifier so we can identify if the proving state is discarded and a new one started.
- * Captures resolve and reject callbacks to provide a promise base interface to the consumer of our proving.
- */ export class EpochProvingState {
-    epochNumber;
-    totalNumCheckpoints;
-    finalBlobBatchingChallenges;
-    onCheckpointBlobAccumulatorSet;
-    completionCallback;
-    rejectionCallback;
-    checkpointProofs;
-    checkpointPaddingProof;
-    rootRollupProof;
-    checkpoints;
-    startBlobAccumulator;
-    endBlobAccumulator;
-    finalBatchedBlob;
-    provingStateLifecycle;
-    // 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.totalNumCheckpoints = totalNumCheckpoints;
-        this.finalBlobBatchingChallenges = finalBlobBatchingChallenges;
-        this.onCheckpointBlobAccumulatorSet = onCheckpointBlobAccumulatorSet;
-        this.completionCallback = completionCallback;
-        this.rejectionCallback = rejectionCallback;
-        this.checkpoints = [];
-        this.provingStateLifecycle = 0;
-        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
-    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 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 checkpoints, false otherwise.
-    isAcceptingCheckpoints() {
-        return this.checkpoints.filter((c)=>!!c).length < this.totalNumCheckpoints;
-    }
-    setCheckpointRootRollupProof(checkpointIndex, provingOutput) {
-        return this.checkpointProofs.setLeaf(checkpointIndex, {
-            provingOutput
-        });
-    }
-    tryStartProvingCheckpointMerge(location) {
-        if (this.checkpointProofs.getNode(location)?.isProving) {
-            return false;
-        } else {
-            this.checkpointProofs.setNode(location, {
-                isProving: true
-            });
-            return true;
-        }
-    }
-    setCheckpointMergeRollupProof(location, provingOutput) {
-        this.checkpointProofs.setNode(location, {
-            provingOutput
-        });
-    }
-    tryStartProvingRootRollup() {
-        if (this.rootRollupProof?.isProving) {
-            return false;
-        } else {
-            this.rootRollupProof = {
-                isProving: true
-            };
-            return true;
-        }
-    }
-    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);
-            // If this is NOT the last checkpoint, get or create the hint for the next checkpoint.
-            if (i !== this.totalNumCheckpoints - 1) {
-                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.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)
-        ]);
-    }
-    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)
-            ]
-        });
-    }
-    getPaddingCheckpointInputs() {
-        return new CheckpointPaddingRollupPrivateInputs();
-    }
-    getEpochProofResult() {
-        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: provingOutput.proof.binaryProof,
-            publicInputs: provingOutput.inputs,
-            batchedBlobInputs: this.finalBatchedBlob
-        };
-    }
-    isReadyForCheckpointMerge(location) {
-        return !!this.checkpointProofs.getSibling(location)?.provingOutput;
-    }
-    // Returns true if we have sufficient inputs to execute the block root rollup
-    isReadyForRootRollup() {
-        const childProofs = this.#getChildProofsForRoot();
-        return childProofs.every((p)=>!!p);
-    }
-    // Attempts to reject the proving state promise with a reason of 'cancelled'
-    cancel() {
-        this.reject('Proving cancelled');
-    }
-    // Attempts to reject the proving state promise with the given reason
-    // Does nothing if not in a valid state
-    reject(reason) {
-        if (!this.verifyState()) {
-            return;
-        }
-        this.provingStateLifecycle = 3;
-        this.rejectionCallback(reason);
-    }
-    // Attempts to resolve the proving state promise with the given result
-    // Does nothing if not in a valid state
-    resolve(result) {
-        if (!this.verifyState()) {
-            return;
-        }
-        this.provingStateLifecycle = 2;
-        this.completionCallback(result);
-    }
-    #getChildProofsForRoot() {
-        const rootLocation = {
-            level: 0,
-            index: 0
-        };
-        // If there's only 1 block, its block root proof will be stored at the root.
-        return this.totalNumCheckpoints === 1 ? [
-            this.checkpointProofs.getNode(rootLocation)?.provingOutput,
-            this.checkpointPaddingProof?.provingOutput
-        ] : this.checkpointProofs.getChildren(rootLocation).map((c)=>c?.provingOutput);
-    }
-}

package/dest/orchestrator/orchestrator.d.ts

@@ -1,118 +0,0 @@
-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';
-import type { CheckpointProvingState } from './checkpoint-proving-state.js';
-import { EpochProvingState, type ProvingResult } from './epoch-proving-state.js';
-import { TopTreeProvingScheduler } from './top-tree-proving-scheduler.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.
- * 2. Tree insertions are performed as required to generate transaction specific proofs
- * 3. Those transaction specific proofs are generated in the necessary order accounting for dependencies
- * 4. Once a transaction is proven, it will be incorporated into a merge proof
- * 5. Merge proofs are produced at each level of the tree until the root proof is produced
- *
- * The proving implementation is determined by the provided prover. This could be for example a local prover or a remote prover pool.
- */
-/**
- * The orchestrator, managing the flow of recursive proving operations required to build the rollup proof tree.
- */
-export declare class ProvingOrchestrator extends TopTreeProvingScheduler implements EpochProver {
-    private dbProvider;
-    private readonly proverId;
-    private readonly cancelJobsOnStop;
-    protected provingState: EpochProvingState | undefined;
-    protected provingPromise: Promise<ProvingResult> | undefined;
-    private metrics;
-    private dbs;
-    constructor(dbProvider: ReadonlyWorldStateAccess & ForkMerkleTreeOperations, prover: ServerCircuitProver, proverId: EthAddress, cancelJobsOnStop: boolean | undefined, enqueueConcurrency: number, telemetryClient?: TelemetryClient, bindings?: LoggerBindings);
-    get tracer(): Tracer;
-    getProverId(): EthAddress;
-    getNumActiveForks(): number;
-    protected cancelInternal(): void;
-    protected wrapCircuitCall<T>(circuitName: string, fn: (signal: AbortSignal) => Promise<T>): (signal: AbortSignal) => Promise<T>;
-    protected onRootRollupComplete(state: EpochProvingState): 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 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(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 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.
-     */
-    startChonkVerifierCircuits(txs: Tx[]): Promise<void>;
-    /**
-     * Marks the block as completed.
-     * Computes the block header and updates the archive tree.
-     */
-    setBlockCompleted(blockNumber: BlockNumber, expectedHeader?: BlockHeader): Promise<BlockHeader>;
-    protected verifyBuiltBlockAgainstSyncedState(provingState: BlockProvingState): Promise<void>;
-    /**
-     * 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;
-    private getDbForBlock;
-    /**
-     * Returns the proof for the current epoch.
-     */
-    finalizeEpoch(): Promise<{
-        publicInputs: RootRollupPublicInputs;
-        proof: Proof;
-        batchedBlobInputs: BatchedBlob;
-    }>;
-    private updateL1ToL2MessageTree;
-    private prepareBaseRollupInputs;
-    private enqueueBaseRollup;
-    protected getOrEnqueueChonkVerifier(provingState: BlockProvingState, txIndex: number): void;
-    private doEnqueueChonkVerifier;
-    private enqueueMergeRollup;
-    private enqueueBlockRootRollup;
-    private enqueueBaseParityCircuit;
-    private checkAndEnqueueRootParityCircuit;
-    private enqueueRootParityCircuit;
-    private enqueueBlockMergeRollup;
-    private enqueueCheckpointRootRollup;
-    private checkAndEnqueueNextMergeRollup;
-    private checkAndEnqueueBlockRootRollup;
-    private checkAndEnqueueNextBlockMergeRollup;
-    protected checkAndEnqueueCheckpointRootRollup(provingState: CheckpointProvingState): Promise<void>;
-    /**
-     * Executes the VM circuit for a public function, will enqueue the corresponding kernel if the
-     * previous kernel is ready
-     * @param provingState - The proving state being operated on
-     * @param txIndex - The index of the transaction being proven
-     */
-    private enqueueVM;
-    protected checkAndEnqueueBaseRollup(provingState: BlockProvingState, txIndex: number): void;
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoib3JjaGVzdHJhdG9yLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvb3JjaGVzdHJhdG9yL29yY2hlc3RyYXRvci50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsV0FBVyxFQUFFLDJCQUEyQixFQUFjLE1BQU0sdUJBQXVCLENBQUM7QUFPN0YsT0FBTyxFQUFFLFdBQVcsRUFBRSxXQUFXLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUMzRSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFDcEQsT0FBTyxLQUFLLEVBQUUsY0FBYyxFQUFFLE1BQU0sdUJBQXVCLENBQUM7QUFNNUQsT0FBTyxFQUFFLFVBQVUsRUFBRSxNQUFNLHFCQUFxQixDQUFDO0FBQ2pELE9BQU8sS0FBSyxFQUNWLFdBQVcsRUFDWCx3QkFBd0IsRUFHeEIsd0JBQXdCLEVBQ3hCLG1CQUFtQixFQUNwQixNQUFNLGlDQUFpQyxDQUFDO0FBRXpDLE9BQU8sS0FBSyxFQUFFLEtBQUssRUFBRSxNQUFNLHNCQUFzQixDQUFDO0FBQ2xELE9BQU8sRUFNTCxzQkFBc0IsRUFLdEIsc0JBQXNCLEVBQ3ZCLE1BQU0sc0JBQXNCLENBQUM7QUFHOUIsT0FBTyxLQUFLLEVBQUUsV0FBVyxFQUFFLFdBQVcsRUFBRSxFQUFFLEVBQUUsTUFBTSxrQkFBa0IsQ0FBQztBQUNyRSxPQUFPLEtBQUssRUFBRSxNQUFNLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQUNsRCxPQUFPLEVBRUwsS0FBSyxlQUFlLEVBQ3BCLEtBQUssTUFBTSxFQUlaLE1BQU0seUJBQXlCLENBQUM7QUFlakMsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQUUsTUFBTSwwQkFBMEIsQ0FBQztBQUNsRSxPQUFPLEtBQUssRUFBRSxzQkFBc0IsRUFBRSxNQUFNLCtCQUErQixDQUFDO0FBQzVFLE9BQU8sRUFBRSxpQkFBaUIsRUFBRSxLQUFLLGFBQWEsRUFBc0IsTUFBTSwwQkFBMEIsQ0FBQztBQUVyRyxPQUFPLEVBQUUsdUJBQXVCLEVBQUUsTUFBTSxpQ0FBaUMsQ0FBQztBQUcxRTs7Ozs7Ozs7O0dBU0c7QUFFSDs7R0FFRztBQUNILHFCQUFhLG1CQUFvQixTQUFRLHVCQUF3QixZQUFXLFdBQVc7SUFTbkYsT0FBTyxDQUFDLFVBQVU7SUFFbEIsT0FBTyxDQUFDLFFBQVEsQ0FBQyxRQUFRO0lBQ3pCLE9BQU8sQ0FBQyxRQUFRLENBQUMsZ0JBQWdCO0lBWG5DLFNBQVMsQ0FBQyxZQUFZLEVBQUUsaUJBQWlCLEdBQUcsU0FBUyxDQUFhO0lBRWxFLFNBQVMsQ0FBQyxjQUFjLEVBQUUsT0FBTyxDQUFDLGFBQWEsQ0FBQyxHQUFHLFNBQVMsQ0FBYTtJQUN6RSxPQUFPLENBQUMsT0FBTyxDQUE2QjtJQUU1QyxPQUFPLENBQUMsR0FBRyxDQUEwRDtJQUVyRSxZQUNVLFVBQVUsRUFBRSx3QkFBd0IsR0FBRyx3QkFBd0IsRUFDdkUsTUFBTSxFQUFFLG1CQUFtQixFQUNWLFFBQVEsRUFBRSxVQUFVLEVBQ3BCLGdCQUFnQixxQkFBaUIsRUFDbEQsa0JBQWtCLEVBQUUsTUFBTSxFQUMxQixlQUFlLEdBQUUsZUFBc0MsRUFDdkQsUUFBUSxDQUFDLEVBQUUsY0FBYyxFQUkxQjtJQUVELElBQUksTUFBTSxJQUFJLE1BQU0sQ0FFbkI7SUFFTSxXQUFXLElBQUksVUFBVSxDQUUvQjtJQUVNLGlCQUFpQixXQUV2QjtJQUVELFVBQW1CLGNBQWMsSUFBSSxJQUFJLENBRXhDO0lBRUQsVUFBbUIsZUFBZSxDQUFDLENBQUMsRUFDbEMsV0FBVyxFQUFFLE1BQU0sRUFDbkIsRUFBRSxFQUFFLENBQUMsTUFBTSxFQUFFLFdBQVcsS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLEdBQ3RDLENBQUMsTUFBTSxFQUFFLFdBQVcsS0FBSyxPQUFPLENBQUMsQ0FBQyxDQUFDLENBT3JDO0lBRUQsVUFBbUIsb0JBQW9CLENBQUMsS0FBSyxFQUFFLGlCQUFpQixRQUUvRDtJQUVNLGFBQWEsQ0FDbEIsV0FBVyxFQUFFLFdBQVcsRUFDeEIsbUJBQW1CLEVBQUUsTUFBTSxFQUMzQiwyQkFBMkIsRUFBRSwyQkFBMkIsUUFvQnpEO0lBRUQ7Ozs7Ozs7T0FPRztJQUNVLGtCQUFrQixDQUM3QixlQUFlLEVBQUUsTUFBTSxFQUN2QixTQUFTLEVBQUUsc0JBQXNCLEVBQ2pDLGNBQWMsRUFBRSxFQUFFLEVBQUUsRUFDcEIsY0FBYyxFQUFFLE1BQU0sRUFDdEIscUNBQXFDLEVBQUUsV0FBVyxpQkF3Q25EO0lBRUQ7Ozs7OztPQU1HO0lBSVUsYUFBYSxDQUFDLFdBQVcsRUFBRSxXQUFXLEVBQUUsU0FBUyxFQUFFLE1BQU0sRUFBRSxXQUFXLEVBQUUsTUFBTSxpQkEyRDFGO0lBRUQ7OztPQUdHO0lBSVUsTUFBTSxDQUFDLEdBQUcsRUFBRSxXQUFXLEVBQUUsR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBd0ZyRDtJQUVEOzs7T0FHRztJQUVJLDBCQUEwQixDQUFDLEdBQUcsRUFBRSxFQUFFLEVBQUUsaUJBc0IxQztJQUVEOzs7T0FHRztJQUlVLGlCQUFpQixDQUFDLFdBQVcsRUFBRSxXQUFXLEVBQUUsY0FBYyxDQUFDLEVBQUUsV0FBVyxHQUFHLE9BQU8sQ0FBQyxXQUFXLENBQUMsQ0FrRDNHO0lBR0QsVUFBZ0Isa0NBQWtDLENBQUMsWUFBWSxFQUFFLGlCQUFpQixpQkE2Q2pGO0lBRUQ7Ozs7T0FJRztJQUNJLE1BQU0sU0FTWjtJQUVELE9BQU8sQ0FBQyxhQUFhO0lBUXJCOztPQUVHO0lBQ1UsYUFBYSxJQUFJLE9BQU8sQ0FBQztRQUNwQyxZQUFZLEVBQUUsc0JBQXNCLENBQUM7UUFDckMsS0FBSyxFQUFFLEtBQUssQ0FBQztRQUNiLGlCQUFpQixFQUFFLFdBQVcsQ0FBQztLQUNoQyxDQUFDLENBb0JEO1lBRWEsdUJBQXVCO1lBNEJ2Qix1QkFBdUI7SUFrQ3JDLE9BQU8sQ0FBQyxpQkFBaUI7SUFxRHpCLFNBQVMsQ0FBQyx5QkFBeUIsQ0FBQyxZQUFZLEVBQUUsaUJBQWlCLEVBQUUsT0FBTyxFQUFFLE1BQU0sUUE0Qm5GO0lBRUQsT0FBTyxDQUFDLHNCQUFzQjtJQWlDOUIsT0FBTyxDQUFDLGtCQUFrQjtJQStCMUIsT0FBTyxDQUFDLHNCQUFzQjtJQThEOUIsT0FBTyxDQUFDLHdCQUF3QjtJQWtDaEMsT0FBTyxDQUFDLGdDQUFnQztJQVV4QyxPQUFPLENBQUMsd0JBQXdCO0lBZ0NoQyxPQUFPLENBQUMsdUJBQXVCO1lBa0NqQiwyQkFBMkI7SUErRHpDLE9BQU8sQ0FBQyw4QkFBOEI7SUFhdEMsT0FBTyxDQUFDLDhCQUE4QjtZQVN4QixtQ0FBbUM7SUFnQmpELFVBQWdCLG1DQUFtQyxDQUFDLFlBQVksRUFBRSxzQkFBc0IsaUJBTXZGO0lBRUQ7Ozs7O09BS0c7SUFDSCxPQUFPLENBQUMsU0FBUztJQTJCakIsU0FBUyxDQUFDLHlCQUF5QixDQUFDLFlBQVksRUFBRSxpQkFBaUIsRUFBRSxPQUFPLEVBQUUsTUFBTSxRQVVuRjtDQUNGIn0=

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

@@ -1 +0,0 @@
-{"version":3,"file":"orchestrator.d.ts","sourceRoot":"","sources":["../../src/orchestrator/orchestrator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,2BAA2B,EAAc,MAAM,uBAAuB,CAAC;AAO7F,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAC3E,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAM5D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,KAAK,EACV,WAAW,EACX,wBAAwB,EAGxB,wBAAwB,EACxB,mBAAmB,EACpB,MAAM,iCAAiC,CAAC;AAEzC,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;AAClE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,KAAK,aAAa,EAAsB,MAAM,0BAA0B,CAAC;AAErG,OAAO,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAG1E;;;;;;;;;GASG;AAEH;;GAEG;AACH,qBAAa,mBAAoB,SAAQ,uBAAwB,YAAW,WAAW;IASnF,OAAO,CAAC,UAAU;IAElB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAXnC,SAAS,CAAC,YAAY,EAAE,iBAAiB,GAAG,SAAS,CAAa;IAElE,SAAS,CAAC,cAAc,EAAE,OAAO,CAAC,aAAa,CAAC,GAAG,SAAS,CAAa;IACzE,OAAO,CAAC,OAAO,CAA6B;IAE5C,OAAO,CAAC,GAAG,CAA0D;IAErE,YACU,UAAU,EAAE,wBAAwB,GAAG,wBAAwB,EACvE,MAAM,EAAE,mBAAmB,EACV,QAAQ,EAAE,UAAU,EACpB,gBAAgB,qBAAiB,EAClD,kBAAkB,EAAE,MAAM,EAC1B,eAAe,GAAE,eAAsC,EACvD,QAAQ,CAAC,EAAE,cAAc,EAI1B;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAEM,WAAW,IAAI,UAAU,CAE/B;IAEM,iBAAiB,WAEvB;IAED,UAAmB,cAAc,IAAI,IAAI,CAExC;IAED,UAAmB,eAAe,CAAC,CAAC,EAClC,WAAW,EAAE,MAAM,EACnB,EAAE,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,GACtC,CAAC,MAAM,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,CAAC,CAOrC;IAED,UAAmB,oBAAoB,CAAC,KAAK,EAAE,iBAAiB,QAE/D;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,CAkD3G;IAGD,UAAgB,kCAAkC,CAAC,YAAY,EAAE,iBAAiB,iBA6CjF;IAED;;;;OAIG;IACI,MAAM,SASZ;IAED,OAAO,CAAC,aAAa;IAQrB;;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,uBAAuB;YA4BvB,uBAAuB;IAkCrC,OAAO,CAAC,iBAAiB;IAqDzB,SAAS,CAAC,yBAAyB,CAAC,YAAY,EAAE,iBAAiB,EAAE,OAAO,EAAE,MAAM,QA4BnF;IAED,OAAO,CAAC,sBAAsB;IAiC9B,OAAO,CAAC,kBAAkB;IA+B1B,OAAO,CAAC,sBAAsB;IA8D9B,OAAO,CAAC,wBAAwB;IAkChC,OAAO,CAAC,gCAAgC;IAUxC,OAAO,CAAC,wBAAwB;IAgChC,OAAO,CAAC,uBAAuB;YAkCjB,2BAA2B;IA+DzC,OAAO,CAAC,8BAA8B;IAatC,OAAO,CAAC,8BAA8B;YASxB,mCAAmC;IAgBjD,UAAgB,mCAAmC,CAAC,YAAY,EAAE,sBAAsB,iBAMvF;IAED;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IA2BjB,SAAS,CAAC,yBAAyB,CAAC,YAAY,EAAE,iBAAiB,EAAE,OAAO,EAAE,MAAM,QAUnF;CACF"}