@aztec/simulator 0.76.4 → 0.77.0-testnet-ignition.21

package/dest/avm/avm_simulator.js

@@ -1,193 +0,0 @@
-import { Fr, MAX_L2_GAS_PER_TX_PUBLIC_PORTION } from '@aztec/circuits.js';
-import { createLogger } from '@aztec/foundation/log';
-import { strict as assert } from 'assert';
-import { SideEffectLimitReachedError } from '../public/side_effect_errors.js';
-import { AvmContext } from './avm_context.js';
-import { AvmContractCallResult } from './avm_contract_call_result.js';
-import { AvmExecutionEnvironment } from './avm_execution_environment.js';
-import { AvmMachineState } from './avm_machine_state.js';
-import { isAvmBytecode } from './bytecode_utils.js';
-import { AvmExecutionError, AvmRevertReason, InvalidProgramCounterError, revertReasonFromExceptionalHalt, revertReasonFromExplicitRevert, } from './errors.js';
-import { INSTRUCTION_SET, decodeInstructionFromBytecode, } from './serialization/bytecode_serialization.js';
-export class AvmSimulator {
-    // Test Purposes only: Logger will not have the proper function name. Use this constructor for testing purposes
-    // only. Otherwise, use build() below.
-    constructor(context, instructionSet = INSTRUCTION_SET(), enableTallying = false) {
-        this.context = context;
-        this.instructionSet = instructionSet;
-        this.opcodeTallies = new Map();
-        // maps pc to [instr, bytesRead]
-        this.deserializedInstructionsCache = new Map();
-        this.tallyPrintFunction = () => { };
-        this.tallyInstructionFunction = (_b, _c) => { };
-        assert(context.machineState.gasLeft.l2Gas <= MAX_L2_GAS_PER_TX_PUBLIC_PORTION, `Cannot allocate more than ${MAX_L2_GAS_PER_TX_PUBLIC_PORTION} to the AVM for execution.`);
-        this.log = createLogger(`simulator:avm(calldata[0]: ${context.environment.calldata[0]})`);
-        // Turn on tallying if explicitly enabled or if trace logging
-        if (enableTallying || this.log.isLevelEnabled('trace')) {
-            this.tallyPrintFunction = this.printOpcodeTallies;
-            this.tallyInstructionFunction = this.tallyInstruction;
-        }
-    }
-    // Factory to have a proper function name in the logger. Retrieving the name is asynchronous and
-    // cannot be done as part of the constructor.
-    static async build(context) {
-        const simulator = new AvmSimulator(context);
-        const fnName = await context.persistableState.getPublicFunctionDebugName(context.environment);
-        simulator.log = createLogger(`simulator:avm(f:${fnName})`);
-        return simulator;
-    }
-    static async create(stateManager, address, sender, transactionFee, globals, isStaticCall, calldata, allocatedGas) {
-        const avmExecutionEnv = new AvmExecutionEnvironment(address, sender, 
-        /*contractCallDepth=*/ Fr.zero(), transactionFee, globals, isStaticCall, calldata);
-        const avmMachineState = new AvmMachineState(allocatedGas);
-        const avmContext = new AvmContext(stateManager, avmExecutionEnv, avmMachineState);
-        return await AvmSimulator.build(avmContext);
-    }
-    /**
-     * Fetch the bytecode and execute it in the current context.
-     */
-    async execute() {
-        let bytecode;
-        try {
-            bytecode = await this.context.persistableState.getBytecode(this.context.environment.address);
-        }
-        catch (err) {
-            if (!(err instanceof AvmExecutionError || err instanceof SideEffectLimitReachedError)) {
-                this.log.error(`Unknown error thrown by AVM during bytecode retrieval: ${err}`);
-                throw err;
-            }
-            return await this.handleFailureToRetrieveBytecode(`Bytecode retrieval for contract '${this.context.environment.address}' failed with ${err}. Reverting...`);
-        }
-        if (!bytecode) {
-            return await this.handleFailureToRetrieveBytecode(`No bytecode found at: ${this.context.environment.address}. Reverting...`);
-        }
-        return await this.executeBytecode(bytecode);
-    }
-    /**
-     * Return the bytecode used for execution, if any.
-     */
-    getBytecode() {
-        return this.bytecode;
-    }
-    /**
-     * Executes the provided bytecode in the current context.
-     * This method is useful for testing and debugging.
-     */
-    async executeBytecode(bytecode) {
-        const startTotalTime = performance.now();
-        assert(isAvmBytecode(bytecode), "AVM simulator can't execute non-AVM bytecode");
-        assert(bytecode.length > 0, "AVM simulator can't execute empty bytecode");
-        this.bytecode = bytecode;
-        const { machineState } = this.context;
-        const callStartGas = machineState.gasLeft; // Save gas before executing instruction (for profiling)
-        try {
-            // Execute instruction pointed to by the current program counter
-            // continuing until the machine state signifies a halt
-            let instrCounter = 0;
-            while (!machineState.getHalted()) {
-                // Get the instruction from cache, or deserialize for the first time
-                let cachedInstruction = this.deserializedInstructionsCache.get(machineState.pc);
-                if (cachedInstruction === undefined) {
-                    cachedInstruction = decodeInstructionFromBytecode(bytecode, machineState.pc, this.instructionSet);
-                    this.deserializedInstructionsCache.set(machineState.pc, cachedInstruction);
-                }
-                const [instruction, bytesRead] = cachedInstruction;
-                const instrStartGas = machineState.gasLeft; // Save gas before executing instruction (for profiling)
-                if (this.log.isLevelEnabled('trace')) {
-                    // Skip this entirely to avoid toStringing etc if trace is not enabled
-                    this.log.trace(`[PC:${machineState.pc}] [IC:${instrCounter}] ${instruction.toString()} (gasLeft l2=${machineState.l2GasLeft} da=${machineState.daGasLeft})`);
-                }
-                instrCounter++;
-                machineState.nextPc = machineState.pc + bytesRead;
-                // Execute the instruction.
-                // Normal returns and reverts will return normally here.
-                // "Exceptional halts" will throw.
-                await instruction.execute(this.context);
-                if (!instruction.handlesPC()) {
-                    // Increment PC if the instruction doesn't handle it itself
-                    machineState.pc += bytesRead;
-                }
-                // gas used by this instruction - used for profiling/tallying
-                const gasUsed = {
-                    l2Gas: instrStartGas.l2Gas - machineState.l2GasLeft,
-                    daGas: instrStartGas.daGas - machineState.daGasLeft,
-                };
-                this.tallyInstructionFunction(instruction.constructor.name, gasUsed);
-                if (machineState.pc >= bytecode.length) {
-                    this.log.warn('Passed end of program');
-                    throw new InvalidProgramCounterError(machineState.pc, /*max=*/ bytecode.length);
-                }
-            }
-            const output = machineState.getOutput();
-            const reverted = machineState.getReverted();
-            const revertReason = reverted ? await revertReasonFromExplicitRevert(output, this.context) : undefined;
-            const results = new AvmContractCallResult(reverted, output, machineState.gasLeft, revertReason);
-            this.log.debug(`Context execution results: ${results.toString()}`);
-            const totalGasUsed = {
-                l2Gas: callStartGas.l2Gas - machineState.l2GasLeft,
-                daGas: callStartGas.daGas - machineState.daGasLeft,
-            };
-            this.log.debug(`Executed ${instrCounter} instructions and consumed ${totalGasUsed.l2Gas} L2 Gas`);
-            this.tallyPrintFunction();
-            const endTotalTime = performance.now();
-            const totalTime = endTotalTime - startTotalTime;
-            this.log.debug(`Core AVM simulation took ${totalTime}ms`);
-            // Return results for processing by calling context
-            return results;
-        }
-        catch (err) {
-            this.log.verbose('Exceptional halt (revert by something other than REVERT opcode)');
-            // FIXME: weird that we have to do this OutOfGasError check because:
-            // 1. OutOfGasError is an AvmExecutionError, so that check should cover both
-            // 2. We should at least be able to do instanceof OutOfGasError instead of checking the constructor name
-            if (!(err.constructor.name == 'OutOfGasError' ||
-                err instanceof AvmExecutionError ||
-                err instanceof SideEffectLimitReachedError)) {
-                this.log.error(`Unknown error thrown by AVM: ${err}`);
-                throw err;
-            }
-            const revertReason = await revertReasonFromExceptionalHalt(err, this.context);
-            // Exceptional halts consume all allocated gas
-            const noGasLeft = { l2Gas: 0, daGas: 0 };
-            // Note: "exceptional halts" cannot return data, hence [].
-            const results = new AvmContractCallResult(/*reverted=*/ true, /*output=*/ [], noGasLeft, revertReason);
-            this.log.debug(`Context execution results: ${results.toString()}`);
-            this.tallyPrintFunction();
-            // Return results for processing by calling context
-            return results;
-        }
-    }
-    async handleFailureToRetrieveBytecode(message) {
-        // revert, consuming all gas
-        const fnName = await this.context.persistableState.getPublicFunctionDebugName(this.context.environment);
-        const revertReason = new AvmRevertReason(message, 
-        /*failingFunction=*/ {
-            contractAddress: this.context.environment.address,
-            functionName: fnName,
-        }, 
-        /*noirCallStack=*/ []);
-        this.log.warn(message);
-        return new AvmContractCallResult(
-        /*reverted=*/ true, 
-        /*output=*/ [], 
-        /*gasLeft=*/ { l2Gas: 0, daGas: 0 }, // consumes all allocated gas
-        revertReason);
-    }
-    tallyInstruction(opcode, gasUsed) {
-        const opcodeTally = this.opcodeTallies.get(opcode) || { count: 0, gas: { l2Gas: 0, daGas: 0 } };
-        opcodeTally.count++;
-        opcodeTally.gas.l2Gas += gasUsed.l2Gas;
-        opcodeTally.gas.daGas += gasUsed.daGas;
-        this.opcodeTallies.set(opcode, opcodeTally);
-    }
-    printOpcodeTallies() {
-        this.log.debug(`Printing tallies per opcode sorted by gas...`);
-        // sort descending by L2 gas consumed
-        const sortedOpcodes = Array.from(this.opcodeTallies.entries()).sort((a, b) => b[1].gas.l2Gas - a[1].gas.l2Gas);
-        for (const [opcode, tally] of sortedOpcodes) {
-            // NOTE: don't care to clutter the logs with DA gas for now
-            this.log.debug(`${opcode} executed ${tally.count} times consuming a total of ${tally.gas.l2Gas} L2 gas`);
-        }
-    }
-}
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"avm_simulator.js","sourceRoot":"","sources":["../../src/avm/avm_simulator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqB,EAAE,EAAwB,gCAAgC,EAAE,MAAM,oBAAoB,CAAC;AACnH,OAAO,EAAe,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAElE,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,2BAA2B,EAAE,MAAM,iCAAiC,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,MAAM,gCAAgC,CAAC;AAEzE,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,0BAA0B,EAC1B,+BAA+B,EAC/B,8BAA8B,GAC/B,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,eAAe,EAEf,6BAA6B,GAC9B,MAAM,2CAA2C,CAAC;AAOnD,MAAM,OAAO,YAAY;IAUvB,+GAA+G;IAC/G,sCAAsC;IACtC,YACU,OAAmB,EACnB,iBAAiC,eAAe,EAAE,EAC1D,cAAc,GAAG,KAAK;QAFd,YAAO,GAAP,OAAO,CAAY;QACnB,mBAAc,GAAd,cAAc,CAAoC;QAXpD,kBAAa,GAA6B,IAAI,GAAG,EAAE,CAAC;QAC5D,gCAAgC;QACxB,kCAA6B,GAAuC,IAAI,GAAG,EAAE,CAAC;QAE9E,uBAAkB,GAAG,GAAG,EAAE,GAAE,CAAC,CAAC;QAC9B,6BAAwB,GAAG,CAAC,EAAU,EAAE,EAAO,EAAE,EAAE,GAAE,CAAC,CAAC;QAS7D,MAAM,CACJ,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,IAAI,gCAAgC,EACtE,6BAA6B,gCAAgC,4BAA4B,CAC1F,CAAC;QACF,IAAI,CAAC,GAAG,GAAG,YAAY,CAAC,8BAA8B,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1F,6DAA6D;QAC7D,IAAI,cAAc,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YACvD,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,CAAC;YAClD,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACxD,CAAC;IACH,CAAC;IAED,gGAAgG;IAChG,6CAA6C;IACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAmB;QAC3C,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,0BAA0B,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC9F,SAAS,CAAC,GAAG,GAAG,YAAY,CAAC,mBAAmB,MAAM,GAAG,CAAC,CAAC;QAE3D,OAAO,SAAS,CAAC;IACnB,CAAC;IAEM,MAAM,CAAC,KAAK,CAAC,MAAM,CACxB,YAAwC,EACxC,OAAqB,EACrB,MAAoB,EACpB,cAAkB,EAClB,OAAwB,EACxB,YAAqB,EACrB,QAAc,EACd,YAAiB;QAEjB,MAAM,eAAe,GAAG,IAAI,uBAAuB,CACjD,OAAO,EACP,MAAM;QACN,sBAAsB,CAAC,EAAE,CAAC,IAAI,EAAE,EAChC,cAAc,EACd,OAAO,EACP,YAAY,EACZ,QAAQ,CACT,CAAC;QAEF,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,YAAY,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;QAClF,OAAO,MAAM,YAAY,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAO;QAClB,IAAI,QAA4B,CAAC;QACjC,IAAI,CAAC;YACH,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC/F,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,CAAC,GAAG,YAAY,iBAAiB,IAAI,GAAG,YAAY,2BAA2B,CAAC,EAAE,CAAC;gBACtF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,0DAA0D,GAAG,EAAE,CAAC,CAAC;gBAChF,MAAM,GAAG,CAAC;YACZ,CAAC;YACD,OAAO,MAAM,IAAI,CAAC,+BAA+B,CAC/C,oCAAoC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,iBAAiB,GAAG,gBAAgB,CACzG,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,MAAM,IAAI,CAAC,+BAA+B,CAC/C,yBAAyB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,gBAAgB,CAC1E,CAAC;QACJ,CAAC;QAED,OAAO,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,eAAe,CAAC,QAAgB;QAC3C,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACzC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,8CAA8C,CAAC,CAAC;QAChF,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,4CAA4C,CAAC,CAAC;QAE1E,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEzB,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QACtC,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,wDAAwD;QACnG,IAAI,CAAC;YACH,gEAAgE;YAChE,sDAAsD;YACtD,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;gBACjC,oEAAoE;gBACpE,IAAI,iBAAiB,GAAG,IAAI,CAAC,6BAA6B,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAEhF,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;oBACpC,iBAAiB,GAAG,6BAA6B,CAAC,QAAQ,EAAE,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBAClG,IAAI,CAAC,6BAA6B,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;gBAC7E,CAAC;gBACD,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,GAAG,iBAAiB,CAAC;gBAEnD,MAAM,aAAa,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,wDAAwD;gBAEpG,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrC,sEAAsE;oBACtE,IAAI,CAAC,GAAG,CAAC,KAAK,CACZ,OAAO,YAAY,CAAC,EAAE,SAAS,YAAY,KAAK,WAAW,CAAC,QAAQ,EAAE,gBACpE,YAAY,CAAC,SACf,OAAO,YAAY,CAAC,SAAS,GAAG,CACjC,CAAC;gBACJ,CAAC;gBACD,YAAY,EAAE,CAAC;gBAEf,YAAY,CAAC,MAAM,GAAG,YAAY,CAAC,EAAE,GAAG,SAAS,CAAC;gBAElD,2BAA2B;gBAC3B,wDAAwD;gBACxD,kCAAkC;gBAClC,MAAM,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC;oBAC7B,2DAA2D;oBAC3D,YAAY,CAAC,EAAE,IAAI,SAAS,CAAC;gBAC/B,CAAC;gBAED,6DAA6D;gBAC7D,MAAM,OAAO,GAAQ;oBACnB,KAAK,EAAE,aAAa,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS;oBACnD,KAAK,EAAE,aAAa,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS;iBACpD,CAAC;gBACF,IAAI,CAAC,wBAAwB,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAErE,IAAI,YAAY,CAAC,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBACvC,MAAM,IAAI,0BAA0B,CAAC,YAAY,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAClF,CAAC;YACH,CAAC;YAED,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,WAAW,EAAE,CAAC;YAC5C,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,MAAM,8BAA8B,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvG,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAChG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,8BAA8B,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACnE,MAAM,YAAY,GAAQ;gBACxB,KAAK,EAAE,YAAY,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS;gBAClD,KAAK,EAAE,YAAY,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS;aACnD,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,YAAY,8BAA8B,YAAY,CAAC,KAAK,SAAS,CAAC,CAAC;YAElG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAE1B,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,YAAY,GAAG,cAAc,CAAC;YAChD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,4BAA4B,SAAS,IAAI,CAAC,CAAC;YAE1D,mDAAmD;YACnD,OAAO,OAAO,CAAC;QACjB,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,iEAAiE,CAAC,CAAC;YACpF,oEAAoE;YACpE,4EAA4E;YAC5E,wGAAwG;YACxG,IACE,CAAC,CACC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,eAAe;gBACvC,GAAG,YAAY,iBAAiB;gBAChC,GAAG,YAAY,2BAA2B,CAC3C,EACD,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,gCAAgC,GAAG,EAAE,CAAC,CAAC;gBACtD,MAAM,GAAG,CAAC;YACZ,CAAC;YAED,MAAM,YAAY,GAAG,MAAM,+BAA+B,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9E,8CAA8C;YAC9C,MAAM,SAAS,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACzC,0DAA0D;YAC1D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,aAAa,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YACvG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,8BAA8B,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAEnE,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1B,mDAAmD;YACnD,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,+BAA+B,CAAC,OAAe;QAC3D,4BAA4B;QAC5B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACxG,MAAM,YAAY,GAAG,IAAI,eAAe,CACtC,OAAO;QACP,oBAAoB,CAAC;YACnB,eAAe,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO;YACjD,YAAY,EAAE,MAAM;SACrB;QACD,kBAAkB,CAAC,EAAE,CACtB,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,IAAI,qBAAqB;QAC9B,aAAa,CAAC,IAAI;QAClB,WAAW,CAAC,EAAE;QACd,YAAY,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,6BAA6B;QAClE,YAAY,CACb,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,MAAc,EAAE,OAAY;QACnD,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAK,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAkB,CAAC;QACjH,WAAW,CAAC,KAAK,EAAE,CAAC;QACpB,WAAW,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;QACvC,WAAW,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;QACvC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC9C,CAAC;IAEO,kBAAkB;QACxB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;QAC/D,qCAAqC;QACrC,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/G,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;YAC5C,2DAA2D;YAC3D,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,aAAa,KAAK,CAAC,KAAK,+BAA+B,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC;QAC3G,CAAC;IACH,CAAC;CACF"}

