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

package/dest/private_kernel/batch_planner.js

@@ -0,0 +1,104 @@
+import { ClaimedLengthArray, PrivateAccumulatedData, PrivateKernelCircuitPublicInputs, PrivateValidationRequests, ScopedKeyValidationRequestAndSeparator, ScopedPrivateLogData } from '@aztec/stdlib/kernel';
+import { VerificationKeyData } from '@aztec/stdlib/vks';
+import { PrivateKernelResetPrivateInputsBuilder } from './hints/private_kernel_reset_private_inputs_builder.js';
+/**
+ * Decides how many apps from the top of the execution stack the next kernel iteration should
+ * absorb. The decision is made by keeping track of an app-by-app accumulator calling
+ * `PrivateKernelResetPrivateInputsBuilder.needsReset()` whether a reset would be required before
+ * taking each candidate.
+ *
+ * The K-batched kernels are mathematically equivalent to running K sequential `init`/`inner`
+ * iterations so a multi-app fit-check reduces to a sequence of single-app fit-checks against a rolling
+ * accumulator.
+ */ export class BatchPlanner {
+    noteHashNullifierCounterMap;
+    splitCounter;
+    maxBatchSize;
+    constructor(noteHashNullifierCounterMap, splitCounter, maxBatchSize){
+        this.noteHashNullifierCounterMap = noteHashNullifierCounterMap;
+        this.splitCounter = splitCounter;
+        this.maxBatchSize = maxBatchSize;
+    }
+    /**
+   * Returns the number of apps from the top of `stack` that the next kernel iteration should
+   * batch. Always at least 1 — the caller is expected to have run any pending resets first, so
+   * the next single app must always fit.
+   *
+   * The walk mirrors `consumeNextApp`'s stack manipulation (pop top, push reversed nested
+   * children, then DFS into them) on a copy of the stack, so the planner can look ahead past
+   * the parent's children without mutating the real prover stack.
+   */ decideBatchSize(currentAccumulator, stack) {
+        const virtualStack = [
+            ...stack
+        ];
+        let projected = currentAccumulator;
+        let chosen = 0;
+        for(let i = 0; i < this.maxBatchSize && virtualStack.length > 0; i++){
+            const probe = new PrivateKernelResetPrivateInputsBuilder({
+                publicInputs: projected,
+                verificationKey: VerificationKeyData.empty(),
+                outputWitness: new Map(),
+                bytecode: Buffer.from([])
+            }, virtualStack, this.noteHashNullifierCounterMap, this.splitCounter);
+            if (probe.needsReset()) {
+                break;
+            }
+            // Speculatively consume the top of the virtual stack the same way `consumeNextApp` does
+            // on the real stack: pop the candidate, push its reversed nested children so the next
+            // iteration's top is the next DFS app.
+            const candidate = virtualStack.pop();
+            virtualStack.push(...[
+                ...candidate.nestedExecutionResults
+            ].reverse());
+            projected = appendApp(projected, candidate);
+            chosen++;
+        }
+        return Math.max(1, chosen);
+    }
+}
+/**
+ * Returns a new `PrivateKernelCircuitPublicInputs` representing the accumulator after one kernel
+ * iteration has absorbed `app`. Mirrors the kernel composer's accumulator-update step
+ * (`PrivateKernelCircuitOutputComposer::scope_and_propagate_from_private_call`) for the six
+ * fields that `PrivateKernelResetPrivateInputsBuilder.needsReset()` inspects:
+ *
+ * - `validationRequests.noteHashReadRequests`              (already scoped per app; appended as-is)
+ * - `validationRequests.nullifierReadRequests`             (already scoped per app; appended as-is)
+ * - `validationRequests.scopedKeyValidationRequestsAndSeparators` (scope with call's contract address)
+ * - `end.noteHashes`                                       (scope)
+ * - `end.nullifiers`                                       (scope)
+ * - `end.privateLogs`                                      (scope)
+ *
+ * Other fields on `PrivateKernelCircuitPublicInputs` (constants, fee_payer, expiration_timestamp,
+ * public_call_requests, l2_to_l1_msgs, contract_class_logs_hashes, etc.) are not read by
+ * `needsReset()` and are carried over unchanged from `acc`.
+ */ export function appendApp(acc, app) {
+    const ca = app.publicInputs.callContext.contractAddress;
+    const appPi = app.publicInputs;
+    const newNoteHashReadRequests = cloneClaimedLengthArray(acc.validationRequests.noteHashReadRequests);
+    pushAll(newNoteHashReadRequests, appPi.noteHashReadRequests.getActiveItems());
+    const newNullifierReadRequests = cloneClaimedLengthArray(acc.validationRequests.nullifierReadRequests);
+    pushAll(newNullifierReadRequests, appPi.nullifierReadRequests.getActiveItems());
+    const newScopedKvrs = cloneClaimedLengthArray(acc.validationRequests.scopedKeyValidationRequestsAndSeparators);
+    pushAll(newScopedKvrs, appPi.keyValidationRequestsAndSeparators.getActiveItems().map((kvr)=>new ScopedKeyValidationRequestAndSeparator(kvr, ca)));
+    const newNoteHashes = cloneClaimedLengthArray(acc.end.noteHashes);
+    pushAll(newNoteHashes, appPi.noteHashes.getActiveItems().map((nh)=>nh.scope(ca)));
+    const newNullifiers = cloneClaimedLengthArray(acc.end.nullifiers);
+    pushAll(newNullifiers, appPi.nullifiers.getActiveItems().map((n)=>n.scope(ca)));
+    const newPrivateLogs = cloneClaimedLengthArray(acc.end.privateLogs);
+    pushAll(newPrivateLogs, appPi.privateLogs.getActiveItems().map((pl)=>new ScopedPrivateLogData(pl, ca)));
+    const validationRequests = new PrivateValidationRequests(newNoteHashReadRequests, newNullifierReadRequests, newScopedKvrs);
+    const end = new PrivateAccumulatedData(newNoteHashes, newNullifiers, acc.end.l2ToL1Msgs, newPrivateLogs, acc.end.contractClassLogsHashes, acc.end.publicCallRequests, acc.end.privateCallStack);
+    return new PrivateKernelCircuitPublicInputs(acc.constants, acc.minRevertibleSideEffectCounter, validationRequests, end, acc.publicTeardownCallRequest, acc.feePayer, acc.expirationTimestamp, acc.isPrivateOnly, acc.claimedFirstNullifier, acc.claimedRevertibleCounter);
+}
+function cloneClaimedLengthArray(src) {
+    return new ClaimedLengthArray([
+        ...src.array
+    ], src.claimedLength);
+}
+function pushAll(arr, items) {
+    for (const item of items){
+        arr.array[arr.claimedLength] = item;
+        arr.claimedLength++;
+    }
+}

