@aztec/p2p 0.0.1-commit.fcb71a6 → 0.0.1-commit.ff7989d6c

package/dest/mem_pools/tx_pool/eviction/nullifier_conflict_pre_add_rule.js

@@ -0,0 +1,57 @@
+import { findIndexInSortedArray, insertIntoSortedArray } from '@aztec/foundation/array';
+import { Fr } from '@aztec/foundation/curves/bn254';
+import { createLogger } from '@aztec/foundation/log';
+const cmpTxHash = (a, b)=>Fr.cmp(a.hash, b.hash);
+/**
+ * Pre-add eviction rule that checks for nullifier conflicts between incoming and existing transactions.
+ *
+ * When an incoming tx shares nullifiers with existing pending txs:
+ * - If the incoming tx has strictly higher priority fee, evict all conflicting txs
+ * - If any conflicting tx has equal or higher priority fee, reject the incoming tx
+ *
+ * This prevents nullifier spam attacks where an attacker floods the mempool with
+ * transactions spending the same nullifiers.
+ */ export class NullifierConflictPreAddRule {
+    name = 'NullifierConflictPreAdd';
+    log = createLogger('p2p:mempool:tx_pool:nullifier_conflict_pre_add_rule');
+    /**
+   * Check if the incoming transaction conflicts with existing transactions via nullifiers.
+   *
+   * @param tx - The incoming transaction
+   * @param poolAccess - Read-only access to pool state
+   * @returns Result with rejection status and txs to evict
+   */ async check(tx, poolAccess) {
+        const txHash = tx.getTxHash();
+        const nullifiers = tx.data.getNonEmptyNullifiers();
+        const txHashesToEvict = [];
+        const incomingPriority = poolAccess.getTxPriority(tx);
+        for (const nullifier of nullifiers){
+            const conflictingHash = await poolAccess.getTxHashByNullifier(nullifier);
+            if (!conflictingHash || conflictingHash.equals(txHash) || findIndexInSortedArray(txHashesToEvict, conflictingHash, cmpTxHash) !== -1) {
+                continue;
+            }
+            // Get the conflicting tx's priority
+            const conflictingTx = await poolAccess.getPendingTxByHash(conflictingHash);
+            if (!conflictingTx) {
+                continue;
+            }
+            const conflictingPriority = poolAccess.getTxPriority(conflictingTx);
+            // If incoming tx has strictly higher priority, mark for eviction
+            // Otherwise, reject incoming tx (ties go to existing tx)
+            if (incomingPriority > conflictingPriority) {
+                insertIntoSortedArray(txHashesToEvict, conflictingHash, cmpTxHash);
+            } else {
+                this.log.debug(`Rejecting tx ${txHash.toString()}: nullifier conflict with ${conflictingHash.toString()} which has higher or equal fee`);
+                return {
+                    shouldReject: true,
+                    txHashesToEvict: [],
+                    reason: `nullifier conflict with ${conflictingHash.toString()}`
+                };
+            }
+        }
+        return {
+            shouldReject: false,
+            txHashesToEvict
+        };
+    }
+}

package/dest/mem_pools/tx_pool_v2/archive/index.d.ts

@@ -0,0 +1,2 @@
+export { TxArchive } from './tx_archive.js';
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguZC50cyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9tZW1fcG9vbHMvdHhfcG9vbF92Mi9hcmNoaXZlL2luZGV4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBRSxTQUFTLEVBQUUsTUFBTSxpQkFBaUIsQ0FBQyJ9

package/dest/mem_pools/tx_pool_v2/archive/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/mem_pools/tx_pool_v2/archive/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC"}

package/dest/mem_pools/tx_pool_v2/archive/index.js

@@ -0,0 +1 @@
+export { TxArchive } from './tx_archive.js';

package/dest/mem_pools/tx_pool_v2/archive/tx_archive.d.ts