package/dest/avm/avm_tree.d.ts

@@ -1,282 +0,0 @@
-import { type IndexedTreeId, MerkleTreeId, type MerkleTreeReadOperations } from '@aztec/circuit-types';
-import { AppendOnlyTreeSnapshot, NullifierLeafPreimage, PublicDataTreeLeafPreimage } from '@aztec/circuits.js';
-import { Fr } from '@aztec/foundation/fields';
-import { type IndexedTreeLeafPreimage, type TreeLeafPreimage } from '@aztec/foundation/trees';
-/****************************************************/
-/****** Structs Used by the AvmEphemeralForest ******/
-/****************************************************/
-/**
- * The preimage and the leaf index of the Low Leaf (Low Nullifier or Low Public Data Leaf)
- */
-type PreimageWitness<T extends IndexedTreeLeafPreimage> = {
-    preimage: T;
-    index: bigint;
-};
-/**
- * The result of fetching a leaf from an indexed tree. Contains the preimage and wether the leaf was already present
- * or it's a low leaf.
- */
-type GetLeafResult<T extends IndexedTreeLeafPreimage> = PreimageWitness<T> & {
-    alreadyPresent: boolean;
-};
-/**
- * Contains the low sibling path and a boolean if the next index pointed to
- * by the low leaf is an update or an insertion (i.e. exists or not).
- */
-type LeafWitness<T extends IndexedTreeLeafPreimage> = PreimageWitness<T> & {
-    siblingPath: Fr[];
-};
-/**
- * The result of an update in an indexed merkle tree (no new leaf inserted)
- */
-type IndexedUpdateResult<T extends IndexedTreeLeafPreimage> = {
-    element: T;
-    lowWitness: LeafWitness<T>;
-};
-/**
- * The result of an insertion in an indexed merkle tree.
- * This will be used to hint the circuit
- */
-export type IndexedInsertResult<T extends IndexedTreeLeafPreimage> = IndexedUpdateResult<T> & {
-    leafIndex: bigint;
-    insertionPath: Fr[];
-};
-/**
- * The result of an indexed upsert in an indexed merkle tree.
- * This will be used to hint the circuit
- */
-export type IndexedUpsertResult<T extends IndexedTreeLeafPreimage> = (IndexedUpdateResult<T> & {
-    update: true;
-}) | (IndexedInsertResult<T> & {
-    update: false;
-});
-/****************************************************/
-/****** The AvmEphemeralForest Class ****************/
-/****************************************************/
-/**
- * This provides a forkable abstraction over the EphemeralAvmTree class
- *  It contains the logic to look up into a read-only MerkleTreeDb to discover
- *  the sibling paths and low witnesses that weren't inserted as part of this tx
- */
-export declare class AvmEphemeralForest {
-    treeDb: MerkleTreeReadOperations;
-    treeMap: Map<MerkleTreeId, EphemeralAvmTree>;
-    indexedUpdates: Map<IndexedTreeId, Map<bigint, IndexedTreeLeafPreimage>>;
-    indexedSortedKeys: Map<IndexedTreeId, [Fr, bigint][]>;
-    constructor(treeDb: MerkleTreeReadOperations, treeMap: Map<MerkleTreeId, EphemeralAvmTree>, indexedUpdates: Map<IndexedTreeId, Map<bigint, IndexedTreeLeafPreimage>>, indexedSortedKeys: Map<IndexedTreeId, [Fr, bigint][]>);
-    static create(treeDb: MerkleTreeReadOperations): Promise<AvmEphemeralForest>;
-    fork(): AvmEphemeralForest;
-    /**
-     * Gets sibling path for a leaf - if the sibling path is not found in the tree, it is fetched from the DB
-     * @param treeId - The tree to be queried for a sibling path.
-     * @param index - The index of the leaf for which a sibling path should be returned.
-     * @returns The sibling path of the leaf.
-     */
-    getSiblingPath(treeId: MerkleTreeId, index: bigint): Promise<Fr[]>;
-    /**
-     * This does the work of appending the new leaf and updating the low witness
-     * @param treeId - The tree to be queried for a sibling path.
-     * @param lowWitnessIndex - The index of the low leaf in the tree.
-     * @param lowWitness - The preimage of the low leaf.
-     * @param newLeafPreimage - The preimage of the new leaf to be inserted.
-     * @returns The sibling path of the new leaf (i.e. the insertion path)
-     */
-    appendIndexedTree<ID extends IndexedTreeId, T extends IndexedTreeLeafPreimage>(treeId: ID, lowLeafIndex: bigint, lowLeafPreimage: T, newLeafPreimage: T): Promise<Fr[]>;
-    /**
-     * This writes or updates a slot in the public data tree with a value
-     * @param slot - The slot to be written to.
-     * @param newValue - The value to be written or updated to
-     * @returns The insertion result which contains the insertion path, low leaf and the new leaf index
-     */
-    writePublicStorage(slot: Fr, newValue: Fr): Promise<IndexedUpsertResult<PublicDataTreeLeafPreimage>>;
-    private _updateSortedKeys;
-    /**
-     * This appends a nullifier to the nullifier tree, and throws if the nullifier already exists
-     * @param value - The nullifier to be appended
-     * @returns The insertion result which contains the insertion path, low leaf and the new leaf index
-     */
-    appendNullifier(nullifier: Fr): Promise<IndexedInsertResult<NullifierLeafPreimage>>;
-    /**
-     * This appends a note hash to the note hash tree
-     * @param value - The note hash to be appended
-     * @returns The insertion result which contains the insertion path
-     */
-    appendNoteHash(noteHash: Fr): Promise<Fr[]>;
-    /**
-     * This is wrapper around treeId to set values in the indexedUpdates map
-     */
-    private setIndexedUpdates;
-    /**
-     * This is wrapper around treeId to get values in the indexedUpdates map.
-     * Should only be called if we know the value exists.
-     */
-    private getIndexedUpdate;
-    /**
-     * This is wrapper around treeId to check membership (i.e. has()) of index in the indexedUpdates map
-     */
-    private hasLocalUpdates;
-    /**
-     * Get the leaf or low leaf preimage and its index in the indexed tree given a key (slot or nullifier value).
-     * If the key is not found in the tree, it does an external lookup to the underlying merkle DB.
-     * @param treeId - The tree we are looking up in
-     * @param key - The key for which we are look up the leaf or low leaf for.
-     * @param T - The type of the preimage (PublicData or Nullifier)
-     * @returns The leaf or low leaf info (preimage & leaf index).
-     */
-    getLeafOrLowLeafInfo<ID extends IndexedTreeId, T extends IndexedTreeLeafPreimage>(treeId: ID, key: Fr): Promise<GetLeafResult<T>>;
-    /**
-     * Internal helper to get the leaf or low leaf preimage and its index in the indexed tree given a key (slot or nullifier value).
-     * If the key is not found in the tree, it does an external lookup to the underlying merkle DB.
-     * Indicates whethe the sibling path is absent in the ephemeral tree.
-     * @param treeId - The tree we are looking up in
-     * @param key - The key for which we are look up the leaf or low leaf for.
-     * @param T - The type of the preimage (PublicData or Nullifier)
-     * @returns [
-     *     getLeafResult - The leaf or low leaf info (preimage & leaf index),
-     *     pathAbsentInEphemeralTree - whether its sibling path is absent in the ephemeral tree (useful during insertions)
-     * ]
-     */
-    _getLeafOrLowLeafInfo<ID extends IndexedTreeId, T extends IndexedTreeLeafPreimage>(treeId: ID, key: Fr): Promise<[GetLeafResult<T>, /*pathAbsentInEphemeralTree=*/ boolean]>;
-    /**
-     * Helper to search for the leaf with the specified key in the indexedUpdates
-     * and return its leafIndex.
-     * If not present, return the leafIndex of the largest leaf <= the specified key
-     * (the leafIndex of the next lowest key).
-     *
-     * If no entry exists in indexedUpdates <= the specified key, return -1.
-     * @returns - The leafIndex of the leaf with the largest key <= the specified key.
-     */
-    private _getLeafIndexOrNextLowestInIndexedUpdates;
-    /**
-     * Query the external DB to get leaf if present, low leaf if absent
-     */
-    private _getLeafOrLowLeafWitnessInExternalDb;
-    /**
-     * This hashes the preimage to a field element
-     */
-    hashPreimage<T extends TreeLeafPreimage>(preimage: T): Promise<Fr>;
-    getTreeSnapshot(id: MerkleTreeId): Promise<AppendOnlyTreeSnapshot>;
-}
-/****************************************************/
-/****** Some useful Structs and Enums **************/
-/****************************************************/
-declare enum TreeType {
-    LEAF = 0,
-    NODE = 1
-}
-type Leaf = {
-    tag: TreeType.LEAF;
-    value: Fr;
-};
-type Node = {
-    tag: TreeType.NODE;
-    leftTree: Tree;
-    rightTree: Tree;
-};
-type Tree = Leaf | Node;
-/****************************************************/
-/****** Some Helpful Constructors for Trees  ********/
-/****************************************************/
-declare const Node: (left: Tree, right: Tree) => Node;
-declare const Leaf: (value: Fr) => Leaf;
-/****************************************************/
-/****** The EphemeralAvmTree Class *****************/
-/****************************************************/
-/**
- * This class contains a recursively defined tree that has leaves at different heights
- * It is seeded by an existing merkle treeDb for which it derives a frontier
- * It is intended to be a lightweight tree that contains only the necessary information to suppport appends or updates
- */
-export declare class EphemeralAvmTree {
-    private root;
-    leafCount: bigint;
-    depth: number;
-    private zeroHashes;
-    private tree;
-    frontier: Fr[];
-    private static precomputedZeroHashes;
-    private constructor();
-    static create(forkedLeafCount: bigint, depth: number, treeDb: MerkleTreeReadOperations, merkleId: MerkleTreeId): Promise<EphemeralAvmTree>;
-    /**
-     * This is a recursive function that inserts a leaf into the tree
-     * @param value - The value of the leaf to be inserted
-     */
-    appendLeaf(value: Fr): void;
-    /**
-     * This is a recursive function that upserts a leaf into the tree at a index and depth
-     * @param value - The value of the leaf to be inserted
-     * @param index - The index of the leaf to be inserted
-     * @param depth - The depth of the leaf to be inserted (defaults to the bottom of the tree)
-     */
-    updateLeaf(value: Fr, index: bigint, depth?: number): void;
-    /**
-     * Get the sibling path of a leaf in the tree
-     * @param index - The index of the leaf for which a sibling path should be returned.
-     * @returns The sibling path of the leaf, can fail if the path is not found
-     */
-    getSiblingPath(index: bigint): Promise<Fr[] | undefined>;
-    /**
-     * This upserts the nodes of the sibling path into the tree
-     * @param index - The index of the leaf that the sibling path is derived from
-     * @param siblingPath - The sibling path of the index
-     */
-    insertSiblingPath(index: bigint, siblingPath: Fr[]): void;
-    /**
-     * This is a helper function that computes the index of the frontier nodes at each depth
-     * @param leafCount - The number of leaves in the tree
-     * @returns An array of frontier indices at each depth, sorted from leaf to root
-     */
-    static computeFrontierLeafIndices(leafCount: number): number[];
-    /**
-     * This derives the frontier and inserts them into the tree
-     * @param treeDb - The treeDb to be queried for sibling paths
-     * @param merkleId - The treeId of the tree to be queried for sibling paths
-     */
-    initializeFrontier(treeDb: MerkleTreeReadOperations, merkleId: MerkleTreeId): Promise<void>;
-    /**
-     * Computes the root of the tree
-     */
-    getRoot(): Promise<Fr>;
-    /**
-     * Recursively hashes the subtree
-     * @param tree - The tree to be hashed
-     * @param depth - The depth of the tree
-     */
-    hashTree(tree: Tree, depth: number): Promise<Fr>;
-    /**
-     * Extracts the subtree from a given index and depth
-     * @param index - The index of the node to be extracted
-     * @param depth - The depth of the node to be extracted
-     * @returns The subtree rooted at the index and depth
-     */
-    getNode(index: bigint, depth: number): Tree | undefined;
-    /**
-     * This is the recursive helper for getNode
-     */
-    private _getNode;
-    /** Our tree traversal uses an array of 1s and 0s to represent the path to a leaf and expects them to be in LE order
-     * This helps with deriving it given an index and (optionally a depth)
-     * @param index - The index to derive a path to within the tree, does not have to terminate at a leaf
-     * @param depth - The depth to traverse, if not provided it will traverse to the bottom of the tree
-     * @returns The path to the leaf in LE order
-     */
-    private _derivePathLE;
-    /** Sometimes we want it in BE order, to make truncating easier
-     * @param index - The index to derive a path to within the tree, does not have to terminate at a leaf
-     * @param depth - The depth to traverse, if not provided it will traverse to the bottom of the tree
-     * @returns The path to the leaf in LE order
-     */
-    private _derivePathBE;
-    /**
-     * This is a recursive function that upserts a leaf into the tree given a path
-     * @param value - The value of the leaf to be upserted
-     * @param insertPath - The path to the leaf, this should be ordered from leaf to root (i.e. LE encoded)
-     * @param depth - The depth of the tree
-     * @param tree - The current tree
-     * @param appendMode - If true we append the relevant zeroHashes to the tree as we traverse
-     */
-    private _insertLeaf;
-    private _getSiblingPath;
-}
-export {};
-//# sourceMappingURL=avm_tree.d.ts.map