package/dest/private_kernel/hints/compute_tx_expiration_timestamp.d.ts

@@ -0,0 +1,4 @@
+import type { PrivateKernelCircuitPublicInputs } from '@aztec/stdlib/kernel';
+import type { UInt64 } from '@aztec/stdlib/types';
+export declare function computeTxExpirationTimestamp(previousKernel: PrivateKernelCircuitPublicInputs, txLifetime?: number): UInt64;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY29tcHV0ZV90eF9leHBpcmF0aW9uX3RpbWVzdGFtcC5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3ByaXZhdGVfa2VybmVsL2hpbnRzL2NvbXB1dGVfdHhfZXhwaXJhdGlvbl90aW1lc3RhbXAudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsT0FBTyxLQUFLLEVBQUUsZ0NBQWdDLEVBQUUsTUFBTSxzQkFBc0IsQ0FBQztBQUM3RSxPQUFPLEtBQUssRUFBRSxNQUFNLEVBQUUsTUFBTSxxQkFBcUIsQ0FBQztBQXFCbEQsd0JBQWdCLDRCQUE0QixDQUMxQyxjQUFjLEVBQUUsZ0NBQWdDLEVBQ2hELFVBQVUsU0FBa0IsR0FDM0IsTUFBTSxDQStCUiJ9

package/dest/private_kernel/hints/compute_tx_expiration_timestamp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compute_tx_expiration_timestamp.d.ts","sourceRoot":"","sources":["../../../src/private_kernel/hints/compute_tx_expiration_timestamp.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gCAAgC,EAAE,MAAM,sBAAsB,CAAC;AAC7E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAqBlD,wBAAgB,4BAA4B,CAC1C,cAAc,EAAE,gCAAgC,EAChD,UAAU,SAAkB,GAC3B,MAAM,CA+BR"}

package/dest/private_kernel/hints/compute_tx_expiration_timestamp.js

@@ -0,0 +1,41 @@
+import { MAX_TX_LIFETIME } from '@aztec/constants';
+const ROUNDED_DURATIONS = [
+    3600,
+    1800,
+    1
+];
+function roundTimestamp(blockTimestamp, expirationTimestamp) {
+    return ROUNDED_DURATIONS.reduce((timestamp, duration)=>{
+        if (timestamp <= blockTimestamp) {
+            // The timestamp must be greater than the block timestamp.
+            // If it is too small, round it down again using a smaller duration.
+            const totalDuration = expirationTimestamp - blockTimestamp;
+            const roundedDuration = totalDuration - totalDuration % BigInt(duration);
+            return blockTimestamp + roundedDuration;
+        }
+        return timestamp;
+    }, 0n);
+}
+export function computeTxExpirationTimestamp(previousKernel, txLifetime = MAX_TX_LIFETIME) {
+    if (txLifetime > MAX_TX_LIFETIME) {
+        throw new Error(`Custom tx lifetime cannot be greater than the max allowed. Max allowed: ${MAX_TX_LIFETIME}. Custom value: ${txLifetime}.`);
+    }
+    const anchorBlockTimestamp = previousKernel.constants.anchorBlockHeader.globalVariables.timestamp;
+    const maxTimestamp = anchorBlockTimestamp + BigInt(txLifetime);
+    const expirationTimestamp = previousKernel.expirationTimestamp;
+    // If the expirationTimestamp set during the tx execution is greater than or equal to the max allowed duration,
+    // use the maximum allowed timestamp.
+    // Note: It shouldn't be larger than the max allowed duration, but we check for it anyway.
+    if (expirationTimestamp >= maxTimestamp) {
+        return maxTimestamp;
+    }
+    // Round it down to the nearest hour/min/second to reduce precision and avoid revealing the exact value.
+    // This makes it harder for others to infer what function calls may have been used to produce a specific timestamp.
+    const roundedTimestamp = roundTimestamp(anchorBlockTimestamp, expirationTimestamp);
+    // The tx can't be published if the timestamp is the same or less than the anchor block's timestamp.
+    // Future blocks will have a greater timestamp, so the tx would never be included.
+    if (roundedTimestamp <= anchorBlockTimestamp) {
+        throw new Error(`Include-by timestamp must be greater than the anchor block timestamp. Anchor block timestamp: ${anchorBlockTimestamp}. Include-by timestamp: ${expirationTimestamp}.`);
+    }
+    return roundedTimestamp;
+}

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