@@ -0,0 +1,43 @@
+import { type Logger } from '@aztec/foundation/log';
+import type { AztecAsyncKVStore } from '@aztec/kv-store';
+import { Tx, TxHash } from '@aztec/stdlib/tx';
+/**
+ * Manages archived transactions with FIFO eviction.
+ * Archived transactions have their proofs stripped to save space.
+ */
+export declare class TxArchive {
+    #private;
+    constructor(store: AztecAsyncKVStore, limit: number, log?: Logger);
+    /**
+     * Updates the maximum number of archived transactions.
+     */
+    updateLimit(limit: number): void;
+    /**
+     * Gets the current archive limit.
+     */
+    getLimit(): number;
+    /**
+     * Checks if archiving is enabled.
+     */
+    isEnabled(): boolean;
+    /**
+     * Archives transactions, stripping their proofs.
+     * Evicts oldest transactions if the limit is exceeded.
+     */
+    archiveTxs(txs: Tx[]): Promise<void>;
+    /**
+     * Retrieves an archived transaction by its hash.
+     */
+    getTxByHash(txHash: TxHash): Promise<Tx | undefined>;
+    /**
+     * Gets the current count of archived transactions.
+     */
+    getCount(): Promise<number>;
+    /**
+     * Strips the proof from a transaction for archival.
+     */
+    private stripProof;
+    private getHeadIndex;
+    private getTailIndex;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHhfYXJjaGl2ZS5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL21lbV9wb29scy90eF9wb29sX3YyL2FyY2hpdmUvdHhfYXJjaGl2ZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxPQUFPLEVBQUUsS0FBSyxNQUFNLEVBQWdCLE1BQU0sdUJBQXVCLENBQUM7QUFDbEUsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQWlCLE1BQU0saUJBQWlCLENBQUM7QUFFeEUsT0FBTyxFQUFFLEVBQUUsRUFBRSxNQUFNLEVBQUUsTUFBTSxrQkFBa0IsQ0FBQztBQUU5Qzs7O0dBR0c7QUFDSCxxQkFBYSxTQUFTOztJQU9wQixZQUFZLEtBQUssRUFBRSxpQkFBaUIsRUFBRSxLQUFLLEVBQUUsTUFBTSxFQUFFLEdBQUcsQ0FBQyxFQUFFLE1BQU0sRUFNaEU7SUFFRDs7T0FFRztJQUNILFdBQVcsQ0FBQyxLQUFLLEVBQUUsTUFBTSxHQUFHLElBQUksQ0FFL0I7SUFFRDs7T0FFRztJQUNILFFBQVEsSUFBSSxNQUFNLENBRWpCO0lBRUQ7O09BRUc7SUFDSCxTQUFTLElBQUksT0FBTyxDQUVuQjtJQUVEOzs7T0FHRztJQUNHLFVBQVUsQ0FBQyxHQUFHLEVBQUUsRUFBRSxFQUFFLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQW1DekM7SUFFRDs7T0FFRztJQUNHLFdBQVcsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FBQyxFQUFFLEdBQUcsU0FBUyxDQUFDLENBR3pEO0lBRUQ7O09BRUc7SUFDRyxRQUFRLElBQUksT0FBTyxDQUFDLE1BQU0sQ0FBQyxDQUloQztJQUVEOztPQUVHO0lBQ0gsT0FBTyxDQUFDLFVBQVU7WUFJSixZQUFZO1lBS1osWUFBWTtDQUkzQiJ9

package/dest/mem_pools/tx_pool_v2/archive/tx_archive.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tx_archive.d.ts","sourceRoot":"","sources":["../../../../src/mem_pools/tx_pool_v2/archive/tx_archive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,MAAM,EAAgB,MAAM,uBAAuB,CAAC;AAClE,OAAO,KAAK,EAAE,iBAAiB,EAAiB,MAAM,iBAAiB,CAAC;AAExE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;;GAGG;AACH,qBAAa,SAAS;;IAOpB,YAAY,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAMhE;IAED;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAE/B;IAED;;OAEG;IACH,QAAQ,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,SAAS,IAAI,OAAO,CAEnB;IAED;;;OAGG;IACG,UAAU,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAmCzC;IAED;;OAEG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,GAAG,SAAS,CAAC,CAGzD;IAED;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC,CAIhC;IAED;;OAEG;IACH,OAAO,CAAC,UAAU;YAIJ,YAAY;YAKZ,YAAY;CAI3B"}

package/dest/mem_pools/tx_pool_v2/archive/tx_archive.js

@@ -0,0 +1,103 @@
+import { createLogger } from '@aztec/foundation/log';
+import { ChonkProof } from '@aztec/stdlib/proofs';
+import { Tx } from '@aztec/stdlib/tx';
+/**
+ * Manages archived transactions with FIFO eviction.
+ * Archived transactions have their proofs stripped to save space.
+ */ export class TxArchive {
+    #store;
+    #txs;
+    #indices;
+    #limit;
+    #log;
+    constructor(store, limit, log){
+        this.#store = store;
+        this.#txs = store.openMap('archivedTxs');
+        this.#indices = store.openMap('archivedTxIndices');
+        this.#limit = limit;
+        this.#log = log ?? createLogger('p2p:tx_pool_v2:archive');
+    }
+    /**
+   * Updates the maximum number of archived transactions.
+   */ updateLimit(limit) {
+        this.#limit = limit;
+    }
+    /**
+   * Gets the current archive limit.
+   */ getLimit() {
+        return this.#limit;
+    }
+    /**
+   * Checks if archiving is enabled.
+   */ isEnabled() {
+        return this.#limit > 0;
+    }
+    /**
+   * Archives transactions, stripping their proofs.
+   * Evicts oldest transactions if the limit is exceeded.
+   */ async archiveTxs(txs) {
+        if (!this.isEnabled() || txs.length === 0) {
+            return;
+        }
+        try {
+            await this.#store.transactionAsync(async ()=>{
+                // Get current head and tail indices
+                let headIdx = await this.getHeadIndex();
+                let tailIdx = await this.getTailIndex();
+                for (const tx of txs){
+                    // Evict oldest entries if at capacity
+                    while(headIdx - tailIdx >= this.#limit){
+                        const txHashToEvict = await this.#indices.getAsync(tailIdx);
+                        if (txHashToEvict) {
+                            await this.#txs.delete(txHashToEvict);
+                            await this.#indices.delete(tailIdx);
+                        }
+                        tailIdx++;
+                    }
+                    // Archive the transaction with stripped proof
+                    const archivedTx = this.stripProof(tx);
+                    const txHash = tx.getTxHash().toString();
+                    await this.#txs.set(txHash, archivedTx.toBuffer());
+                    await this.#indices.set(headIdx, txHash);
+                    headIdx++;
+                }
+                this.#log.debug(`Archived ${txs.length} txs, total: ${headIdx - tailIdx}`);
+            });
+        } catch (error) {
+            this.#log.error('Error archiving transactions', {
+                error
+            });
+        }
+    }
+    /**
+   * Retrieves an archived transaction by its hash.
+   */ async getTxByHash(txHash) {
+        const buffer = await this.#txs.getAsync(txHash.toString());
+        return buffer ? Tx.fromBuffer(buffer) : undefined;
+    }
+    /**
+   * Gets the current count of archived transactions.
+   */ async getCount() {
+        const head = await this.getHeadIndex();
+        const tail = await this.getTailIndex();
+        return head - tail;
+    }
+    /**
+   * Strips the proof from a transaction for archival.
+   */ stripProof(tx) {
+        return new Tx(tx.txHash, tx.data, ChonkProof.empty(), tx.contractClassLogFields, tx.publicFunctionCalldata);
+    }
+    async getHeadIndex() {
+        const entry = await this.#indices.entriesAsync({
+            limit: 1,
+            reverse: true
+        }).next();
+        return (entry.value?.[0] ?? -1) + 1;
+    }
+    async getTailIndex() {
+        const entry = await this.#indices.entriesAsync({
+            limit: 1
+        }).next();
+        return entry.value?.[0] ?? 0;
+    }
+}

