@aztec/simulator 0.74.0 → 0.75.0-commit.c03ba01a2a4122e43e90d5133ba017e54b90e9d2

package/dest/avm/avm_memory_types.d.ts

@@ -1,310 +0,0 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
-import { AztecAddress } from '@aztec/foundation/aztec-address';
-import { Fr } from '@aztec/foundation/fields';
-import { type Logger } from '@aztec/foundation/log';
-import { type FunctionsOf } from '@aztec/foundation/types';
-import { Addressing } from './opcodes/addressing_mode.js';
-/** MemoryValue gathers the common operations for all memory types. */
-export declare abstract class MemoryValue {
-    abstract add(rhs: MemoryValue): MemoryValue;
-    abstract sub(rhs: MemoryValue): MemoryValue;
-    abstract mul(rhs: MemoryValue): MemoryValue;
-    abstract div(rhs: MemoryValue): MemoryValue;
-    abstract equals(rhs: MemoryValue): boolean;
-    abstract lt(rhs: MemoryValue): boolean;
-    abstract build(n: bigint): MemoryValue;
-    abstract toBigInt(): bigint;
-    abstract toBuffer(): Buffer;
-    toFr(): Fr;
-    toAztecAddress(): AztecAddress;
-    toNumber(): number;
-    toString(): string;
-}
-/** IntegralValue gathers the common operations for all integral memory types. */
-export declare abstract class IntegralValue extends MemoryValue {
-    abstract shl(rhs: IntegralValue): IntegralValue;
-    abstract shr(rhs: IntegralValue): IntegralValue;
-    abstract and(rhs: IntegralValue): IntegralValue;
-    abstract or(rhs: IntegralValue): IntegralValue;
-    abstract xor(rhs: IntegralValue): IntegralValue;
-    abstract not(): IntegralValue;
-}
-declare const Uint1_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint1 extends Uint1_base {
-}
-declare const Uint8_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint8 extends Uint8_base {
-}
-declare const Uint16_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint16 extends Uint16_base {
-}
-declare const Uint32_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint32 extends Uint32_base {
-}
-declare const Uint64_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint64 extends Uint64_base {
-}
-declare const Uint128_base: {
-    new (n: number | bigint): {
-        readonly n: bigint;
-        build(n: bigint): any;
-        add(rhs: any): any;
-        sub(rhs: any): any;
-        mul(rhs: any): any;
-        div(rhs: any): any;
-        shr(rhs: any): any;
-        shl(rhs: any): any;
-        and(rhs: any): any;
-        or(rhs: any): any;
-        xor(rhs: any): any;
-        not(): any;
-        equals(rhs: any): boolean;
-        lt(rhs: any): boolean;
-        toBigInt(): bigint;
-        toBuffer(): Buffer;
-        toFr(): Fr;
-        toAztecAddress(): AztecAddress;
-        toNumber(): number;
-        toString(): string;
-    };
-    readonly mod: bigint;
-    readonly bitmask: bigint;
-};
-export declare class Uint128 extends Uint128_base {
-}
-export declare class Field extends MemoryValue {
-    static readonly MODULUS: bigint;
-    private readonly rep;
-    constructor(v: number | bigint | Fr | Buffer);
-    build(n: bigint): Field;
-    add(rhs: Field): Field;
-    sub(rhs: Field): Field;
-    mul(rhs: Field): Field;
-    div(rhs: Field): Field;
-    fdiv(rhs: Field): Field;
-    equals(rhs: Field): boolean;
-    lt(rhs: Field): boolean;
-    toBigInt(): bigint;
-    toBuffer(): Buffer;
-}
-export declare enum TypeTag {
-    FIELD = 0,
-    UINT1 = 1,
-    UINT8 = 2,
-    UINT16 = 3,
-    UINT32 = 4,
-    UINT64 = 5,
-    UINT128 = 6,
-    INVALID = 7
-}
-export type TaggedMemoryInterface = FunctionsOf<TaggedMemory>;
-export declare class TaggedMemory implements TaggedMemoryInterface {
-    static readonly log: Logger;
-    static readonly TRACK_MEMORY_ACCESSES: boolean;
-    static readonly MAX_MEMORY_SIZE: number;
-    private _mem;
-    constructor();
-    getMaxMemorySize(): number;
-    /** Returns a MeteredTaggedMemory instance to track the number of reads and writes if TRACK_MEMORY_ACCESSES is set. */
-    track(type?: string): TaggedMemoryInterface;
-    get(offset: number): MemoryValue;
-    getAs<T>(offset: number): T;
-    getSlice(offset: number, size: number): MemoryValue[];
-    getSliceAs<T>(offset: number, size: number): T[];
-    getSliceTags(offset: number, size: number): TypeTag[];
-    set(offset: number, v: MemoryValue): void;
-    setSlice(offset: number, slice: MemoryValue[]): void;
-    getTag(offset: number): TypeTag;
-    /**
-     * Check that the memory at the given offset matches the specified tag.
-     */
-    checkTag(tag: TypeTag, offset: number): void;
-    checkIsValidMemoryOffsetTag(offset: number): void;
-    static checkIsIntegralTag(tag: TypeTag): void;
-    static checkIsValidTag(tagNumber: number): void;
-    /**
-     * Check tags for memory at all of the specified offsets.
-     */
-    checkTags(tag: TypeTag, ...offsets: number[]): void;
-    /**
-     * Check that all tags at the given offsets are the same.
-     */
-    checkTagsAreSame(...offsets: number[]): void;
-    /**
-     * Check tags for all memory in the specified range.
-     */
-    checkTagsRange(tag: TypeTag, startOffset: number, size: number): void;
-    static getTag(v: MemoryValue | undefined): TypeTag;
-    static buildFromTagTruncating(v: bigint | number, tag: TypeTag): MemoryValue;
-    /** No-op. Implemented here for compatibility with the MeteredTaggedMemory. */
-    assert(_operations: Partial<MemoryOperations & {
-        addressing: Addressing;
-    }>): void;
-}
-/** Tagged memory wrapper with metering for each memory read and write operation. */
-export declare class MeteredTaggedMemory implements TaggedMemoryInterface {
-    private wrapped;
-    private type;
-    private reads;
-    private writes;
-    constructor(wrapped: TaggedMemory, type?: string);
-    /** Returns the number of reads and writes tracked so far and resets them to zero. */
-    reset(): MemoryOperations;
-    /**
-     * Asserts that the exact number of memory operations have been performed.
-     * Indirect represents the flags for indirect accesses: each bit set to one counts as an extra read.
-     */
-    assert(operations: Partial<MemoryOperations & {
-        addressing: Addressing;
-    }>): void;
-    getMaxMemorySize(): number;
-    track(type?: string): MeteredTaggedMemory;
-    get(offset: number): MemoryValue;
-    getSliceAs<T>(offset: number, size: number): T[];
-    getAs<T>(offset: number): T;
-    getSlice(offset: number, size: number): MemoryValue[];
-    set(offset: number, v: MemoryValue): void;
-    setSlice(offset: number, vs: MemoryValue[]): void;
-    getSliceTags(offset: number, size: number): TypeTag[];
-    getTag(offset: number): TypeTag;
-    checkTag(tag: TypeTag, offset: number): void;
-    checkIsValidMemoryOffsetTag(offset: number): void;
-    checkTags(tag: TypeTag, ...offsets: number[]): void;
-    checkTagsAreSame(...offsets: number[]): void;
-    checkTagsRange(tag: TypeTag, startOffset: number, size: number): void;
-}
-/** Tracks number of memory reads and writes. */
-export type MemoryOperations = {
-    /** How many total reads are performed. Slice reads are count as one per element. */
-    reads: number;
-    /** How many total writes are performed. Slice writes are count as one per element. */
-    writes: number;
-};
-export {};
-//# sourceMappingURL=avm_memory_types.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"avm_memory_types.d.ts","sourceRoot":"","sources":["../../src/avm/avm_memory_types.ts"],"names":[],"mappings":";;AASA,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAE/D,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAC9C,OAAO,EAAE,KAAK,MAAM,EAAgB,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,KAAK,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAU3D,OAAO,EAAE,UAAU,EAAkB,MAAM,8BAA8B,CAAC;AAE1E,sEAAsE;AACtE,8BAAsB,WAAW;aACf,GAAG,CAAC,GAAG,EAAE,WAAW,GAAG,WAAW;aAClC,GAAG,CAAC,GAAG,EAAE,WAAW,GAAG,WAAW;aAClC,GAAG,CAAC,GAAG,EAAE,WAAW,GAAG,WAAW;aAClC,GAAG,CAAC,GAAG,EAAE,WAAW,GAAG,WAAW;aAElC,MAAM,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO;aACjC,EAAE,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO;aAG7B,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,WAAW;aAG7B,QAAQ,IAAI,MAAM;aAGlB,QAAQ,IAAI,MAAM;IAG3B,IAAI,IAAI,EAAE;IAIV,cAAc,IAAI,YAAY;IAK9B,QAAQ,IAAI,MAAM;IAIlB,QAAQ,IAAI,MAAM;CAG1B;AAED,iFAAiF;AACjF,8BAAsB,aAAc,SAAQ,WAAW;aACrC,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa;aACtC,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa;aACtC,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa;aACtC,EAAE,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa;aACrC,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa;aACtC,GAAG,IAAI,aAAa;CACrC;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyFD,qBAAa,KAAM,SAAQ,UAA8B;CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;AAC5D,qBAAa,KAAM,SAAQ,UAA8B;CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;AAC5D,qBAAa,MAAO,SAAQ,WAA+B;CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;AAC9D,qBAAa,MAAO,SAAQ,WAA+B;CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;AAC9D,qBAAa,MAAO,SAAQ,WAA+B;CAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;AAC9D,qBAAa,OAAQ,SAAQ,YAAgC;CAAG;AAEhE,qBAAa,KAAM,SAAQ,WAAW;IACpC,gBAAuB,OAAO,EAAE,MAAM,CAAc;IACpD,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAK;gBAEb,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,MAAM;IAKrC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK;IAIvB,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;IAItB,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;IAItB,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;IAKtB,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;IAKtB,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;IAIvB,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,OAAO;IAI3B,EAAE,CAAC,GAAG,EAAE,KAAK,GAAG,OAAO;IAIvB,QAAQ,IAAI,MAAM;IAIlB,QAAQ,IAAI,MAAM;CAG1B;AAED,oBAAY,OAAO;IACjB,KAAK,IAAa;IAClB,KAAK,IAAa;IAClB,KAAK,IAAa;IAClB,MAAM,IAAc;IACpB,MAAM,IAAc;IACpB,MAAM,IAAc;IACpB,OAAO,IAAe;IACtB,OAAO,IAAA;CACR;AAGD,MAAM,MAAM,qBAAqB,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;AAE9D,qBAAa,YAAa,YAAW,qBAAqB;IACxD,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAwC;IAGnE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,UAAmC;IAKxE,MAAM,CAAC,QAAQ,CAAC,eAAe,SAAqB;IACpD,OAAO,CAAC,IAAI,CAA2B;;IAMhC,gBAAgB,IAAI,MAAM;IAIjC,sHAAsH;IAC/G,KAAK,CAAC,IAAI,GAAE,MAAsB,GAAG,qBAAqB;IAI1D,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW;IAMhC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;IAY3B,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,EAAE;IAiBrD,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE;IAIhD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,EAAE;IAIrD,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW;IAOlC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE;IAa7C,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAMtC;;OAEG;IACI,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM;IAOrC,2BAA2B,CAAC,MAAM,EAAE,MAAM;WAInC,kBAAkB,CAAC,GAAG,EAAE,OAAO;WAQ/B,eAAe,CAAC,SAAS,EAAE,MAAM;IAgB/C;;OAEG;IACI,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE;IAMnD;;OAEG;IACI,gBAAgB,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE;IAO5C;;OAEG;IACI,cAAc,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;WAQvD,MAAM,CAAC,CAAC,EAAE,WAAW,GAAG,SAAS,GAAG,OAAO;WA2B3C,sBAAsB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,WAAW;IAsBnF,8EAA8E;IACvE,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,gBAAgB,GAAG;QAAE,UAAU,EAAE,UAAU,CAAA;KAAE,CAAC;CAClF;AAED,oFAAoF;AACpF,qBAAa,mBAAoB,YAAW,qBAAqB;IAInD,OAAO,CAAC,OAAO;IAAgB,OAAO,CAAC,IAAI;IAHvD,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,MAAM,CAAa;gBAEP,OAAO,EAAE,YAAY,EAAU,IAAI,GAAE,MAAsB;IAE/E,qFAAqF;IAC9E,KAAK,IAAI,gBAAgB;IAOhC;;;OAGG;IACI,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,gBAAgB,GAAG;QAAE,UAAU,EAAE,UAAU,CAAA;KAAE,CAAC;IAsBzE,gBAAgB,IAAI,MAAM;IAI1B,KAAK,CAAC,IAAI,GAAE,MAAsB,GAAG,mBAAmB;IAIxD,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW;IAKhC,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE;IAKhD,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,CAAC;IAK3B,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,EAAE;IAKrD,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,GAAG,IAAI;IAKzC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,IAAI;IAKjD,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,EAAE;IAIrD,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAI/B,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAI5C,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIjD,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAInD,gBAAgB,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI;IAI5C,cAAc,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;CAG7E;AAED,gDAAgD;AAChD,MAAM,MAAM,gBAAgB,GAAG;IAC7B,oFAAoF;IACpF,KAAK,EAAE,MAAM,CAAC;IACd,sFAAsF;IACtF,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC"}

