@aztec/pxe 0.0.0-test.1 → 0.0.1-commit.017a351

package/src/tagging/sender_sync/utils/load_and_store_new_tagging_indexes.ts

@@ -0,0 +1,84 @@
+import type { BlockHash } from '@aztec/stdlib/block';
+import type { AztecNode } from '@aztec/stdlib/interfaces/server';
+import { type AppTaggingSecret, SiloedTag } from '@aztec/stdlib/logs';
+import { TxHash } from '@aztec/stdlib/tx';
+
+import type { SenderTaggingStore } from '../../../storage/tagging_store/sender_tagging_store.js';
+import { getAllPrivateLogsByTags } from '../../get_all_logs_by_tags.js';
+
+/**
+ * Loads tagging indexes from the Aztec node and stores them in the tagging data provider.
+ * @remarks This function is one of two places by which a pending index can get to the tagging data provider. The other
+ * place is when a tx is being sent from this PXE.
+ * @param extendedSecret - The app tagging secret whose indexes are being synced.
+ * @param start - The starting index (inclusive) of the window to process.
+ * @param end - The ending index (exclusive) of the window to process.
+ * @param aztecNode - The Aztec node instance to query for logs.
+ * @param taggingStore - The data provider to store pending indexes.
+ * @param anchorBlockHash - Hash of a block to use as reference block when querying node.
+ * @param jobId - Job identifier, used to keep writes in-memory until they can be persisted in a data integrity
+ * preserving way.
+ */
+export async function loadAndStoreNewTaggingIndexes(
+  extendedSecret: AppTaggingSecret,
+  start: number,
+  end: number,
+  aztecNode: AztecNode,
+  taggingStore: SenderTaggingStore,
+  anchorBlockHash: BlockHash,
+  jobId: string,
+) {
+  // We compute the tags for the current window of indexes
+  const siloedTagsForWindow = await Promise.all(
+    Array.from({ length: end - start }, (_, i) => SiloedTag.compute({ extendedSecret, index: start + i })),
+  );
+
+  const txsForTags = await getTxsContainingTags(siloedTagsForWindow, aztecNode, anchorBlockHash);
+  const txIndexesMap = getTxIndexesMap(txsForTags, start, siloedTagsForWindow.length);
+
+  // Now we iterate over the map, construct the tagging index ranges and store them in the db.
+  for (const [txHashStr, indexes] of txIndexesMap.entries()) {
+    const txHash = TxHash.fromString(txHashStr);
+    const ranges = [{ extendedSecret, lowestIndex: Math.min(...indexes), highestIndex: Math.max(...indexes) }];
+    await taggingStore.storePendingIndexes(ranges, txHash, jobId);
+  }
+}
+
+// Returns txs that used the given tags. A tag might have been used in multiple txs and for this reason we return
+// an array for each tag.
+async function getTxsContainingTags(
+  tags: SiloedTag[],
+  aztecNode: AztecNode,
+  anchorBlockHash: BlockHash,
+): Promise<TxHash[][]> {
+  // We use the utility function below to retrieve all logs for the tags across all pages, so we don't need to handle
+  // pagination here. Sender sync only needs `txHash` from each log, so we leave `includeEffects` off.
+  const allLogs = await getAllPrivateLogsByTags(aztecNode, tags, anchorBlockHash);
+  return allLogs.map(logs => logs.map(log => log.txHash));
+}
+
+// Returns a map of txHash to all indexes for that txHash.
+function getTxIndexesMap(txHashesForTags: TxHash[][], start: number, count: number): Map<string, number[]> {
+  if (txHashesForTags.length !== count) {
+    throw new Error(`Number of tx hashes arrays does not match number of tags. ${txHashesForTags.length} !== ${count}`);
+  }
+
+  const indexesMap = new Map<string, number[]>();
+  // Iterate over indexes
+  for (let i = 0; i < txHashesForTags.length; i++) {
+    const taggingIndex = start + i;
+    const txHashesForTag = txHashesForTags[i];
+    // iterate over tx hashes that used that index (tag)
+    for (const txHash of txHashesForTag) {
+      const key = txHash.toString();
+      const existing = indexesMap.get(key);
+      // Add the index to the tx's indexes
+      if (existing) {
+        existing.push(taggingIndex);
+      } else {
+        indexesMap.set(key, [taggingIndex]);
+      }
+    }
+  }
+  return indexesMap;
+}

package/dest/entrypoints/client/pxe_creation_options.d.ts

@@ -1,11 +0,0 @@
-import type { Logger } from '@aztec/foundation/log';
-import type { PrivateKernelProver } from '@aztec/stdlib/interfaces/client';
-export type PXECreationOptions = {
-    loggers: {
-        store?: Logger;
-        pxe?: Logger;
-        prover?: Logger;
-    };
-    prover?: PrivateKernelProver;
-};
-//# sourceMappingURL=pxe_creation_options.d.ts.map

package/dest/entrypoints/client/pxe_creation_options.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pxe_creation_options.d.ts","sourceRoot":"","sources":["../../../src/entrypoints/client/pxe_creation_options.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAE3E,MAAM,MAAM,kBAAkB,GAAG;IAC/B,OAAO,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3D,MAAM,CAAC,EAAE,mBAAmB,CAAC;CAC9B,CAAC"}

package/dest/entrypoints/client/pxe_creation_options.js

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

package/dest/kernel_oracle/index.d.ts

