@aztec/simulator 0.0.1-commit.a5db02d → 0.0.1-commit.aa0c64f

package/dest/public/side_effect_trace.js

@@ -1,199 +0,0 @@
-import { FLAT_PUBLIC_LOGS_PAYLOAD_LENGTH, MAX_L2_TO_L1_MSGS_PER_TX, MAX_NOTE_HASHES_PER_TX, MAX_NULLIFIERS_PER_TX, MAX_PUBLIC_CALLS_TO_UNIQUE_CONTRACT_CLASS_IDS, MAX_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX, PROTOCOL_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX } from '@aztec/constants';
-import { Fr } from '@aztec/foundation/curves/bn254';
-import { EthAddress } from '@aztec/foundation/eth-address';
-import { createLogger } from '@aztec/foundation/log';
-import { PublicDataUpdateRequest } from '@aztec/stdlib/avm';
-import { computePublicDataTreeLeafSlot } from '@aztec/stdlib/hash';
-import { NoteHash, Nullifier } from '@aztec/stdlib/kernel';
-import { DebugLog, PublicLog } from '@aztec/stdlib/logs';
-import { L2ToL1Message } from '@aztec/stdlib/messaging';
-import { strict as assert } from 'assert';
-import { L2ToL1MessageLimitReachedError, MaxCallsToUniqueContractClassIdsError, NoteHashLimitReachedError, NullifierLimitReachedError, SideEffectLimitReachedError } from './side_effect_errors.js';
-import { UniqueClassIds } from './unique_class_ids.js';
-export class SideEffectArrayLengths {
-    publicDataWrites;
-    protocolPublicDataWrites;
-    noteHashes;
-    nullifiers;
-    l2ToL1Msgs;
-    publicLogFields;
-    constructor(publicDataWrites, protocolPublicDataWrites, noteHashes, nullifiers, l2ToL1Msgs, publicLogFields){
-        this.publicDataWrites = publicDataWrites;
-        this.protocolPublicDataWrites = protocolPublicDataWrites;
-        this.noteHashes = noteHashes;
-        this.nullifiers = nullifiers;
-        this.l2ToL1Msgs = l2ToL1Msgs;
-        this.publicLogFields = publicLogFields;
-    }
-    static empty() {
-        return new this(0, 0, 0, 0, 0, 0);
-    }
-}
-/**
- * Trace side effects for an enqueued public call's execution.
- */ export class SideEffectTrace {
-    startSideEffectCounter;
-    previousSideEffectArrayLengths;
-    uniqueClassIds;
-    writtenPublicDataSlots;
-    debugLogs;
-    debugLogMemoryReads;
-    log;
-    /** The side effect counter increments with every call to the trace. */ sideEffectCounter;
-    publicDataWrites;
-    protocolPublicDataWritesLength;
-    userPublicDataWritesLength;
-    noteHashes;
-    nullifiers;
-    l2ToL1Messages;
-    publicLogs;
-    /** Make sure a forked trace is never merged twice. */ alreadyMergedIntoParent;
-    constructor(/** The counter of this trace's first side effect. */ startSideEffectCounter = 0, bindings, /** Track parent's (or previous kernel's) lengths so the AVM can properly enforce TX-wide limits,
-     *  otherwise the public kernel can fail to prove because TX limits are breached.
-     */ previousSideEffectArrayLengths = SideEffectArrayLengths.empty(), /** We need to track the set of class IDs used, to enforce limits. */ uniqueClassIds = new UniqueClassIds(), writtenPublicDataSlots = new Set(), debugLogs = [], debugLogMemoryReads = 0){
-        this.startSideEffectCounter = startSideEffectCounter;
-        this.previousSideEffectArrayLengths = previousSideEffectArrayLengths;
-        this.uniqueClassIds = uniqueClassIds;
-        this.writtenPublicDataSlots = writtenPublicDataSlots;
-        this.debugLogs = debugLogs;
-        this.debugLogMemoryReads = debugLogMemoryReads;
-        this.publicDataWrites = [];
-        this.protocolPublicDataWritesLength = 0;
-        this.userPublicDataWritesLength = 0;
-        this.noteHashes = [];
-        this.nullifiers = [];
-        this.l2ToL1Messages = [];
-        this.publicLogs = [];
-        this.alreadyMergedIntoParent = false;
-        this.sideEffectCounter = startSideEffectCounter;
-        this.log = createLogger('simulator:side_effect_trace', bindings);
-    }
-    fork() {
-        return new SideEffectTrace(this.sideEffectCounter, this.log.getBindings(), new SideEffectArrayLengths(this.previousSideEffectArrayLengths.publicDataWrites + this.userPublicDataWritesLength, this.previousSideEffectArrayLengths.protocolPublicDataWrites + this.protocolPublicDataWritesLength, this.previousSideEffectArrayLengths.noteHashes + this.noteHashes.length, this.previousSideEffectArrayLengths.nullifiers + this.nullifiers.length, this.previousSideEffectArrayLengths.l2ToL1Msgs + this.l2ToL1Messages.length, this.previousSideEffectArrayLengths.publicLogFields + this.publicLogs.reduce((acc, log)=>acc + log.sizeInFields(), 0)), this.uniqueClassIds.fork(), new Set(this.writtenPublicDataSlots), this.debugLogs.slice(), this.debugLogMemoryReads);
-    }
-    merge(forkedTrace, reverted = false) {
-        // sanity check to avoid merging the same forked trace twice
-        assert(!forkedTrace.alreadyMergedIntoParent, 'Bug! Cannot merge a forked trace that has already been merged into its parent!');
-        forkedTrace.alreadyMergedIntoParent = true;
-        this.sideEffectCounter = forkedTrace.sideEffectCounter;
-        this.uniqueClassIds.acceptAndMerge(forkedTrace.uniqueClassIds);
-        this.debugLogs = forkedTrace.debugLogs;
-        this.debugLogMemoryReads = forkedTrace.debugLogMemoryReads;
-        if (!reverted) {
-            this.publicDataWrites.push(...forkedTrace.publicDataWrites);
-            this.noteHashes.push(...forkedTrace.noteHashes);
-            this.nullifiers.push(...forkedTrace.nullifiers);
-            this.l2ToL1Messages.push(...forkedTrace.l2ToL1Messages);
-            this.publicLogs.push(...forkedTrace.publicLogs);
-            this.userPublicDataWritesLength += forkedTrace.userPublicDataWritesLength;
-            this.protocolPublicDataWritesLength += forkedTrace.protocolPublicDataWritesLength;
-            for (const slot of forkedTrace.writtenPublicDataSlots){
-                this.writtenPublicDataSlots.add(slot);
-            }
-        }
-    }
-    getCounter() {
-        return this.sideEffectCounter;
-    }
-    incrementSideEffectCounter() {
-        this.sideEffectCounter++;
-    }
-    getNoteHashCount() {
-        return this.previousSideEffectArrayLengths.noteHashes + this.noteHashes.length;
-    }
-    async tracePublicStorageWrite(contractAddress, slot, value, protocolWrite) {
-        // Only increment counts if the storage slot has not been written to before.
-        if (this.isStorageCold(contractAddress, slot)) {
-            if (protocolWrite) {
-                if (this.protocolPublicDataWritesLength + this.previousSideEffectArrayLengths.protocolPublicDataWrites >= PROTOCOL_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX) {
-                    throw new SideEffectLimitReachedError('protocol public data (contract storage) write', PROTOCOL_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX);
-                }
-                this.protocolPublicDataWritesLength++;
-            } else {
-                if (this.userPublicDataWritesLength + this.previousSideEffectArrayLengths.publicDataWrites >= MAX_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX) {
-                    throw new SideEffectLimitReachedError('public data (contract storage) write', MAX_PUBLIC_DATA_UPDATE_REQUESTS_PER_TX);
-                }
-                this.userPublicDataWritesLength++;
-            }
-        }
-        const leafSlot = await computePublicDataTreeLeafSlot(contractAddress, slot);
-        this.publicDataWrites.push(new PublicDataUpdateRequest(leafSlot, value, this.sideEffectCounter));
-        this.log.trace(`Traced public data write (address=${contractAddress}, slot=${slot}): value=${value} (counter=${this.sideEffectCounter}, isProtocol:${protocolWrite})`);
-        this.incrementSideEffectCounter();
-        this.writtenPublicDataSlots.add(this.computePublicDataSlotKey(contractAddress, slot));
-    }
-    computePublicDataSlotKey(contractAddress, slot) {
-        return `${contractAddress.toString()}:${slot.toString()}`;
-    }
-    isStorageCold(contractAddress, slot) {
-        return !this.writtenPublicDataSlots.has(this.computePublicDataSlotKey(contractAddress, slot));
-    }
-    traceNewNoteHash(noteHash) {
-        if (this.noteHashes.length + this.previousSideEffectArrayLengths.noteHashes >= MAX_NOTE_HASHES_PER_TX) {
-            throw new NoteHashLimitReachedError();
-        }
-        this.noteHashes.push(new NoteHash(noteHash, this.sideEffectCounter));
-        this.log.trace(`Tracing new note hash (counter=${this.sideEffectCounter})`);
-        this.incrementSideEffectCounter();
-    }
-    traceNewNullifier(siloedNullifier) {
-        if (this.nullifiers.length + this.previousSideEffectArrayLengths.nullifiers >= MAX_NULLIFIERS_PER_TX) {
-            throw new NullifierLimitReachedError();
-        }
-        this.nullifiers.push(new Nullifier(siloedNullifier, /*noteHash=*/ Fr.ZERO, this.sideEffectCounter));
-        this.log.trace(`Tracing new nullifier (counter=${this.sideEffectCounter})`);
-        this.incrementSideEffectCounter();
-    }
-    traceNewL2ToL1Message(contractAddress, recipient, content) {
-        if (this.l2ToL1Messages.length + this.previousSideEffectArrayLengths.l2ToL1Msgs >= MAX_L2_TO_L1_MSGS_PER_TX) {
-            throw new L2ToL1MessageLimitReachedError();
-        }
-        const recipientAddress = EthAddress.fromField(recipient);
-        this.l2ToL1Messages.push(new L2ToL1Message(recipientAddress, content).scope(contractAddress));
-        this.log.trace(`Tracing new l2 to l1 message (counter=${this.sideEffectCounter})`);
-        this.incrementSideEffectCounter();
-    }
-    tracePublicLog(contractAddress, log) {
-        const previouslyEmittedPublicLogFieldsCount = this.previousSideEffectArrayLengths.publicLogFields + this.publicLogs.reduce((acc, log)=>acc + log.sizeInFields(), 0);
-        const publicLog = new PublicLog(contractAddress, log);
-        if (previouslyEmittedPublicLogFieldsCount + publicLog.sizeInFields() > FLAT_PUBLIC_LOGS_PAYLOAD_LENGTH) {
-            throw new SideEffectLimitReachedError('public log fields', FLAT_PUBLIC_LOGS_PAYLOAD_LENGTH);
-        }
-        this.publicLogs.push(publicLog);
-        this.log.trace(`Tracing new public log (counter=${this.sideEffectCounter})`);
-        this.incrementSideEffectCounter();
-    }
-    traceDebugLog(contractAddress, level, message, fields) {
-        this.debugLogs.push(new DebugLog(contractAddress, level, message, fields));
-    }
-    getDebugLogs() {
-        return this.debugLogs;
-    }
-    getDebugLogMemoryReads() {
-        return this.debugLogMemoryReads;
-    }
-    traceDebugLogMemoryReads(memoryReads) {
-        this.debugLogMemoryReads += memoryReads;
-    }
-    traceGetContractClass(contractClassId, exists) {
-        // We limit the number of unique contract class IDs due to hashing and the trace length limit.
-        if (exists && !this.uniqueClassIds.has(contractClassId.toString())) {
-            if (this.uniqueClassIds.size() >= MAX_PUBLIC_CALLS_TO_UNIQUE_CONTRACT_CLASS_IDS) {
-                this.log.debug(`Bytecode retrieval failure for contract class ID ${contractClassId} (limit reached)`);
-                throw new MaxCallsToUniqueContractClassIdsError();
-            }
-            this.log.trace(`Adding contract class ID ${contractClassId} (counter=${this.sideEffectCounter})`);
-            this.uniqueClassIds.add(contractClassId.toString());
-            this.incrementSideEffectCounter();
-        }
-    }
-    getSideEffects() {
-        return {
-            publicDataWrites: this.publicDataWrites,
-            noteHashes: this.noteHashes,
-            nullifiers: this.nullifiers,
-            l2ToL1Msgs: this.l2ToL1Messages,
-            publicLogs: this.publicLogs
-        };
-    }
-}

