import type { Program, Idl } from "@coral-xyz/anchor";
import { PublicKey } from "@solana/web3.js";
import type { PrivacyConfigAccount } from "../config.js";
/**
 * Fetch and decode the on-chain PrivacyConfig account for a pool.
 */
export declare function fetchPoolConfig<T extends Idl>(program: Program<T>, mintAddress: PublicKey): Promise<PrivacyConfigAccount>;
/**
 * Check whether a nullifier has been spent on-chain.
 * Returns true if the nullifier marker PDA exists (funds already spent).
 */
export declare function checkNullifierSpent<T extends Idl>(program: Program<T>, mintAddress: PublicKey, nullifier: Uint8Array): Promise<boolean>;
/** On-chain tree utilization info */
export type TreeInfo = {
    treeId: number;
    leafCount: number;
    capacity: number;
    utilizationPercent: number;
    remainingCapacity: number;
    isFull: boolean;
    treePDA: PublicKey;
};
/**
 * Fetch utilization info for a specific tree.
 * Returns null if the tree does not exist yet.
 */
export declare function getTreeInfo<T extends Idl>(program: Program<T>, mintAddress: PublicKey, treeId: number): Promise<TreeInfo | null>;
/**
 * Fetch utilization info for all trees in a pool.
 */
export declare function getAllTreeInfo<T extends Idl>(program: Program<T>, mintAddress: PublicKey): Promise<TreeInfo[]>;
/**
 * Find the best tree to deposit into.
 *
 * Strategy (matches veilo-dapp):
 * 1. Discard full trees.
 * 2. Prefer the LOWEST tree ID with remaining capacity ≥ minCapacity (default 0.01%).
 * 3. Ensures trees fill sequentially: 0 → 1 → 2 → …
 * 4. Fallback to the tree with the most remaining capacity.
 */
export declare function getBestTreeForDeposit<T extends Idl>(program: Program<T>, mintAddress: PublicKey, minCapacity?: number): Promise<TreeInfo | null>;