@@ -1,45 +0,0 @@
-import { type NOTE_HASH_TREE_HEIGHT } from '@aztec/constants';
-import type { Fr, GrumpkinScalar, Point } from '@aztec/foundation/fields';
-import { MembershipWitness } from '@aztec/foundation/trees';
-import type { KeyStore } from '@aztec/key-store';
-import type { FunctionSelector } from '@aztec/stdlib/abi';
-import type { AztecAddress } from '@aztec/stdlib/aztec-address';
-import type { L2BlockNumber } from '@aztec/stdlib/block';
-import type { AztecNode } from '@aztec/stdlib/interfaces/client';
-import { UpdatedClassIdHints } from '@aztec/stdlib/kernel';
-import type { NullifierMembershipWitness } from '@aztec/stdlib/trees';
-import type { VerificationKeyAsFields } from '@aztec/stdlib/vks';
-import type { ContractDataProvider } from '../storage/contract_data_provider/contract_data_provider.js';
-import type { ProvingDataOracle } from './../kernel_prover/proving_data_oracle.js';
-/**
- * A data oracle that provides information needed for simulating a transaction.
- */
-export declare class KernelOracle implements ProvingDataOracle {
-    private contractDataProvider;
-    private keyStore;
-    private node;
-    private blockNumber;
-    private log;
-    constructor(contractDataProvider: ContractDataProvider, keyStore: KeyStore, node: AztecNode, blockNumber?: L2BlockNumber, log?: import("@aztec/foundation/log").Logger);
-    getContractAddressPreimage(address: AztecAddress): Promise<{
-        version: 1;
-        salt: Fr;
-        deployer: AztecAddress;
-        currentContractClassId: Fr;
-        originalContractClassId: Fr;
-        initializationHash: Fr;
-        publicKeys: import("@aztec/aztec.js").PublicKeys;
-        address: AztecAddress;
-        saltedInitializationHash: Fr;
-    }>;
-    getContractClassIdPreimage(contractClassId: Fr): Promise<import("@aztec/stdlib/contract").ContractClassIdPreimage>;
-    getFunctionMembershipWitness(contractClassId: Fr, selector: FunctionSelector): Promise<MembershipWitness<5>>;
-    getVkMembershipWitness(vk: VerificationKeyAsFields): Promise<MembershipWitness<6>>;
-    getNoteHashMembershipWitness(leafIndex: bigint): Promise<MembershipWitness<typeof NOTE_HASH_TREE_HEIGHT>>;
-    getNullifierMembershipWitness(nullifier: Fr): Promise<NullifierMembershipWitness | undefined>;
-    getNoteHashTreeRoot(): Promise<Fr>;
-    getMasterSecretKey(masterPublicKey: Point): Promise<GrumpkinScalar>;
-    getDebugFunctionName(contractAddress: AztecAddress, selector: FunctionSelector): Promise<string>;
-    getUpdatedClassIdHints(contractAddress: AztecAddress): Promise<UpdatedClassIdHints>;
-}
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/kernel_oracle/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,qBAAqB,EAA2C,MAAM,kBAAkB,CAAC;AACvG,OAAO,KAAK,EAAE,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,0BAA0B,CAAC;AAG1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAGjD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAGzD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,mBAAmB,CAAC;AAEjE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,6DAA6D,CAAC;AACxG,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2CAA2C,CAAC;AAInF;;GAEG;AACH,qBAAa,YAAa,YAAW,iBAAiB;IAElD,OAAO,CAAC,oBAAoB;IAC5B,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,IAAI;IACZ,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,GAAG;gBAJH,oBAAoB,EAAE,oBAAoB,EAC1C,QAAQ,EAAE,QAAQ,EAClB,IAAI,EAAE,SAAS,EACf,WAAW,GAAE,aAAwB,EACrC,GAAG,yCAAoC;IAGpC,0BAA0B,CAAC,OAAO,EAAE,YAAY;;;;;;;;;;;IAQhD,0BAA0B,CAAC,eAAe,EAAE,EAAE;IAK9C,4BAA4B,CAAC,eAAe,EAAE,EAAE,EAAE,QAAQ,EAAE,gBAAgB;IAIlF,sBAAsB,CAAC,EAAE,EAAE,uBAAuB;IAKnD,4BAA4B,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,OAAO,qBAAqB,CAAC,CAAC;IAS/G,6BAA6B,CAAC,SAAS,EAAE,EAAE,GAAG,OAAO,CAAC,0BAA0B,GAAG,SAAS,CAAC;IAIvF,mBAAmB,IAAI,OAAO,CAAC,EAAE,CAAC;IAQjC,kBAAkB,CAAC,eAAe,EAAE,KAAK,GAAG,OAAO,CAAC,cAAc,CAAC;IAInE,oBAAoB,CAAC,eAAe,EAAE,YAAY,EAAE,QAAQ,EAAE,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC;IAI1F,sBAAsB,CAAC,eAAe,EAAE,YAAY,GAAG,OAAO,CAAC,mBAAmB,CAAC;CA6BjG"}

package/dest/kernel_oracle/index.js

