@aztec/simulator 0.0.0-test.1 → 0.0.1-commit.5daedc8

package/dest/public/state_manager/state_manager.js

@@ -0,0 +1,392 @@
+import { CANONICAL_AUTH_REGISTRY_ADDRESS, CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS, CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS, FEE_JUICE_ADDRESS, MULTI_CALL_ENTRYPOINT_ADDRESS, ROUTER_ADDRESS } from '@aztec/constants';
+import { poseidon2Hash } from '@aztec/foundation/crypto';
+import { jsonStringify } from '@aztec/foundation/json-rpc';
+import { createLogger } from '@aztec/foundation/log';
+import { ProtocolContractAddress } from '@aztec/protocol-contracts';
+import { AztecAddress } from '@aztec/stdlib/aztec-address';
+import { SerializableContractInstance } from '@aztec/stdlib/contract';
+import { DelayedPublicMutableValues, DelayedPublicMutableValuesWithHash } from '@aztec/stdlib/delayed-public-mutable';
+import { computeNoteHashNonce, computeUniqueNoteHash, siloNoteHash, siloNullifier } from '@aztec/stdlib/hash';
+import { strict as assert } from 'assert';
+import { getPublicFunctionDebugName } from '../debug_fn_name.js';
+import { L1ToL2MessageIndexOutOfRangeError, MaxCallsToUniqueContractClassIdsError, NoteHashIndexOutOfRangeError, NullifierCollisionError } from '../side_effect_errors.js';
+import { NullifierManager } from './nullifiers.js';
+import { PublicStorage } from './public_storage.js';
+/**
+ * A class to manage persistable AVM state for contract calls.
+ * Maintains a cache of the current world state,
+ * a trace of all side effects.
+ *
+ * The simulator should make any world state / tree queries through this object.
+ *
+ * Manages merging of successful/reverted child state into current state.
+ */ export class PublicPersistableStateManager {
+    treesDB;
+    contractsDB;
+    trace;
+    firstNullifier;
+    timestamp;
+    doMerkleOperations;
+    publicStorage;
+    nullifiers;
+    log;
+    /** Make sure a forked state is never merged twice. */ alreadyMergedIntoParent;
+    constructor(treesDB, contractsDB, trace, firstNullifier, timestamp, doMerkleOperations = true, publicStorage = new PublicStorage(treesDB), nullifiers = new NullifierManager(treesDB)){
+        this.treesDB = treesDB;
+        this.contractsDB = contractsDB;
+        this.trace = trace;
+        this.firstNullifier = firstNullifier;
+        this.timestamp = timestamp;
+        this.doMerkleOperations = doMerkleOperations;
+        this.publicStorage = publicStorage;
+        this.nullifiers = nullifiers;
+        this.log = createLogger('simulator:state_manager');
+        this.alreadyMergedIntoParent = false;
+    }
+    /**
+   * Create a new state manager
+   */ static create(treesDB, contractsDB, trace, firstNullifier, timestamp) {
+        return new PublicPersistableStateManager(treesDB, contractsDB, trace, firstNullifier, timestamp);
+    }
+    /**
+   * Create a new state manager forked from this one
+   */ async fork() {
+        await this.treesDB.createCheckpoint();
+        return new PublicPersistableStateManager(this.treesDB, this.contractsDB, this.trace.fork(), this.firstNullifier, this.timestamp, this.doMerkleOperations, this.publicStorage.fork(), this.nullifiers.fork());
+    }
+    /**
+   * Accept forked world state modifications & traced side effects / hints
+   */ async merge(forkedState) {
+        await this._merge(forkedState, /*reverted=*/ false);
+    }
+    /**
+   * Reject forked world state modifications & traced side effects, keep traced hints
+   */ async reject(forkedState) {
+        await this._merge(forkedState, /*reverted=*/ true);
+    }
+    async _merge(forkedState, reverted) {
+        // sanity check to avoid merging the same forked trace twice
+        assert(!forkedState.alreadyMergedIntoParent, 'Cannot merge forked state that has already been merged into its parent!');
+        forkedState.alreadyMergedIntoParent = true;
+        this.publicStorage.acceptAndMerge(forkedState.publicStorage);
+        this.nullifiers.acceptAndMerge(forkedState.nullifiers);
+        this.trace.merge(forkedState.trace, reverted);
+        if (reverted) {
+            this.log.trace('Reverting forked state...');
+            await this.treesDB.revertCheckpoint();
+        } else {
+            this.log.trace('Merging forked state into parent...');
+            await this.treesDB.commitCheckpoint();
+        }
+    }
+    /**
+   * Write to public storage, journal/trace the write.
+   *
+   * @param contractAddress - the address of the contract whose storage is being written to
+   * @param slot - the slot in the contract's storage being written to
+   * @param value - the value being written to the slot
+   */ async writeStorage(contractAddress, slot, value, protocolWrite = false) {
+        this.log.trace(`Storage write (address=${contractAddress}, slot=${slot}): value=${value}`);
+        await this.trace.tracePublicStorageWrite(contractAddress, slot, value, protocolWrite);
+        if (this.doMerkleOperations) {
+            // write to native merkle trees
+            await this.treesDB.storageWrite(contractAddress, slot, value);
+        } else {
+            // Cache storage writes for later reference/reads
+            this.publicStorage.write(contractAddress, slot, value);
+        }
+    }
+    isStorageCold(contractAddress, slot) {
+        return this.trace.isStorageCold(contractAddress, slot);
+    }
+    /**
+   * Read from public storage.
+   *
+   * @param contractAddress - the address of the contract whose storage is being read from
+   * @param slot - the slot in the contract's storage being read from
+   * @returns the latest value written to slot, or 0 if never written to before
+   */ async readStorage(contractAddress, slot) {
+        if (this.doMerkleOperations) {
+            return await this.treesDB.storageRead(contractAddress, slot);
+        } else {
+            const read = await this.publicStorage.read(contractAddress, slot);
+            this.log.trace(`Storage read results (address=${contractAddress}, slot=${slot}): value=${read.value}, cached=${read.cached}`);
+            return read.value;
+        }
+    }
+    // TODO(4886): We currently don't silo note hashes.
+    /**
+   * Check if a note hash exists at the given leaf index, trace the check.
+   *
+   * @param contractAddress - the address of the contract whose storage is being read from
+   * @param noteHash - the unsiloed note hash being checked
+   * @param leafIndex - the leaf index being checked
+   * @returns true if the note hash exists at the given leaf index, false otherwise
+   */ async checkNoteHashExists(contractAddress, noteHash, leafIndex) {
+        try {
+            const gotLeafValue = await this.treesDB.getNoteHash(leafIndex);
+            const exists = gotLeafValue.equals(noteHash);
+            this.log.trace(`noteHashes(${contractAddress})@${noteHash} ?? leafIndex: ${leafIndex} | gotLeafValue: ${gotLeafValue}, exists: ${exists}.`);
+            return Promise.resolve(exists);
+        } catch (error) {
+            // If the index is out of range, note_hash_leaf_in_range = 0 and the circuit returns false:
+            if (error instanceof NoteHashIndexOutOfRangeError) {
+                return Promise.resolve(false);
+            }
+            // Otherwise, unknown error. This is a bug.
+            throw error;
+        }
+    }
+    /**
+   * Write a raw note hash, silo it and make it unique, then trace the write.
+   * @param noteHash - the unsiloed note hash to write
+   */ async writeNoteHash(contractAddress, noteHash) {
+        this.log.trace(`noteHashes(${contractAddress}) += ${noteHash}.`);
+        const siloedNoteHash = await siloNoteHash(contractAddress, noteHash);
+        await this.writeSiloedNoteHash(siloedNoteHash);
+    }
+    /**
+   * Write a note hash, make it unique, trace the write.
+   * @param siloedNoteHash - the non unique note hash to write
+   */ async writeSiloedNoteHash(siloedNoteHash) {
+        const noteNonce = await computeNoteHashNonce(this.firstNullifier, this.trace.getNoteHashCount());
+        const uniqueNoteHash = await computeUniqueNoteHash(noteNonce, siloedNoteHash);
+        await this.writeUniqueNoteHash(uniqueNoteHash);
+    }
+    /**
+   * Write a note hash, trace the write.
+   * @param uniqueNoteHash - the siloed unique hash to write
+   */ async writeUniqueNoteHash(uniqueNoteHash) {
+        this.log.trace(`noteHashes += @${uniqueNoteHash}.`);
+        this.trace.traceNewNoteHash(uniqueNoteHash);
+        if (this.doMerkleOperations) {
+            await this.treesDB.writeNoteHash(uniqueNoteHash);
+        }
+    }
+    /**
+   * Check if a nullifier exists, trace the check.
+   * @param contractAddress - address of the contract that the nullifier is associated with
+   * @param nullifier - the unsiloed nullifier to check
+   * @returns exists - whether the nullifier exists in the nullifier set
+   */ async checkNullifierExists(contractAddress, nullifier) {
+        this.log.trace(`Checking existence of nullifier (address=${contractAddress}, nullifier=${nullifier})`);
+        const siloedNullifier = await siloNullifier(contractAddress, nullifier);
+        if (this.doMerkleOperations) {
+            const exists = await this.treesDB.checkNullifierExists(siloedNullifier);
+            this.log.trace(`Checked siloed nullifier ${siloedNullifier} (exists=${exists})`);
+            return Promise.resolve(exists);
+        } else {
+            const { exists, cacheHit } = await this.nullifiers.checkExists(siloedNullifier);
+            this.log.trace(`Checked siloed nullifier ${siloedNullifier} (exists=${exists}), cacheHit=${cacheHit}`);
+            return Promise.resolve(exists);
+        }
+    }
+    /**
+   * Write a nullifier to the nullifier set, trace the write.
+   * @param contractAddress - address of the contract that the nullifier is associated with
+   * @param nullifier - the unsiloed nullifier to write
+   */ async writeNullifier(contractAddress, nullifier) {
+        this.log.trace(`Inserting new nullifier (address=${nullifier}, nullifier=${contractAddress})`);
+        const siloedNullifier = await siloNullifier(contractAddress, nullifier);
+        await this.writeSiloedNullifier(siloedNullifier);
+    }
+    /**
+   * Write a nullifier to the nullifier set, trace the write.
+   * @param siloedNullifier - the siloed nullifier to write
+   */ async writeSiloedNullifier(siloedNullifier) {
+        this.log.trace(`Inserting siloed nullifier=${siloedNullifier}`);
+        this.trace.traceNewNullifier(siloedNullifier);
+        if (this.doMerkleOperations) {
+            const exists = await this.treesDB.checkNullifierExists(siloedNullifier);
+            if (exists) {
+                this.log.verbose(`Siloed nullifier ${siloedNullifier} already present in tree!`);
+                throw new NullifierCollisionError(`Siloed nullifier ${siloedNullifier} already exists in parent cache or host.`);
+            } else {
+                await this.treesDB.writeNullifier(siloedNullifier);
+            }
+        } else {
+            // Cache pending nullifiers for later access
+            await this.nullifiers.append(siloedNullifier);
+        }
+    }
+    /**
+   * Check if an L1 to L2 message exists, trace the check.
+   * @param msgHash - the message hash to check existence of
+   * @param msgLeafIndex - the message leaf index to use in the check
+   * @returns exists - whether the message exists in the L1 to L2 Messages tree
+   */ async checkL1ToL2MessageExists(msgHash, msgLeafIndex) {
+        try {
+            const valueAtIndex = await this.treesDB.getL1ToL2LeafValue(msgLeafIndex.toBigInt());
+            const exists = valueAtIndex.equals(msgHash);
+            this.log.trace(`l1ToL2Messages(@${msgLeafIndex}) ?? exists: ${exists}, expected: ${msgHash}, found: ${valueAtIndex}.`);
+            return Promise.resolve(exists);
+        } catch (error) {
+            // If the index is out of range, l1_to_l2_msg_leaf_in_range = 0 and the circuit returns false:
+            if (error instanceof L1ToL2MessageIndexOutOfRangeError) {
+                return Promise.resolve(false);
+            }
+            // Otherwise, unknown error. This is a bug.
+            throw error;
+        }
+    }
+    /**
+   * Write an L2 to L1 message.
+   * @param contractAddress - L2 contract address that created this message
+   * @param recipient - L1 contract address to send the message to.
+   * @param content - Message content.
+   */ writeL2ToL1Message(contractAddress, recipient, content) {
+        this.log.trace(`L2ToL1Messages(${contractAddress}) += (recipient: ${recipient}, content: ${content}).`);
+        this.trace.traceNewL2ToL1Message(contractAddress, recipient, content);
+    }
+    /**
+   * Write a scoped L2 to L1 message.
+   * @param l2ToL1Message - The L2 to L1 message to write.
+   */ writeScopedL2ToL1Message(l2ToL1Message) {
+        this.writeL2ToL1Message(l2ToL1Message.contractAddress, l2ToL1Message.message.recipient.toField(), l2ToL1Message.message.content);
+    }
+    writeDebugLog(contractAddress, level, message, fields) {
+        this.trace.traceDebugLog(contractAddress, level, message, fields);
+    }
+    writeDebugLogMemoryReads(memoryReads) {
+        this.trace.traceDebugLogMemoryReads(memoryReads);
+    }
+    getDebugLogMemoryReads() {
+        return this.trace.getDebugLogMemoryReads();
+    }
+    getLogs() {
+        return this.trace.getDebugLogs();
+    }
+    /**
+   * Write a public log
+   * @param contractAddress - address of the contract that emitted the log
+   * @param log - log contents
+   */ writePublicLog(contractAddress, log) {
+        this.log.trace(`PublicLog(${contractAddress}) += event with ${log.length} fields.`);
+        this.trace.tracePublicLog(contractAddress, log);
+    }
+    /**
+   * Get a contract instance.
+   * @param contractAddress - address of the contract instance to retrieve.
+   * @returns the contract instance or undefined if it does not exist.
+   */ async getContractInstance(contractAddress) {
+        this.log.trace(`Getting contract instance for address ${contractAddress}`);
+        const instanceWithAddress = await this.contractsDB.getContractInstance(contractAddress, this.timestamp);
+        const exists = instanceWithAddress !== undefined;
+        const instance = exists ? new SerializableContractInstance(instanceWithAddress) : undefined;
+        if (contractAddressIsCanonical(contractAddress)) {
+            this.log.trace(`Got canonical contract instance (address=${contractAddress}): instance=${jsonStringify(instance)}`);
+            return instance;
+        }
+        // Nullifier check! We do this regardless of whether or not the instance exists,
+        // as even for non-existence, we need to generate nullifier check hints.
+        // This will internally decide whether to check the nullifier tree or not depending on doMerkleOperations.
+        const nullifierExistsInTree = await this.checkNullifierExists(AztecAddress.fromNumber(CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS), contractAddress.toField());
+        assert(exists == nullifierExistsInTree, `Contract instance for address ${contractAddress} in DB: ${exists} != nullifier tree: ${nullifierExistsInTree}. This is a bug!`);
+        if (!exists) {
+            this.log.debug(`Contract instance NOT FOUND (address=${contractAddress})`);
+            return undefined;
+        }
+        this.log.trace(`Got contract instance (address=${contractAddress}): instance=${jsonStringify(instance)}`);
+        // All that is left is to check that the contract updatability information is correct.
+        // That is, that the current and original contract class ids are correct.
+        await this.checkContractUpdateInformation(instanceWithAddress);
+        return instance;
+    }
+    async checkContractUpdateInformation(instance) {
+        // If "merkle operations" are not requested, we trust the DB.
+        // Otherwise we check that the contract updatability information is correct.
+        // That is, that the current and original contract class ids are correct.
+        // All failures are fatal and the simulation is not expected to be provable.
+        if (this.doMerkleOperations) {
+            // Conceptually, we want to do the following:
+            // * Read a DelayedPublicMutable at the contract update slot.
+            // * Obtain the expected current class id from the DelayedPublicMutable, at the current block.
+            // * if expectedId == 0 then currentClassId should be original contract class id
+            // * if expectedId != 0 then currentClassId should be expectedId
+            //
+            // However, we will also be checking the hash of the delayed public mutable values.
+            // This is a bit of a leak of information, since the circuit will use it to prove
+            // one public read instead of N of the delayed public mutable values.
+            const { delayedPublicMutableSlot, delayedPublicMutableHashSlot } = await DelayedPublicMutableValuesWithHash.getContractUpdateSlots(instance.address);
+            const readDeployerStorage = async (storageSlot)=>await this.readStorage(ProtocolContractAddress.ContractInstanceRegistry, storageSlot);
+            const hash = await readDeployerStorage(delayedPublicMutableHashSlot);
+            // NOTE: The below reads are either not performed (if hash.isZero()) or only performed in unconstrained in c++ simulation.
+            // See UpdateCheck::check_current_class_id documentation - this means if we generate hints from the merkle db, they are unused:
+            const delayedPublicMutableValues = await DelayedPublicMutableValues.readFromTree(delayedPublicMutableSlot, readDeployerStorage);
+            const preImage = delayedPublicMutableValues.toFields();
+            // 1) update never scheduled: hash == 0 and preimage should be empty (but poseidon2hash(preimage) will not be 0s)
+            if (hash.isZero()) {
+                assert(preImage.every((f)=>f.isZero()), `Found updatability hash 0 but preimage is not empty for contract instance ${instance.address}.`);
+                assert(instance.currentContractClassId.equals(instance.originalContractClassId), `Found updatability hash 0 for contract instance ${instance.address} but original class id ${instance.originalContractClassId} != current class id ${instance.currentContractClassId}.`);
+                return;
+            }
+            // 2) At this point we know that the hash is not zero and this means that an update has at some point been scheduled.
+            const computedHash = await poseidon2Hash(preImage);
+            assert(hash.equals(computedHash), `Delayed public mutable values hash mismatch for contract instance ${instance.address}. Expected: ${hash}, computed: ${computedHash}`);
+            // We now check that, depending on the current block, the current class id is correct.
+            const expectedClassIdRaw = delayedPublicMutableValues.svc.getCurrentAt(this.timestamp).at(0);
+            const expectedClassId = expectedClassIdRaw.isZero() ? instance.originalContractClassId : expectedClassIdRaw;
+            assert(instance.currentContractClassId.equals(expectedClassId), `Current class id mismatch
+        for contract instance ${instance.address}. Expected: ${expectedClassId}, current: ${instance.currentContractClassId}`);
+        }
+    }
+    /**
+   * Get a contract class.
+   * @param classId - class id to retrieve.
+   * @returns the contract class or undefined if it does not exist.
+   */ async getContractClass(classId) {
+        this.log.trace(`Getting contract class for id ${classId}`);
+        const contractClass = await this.contractsDB.getContractClass(classId);
+        const exists = contractClass !== undefined;
+        let extendedClass = undefined;
+        // Note: We currently do not generate info to check the nullifier tree, because
+        // this is not needed for our use cases.
+        if (exists) {
+            this.log.trace(`Got contract class (id=${classId})`);
+            // Extend class information with public bytecode commitment.
+            const bytecodeCommitment = await this.contractsDB.getBytecodeCommitment(classId);
+            assert(bytecodeCommitment, `Bytecode commitment was not found in DB for contract class (${classId}). This should not happen!`);
+            extendedClass = {
+                ...contractClass,
+                publicBytecodeCommitment: bytecodeCommitment
+            };
+        } else {
+            this.log.debug(`Contract class NOT FOUND (id=${classId})`);
+        }
+        // TODO(dbanks12): does this need to be moved to before the DB accesses as was done with writeNullifier?
+        this.trace.traceGetContractClass(classId, exists);
+        return extendedClass;
+    }
+    /**
+   * Get a contract's bytecode from the contracts DB, also trace the contract class and instance indirectly.
+   */ async getBytecode(contractAddress) {
+        this.log.debug(`Getting bytecode for contract address ${contractAddress}`);
+        const contractInstance = await this.getContractInstance(contractAddress);
+        if (!contractInstance) {
+            return undefined;
+        }
+        try {
+            const contractClass = await this.getContractClass(contractInstance.currentContractClassId);
+            assert(contractClass, `Contract class not found in DB, but a contract instance was found with this class ID (${contractInstance.currentContractClassId}). This should not happen!`);
+            return contractClass.packedBytecode;
+        } catch (error) {
+            if (error instanceof MaxCallsToUniqueContractClassIdsError) {
+                return undefined;
+            }
+            // Otherwise, unknown error. This is a bug.
+            throw error;
+        }
+    }
+    async getPublicFunctionDebugName(avmEnvironment) {
+        return await getPublicFunctionDebugName(this.contractsDB, avmEnvironment.address, avmEnvironment.calldata);
+    }
+    async padTree(treeId, leavesToInsert) {
+        await this.treesDB.padTree(treeId, leavesToInsert);
+    }
+    async getTreeSnapshots() {
+        return await this.treesDB.getTreeSnapshots();
+    }
+}
+function contractAddressIsCanonical(contractAddress) {
+    return contractAddress.equals(AztecAddress.fromNumber(CANONICAL_AUTH_REGISTRY_ADDRESS)) || contractAddress.equals(AztecAddress.fromNumber(CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS)) || contractAddress.equals(AztecAddress.fromNumber(CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS)) || contractAddress.equals(AztecAddress.fromNumber(MULTI_CALL_ENTRYPOINT_ADDRESS)) || contractAddress.equals(AztecAddress.fromNumber(FEE_JUICE_ADDRESS)) || contractAddress.equals(AztecAddress.fromNumber(ROUTER_ADDRESS));
+}