package/dest/mem_pools/tx_pool_v2/deleted_pool.d.ts

@@ -0,0 +1,104 @@
+import { BlockNumber, SlotNumber } from '@aztec/foundation/branded-types';
+import type { Logger } from '@aztec/foundation/log';
+import type { AztecAsyncKVStore, AztecAsyncMap } from '@aztec/kv-store';
+/**
+ * Manages all transaction deletions in the pool.
+ *
+ * When a chain prune (reorg) happens, transactions from pruned blocks are tracked here.
+ * This class is responsible for ALL deletion decisions:
+ *
+ * - Transactions from pruned blocks are "prune-soft-deleted" - removed from indices but kept
+ *   in the database for later re-execution until their mined block is finalized
+ * - Transactions NOT from pruned blocks are "slot-soft-deleted" - kept in the database
+ *   until the next slot, so other nodes can still fetch them via reqresp
+ *
+ * When a block is finalized, prune-soft-deleted transactions that were originally mined at or
+ * before that block number are permanently (hard) deleted. Slot-soft-deleted transactions
+ * are hard-deleted when `prepareForSlot` advances to a new slot.
+ */
+export declare class DeletedPool {
+    #private;
+    constructor(store: AztecAsyncKVStore, txsDB: AztecAsyncMap<string, Buffer>, log: Logger);
+    /**
+     * Loads state from the database on startup.
+     * Slot-deleted txs are stale after restart and are immediately hard-deleted.
+     */
+    hydrateFromDatabase(): Promise<void>;
+    /**
+     * Marks transactions as being from a pruned block.
+     * Called during handlePrunedBlocks for ALL transactions that were un-mined.
+     *
+     * If a tx was previously tracked (e.g., mined at block 4, pruned, re-mined at block 5,
+     * pruned again), updates to the higher block number. This ensures the tx is kept until
+     * its most recent mined block is finalized.
+     *
+     * @param txs - Array of {txHash, minedAtBlock} pairs, where minedAtBlock is the block
+     *              number in which the tx was mined before being un-mined
+     */
+    markFromPrunedBlock(txs: {
+        txHash: string;
+        minedAtBlock: BlockNumber;
+    }[]): Promise<void>;
+    /**
+     * Deletes a transaction. This is the single entry point for ALL deletions.
+     * The tx is always soft-deleted (kept in DB):
+     *
+     * - If the tx is from a pruned block: prune-soft-delete (kept until finalized)
+     * - If the tx is NOT from a pruned block: slot-soft-delete (kept until next slot)
+     */
+    deleteTx(txHash: string): Promise<void>;
+    /**
+     * Clears tracking for a transaction if it re-mines at a block number >= the tracked minedAtBlock.
+     *
+     * When a tx re-mines at a higher (or equal) block, the old high-water mark is no longer needed:
+     * any future prune would re-add the tx with an even higher block number. Clearing keeps
+     * DeletedPool consistent — only txs that are actually un-mined should be tracked here.
+     *
+     * When a tx re-mines at a lower block, we must preserve the existing entry to retain
+     * the high-water mark for re-execution purposes.
+     */
+    clearIfMinedHigher(txHash: string, minedAtBlock: BlockNumber): Promise<void>;
+    /**
+     * Checks if a transaction is from a pruned block.
+     */
+    isFromPrunedBlock(txHash: string): boolean;
+    /**
+     * Checks if a transaction is soft-deleted (either prune-based or slot-based).
+     */
+    isSoftDeleted(txHash: string): boolean;
+    /**
+     * Gets the block number in which a transaction was originally mined.
+     */
+    getMinedAtBlock(txHash: string): BlockNumber | undefined;
+    /**
+     * Finalizes transactions when a block is finalized.
+     * Hard-deletes transactions that were originally mined at or before the finalized block.
+     *
+     * @returns The hashes of transactions that were hard-deleted
+     */
+    finalizeBlock(finalizedBlockNumber: BlockNumber): Promise<string[]>;
+    /**
+     * Cleans up slot-deleted transactions from previous slots.
+     * Called at the start of prepareForSlot. Updates #currentSlot and hard-deletes
+     * any txs that were deleted in an earlier slot.
+     */
+    cleanupSlotDeleted(currentSlot: SlotNumber): Promise<void>;
+    /**
+     * Clears soft-deletion status for a transaction being re-added to the pool.
+     * Removes slot-deleted tracking entirely, and resets the prune-soft-deleted flag
+     * while preserving the prune tracking itself (so a subsequent delete still uses
+     * the prune path).
+     */
+    clearSoftDeleted(txHash: string): Promise<void>;
+    /**
+     * Gets the count of transactions from pruned blocks.
+     */
+    getCount(): number;
+    /** Gets the count of soft-deleted transactions (both prune-based and slot-based). */
+    getSoftDeletedCount(): number;
+    /**
+     * Gets all transaction hashes from pruned blocks.
+     */
+    getPrunedTxHashes(): string[];
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZGVsZXRlZF9wb29sLmQudHMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvbWVtX3Bvb2xzL3R4X3Bvb2xfdjIvZGVsZXRlZF9wb29sLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiJBQUFBLE9BQU8sRUFBRSxXQUFXLEVBQUUsVUFBVSxFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFDMUUsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0sdUJBQXVCLENBQUM7QUFDcEQsT0FBTyxLQUFLLEVBQUUsaUJBQWlCLEVBQUUsYUFBYSxFQUFpQixNQUFNLGlCQUFpQixDQUFDO0FBaUN2Rjs7Ozs7Ozs7Ozs7Ozs7R0FjRztBQUNILHFCQUFhLFdBQVc7O0lBcUJ0QixZQUFZLEtBQUssRUFBRSxpQkFBaUIsRUFBRSxLQUFLLEVBQUUsYUFBYSxDQUFDLE1BQU0sRUFBRSxNQUFNLENBQUMsRUFBRSxHQUFHLEVBQUUsTUFBTSxFQUt0RjtJQUVEOzs7T0FHRztJQUNHLG1CQUFtQixJQUFJLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0E0QnpDO0lBRUQ7Ozs7Ozs7Ozs7T0FVRztJQUNHLG1CQUFtQixDQUFDLEdBQUcsRUFBRTtRQUFFLE1BQU0sRUFBRSxNQUFNLENBQUM7UUFBQyxZQUFZLEVBQUUsV0FBVyxDQUFBO0tBQUUsRUFBRSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0F1QjdGO0lBRUQ7Ozs7OztPQU1HO0lBQ0csUUFBUSxDQUFDLE1BQU0sRUFBRSxNQUFNLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQWU1QztJQUVEOzs7Ozs7Ozs7T0FTRztJQUNHLGtCQUFrQixDQUFDLE1BQU0sRUFBRSxNQUFNLEVBQUUsWUFBWSxFQUFFLFdBQVcsR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBU2pGO0lBRUQ7O09BRUc7SUFDSCxpQkFBaUIsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FFekM7SUFFRDs7T0FFRztJQUNILGFBQWEsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLE9BQU8sQ0FFckM7SUFFRDs7T0FFRztJQUNILGVBQWUsQ0FBQyxNQUFNLEVBQUUsTUFBTSxHQUFHLFdBQVcsR0FBRyxTQUFTLENBRXZEO0lBRUQ7Ozs7O09BS0c7SUFDRyxhQUFhLENBQUMsb0JBQW9CLEVBQUUsV0FBVyxHQUFHLE9BQU8sQ0FBQyxNQUFNLEVBQUUsQ0FBQyxDQXVCeEU7SUFFRDs7OztPQUlHO0lBQ0csa0JBQWtCLENBQUMsV0FBVyxFQUFFLFVBQVUsR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBeUIvRDtJQUVEOzs7OztPQUtHO0lBQ0csZ0JBQWdCLENBQUMsTUFBTSxFQUFFLE1BQU0sR0FBRyxPQUFPLENBQUMsSUFBSSxDQUFDLENBV3BEO0lBRUQ7O09BRUc7SUFDSCxRQUFRLElBQUksTUFBTSxDQUVqQjtJQUVELHFGQUFxRjtJQUNyRixtQkFBbUIsSUFBSSxNQUFNLENBUTVCO0lBRUQ7O09BRUc7SUFDSCxpQkFBaUIsSUFBSSxNQUFNLEVBQUUsQ0FFNUI7Q0FDRiJ9

package/dest/mem_pools/tx_pool_v2/deleted_pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deleted_pool.d.ts","sourceRoot":"","sources":["../../../src/mem_pools/tx_pool_v2/deleted_pool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAC1E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,aAAa,EAAiB,MAAM,iBAAiB,CAAC;AAiCvF;;;;;;;;;;;;;;GAcG;AACH,qBAAa,WAAW;;IAqBtB,YAAY,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,EAKtF;IAED;;;OAGG;IACG,mBAAmB,IAAI,OAAO,CAAC,IAAI,CAAC,CA4BzC;IAED;;;;;;;;;;OAUG;IACG,mBAAmB,CAAC,GAAG,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,WAAW,CAAA;KAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAuB7F;IAED;;;;;;OAMG;IACG,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAe5C;IAED;;;;;;;;;OASG;IACG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CASjF;IAED;;OAEG;IACH,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEzC;IAED;;OAEG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAErC;IAED;;OAEG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAEvD;IAED;;;;;OAKG;IACG,aAAa,CAAC,oBAAoB,EAAE,WAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAuBxE;IAED;;;;OAIG;IACG,kBAAkB,CAAC,WAAW,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAyB/D;IAED;;;;;OAKG;IACG,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAWpD;IAED;;OAEG;IACH,QAAQ,IAAI,MAAM,CAEjB;IAED,qFAAqF;IACrF,mBAAmB,IAAI,MAAM,CAQ5B;IAED;;OAEG;IACH,iBAAiB,IAAI,MAAM,EAAE,CAE5B;CACF"}

package/dest/mem_pools/tx_pool_v2/deleted_pool.js

@@ -0,0 +1,251 @@
+import { BlockNumber, SlotNumber } from '@aztec/foundation/branded-types';
+/**
+ * Serializes DeletedTxState to a Buffer.
+ * Format: 4 bytes for blockNumber (uint32) + 1 byte for softDeleted (0 or 1)
+ */ function serializeState(state) {
+    const buffer = Buffer.alloc(5);
+    buffer.writeUInt32BE(Number(state.minedAtBlock), 0);
+    buffer.writeUInt8(state.softDeleted ? 1 : 0, 4);
+    return buffer;
+}
+/**
+ * Deserializes a Buffer to DeletedTxState.
+ */ function deserializeState(buffer) {
+    return {
+        minedAtBlock: BlockNumber(buffer.readUInt32BE(0)),
+        softDeleted: buffer.readUInt8(4) === 1
+    };
+}
+/**
+ * Manages all transaction deletions in the pool.
+ *
+ * When a chain prune (reorg) happens, transactions from pruned blocks are tracked here.
+ * This class is responsible for ALL deletion decisions:
+ *
+ * - Transactions from pruned blocks are "prune-soft-deleted" - removed from indices but kept
+ *   in the database for later re-execution until their mined block is finalized
+ * - Transactions NOT from pruned blocks are "slot-soft-deleted" - kept in the database
+ *   until the next slot, so other nodes can still fetch them via reqresp
+ *
+ * When a block is finalized, prune-soft-deleted transactions that were originally mined at or
+ * before that block number are permanently (hard) deleted. Slot-soft-deleted transactions
+ * are hard-deleted when `prepareForSlot` advances to a new slot.
+ */ export class DeletedPool {
+    /** Persisted map: txHash -> DeletedTxState (serialized) - for prune-based soft deletions */ #deletedTxsDB;
+    /** Reference to the main txs database for hard deletion */ #txsDB;
+    /** In-memory state for transactions from pruned blocks */ #state = new Map();
+    /** In-memory tracking: txHash -> slot at which the tx was deleted */ #slotDeletedTxs = new Map();
+    /** Persisted set tracking which txs are slot-deleted, for hydration cleanup. */ #slotDeletedDB;
+    /** Current slot number, updated by cleanupSlotDeleted */ #currentSlot = SlotNumber(0);
+    #log;
+    constructor(store, txsDB, log){
+        this.#deletedTxsDB = store.openMap('deleted_txs');
+        this.#slotDeletedDB = store.openSet('slot_deleted_txs');
+        this.#txsDB = txsDB;
+        this.#log = log;
+    }
+    /**
+   * Loads state from the database on startup.
+   * Slot-deleted txs are stale after restart and are immediately hard-deleted.
+   */ async hydrateFromDatabase() {
+        let prunedCount = 0;
+        let softDeletedCount = 0;
+        for await (const [txHash, buffer] of this.#deletedTxsDB.entriesAsync()){
+            const state = deserializeState(buffer);
+            this.#state.set(txHash, state);
+            prunedCount++;
+            if (state.softDeleted) {
+                softDeletedCount++;
+            }
+        }
+        if (prunedCount > 0 || softDeletedCount > 0) {
+            this.#log.info(`Loaded ${prunedCount} txs from pruned blocks, ${softDeletedCount} soft-deleted`);
+        }
+        // Slot-deleted txs are stale after restart - hard-delete them all
+        let slotDeletedCount = 0;
+        for await (const txHash of this.#slotDeletedDB.entriesAsync()){
+            await this.#txsDB.delete(txHash);
+            await this.#slotDeletedDB.delete(txHash);
+            slotDeletedCount++;
+        }
+        if (slotDeletedCount > 0) {
+            this.#log.info(`Hard-deleted ${slotDeletedCount} stale slot-deleted txs on startup`);
+        }
+    }
+    /**
+   * Marks transactions as being from a pruned block.
+   * Called during handlePrunedBlocks for ALL transactions that were un-mined.
+   *
+   * If a tx was previously tracked (e.g., mined at block 4, pruned, re-mined at block 5,
+   * pruned again), updates to the higher block number. This ensures the tx is kept until
+   * its most recent mined block is finalized.
+   *
+   * @param txs - Array of {txHash, minedAtBlock} pairs, where minedAtBlock is the block
+   *              number in which the tx was mined before being un-mined
+   */ async markFromPrunedBlock(txs) {
+        if (txs.length === 0) {
+            return;
+        }
+        let count = 0;
+        for (const { txHash, minedAtBlock } of txs){
+            const existing = this.#state.get(txHash);
+            // Update if not tracked, or if this is a higher mined block (tx was re-mined then pruned again)
+            if (existing === undefined || minedAtBlock > existing.minedAtBlock) {
+                const state = {
+                    minedAtBlock,
+                    softDeleted: existing?.softDeleted ?? false
+                };
+                this.#state.set(txHash, state);
+                await this.#deletedTxsDB.set(txHash, serializeState(state));
+                count++;
+            }
+        }
+        if (count > 0) {
+            this.#log.info(`Marked ${count} transactions from pruned blocks`);
+        }
+    }
+    /**
+   * Deletes a transaction. This is the single entry point for ALL deletions.
+   * The tx is always soft-deleted (kept in DB):
+   *
+   * - If the tx is from a pruned block: prune-soft-delete (kept until finalized)
+   * - If the tx is NOT from a pruned block: slot-soft-delete (kept until next slot)
+   */ async deleteTx(txHash) {
+        const existing = this.#state.get(txHash);
+        if (existing !== undefined) {
+            // Prune-soft-delete - keep in DB until finalized
+            const state = {
+                minedAtBlock: existing.minedAtBlock,
+                softDeleted: true
+            };
+            this.#state.set(txHash, state);
+            await this.#deletedTxsDB.set(txHash, serializeState(state));
+        } else {
+            // Slot-soft-delete - keep in DB until next slot
+            this.#slotDeletedTxs.set(txHash, this.#currentSlot);
+            await this.#slotDeletedDB.add(txHash);
+        }
+    }
+    /**
+   * Clears tracking for a transaction if it re-mines at a block number >= the tracked minedAtBlock.
+   *
+   * When a tx re-mines at a higher (or equal) block, the old high-water mark is no longer needed:
+   * any future prune would re-add the tx with an even higher block number. Clearing keeps
+   * DeletedPool consistent — only txs that are actually un-mined should be tracked here.
+   *
+   * When a tx re-mines at a lower block, we must preserve the existing entry to retain
+   * the high-water mark for re-execution purposes.
+   */ async clearIfMinedHigher(txHash, minedAtBlock) {
+        const existing = this.#state.get(txHash);
+        if (existing !== undefined && minedAtBlock >= existing.minedAtBlock) {
+            this.#state.delete(txHash);
+            await this.#deletedTxsDB.delete(txHash);
+            this.#log.debug(`Cleared tracking for tx ${txHash}: re-mined at block ${minedAtBlock} (was ${existing.minedAtBlock})`);
+        }
+    }
+    /**
+   * Checks if a transaction is from a pruned block.
+   */ isFromPrunedBlock(txHash) {
+        return this.#state.has(txHash);
+    }
+    /**
+   * Checks if a transaction is soft-deleted (either prune-based or slot-based).
+   */ isSoftDeleted(txHash) {
+        return (this.#state.get(txHash)?.softDeleted ?? false) || this.#slotDeletedTxs.has(txHash);
+    }
+    /**
+   * Gets the block number in which a transaction was originally mined.
+   */ getMinedAtBlock(txHash) {
+        return this.#state.get(txHash)?.minedAtBlock;
+    }
+    /**
+   * Finalizes transactions when a block is finalized.
+   * Hard-deletes transactions that were originally mined at or before the finalized block.
+   *
+   * @returns The hashes of transactions that were hard-deleted
+   */ async finalizeBlock(finalizedBlockNumber) {
+        const toHardDelete = [];
+        for (const [txHash, state] of this.#state){
+            if (state.softDeleted && state.minedAtBlock <= finalizedBlockNumber) {
+                toHardDelete.push(txHash);
+            }
+        }
+        if (toHardDelete.length === 0) {
+            return [];
+        }
+        // Hard-delete from all stores
+        for (const txHash of toHardDelete){
+            this.#state.delete(txHash);
+            await this.#deletedTxsDB.delete(txHash);
+            await this.#txsDB.delete(txHash);
+        }
+        this.#log.debug(`Finalized ${toHardDelete.length} txs from pruned blocks at block ${finalizedBlockNumber}`, {
+            txHashes: toHardDelete
+        });
+        return toHardDelete;
+    }
+    /**
+   * Cleans up slot-deleted transactions from previous slots.
+   * Called at the start of prepareForSlot. Updates #currentSlot and hard-deletes
+   * any txs that were deleted in an earlier slot.
+   */ async cleanupSlotDeleted(currentSlot) {
+        const previousSlot = this.#currentSlot;
+        this.#currentSlot = currentSlot;
+        const toHardDelete = [];
+        for (const [txHash, deletedAtSlot] of this.#slotDeletedTxs){
+            if (deletedAtSlot < currentSlot) {
+                toHardDelete.push(txHash);
+            }
+        }
+        if (toHardDelete.length === 0) {
+            return;
+        }
+        for (const txHash of toHardDelete){
+            this.#slotDeletedTxs.delete(txHash);
+            await this.#slotDeletedDB.delete(txHash);
+            await this.#txsDB.delete(txHash);
+        }
+        this.#log.debug(`Cleaned up ${toHardDelete.length} slot-deleted txs from slot ${previousSlot} (now slot ${currentSlot})`, {
+            txHashes: toHardDelete
+        });
+    }
+    /**
+   * Clears soft-deletion status for a transaction being re-added to the pool.
+   * Removes slot-deleted tracking entirely, and resets the prune-soft-deleted flag
+   * while preserving the prune tracking itself (so a subsequent delete still uses
+   * the prune path).
+   */ async clearSoftDeleted(txHash) {
+        if (this.#slotDeletedTxs.has(txHash)) {
+            this.#slotDeletedTxs.delete(txHash);
+            await this.#slotDeletedDB.delete(txHash);
+        }
+        const existing = this.#state.get(txHash);
+        if (existing?.softDeleted) {
+            const state = {
+                minedAtBlock: existing.minedAtBlock,
+                softDeleted: false
+            };
+            this.#state.set(txHash, state);
+            await this.#deletedTxsDB.set(txHash, serializeState(state));
+        }
+    }
+    /**
+   * Gets the count of transactions from pruned blocks.
+   */ getCount() {
+        return this.#state.size;
+    }
+    /** Gets the count of soft-deleted transactions (both prune-based and slot-based). */ getSoftDeletedCount() {
+        let count = this.#slotDeletedTxs.size;
+        for (const state of this.#state.values()){
+            if (state.softDeleted) {
+                count++;
+            }
+        }
+        return count;
+    }
+    /**
+   * Gets all transaction hashes from pruned blocks.
+   */ getPrunedTxHashes() {
+        return Array.from(this.#state.keys());
+    }
+}