@@ -1,76 +0,0 @@
-import { PUBLIC_DATA_TREE_HEIGHT, VK_TREE_HEIGHT } from '@aztec/constants';
-import { createLogger } from '@aztec/foundation/log';
-import { MembershipWitness } from '@aztec/foundation/trees';
-import { getVKIndex, getVKSiblingPath } from '@aztec/noir-protocol-circuits-types/vk-tree';
-import { ProtocolContractAddress } from '@aztec/protocol-contracts';
-import { computeContractClassIdPreimage, computeSaltedInitializationHash } from '@aztec/stdlib/contract';
-import { computePublicDataTreeLeafSlot } from '@aztec/stdlib/hash';
-import { UpdatedClassIdHints } from '@aztec/stdlib/kernel';
-import { SharedMutableValues, SharedMutableValuesWithHash } from '@aztec/stdlib/shared-mutable';
-// TODO: Block number should not be "latest".
-// It should be fixed at the time the proof is being simulated. I.e., it should be the same as the value defined in the constant data.
-/**
- * A data oracle that provides information needed for simulating a transaction.
- */ export class KernelOracle {
-    contractDataProvider;
-    keyStore;
-    node;
-    blockNumber;
-    log;
-    constructor(contractDataProvider, keyStore, node, blockNumber = 'latest', log = createLogger('pxe:kernel_oracle')){
-        this.contractDataProvider = contractDataProvider;
-        this.keyStore = keyStore;
-        this.node = node;
-        this.blockNumber = blockNumber;
-        this.log = log;
-    }
-    async getContractAddressPreimage(address) {
-        const instance = await this.contractDataProvider.getContractInstance(address);
-        return {
-            saltedInitializationHash: await computeSaltedInitializationHash(instance),
-            ...instance
-        };
-    }
-    async getContractClassIdPreimage(contractClassId) {
-        const contractClass = await this.contractDataProvider.getContractClass(contractClassId);
-        return computeContractClassIdPreimage(contractClass);
-    }
-    async getFunctionMembershipWitness(contractClassId, selector) {
-        return await this.contractDataProvider.getFunctionMembershipWitness(contractClassId, selector);
-    }
-    getVkMembershipWitness(vk) {
-        const leafIndex = getVKIndex(vk);
-        return Promise.resolve(new MembershipWitness(VK_TREE_HEIGHT, BigInt(leafIndex), getVKSiblingPath(leafIndex)));
-    }
-    async getNoteHashMembershipWitness(leafIndex) {
-        const path = await this.node.getNoteHashSiblingPath(this.blockNumber, leafIndex);
-        return new MembershipWitness(path.pathSize, leafIndex, path.toFields());
-    }
-    getNullifierMembershipWitness(nullifier) {
-        return this.node.getNullifierMembershipWitness(this.blockNumber, nullifier);
-    }
-    async getNoteHashTreeRoot() {
-        const header = await this.node.getBlockHeader(this.blockNumber);
-        if (!header) {
-            throw new Error(`No block header found for block number ${this.blockNumber}`);
-        }
-        return header.state.partial.noteHashTree.root;
-    }
-    getMasterSecretKey(masterPublicKey) {
-        return this.keyStore.getMasterSecretKey(masterPublicKey);
-    }
-    getDebugFunctionName(contractAddress, selector) {
-        return this.contractDataProvider.getDebugFunctionName(contractAddress, selector);
-    }
-    async getUpdatedClassIdHints(contractAddress) {
-        const { sharedMutableSlot, sharedMutableHashSlot } = await SharedMutableValuesWithHash.getContractUpdateSlots(contractAddress);
-        const hashLeafSlot = await computePublicDataTreeLeafSlot(ProtocolContractAddress.ContractInstanceDeployer, sharedMutableHashSlot);
-        const updatedClassIdWitness = await this.node.getPublicDataTreeWitness(this.blockNumber, hashLeafSlot);
-        if (!updatedClassIdWitness) {
-            throw new Error(`No public data tree witness found for ${hashLeafSlot}`);
-        }
-        const readStorage = (storageSlot)=>this.node.getPublicStorageAt(this.blockNumber, ProtocolContractAddress.ContractInstanceDeployer, storageSlot);
-        const sharedMutableValues = await SharedMutableValues.readFromTree(sharedMutableSlot, readStorage);
-        return new UpdatedClassIdHints(new MembershipWitness(PUBLIC_DATA_TREE_HEIGHT, updatedClassIdWitness.index, updatedClassIdWitness.siblingPath.toTuple()), updatedClassIdWitness.leafPreimage, sharedMutableValues);
-    }
-}

package/dest/kernel_prover/hints/build_private_kernel_reset_private_inputs.d.ts

@@ -1,28 +0,0 @@
-import { type PrivateKernelCircuitPublicInputs, PrivateKernelResetCircuitPrivateInputs, type PrivateKernelSimulateOutput } from '@aztec/stdlib/kernel';
-import { type PrivateCallExecutionResult } from '@aztec/stdlib/tx';
-import type { ProvingDataOracle } from '../proving_data_oracle.js';
-export declare class PrivateKernelResetPrivateInputsBuilder {
-    private previousKernelOutput;
-    private executionStack;
-    private noteHashNullifierCounterMap;
-    private validationRequestsSplitCounter;
-    private previousKernel;
-    private nextIteration?;
-    private noteHashResetStates;
-    private nullifierResetStates;
-    private numTransientData?;
-    private transientDataIndexHints;
-    private requestedDimensions;
-    constructor(previousKernelOutput: PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>, executionStack: PrivateCallExecutionResult[], noteHashNullifierCounterMap: Map<number, number>, validationRequestsSplitCounter: number);
-    needsReset(): boolean;
-    build(oracle: ProvingDataOracle, noteHashLeafIndexMap: Map<bigint, bigint>): Promise<PrivateKernelResetCircuitPrivateInputs>;
-    private reduceReadRequestStates;
-    private needsResetNoteHashReadRequests;
-    private needsResetNullifierReadRequests;
-    private needsResetNullifierKeys;
-    private needsResetTransientData;
-    private needsSiloNoteHashes;
-    private needsSiloNullifiers;
-    private needsSiloPrivateLogs;
-}
-//# sourceMappingURL=build_private_kernel_reset_private_inputs.d.ts.map