package/dest/public/side_effect_trace_interface.d.ts

@@ -1,22 +0,0 @@
-import type { Fr } from '@aztec/foundation/curves/bn254';
-import type { LogLevel } from '@aztec/foundation/log';
-import type { AztecAddress } from '@aztec/stdlib/aztec-address';
-import type { DebugLog } from '@aztec/stdlib/logs';
-export interface PublicSideEffectTraceInterface {
-    fork(): PublicSideEffectTraceInterface;
-    merge(nestedTrace: PublicSideEffectTraceInterface, reverted?: boolean): void;
-    getCounter(): number;
-    tracePublicStorageWrite(contractAddress: AztecAddress, slot: Fr, value: Fr, protocolWrite: boolean): Promise<void>;
-    isStorageCold(contractAddress: AztecAddress, slot: Fr): boolean;
-    traceNewNoteHash(uniqueNoteHash: Fr): void;
-    getNoteHashCount(): number;
-    traceNewNullifier(siloedNullifier: Fr): void;
-    traceNewL2ToL1Message(contractAddress: AztecAddress, recipient: Fr, content: Fr): void;
-    tracePublicLog(contractAddress: AztecAddress, log: Fr[]): void;
-    traceDebugLog(contractAddress: AztecAddress, level: LogLevel, message: string, fields: Fr[]): void;
-    getDebugLogs(): DebugLog[];
-    getDebugLogMemoryReads(): number;
-    traceDebugLogMemoryReads(memoryReads: number): void;
-    traceGetContractClass(contractClassId: Fr, exists: boolean): void;
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoic2lkZV9lZmZlY3RfdHJhY2VfaW50ZXJmYWNlLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvcHVibGljL3NpZGVfZWZmZWN0X3RyYWNlX2ludGVyZmFjZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEtBQUssRUFBRSxFQUFFLEVBQUUsTUFBTSxnQ0FBZ0MsQ0FBQztBQUN6RCxPQUFPLEtBQUssRUFBRSxRQUFRLEVBQUUsTUFBTSx1QkFBdUIsQ0FBQztBQUN0RCxPQUFPLEtBQUssRUFBRSxZQUFZLEVBQUUsTUFBTSw2QkFBNkIsQ0FBQztBQUNoRSxPQUFPLEtBQUssRUFBRSxRQUFRLEVBQUUsTUFBTSxvQkFBb0IsQ0FBQztBQUVuRCxNQUFNLFdBQVcsOEJBQThCO0lBQzdDLElBQUksSUFBSSw4QkFBOEIsQ0FBQztJQUN2QyxLQUFLLENBQUMsV0FBVyxFQUFFLDhCQUE4QixFQUFFLFFBQVEsQ0FBQyxFQUFFLE9BQU8sR0FBRyxJQUFJLENBQUM7SUFDN0UsVUFBVSxJQUFJLE1BQU0sQ0FBQztJQUVyQix1QkFBdUIsQ0FDckIsZUFBZSxFQUFFLFlBQVksRUFDN0IsSUFBSSxFQUFFLEVBQUUsRUFDUixLQUFLLEVBQUUsRUFBRSxFQUNULGFBQWEsRUFBRSxPQUFPLEdBQ3JCLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUNqQixhQUFhLENBQUMsZUFBZSxFQUFFLFlBQVksRUFBRSxJQUFJLEVBQUUsRUFBRSxHQUFHLE9BQU8sQ0FBQztJQUNoRSxnQkFBZ0IsQ0FBQyxjQUFjLEVBQUUsRUFBRSxHQUFHLElBQUksQ0FBQztJQUMzQyxnQkFBZ0IsSUFBSSxNQUFNLENBQUM7SUFDM0IsaUJBQWlCLENBQUMsZUFBZSxFQUFFLEVBQUUsR0FBRyxJQUFJLENBQUM7SUFDN0MscUJBQXFCLENBQUMsZUFBZSxFQUFFLFlBQVksRUFBRSxTQUFTLEVBQUUsRUFBRSxFQUFFLE9BQU8sRUFBRSxFQUFFLEdBQUcsSUFBSSxDQUFDO0lBQ3ZGLGNBQWMsQ0FBQyxlQUFlLEVBQUUsWUFBWSxFQUFFLEdBQUcsRUFBRSxFQUFFLEVBQUUsR0FBRyxJQUFJLENBQUM7SUFDL0QsYUFBYSxDQUFDLGVBQWUsRUFBRSxZQUFZLEVBQUUsS0FBSyxFQUFFLFFBQVEsRUFBRSxPQUFPLEVBQUUsTUFBTSxFQUFFLE1BQU0sRUFBRSxFQUFFLEVBQUUsR0FBRyxJQUFJLENBQUM7SUFDbkcsWUFBWSxJQUFJLFFBQVEsRUFBRSxDQUFDO0lBQzNCLHNCQUFzQixJQUFJLE1BQU0sQ0FBQztJQUNqQyx3QkFBd0IsQ0FBQyxXQUFXLEVBQUUsTUFBTSxHQUFHLElBQUksQ0FBQztJQUNwRCxxQkFBcUIsQ0FBQyxlQUFlLEVBQUUsRUFBRSxFQUFFLE1BQU0sRUFBRSxPQUFPLEdBQUcsSUFBSSxDQUFDO0NBQ25FIn0=

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

@@ -1 +0,0 @@
-{"version":3,"file":"side_effect_trace_interface.d.ts","sourceRoot":"","sources":["../../src/public/side_effect_trace_interface.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACzD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAEnD,MAAM,WAAW,8BAA8B;IAC7C,IAAI,IAAI,8BAA8B,CAAC;IACvC,KAAK,CAAC,WAAW,EAAE,8BAA8B,EAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;IAC7E,UAAU,IAAI,MAAM,CAAC;IAErB,uBAAuB,CACrB,eAAe,EAAE,YAAY,EAC7B,IAAI,EAAE,EAAE,EACR,KAAK,EAAE,EAAE,EACT,aAAa,EAAE,OAAO,GACrB,OAAO,CAAC,IAAI,CAAC,CAAC;IACjB,aAAa,CAAC,eAAe,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC;IAChE,gBAAgB,CAAC,cAAc,EAAE,EAAE,GAAG,IAAI,CAAC;IAC3C,gBAAgB,IAAI,MAAM,CAAC;IAC3B,iBAAiB,CAAC,eAAe,EAAE,EAAE,GAAG,IAAI,CAAC;IAC7C,qBAAqB,CAAC,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,GAAG,IAAI,CAAC;IACvF,cAAc,CAAC,eAAe,EAAE,YAAY,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;IAC/D,aAAa,CAAC,eAAe,EAAE,YAAY,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;IACnG,YAAY,IAAI,QAAQ,EAAE,CAAC;IAC3B,sBAAsB,IAAI,MAAM,CAAC;IACjC,wBAAwB,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpD,qBAAqB,CAAC,eAAe,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAAC;CACnE"}

package/dest/public/side_effect_trace_interface.js

@@ -1 +0,0 @@
-export { };

package/dest/public/state_manager/index.d.ts

@@ -1,2 +0,0 @@
-export * from './state_manager.js';
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9wdWJsaWMvc3RhdGVfbWFuYWdlci9pbmRleC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxjQUFjLG9CQUFvQixDQUFDIn0=

package/dest/public/state_manager/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/public/state_manager/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC"}

package/dest/public/state_manager/index.js

@@ -1 +0,0 @@
-export * from './state_manager.js';

package/dest/public/state_manager/nullifiers.d.ts

@@ -1,61 +0,0 @@
-import type { Fr } from '@aztec/foundation/curves/bn254';
-import type { PublicTreesDB } from '../public_db_sources.js';
-/**
- * A class to manage new nullifier staging and existence checks during a contract call's AVM simulation.
- * Maintains a siloed nullifier cache, and ensures that existence checks fall back to the correct source.
- * When a contract call completes, its cached nullifier set can be merged into its parent's.
- */
-export declare class NullifierManager {
-    /** Reference to node storage. Checked on parent cache-miss. */
-    private readonly hostNullifiers;
-    /** Cache of siloed nullifiers. */
-    private cache;
-    /** Parent nullifier manager to fall back on */
-    private readonly parent?;
-    constructor(
-    /** Reference to node storage. Checked on parent cache-miss. */
-    hostNullifiers: PublicTreesDB, 
-    /** Cache of siloed nullifiers. */
-    cache?: Set<bigint>, 
-    /** Parent nullifier manager to fall back on */
-    parent?: NullifierManager | undefined);
-    /**
-     * Create a new nullifiers manager forked from this one
-     */
-    fork(): NullifierManager;
-    /**
-     * Get a nullifier's existence in this' cache or parent's (recursively).
-     * DOES NOT CHECK HOST STORAGE!
-     * @param siloedNullifier - the nullifier to check for
-     * @returns exists: whether the nullifier exists in cache here or in parent's
-     */
-    private checkExistsHereOrParent;
-    /**
-     * Get a nullifier's existence status.
-     * 1. Check cache.
-     * 2. Check parent cache.
-     * 3. Fall back to the host state.
-     * 4. Not found! Nullifier does not exist.
-     *
-     * @param siloedNullifier - the nullifier to check for
-     * @returns exists: whether the nullifier exists at all,
-     *          cacheHit: whether the nullifier was found in a cache,
-     */
-    checkExists(siloedNullifier: Fr): Promise<{
-        exists: boolean;
-        cacheHit: boolean;
-    }>;
-    /**
-     * Stage a new nullifier (append it to the cache).
-     *
-     * @param siloedNullifier - the nullifier to stage
-     */
-    append(siloedNullifier: Fr): Promise<void>;
-    /**
-     * Merges another nullifier cache into this one.
-     *
-     * @param incomingNullifiers - the incoming cached nullifiers to merge into this instance's
-     */
-    acceptAndMerge(incomingNullifiers: NullifierManager): void;
-}
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibnVsbGlmaWVycy5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3B1YmxpYy9zdGF0ZV9tYW5hZ2VyL251bGxpZmllcnMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxLQUFLLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFFekQsT0FBTyxLQUFLLEVBQUUsYUFBYSxFQUFFLE1BQU0seUJBQXlCLENBQUM7QUFHN0Q7Ozs7R0FJRztBQUNILHFCQUFhLGdCQUFnQjtJQUV6QiwrREFBK0Q7SUFDL0QsT0FBTyxDQUFDLFFBQVEsQ0FBQyxjQUFjO0lBQy9CLGtDQUFrQztJQUNsQyxPQUFPLENBQUMsS0FBSztJQUNiLCtDQUErQztJQUMvQyxPQUFPLENBQUMsUUFBUSxDQUFDLE1BQU0sQ0FBQztJQU4xQjtJQUNFLCtEQUErRDtJQUM5QyxjQUFjLEVBQUUsYUFBYTtJQUM5QyxrQ0FBa0M7SUFDMUIsS0FBSyxHQUFFLEdBQUcsQ0FBQyxNQUFNLENBQWE7SUFDdEMsK0NBQStDO0lBQzlCLE1BQU0sQ0FBQyw4QkFBa0IsRUFDeEM7SUFFSjs7T0FFRztJQUNJLElBQUkscUJBRVY7SUFFRDs7Ozs7T0FLRztJQUNILE9BQU8sQ0FBQyx1QkFBdUI7SUFXL0I7Ozs7Ozs7Ozs7T0FVRztJQUNVLFdBQVcsQ0FBQyxlQUFlLEVBQUUsRUFBRSxHQUFHLE9BQU8sQ0FBQztRQUFFLE1BQU0sRUFBRSxPQUFPLENBQUM7UUFBQyxRQUFRLEVBQUUsT0FBTyxDQUFBO0tBQUUsQ0FBQyxDQWlCN0Y7SUFFRDs7OztPQUlHO0lBQ1UsTUFBTSxDQUFDLGVBQWUsRUFBRSxFQUFFLGlCQU10QztJQUVEOzs7O09BSUc7SUFDSSxjQUFjLENBQUMsa0JBQWtCLEVBQUUsZ0JBQWdCLFFBU3pEO0NBQ0YifQ==

package/dest/public/state_manager/nullifiers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"nullifiers.d.ts","sourceRoot":"","sources":["../../../src/public/state_manager/nullifiers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AAEzD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAG7D;;;;GAIG;AACH,qBAAa,gBAAgB;IAEzB,+DAA+D;IAC/D,OAAO,CAAC,QAAQ,CAAC,cAAc;IAC/B,kCAAkC;IAClC,OAAO,CAAC,KAAK;IACb,+CAA+C;IAC/C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IAN1B;IACE,+DAA+D;IAC9C,cAAc,EAAE,aAAa;IAC9C,kCAAkC;IAC1B,KAAK,GAAE,GAAG,CAAC,MAAM,CAAa;IACtC,+CAA+C;IAC9B,MAAM,CAAC,8BAAkB,EACxC;IAEJ;;OAEG;IACI,IAAI,qBAEV;IAED;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IAW/B;;;;;;;;;;OAUG;IACU,WAAW,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,OAAO,CAAC;QAAC,QAAQ,EAAE,OAAO,CAAA;KAAE,CAAC,CAiB7F;IAED;;;;OAIG;IACU,MAAM,CAAC,eAAe,EAAE,EAAE,iBAMtC;IAED;;;;OAIG;IACI,cAAc,CAAC,kBAAkB,EAAE,gBAAgB,QASzD;CACF"}

package/dest/public/state_manager/nullifiers.js

@@ -1,92 +0,0 @@
-import { NullifierCollisionError } from '../side_effect_errors.js';
-/**
- * A class to manage new nullifier staging and existence checks during a contract call's AVM simulation.
- * Maintains a siloed nullifier cache, and ensures that existence checks fall back to the correct source.
- * When a contract call completes, its cached nullifier set can be merged into its parent's.
- */ export class NullifierManager {
-    hostNullifiers;
-    cache;
-    parent;
-    constructor(/** Reference to node storage. Checked on parent cache-miss. */ hostNullifiers, /** Cache of siloed nullifiers. */ cache = new Set(), /** Parent nullifier manager to fall back on */ parent){
-        this.hostNullifiers = hostNullifiers;
-        this.cache = cache;
-        this.parent = parent;
-    }
-    /**
-   * Create a new nullifiers manager forked from this one
-   */ fork() {
-        return new NullifierManager(this.hostNullifiers, new Set(), this);
-    }
-    /**
-   * Get a nullifier's existence in this' cache or parent's (recursively).
-   * DOES NOT CHECK HOST STORAGE!
-   * @param siloedNullifier - the nullifier to check for
-   * @returns exists: whether the nullifier exists in cache here or in parent's
-   */ checkExistsHereOrParent(siloedNullifier) {
-        // First check this cache
-        let existsAsPending = this.cache.has(siloedNullifier.toBigInt());
-        // Then try parent's nullifier cache
-        if (!existsAsPending && this.parent) {
-            // Note: this will recurse to grandparent/etc until a cache-hit is encountered.
-            existsAsPending = this.parent.checkExistsHereOrParent(siloedNullifier);
-        }
-        return existsAsPending;
-    }
-    /**
-   * Get a nullifier's existence status.
-   * 1. Check cache.
-   * 2. Check parent cache.
-   * 3. Fall back to the host state.
-   * 4. Not found! Nullifier does not exist.
-   *
-   * @param siloedNullifier - the nullifier to check for
-   * @returns exists: whether the nullifier exists at all,
-   *          cacheHit: whether the nullifier was found in a cache,
-   */ async checkExists(siloedNullifier) {
-        // Check this cache and parent's (recursively)
-        const cacheHit = this.checkExistsHereOrParent(siloedNullifier);
-        let existsInTree = false;
-        if (!cacheHit) {
-            // Finally try the host's Aztec state (a trip to the database)
-            //const leafOrLowLeafIndex = await this.hostNullifiers.db.getPreviousValueIndex(MerkleTreeId.NULLIFIER_TREE, siloedNullifier.toBigInt());
-            //assert(
-            //  leafOrLowLeafIndex !== undefined,
-            //  `${MerkleTreeId[MerkleTreeId.NULLIFIER_TREE]} low leaf index should always be found (even if target leaf does not exist)`,
-            //);
-            //existsInTree = leafOrLowLeafIndex.alreadyPresent;
-            const exists = await this.hostNullifiers.checkNullifierExists(siloedNullifier);
-            existsInTree = exists;
-        }
-        const exists = cacheHit || existsInTree;
-        return Promise.resolve({
-            exists,
-            cacheHit
-        });
-    }
-    /**
-   * Stage a new nullifier (append it to the cache).
-   *
-   * @param siloedNullifier - the nullifier to stage
-   */ async append(siloedNullifier) {
-        const { exists } = await this.checkExists(siloedNullifier);
-        if (exists) {
-            throw new NullifierCollisionError(`Siloed nullifier ${siloedNullifier} already exists in parent cache or host.`);
-        }
-        this.cache.add(siloedNullifier.toBigInt());
-    }
-    /**
-   * Merges another nullifier cache into this one.
-   *
-   * @param incomingNullifiers - the incoming cached nullifiers to merge into this instance's
-   */ acceptAndMerge(incomingNullifiers) {
-        for (const incomingNullifier of incomingNullifiers.cache){
-            if (this.cache.has(incomingNullifier)) {
-                throw new NullifierCollisionError(`Failed to merge in fork's cached nullifiers. Siloed nullifier ${incomingNullifier} already exists in parent cache.`);
-            }
-        }
-        this.cache = new Set([
-            ...this.cache,
-            ...incomingNullifiers.cache
-        ]);
-    }
-}

package/dest/public/state_manager/public_storage.d.ts

@@ -1,66 +0,0 @@
-import { Fr } from '@aztec/foundation/curves/bn254';
-import type { AztecAddress } from '@aztec/stdlib/aztec-address';
-import type { PublicStateDBInterface } from '../db_interfaces.js';
-type PublicStorageReadResult = {
-    value: Fr;
-    cached: boolean;
-};
-/**
- * A class to manage public storage reads and writes during a contract call's AVM simulation.
- * Maintains a storage write cache, and ensures that reads fall back to the correct source.
- * When a contract call completes, its storage cache can be merged into its parent's.
- */
-export declare class PublicStorage {
-    /** Reference to node storage. Checked on parent cache-miss. */
-    private readonly hostPublicStorage;
-    /** Parent's storage. Checked on this' cache-miss. */
-    private readonly parent?;
-    /** Cached storage writes. */
-    private readonly cache;
-    constructor(
-    /** Reference to node storage. Checked on parent cache-miss. */
-    hostPublicStorage: PublicStateDBInterface, 
-    /** Parent's storage. Checked on this' cache-miss. */
-    parent?: PublicStorage | undefined);
-    /**
-     * Create a new public storage manager forked from this one
-     */
-    fork(): PublicStorage;
-    /**
-     * Read a storage value from this' cache or parent's (recursively).
-     * DOES NOT CHECK HOST 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 value: the latest value written according to this cache or the parent's. undefined on cache miss.
-     */
-    readHereOrParent(contractAddress: AztecAddress, slot: Fr): Fr | undefined;
-    /**
-     * Read a value from storage.
-     * 1. Check cache.
-     * 2. Check parent cache.
-     * 3. Fall back to the host state.
-     * 4. Not found! Value has never been written to before. Flag it as non-existent and return value zero.
-     *
-     * @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 exists: whether the slot has EVER been written to before, value: the latest value written to slot, or 0 if never written to before
-     */
-    read(contractAddress: AztecAddress, slot: Fr): Promise<PublicStorageReadResult>;
-    /**
-     * Stage a storage 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
-     */
-    write(contractAddress: AztecAddress, slot: Fr, value: Fr): void;
-    /**
-     * Merges another PublicStorage's cache (pending writes) into this one.
-     *
-     * @param incomingPublicStorage - the incoming public storage to merge into this instance's
-     */
-    acceptAndMerge(incomingPublicStorage: PublicStorage): void;
-}
-export {};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHVibGljX3N0b3JhZ2UuZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9wdWJsaWMvc3RhdGVfbWFuYWdlci9wdWJsaWNfc3RvcmFnZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsRUFBRSxFQUFFLE1BQU0sZ0NBQWdDLENBQUM7QUFDcEQsT0FBTyxLQUFLLEVBQUUsWUFBWSxFQUFFLE1BQU0sNkJBQTZCLENBQUM7QUFFaEUsT0FBTyxLQUFLLEVBQUUsc0JBQXNCLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQUVsRSxLQUFLLHVCQUF1QixHQUFHO0lBQzdCLEtBQUssRUFBRSxFQUFFLENBQUM7SUFDVixNQUFNLEVBQUUsT0FBTyxDQUFDO0NBQ2pCLENBQUM7QUFFRjs7OztHQUlHO0FBQ0gscUJBQWEsYUFBYTtJQUt0QiwrREFBK0Q7SUFDL0QsT0FBTyxDQUFDLFFBQVEsQ0FBQyxpQkFBaUI7SUFDbEMscURBQXFEO0lBQ3JELE9BQU8sQ0FBQyxRQUFRLENBQUMsTUFBTSxDQUFDO0lBUDFCLDZCQUE2QjtJQUM3QixPQUFPLENBQUMsUUFBUSxDQUFDLEtBQUssQ0FBcUI7SUFFM0M7SUFDRSwrREFBK0Q7SUFDOUMsaUJBQWlCLEVBQUUsc0JBQXNCO0lBQzFELHFEQUFxRDtJQUNwQyxNQUFNLENBQUMsMkJBQWUsRUFHeEM7SUFFRDs7T0FFRztJQUNJLElBQUksa0JBRVY7SUFFRDs7Ozs7OztPQU9HO0lBQ0ksZ0JBQWdCLENBQUMsZUFBZSxFQUFFLFlBQVksRUFBRSxJQUFJLEVBQUUsRUFBRSxHQUFHLEVBQUUsR0FBRyxTQUFTLENBUy9FO0lBRUQ7Ozs7Ozs7Ozs7T0FVRztJQUNVLElBQUksQ0FBQyxlQUFlLEVBQUUsWUFBWSxFQUFFLElBQUksRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLHVCQUF1QixDQUFDLENBaUIzRjtJQUVEOzs7Ozs7T0FNRztJQUNJLEtBQUssQ0FBQyxlQUFlLEVBQUUsWUFBWSxFQUFFLElBQUksRUFBRSxFQUFFLEVBQUUsS0FBSyxFQUFFLEVBQUUsUUFFOUQ7SUFFRDs7OztPQUlHO0lBQ0ksY0FBYyxDQUFDLHFCQUFxQixFQUFFLGFBQWEsUUFFekQ7Q0FDRiJ9

package/dest/public/state_manager/public_storage.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"public_storage.d.ts","sourceRoot":"","sources":["../../../src/public/state_manager/public_storage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,gCAAgC,CAAC;AACpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAEhE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAElE,KAAK,uBAAuB,GAAG;IAC7B,KAAK,EAAE,EAAE,CAAC;IACV,MAAM,EAAE,OAAO,CAAC;CACjB,CAAC;AAEF;;;;GAIG;AACH,qBAAa,aAAa;IAKtB,+DAA+D;IAC/D,OAAO,CAAC,QAAQ,CAAC,iBAAiB;IAClC,qDAAqD;IACrD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IAP1B,6BAA6B;IAC7B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAqB;IAE3C;IACE,+DAA+D;IAC9C,iBAAiB,EAAE,sBAAsB;IAC1D,qDAAqD;IACpC,MAAM,CAAC,2BAAe,EAGxC;IAED;;OAEG;IACI,IAAI,kBAEV;IAED;;;;;;;OAOG;IACI,gBAAgB,CAAC,eAAe,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,SAAS,CAS/E;IAED;;;;;;;;;;OAUG;IACU,IAAI,CAAC,eAAe,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO,CAAC,uBAAuB,CAAC,CAiB3F;IAED;;;;;;OAMG;IACI,KAAK,CAAC,eAAe,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,QAE9D;IAED;;;;OAIG;IACI,cAAc,CAAC,qBAAqB,EAAE,aAAa,QAEzD;CACF"}

package/dest/public/state_manager/public_storage.js

@@ -1,145 +0,0 @@
-import { Fr } from '@aztec/foundation/curves/bn254';
-/**
- * A class to manage public storage reads and writes during a contract call's AVM simulation.
- * Maintains a storage write cache, and ensures that reads fall back to the correct source.
- * When a contract call completes, its storage cache can be merged into its parent's.
- */ export class PublicStorage {
-    hostPublicStorage;
-    parent;
-    /** Cached storage writes. */ cache;
-    constructor(/** Reference to node storage. Checked on parent cache-miss. */ hostPublicStorage, /** Parent's storage. Checked on this' cache-miss. */ parent){
-        this.hostPublicStorage = hostPublicStorage;
-        this.parent = parent;
-        this.cache = new PublicStorageCache();
-    }
-    /**
-   * Create a new public storage manager forked from this one
-   */ fork() {
-        return new PublicStorage(this.hostPublicStorage, this);
-    }
-    /**
-   * Read a storage value from this' cache or parent's (recursively).
-   * DOES NOT CHECK HOST 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 value: the latest value written according to this cache or the parent's. undefined on cache miss.
-   */ readHereOrParent(contractAddress, slot) {
-        // First try check this storage cache
-        let value = this.cache.read(contractAddress, slot);
-        // Then try parent's storage cache
-        if (!value && this.parent) {
-            // Note: this will recurse to grandparent/etc until a cache-hit is encountered.
-            value = this.parent.readHereOrParent(contractAddress, slot);
-        }
-        return value;
-    }
-    /**
-   * Read a value from storage.
-   * 1. Check cache.
-   * 2. Check parent cache.
-   * 3. Fall back to the host state.
-   * 4. Not found! Value has never been written to before. Flag it as non-existent and return value zero.
-   *
-   * @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 exists: whether the slot has EVER been written to before, value: the latest value written to slot, or 0 if never written to before
-   */ async read(contractAddress, slot) {
-        let cached = false;
-        // Check this cache and parent's (recursively)
-        let value = this.readHereOrParent(contractAddress, slot);
-        // Finally try the host's Aztec state (a trip to the database)
-        if (!value) {
-            // This functions returns Fr.ZERO if it has never been written to before
-            // we explicity coalesce to Fr.ZERO in case we have some implementations that cause this to return undefined
-            value = await this.hostPublicStorage.storageRead(contractAddress, slot) ?? Fr.ZERO;
-        // TODO(dbanks12): if value retrieved from host storage, we can cache it here
-        // any future reads to the same slot can read from cache instead of more expensive
-        // DB access
-        } else {
-            cached = true;
-        }
-        // if value is Fr.ZERO here, it that means this slot has never been written to!
-        return Promise.resolve({
-            value,
-            cached
-        });
-    }
-    /**
-   * Stage a storage 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
-   */ write(contractAddress, slot, value) {
-        this.cache.write(contractAddress, slot, value);
-    }
-    /**
-   * Merges another PublicStorage's cache (pending writes) into this one.
-   *
-   * @param incomingPublicStorage - the incoming public storage to merge into this instance's
-   */ acceptAndMerge(incomingPublicStorage) {
-        this.cache.acceptAndMerge(incomingPublicStorage.cache);
-    }
-}
-/**
- * A class to cache writes to public storage during a contract call's AVM simulation.
- * "Writes" update a map, "reads" check that map or return undefined.
- * An instance of this class can merge another instance's staged writes into its own.
- */ class PublicStorageCache {
-    /**
-   * Map for staging storage writes.
-   * One inner-map per contract storage address,
-   * mapping storage slot to latest staged write value.
-   */ cachePerContract = new Map();
-    /**
-   * Read a staged value from storage, if it has been previously written to.
-   *
-   * @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 undefined if no value has been written
-   */ read(contractAddress, slot) {
-        return this.cachePerContract.get(contractAddress.toBigInt())?.get(slot.toBigInt());
-    }
-    /**
-   * Stage a storage 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
-   */ write(contractAddress, slot, value) {
-        let cacheAtContract = this.cachePerContract.get(contractAddress.toBigInt());
-        if (!cacheAtContract) {
-            // If this contract's storage has no staged modifications, create a new inner map to store them
-            cacheAtContract = new Map();
-            this.cachePerContract.set(contractAddress.toBigInt(), cacheAtContract);
-        }
-        cacheAtContract.set(slot.toBigInt(), value);
-    }
-    /**
-   * Merges another cache's staged writes into this instance's cache.
-   *
-   * Staged modifications in "incoming" take precedence over those
-   * present in "this" as they are assumed to occur after this' writes.
-   *
-   * In practice, "this" is a parent call's storage cache, and "incoming" is a nested call's.
-   *
-   * @param incomingStorageCache - the incoming storage write cache to merge into this instance's
-   */ acceptAndMerge(incomingStorageCache) {
-        // Iterate over all incoming contracts with staged writes.
-        for (const [incomingAddress, incomingCacheAtContract] of incomingStorageCache.cachePerContract){
-            const thisCacheAtContract = this.cachePerContract.get(incomingAddress);
-            if (!thisCacheAtContract) {
-                // The contract has no storage writes staged here
-                // so just accept the incoming cache as-is for this contract.
-                this.cachePerContract.set(incomingAddress, incomingCacheAtContract);
-            } else {
-                // "Incoming" and "this" both have staged writes for this contract.
-                // Merge in incoming staged writes, giving them precedence over this'.
-                for (const [slot, value] of incomingCacheAtContract){
-                    thisCacheAtContract.set(slot, value);
-                }
-            }
-        }
-    }
-}