@@ -0,0 +1,3 @@
+export * from './private_kernel_reset_private_inputs_builder.js';
+export * from './compute_tx_expiration_timestamp.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9wcml2YXRlX2tlcm5lbC9oaW50cy9pbmRleC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxjQUFjLGtEQUFrRCxDQUFDO0FBQ2pFLGNBQWMsc0NBQXNDLENBQUMifQ==

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

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

package/dest/private_kernel/hints/index.js

@@ -0,0 +1,2 @@
+export * from './private_kernel_reset_private_inputs_builder.js';
+export * from './compute_tx_expiration_timestamp.js';

package/dest/private_kernel/hints/private_kernel_reset_private_inputs_builder.d.ts

@@ -0,0 +1,29 @@
+import { type PrivateKernelCircuitPublicInputs, PrivateKernelResetCircuitPrivateInputs, PrivateKernelResetDimensions, type PrivateKernelSimulateOutput } from '@aztec/stdlib/kernel';
+import { type PrivateCallExecutionResult } from '@aztec/stdlib/tx';
+import type { PrivateKernelOracle } from '../private_kernel_oracle.js';
+export declare class PrivateKernelResetPrivateInputsBuilder {
+    private previousKernelOutput;
+    private executionStack;
+    private noteHashNullifierCounterMap;
+    private splitCounter;
+    private previousKernel;
+    private nextIteration?;
+    private noteHashResetActions;
+    private nullifierResetActions;
+    private numTransientData?;
+    private transientDataSquashingHints;
+    private requestedDimensions;
+    constructor(previousKernelOutput: PrivateKernelSimulateOutput<PrivateKernelCircuitPublicInputs>, executionStack: PrivateCallExecutionResult[], noteHashNullifierCounterMap: Map<number, number>, splitCounter: number);
+    getRequestedDimensions(): PrivateKernelResetDimensions;
+    needsReset(): boolean;
+    build(oracle: PrivateKernelOracle): Promise<PrivateKernelResetCircuitPrivateInputs>;
+    private reduceReadRequestActions;
+    private needsResetNoteHashReadRequests;
+    private needsResetNullifierReadRequests;
+    private needsResetKeyValidationRequests;
+    private needsResetTransientData;
+    private needsSiloNoteHashes;
+    private needsSiloNullifiers;
+    private needsSiloPrivateLogs;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJpdmF0ZV9rZXJuZWxfcmVzZXRfcHJpdmF0ZV9pbnB1dHNfYnVpbGRlci5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vc3JjL3ByaXZhdGVfa2VybmVsL2hpbnRzL3ByaXZhdGVfa2VybmVsX3Jlc2V0X3ByaXZhdGVfaW5wdXRzX2J1aWxkZXIudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBZUEsT0FBTyxFQUtMLEtBQUssZ0NBQWdDLEVBRXJDLHNDQUFzQyxFQUN0Qyw0QkFBNEIsRUFFNUIsS0FBSywyQkFBMkIsRUFhakMsTUFBTSxzQkFBc0IsQ0FBQztBQUM5QixPQUFPLEVBQUUsS0FBSywwQkFBMEIsRUFBaUIsTUFBTSxrQkFBa0IsQ0FBQztBQUdsRixPQUFPLEtBQUssRUFBRSxtQkFBbUIsRUFBRSxNQUFNLDZCQUE2QixDQUFDO0FBbUN2RSxxQkFBYSxzQ0FBc0M7SUFlL0MsT0FBTyxDQUFDLG9CQUFvQjtJQUM1QixPQUFPLENBQUMsY0FBYztJQUN0QixPQUFPLENBQUMsMkJBQTJCO0lBQ25DLE9BQU8sQ0FBQyxZQUFZO0lBakJ0QixPQUFPLENBQUMsY0FBYyxDQUFtQztJQUV6RCxPQUFPLENBQUMsYUFBYSxDQUFDLENBQTZCO0lBRW5ELE9BQU8sQ0FBQyxvQkFBb0IsQ0FBcUU7SUFDakcsT0FBTyxDQUFDLHFCQUFxQixDQUFxRTtJQUNsRyxPQUFPLENBQUMsZ0JBQWdCLENBQUMsQ0FBUztJQUNsQyxPQUFPLENBQUMsMkJBQTJCLENBR2pDO0lBQ0YsT0FBTyxDQUFDLG1CQUFtQixDQUF3QztJQUVuRSxZQUNVLG9CQUFvQixFQUFFLDJCQUEyQixDQUFDLGdDQUFnQyxDQUFDLEVBQ25GLGNBQWMsRUFBRSwwQkFBMEIsRUFBRSxFQUM1QywyQkFBMkIsRUFBRSxHQUFHLENBQUMsTUFBTSxFQUFFLE1BQU0sQ0FBQyxFQUNoRCxZQUFZLEVBQUUsTUFBTSxFQUk3QjtJQUVELHNCQUFzQixJQUFJLDRCQUE0QixDQUVyRDtJQUVELFVBQVUsSUFBSSxPQUFPLENBc0JwQjtJQUVLLEtBQUssQ0FBQyxNQUFNLEVBQUUsbUJBQW1CLG1EQThFdEM7SUFFRCxPQUFPLENBQUMsd0JBQXdCO0lBMkJoQyxPQUFPLENBQUMsOEJBQThCO0lBMEV0QyxPQUFPLENBQUMsK0JBQStCO0lBeUV2QyxPQUFPLENBQUMsK0JBQStCO0lBYXZDLE9BQU8sQ0FBQyx1QkFBdUI7SUEwRi9CLE9BQU8sQ0FBQyxtQkFBbUI7SUFpQjNCLE9BQU8sQ0FBQyxtQkFBbUI7SUFpQjNCLE9BQU8sQ0FBQyxvQkFBb0I7Q0FxQjdCIn0=

package/dest/private_kernel/hints/private_kernel_reset_private_inputs_builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"private_kernel_reset_private_inputs_builder.d.ts","sourceRoot":"","sources":["../../../src/private_kernel/hints/private_kernel_reset_private_inputs_builder.ts"],"names":[],"mappings":"AAeA,OAAO,EAKL,KAAK,gCAAgC,EAErC,sCAAsC,EACtC,4BAA4B,EAE5B,KAAK,2BAA2B,EAajC,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,KAAK,0BAA0B,EAAiB,MAAM,kBAAkB,CAAC;AAGlF,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAmCvE,qBAAa,sCAAsC;IAe/C,OAAO,CAAC,oBAAoB;IAC5B,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,2BAA2B;IACnC,OAAO,CAAC,YAAY;IAjBtB,OAAO,CAAC,cAAc,CAAmC;IAEzD,OAAO,CAAC,aAAa,CAAC,CAA6B;IAEnD,OAAO,CAAC,oBAAoB,CAAqE;IACjG,OAAO,CAAC,qBAAqB,CAAqE;IAClG,OAAO,CAAC,gBAAgB,CAAC,CAAS;IAClC,OAAO,CAAC,2BAA2B,CAGjC;IACF,OAAO,CAAC,mBAAmB,CAAwC;IAEnE,YACU,oBAAoB,EAAE,2BAA2B,CAAC,gCAAgC,CAAC,EACnF,cAAc,EAAE,0BAA0B,EAAE,EAC5C,2BAA2B,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAChD,YAAY,EAAE,MAAM,EAI7B;IAED,sBAAsB,IAAI,4BAA4B,CAErD;IAED,UAAU,IAAI,OAAO,CAsBpB;IAEK,KAAK,CAAC,MAAM,EAAE,mBAAmB,mDA8EtC;IAED,OAAO,CAAC,wBAAwB;IA2BhC,OAAO,CAAC,8BAA8B;IA0EtC,OAAO,CAAC,+BAA+B;IAyEvC,OAAO,CAAC,+BAA+B;IAavC,OAAO,CAAC,uBAAuB;IA0F/B,OAAO,CAAC,mBAAmB;IAiB3B,OAAO,CAAC,mBAAmB;IAiB3B,OAAO,CAAC,oBAAoB;CAqB7B"}