package/dest/kernel_prover/hints/build_private_kernel_reset_private_inputs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"build_private_kernel_reset_private_inputs.d.ts","sourceRoot":"","sources":["../../../src/kernel_prover/hints/build_private_kernel_reset_private_inputs.ts"],"names":[],"mappings":"AAeA,OAAO,EAGL,KAAK,gCAAgC,EAErC,sCAAsC,EAGtC,KAAK,2BAA2B,EAkBjC,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,KAAK,0BAA0B,EAAiB,MAAM,kBAAkB,CAAC;AAElF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAiDnE,qBAAa,sCAAsC;IAY/C,OAAO,CAAC,oBAAoB;IAC5B,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,2BAA2B;IACnC,OAAO,CAAC,8BAA8B;IAdxC,OAAO,CAAC,cAAc,CAAmC;IAEzD,OAAO,CAAC,aAAa,CAAC,CAA6B;IAEnD,OAAO,CAAC,mBAAmB,CAAoE;IAC/F,OAAO,CAAC,oBAAoB,CAAoE;IAChG,OAAO,CAAC,gBAAgB,CAAC,CAAS;IAClC,OAAO,CAAC,uBAAuB,CAA8D;IAC7F,OAAO,CAAC,mBAAmB,CAA+B;gBAGhD,oBAAoB,EAAE,2BAA2B,CAAC,gCAAgC,CAAC,EACnF,cAAc,EAAE,0BAA0B,EAAE,EAC5C,2BAA2B,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAChD,8BAA8B,EAAE,MAAM;IAahD,UAAU,IAAI,OAAO;IAwBf,KAAK,CAAC,MAAM,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAgEhF,OAAO,CAAC,uBAAuB;IA2B/B,OAAO,CAAC,8BAA8B;IAoDtC,OAAO,CAAC,+BAA+B;IAoDvC,OAAO,CAAC,uBAAuB;IAiB/B,OAAO,CAAC,uBAAuB;IAmE/B,OAAO,CAAC,mBAAmB;IAY3B,OAAO,CAAC,mBAAmB;IAgB3B,OAAO,CAAC,oBAAoB;CAmB7B"}

package/dest/kernel_prover/hints/build_private_kernel_reset_private_inputs.js