package/dest/mem_pools/tx_pool_v2/eviction/eviction_manager.d.ts

@@ -0,0 +1,47 @@
+import type { BlockNumber } from '@aztec/foundation/branded-types';
+import type { Logger } from '@aztec/foundation/log';
+import type { BlockHeader } from '@aztec/stdlib/tx';
+import type { TxMetaData } from '../tx_metadata.js';
+import { type EvictionConfig, type EvictionRule, type PoolOperations, type PreAddContext, type PreAddPoolAccess, type PreAddResult, type PreAddRule } from './interfaces.js';
+/**
+ * Manages eviction rules for the transaction pool.
+ * Coordinates pre-add rules (run during addPendingTxs) and post-event rules (run after events).
+ */
+export declare class EvictionManager {
+    private pool;
+    private log;
+    private preAddRules;
+    private postEventRules;
+    constructor(pool: PoolOperations, log: Logger);
+    /**
+     * Registers a pre-add rule that runs during transaction addition.
+     */
+    registerPreAddRule(rule: PreAddRule): void;
+    /**
+     * Registers a post-event eviction rule that runs after events.
+     */
+    registerRule(rule: EvictionRule): void;
+    /**
+     * Runs all pre-add rules for an incoming transaction.
+     * Returns combined result of all rules.
+     */
+    runPreAddRules(incomingMeta: TxMetaData, poolAccess: PreAddPoolAccess, context?: PreAddContext): Promise<PreAddResult>;
+    /**
+     * Runs post-event eviction after new transactions are added.
+     */
+    evictAfterNewTxs(newTxHashes: string[], feePayers: string[]): Promise<void>;
+    /**
+     * Runs post-event eviction after a block is mined.
+     */
+    evictAfterNewBlock(block: BlockHeader, newNullifiers: string[], feePayers: string[]): Promise<void>;
+    /**
+     * Runs post-event eviction after a chain prune (reorg).
+     */
+    evictAfterChainPrune(blockNumber: BlockNumber): Promise<void>;
+    /**
+     * Updates configuration for all rules.
+     */
+    updateConfig(config: EvictionConfig): void;
+    private runPostEventRules;
+}
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZXZpY3Rpb25fbWFuYWdlci5kLnRzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL21lbV9wb29scy90eF9wb29sX3YyL2V2aWN0aW9uL2V2aWN0aW9uX21hbmFnZXIudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQUEsT0FBTyxLQUFLLEVBQUUsV0FBVyxFQUFFLE1BQU0saUNBQWlDLENBQUM7QUFDbkUsT0FBTyxLQUFLLEVBQUUsTUFBTSxFQUFFLE1BQU0sdUJBQXVCLENBQUM7QUFDcEQsT0FBTyxLQUFLLEVBQUUsV0FBVyxFQUFFLE1BQU0sa0JBQWtCLENBQUM7QUFFcEQsT0FBTyxLQUFLLEVBQUUsVUFBVSxFQUFFLE1BQU0sbUJBQW1CLENBQUM7QUFDcEQsT0FBTyxFQUNMLEtBQUssY0FBYyxFQUduQixLQUFLLFlBQVksRUFDakIsS0FBSyxjQUFjLEVBQ25CLEtBQUssYUFBYSxFQUNsQixLQUFLLGdCQUFnQixFQUNyQixLQUFLLFlBQVksRUFDakIsS0FBSyxVQUFVLEVBR2hCLE1BQU0saUJBQWlCLENBQUM7QUFFekI7OztHQUdHO0FBQ0gscUJBQWEsZUFBZTtJQUt4QixPQUFPLENBQUMsSUFBSTtJQUNaLE9BQU8sQ0FBQyxHQUFHO0lBTGIsT0FBTyxDQUFDLFdBQVcsQ0FBb0I7SUFDdkMsT0FBTyxDQUFDLGNBQWMsQ0FBc0I7SUFFNUMsWUFDVSxJQUFJLEVBQUUsY0FBYyxFQUNwQixHQUFHLEVBQUUsTUFBTSxFQUNqQjtJQUVKOztPQUVHO0lBQ0gsa0JBQWtCLENBQUMsSUFBSSxFQUFFLFVBQVUsR0FBRyxJQUFJLENBR3pDO0lBRUQ7O09BRUc7SUFDSCxZQUFZLENBQUMsSUFBSSxFQUFFLFlBQVksR0FBRyxJQUFJLENBR3JDO0lBRUQ7OztPQUdHO0lBQ0csY0FBYyxDQUNsQixZQUFZLEVBQUUsVUFBVSxFQUN4QixVQUFVLEVBQUUsZ0JBQWdCLEVBQzVCLE9BQU8sQ0FBQyxFQUFFLGFBQWEsR0FDdEIsT0FBTyxDQUFDLFlBQVksQ0FBQyxDQXNDdkI7SUFFRDs7T0FFRztJQUNHLGdCQUFnQixDQUFDLFdBQVcsRUFBRSxNQUFNLEVBQUUsRUFBRSxTQUFTLEVBQUUsTUFBTSxFQUFFLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQVFoRjtJQUVEOztPQUVHO0lBQ0csa0JBQWtCLENBQUMsS0FBSyxFQUFFLFdBQVcsRUFBRSxhQUFhLEVBQUUsTUFBTSxFQUFFLEVBQUUsU0FBUyxFQUFFLE1BQU0sRUFBRSxHQUFHLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FTeEc7SUFFRDs7T0FFRztJQUNHLG9CQUFvQixDQUFDLFdBQVcsRUFBRSxXQUFXLEdBQUcsT0FBTyxDQUFDLElBQUksQ0FBQyxDQU9sRTtJQUVEOztPQUVHO0lBQ0gsWUFBWSxDQUFDLE1BQU0sRUFBRSxjQUFjLEdBQUcsSUFBSSxDQU96QztZQUVhLGlCQUFpQjtDQVloQyJ9