package/dest/avm/avm_simulator.d.ts

@@ -1,37 +0,0 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
-import { type AztecAddress, Fr, type GlobalVariables } from '@aztec/circuits.js';
-import { AvmContext } from './avm_context.js';
-import { AvmContractCallResult } from './avm_contract_call_result.js';
-import { type Gas } from './avm_gas.js';
-import { type AvmPersistableStateManager } from './journal/journal.js';
-import { type InstructionSet } from './serialization/bytecode_serialization.js';
-export declare class AvmSimulator {
-    private context;
-    private instructionSet;
-    private log;
-    private bytecode;
-    private opcodeTallies;
-    private tallyPrintFunction;
-    private tallyInstructionFunction;
-    constructor(context: AvmContext, instructionSet?: InstructionSet);
-    static build(context: AvmContext): Promise<AvmSimulator>;
-    static create(stateManager: AvmPersistableStateManager, address: AztecAddress, sender: AztecAddress, transactionFee: Fr, globals: GlobalVariables, isStaticCall: boolean, calldata: Fr[], allocatedGas: Gas): Promise<AvmSimulator>;
-    /**
-     * Fetch the bytecode and execute it in the current context.
-     */
-    execute(): Promise<AvmContractCallResult>;
-    /**
-     * Return the bytecode used for execution, if any.
-     */
-    getBytecode(): Buffer | undefined;
-    /**
-     * Executes the provided bytecode in the current context.
-     * This method is useful for testing and debugging.
-     */
-    executeBytecode(bytecode: Buffer): Promise<AvmContractCallResult>;
-    private handleFailureToRetrieveBytecode;
-    private tallyInstruction;
-    private printOpcodeTallies;
-}
-//# sourceMappingURL=avm_simulator.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"avm_simulator.d.ts","sourceRoot":"","sources":["../../src/avm/avm_simulator.ts"],"names":[],"mappings":";;AAAA,OAAO,EAAE,KAAK,YAAY,EAAE,EAAE,EAAE,KAAK,eAAe,EAAoC,MAAM,oBAAoB,CAAC;AAMnH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AAEtE,OAAO,EAAE,KAAK,GAAG,EAAE,MAAM,cAAc,CAAC;AAUxC,OAAO,EAAE,KAAK,0BAA0B,EAAE,MAAM,sBAAsB,CAAC;AACvE,OAAO,EAEL,KAAK,cAAc,EAEpB,MAAM,2CAA2C,CAAC;AAOnD,qBAAa,YAAY;IAUX,OAAO,CAAC,OAAO;IAAc,OAAO,CAAC,cAAc;IAT/D,OAAO,CAAC,GAAG,CAAS;IACpB,OAAO,CAAC,QAAQ,CAAqB;IACrC,OAAO,CAAC,aAAa,CAAuC;IAE5D,OAAO,CAAC,kBAAkB,CAAY;IACtC,OAAO,CAAC,wBAAwB,CAA+B;gBAI3C,OAAO,EAAE,UAAU,EAAU,cAAc,GAAE,cAAkC;WAe/E,KAAK,CAAC,OAAO,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC;WAQjD,MAAM,CACxB,YAAY,EAAE,0BAA0B,EACxC,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,YAAY,EACpB,cAAc,EAAE,EAAE,EAClB,OAAO,EAAE,eAAe,EACxB,YAAY,EAAE,OAAO,EACrB,QAAQ,EAAE,EAAE,EAAE,EACd,YAAY,EAAE,GAAG;IAiBnB;;OAEG;IACU,OAAO,IAAI,OAAO,CAAC,qBAAqB,CAAC;IAuBtD;;OAEG;IACI,WAAW,IAAI,MAAM,GAAG,SAAS;IAIxC;;;OAGG;IACU,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC;YAwFhE,+BAA+B;IAoB7C,OAAO,CAAC,gBAAgB;IAQxB,OAAO,CAAC,kBAAkB;CAS3B"}