package/dest/public/test_executor_metrics.d.ts

@@ -0,0 +1,55 @@
+import type { RevertCode } from '@aztec/stdlib/avm';
+import type { GasUsed } from '@aztec/stdlib/gas';
+import type { ExecutorMetricsInterface } from './executor_metrics_interface.js';
+export interface PublicEnqueuedCallMetrics {
+    fnName: string;
+    durationMs: number;
+    manaUsed: number;
+    totalInstructionsExecuted: number;
+    reverted: boolean;
+}
+export interface PublicTxMetrics {
+    totalDurationMs: number;
+    manaUsed: number | undefined;
+    totalInstructionsExecuted: number;
+    nonRevertiblePrivateInsertionsUs: number | undefined;
+    revertiblePrivateInsertionsUs: number | undefined;
+    enqueuedCalls: PublicEnqueuedCallMetrics[];
+    revertedCode: RevertCode | undefined;
+    proverSimulationStepMs: number | undefined;
+    proverProvingStepMs: number | undefined;
+    proverTraceGenerationStepMs: number | undefined;
+    traceGenerationInteractionsMs: number | undefined;
+    traceGenerationTracesMs: number | undefined;
+    provingSumcheckMs: number | undefined;
+    provingPcsMs: number | undefined;
+    provingLogDerivativeInverseMs: number | undefined;
+    provingLogDerivativeInverseCommitmentsMs: number | undefined;
+    provingWireCommitmentsMs: number | undefined;
+}
+export declare enum PublicTxMetricsFilter {
+    ALL = 0,
+    TOTALS = 1,
+    DURATIONS = 2,
+    INSTRUCTIONS = 3,
+    PROVING = 4
+}
+export declare class TestExecutorMetrics implements ExecutorMetricsInterface {
+    #private;
+    private logger;
+    private txMetrics;
+    private currentTxLabel;
+    private txTimer;
+    constructor();
+    startRecordingTxSimulation(txLabel: string): void;
+    stopRecordingTxSimulation(txLabel: string, gasUsed?: GasUsed, revertedCode?: RevertCode): void;
+    recordEnqueuedCallSimulation(fnName: string, durationMs: number, manaUsed: number, totalInstructionsExecuted: number): void;
+    recordEnqueuedCallSimulationFailure(fnName: string, durationMs: number, manaUsed: number, totalInstructionsExecuted: number): void;
+    recordPrivateEffectsInsertion(durationUs: number, type: 'revertible' | 'non-revertible'): void;
+    recordProverMetrics(txLabel: string, metrics: Partial<PublicTxMetrics>): void;
+    prettyPrint(filter?: PublicTxMetricsFilter): void;
+    toPrettyString(filter?: PublicTxMetricsFilter): string;
+    toJSON(indent?: number): string;
+    toGithubActionBenchmarkJSON(indent?: number): string;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidGVzdF9leGVjdXRvcl9tZXRyaWNzLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvcHVibGljL3Rlc3RfZXhlY3V0b3JfbWV0cmljcy50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFHQSxPQUFPLEtBQUssRUFBRSxVQUFVLEVBQUUsTUFBTSxtQkFBbUIsQ0FBQztBQUNwRCxPQUFPLEtBQUssRUFBRSxPQUFPLEVBQUUsTUFBTSxtQkFBbUIsQ0FBQztBQUlqRCxPQUFPLEtBQUssRUFBRSx3QkFBd0IsRUFBRSxNQUFNLGlDQUFpQyxDQUFDO0FBRWhGLE1BQU0sV0FBVyx5QkFBeUI7SUFDeEMsTUFBTSxFQUFFLE1BQU0sQ0FBQztJQUNmLFVBQVUsRUFBRSxNQUFNLENBQUM7SUFDbkIsUUFBUSxFQUFFLE1BQU0sQ0FBQztJQUNqQix5QkFBeUIsRUFBRSxNQUFNLENBQUM7SUFDbEMsUUFBUSxFQUFFLE9BQU8sQ0FBQztDQUNuQjtBQUVELE1BQU0sV0FBVyxlQUFlO0lBRTlCLGVBQWUsRUFBRSxNQUFNLENBQUM7SUFDeEIsUUFBUSxFQUFFLE1BQU0sR0FBRyxTQUFTLENBQUM7SUFDN0IseUJBQXlCLEVBQUUsTUFBTSxDQUFDO0lBQ2xDLGdDQUFnQyxFQUFFLE1BQU0sR0FBRyxTQUFTLENBQUM7SUFDckQsNkJBQTZCLEVBQUUsTUFBTSxHQUFHLFNBQVMsQ0FBQztJQUNsRCxhQUFhLEVBQUUseUJBQXlCLEVBQUUsQ0FBQztJQUMzQyxZQUFZLEVBQUUsVUFBVSxHQUFHLFNBQVMsQ0FBQztJQUVyQyxzQkFBc0IsRUFBRSxNQUFNLEdBQUcsU0FBUyxDQUFDO0lBQzNDLG1CQUFtQixFQUFFLE1BQU0sR0FBRyxTQUFTLENBQUM7SUFDeEMsMkJBQTJCLEVBQUUsTUFBTSxHQUFHLFNBQVMsQ0FBQztJQUVoRCw2QkFBNkIsRUFBRSxNQUFNLEdBQUcsU0FBUyxDQUFDO0lBQ2xELHVCQUF1QixFQUFFLE1BQU0sR0FBRyxTQUFTLENBQUM7SUFDNUMsaUJBQWlCLEVBQUUsTUFBTSxHQUFHLFNBQVMsQ0FBQztJQUN0QyxZQUFZLEVBQUUsTUFBTSxHQUFHLFNBQVMsQ0FBQztJQUNqQyw2QkFBNkIsRUFBRSxNQUFNLEdBQUcsU0FBUyxDQUFDO0lBQ2xELHdDQUF3QyxFQUFFLE1BQU0sR0FBRyxTQUFTLENBQUM7SUFDN0Qsd0JBQXdCLEVBQUUsTUFBTSxHQUFHLFNBQVMsQ0FBQztDQUM5QztBQVdELG9CQUFZLHFCQUFxQjtJQUMvQixHQUFHLElBQUE7SUFDSCxNQUFNLElBQUE7SUFDTixTQUFTLElBQUE7SUFDVCxZQUFZLElBQUE7SUFDWixPQUFPLElBQUE7Q0FDUjtBQTJCRCxxQkFBYSxtQkFBb0IsWUFBVyx3QkFBd0I7O0lBQ2xFLE9BQU8sQ0FBQyxNQUFNLENBQVM7SUFFdkIsT0FBTyxDQUFDLFNBQVMsQ0FBMkM7SUFDNUQsT0FBTyxDQUFDLGNBQWMsQ0FBcUI7SUFDM0MsT0FBTyxDQUFDLE9BQU8sQ0FBb0I7SUFFbkMsY0FFQztJQUVELDBCQUEwQixDQUFDLE9BQU8sRUFBRSxNQUFNLFFBTXpDO0lBRUQseUJBQXlCLENBQUMsT0FBTyxFQUFFLE1BQU0sRUFBRSxPQUFPLENBQUMsRUFBRSxPQUFPLEVBQUUsWUFBWSxDQUFDLEVBQUUsVUFBVSxRQWdCdEY7SUFFRCw0QkFBNEIsQ0FDMUIsTUFBTSxFQUFFLE1BQU0sRUFDZCxVQUFVLEVBQUUsTUFBTSxFQUNsQixRQUFRLEVBQUUsTUFBTSxFQUNoQix5QkFBeUIsRUFBRSxNQUFNLFFBR2xDO0lBRUQsbUNBQW1DLENBQ2pDLE1BQU0sRUFBRSxNQUFNLEVBQ2QsVUFBVSxFQUFFLE1BQU0sRUFDbEIsUUFBUSxFQUFFLE1BQU0sRUFDaEIseUJBQXlCLEVBQUUsTUFBTSxRQUdsQztJQW9CRCw2QkFBNkIsQ0FBQyxVQUFVLEVBQUUsTUFBTSxFQUFFLElBQUksRUFBRSxZQUFZLEdBQUcsZ0JBQWdCLFFBZ0J0RjtJQUVELG1CQUFtQixDQUFDLE9BQU8sRUFBRSxNQUFNLEVBQUUsT0FBTyxFQUFFLE9BQU8sQ0FBQyxlQUFlLENBQUMsUUFVckU7SUFFRCxXQUFXLENBQUMsTUFBTSxHQUFFLHFCQUFpRCxRQUVwRTtJQUVELGNBQWMsQ0FBQyxNQUFNLEdBQUUscUJBQWlELFVBK0V2RTtJQTBCRCxNQUFNLENBQUMsTUFBTSxTQUFJLFVBRWhCO0lBRUQsMkJBQTJCLENBQUMsTUFBTSxTQUFJLFVBNEZyQztDQUNGIn0=

package/dest/public/test_executor_metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"test_executor_metrics.d.ts","sourceRoot":"","sources":["../../src/public/test_executor_metrics.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAIjD,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,iCAAiC,CAAC;AAEhF,MAAM,WAAW,yBAAyB;IACxC,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,yBAAyB,EAAE,MAAM,CAAC;IAClC,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAE9B,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,yBAAyB,EAAE,MAAM,CAAC;IAClC,gCAAgC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrD,6BAA6B,EAAE,MAAM,GAAG,SAAS,CAAC;IAClD,aAAa,EAAE,yBAAyB,EAAE,CAAC;IAC3C,YAAY,EAAE,UAAU,GAAG,SAAS,CAAC;IAErC,sBAAsB,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3C,mBAAmB,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC,2BAA2B,EAAE,MAAM,GAAG,SAAS,CAAC;IAEhD,6BAA6B,EAAE,MAAM,GAAG,SAAS,CAAC;IAClD,uBAAuB,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,iBAAiB,EAAE,MAAM,GAAG,SAAS,CAAC;IACtC,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;IACjC,6BAA6B,EAAE,MAAM,GAAG,SAAS,CAAC;IAClD,wCAAwC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7D,wBAAwB,EAAE,MAAM,GAAG,SAAS,CAAC;CAC9C;AAWD,oBAAY,qBAAqB;IAC/B,GAAG,IAAA;IACH,MAAM,IAAA;IACN,SAAS,IAAA;IACT,YAAY,IAAA;IACZ,OAAO,IAAA;CACR;AA2BD,qBAAa,mBAAoB,YAAW,wBAAwB;;IAClE,OAAO,CAAC,MAAM,CAAS;IAEvB,OAAO,CAAC,SAAS,CAA2C;IAC5D,OAAO,CAAC,cAAc,CAAqB;IAC3C,OAAO,CAAC,OAAO,CAAoB;IAEnC,cAEC;IAED,0BAA0B,CAAC,OAAO,EAAE,MAAM,QAMzC;IAED,yBAAyB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,UAAU,QAgBtF;IAED,4BAA4B,CAC1B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,yBAAyB,EAAE,MAAM,QAGlC;IAED,mCAAmC,CACjC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,yBAAyB,EAAE,MAAM,QAGlC;IAoBD,6BAA6B,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,gBAAgB,QAgBtF;IAED,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,eAAe,CAAC,QAUrE;IAED,WAAW,CAAC,MAAM,GAAE,qBAAiD,QAEpE;IAED,cAAc,CAAC,MAAM,GAAE,qBAAiD,UA+EvE;IA0BD,MAAM,CAAC,MAAM,SAAI,UAEhB;IAED,2BAA2B,CAAC,MAAM,SAAI,UA4FrC;CACF"}