@@ -1,270 +0,0 @@
-import { MAX_KEY_VALIDATION_REQUESTS_PER_TX, MAX_NOTE_HASHES_PER_TX, MAX_NOTE_HASH_READ_REQUESTS_PER_TX, MAX_NULLIFIERS_PER_TX, MAX_NULLIFIER_READ_REQUESTS_PER_TX, NULLIFIER_TREE_HEIGHT, VK_TREE_HEIGHT } from '@aztec/constants';
-import { makeTuple } from '@aztec/foundation/array';
-import { padArrayEnd } from '@aztec/foundation/collection';
-import { assertLength } from '@aztec/foundation/serialize';
-import { MembershipWitness } from '@aztec/foundation/trees';
-import { privateKernelResetDimensionsConfig } from '@aztec/noir-protocol-circuits-types/client';
-import { KeyValidationHint, PrivateKernelData, PrivateKernelResetCircuitPrivateInputs, PrivateKernelResetDimensions, PrivateKernelResetHints, ReadRequestResetStates, ReadRequestState, ScopedNoteHash, ScopedNullifier, ScopedReadRequest, TransientDataIndexHint, buildNoteHashReadRequestHintsFromResetStates, buildNullifierReadRequestHintsFromResetStates, buildTransientDataHints, countAccumulatedItems, findPrivateKernelResetDimensions, getNonEmptyItems, getNoteHashReadRequestResetStates, getNullifierReadRequestResetStates, privateKernelResetDimensionNames } from '@aztec/stdlib/kernel';
-import { collectNested } from '@aztec/stdlib/tx';
-function collectNestedReadRequests(executionStack, extractReadRequests) {
-    return collectNested(executionStack, (executionResult)=>{
-        const nonEmptyReadRequests = getNonEmptyItems(extractReadRequests(executionResult));
-        return nonEmptyReadRequests.map((readRequest)=>new ScopedReadRequest(readRequest, executionResult.publicInputs.callContext.contractAddress));
-    });
-}
-function getNullifierMembershipWitnessResolver(oracle) {
-    return async (nullifier)=>{
-        const res = await oracle.getNullifierMembershipWitness(nullifier);
-        if (!res) {
-            throw new Error(`Cannot find the leaf for nullifier ${nullifier}.`);
-        }
-        const { index, siblingPath, leafPreimage } = res;
-        return {
-            membershipWitness: new MembershipWitness(NULLIFIER_TREE_HEIGHT, index, siblingPath.toTuple()),
-            leafPreimage
-        };
-    };
-}
-async function getMasterSecretKeysAndAppKeyGenerators(keyValidationRequests, oracle) {
-    const keysHints = [];
-    for(let i = 0; i < keyValidationRequests.length; ++i){
-        const request = keyValidationRequests[i].request;
-        if (request.isEmpty()) {
-            break;
-        }
-        const secretKeys = await oracle.getMasterSecretKey(request.request.pkM);
-        keysHints.push(new KeyValidationHint(secretKeys, i));
-    }
-    return padArrayEnd(keysHints, KeyValidationHint.nada(MAX_KEY_VALIDATION_REQUESTS_PER_TX), MAX_KEY_VALIDATION_REQUESTS_PER_TX);
-}
-export class PrivateKernelResetPrivateInputsBuilder {
-    previousKernelOutput;
-    executionStack;
-    noteHashNullifierCounterMap;
-    validationRequestsSplitCounter;
-    previousKernel;
-    // If there's no next iteration, it's the final reset.
-    nextIteration;
-    noteHashResetStates;
-    nullifierResetStates;
-    numTransientData;
-    transientDataIndexHints;
-    requestedDimensions;
-    constructor(previousKernelOutput, executionStack, noteHashNullifierCounterMap, validationRequestsSplitCounter){
-        this.previousKernelOutput = previousKernelOutput;
-        this.executionStack = executionStack;
-        this.noteHashNullifierCounterMap = noteHashNullifierCounterMap;
-        this.validationRequestsSplitCounter = validationRequestsSplitCounter;
-        this.previousKernel = previousKernelOutput.publicInputs;
-        this.requestedDimensions = PrivateKernelResetDimensions.empty();
-        this.noteHashResetStates = ReadRequestResetStates.empty(MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
-        this.nullifierResetStates = ReadRequestResetStates.empty(MAX_NULLIFIER_READ_REQUESTS_PER_TX);
-        this.transientDataIndexHints = makeTuple(MAX_NULLIFIERS_PER_TX, ()=>new TransientDataIndexHint(MAX_NULLIFIERS_PER_TX, MAX_NOTE_HASHES_PER_TX));
-        this.nextIteration = executionStack[this.executionStack.length - 1]?.publicInputs;
-    }
-    needsReset() {
-        const fns = [
-            ()=>this.needsResetNoteHashReadRequests(),
-            ()=>this.needsResetNullifierReadRequests(),
-            ()=>this.needsResetNullifierKeys(),
-            ()=>this.needsResetTransientData()
-        ];
-        if (this.nextIteration) {
-            // If there's a next iteration, reset is needed only when data of a dimension is about to overflow.
-            // fns are executed until a dimension that needs reset is found.
-            return fns.some((fn)=>fn());
-        } else {
-            // Siloing is only needed after processing all iterations.
-            fns.push(...[
-                ()=>this.needsSiloNoteHashes(),
-                ()=>this.needsSiloNullifiers(),
-                ()=>this.needsSiloPrivateLogs()
-            ]);
-            // If there's no next iteration, reset is needed when any of the dimension has non empty data.
-            // All the fns should to be executed so that data in all dimensions will be reset.
-            const result = fns.map((fn)=>fn());
-            return result.some((r)=>r);
-        }
-    }
-    async build(oracle, noteHashLeafIndexMap) {
-        if (privateKernelResetDimensionNames.every((name)=>!this.requestedDimensions[name])) {
-            throw new Error('Reset is not required.');
-        }
-        const isInner = !!this.nextIteration;
-        // "final" reset must be done at most once.
-        // Because the code that silo note hashes can't be run repeatedly.
-        // The dimensions found must be big enough to reset all values, i.e. empty remainder.
-        const allowRemainder = isInner;
-        const dimensions = findPrivateKernelResetDimensions(this.requestedDimensions, privateKernelResetDimensionsConfig, isInner, allowRemainder);
-        const previousVkMembershipWitness = await oracle.getVkMembershipWitness(this.previousKernelOutput.verificationKey);
-        const previousKernelData = new PrivateKernelData(this.previousKernelOutput.publicInputs, this.previousKernelOutput.verificationKey, Number(previousVkMembershipWitness.leafIndex), assertLength(previousVkMembershipWitness.siblingPath, VK_TREE_HEIGHT));
-        this.reduceReadRequestStates(this.noteHashResetStates, dimensions.NOTE_HASH_PENDING_AMOUNT, dimensions.NOTE_HASH_SETTLED_AMOUNT);
-        this.reduceReadRequestStates(this.nullifierResetStates, dimensions.NULLIFIER_PENDING_AMOUNT, dimensions.NULLIFIER_SETTLED_AMOUNT);
-        return new PrivateKernelResetCircuitPrivateInputs(previousKernelData, new PrivateKernelResetHints(await buildNoteHashReadRequestHintsFromResetStates(oracle, this.previousKernel.validationRequests.noteHashReadRequests, this.previousKernel.end.noteHashes, this.noteHashResetStates, noteHashLeafIndexMap), await buildNullifierReadRequestHintsFromResetStates({
-            getNullifierMembershipWitness: getNullifierMembershipWitnessResolver(oracle)
-        }, this.previousKernel.validationRequests.nullifierReadRequests, this.nullifierResetStates), await getMasterSecretKeysAndAppKeyGenerators(this.previousKernel.validationRequests.scopedKeyValidationRequestsAndGenerators, oracle), this.transientDataIndexHints, this.validationRequestsSplitCounter), dimensions);
-    }
-    reduceReadRequestStates(resetStates, maxPending, maxSettled) {
-        let numPending = 0;
-        let numSettled = 0;
-        for(let i = 0; i < resetStates.states.length; i++){
-            const state = resetStates.states[i];
-            if (state === ReadRequestState.PENDING) {
-                if (numPending < maxPending) {
-                    numPending++;
-                } else {
-                    resetStates.states[i] = ReadRequestState.NADA;
-                }
-            } else if (state === ReadRequestState.SETTLED) {
-                if (numSettled < maxSettled) {
-                    numSettled++;
-                } else {
-                    resetStates.states[i] = ReadRequestState.NADA;
-                }
-            }
-        }
-        resetStates.pendingReadHints = resetStates.pendingReadHints.slice(0, maxPending);
-    }
-    needsResetNoteHashReadRequests(forceResetAll = false) {
-        const numCurr = countAccumulatedItems(this.previousKernel.validationRequests.noteHashReadRequests);
-        const numNext = this.nextIteration ? countAccumulatedItems(this.nextIteration.noteHashReadRequests) : 0;
-        const maxAmountToKeep = !this.nextIteration || forceResetAll ? 0 : MAX_NOTE_HASH_READ_REQUESTS_PER_TX;
-        if (numCurr + numNext <= maxAmountToKeep) {
-            return false;
-        }
-        const futureNoteHashes = collectNested(this.executionStack, (executionResult)=>{
-            const nonEmptyNoteHashes = getNonEmptyItems(executionResult.publicInputs.noteHashes);
-            return nonEmptyNoteHashes.map((noteHash)=>new ScopedNoteHash(noteHash, executionResult.publicInputs.callContext.contractAddress));
-        });
-        const resetStates = getNoteHashReadRequestResetStates(this.previousKernel.validationRequests.noteHashReadRequests, this.previousKernel.end.noteHashes, futureNoteHashes);
-        const numPendingReads = resetStates.pendingReadHints.length;
-        const numSettledReads = resetStates.states.reduce((accum, state)=>accum + (state === ReadRequestState.SETTLED ? 1 : 0), 0);
-        if (!this.nextIteration) {
-            this.noteHashResetStates = resetStates;
-            this.requestedDimensions.NOTE_HASH_PENDING_AMOUNT = numPendingReads;
-            this.requestedDimensions.NOTE_HASH_SETTLED_AMOUNT = numSettledReads;
-        } else {
-            // Pick only one dimension to reset if next iteration is not empty.
-            if (numPendingReads > numSettledReads) {
-                this.requestedDimensions.NOTE_HASH_PENDING_AMOUNT = numPendingReads;
-                this.noteHashResetStates.states = assertLength(resetStates.states.map((state)=>state === ReadRequestState.PENDING ? state : ReadRequestState.NADA), MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
-                this.noteHashResetStates.pendingReadHints = resetStates.pendingReadHints;
-            } else {
-                this.requestedDimensions.NOTE_HASH_SETTLED_AMOUNT = numSettledReads;
-                this.noteHashResetStates.states = assertLength(resetStates.states.map((state)=>state === ReadRequestState.SETTLED ? state : ReadRequestState.NADA), MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
-            }
-        }
-        return true;
-    }
-    needsResetNullifierReadRequests(forceResetAll = false) {
-        const numCurr = countAccumulatedItems(this.previousKernel.validationRequests.nullifierReadRequests);
-        const numNext = this.nextIteration ? countAccumulatedItems(this.nextIteration.nullifierReadRequests) : 0;
-        const maxAmountToKeep = !this.nextIteration || forceResetAll ? 0 : MAX_NULLIFIER_READ_REQUESTS_PER_TX;
-        if (numCurr + numNext <= maxAmountToKeep) {
-            return false;
-        }
-        const futureNullifiers = collectNested(this.executionStack, (executionResult)=>{
-            const nonEmptyNullifiers = getNonEmptyItems(executionResult.publicInputs.nullifiers);
-            return nonEmptyNullifiers.map((nullifier)=>new ScopedNullifier(nullifier, executionResult.publicInputs.callContext.contractAddress));
-        });
-        const resetStates = getNullifierReadRequestResetStates(this.previousKernel.validationRequests.nullifierReadRequests, this.previousKernel.end.nullifiers, futureNullifiers);
-        const numPendingReads = resetStates.pendingReadHints.length;
-        const numSettledReads = resetStates.states.reduce((accum, state)=>accum + (state === ReadRequestState.SETTLED ? 1 : 0), 0);
-        if (!this.nextIteration) {
-            this.nullifierResetStates = resetStates;
-            this.requestedDimensions.NULLIFIER_PENDING_AMOUNT = numPendingReads;
-            this.requestedDimensions.NULLIFIER_SETTLED_AMOUNT = numSettledReads;
-        } else {
-            // Pick only one dimension to reset if next iteration is not empty.
-            if (numPendingReads > numSettledReads) {
-                this.requestedDimensions.NULLIFIER_PENDING_AMOUNT = numPendingReads;
-                this.nullifierResetStates.states = assertLength(resetStates.states.map((state)=>state === ReadRequestState.PENDING ? state : ReadRequestState.NADA), MAX_NULLIFIER_READ_REQUESTS_PER_TX);
-                this.nullifierResetStates.pendingReadHints = resetStates.pendingReadHints;
-            } else {
-                this.requestedDimensions.NULLIFIER_SETTLED_AMOUNT = numSettledReads;
-                this.nullifierResetStates.states = assertLength(resetStates.states.map((state)=>state === ReadRequestState.SETTLED ? state : ReadRequestState.NADA), MAX_NULLIFIER_READ_REQUESTS_PER_TX);
-            }
-        }
-        return true;
-    }
-    needsResetNullifierKeys() {
-        const numCurr = countAccumulatedItems(this.previousKernel.validationRequests.scopedKeyValidationRequestsAndGenerators);
-        const numNext = this.nextIteration ? countAccumulatedItems(this.nextIteration.keyValidationRequestsAndGenerators) : 0;
-        const maxAmountToKeep = !this.nextIteration ? 0 : MAX_KEY_VALIDATION_REQUESTS_PER_TX;
-        if (numCurr + numNext <= maxAmountToKeep) {
-            return false;
-        }
-        this.requestedDimensions.NULLIFIER_KEYS = numCurr;
-        return true;
-    }
-    needsResetTransientData() {
-        // Initialize this to 0 so that needsSilo can be run.
-        this.numTransientData = 0;
-        const nextAccumNoteHashes = countAccumulatedItems(this.previousKernel.end.noteHashes) + countAccumulatedItems(this.nextIteration?.noteHashes ?? []);
-        const noteHashWillOverflow = nextAccumNoteHashes > MAX_NOTE_HASHES_PER_TX;
-        const nextAccumNullifiers = countAccumulatedItems(this.previousKernel.end.nullifiers) + countAccumulatedItems(this.nextIteration?.nullifiers ?? []);
-        const nullifierWillOverflow = nextAccumNullifiers > MAX_NULLIFIERS_PER_TX;
-        if (this.nextIteration && !noteHashWillOverflow && !nullifierWillOverflow) {
-            return false;
-        }
-        const futureNoteHashReads = collectNestedReadRequests(this.executionStack, (executionResult)=>executionResult.publicInputs.noteHashReadRequests);
-        const futureNullifierReads = collectNestedReadRequests(this.executionStack, (executionResult)=>executionResult.publicInputs.nullifierReadRequests);
-        if (this.nextIteration) {
-            // If it's not the final reset, only one dimension will be reset at a time.
-            // The note hashes and nullifiers for the remaining read requests can't be squashed.
-            futureNoteHashReads.push(...this.previousKernel.validationRequests.noteHashReadRequests.filter((r)=>!r.isEmpty()));
-            futureNullifierReads.push(...this.previousKernel.validationRequests.nullifierReadRequests.filter((r)=>!r.isEmpty()));
-        }
-        const { numTransientData, hints: transientDataIndexHints } = buildTransientDataHints(this.previousKernel.end.noteHashes, this.previousKernel.end.nullifiers, futureNoteHashReads, futureNullifierReads, this.noteHashNullifierCounterMap, this.validationRequestsSplitCounter, MAX_NOTE_HASHES_PER_TX, MAX_NULLIFIERS_PER_TX);
-        if (this.nextIteration && !numTransientData) {
-            const forceResetAll = true;
-            const canClearReadRequests = noteHashWillOverflow && this.needsResetNoteHashReadRequests(forceResetAll) || nullifierWillOverflow && this.needsResetNullifierReadRequests(forceResetAll);
-            if (!canClearReadRequests) {
-                const overflownData = noteHashWillOverflow ? 'note hashes' : 'nullifiers';
-                throw new Error(`Number of ${overflownData} exceeds the limit.`);
-            }
-            // Clearing the read requests might not be enough to squash the overflown data.
-            // In this case, the next iteration will fail at the above check.
-            return true;
-        }
-        this.numTransientData = numTransientData;
-        this.transientDataIndexHints = transientDataIndexHints;
-        this.requestedDimensions.TRANSIENT_DATA_AMOUNT = numTransientData;
-        return numTransientData > 0;
-    }
-    needsSiloNoteHashes() {
-        if (this.numTransientData === undefined) {
-            throw new Error('`needsResetTransientData` must be run before `needsSiloNoteHashes`.');
-        }
-        const numNoteHashes = this.previousKernel.end.noteHashes.filter((n)=>!n.contractAddress.isZero()).length;
-        const numToSilo = Math.max(0, numNoteHashes - this.numTransientData);
-        this.requestedDimensions.NOTE_HASH_SILOING_AMOUNT = numToSilo;
-        return numToSilo > 0;
-    }
-    needsSiloNullifiers() {
-        if (this.numTransientData === undefined) {
-            throw new Error('`needsResetTransientData` must be run before `needsSiloNullifiers`.');
-        }
-        const numNullifiers = this.previousKernel.end.nullifiers.filter((n)=>!n.contractAddress.isZero()).length;
-        const numToSilo = Math.max(0, numNullifiers - this.numTransientData);
-        // Include the first nullifier if there's something to silo.
-        // The reset circuit checks that capped_size must be greater than or equal to all non-empty nullifiers.
-        // Which includes the first nullifier, even though its contract address is always zero and doesn't need siloing.
-        const cappedSize = numToSilo ? numToSilo + 1 : 0;
-        this.requestedDimensions.NULLIFIER_SILOING_AMOUNT = cappedSize;
-        return numToSilo > 0;
-    }
-    needsSiloPrivateLogs() {
-        if (this.numTransientData === undefined) {
-            throw new Error('`needsResetTransientData` must be run before `needsSiloPrivateLogs`.');
-        }
-        const privateLogs = this.previousKernel.end.privateLogs;
-        const numLogs = privateLogs.filter((l)=>!l.contractAddress.isZero()).length;
-        const noteHashes = this.previousKernel.end.noteHashes;
-        const squashedNoteHashCounters = this.transientDataIndexHints.filter((h)=>h.noteHashIndex < noteHashes.length).map((h)=>noteHashes[h.noteHashIndex].counter);
-        const numSquashedLogs = privateLogs.filter((l)=>squashedNoteHashCounters.includes(l.inner.noteHashCounter)).length;
-        const numToSilo = numLogs - numSquashedLogs;
-        this.requestedDimensions.PRIVATE_LOG_SILOING_AMOUNT = numToSilo;
-        return numToSilo > 0;
-    }
-}

package/dest/kernel_prover/hints/index.d.ts

@@ -1,2 +0,0 @@
-export * from './build_private_kernel_reset_private_inputs.js';
-//# sourceMappingURL=index.d.ts.map

package/dest/kernel_prover/hints/index.d.ts.map

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

package/dest/kernel_prover/hints/index.js

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

package/dest/kernel_prover/index.d.ts

@@ -1,3 +0,0 @@
-export * from './kernel_prover.js';
-export * from './proving_data_oracle.js';
-//# sourceMappingURL=index.d.ts.map

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

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

package/dest/kernel_prover/index.js

@@ -1,2 +0,0 @@
-export * from './kernel_prover.js';
-export * from './proving_data_oracle.js';

package/dest/kernel_prover/kernel_prover.d.ts

@@ -1,38 +0,0 @@
-import type { PrivateKernelProver } from '@aztec/stdlib/interfaces/client';
-import { type PrivateKernelSimulateOutput, type PrivateKernelTailCircuitPublicInputs } from '@aztec/stdlib/kernel';
-import { type PrivateExecutionResult, TxRequest } from '@aztec/stdlib/tx';
-import type { ProvingDataOracle } from './proving_data_oracle.js';
-export type ProvingConfig = {
-    simulate: boolean;
-    skipFeeEnforcement: boolean;
-    profile: boolean;
-};
-/**
- * The KernelProver class is responsible for generating kernel proofs.
- * It takes a transaction request, its signature, and the simulation result as inputs, and outputs a proof
- * along with output notes. The class interacts with a ProvingDataOracle to fetch membership witnesses and
- * constructs private call data based on the execution results.
- */
-export declare class KernelProver {
-    private oracle;
-    private proofCreator;
-    private fakeProofs;
-    private log;
-    constructor(oracle: ProvingDataOracle, proofCreator: PrivateKernelProver, fakeProofs?: boolean);
-    /**
-     * Generate a proof for a given transaction request and execution result.
-     * The function iterates through the nested executions in the execution result, creates private call data,
-     * and generates a proof using the provided ProofCreator instance. It also maintains an index of new notes
-     * created during the execution and returns them as a part of the KernelProverOutput.
-     *
-     * @param txRequest - The authenticated transaction request object.
-     * @param executionResult - The execution result object containing nested executions and preimages.
-     * @param profile - Set true to profile the gate count for each circuit
-     * @returns A Promise that resolves to a KernelProverOutput object containing proof, public inputs, and output notes.
-     * TODO(#7368) this should be refactored to not recreate the ACIR bytecode now that it operates on a program stack
-     */
-    prove(txRequest: TxRequest, executionResult: PrivateExecutionResult, { simulate, skipFeeEnforcement, profile }?: ProvingConfig): Promise<PrivateKernelSimulateOutput<PrivateKernelTailCircuitPublicInputs>>;
-    private createPrivateCallData;
-    private isPrivateOnly;
-}
-//# sourceMappingURL=kernel_prover.d.ts.map

package/dest/kernel_prover/kernel_prover.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"kernel_prover.d.ts","sourceRoot":"","sources":["../../src/kernel_prover/kernel_prover.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAC3E,OAAO,EAML,KAAK,2BAA2B,EAEhC,KAAK,oCAAoC,EAE1C,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAEL,KAAK,sBAAsB,EAC3B,SAAS,EAMV,MAAM,kBAAkB,CAAC;AAM1B,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AASlE,MAAM,MAAM,aAAa,GAAG;IAC1B,QAAQ,EAAE,OAAO,CAAC;IAClB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAEF;;;;;GAKG;AACH,qBAAa,YAAY;IAIrB,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,UAAU;IALpB,OAAO,CAAC,GAAG,CAAqC;gBAGtC,MAAM,EAAE,iBAAiB,EACzB,YAAY,EAAE,mBAAmB,EACjC,UAAU,UAAQ;IAG5B;;;;;;;;;;;OAWG;IACG,KAAK,CACT,SAAS,EAAE,SAAS,EACpB,eAAe,EAAE,sBAAsB,EACvC,EAAE,QAAQ,EAAE,kBAAkB,EAAE,OAAO,EAAE,GAAE,aAI1C,GACA,OAAO,CAAC,2BAA2B,CAAC,oCAAoC,CAAC,CAAC;YA4M/D,qBAAqB;IA4CnC,OAAO,CAAC,aAAa;CAYtB"}