package/dest/private_kernel/hints/private_kernel_reset_private_inputs_builder.js

@@ -0,0 +1,338 @@
+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, MAX_PRIVATE_LOGS_PER_TX, NULLIFIER_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, PaddedSideEffects, PrivateKernelData, PrivateKernelResetCircuitPrivateInputs, PrivateKernelResetDimensions, PrivateKernelResetHints, ReadRequestActionEnum, ReadRequestResetActions, TransientDataSquashingHint, buildNoteHashReadRequestHintsFromResetActions, buildNullifierReadRequestHintsFromResetActions, buildTransientDataHints, countSquashedLogs, findPrivateKernelResetDimensions, getNoteHashReadRequestResetActions, getNullifierReadRequestResetActions, privateKernelResetDimensionNames } from '@aztec/stdlib/kernel';
+import { collectNested } from '@aztec/stdlib/tx';
+import { VkData } from '@aztec/stdlib/vks';
+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 getMasterSecretKeysAndKeyTypeDomainSeparators(keyValidationRequests, numRequestsToVerify, oracle) {
+    const numRequestsToProcess = Math.min(keyValidationRequests.claimedLength, numRequestsToVerify);
+    const keysHints = await Promise.all(keyValidationRequests.array.slice(0, numRequestsToProcess).map(async ({ request })=>{
+        const secretKeys = await oracle.getMasterSecretKey(request.request.pkMHash);
+        return new KeyValidationHint(secretKeys);
+    }));
+    return padArrayEnd(keysHints, KeyValidationHint.empty(), MAX_KEY_VALIDATION_REQUESTS_PER_TX);
+}
+export class PrivateKernelResetPrivateInputsBuilder {
+    previousKernelOutput;
+    executionStack;
+    noteHashNullifierCounterMap;
+    splitCounter;
+    previousKernel;
+    // If there's no next iteration, it's the final reset.
+    nextIteration;
+    noteHashResetActions;
+    nullifierResetActions;
+    numTransientData;
+    transientDataSquashingHints;
+    requestedDimensions;
+    constructor(previousKernelOutput, executionStack, noteHashNullifierCounterMap, splitCounter){
+        this.previousKernelOutput = previousKernelOutput;
+        this.executionStack = executionStack;
+        this.noteHashNullifierCounterMap = noteHashNullifierCounterMap;
+        this.splitCounter = splitCounter;
+        this.noteHashResetActions = ReadRequestResetActions.empty(MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
+        this.nullifierResetActions = ReadRequestResetActions.empty(MAX_NULLIFIER_READ_REQUESTS_PER_TX);
+        this.transientDataSquashingHints = makeTuple(MAX_NULLIFIERS_PER_TX, ()=>new TransientDataSquashingHint(MAX_NULLIFIERS_PER_TX, MAX_NOTE_HASHES_PER_TX));
+        this.requestedDimensions = PrivateKernelResetDimensions.empty();
+        this.previousKernel = previousKernelOutput.publicInputs;
+        this.nextIteration = executionStack[this.executionStack.length - 1]?.publicInputs;
+    }
+    getRequestedDimensions() {
+        return this.requestedDimensions;
+    }
+    needsReset() {
+        const fns = [
+            ()=>this.needsResetNoteHashReadRequests(),
+            ()=>this.needsResetNullifierReadRequests(),
+            ()=>this.needsResetKeyValidationRequests(),
+            ()=>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) {
+        if (privateKernelResetDimensionNames.every((name)=>!this.requestedDimensions[name])) {
+            throw new Error('Reset is not required.');
+        }
+        const isInner = !!this.nextIteration;
+        // "final" reset must be done exactly once, because siloing 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);
+        this.reduceReadRequestActions(this.noteHashResetActions, dimensions.NOTE_HASH_PENDING_READ, dimensions.NOTE_HASH_SETTLED_READ);
+        this.reduceReadRequestActions(this.nullifierResetActions, dimensions.NULLIFIER_PENDING_READ, dimensions.NULLIFIER_SETTLED_READ);
+        // Execute all the expensive node querying operations in parallel.
+        const [previousVkMembershipWitness, noteHashReadRequestHints, nullifierReadRequestHints, keyValidationHints] = await Promise.all([
+            oracle.getVkMembershipWitness(this.previousKernelOutput.verificationKey.keyAsFields),
+            buildNoteHashReadRequestHintsFromResetActions(oracle, this.previousKernel.validationRequests.noteHashReadRequests, this.previousKernel.end.noteHashes, this.noteHashResetActions),
+            buildNullifierReadRequestHintsFromResetActions({
+                getNullifierMembershipWitness: getNullifierMembershipWitnessResolver(oracle)
+            }, this.previousKernel.validationRequests.nullifierReadRequests, this.nullifierResetActions),
+            getMasterSecretKeysAndKeyTypeDomainSeparators(this.previousKernel.validationRequests.scopedKeyValidationRequestsAndSeparators, dimensions.KEY_VALIDATION, oracle)
+        ]);
+        const vkData = new VkData(this.previousKernelOutput.verificationKey, Number(previousVkMembershipWitness.leafIndex), previousVkMembershipWitness.siblingPath);
+        const previousKernelData = new PrivateKernelData(this.previousKernelOutput.publicInputs, vkData);
+        // TODO: Enable padding when we have a better idea what are the final amounts we should pad to.
+        const paddedSideEffects = PaddedSideEffects.empty();
+        return new PrivateKernelResetCircuitPrivateInputs(previousKernelData, paddedSideEffects, new PrivateKernelResetHints(noteHashReadRequestHints, nullifierReadRequestHints, keyValidationHints, this.transientDataSquashingHints), dimensions);
+    }
+    reduceReadRequestActions(resetActions, maxPending, maxSettled) {
+        let numPending = 0;
+        let numSettled = 0;
+        for(let i = 0; i < resetActions.actions.length; i++){
+            const action = resetActions.actions[i];
+            if (action === ReadRequestActionEnum.READ_AS_PENDING) {
+                if (numPending < maxPending) {
+                    numPending++;
+                } else {
+                    resetActions.actions[i] = ReadRequestActionEnum.SKIP;
+                }
+            } else if (action === ReadRequestActionEnum.READ_AS_SETTLED) {
+                if (numSettled < maxSettled) {
+                    numSettled++;
+                } else {
+                    resetActions.actions[i] = ReadRequestActionEnum.SKIP;
+                }
+            }
+        }
+        resetActions.pendingReadHints = resetActions.pendingReadHints.slice(0, maxPending);
+    }
+    needsResetNoteHashReadRequests(forceReset = false) {
+        const numCurr = this.previousKernel.validationRequests.noteHashReadRequests.claimedLength;
+        const numNext = this.nextIteration ? this.nextIteration.noteHashReadRequests.claimedLength : 0;
+        const maxAmountToKeep = !this.nextIteration || forceReset ? 0 : MAX_NOTE_HASH_READ_REQUESTS_PER_TX;
+        if (numCurr + numNext <= maxAmountToKeep) {
+            return false;
+        }
+        const resetActions = getNoteHashReadRequestResetActions(this.previousKernel.validationRequests.noteHashReadRequests, this.previousKernel.end.noteHashes);
+        const numPendingReads = resetActions.pendingReadHints.length;
+        const numSettledReads = resetActions.actions.reduce((accum, action)=>accum + (action === ReadRequestActionEnum.READ_AS_SETTLED ? 1 : 0), 0);
+        const totalReadsToReset = numPendingReads + numSettledReads;
+        const minResetNeeded = numCurr + numNext - maxAmountToKeep;
+        if (totalReadsToReset < minResetNeeded) {
+            if (!this.nextIteration) {
+                // In the final reset, all note hashes have been emitted. So if we can't reset all requests, at least one
+                // pending read request doesn't match any of them.
+                throw new Error('No matching note hash found for note hash read request.');
+            } else if (!forceReset) {
+                // A pending read request can only be reset if its note hash has already been included (e.g. a parent call might
+                // be reading a note hash emitted by a child call. The read request of the parent call is included before the note
+                // hash of the child call).
+                // If we can't clear enough read requests to make room for the next iteration's reads, we're stuck.
+                throw new Error('Number of note hash read requests exceeds the limit.');
+            } else if (totalReadsToReset == 0) {
+                // It's transient data squashing asking for the read requests to be reset first (forceReset == true), and
+                // there's nothing to reset, returns false and let needsResetTransientData throw a more descriptive error.
+                return false;
+            }
+        // Otherwise, forceReset is true, we should proceed to reset as many as we can.
+        }
+        if (!this.nextIteration) {
+            // If there's no next iteration, we need to reset all the read requests.
+            this.noteHashResetActions = resetActions;
+            this.requestedDimensions.NOTE_HASH_PENDING_READ = numPendingReads;
+            this.requestedDimensions.NOTE_HASH_SETTLED_READ = numSettledReads;
+        } else {
+            // If there's a next iteration, only one dimension can be reset at a time.
+            // So we pick the dimension that has more read requests to reset.
+            if (numPendingReads > numSettledReads) {
+                // Reset the pending read requests.
+                const pendingOnlyActions = assertLength(resetActions.actions.map((action)=>action === ReadRequestActionEnum.READ_AS_PENDING ? action : ReadRequestActionEnum.SKIP), MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
+                this.noteHashResetActions = new ReadRequestResetActions(pendingOnlyActions, resetActions.pendingReadHints);
+                this.requestedDimensions.NOTE_HASH_PENDING_READ = numPendingReads;
+            } else {
+                // Reset the settled read requests.
+                const settledOnlyActions = assertLength(resetActions.actions.map((action)=>action === ReadRequestActionEnum.READ_AS_SETTLED ? action : ReadRequestActionEnum.SKIP), MAX_NOTE_HASH_READ_REQUESTS_PER_TX);
+                this.noteHashResetActions = new ReadRequestResetActions(settledOnlyActions, []);
+                this.requestedDimensions.NOTE_HASH_SETTLED_READ = numSettledReads;
+            }
+        }
+        return true;
+    }
+    needsResetNullifierReadRequests(forceReset = false) {
+        const numCurr = this.previousKernel.validationRequests.nullifierReadRequests.claimedLength;
+        const numNext = this.nextIteration ? this.nextIteration.nullifierReadRequests.claimedLength : 0;
+        const maxAmountToKeep = !this.nextIteration || forceReset ? 0 : MAX_NULLIFIER_READ_REQUESTS_PER_TX;
+        if (numCurr + numNext <= maxAmountToKeep) {
+            return false;
+        }
+        const resetActions = getNullifierReadRequestResetActions(this.previousKernel.validationRequests.nullifierReadRequests, this.previousKernel.end.nullifiers);
+        const numPendingReads = resetActions.pendingReadHints.length;
+        const numSettledReads = resetActions.actions.reduce((accum, action)=>accum + (action === ReadRequestActionEnum.READ_AS_SETTLED ? 1 : 0), 0);
+        const totalReadsToReset = numPendingReads + numSettledReads;
+        const minResetNeeded = numCurr + numNext - maxAmountToKeep;
+        if (totalReadsToReset < minResetNeeded) {
+            if (!this.nextIteration) {
+                // In the final reset, all nullifiers have been emitted. So if we can't reset all requests, at least one pending
+                // read request doesn't match any of them.
+                throw new Error('No matching nullifier found for nullifier read request.');
+            } else if (!forceReset) {
+                // A pending read request can only be reset if its nullifier has already been included (e.g. a parent call might
+                // be reading a nullifier emitted by a child call. The read request of the parent call is included before the
+                // nullifier of the child call).
+                // If we can't clear enough read requests to make room for the next iteration's reads, we're stuck.
+                throw new Error('Number of nullifier read requests exceeds the limit.');
+            } else if (totalReadsToReset == 0) {
+                // It's transient data squashing asking for the read requests to be reset first (forceReset == true), and
+                // there's nothing to reset, returns false and let needsResetTransientData throw a more descriptive error.
+                return false;
+            }
+        // Otherwise, forceReset is true, we should proceed to reset as many as we can.
+        }
+        if (!this.nextIteration) {
+            // If there's no next iteration, we need to reset all the read requests.
+            this.nullifierResetActions = resetActions;
+            this.requestedDimensions.NULLIFIER_PENDING_READ = numPendingReads;
+            this.requestedDimensions.NULLIFIER_SETTLED_READ = numSettledReads;
+        } else {
+            // If there's a next iteration, we can only reset one dimension at a time.
+            if (numPendingReads > numSettledReads) {
+                // Reset the pending read requests.
+                const pendingOnlyActions = assertLength(resetActions.actions.map((action)=>action === ReadRequestActionEnum.READ_AS_PENDING ? action : ReadRequestActionEnum.SKIP), MAX_NULLIFIER_READ_REQUESTS_PER_TX);
+                this.nullifierResetActions = new ReadRequestResetActions(pendingOnlyActions, resetActions.pendingReadHints);
+                this.requestedDimensions.NULLIFIER_PENDING_READ = numPendingReads;
+            } else {
+                // Reset the settled read requests.
+                const settledOnlyActions = assertLength(resetActions.actions.map((action)=>action === ReadRequestActionEnum.READ_AS_SETTLED ? action : ReadRequestActionEnum.SKIP), MAX_NULLIFIER_READ_REQUESTS_PER_TX);
+                this.nullifierResetActions = new ReadRequestResetActions(settledOnlyActions, []);
+                this.requestedDimensions.NULLIFIER_SETTLED_READ = numSettledReads;
+            }
+        }
+        return true;
+    }
+    needsResetKeyValidationRequests() {
+        const numCurr = this.previousKernel.validationRequests.scopedKeyValidationRequestsAndSeparators.claimedLength;
+        const numNext = this.nextIteration ? this.nextIteration.keyValidationRequestsAndSeparators.claimedLength : 0;
+        const maxAmountToKeep = !this.nextIteration ? 0 : MAX_KEY_VALIDATION_REQUESTS_PER_TX;
+        if (numCurr + numNext <= maxAmountToKeep) {
+            return false;
+        }
+        this.requestedDimensions.KEY_VALIDATION = numCurr;
+        return true;
+    }
+    needsResetTransientData() {
+        const nextAccumNoteHashes = this.previousKernel.end.noteHashes.claimedLength + (this.nextIteration?.noteHashes.claimedLength ?? 0);
+        const noteHashWillOverflow = nextAccumNoteHashes > MAX_NOTE_HASHES_PER_TX;
+        const nextAccumNullifiers = this.previousKernel.end.nullifiers.claimedLength + (this.nextIteration?.nullifiers.claimedLength ?? 0);
+        const nullifierWillOverflow = nextAccumNullifiers > MAX_NULLIFIERS_PER_TX;
+        const nextAccumLogs = this.previousKernel.end.privateLogs.claimedLength + (this.nextIteration?.privateLogs.claimedLength ?? 0);
+        const logsWillOverflow = nextAccumLogs > MAX_PRIVATE_LOGS_PER_TX;
+        if (this.nextIteration && !noteHashWillOverflow && !nullifierWillOverflow && !logsWillOverflow) {
+            return false;
+        }
+        const futureNoteHashReads = collectNested(this.executionStack, (executionResult)=>executionResult.publicInputs.noteHashReadRequests.getActiveItems());
+        const futureNullifierReads = collectNested(this.executionStack, (executionResult)=>executionResult.publicInputs.nullifierReadRequests.getActiveItems());
+        const futureLogs = collectNested(this.executionStack, (executionResult)=>executionResult.publicInputs.privateLogs.getActiveItems());
+        if (this.nextIteration) {
+            // If it's not the final reset, only one dimension will be reset at a time. Since we are resetting the transient
+            // data, the note hash and nullifier read requests in the previous kernel won't be squashed and need to be
+            // included in the future read requests.
+            futureNoteHashReads.push(...this.previousKernel.validationRequests.noteHashReadRequests.getActiveItems());
+            futureNullifierReads.push(...this.previousKernel.validationRequests.nullifierReadRequests.getActiveItems());
+        }
+        const { numTransientData, hints: transientDataSquashingHints } = buildTransientDataHints(this.previousKernel.end.noteHashes, this.previousKernel.end.nullifiers, futureNoteHashReads, futureNullifierReads, futureLogs, this.noteHashNullifierCounterMap, this.splitCounter);
+        if (this.nextIteration) {
+            const noteHashOverflowBy = noteHashWillOverflow ? nextAccumNoteHashes - MAX_NOTE_HASHES_PER_TX - numTransientData : 0;
+            const nullifierOverflowBy = nullifierWillOverflow ? nextAccumNullifiers - MAX_NULLIFIERS_PER_TX - numTransientData : 0;
+            const numSquashedLogs = logsWillOverflow ? countSquashedLogs(this.previousKernel.end.noteHashes, this.previousKernel.end.privateLogs, transientDataSquashingHints.slice(0, numTransientData)) : 0;
+            const logsOverflowBy = logsWillOverflow ? nextAccumLogs - MAX_PRIVATE_LOGS_PER_TX - numSquashedLogs : 0;
+            if (noteHashOverflowBy > 0 || nullifierOverflowBy > 0 || logsOverflowBy > 0) {
+                // There's not enough transient data to squash to clear space for the overflow. It may be because some data is
+                // still required for read requests. Force a reset of the read requests first, and return to transient data
+                // squashing in the next round of reset.
+                // Note that clearing the read requests might not be enough to clear more space for the overflow. In this case,
+                // running the next reset will fail at the following check.
+                // Only one dimension can be reset at a time for an inner reset, so we try the note hash read requests first
+                // (which also helps with log overflow), then fall back to nullifier read requests.
+                const forceReset = true;
+                if ((noteHashOverflowBy > 0 || logsOverflowBy > 0) && this.needsResetNoteHashReadRequests(forceReset)) {
+                    return true;
+                }
+                if (nullifierOverflowBy > 0 && this.needsResetNullifierReadRequests(forceReset)) {
+                    return true;
+                }
+                if (noteHashWillOverflow) {
+                    throw new Error('Number of note hashes exceeds the limit.');
+                }
+                if (nullifierWillOverflow) {
+                    throw new Error('Number of nullifiers exceeds the limit.');
+                }
+                throw new Error('Number of private logs exceeds the limit.');
+            }
+        }
+        this.numTransientData = numTransientData;
+        this.transientDataSquashingHints = transientDataSquashingHints;
+        this.requestedDimensions.TRANSIENT_DATA_SQUASHING = numTransientData;
+        return numTransientData > 0;
+    }
+    needsSiloNoteHashes() {
+        if (this.numTransientData === undefined) {
+            throw new Error('`needsResetTransientData` must be run before `needsSiloNoteHashes`.');
+        }
+        const noteHashes = this.previousKernel.end.noteHashes;
+        if (noteHashes.claimedLength > 0 && noteHashes.array[0].contractAddress.isZero()) {
+            // Already siloed.
+            return false;
+        }
+        const numToSilo = noteHashes.claimedLength - this.numTransientData;
+        this.requestedDimensions.NOTE_HASH_SILOING = numToSilo;
+        return numToSilo > 0;
+    }
+    needsSiloNullifiers() {
+        if (this.numTransientData === undefined) {
+            throw new Error('`needsResetTransientData` must be run before `needsSiloNullifiers`.');
+        }
+        const nullifiers = this.previousKernel.end.nullifiers;
+        if (nullifiers.claimedLength > 0 && nullifiers.array[0].contractAddress.isZero()) {
+            // Already siloed.
+            return false;
+        }
+        const numToSilo = nullifiers.claimedLength - this.numTransientData;
+        this.requestedDimensions.NULLIFIER_SILOING = numToSilo;
+        return numToSilo > 0;
+    }
+    needsSiloPrivateLogs() {
+        if (this.numTransientData === undefined) {
+            throw new Error('`needsResetTransientData` must be run before `needsSiloPrivateLogs`.');
+        }
+        const privateLogs = this.previousKernel.end.privateLogs;
+        if (privateLogs.claimedLength > 0 && privateLogs.array[0].contractAddress.isZero()) {
+            // Already siloed.
+            return false;
+        }
+        const numSquashedLogs = countSquashedLogs(this.previousKernel.end.noteHashes, privateLogs, this.transientDataSquashingHints.slice(0, this.numTransientData));
+        const numToSilo = privateLogs.claimedLength - numSquashedLogs;
+        this.requestedDimensions.PRIVATE_LOG_SILOING = numToSilo;
+        return numToSilo > 0;
+    }
+}