package/dest/avm/avm_tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"avm_tree.d.ts","sourceRoot":"","sources":["../../src/avm/avm_tree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAE,YAAY,EAAE,KAAK,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AACvG,OAAO,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,0BAA0B,EAAE,MAAM,oBAAoB,CAAC;AAE/G,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAC9C,OAAO,EAAE,KAAK,uBAAuB,EAAE,KAAK,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAoB9F,sDAAsD;AACtD,sDAAsD;AACtD,sDAAsD;AAEtD;;GAEG;AACH,KAAK,eAAe,CAAC,CAAC,SAAS,uBAAuB,IAAI;IACxD,QAAQ,EAAE,CAAC,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF;;;GAGG;AACH,KAAK,aAAa,CAAC,CAAC,SAAS,uBAAuB,IAAI,eAAe,CAAC,CAAC,CAAC,GAAG;IAC3E,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAEF;;;GAGG;AACH,KAAK,WAAW,CAAC,CAAC,SAAS,uBAAuB,IAAI,eAAe,CAAC,CAAC,CAAC,GAAG;IACzE,WAAW,EAAE,EAAE,EAAE,CAAC;CACnB,CAAC;AAEF;;GAEG;AACH,KAAK,mBAAmB,CAAC,CAAC,SAAS,uBAAuB,IAAI;IAC5D,OAAO,EAAE,CAAC,CAAC;IACX,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;CAC5B,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,SAAS,uBAAuB,IAAI,mBAAmB,CAAC,CAAC,CAAC,GAAG;IAC5F,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,EAAE,EAAE,CAAC;CACrB,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,mBAAmB,CAAC,CAAC,SAAS,uBAAuB,IAC7D,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG;IAAE,MAAM,EAAE,IAAI,CAAA;CAAE,CAAC,GAC3C,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG;IAAE,MAAM,EAAE,KAAK,CAAA;CAAE,CAAC,CAAC;AAEjD,sDAAsD;AACtD,sDAAsD;AACtD,sDAAsD;AAEtD;;;;GAIG;AACH,qBAAa,kBAAkB;IAEpB,MAAM,EAAE,wBAAwB;IAChC,OAAO,EAAE,GAAG,CAAC,YAAY,EAAE,gBAAgB,CAAC;IAG5C,cAAc,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IACxE,iBAAiB,EAAE,GAAG,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;gBALrD,MAAM,EAAE,wBAAwB,EAChC,OAAO,EAAE,GAAG,CAAC,YAAY,EAAE,gBAAgB,CAAC,EAG5C,cAAc,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC,EACxE,iBAAiB,EAAE,GAAG,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;WAGjD,MAAM,CAAC,MAAM,EAAE,wBAAwB,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAalF,IAAI,IAAI,kBAAkB;IAS1B;;;;;OAKG;IACG,cAAc,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC;IAuBxE;;;;;;;OAOG;IACG,iBAAiB,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC,SAAS,uBAAuB,EACjF,MAAM,EAAE,EAAE,EACV,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,CAAC,EAClB,eAAe,EAAE,CAAC,GACjB,OAAO,CAAC,EAAE,EAAE,CAAC;IAgBhB;;;;;OAKG;IACG,kBAAkB,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,CAAC,0BAA0B,CAAC,CAAC;IAkE1G,OAAO,CAAC,iBAAiB;IAqBzB;;;;OAIG;IACG,eAAe,CAAC,SAAS,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,CAAC,qBAAqB,CAAC,CAAC;IA8CzF;;;;OAIG;IACG,cAAc,CAAC,QAAQ,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC;IAQjD;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAazB;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAWxB;;OAEG;IACH,OAAO,CAAC,eAAe;IAQvB;;;;;;;OAOG;IACG,oBAAoB,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC,SAAS,uBAAuB,EACpF,MAAM,EAAE,EAAE,EACV,GAAG,EAAE,EAAE,GACN,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAK5B;;;;;;;;;;;OAWG;IACG,qBAAqB,CAAC,EAAE,SAAS,aAAa,EAAE,CAAC,SAAS,uBAAuB,EACrF,MAAM,EAAE,EAAE,EACV,GAAG,EAAE,EAAE,GACN,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,8BAA8B,CAAC,OAAO,CAAC,CAAC;IA0CtE;;;;;;;;OAQG;IACH,OAAO,CAAC,yCAAyC;IAiBjD;;OAEG;YACW,oCAAoC;IAqBlD;;OAEG;IACH,YAAY,CAAC,CAAC,SAAS,gBAAgB,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;IAK5D,eAAe,CAAC,EAAE,EAAE,YAAY,GAAG,OAAO,CAAC,sBAAsB,CAAC;CAKzE;AAED,sDAAsD;AACtD,qDAAqD;AACrD,sDAAsD;AACtD,aAAK,QAAQ;IACX,IAAI,IAAA;IACJ,IAAI,IAAA;CACL;AAED,KAAK,IAAI,GAAG;IACV,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC;IACnB,KAAK,EAAE,EAAE,CAAC;CACX,CAAC;AACF,KAAK,IAAI,GAAG;IACV,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC;IACnB,QAAQ,EAAE,IAAI,CAAC;IACf,SAAS,EAAE,IAAI,CAAC;CACjB,CAAC;AAEF,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAaxB,sDAAsD;AACtD,sDAAsD;AACtD,sDAAsD;AACtD,QAAA,MAAM,IAAI,SAAU,IAAI,SAAS,IAAI,KAAG,IAItC,CAAC;AAEH,QAAA,MAAM,IAAI,UAAW,EAAE,KAAG,IAGxB,CAAC;AAEH,sDAAsD;AACtD,qDAAqD;AACrD,sDAAsD;AAEtD;;;;GAIG;AACH,qBAAa,gBAAgB;IAMP,OAAO,CAAC,IAAI;IAAe,SAAS,EAAE,MAAM;IAAS,KAAK,EAAE,MAAM;IAAE,OAAO,CAAC,UAAU;IAL1G,OAAO,CAAC,IAAI,CAAO;IACZ,QAAQ,EAAE,EAAE,EAAE,CAAC;IAEtB,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAAmB;IAEvD,OAAO;WAKM,MAAM,CACjB,eAAe,EAAE,MAAM,EACvB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,wBAAwB,EAChC,QAAQ,EAAE,YAAY,GACrB,OAAO,CAAC,gBAAgB,CAAC;IAY5B;;;OAGG;IACH,UAAU,CAAC,KAAK,EAAE,EAAE,GAAG,IAAI;IAM3B;;;;;OAKG;IACH,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,SAAa,GAAG,IAAI;IAK9D;;;;OAIG;IACG,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC;IAU9D;;;;OAIG;IACH,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,GAAG,IAAI;IAczD;;;;OAIG;IAEH,MAAM,CAAC,0BAA0B,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE;IAgB9D;;;;OAIG;IACG,kBAAkB,CAAC,MAAM,EAAE,wBAAwB,EAAE,QAAQ,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IAgCjG;;OAEG;IACI,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;IAI7B;;;;OAIG;IACU,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC;IAc7D;;;;;OAKG;IACI,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAW9D;;OAEG;IACH,OAAO,CAAC,QAAQ;IAahB;;;;;OAKG;IACH,OAAO,CAAC,aAAa;IAIrB;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAQrB;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;YA4BL,eAAe;CAkC9B"}