@aztec/simulator 0.0.0-test.0 → 0.0.1-commit.24de95ac

package/dest/public/fixtures/utils.js

@@ -1,84 +1,129 @@
-import { CONTRACT_CLASS_LOG_DATA_SIZE_IN_FIELDS, DEFAULT_GAS_LIMIT, DEPLOYER_CONTRACT_ADDRESS, MAX_L2_GAS_PER_TX_PUBLIC_PORTION, PRIVATE_LOG_SIZE_IN_FIELDS, REGISTERER_CONTRACT_ADDRESS, REGISTERER_CONTRACT_CLASS_REGISTERED_MAGIC_VALUE } from '@aztec/constants';
+import { CONTRACT_CLASS_PUBLISHED_MAGIC_VALUE, CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS, CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS, DEFAULT_DA_GAS_LIMIT, DEFAULT_L2_GAS_LIMIT, DEFAULT_TEARDOWN_DA_GAS_LIMIT, DEFAULT_TEARDOWN_L2_GAS_LIMIT, PRIVATE_LOG_SIZE_IN_FIELDS } from '@aztec/constants';
+import { padArrayEnd } from '@aztec/foundation/collection';
 import { Fr } from '@aztec/foundation/fields';
-import { assertLength } from '@aztec/foundation/serialize';
-import { DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_TAG } from '@aztec/protocol-contracts';
+import { CONTRACT_INSTANCE_PUBLISHED_EVENT_TAG } from '@aztec/protocol-contracts';
 import { bufferAsFields } from '@aztec/stdlib/abi';
 import { AztecAddress } from '@aztec/stdlib/aztec-address';
 import { Gas, GasFees, GasSettings } from '@aztec/stdlib/gas';
 import { siloNullifier } from '@aztec/stdlib/hash';