package/dest/mem_pools/tx_pool_v2/eviction/eviction_manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eviction_manager.d.ts","sourceRoot":"","sources":["../../../../src/mem_pools/tx_pool_v2/eviction/eviction_manager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AACnE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EACL,KAAK,cAAc,EAGnB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,KAAK,UAAU,EAGhB,MAAM,iBAAiB,CAAC;AAEzB;;;GAGG;AACH,qBAAa,eAAe;IAKxB,OAAO,CAAC,IAAI;IACZ,OAAO,CAAC,GAAG;IALb,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,cAAc,CAAsB;IAE5C,YACU,IAAI,EAAE,cAAc,EACpB,GAAG,EAAE,MAAM,EACjB;IAEJ;;OAEG;IACH,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAGzC;IAED;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI,CAGrC;IAED;;;OAGG;IACG,cAAc,CAClB,YAAY,EAAE,UAAU,EACxB,UAAU,EAAE,gBAAgB,EAC5B,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,YAAY,CAAC,CAsCvB;IAED;;OAEG;IACG,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAQhF;IAED;;OAEG;IACG,kBAAkB,CAAC,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CASxG;IAED;;OAEG;IACG,oBAAoB,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAOlE;IAED;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,IAAI,CAOzC;YAEa,iBAAiB;CAYhC"}