package/dest/avm/avm_tree.d.ts

@@ -1,281 +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 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;AAK9F,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;IAIP,OAAO,CAAC,IAAI;IAAe,SAAS,EAAE,MAAM;IAAS,KAAK,EAAE,MAAM;IAAE,OAAO,CAAC,UAAU;IAH1G,OAAO,CAAC,IAAI,CAAO;IACZ,QAAQ,EAAE,EAAE,EAAE,CAAC;IAEtB,OAAO;WAKM,MAAM,CACjB,eAAe,EAAE,MAAM,EACvB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,wBAAwB,EAChC,QAAQ,EAAE,YAAY,GACrB,OAAO,CAAC,gBAAgB,CAAC;IAa5B;;;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"}

package/dest/avm/bytecode_utils.d.ts

@@ -1,5 +0,0 @@
-/// <reference types="node" resolution-mode="require"/>
-/// <reference types="node" resolution-mode="require"/>
-export declare function markBytecodeAsAvm(bytecode: Buffer): Buffer;
-export declare function isAvmBytecode(bytecode: Buffer): boolean;
-//# sourceMappingURL=bytecode_utils.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bytecode_utils.d.ts","sourceRoot":"","sources":["../../src/avm/bytecode_utils.ts"],"names":[],"mappings":";;AASA,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAE1D;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAGvD"}