-import { PartialPrivateTailPublicInputsForPublic, PartialPrivateTailPublicInputsForRollup, PrivateKernelTailCircuitPublicInputs, RollupValidationRequests, ScopedLogHash, countAccumulatedItems } from '@aztec/stdlib/kernel';
-import { ContractClassLog, PrivateLog } from '@aztec/stdlib/logs';
-import { Tx } from '@aztec/stdlib/tx';
-import { BlockHeader, TxConstantData, TxContext } from '@aztec/stdlib/tx';
+import { LogHash, PartialPrivateTailPublicInputsForPublic, PartialPrivateTailPublicInputsForRollup, PrivateKernelTailCircuitPublicInputs, countAccumulatedItems } from '@aztec/stdlib/kernel';
+import { ContractClassLogFields, PrivateLog } from '@aztec/stdlib/logs';
+import { ChonkProof } from '@aztec/stdlib/proofs';
+import { BlockHeader, GlobalVariables, HashedValues, Tx, TxConstantData, TxContext } from '@aztec/stdlib/tx';
 import { strict as assert } from 'assert';
 /**
  * Craft a carrier transaction for some public calls for simulation by PublicTxSimulator.
- */ export async function createTxForPublicCalls(firstNullifier, setupExecutionRequests, appExecutionRequests, teardownExecutionRequest, feePayer = AztecAddress.zero(), gasUsedByPrivate = Gas.empty()) {
-    assert(setupExecutionRequests.length > 0 || appExecutionRequests.length > 0 || teardownExecutionRequest !== undefined, "Can't create public tx with no enqueued calls");
-    const setupCallRequests = await Promise.all(setupExecutionRequests.map((er)=>er.toCallRequest()));
-    const appCallRequests = await Promise.all(appExecutionRequests.map((er)=>er.toCallRequest()));
+ */ export async function createTxForPublicCalls(privateInsertions, setupCallRequests, appCallRequests, teardownCallRequest, feePayer = AztecAddress.zero(), gasUsedByPrivate = Gas.empty(), globals = GlobalVariables.empty()) {
+    assert(setupCallRequests.length > 0 || appCallRequests.length > 0 || teardownCallRequest !== undefined, "Can't create public tx with no enqueued calls");
     // use max limits
-    const gasLimits = new Gas(DEFAULT_GAS_LIMIT, MAX_L2_GAS_PER_TX_PUBLIC_PORTION);
+    const gasLimits = new Gas(DEFAULT_DA_GAS_LIMIT, DEFAULT_L2_GAS_LIMIT);
     const forPublic = PartialPrivateTailPublicInputsForPublic.empty();
-    // TODO(#9269): Remove this fake nullifier method as we move away from 1st nullifier as hash.
-    forPublic.nonRevertibleAccumulatedData.nullifiers[0] = firstNullifier;
-    // We reverse order because the simulator expects it to be like a "stack" of calls to pop from
-    for(let i = setupCallRequests.length - 1; i >= 0; i--){
-        forPublic.nonRevertibleAccumulatedData.publicCallRequests[i] = setupCallRequests[i];
+    // Non revertible private insertions
+    if (!privateInsertions.nonRevertible?.nullifiers?.length) {
+        throw new Error('At least one non-revertible nullifier is required');
     }
-    for(let i = appCallRequests.length - 1; i >= 0; i--){
-        forPublic.revertibleAccumulatedData.publicCallRequests[i] = appCallRequests[i];
+    for(let i = 0; i < privateInsertions.nonRevertible.nullifiers.length; i++){
+        assert(i < forPublic.nonRevertibleAccumulatedData.nullifiers.length, 'Nullifier index out of bounds');
+        forPublic.nonRevertibleAccumulatedData.nullifiers[i] = privateInsertions.nonRevertible.nullifiers[i];
     }
-    if (teardownExecutionRequest) {
-        forPublic.publicTeardownCallRequest = await teardownExecutionRequest.toCallRequest();
+    if (privateInsertions.nonRevertible.noteHashes) {
+        for(let i = 0; i < privateInsertions.nonRevertible.noteHashes.length; i++){
+            assert(i < forPublic.nonRevertibleAccumulatedData.noteHashes.length, 'Note hash index out of bounds');
+            forPublic.nonRevertibleAccumulatedData.noteHashes[i] = privateInsertions.nonRevertible.noteHashes[i];
+        }
+    }
+    if (privateInsertions.nonRevertible.l2ToL1Msgs) {
+        for(let i = 0; i < privateInsertions.nonRevertible.l2ToL1Msgs.length; i++){
+            assert(i < forPublic.nonRevertibleAccumulatedData.l2ToL1Msgs.length, 'L2 to L1 message index out of bounds');
+            forPublic.nonRevertibleAccumulatedData.l2ToL1Msgs[i] = privateInsertions.nonRevertible.l2ToL1Msgs[i];
+        }
+    }
+    // Revertible private insertions
+    if (privateInsertions.revertible) {
+        if (privateInsertions.revertible.noteHashes) {
+            for(let i = 0; i < privateInsertions.revertible.noteHashes.length; i++){
+                assert(i < forPublic.revertibleAccumulatedData.noteHashes.length, 'Note hash index out of bounds');
+                forPublic.revertibleAccumulatedData.noteHashes[i] = privateInsertions.revertible.noteHashes[i];
+            }
+        }
+        if (privateInsertions.revertible.nullifiers) {
+            for(let i = 0; i < privateInsertions.revertible.nullifiers.length; i++){
+                assert(i < forPublic.revertibleAccumulatedData.nullifiers.length, 'Nullifier index out of bounds');
+                forPublic.revertibleAccumulatedData.nullifiers[i] = privateInsertions.revertible.nullifiers[i];
+            }
+        }
+        if (privateInsertions.revertible.l2ToL1Msgs) {
+            for(let i = 0; i < privateInsertions.revertible.l2ToL1Msgs.length; i++){
+                assert(i < forPublic.revertibleAccumulatedData.l2ToL1Msgs.length, 'L2 to L1 message index out of bounds');
+                forPublic.revertibleAccumulatedData.l2ToL1Msgs[i] = privateInsertions.revertible.l2ToL1Msgs[i];
+            }
+        }
+    }
+    for(let i = 0; i < setupCallRequests.length; i++){
+        forPublic.nonRevertibleAccumulatedData.publicCallRequests[i] = setupCallRequests[i].request;
+    }
+    for(let i = 0; i < appCallRequests.length; i++){
+        forPublic.revertibleAccumulatedData.publicCallRequests[i] = appCallRequests[i].request;
+    }
+    if (teardownCallRequest) {
+        forPublic.publicTeardownCallRequest = teardownCallRequest.request;
     }
     const maxFeesPerGas = feePayer.isZero() ? GasFees.empty() : new GasFees(10, 10);
-    const teardownGasLimits = teardownExecutionRequest ? gasLimits : Gas.empty();
+    const teardownGasLimits = teardownCallRequest ? new Gas(DEFAULT_TEARDOWN_DA_GAS_LIMIT, DEFAULT_TEARDOWN_L2_GAS_LIMIT) : Gas.empty();
     const gasSettings = new GasSettings(gasLimits, teardownGasLimits, maxFeesPerGas, GasFees.empty());
     const txContext = new TxContext(Fr.zero(), Fr.zero(), gasSettings);
-    const constantData = new TxConstantData(BlockHeader.empty(), txContext, Fr.zero(), Fr.zero());
-    const txData = new PrivateKernelTailCircuitPublicInputs(constantData, RollupValidationRequests.empty(), /*gasUsed=*/ gasUsedByPrivate, feePayer, forPublic);
-    const tx = Tx.newWithTxData(txData, teardownExecutionRequest);
-    // Reverse order because the simulator expects it to be like a "stack" of calls to pop from.
-    // Also push app calls before setup calls for this reason.
-    for(let i = appExecutionRequests.length - 1; i >= 0; i--){
-        tx.enqueuedPublicFunctionCalls.push(appExecutionRequests[i]);
-    }
-    for(let i = setupExecutionRequests.length - 1; i >= 0; i--){
-        tx.enqueuedPublicFunctionCalls.push(setupExecutionRequests[i]);
-    }
-    return tx;
+    const header = BlockHeader.empty();
+    header.globalVariables = globals;
+    const constantData = new TxConstantData(header, txContext, Fr.zero(), Fr.zero());
+    const includeByTimestamp = 0n; // Not used in the simulator.
+    const txData = new PrivateKernelTailCircuitPublicInputs(constantData, /*gasUsed=*/ gasUsedByPrivate, feePayer, includeByTimestamp, forPublic);
+    const calldata = [
+        ...setupCallRequests,
+        ...appCallRequests,
+        ...teardownCallRequest ? [
+            teardownCallRequest
+        ] : []
+    ].map((r)=>new HashedValues(r.calldata, r.request.calldataHash));
+    return await Tx.create({
+        data: txData,
+        chonkProof: ChonkProof.random(),
+        contractClassLogFields: [],
+        publicFunctionCalldata: calldata
+    });
 }
-export function createTxForPrivateOnly(feePayer = AztecAddress.zero(), gasUsedByPrivate = new Gas(10, 10)) {
+export async function createTxForPrivateOnly(feePayer = AztecAddress.zero(), gasUsedByPrivate = new Gas(10, 10)) {
     // use max limits
-    const gasLimits = new Gas(DEFAULT_GAS_LIMIT, MAX_L2_GAS_PER_TX_PUBLIC_PORTION);
+    const gasLimits = new Gas(DEFAULT_DA_GAS_LIMIT, DEFAULT_L2_GAS_LIMIT);
     const forRollup = PartialPrivateTailPublicInputsForRollup.empty();
     const maxFeesPerGas = feePayer.isZero() ? GasFees.empty() : new GasFees(10, 10);
     const gasSettings = new GasSettings(gasLimits, Gas.empty(), maxFeesPerGas, GasFees.empty());
     const txContext = new TxContext(Fr.zero(), Fr.zero(), gasSettings);
     const constantData = new TxConstantData(BlockHeader.empty(), txContext, Fr.zero(), Fr.zero());
-    const txData = new PrivateKernelTailCircuitPublicInputs(constantData, RollupValidationRequests.empty(), /*gasUsed=*/ gasUsedByPrivate, feePayer, /*forPublic=*/ undefined, forRollup);
-    return Tx.newWithTxData(txData);
+    const includeByTimestamp = 0n; // Not used in the simulator.
+    const txData = new PrivateKernelTailCircuitPublicInputs(constantData, /*gasUsed=*/ gasUsedByPrivate, feePayer, includeByTimestamp, /*forPublic=*/ undefined, forRollup);
+    return await Tx.create({
+        data: txData,
+        chonkProof: ChonkProof.empty(),
+        contractClassLogFields: [],
+        publicFunctionCalldata: []
+    });
 }
 export async function addNewContractClassToTx(tx, contractClass, skipNullifierInsertion = false) {
     const contractClassLogFields = [
-        new Fr(REGISTERER_CONTRACT_CLASS_REGISTERED_MAGIC_VALUE),
+        new Fr(CONTRACT_CLASS_PUBLISHED_MAGIC_VALUE),
         contractClass.id,
         new Fr(contractClass.version),
         new Fr(contractClass.artifactHash),
         new Fr(contractClass.privateFunctionsRoot),
         ...bufferAsFields(contractClass.packedBytecode, Math.ceil(contractClass.packedBytecode.length / 31) + 1)
     ];
-    const contractClassLog = ContractClassLog.fromFields([
-        new Fr(REGISTERER_CONTRACT_ADDRESS),
-        ...contractClassLogFields.concat(new Array(CONTRACT_CLASS_LOG_DATA_SIZE_IN_FIELDS - contractClassLogFields.length).fill(Fr.ZERO))
-    ]);
-    const contractClassLogHash = ScopedLogHash.fromFields([
-        await contractClassLog.hash(),
-        new Fr(7),
-        new Fr(contractClassLog.getEmittedLength()),
-        new Fr(REGISTERER_CONTRACT_ADDRESS)
-    ]);
+    const contractAddress = new AztecAddress(new Fr(CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS));
+    const emittedLength = contractClassLogFields.length;
+    const logFields = ContractClassLogFields.fromEmittedFields(contractClassLogFields);
+    const contractClassLogHash = LogHash.from({
+        value: await logFields.hash(),
+        length: emittedLength
+    }).scope(contractAddress);
     const accumulatedData = tx.data.forPublic ? tx.data.forPublic.revertibleAccumulatedData : tx.data.forRollup.end;
     if (!skipNullifierInsertion) {
         const nextNullifierIndex = countAccumulatedItems(accumulatedData.nullifiers);
@@ -86,7 +131,7 @@ export async function addNewContractClassToTx(tx, contractClass, skipNullifierIn
     }
     const nextLogIndex = countAccumulatedItems(accumulatedData.contractClassLogsHashes);
     accumulatedData.contractClassLogsHashes[nextLogIndex] = contractClassLogHash;
-    tx.contractClassLogs.push(contractClassLog);
+    tx.contractClassLogFields.push(logFields);
 }
 export async function addNewContractInstanceToTx(tx, contractInstance, skipNullifierInsertion = false) {
     // can't use publicKeys.toFields() because it includes isInfinite which
@@ -101,21 +146,18 @@ export async function addNewContractInstanceToTx(tx, contractInstance, skipNulli
         contractInstance.publicKeys.masterTaggingPublicKey.x,
         contractInstance.publicKeys.masterTaggingPublicKey.y
     ];
-    const fields = [
-        DEPLOYER_CONTRACT_INSTANCE_DEPLOYED_TAG,
+    const logFields = [
+        CONTRACT_INSTANCE_PUBLISHED_EVENT_TAG,
         contractInstance.address.toField(),
         new Fr(contractInstance.version),
         new Fr(contractInstance.salt),
         contractInstance.currentContractClassId,
         contractInstance.initializationHash,
         ...publicKeysAsFields,
-        contractInstance.deployer.toField(),
-        new Fr(0),
-        new Fr(0),
-        new Fr(0)
+        contractInstance.deployer.toField()
     ];
-    const contractInstanceLog = new PrivateLog(assertLength(fields, PRIVATE_LOG_SIZE_IN_FIELDS));
-    const contractAddressNullifier = await siloNullifier(AztecAddress.fromNumber(DEPLOYER_CONTRACT_ADDRESS), contractInstance.address.toField());
+    const contractInstanceLog = new PrivateLog(padArrayEnd(logFields, Fr.ZERO, PRIVATE_LOG_SIZE_IN_FIELDS), logFields.length);
+    const contractAddressNullifier = await siloNullifier(AztecAddress.fromNumber(CONTRACT_INSTANCE_REGISTRY_CONTRACT_ADDRESS), contractInstance.address.toField());
     const accumulatedData = tx.data.forPublic ? tx.data.forPublic.revertibleAccumulatedData : tx.data.forRollup.end;
     if (!skipNullifierInsertion) {
         const nextNullifierIndex = countAccumulatedItems(accumulatedData.nullifiers);

package/dest/public/hinting_db_sources.d.ts

@@ -0,0 +1,70 @@
+import { Fr } from '@aztec/foundation/fields';
+import type { IndexedTreeLeafPreimage, SiblingPath } from '@aztec/foundation/trees';
+import type { FunctionSelector } from '@aztec/stdlib/abi';
+import { type AvmExecutionHints } from '@aztec/stdlib/avm';
+import type { AztecAddress } from '@aztec/stdlib/aztec-address';
+import type { ContractClassPublic, ContractInstanceWithAddress } from '@aztec/stdlib/contract';
+import { type BatchInsertionResult, type IndexedTreeId, MerkleTreeId, type MerkleTreeLeafType, type MerkleTreeWriteOperations, type SequentialInsertionResult, type TreeHeights } from '@aztec/stdlib/trees';
+import type { UInt64 } from '@aztec/stdlib/types';
+import type { WorldStateRevision } from '@aztec/stdlib/world-state';
+import type { PublicContractsDBInterface } from './db_interfaces.js';
+/**
+ * A public contracts database that forwards requests and collects AVM hints.
+ */
+export declare class HintingPublicContractsDB implements PublicContractsDBInterface {
+    private readonly db;
+    private hints;
+    private contractClassIds;
+    constructor(db: PublicContractsDBInterface, hints: AvmExecutionHints);
+    getContractInstance(address: AztecAddress, timestamp: UInt64): Promise<ContractInstanceWithAddress | undefined>;
+    getContractClass(contractClassId: Fr): Promise<ContractClassPublic | undefined>;
+    getBytecodeCommitment(contractClassId: Fr): Promise<Fr | undefined>;
+    getDebugFunctionName(contractAddress: AztecAddress, selector: FunctionSelector): Promise<string | undefined>;
+}
+/**
+ * A low-level merkle DB that collects hints.
+ */
+export declare class HintingMerkleWriteOperations implements MerkleTreeWriteOperations {
+    private db;
+    private hints;
+    private static readonly log;
+    private checkpointStack;
+    private nextCheckpointId;
+    private checkpointActionCounter;
+    static create(db: MerkleTreeWriteOperations, hints: AvmExecutionHints): Promise<HintingMerkleWriteOperations>;
+    private constructor();
+    getSiblingPath<ID extends MerkleTreeId>(treeId: ID, index: bigint): Promise<SiblingPath<TreeHeights[ID]>>;
+    getPreviousValueIndex<ID extends IndexedTreeId>(treeId: ID, value: bigint): Promise<{
+        index: bigint;
+        alreadyPresent: boolean;
+    } | undefined>;
+    getLeafPreimage<ID extends IndexedTreeId>(treeId: ID, index: bigint): Promise<IndexedTreeLeafPreimage | undefined>;
+    getLeafValue<ID extends MerkleTreeId>(treeId: ID, index: bigint): Promise<MerkleTreeLeafType<typeof treeId> | undefined>;
+    sequentialInsert<TreeHeight extends number, ID extends IndexedTreeId>(treeId: ID, leaves: Buffer[]): Promise<SequentialInsertionResult<TreeHeight>>;
+    appendLeaves<ID extends MerkleTreeId>(treeId: ID, leaves: MerkleTreeLeafType<ID>[]): Promise<void>;
+    createCheckpoint(): Promise<void>;
+    commitAllCheckpoints(): Promise<void>;
+    revertAllCheckpoints(): Promise<void>;
+    commitCheckpoint(): Promise<void>;
+    revertCheckpoint(): Promise<void>;
+    private getHintKey;
+    private getCurrentCheckpointId;
+    private getTreesStateHash;
+    private static logTreeChange;
+    private appendLeafInternal;
+    getTreeInfo(treeId: MerkleTreeId): Promise<import("@aztec/stdlib/trees").TreeInfo>;
+    getStateReference(): Promise<import("@aztec/stdlib/tx").StateReference>;
+    getInitialHeader(): import("@aztec/stdlib/tx").BlockHeader;
+    getRevision(): WorldStateRevision;
+    updateArchive(header: any): Promise<void>;
+    batchInsert<TreeHeight extends number, SubtreeSiblingPathHeight extends number, ID extends IndexedTreeId>(treeId: ID, leaves: Buffer[], subtreeHeight: number): Promise<BatchInsertionResult<TreeHeight, SubtreeSiblingPathHeight>>;
+    close(): Promise<void>;
+    findLeafIndices<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[]): Promise<(bigint | undefined)[]>;
+    findSiblingPaths<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[]): Promise<({
+        path: SiblingPath<TreeHeights[ID]>;
+        index: bigint;
+    } | undefined)[]>;
+    findLeafIndicesAfter<ID extends MerkleTreeId>(treeId: ID, values: MerkleTreeLeafType<ID>[], startIndex: bigint): Promise<(bigint | undefined)[]>;
+    getBlockNumbersForLeafIndices<ID extends MerkleTreeId>(treeId: ID, leafIndices: bigint[]): Promise<(bigint | undefined)[]>;
+}
+//# sourceMappingURL=hinting_db_sources.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hinting_db_sources.d.ts","sourceRoot":"","sources":["../../src/public/hinting_db_sources.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,EAAE,EAAE,MAAM,0BAA0B,CAAC;AAE9C,OAAO,KAAK,EAAE,uBAAuB,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACpF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAOL,KAAK,iBAAiB,EASvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,MAAM,wBAAwB,CAAC;AAC/F,OAAO,EAEL,KAAK,oBAAoB,EACzB,KAAK,aAAa,EAClB,YAAY,EACZ,KAAK,kBAAkB,EACvB,KAAK,yBAAyB,EAK9B,KAAK,yBAAyB,EAC9B,KAAK,WAAW,EAGjB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAClD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAIpE,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,oBAAoB,CAAC;AAErE;;GAEG;AACH,qBAAa,wBAAyB,YAAW,0BAA0B;IAKvE,OAAO,CAAC,QAAQ,CAAC,EAAE;IACnB,OAAO,CAAC,KAAK;IAJf,OAAO,CAAC,gBAAgB,CAA0B;gBAG/B,EAAE,EAAE,0BAA0B,EACvC,KAAK,EAAE,iBAAiB;IAGrB,mBAAmB,CAC9B,OAAO,EAAE,YAAY,EACrB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,2BAA2B,GAAG,SAAS,CAAC;IAmBtC,gBAAgB,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC;IAgB/E,qBAAqB,CAAC,eAAe,EAAE,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS,CAAC;IAQnE,oBAAoB,CAC/B,eAAe,EAAE,YAAY,EAC7B,QAAQ,EAAE,gBAAgB,GACzB,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;CAG/B;AAED;;GAEG;AACH,qBAAa,4BAA6B,YAAW,yBAAyB;IAyB1E,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,KAAK;IAzBf,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAuD;IAKlF,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,gBAAgB,CAAa;IACrC,OAAO,CAAC,uBAAuB,CAAa;WAExB,MAAM,CAAC,EAAE,EAAE,yBAAyB,EAAE,KAAK,EAAE,iBAAiB;IAclF,OAAO;IAMM,cAAc,CAAC,EAAE,SAAS,YAAY,EACjD,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;IAO3B,qBAAqB,CAAC,EAAE,SAAS,aAAa,EACzD,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CACN;QACE,KAAK,EAAE,MAAM,CAAC;QACd,cAAc,EAAE,OAAO,CAAC;KACzB,GACD,SAAS,CACZ;IAgBY,eAAe,CAAC,EAAE,SAAS,aAAa,EACnD,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,uBAAuB,GAAG,SAAS,CAAC;IA0BlC,YAAY,CAAC,EAAE,SAAS,YAAY,EAC/C,MAAM,EAAE,EAAE,EACV,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,CAAC,OAAO,MAAM,CAAC,GAAG,SAAS,CAAC;IAiB5C,gBAAgB,CAAC,UAAU,SAAS,MAAM,EAAE,EAAE,SAAS,aAAa,EAC/E,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,MAAM,EAAE,GACf,OAAO,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAC;IA8DpC,YAAY,CAAC,EAAE,SAAS,YAAY,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBlG,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC;IAgBvC,oBAAoB,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrC,oBAAoB,IAAI,OAAO,CAAC,IAAI,CAAC;IAI/B,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC;IAgBjC,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC;YAsChC,UAAU;IAKxB,OAAO,CAAC,sBAAsB;YAKhB,iBAAiB;IAK/B,OAAO,CAAC,MAAM,CAAC,aAAa;YAYd,kBAAkB;IAqBnB,WAAW,CAAC,MAAM,EAAE,YAAY;IAIhC,iBAAiB;IAIvB,gBAAgB;IAIhB,WAAW,IAAI,kBAAkB;IAI3B,aAAa,CAAC,MAAM,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzC,WAAW,CACtB,UAAU,SAAS,MAAM,EACzB,wBAAwB,SAAS,MAAM,EACvC,EAAE,SAAS,aAAa,EAExB,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,MAAM,EAAE,EAChB,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAAC;IAIzD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,eAAe,CAAC,EAAE,SAAS,YAAY,EAClD,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAC/B,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAI3B,gBAAgB,CAAC,EAAE,SAAS,YAAY,EAC7C,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,GAC/B,OAAO,CAAC,CAAC;QAAE,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC,EAAE,CAAC;IAIpE,oBAAoB,CAAC,EAAE,SAAS,YAAY,EACvD,MAAM,EAAE,EAAE,EACV,MAAM,EAAE,kBAAkB,CAAC,EAAE,CAAC,EAAE,EAChC,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAIrB,6BAA6B,CAAC,EAAE,SAAS,YAAY,EAChE,MAAM,EAAE,EAAE,EACV,WAAW,EAAE,MAAM,EAAE,GACpB,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;CAGnC"}

package/dest/public/hinting_db_sources.js

@@ -0,0 +1,297 @@
+import { sha256Trunc } from '@aztec/foundation/crypto';
+import { Fr } from '@aztec/foundation/fields';
+import { createLogger } from '@aztec/foundation/log';
+import { AvmAppendLeavesHint, AvmBytecodeCommitmentHint, AvmCommitCheckpointHint, AvmContractClassHint, AvmContractInstanceHint, AvmCreateCheckpointHint, AvmGetLeafPreimageHintNullifierTree, AvmGetLeafPreimageHintPublicDataTree, AvmGetLeafValueHint, AvmGetPreviousValueIndexHint, AvmGetSiblingPathHint, AvmRevertCheckpointHint, AvmSequentialInsertHintNullifierTree, AvmSequentialInsertHintPublicDataTree } from '@aztec/stdlib/avm';
+import { AppendOnlyTreeSnapshot, MerkleTreeId, NullifierLeaf, PublicDataTreeLeaf, getTreeName, merkleTreeIds } from '@aztec/stdlib/trees';
+import { TreeSnapshots } from '@aztec/stdlib/tx';
+import { strict as assert } from 'assert';
+/**
+ * A public contracts database that forwards requests and collects AVM hints.
+ */ export class HintingPublicContractsDB {
+    db;
+    hints;
+    // We deduplicate contract classes because they include the whole bytecode.
+    contractClassIds;
+    constructor(db, hints){
+        this.db = db;
+        this.hints = hints;
+        this.contractClassIds = new Set();
+    }
+    async getContractInstance(address, timestamp) {
+        const instance = await this.db.getContractInstance(address, timestamp);
+        if (instance) {
+            // We don't need to hint the block number because it doesn't change.
+            this.hints.contractInstances.push(new AvmContractInstanceHint(instance.address, instance.salt, instance.deployer, instance.currentContractClassId, instance.originalContractClassId, instance.initializationHash, instance.publicKeys));
+        }
+        return instance;
+    }
+    async getContractClass(contractClassId) {
+        const contractClass = await this.db.getContractClass(contractClassId);
+        if (contractClass && !this.contractClassIds.has(contractClassId.toBigInt())) {
+            this.contractClassIds.add(contractClassId.toBigInt());
+            this.hints.contractClasses.push(new AvmContractClassHint(contractClass.id, contractClass.artifactHash, contractClass.privateFunctionsRoot, contractClass.packedBytecode));
+        }
+        return contractClass;
+    }
+    async getBytecodeCommitment(contractClassId) {
+        const commitment = await this.db.getBytecodeCommitment(contractClassId);
+        if (commitment) {
+            this.hints.bytecodeCommitments.push(new AvmBytecodeCommitmentHint(contractClassId, commitment));
+        }
+        return commitment;
+    }
+    async getDebugFunctionName(contractAddress, selector) {
+        return await this.db.getDebugFunctionName(contractAddress, selector);
+    }
+}
+/**
+ * A low-level merkle DB that collects hints.
+ */ export class HintingMerkleWriteOperations {
+    db;
+    hints;
+    static log = createLogger('simulator:hinting-merkle-db');
+    // This stack is only for debugging purposes.
+    // The top of the stack is the current checkpoint id.
+    // We need the stack to be non-empty and use 0 as an arbitrary initial checkpoint id.
+    // This is not necessarily a checkpoint that happened, but whatever tree state we start with.
+    checkpointStack;
+    nextCheckpointId;
+    checkpointActionCounter;
+    static async create(db, hints) {
+        const hintingTreesDB = new HintingMerkleWriteOperations(db, hints);
+        const startStateReference = await db.getStateReference();
+        hints.startingTreeRoots = new TreeSnapshots(startStateReference.l1ToL2MessageTree, startStateReference.partial.noteHashTree, startStateReference.partial.nullifierTree, startStateReference.partial.publicDataTree);
+        return hintingTreesDB;
+    }
+    // Use create() to instantiate.
+    constructor(db, hints){
+        this.db = db;
+        this.hints = hints;
+        this.checkpointStack = [
+            0
+        ];
+        this.nextCheckpointId = 1;
+        this.checkpointActionCounter = 0;
+    }
+    // Getters.
+    async getSiblingPath(treeId, index) {
+        const path = await this.db.getSiblingPath(treeId, index);
+        const key = await this.getHintKey(treeId);
+        this.hints.getSiblingPathHints.push(new AvmGetSiblingPathHint(key, treeId, index, path.toFields()));
+        return Promise.resolve(path);
+    }
+    async getPreviousValueIndex(treeId, value) {
+        const result = await this.db.getPreviousValueIndex(treeId, value);
+        if (result === undefined) {
+            throw new Error(`getPreviousValueIndex(${getTreeName(treeId)}, ${value}}) returned undefined. Possible wrong tree setup or corrupted state.`);
+        }
+        const key = await this.getHintKey(treeId);
+        this.hints.getPreviousValueIndexHints.push(new AvmGetPreviousValueIndexHint(key, treeId, new Fr(value), result.index, result.alreadyPresent));
+        return result;
+    }
+    async getLeafPreimage(treeId, index) {
+        const preimage = await this.db.getLeafPreimage(treeId, index);
+        if (preimage) {
+            const key = await this.getHintKey(treeId);
+            switch(treeId){
+                case MerkleTreeId.PUBLIC_DATA_TREE:
+                    this.hints.getLeafPreimageHintsPublicDataTree.push(new AvmGetLeafPreimageHintPublicDataTree(key, index, preimage));
+                    break;
+                case MerkleTreeId.NULLIFIER_TREE:
+                    this.hints.getLeafPreimageHintsNullifierTree.push(new AvmGetLeafPreimageHintNullifierTree(key, index, preimage));
+                    break;
+                default:
+                    // Use getLeafValue for the other trees.
+                    throw new Error('getLeafPreimage only supported for PublicDataTree and NullifierTree!');
+                    break;
+            }
+        }
+        return preimage;
+    }
+    async getLeafValue(treeId, index) {
+        // Use getLeafPreimage for PublicDataTree and NullifierTree.
+        assert(treeId == MerkleTreeId.NOTE_HASH_TREE || treeId == MerkleTreeId.L1_TO_L2_MESSAGE_TREE);
+        const value = await this.db.getLeafValue(treeId, index);
+        if (value) {
+            const key = await this.getHintKey(treeId);
+            // We can cast to Fr because we know the type of the tree.
+            this.hints.getLeafValueHints.push(new AvmGetLeafValueHint(key, treeId, index, value));
+        }
+        return value;
+    }
+    // State modification.
+    // FIXME(fcarreiro): This is a horrible interface (in the merkle ops). It's receiving the leaves as buffers,
+    // from a leaf class that is NOT the one that will be used to write. Make this type safe.
+    async sequentialInsert(treeId, leaves) {
+        // Use appendLeaf for NoteHashTree and L1ToL2MessageTree.
+        assert(treeId == MerkleTreeId.PUBLIC_DATA_TREE || treeId == MerkleTreeId.NULLIFIER_TREE);
+        // We only support 1 leaf at a time for now. Can easily be extended.
+        assert(leaves.length === 1, 'sequentialInsert supports only one leaf at a time!');
+        const beforeState = await this.getHintKey(treeId);
+        const result = await this.db.sequentialInsert(treeId, leaves);
+        const afterState = await this.getHintKey(treeId);
+        HintingMerkleWriteOperations.logTreeChange('sequentialInsert', beforeState, afterState, treeId);
+        switch(treeId){
+            case MerkleTreeId.PUBLIC_DATA_TREE:
+                this.hints.sequentialInsertHintsPublicDataTree.push(new AvmSequentialInsertHintPublicDataTree(beforeState, afterState, treeId, PublicDataTreeLeaf.fromBuffer(leaves[0]), {
+                    leaf: result.lowLeavesWitnessData[0].leafPreimage,
+                    index: result.lowLeavesWitnessData[0].index,
+                    path: result.lowLeavesWitnessData[0].siblingPath.toFields()
+                }, {
+                    leaf: result.insertionWitnessData[0].leafPreimage,
+                    index: result.insertionWitnessData[0].index,
+                    path: result.insertionWitnessData[0].siblingPath.toFields()
+                }));
+                break;
+            case MerkleTreeId.NULLIFIER_TREE:
+                this.hints.sequentialInsertHintsNullifierTree.push(new AvmSequentialInsertHintNullifierTree(beforeState, afterState, treeId, NullifierLeaf.fromBuffer(leaves[0]), {
+                    leaf: result.lowLeavesWitnessData[0].leafPreimage,
+                    index: result.lowLeavesWitnessData[0].index,
+                    path: result.lowLeavesWitnessData[0].siblingPath.toFields()
+                }, {
+                    leaf: result.insertionWitnessData[0].leafPreimage,
+                    index: result.insertionWitnessData[0].index,
+                    path: result.insertionWitnessData[0].siblingPath.toFields()
+                }));
+                break;
+            default:
+                throw new Error('sequentialInsert only supported for PublicDataTree and NullifierTree!');
+                break;
+        }
+        return result;
+    }
+    async appendLeaves(treeId, leaves) {
+        // Use sequentialInsert for PublicDataTree and NullifierTree.
+        assert(treeId == MerkleTreeId.NOTE_HASH_TREE || treeId == MerkleTreeId.L1_TO_L2_MESSAGE_TREE);
+        // We need to process each leaf individually because we need the sibling path after insertion, to be able to constraint the insertion.
+        // TODO(https://github.com/AztecProtocol/aztec-packages/issues/13380): This can be changed if the world state appendLeaves returns the sibling paths.
+        if (leaves.length === 1) {
+            await this.appendLeafInternal(treeId, leaves[0]);
+            return;
+        } else {
+            // TODO(dbanks12): NON-HINTING! We skip hinting here for now because:
+            // 1. We only ever append multiple leaves (for now) when padding (all empty leaves).
+            // 2. We don't need hints per-item when padding.
+            // 3. In order to get per-item hints today, you need to append one-at-a-time (mentioned above), which is VERY slow.
+            await this.db.appendLeaves(treeId, leaves);
+        }
+    }
+    async createCheckpoint() {
+        const actionCounter = this.checkpointActionCounter++;
+        const oldCheckpointId = this.getCurrentCheckpointId();
+        const treesStateHash = await this.getTreesStateHash();
+        await this.db.createCheckpoint();
+        this.checkpointStack.push(this.nextCheckpointId++);
+        const newCheckpointId = this.getCurrentCheckpointId();
+        this.hints.createCheckpointHints.push(new AvmCreateCheckpointHint(actionCounter, oldCheckpointId, newCheckpointId));
+        HintingMerkleWriteOperations.log.trace(`[createCheckpoint:${actionCounter}] Checkpoint evolved ${oldCheckpointId} -> ${newCheckpointId} at trees state ${treesStateHash}.`);
+    }
+    commitAllCheckpoints() {
+        throw new Error('commitAllCheckpoints is not supported in HintingMerkleWriteOperations.');
+    }
+    revertAllCheckpoints() {
+        throw new Error('revertAllCheckpoints is not supported in HintingMerkleWriteOperations.');
+    }
+    async commitCheckpoint() {
+        const actionCounter = this.checkpointActionCounter++;
+        const oldCheckpointId = this.getCurrentCheckpointId();
+        const treesStateHash = await this.getTreesStateHash();
+        await this.db.commitCheckpoint();
+        this.checkpointStack.pop();
+        const newCheckpointId = this.getCurrentCheckpointId();
+        this.hints.commitCheckpointHints.push(new AvmCommitCheckpointHint(actionCounter, oldCheckpointId, newCheckpointId));
+        HintingMerkleWriteOperations.log.trace(`[commitCheckpoint:${actionCounter}] Checkpoint evolved ${oldCheckpointId} -> ${newCheckpointId} at trees state ${treesStateHash}.`);
+    }
+    async revertCheckpoint() {
+        const actionCounter = this.checkpointActionCounter++;
+        const oldCheckpointId = this.getCurrentCheckpointId();
+        const treesStateHash = await this.getTreesStateHash();
+        const beforeState = {
+            [MerkleTreeId.PUBLIC_DATA_TREE]: await this.getHintKey(MerkleTreeId.PUBLIC_DATA_TREE),
+            [MerkleTreeId.NULLIFIER_TREE]: await this.getHintKey(MerkleTreeId.NULLIFIER_TREE),
+            [MerkleTreeId.NOTE_HASH_TREE]: await this.getHintKey(MerkleTreeId.NOTE_HASH_TREE),
+            [MerkleTreeId.L1_TO_L2_MESSAGE_TREE]: await this.getHintKey(MerkleTreeId.L1_TO_L2_MESSAGE_TREE),
+            [MerkleTreeId.ARCHIVE]: await this.getHintKey(MerkleTreeId.ARCHIVE)
+        };
+        await this.db.revertCheckpoint();
+        this.checkpointStack.pop();
+        const newCheckpointId = this.getCurrentCheckpointId();
+        const afterState = {
+            [MerkleTreeId.PUBLIC_DATA_TREE]: await this.getHintKey(MerkleTreeId.PUBLIC_DATA_TREE),
+            [MerkleTreeId.NULLIFIER_TREE]: await this.getHintKey(MerkleTreeId.NULLIFIER_TREE),
+            [MerkleTreeId.NOTE_HASH_TREE]: await this.getHintKey(MerkleTreeId.NOTE_HASH_TREE),
+            [MerkleTreeId.L1_TO_L2_MESSAGE_TREE]: await this.getHintKey(MerkleTreeId.L1_TO_L2_MESSAGE_TREE),
+            [MerkleTreeId.ARCHIVE]: await this.getHintKey(MerkleTreeId.ARCHIVE)
+        };
+        this.hints.revertCheckpointHints.push(AvmRevertCheckpointHint.create(actionCounter, oldCheckpointId, newCheckpointId, beforeState, afterState));
+        HintingMerkleWriteOperations.log.trace(`[revertCheckpoint:${actionCounter}] Checkpoint evolved ${oldCheckpointId} -> ${newCheckpointId} at trees state ${treesStateHash}.`);
+        for (const treeId of merkleTreeIds()){
+            HintingMerkleWriteOperations.logTreeChange('revertCheckpoint', beforeState[treeId], afterState[treeId], treeId);
+        }
+    }
+    // Private methods.
+    async getHintKey(treeId) {
+        const treeInfo = await this.db.getTreeInfo(treeId);
+        return new AppendOnlyTreeSnapshot(Fr.fromBuffer(treeInfo.root), Number(treeInfo.size));
+    }
+    getCurrentCheckpointId() {
+        return this.checkpointStack[this.checkpointStack.length - 1];
+    }
+    // For logging/debugging purposes.
+    async getTreesStateHash() {
+        const stateReferenceFields = (await this.db.getStateReference()).toFields();
+        return Fr.fromBuffer(sha256Trunc(Buffer.concat(stateReferenceFields.map((field)=>field.toBuffer()))));
+    }
+    static logTreeChange(action, beforeState, afterState, treeId) {
+        const treeName = getTreeName(treeId);
+        HintingMerkleWriteOperations.log.trace(`[${action}] ${treeName} tree state: ${beforeState.root}, ${beforeState.nextAvailableLeafIndex} -> ${afterState.root}, ${afterState.nextAvailableLeafIndex}.`);
+    }
+    async appendLeafInternal(treeId, leaf) {
+        // Use sequentialInsert for PublicDataTree and NullifierTree.
+        assert(treeId == MerkleTreeId.NOTE_HASH_TREE || treeId == MerkleTreeId.L1_TO_L2_MESSAGE_TREE);
+        const beforeState = await this.getHintKey(treeId);
+        await this.db.appendLeaves(treeId, [
+            leaf
+        ]);
+        const afterState = await this.getHintKey(treeId);
+        HintingMerkleWriteOperations.logTreeChange('appendLeaves', beforeState, afterState, treeId);
+        this.hints.appendLeavesHints.push(new AvmAppendLeavesHint(beforeState, afterState, treeId, [
+            leaf
+        ]));
+        return await this.getSiblingPath(treeId, BigInt(beforeState.nextAvailableLeafIndex));
+    }
+    // Non-hinted required methods from MerkleTreeWriteOperations interface
+    async getTreeInfo(treeId) {
+        return await this.db.getTreeInfo(treeId);
+    }
+    async getStateReference() {
+        return await this.db.getStateReference();
+    }
+    getInitialHeader() {
+        return this.db.getInitialHeader();
+    }
+    getRevision() {
+        return this.db.getRevision();
+    }
+    async updateArchive(header) {
+        return await this.db.updateArchive(header);
+    }
+    async batchInsert(treeId, leaves, subtreeHeight) {
+        return await this.db.batchInsert(treeId, leaves, subtreeHeight);
+    }
+    async close() {
+        return await this.db.close();
+    }
+    async findLeafIndices(treeId, values) {
+        return await this.db.findLeafIndices(treeId, values);
+    }
+    findSiblingPaths(treeId, values) {
+        return this.db.findSiblingPaths(treeId, values);
+    }
+    async findLeafIndicesAfter(treeId, values, startIndex) {
+        return await this.db.findLeafIndicesAfter(treeId, values, startIndex);
+    }
+    async getBlockNumbersForLeafIndices(treeId, leafIndices) {
+        return await this.db.getBlockNumbersForLeafIndices(treeId, leafIndices);
+    }
+}

package/dest/public/index.d.ts

@@ -1,10 +1,6 @@
-export * from '../common/db_interfaces.js';
-export * from './public_tx_simulator/public_tx_simulator.js';
-export { type EnqueuedPublicCallExecutionResult, type PublicFunctionCallResult } from './execution.js';
-export * from './public_db_sources.js';
+export { PublicContractsDB } from './public_db_sources.js';
+export { GuardedMerkleTreeOperations } from './public_processor/guarded_merkle_tree.js';
 export { PublicProcessor, PublicProcessorFactory } from './public_processor/public_processor.js';
-export { SideEffectTrace } from './side_effect_trace.js';
-export { getExecutionRequestsByPhase } from './utils.js';
-export { PublicTxSimulationTester } from './fixtures/index.js';
-export * from './avm/index.js';
+export { PublicTxSimulator, type PublicTxSimulatorConfig, TelemetryPublicTxSimulator, type PublicTxResult, } from './public_tx_simulator/index.js';
+export { getCallRequestsWithCalldataByPhase } from './utils.js';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/public/index.ts"],"names":[],"mappings":"AAAA,cAAc,4BAA4B,CAAC;AAC3C,cAAc,8CAA8C,CAAC;AAC7D,OAAO,EAAE,KAAK,iCAAiC,EAAE,KAAK,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AACvG,cAAc,wBAAwB,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AACjG,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,2BAA2B,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,cAAc,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/public/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,2BAA2B,EAAE,MAAM,2CAA2C,CAAC;AACxF,OAAO,EAAE,eAAe,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AACjG,OAAO,EACL,iBAAiB,EACjB,KAAK,uBAAuB,EAC5B,0BAA0B,EAC1B,KAAK,cAAc,GACpB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,kCAAkC,EAAE,MAAM,YAAY,CAAC"}

package/dest/public/index.js

@@ -1,8 +1,5 @@
-export * from '../common/db_interfaces.js';
-export * from './public_tx_simulator/public_tx_simulator.js';
-export * from './public_db_sources.js';
+export { PublicContractsDB } from './public_db_sources.js';
+export { GuardedMerkleTreeOperations } from './public_processor/guarded_merkle_tree.js';
 export { PublicProcessor, PublicProcessorFactory } from './public_processor/public_processor.js';
-export { SideEffectTrace } from './side_effect_trace.js';
-export { getExecutionRequestsByPhase } from './utils.js';
-export { PublicTxSimulationTester } from './fixtures/index.js';
-export * from './avm/index.js';
+export { PublicTxSimulator, TelemetryPublicTxSimulator } from './public_tx_simulator/index.js';
+export { getCallRequestsWithCalldataByPhase } from './utils.js';