/** The preset catalog (stage 1). Presets are hub-owned; devs get declarative
 *  knobs, not read-side callbacks (design law D2/D3). @module */
import type { ClassifiedFieldSpec, ClassifiedGroup } from './descriptor.js';
export declare const classified: {
    /** Composite card type. PAN sealed + last4/bin riders; CVC is storage:'never' (PCI-aware). */
    creditCard(fields: {
        pan: string;
        expiry?: string;
        cvc?: string;
    }): ClassifiedGroup;
    birthDate(): ClassifiedFieldSpec;
    email(): ClassifiedFieldSpec;
    phone(): ClassifiedFieldSpec;
    /** Digest-only password: verify-without-reveal; never listed, never revealed.
     *  Enumeration math is on the caller for low-entropy values — see the
     *  per-preset docs; the hub ships no rate limiter in this slice (spec §5).
     *
     *  @param opts.equatable — emit a store-visible `_bidx` equality tag (enables
     *  `findByDigest`). Cost band you are accepting:
     *
     *  equal values produce equal store-visible tags: anyone with store access
     *  learns which records share this secret and how many share each value —
     *  never the value itself. A collection-DEK holder can additionally test
     *  candidate values offline: the tag's inner digest is PBKDF2-SHA256 (600K),
     *  which is GPU/ASIC-friendly — an offline attacker runs on the order of
     *  10⁴–10⁸ guesses/second, so for low-entropy secrets (PINs, casefolded secret
     *  answers) offline recovery of the equality partition is seconds-to-hours, not
     *  years. `crypto.subtle` exposes no memory-hard KDF (no scrypt/argon2) and the
     *  family's no-crypto-deps law forbids adding one, so PBKDF2-SHA256 is the
     *  hardest primitive available; the iteration count raises the price but does
     *  not make a low-entropy field safe. The real control for low-entropy fields
     *  is the DOOR — do not enable `equatable` for them unless the partition being
     *  learnable is acceptable — not the iteration count. Pre-forget backups retain
     *  tags. */
    password(opts?: {
        minLength?: number;
        rotateDays?: number;
        notLastN?: number;
        equatable?: true;
    }): ClassifiedFieldSpec;
    /** Digest-only secret answer: normalized (casefold/trim/collapse), groupable
     *  into k-of-n matchGroup challenges. Low-entropy by nature — document the
     *  enumeration math to your users; add app-side rate limiting.
     *
     *  @param opts.equatable — emit a store-visible `_bidx` equality tag (enables
     *  `findByDigest`). Cost band you are accepting:
     *
     *  equal values produce equal store-visible tags: anyone with store access
     *  learns which records share this secret and how many share each value —
     *  never the value itself. A collection-DEK holder can additionally test
     *  candidate values offline: the tag's inner digest is PBKDF2-SHA256 (600K),
     *  which is GPU/ASIC-friendly — an offline attacker runs on the order of
     *  10⁴–10⁸ guesses/second, so for low-entropy secrets (PINs, casefolded secret
     *  answers) offline recovery of the equality partition is seconds-to-hours, not
     *  years. `crypto.subtle` exposes no memory-hard KDF (no scrypt/argon2) and the
     *  family's no-crypto-deps law forbids adding one, so PBKDF2-SHA256 is the
     *  hardest primitive available; the iteration count raises the price but does
     *  not make a low-entropy field safe. The real control for low-entropy fields
     *  is the DOOR — do not enable `equatable` for them unless the partition being
     *  learnable is acceptable — not the iteration count. Pre-forget backups retain
     *  tags. */
    secretAnswer(opts?: {
        equatable?: true;
    }): ClassifiedFieldSpec;
};