@tangle-network/agent-eval 0.189.0 → 0.190.1

package/dist/mint-DsS38v5c.d.ts

@@ -1,305 +0,0 @@
-import { a as RunRecord, s as RunSearchCoordinates } from "./run-record-DF-fuu31.js";
-import { s as TraceStore } from "./store-C4avFjIi.js";
-import { S as ToolDef, a as MintedRolloutLine, b as RolloutStep, m as RolloutLine, t as ChatMessage, v as RolloutRole, y as RolloutSplit } from "./schema-B5LtYvn9.js";
-//#region src/rollout/exporters.d.ts
-/**
- * The gate's two claims, which travel TOGETHER on every emitted row.
- *
- * `realness_gated` alone is ambiguous, and the ambiguity is exploitable:
- * `false` reads as "we screened it and nothing fired", so a producer that has no
- * screen at all emitted rows indistinguishable from screened-clean ones, and
- * every consumer of the published dataset read them as clean. The second field
- * is what separates the two claims, and it only removes the ambiguity if it
- * reaches the WIRE — for a round it existed on `RolloutOutcome` and on no
- * exported row shape at all, which left the published rows exactly as ambiguous
- * as before.
- *
- * So there is one helper and every row shape spreads it. A row that states one
- * claim without the other is not constructible by copying the pattern, and
- * `exporters.test.ts` walks every emitted shape to prove none does.
- */
-interface RealnessLabels {
-  /** The screen's VERDICT: the run faked its success signal. */
-  realness_gated: boolean;
-  /**
-   * Whether a screen RAN at all. `true` = it ran, so `realness_gated` is its
-   * verdict. `false` = the producer declares it has none. `null` = not stated
-   * (pre-unification producers), which is "unknown" and never "clean".
-   */
-  realness_screened: boolean | null;
-}
-interface TrainingExportOptions {
-  /** Include held-out evaluation data in training output. Default false. */
-  allowHeldOutTrainingData?: boolean;
-  /** Require reward to be strictly greater than this value. Default 0. */
-  minimumQualityExclusive?: number;
-  /**
-   * Explicit split selection, replacing the default trainable-split rule.
-   * Use this only when producing a deliberately named non-training slice
-   * (e.g. `['holdout']` for a holdout-only evaluation bundle).
-   */
-  splitFilter?: RolloutSplit[];
-}
-/**
- * What a signed-signal exporter (verifiers, RFT) does with lines that are not
- * clean trainable successes — realness-gated lines above all.
- *
- *   - 'exclude'       — the default, the same fail-closed policy as every
- *                       other training export: positive, completed,
- *                       non-gated rows on a trainable split.
- *   - 'zero-and-flag' — keep them, at their non-positive (or null) reward,
- *                       with `RealnessLabels` on the row. The dataset release
- *                       sets this per `FORMAT_GATE_DISPOSITION`: in these
- *                       formats the reward is a signed learning signal, so a
- *                       gamed trajectory at reward 0 is a correct negative,
- *                       and dropping it would bias the negative population
- *                       toward honest failures and leave a trainer no example
- *                       of gaming being penalized. The split policy is NOT
- *                       relaxed: held-out lines still need the named opt-in.
- *
- * SFT deliberately has no such option — an SFT row is an imitation target and
- * a gamed trajectory must never appear in one at any weight.
- */
-type GatedLineDisposition = 'exclude' | 'zero-and-flag';
-interface SignedSignalExportOptions extends TrainingExportOptions {
-  /** Disposition for non-trainable lines. Default 'exclude'. */
-  gatedLines?: GatedLineDisposition;
-}
-type SftExportOptions = TrainingExportOptions;
-interface SftRow {
-  messages: ChatMessage[];
-  metadata: {
-    rollout_id: string;
-    run_id: string;
-    candidate_id: string | null;
-    instance_id: string;
-    reward: number;
-  } & RealnessLabels;
-}
-/**
- * Supervised fine-tune rows: the completed conversation of each qualifying
- * line. Fail-closed filters: trainable split only (never holdout/canary unless
- * an explicit `splitFilter` names a non-training slice),
- * reward strictly above `minimumQualityExclusive` (default 0), realness-gated
- * lines never qualify, gap lines carry no trainable content, and
- * copied-context turns are dropped from the transcript (Harbor ATIF RFC 0001
- * rule 7 — see `ChatMessage.is_copied_context`).
- *
- * `realness_gated` is therefore always `false` on an emitted row. It is carried
- * anyway: an SFT row is a pure imitation target, so the row states its realness
- * claims instead of making the reader know the format's policy, and carrying
- * both flags on all four shapes is what lets the release accounting measure
- * every config with one rule rather than skipping the one whose row shape
- * happened to omit the field.
- */
-declare function toSftRows(lines: MintedRolloutLine[], options?: SftExportOptions): SftRow[];
-interface RewardRow {
-  /** First user turn — the task prompt. */
-  prompt: string;
-  steps: RolloutStep[];
-  reward: number;
-  metadata: {
-    rollout_id: string;
-    run_id: string;
-    candidate_id: string | null;
-    instance_id: string;
-    split: RolloutSplit;
-  } & RealnessLabels;
-}
-/**
- * Reward-labeled rows for completed, positive-quality training runs.
- */
-declare function toRewardRows(lines: MintedRolloutLine[], options?: TrainingExportOptions): RewardRow[];
-interface VerifiersTokenUsage {
-  input_tokens: number | null;
-  output_tokens: number | null;
-  reasoning_tokens: number | null;
-  cache_read_tokens: number | null;
-  cache_write_tokens: number | null;
-}
-interface VerifiersRolloutOutput {
-  /** Messages through the last turn BEFORE the first assistant turn. */
-  prompt: ChatMessage[];
-  /** The first assistant turn onward — what the policy produced. */
-  completion: ChatMessage[];
-  reward: number | null;
-  metrics: Record<string, unknown>;
-  tool_defs: ToolDef[];
-  token_usage: VerifiersTokenUsage;
-  info: {
-    task: RolloutLine['task'];
-    policy: RolloutLine['policy'];
-    rollout_id: string;
-    run_id: string;
-    experiment_id: string | null;
-    candidate_id: string | null;
-    generation: number | null;
-    candidate_index: number | null;
-    role: RolloutLine['role'];
-  } & RealnessLabels;
-}
-declare function toVerifiersRolloutOutput(line: MintedRolloutLine): VerifiersRolloutOutput;
-declare function toVerifiersRolloutOutputs(lines: MintedRolloutLine[], options?: SignedSignalExportOptions): VerifiersRolloutOutput[];
-interface RftItem {
-  /** Prompt turns only — the graded completion is re-sampled during RFT. */
-  messages: ChatMessage[];
-  /** Verdict/label fields the grader references as item.reference.* */
-  reference: {
-    reward: number | null;
-    reward_source: string | null;
-    verdict: unknown;
-    instance_id: string;
-    suite: string;
-    split: RolloutSplit;
-    rollout_id: string;
-  } & RealnessLabels;
-}
-declare function toRftItem(line: MintedRolloutLine): RftItem;
-/** RFT needs a real prompt: lines whose transcript starts with prompt turns. */
-declare function toRftItems(lines: MintedRolloutLine[], options?: SignedSignalExportOptions): RftItem[];
-declare function toJsonl(rows: ReadonlyArray<unknown>): string;
-//#endregion
-//#region src/rollout/reward.d.ts
-/**
- * Which split's score wins when a record carries both. `'holdout'` is the
- * canonical "real signal" default; `'search'` exists because some callers
- * deliberately score on the search split when both are present.
- */
-type ScorePreference = 'holdout' | 'search';
-/** Only the outcome is read, so every accessor here accepts anything carrying one. */
-type Scored = Pick<RunRecord, 'outcome'>;
-/** True when the authenticity gate flagged the run as gamed (`realness.gated`). */
-declare function isRealnessGated(record: Scored): boolean;
-/**
- * The RAW score recorded on ONE split, with no cross-split fallback and no
- * anti-Goodhart gate.
- *
- * The narrowest of the three raw readers, and the one every split-scoped
- * consumer wants: a per-split report, a promotion gate, or a paired comparison
- * asks "what did this run score on the split I am summarising", and answering
- * it with the other split's number silently mixes populations. `undefined` =
- * that split was never scored.
- *
- * Same warning as `observedScore`: this INCLUDES runs flagged as gamed. Never
- * feed it into training data.
- */
-declare function observedSplitScore(record: Scored, split: ScorePreference): number | undefined;
-/**
- * The RAW split score the run carries, with NO anti-Goodhart gate applied.
- *
- * INCLUDES RUNS FLAGGED AS GAMED (`outcome.realness.gated === true`); NEVER
- * feed this into training data — a fine-tune that sees it learns from gamed
- * successes. It is exported anyway because analysis, reporting, and
- * reward-hacking detection legitimately need the ungated number: forcing a
- * gamed run to 0 collapses the proxy signal toward ground truth and makes a
- * detector report "clean" on exactly the population that is being gamed.
- *
- * Returns `undefined` when the record carries neither score — an unscored run
- * is a labeled gap, not a measured zero, and each caller picks its own
- * sentinel (`?? 0`, `?? null`, skip, throw). Non-finite values are returned
- * as-is; callers that care keep their own `Number.isFinite` guard.
- */
-declare function observedScore(record: Scored, prefer?: ScorePreference): number | undefined;
-/** Which split actually carried the score, or that none did. */
-type ScoreOrigin = 'holdout' | 'search' | 'unscored';
-/**
- * Where `observedScore` / `trainingScore` read their number from — the
- * provenance label a rollout line's `reward_source` is built from, and the
- * only supported way to ask "was this run scored at all" without respelling
- * the field access.
- */
-declare function scoreOrigin(record: Scored, prefer?: ScorePreference): ScoreOrigin;
-/**
- * The GATED score — the only derivation allowed to reach training data.
- *
- * A realness-gated run scores 0 no matter what it claims, so a fine-tune
- * cannot learn from a gamed success. An unscored run stays `undefined` (a
- * labeled gap), keeping "we never measured this" distinct from "we measured
- * zero"; callers that need a number apply their own sentinel.
- */
-declare function trainingScore(record: Scored, prefer?: ScorePreference): number | undefined;
-/**
- * `{reward, gated}` as written onto a minted `RolloutLine` — `trainingScore`
- * plus the flag itself, so the gate travels into the exported row and a
- * downstream filter can drop or down-weight the line.
- *
- * An unscored record yields `reward: null`, matching the schema's "no verdict
- * exists — a labeled gap, never 0" rule. It previously collapsed to 0, which
- * made a run nobody graded indistinguishable from one graded as a total
- * failure, and taught any trainer reading the row that the trajectory was bad.
- * A gated run still yields 0, because that IS a verdict: the gate decided.
- */
-declare function trainingReward(record: Scored): {
-  reward: number | null;
-  gated: boolean;
-};
-//#endregion
-//#region src/rollout/mint.d.ts
-/** Redactor for transcript/step payload text (secrets, PII), not opaque identity. */
-type RolloutScrubber = (text: string) => string;
-/** A search cell's place in its search tree, read from the search ledger. */
-interface RolloutSearchLineage {
-  /** Edges between the cell's node and the search root; the root is 0. */
-  depth: number;
-  /** Order in which the node registered in its search; the root is 0. */
-  ordinal: number;
-  /** Repeat index of the cell on its task, from 0. */
-  rep: number;
-  /** Run id of the cell whose execution contains this search; null for a
-   *  top-level search. */
-  containingRunId: string | null;
-}
-interface MintRolloutOptions {
-  scrub?: RolloutScrubber;
-  /**
-   * Full canonical capture, including turns no longer in the model's context.
-   * When supplied, missing/empty capture is refused, never replaced with a
-   * span summary. Use the execution owner's capture or the existing harness
-   * readers; reviewer traces and compacted histories are not full capture.
-   */
-  messagesOf?: (runId: string) => readonly ChatMessage[] | undefined | Promise<readonly ChatMessage[] | undefined>;
-  /** Cap steps per line (longest runs first drop middle steps). Default: no cap. */
-  maxSteps?: number;
-  /** Role recorded on every minted line. Default 'agent' (a solo eval run). */
-  role?: RolloutRole;
-  /** Task suite label. Default: the record's `experimentId`. */
-  suite?: string;
-  /** Injected clock for deterministic output. */
-  now?: () => Date;
-  /**
-   * Lineage of a search run, read from its search ledger. It fills the line's
-   * `generation` (node depth), `candidate_index` (node order), `task.rep` and
-   * `parent_rollout_id` (the containing cell's run). Mint refuses a record
-   * that carries `search` when this is absent, because a null `generation`
-   * states that the run is not part of a search.
-   */
-  searchLineage?: (search: RunSearchCoordinates) => RolloutSearchLineage | Promise<RolloutSearchLineage>;
-}
-interface MintRolloutResult {
-  rows: MintedRolloutLine[];
-  /** runIds that had a RunRecord but no spans — emitted as gap lines AND listed here. */
-  missingTraces: string[];
-}
-/**
- * Why a record cannot be minted, one entry per missing field, empty when it can.
- *
- * Exported so a caller can partition a whole ledger — "which of my 2742 records
- * predate 0.126" — without catching an exception per record, and without
- * re-deriving the field list on their side. A re-derived list is a list that
- * drifts from the door it is supposed to predict.
- *
- * Takes a `RunRecord` because that is what the caller holds and what the
- * compiler agrees they hold. The type is precisely the thing that is wrong, so
- * the checks read the record as the untyped bag it actually is on disk.
- */
-declare function unmintableReasons(record: RunRecord): string[];
-/**
- * Join RunRecords with their traces into canonical rollout lines. Records
- * without spans or an explicit capture are emitted as labeled gap lines and reported in
- * `missingTraces`. Execution-only records without a task score are rejected
- * because a missing training label is not a zero reward.
- */
-declare function mintRolloutRows(records: RunRecord[], store: TraceStore, options?: MintRolloutOptions): Promise<MintRolloutResult>;
-//#endregion
-export { toJsonl as C, toSftRows as D, toRftItems as E, toVerifiersRolloutOutput as O, VerifiersTokenUsage as S, toRftItem as T, RftItem as _, mintRolloutRows as a, TrainingExportOptions as b, ScorePreference as c, observedSplitScore as d, scoreOrigin as f, RewardRow as g, RealnessLabels as h, RolloutSearchLineage as i, toVerifiersRolloutOutputs as k, isRealnessGated as l, trainingScore as m, MintRolloutResult as n, unmintableReasons as o, trainingReward as p, RolloutScrubber as r, ScoreOrigin as s, MintRolloutOptions as t, observedScore as u, SftExportOptions as v, toRewardRows as w, VerifiersRolloutOutput as x, SftRow as y };
-//# sourceMappingURL=mint-DsS38v5c.d.ts.map

package/dist/mint-DsS38v5c.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mint-DsS38v5c.d.ts","names":[],"sources":["../src/rollout/exporters.ts","../src/rollout/reward.ts","../src/rollout/mint.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;UAiDiB;;EAEf;;;;;;EAMA;;UAiBe;;EAEf;;EAEA;;;;;;EAMA,cAAc;;;;;;;;;;;;;;;;;;;;;;KAuBJ;UAEK,kCAAkC;;EAEjD,aAAa;;KAGH,mBAAmB;UAEd;EACf,UAAU;EACV;IACE;IACA;IACA;IACA;IACA;MACE;;;;;;;;;;;;;;;;;;iBAmBU,UAAU,OAAO,qBAAqB,UAAS,mBAAwB;UAyBtE;;EAEf;EACA,OAAO;EACP;EACA;IACE;IACA;IACA;IACA;IACA,OAAO;MAUL;;;;;iBAMU,aACd,OAAO,qBACP,UAAS,wBACR;UAgCc;EACf;EACA;EACA;EACA;EACA;;UAGe;;EAEf,QAAQ;;EAER,YAAY;EACZ;EACA,SAAS;EACT,WAAW;EACX,aAAa;EACb;IACE,MAAM;IACN,QAAQ;IACR;IACA;IACA;IACA;IACA;IACA;IACA,MAAM;MACJ;;iBASU,yBAAyB,MAAM,oBAAoB;iBA+BnD,0BACd,OAAO,qBACP,UAAS,4BACR;UAoBc;;EAEf,UAAU;;EAEV;IACE;IACA;IACA;IACA;IACA;IACA,OAAO;IACP;MACE;;iBAGU,UAAU,MAAM,oBAAoB;;iBAmBpC,WACd,OAAO,qBACP,UAAS,4BACR;iBAkBa,QAAQ,MAAM;;;;;;;;KC3VlB;;KAGP,SAAS,KAAK;;iBAGH,gBAAgB,QAAQ;;;;;;;;;;;;;;iBAiBxB,mBAAmB,QAAQ,QAAQ,OAAO;;;;;;;;;;;;;;;;iBAmB1C,cACd,QAAQ,QACR,SAAQ;;KAOE;;;;;;;iBAQI,YAAY,QAAQ,QAAQ,SAAQ,kBAA8B;;;;;;;;;iBAelE,cACd,QAAQ,QACR,SAAQ;;;;;;;;;;;;iBAiBM,eAAe,QAAQ;EAAW;EAAuB;;;;;KCtE7D,mBAAmB;;UAGd;;EAEf;;EAEA;;EAEA;;;EAGA;;UAGe;EACf,QAAQ;;;;;;;EAOR,cACE,2BACY,4BAA4B,iBAAiB;;EAE3D;;EAEA,OAAO;;EAEP;;EAEA,YAAY;;;;;;;;EAQZ,iBACE,QAAQ,yBACL,uBAAuB,QAAQ;;UAGrB;EACf,MAAM;;EAEN;;;;;;;;;;;;;;iBA4Pc,kBAAkB,QAAQ;;;;;;;iBAiMpB,gBACpB,SAAS,aACT,OAAO,YACP,UAAS,qBACR,QAAQ"}

package/dist/redact-DPoH1-OW.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"redact-DPoH1-OW.d.ts","names":[],"sources":["../src/trace/redact.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAsCY;cAEC,6BAA6B;;KAG9B;;;;;;cAOC;UAEI;;EAEf;EACA,UAAU;EACV;EACA;;UAGe;EACf;EACA,SAAS;;EAET;EACA,YAAY;EACZ;EACA,UAAU;;UAGK;;EAEf,UAAU;;EAEV;;;;;;;EAOA;;EAEA,SAAS;;UAGM;;EAEf,UAAU;;EAEV;;KAGU;UAEK;EACf,UAAU;EACV;EACA;EACA;;EAEA;;UAGe;EACf,QAAQ;EACR,SAAS;EACT,UAAU;;EAEV;;;;;;;iBA6Dc,aAAa;;;;;;iBAmNb,YAAY,cAAc;;iBAyJ1B,iBAAiB;;iBAQjB,mBAAmB;;;;;;iBAsQnB,OAAO,GACrB,OAAO,GACP,UAAS;EACN,OAAO;EAAG,QAAQ;;;;;;iBAUP,WAAW,cAAc,UAAS;;iBAMlC,qBAAqB,UAAS,mBAA+B;;;;;;;iBAmH7D,kBAAkB,gBAAgB,UAAS,gBAAqB;;;;;iBAoBhE,gBACd,SAAS,kBACT,mBAAmB,sBACnB,iCACC;;iBAsCa,aAAa,SAAS;;;;;;iBAStB,eAAe,GAC7B,OAAO,GACP,UAAS;EACN,OAAO;EAAG,QAAQ;EAAiB,SAAS"}

package/dist/redact-DxwlUAvh.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"redact-DxwlUAvh.js","names":[],"sources":["../src/trace/redact.ts"],"sourcesContent":["/**\n * The redaction core: the one place that decides what must not leave a\n * process or a machine. Every trace writer, exporter, uploader and share path\n * calls it.\n *\n * Three profiles, each a superset of the one before:\n *   - `default` removes credentials, found by key name and by value shape, and\n *     personal data (email addresses, card numbers, SSNs, phone numbers).\n *     Content is kept. Strings are capped at 1 MiB.\n *   - `share` also removes phone, IP and postal-address fields, replaces\n *     account, user, tenant, session and request identifiers with pseudonyms\n *     that stay consistent within one call, and caps strings at 64 KiB.\n *   - `strict` also removes prompt, completion, message, tool payload and other\n *     raw-content fields and embedded media, and caps strings at 4 KiB.\n *\n * A string that holds a credential is replaced whole with\n * `[REDACTED:<detector>]`. Replacing only the matched span can leave part of a\n * secret behind when a pattern's boundary is wrong. Personal data inside prose\n * is replaced in place, so the rest of the text stays readable.\n *\n * `assessShareSafety` reads a value without changing it and returns SAFE,\n * SAFE_WITH_WARNINGS, UNSAFE or UNKNOWN. UNKNOWN means the scanner could not\n * read part of the value (a cycle, binary data, nesting past the depth limit);\n * it is never reported as safe. `redactForShare` redacts and then assesses the\n * redacted output, so a detector gap shows up as UNSAFE instead of a leak.\n *\n * Reports and findings carry paths, categories and detector ids, never the\n * values they matched.\n *\n * The key classifier and the credential detector list are adapted from\n * agent-inspect (MIT, commit 3c3cbeda). `scripts/redaction-corpus.json` holds\n * the must-flag and must-not-flag cases, including the copied agent-inspect\n * safety corpus with its MIT notice; `pnpm redaction:corpus` runs this module\n * over every case.\n */\n\nimport { createHmac, randomBytes } from 'node:crypto'\n\nexport type RedactionProfile = 'default' | 'share' | 'strict'\n\nexport const REDACTION_PROFILES: readonly RedactionProfile[] = ['default', 'share', 'strict']\n\n/** What a finding is about. `media` is embedded binary content (a `data:` URI) no text detector can read. */\nexport type SafetyCategory = 'credential' | 'personal-data' | 'identifier' | 'raw-content' | 'media'\n\n/**\n * Version of the detector set and profile rules. Stored work that depends on\n * redaction behavior (saved optimizer inputs, per-span redaction stamps) keys\n * on it, so bump it whenever a detector, key list, cap or marker changes.\n */\nexport const REDACTION_VERSION = '2.0.0'\n\nexport interface RedactionFinding {\n  /** JSON Pointer (RFC 6901) to the value or key that was changed. */\n  path: string\n  category: SafetyCategory\n  detector: string\n  action: 'redacted' | 'pseudonymized' | 'truncated'\n}\n\nexport interface RedactionReport {\n  version: string\n  profile: RedactionProfile\n  /** Values and keys replaced, pseudonymized or truncated. */\n  redactionCount: number\n  byDetector: Record<string, number>\n  truncatedCount: number\n  findings: RedactionFinding[]\n}\n\nexport interface RedactOptions {\n  /** Default `default`. */\n  profile?: RedactionProfile\n  /** Lower the profile's per-string cap. A value above the profile cap is ignored. */\n  maxStringBytes?: number\n  /**\n   * Exact values the caller knows are secret (an API key the run was given, a\n   * password from the environment). A string or key that contains one, or its\n   * base64, base64url or URL-encoded form, is replaced whole with\n   * `[REDACTED:known-secret]`, whatever shape the value has.\n   */\n  knownSecrets?: readonly string[]\n  /** Add this call's findings to an existing report instead of a new one. */\n  report?: RedactionReport\n}\n\nexport interface AssessOptions {\n  /** Default `default`. */\n  profile?: RedactionProfile\n  /** As in `RedactOptions`: any surviving occurrence makes the verdict UNSAFE. */\n  knownSecrets?: readonly string[]\n}\n\nexport type ShareSafetyStatus = 'SAFE' | 'SAFE_WITH_WARNINGS' | 'UNSAFE' | 'UNKNOWN'\n\nexport interface ShareSafetyFinding {\n  category: SafetyCategory\n  detector: string\n  severity: 'error' | 'warning'\n  count: number\n  /** Up to five JSON Pointers where the detector fired. */\n  paths: string[]\n}\n\nexport interface ShareSafetyVerdict {\n  status: ShareSafetyStatus\n  profile: RedactionProfile\n  findings: ShareSafetyFinding[]\n  /** Parts the scanner could not read, as `<path>: <reason>`. Any entry makes the status UNKNOWN. */\n  unreadable: string[]\n}\n\n// ── Profiles ─────────────────────────────────────────────────────────────\n\ninterface ProfileRules {\n  maxStringBytes: number\n  /** Key categories whose values are removed or pseudonymized. */\n  redactKeys: ReadonlySet<'share-personal' | 'identifier' | 'raw-content'>\n  redactMedia: boolean\n  severity: Record<SafetyCategory, 'error' | 'warning' | undefined>\n}\n\nconst KIB = 1024\n\nconst PROFILE_RULES: Record<RedactionProfile, ProfileRules> = {\n  default: {\n    maxStringBytes: 1024 * KIB,\n    redactKeys: new Set(),\n    redactMedia: false,\n    severity: {\n      credential: 'error',\n      'personal-data': 'warning',\n      identifier: undefined,\n      'raw-content': 'warning',\n      media: 'warning',\n    },\n  },\n  share: {\n    maxStringBytes: 64 * KIB,\n    redactKeys: new Set(['share-personal', 'identifier']),\n    redactMedia: false,\n    severity: {\n      credential: 'error',\n      'personal-data': 'error',\n      identifier: 'warning',\n      'raw-content': 'warning',\n      media: 'warning',\n    },\n  },\n  strict: {\n    maxStringBytes: 4 * KIB,\n    redactKeys: new Set(['share-personal', 'identifier', 'raw-content']),\n    redactMedia: true,\n    severity: {\n      credential: 'error',\n      'personal-data': 'error',\n      identifier: 'warning',\n      'raw-content': 'error',\n      media: 'error',\n    },\n  },\n}\n\n// ── Key classifier ───────────────────────────────────────────────────────\n\n/**\n * Canonical snake_case form of a field name, so camelCase, kebab-case, dotted\n * and snake_case spellings match one list: `userPassword`, `user-password` and\n * `user.password` all become `user_password`.\n */\nexport function normalizeKey(key: string): string {\n  return key\n    .replace(/([a-z0-9])([A-Z])/g, '$1_$2')\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, '_')\n    .replace(/^_+|_+$/g, '')\n}\n\n/** Counts, limits and model vocabulary that contain the word \"token\" but are not credentials. */\nconst NON_CREDENTIAL_TOKEN_KEYS: ReadonlySet<string> = new Set([\n  'tokens',\n  'max_tokens',\n  'min_tokens',\n  'ls_max_tokens',\n  'token_count',\n  'token_limit',\n  'token_budget',\n  'input_tokens',\n  'output_tokens',\n  'total_tokens',\n  'cached_tokens',\n  'prompt_tokens',\n  'completion_tokens',\n  'reasoning_tokens',\n  'bos_token',\n  'eos_token',\n  'pad_token',\n  'unk_token',\n  'sep_token',\n  'cls_token',\n  'mask_token',\n  'stop_token',\n  // Pagination cursors are opaque but not credentials.\n  'page_token',\n  'next_page_token',\n  'prev_page_token',\n  'next_token',\n  'continuation_token',\n  'cursor_token',\n  'sync_token',\n])\n\nconst CREDENTIAL_KEYS = [\n  'authorization',\n  'auth',\n  'cookie',\n  'api_key',\n  'apikey',\n  'api_token',\n  'access_key',\n  'secret_key',\n  'private_key',\n  'signing_key',\n  'encryption_key',\n  'master_key',\n  'session_key',\n  'client_secret',\n  'secret',\n  'password',\n  'passwd',\n  'passphrase',\n  'credential',\n  'credentials',\n  'bearer',\n  'dsn',\n  'database_url',\n  'connection_string',\n  'pat',\n] as const\n\n/** Email fields are personal data in every profile. */\nconst EMAIL_KEYS = ['email', 'email_address'] as const\n\n/** Personal-data fields removed by the share and strict profiles. */\nconst SHARE_PERSONAL_KEYS = [\n  'phone',\n  'phone_number',\n  'mobile',\n  'ip',\n  'ip_address',\n  'remote_addr',\n  'street_address',\n  'postal_address',\n  'home_address',\n  'billing_address',\n  'shipping_address',\n  'mailing_address',\n  'date_of_birth',\n  'dob',\n  'ssn',\n] as const\n\n/** Identifiers pseudonymized by the share and strict profiles. */\nconst IDENTIFIER_KEYS = [\n  'user_id',\n  'user_uuid',\n  'account_id',\n  'account_uuid',\n  'customer_id',\n  'tenant_id',\n  'org_id',\n  'organization_id',\n  'organisation_id',\n  'team_id',\n  'enduser_id',\n  'actor_id',\n  'principal_id',\n  'member_id',\n  'session_id',\n  'request_id',\n  'correlation_id',\n  'device_id',\n  'installation_id',\n] as const\n\n/** Fields that carry prompts, model output, tool payloads or other free text. Removed by `strict`. */\nconst RAW_CONTENT_KEYS = [\n  'prompt',\n  'prompts',\n  'system_prompt',\n  'completion',\n  'input',\n  'output',\n  'message',\n  'messages',\n  'content',\n  'text',\n  'thinking',\n  'reasoning',\n  'transcript',\n  'context',\n  'document',\n  'documents',\n  'chunk',\n  'chunks',\n  'retrieval',\n  'query',\n  'args',\n  'arguments',\n  'result',\n  'body',\n  'command',\n  'full_command',\n  'input_value',\n  'output_value',\n  'instructions',\n  'system_instructions',\n  'stdout',\n  'stderr',\n  'stacktrace',\n  'status_description',\n  'input_preview',\n  'output_preview',\n  'current_task',\n  'user_input',\n  'request_text',\n] as const\n\n/**\n * A key matches a list entry exactly or as a suffix (`openai_api_key`,\n * `db_password`, `tool_output`). Prefix compounds (`secret_name`,\n * `password_min_length`, `auth_type`, `content_type`) do not match: they name\n * or describe a value rather than hold it, and flagging them would make the\n * share verdict refuse ordinary traces. Value detectors still catch a\n * credential-shaped value under any key.\n */\nfunction matchesKeyList(normalized: string, keys: readonly string[]): boolean {\n  for (const key of keys) {\n    if (normalized === key || normalized.endsWith(`_${key}`)) return true\n  }\n  return false\n}\n\nfunction isTokenCredentialKey(normalized: string): boolean {\n  if (NON_CREDENTIAL_TOKEN_KEYS.has(normalized)) return false\n  if (normalized === 'token') return true\n  // access_token and refreshToken are credentials; max_tokens and input_tokens are counts.\n  if (normalized.endsWith('tokens')) return false\n  return normalized.endsWith('token')\n}\n\ntype KeyClass = 'credential' | 'email' | 'share-personal' | 'identifier' | 'raw-content'\n\n/** Trace keys repeat on every span, so classifications are cached. */\nconst keyClassCache = new Map<string, KeyClass | null>()\n\nfunction classifyKeyName(key: string): KeyClass | undefined {\n  const cached = keyClassCache.get(key)\n  if (cached !== undefined) return cached ?? undefined\n  const kind = classifyNormalizedKey(normalizeKey(key))\n  if (keyClassCache.size >= 10_000) keyClassCache.clear()\n  keyClassCache.set(key, kind ?? null)\n  return kind\n}\n\nfunction classifyNormalizedKey(normalized: string): KeyClass | undefined {\n  if (!normalized || NON_CREDENTIAL_TOKEN_KEYS.has(normalized)) return undefined\n  if (isTokenCredentialKey(normalized)) return 'credential'\n  if (matchesKeyList(normalized, CREDENTIAL_KEYS)) return 'credential'\n  if (matchesKeyList(normalized, EMAIL_KEYS)) return 'email'\n  if (matchesKeyList(normalized, SHARE_PERSONAL_KEYS)) return 'share-personal'\n  if (matchesKeyList(normalized, IDENTIFIER_KEYS)) return 'identifier'\n  if (matchesKeyList(normalized, RAW_CONTENT_KEYS)) return 'raw-content'\n  return undefined\n}\n\n/**\n * The safety category a field name puts its value in, or undefined for an\n * ordinary field. Token counts and model limits (`inputTokens`, `max_tokens`,\n * `token_count`) and names such as `author` are not credentials.\n */\nexport function classifyKey(key: string): SafetyCategory | undefined {\n  const kind = classifyKeyName(key)\n  if (kind === undefined) return undefined\n  if (kind === 'credential') return 'credential'\n  if (kind === 'identifier') return 'identifier'\n  if (kind === 'raw-content') return 'raw-content'\n  return 'personal-data'\n}\n\n// ── Value detectors ──────────────────────────────────────────────────────\n\ninterface ValueDetector {\n  id: string\n  pattern: RegExp\n}\n\n/**\n * High-confidence credential shapes. A hit replaces the whole string. Each\n * pattern is written without the `g` flag so `test` stays stateless.\n */\nconst CREDENTIAL_DETECTORS: readonly ValueDetector[] = [\n  { id: 'private-key', pattern: /-----BEGIN [A-Z0-9 ]*PRIVATE KEY-----/ },\n  { id: 'jwt', pattern: /\\beyJ[A-Za-z0-9_-]{8,}\\.[A-Za-z0-9_-]{8,}\\.[A-Za-z0-9_-]{8,}/ },\n  { id: 'bearer', pattern: /\\bbearer\\s+[A-Za-z0-9._~+/=-]{12,}/i },\n  {\n    id: 'authorization-header',\n    pattern: /^\\s*(?:basic|digest|apikey)\\s+[A-Za-z0-9._~+/=:-]{8,}\\s*$/i,\n  },\n  { id: 'anthropic-key', pattern: /\\bsk-ant-[A-Za-z0-9_-]{16,}/ },\n  { id: 'provider-key', pattern: /\\bsk-(?:proj-|tan-)?[A-Za-z0-9_-]{16,}/ },\n  { id: 'stripe-key', pattern: /\\b(?:sk|rk)_(?:live|test)_[A-Za-z0-9_]{10,}/ },\n  { id: 'google-api-key', pattern: /\\bAIza[0-9A-Za-z_-]{20,}/ },\n  { id: 'github-token', pattern: /\\b(?:gh[pousr]_[A-Za-z0-9_]{20,}|github_pat_[A-Za-z0-9_]{20,})/ },\n  { id: 'slack-token', pattern: /\\bxox[abeoprs]-[A-Za-z0-9-]{10,}/ },\n  { id: 'aws-access-key', pattern: /\\b(?:AKIA|ASIA)[A-Z0-9]{16}\\b/ },\n  { id: 'tangle-capability', pattern: /\\b(?:hubcap_|hct_)[A-Za-z0-9_=-]{8,}/ },\n  { id: 'url-credentials', pattern: /\\b[a-z][a-z0-9+.-]*:\\/\\/[^\\s/:@]+:[^\\s/@]+@/i },\n  {\n    id: 'url-secret-param',\n    pattern:\n      /[?&](?:access_token|api_key|apikey|auth|token|secret|password|sig|signature|x-amz-signature|x-goog-signature)=[^&\\s\"'#)]{8,}/i,\n  },\n  {\n    // `GH_TOKEN=…`, `--api-key=…`, `\"client_secret\": \"…\"`, `password: …` in free\n    // text. The value must mix letters and digits and be at least 12\n    // characters, so prose (`token: string`), variable references (`$TOKEN`)\n    // and dotenvx ciphertext (`encrypted:…`) pass. The pattern starts at the\n    // key word itself, with no identifier prefix, so it scans in linear time.\n    id: 'secret-assignment',\n    pattern:\n      /(?:api[_-]?key|apikey|access[_-]?key|secret[_-]?key|private[_-]?key|secret|token|password|passwd|passphrase|credentials?)[\"']?[ \\t]*[:=][ \\t]*[\"']?(?!encrypted:)(?![$`<[{(%])(?=[^\\s\"'`,;&|]*[0-9])(?=[^\\s\"'`,;&|]*[A-Za-z])[^\\s\"'`,;&|]{12,}/i,\n  },\n]\n\n/** Personal-data shapes, replaced in place so the surrounding text survives. */\nconst PERSONAL_DATA_DETECTORS: readonly (ValueDetector & {\n  /** A substring the text must contain before the pattern runs. */\n  requires?: string\n  accept?: (match: string) => boolean\n})[] = [\n  {\n    id: 'email',\n    requires: '@',\n    pattern: /\\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\\.[A-Za-z]{2,}\\b/g,\n    accept: isEmailAddress,\n  },\n  {\n    // Card numbers: a card-network prefix and a valid Luhn digit, written\n    // unbroken (13-19 digits) or in printed groups (4-4-4-4, 4-4-4-4-3, Amex\n    // 4-6-5). A word character or hyphen on either side rejects the match, so\n    // digits inside UUIDs, dated file names and hyphenated ids never match.\n    id: 'card-number',\n    pattern:\n      /(?<![\\w-])(?:\\d{13,19}|\\d{4}([ -])\\d{4}\\1\\d{4}\\1\\d{4}(?:\\1\\d{3})?|\\d{4}([ -])\\d{6}\\2\\d{5})(?![\\w-])/g,\n    accept: (match) => {\n      const digits = match.replace(/[ -]/g, '')\n      return CARD_PREFIX.test(digits) && luhnValid(digits)\n    },\n  },\n  { id: 'ssn', pattern: /\\b\\d{3}-\\d{2}-\\d{4}\\b/g },\n  {\n    // Separators are required: a bare ten-digit run is usually an epoch second or an id.\n    id: 'phone',\n    pattern: /(?:\\+1[-.\\s]?)?(?:\\(\\d{3}\\)\\s?|\\b\\d{3}[-.\\s])\\d{3}[-.\\s]\\d{4}\\b/g,\n  },\n]\n\n/** Visa, Mastercard, Amex, Diners, JCB, Discover and UnionPay issuer prefixes. */\nconst CARD_PREFIX = /^(?:4|5[1-5]|2[2-7]|3[04-9]|6(?:011|4[4-9]|5|2))/\n\n/**\n * Top-level domains that are file extensions: `icon@2x.png`, `worker@3.service`\n * and `notes@AGENTS.md` are not addresses.\n */\nconst NON_EMAIL_TLDS: ReadonlySet<string> = new Set([\n  'md',\n  'mdx',\n  'txt',\n  'json',\n  'jsonl',\n  'yaml',\n  'yml',\n  'toml',\n  'lock',\n  'ts',\n  'tsx',\n  'js',\n  'jsx',\n  'mjs',\n  'cjs',\n  'py',\n  'rs',\n  'go',\n  'sh',\n  'css',\n  'html',\n  'svg',\n  'png',\n  'jpg',\n  'jpeg',\n  'gif',\n  'webp',\n  'service',\n  'socket',\n  'timer',\n  'mount',\n  'target',\n])\n\nfunction isEmailAddress(match: string): boolean {\n  // `git@github.com:org/repo` is an SSH remote, not a person.\n  if (match.toLowerCase().startsWith('git@')) return false\n  const tld = match.slice(match.lastIndexOf('.') + 1).toLowerCase()\n  return !NON_EMAIL_TLDS.has(tld)\n}\n\nfunction luhnValid(digits: string): boolean {\n  if (/^(\\d)\\1+$/.test(digits)) return false\n  let sum = 0\n  let double = false\n  for (let index = digits.length - 1; index >= 0; index -= 1) {\n    let digit = digits.charCodeAt(index) - 48\n    if (double) {\n      digit *= 2\n      if (digit > 9) digit -= 9\n    }\n    sum += digit\n    double = !double\n  }\n  return sum % 10 === 0\n}\n\n/** The first credential detector that matches, or undefined. */\nexport function detectCredential(text: string): string | undefined {\n  for (const detector of CREDENTIAL_DETECTORS) {\n    if (detector.pattern.test(text)) return detector.id\n  }\n  return undefined\n}\n\n/** Personal-data detector ids that match somewhere in `text`. */\nexport function detectPersonalData(text: string): string[] {\n  const hits: string[] = []\n  for (const detector of PERSONAL_DATA_DETECTORS) {\n    if (detector.requires && !text.includes(detector.requires)) continue\n    detector.pattern.lastIndex = 0\n    for (const match of text.matchAll(detector.pattern)) {\n      if (!detector.accept || detector.accept(match[0])) {\n        hits.push(detector.id)\n        break\n      }\n    }\n  }\n  return hits\n}\n\n/**\n * Every form in which a known secret can appear in a trace: as written,\n * base64, base64url and URL-encoded. Values shorter than 4 characters are\n * ignored; they would match ordinary text.\n */\nfunction knownSecretForms(values: readonly string[] | undefined): string[] {\n  const forms = new Set<string>()\n  for (const value of values ?? []) {\n    if (value.length < 4) continue\n    const bytes = Buffer.from(value, 'utf8')\n    forms.add(value)\n    forms.add(bytes.toString('base64'))\n    forms.add(bytes.toString('base64url'))\n    forms.add(encodeURIComponent(value))\n  }\n  // Longest first, so a secret that contains another is reported as itself.\n  return [...forms].sort((left, right) => right.length - left.length)\n}\n\nconst BASE64_TEXT = /^[A-Za-z0-9+/_-]+={0,2}$/\n\nfunction containsKnownSecret(text: string, forms: readonly string[]): boolean {\n  if (forms.length === 0) return false\n  if (forms.some((form) => text.includes(form))) return true\n  // A whole-string base64 payload can hold a secret at any byte offset.\n  if (text.length < 8 || !BASE64_TEXT.test(text)) return false\n  const decoded = Buffer.from(\n    text,\n    text.includes('-') || text.includes('_') ? 'base64url' : 'base64',\n  ).toString('utf8')\n  return forms.some((form) => decoded.includes(form))\n}\n\n/** The detector that marks `text` as a credential: a known secret first, then the value shapes. */\nfunction credentialIn(text: string, knownSecrets: readonly string[]): string | undefined {\n  return containsKnownSecret(text, knownSecrets) ? 'known-secret' : detectCredential(text)\n}\n\nconst MARKER_PREFIX = '[REDACTED:'\n\nfunction marker(detector: string): string {\n  return `${MARKER_PREFIX}${detector}]`\n}\n\n/**\n * Placeholders other tools write for a removed value. A credential field that\n * holds one of these is already redacted and is not flagged again.\n */\nconst REDACTED_PLACEHOLDER =\n  /^(?:\\[(?:REDACTED|redacted)(?::[^\\]]*)?\\]|\\[ID:[0-9a-f]{12}\\]|\\*{3,}|<redacted>|«redacted»|\\[HASH:[0-9a-f]{8,}\\])$/\n\nfunction isPlaceholder(value: string): boolean {\n  return value === '' || REDACTED_PLACEHOLDER.test(value)\n}\n\nconst DATA_URI = /^data:[\\w.+-]+\\/[\\w.+-]+(?:;[\\w.+-]+=[\\w.+-]+)*;base64,/i\n\n// ── Redaction ────────────────────────────────────────────────────────────\n\nconst MAX_DEPTH = 64\n\ninterface WalkState {\n  rules: ProfileRules\n  maxStringBytes: number\n  knownSecrets: string[]\n  report: RedactionReport\n  pseudonymKey: Buffer\n  seen: WeakSet<object>\n}\n\nfunction record(\n  state: WalkState,\n  path: string,\n  category: SafetyCategory,\n  detector: string,\n  action: RedactionFinding['action'],\n): void {\n  const report = state.report\n  if (action === 'truncated') report.truncatedCount += 1\n  report.redactionCount += 1\n  report.byDetector[detector] = (report.byDetector[detector] ?? 0) + 1\n  report.findings.push({ path, category, detector, action })\n}\n\nfunction pointer(parent: string, key: string | number): string {\n  return `${parent}/${String(key).replace(/~/g, '~0').replace(/\\//g, '~1')}`\n}\n\nfunction truncateUtf8(text: string, maxBytes: number): string | undefined {\n  if (text.length <= maxBytes / 4) return undefined\n  const bytes = Buffer.from(text, 'utf8')\n  if (bytes.length <= maxBytes) return undefined\n  // Step back to the first byte of a UTF-8 sequence so no character is split.\n  let cut = maxBytes\n  while (cut > 0 && ((bytes[cut] ?? 0) & 0xc0) === 0x80) cut -= 1\n  return `${bytes.subarray(0, cut).toString('utf8')}…[truncated ${bytes.length - cut} bytes]`\n}\n\nfunction redactStringAt(text: string, path: string, state: WalkState): string {\n  if (isPlaceholder(text)) return text\n  if (DATA_URI.test(text)) {\n    if (!state.rules.redactMedia) return text\n    record(state, path, 'media', 'media', 'redacted')\n    return marker('media')\n  }\n  const credential = credentialIn(text, state.knownSecrets)\n  if (credential) {\n    record(state, path, 'credential', credential, 'redacted')\n    return marker(credential)\n  }\n  let output = text\n  for (const detector of PERSONAL_DATA_DETECTORS) {\n    if (detector.requires && !output.includes(detector.requires)) continue\n    output = output.replace(detector.pattern, (match) => {\n      if (detector.accept && !detector.accept(match)) return match\n      record(state, path, 'personal-data', detector.id, 'redacted')\n      return marker(detector.id)\n    })\n  }\n  const truncated = truncateUtf8(output, state.maxStringBytes)\n  if (truncated === undefined) return output\n  record(state, path, 'raw-content', 'size-cap', 'truncated')\n  return truncated\n}\n\nfunction pseudonym(value: string | number, state: WalkState): string {\n  const digest = createHmac('sha256', state.pseudonymKey).update(String(value)).digest('hex')\n  return `[ID:${digest.slice(0, 12)}]`\n}\n\nfunction redactKeyed(\n  key: string,\n  value: unknown,\n  path: string,\n  depth: number,\n  state: WalkState,\n): unknown {\n  const kind = classifyKeyName(key)\n  if (value === null || value === undefined || typeof value === 'boolean') {\n    return value\n  }\n  if (typeof value === 'string' && isPlaceholder(value)) return value\n  // Numbers under a credential name are limits and counts (`password_max_age`), not secrets.\n  if (kind === 'credential' && typeof value !== 'number') {\n    record(state, path, 'credential', 'credential-key', 'redacted')\n    return marker('credential-key')\n  }\n  if (\n    kind === 'email' ||\n    (kind === 'share-personal' && state.rules.redactKeys.has('share-personal'))\n  ) {\n    if (typeof value === 'string' || typeof value === 'number') {\n      record(state, path, 'personal-data', 'personal-data-key', 'redacted')\n      return marker('personal-data-key')\n    }\n  }\n  if (kind === 'identifier' && state.rules.redactKeys.has('identifier')) {\n    if (typeof value === 'string' || typeof value === 'number') {\n      record(state, path, 'identifier', 'identifier-key', 'pseudonymized')\n      return pseudonym(value, state)\n    }\n  }\n  if (\n    kind === 'raw-content' &&\n    state.rules.redactKeys.has('raw-content') &&\n    typeof value !== 'number'\n  ) {\n    record(state, path, 'raw-content', 'raw-content-key', 'redacted')\n    return marker('raw-content-key')\n  }\n  return walk(value, path, depth + 1, state)\n}\n\nfunction walk(value: unknown, path: string, depth: number, state: WalkState): unknown {\n  if (typeof value === 'string') return redactStringAt(value, path, state)\n  if (value === null || typeof value !== 'object') return value\n  if (ArrayBuffer.isView(value) || value instanceof ArrayBuffer) {\n    record(state, path, 'media', 'binary', 'redacted')\n    return marker('binary')\n  }\n  if (value instanceof Date) return value\n  if (depth > MAX_DEPTH) {\n    record(state, path, 'raw-content', 'depth-limit', 'truncated')\n    return marker('depth-limit')\n  }\n  if (state.seen.has(value)) {\n    record(state, path, 'raw-content', 'circular', 'redacted')\n    return marker('circular')\n  }\n  state.seen.add(value)\n  try {\n    if (Array.isArray(value)) {\n      return value.map((item, index) => walk(item, pointer(path, index), depth + 1, state))\n    }\n    const out: Record<string, unknown> = {}\n    let renamed = 0\n    for (const [key, item] of Object.entries(value as Record<string, unknown>)) {\n      let outKey = key\n      const keyCredential = credentialIn(key, state.knownSecrets)\n      if (keyCredential) {\n        renamed += 1\n        outKey = `${marker(keyCredential)}#${renamed}`\n        record(state, pointer(path, outKey), 'credential', keyCredential, 'redacted')\n      }\n      out[outKey] = redactKeyed(key, item, pointer(path, outKey), depth, state)\n    }\n    return out\n  } finally {\n    state.seen.delete(value)\n  }\n}\n\nfunction newReport(profile: RedactionProfile): RedactionReport {\n  return {\n    version: REDACTION_VERSION,\n    profile,\n    redactionCount: 0,\n    byDetector: {},\n    truncatedCount: 0,\n    findings: [],\n  }\n}\n\nfunction newState(options: RedactOptions, report?: RedactionReport): WalkState {\n  const profile = options.profile ?? 'default'\n  const rules = PROFILE_RULES[profile]\n  if (!rules) throw new Error(`unknown redaction profile: ${String(profile)}`)\n  const requested = options.maxStringBytes\n  const maxStringBytes =\n    typeof requested === 'number' && Number.isFinite(requested) && requested >= 0\n      ? Math.min(Math.floor(requested), rules.maxStringBytes)\n      : rules.maxStringBytes\n  return {\n    rules,\n    maxStringBytes,\n    knownSecrets: knownSecretForms(options.knownSecrets),\n    report: report ?? newReport(profile),\n    pseudonymKey: randomBytes(32),\n    seen: new WeakSet(),\n  }\n}\n\n/**\n * Return a redacted deep copy of `value` and a report of what changed. Pure:\n * the input is not mutated. Never throws on the value's shape; cycles, binary\n * data and nesting past 64 levels are replaced with markers.\n */\nexport function redact<T>(\n  value: T,\n  options: RedactOptions = {},\n): { value: T; report: RedactionReport } {\n  const state = newState(options, options.report)\n  const out = walk(value, '', 0, state) as T\n  return { value: out, report: state.report }\n}\n\n/**\n * Redact one free-text string with the value detectors (no field name is\n * known). Pass `report` to accumulate counts across calls.\n */\nexport function redactText(text: string, options: RedactOptions = {}): string {\n  const state = newState(options, options.report)\n  return redactStringAt(text, '', state)\n}\n\n/** An empty report to accumulate `redactText` calls into. */\nexport function emptyRedactionReport(profile: RedactionProfile = 'default'): RedactionReport {\n  return newReport(profile)\n}\n\n// ── Share-safety assessment ──────────────────────────────────────────────\n\ninterface ScanState {\n  profile: RedactionProfile\n  rules: ProfileRules\n  knownSecrets: string[]\n  findings: Map<string, ShareSafetyFinding>\n  unreadable: string[]\n  seen: WeakSet<object>\n}\n\nfunction flag(state: ScanState, path: string, category: SafetyCategory, detector: string): void {\n  const severity = state.rules.severity[category]\n  if (!severity) return\n  const id = `${category}\\u0000${detector}`\n  const existing = state.findings.get(id)\n  if (existing) {\n    existing.count += 1\n    if (existing.paths.length < 5) existing.paths.push(path)\n    return\n  }\n  state.findings.set(id, { category, detector, severity, count: 1, paths: [path] })\n}\n\nfunction scanString(text: string, path: string, state: ScanState): void {\n  if (isPlaceholder(text)) return\n  if (DATA_URI.test(text)) {\n    flag(state, path, 'media', 'media')\n    return\n  }\n  const credential = credentialIn(text, state.knownSecrets)\n  if (credential) {\n    flag(state, path, 'credential', credential)\n    return\n  }\n  for (const detector of detectPersonalData(text)) flag(state, path, 'personal-data', detector)\n}\n\nfunction scanKeyed(\n  key: string,\n  value: unknown,\n  path: string,\n  depth: number,\n  state: ScanState,\n): void {\n  if (value === null || value === undefined || typeof value === 'boolean') return\n  if (typeof value === 'string' && isPlaceholder(value)) return\n  const category = classifyKey(key)\n  if (category === 'credential' && typeof value !== 'number') {\n    flag(state, path, 'credential', 'credential-key')\n    return\n  }\n  const scalar = typeof value === 'string' || typeof value === 'number'\n  if (category === 'personal-data' && scalar) {\n    const kind = classifyKeyName(key)\n    // Phone, IP and address fields are flagged from the share profile up; email always.\n    if (kind === 'email' || state.profile !== 'default') {\n      flag(state, path, 'personal-data', 'personal-data-key')\n      return\n    }\n  }\n  if (category === 'identifier' && scalar) flag(state, path, 'identifier', 'identifier-key')\n  if (category === 'raw-content' && typeof value !== 'number')\n    flag(state, path, 'raw-content', 'raw-content-key')\n  scan(value, path, depth + 1, state)\n}\n\nfunction scan(value: unknown, path: string, depth: number, state: ScanState): void {\n  if (typeof value === 'string') {\n    scanString(value, path, state)\n    return\n  }\n  if (value === null || typeof value !== 'object') return\n  if (ArrayBuffer.isView(value) || value instanceof ArrayBuffer) {\n    state.unreadable.push(`${path || '/'}: binary data`)\n    return\n  }\n  if (value instanceof Date) return\n  if (depth > MAX_DEPTH) {\n    state.unreadable.push(`${path || '/'}: nested deeper than ${MAX_DEPTH} levels`)\n    return\n  }\n  if (state.seen.has(value)) {\n    state.unreadable.push(`${path || '/'}: circular reference`)\n    return\n  }\n  state.seen.add(value)\n  try {\n    if (Array.isArray(value)) {\n      for (const [index, item] of value.entries())\n        scan(item, pointer(path, index), depth + 1, state)\n      return\n    }\n    for (const [key, item] of Object.entries(value as Record<string, unknown>)) {\n      // A credential used as a key must not reach the finding paths.\n      const keyCredential = credentialIn(key, state.knownSecrets)\n      const segment = keyCredential ? marker(keyCredential) : key\n      if (keyCredential) flag(state, pointer(path, segment), 'credential', keyCredential)\n      scanKeyed(key, item, pointer(path, segment), depth, state)\n    }\n  } finally {\n    state.seen.delete(value)\n  }\n}\n\n/**\n * Read `value` without changing it and say whether it is safe to share under\n * `profile`. UNKNOWN when any part could not be read; UNSAFE when any\n * error-severity finding remains; SAFE_WITH_WARNINGS when only warnings\n * remain (raw content, embedded media, identifiers under `share`).\n */\nexport function assessShareSafety(value: unknown, options: AssessOptions = {}): ShareSafetyVerdict {\n  const profile = options.profile ?? 'default'\n  const rules = PROFILE_RULES[profile]\n  if (!rules) throw new Error(`unknown redaction profile: ${String(profile)}`)\n  const state: ScanState = {\n    profile,\n    rules,\n    knownSecrets: knownSecretForms(options.knownSecrets),\n    findings: new Map(),\n    unreadable: [],\n    seen: new WeakSet(),\n  }\n  scan(value, '', 0, state)\n  return verdictFrom(profile, [...state.findings.values()], state.unreadable)\n}\n\n/**\n * One verdict over several parts (files in a directory, spans in a bundle).\n * Callers prefix each part's paths with its source before combining.\n */\nexport function combineVerdicts(\n  profile: RedactionProfile,\n  verdicts: readonly ShareSafetyVerdict[],\n  unreadable: readonly string[] = [],\n): ShareSafetyVerdict {\n  const findings = new Map<string, ShareSafetyFinding>()\n  for (const verdict of verdicts) {\n    for (const finding of verdict.findings) {\n      const id = `${finding.category}\\u0000${finding.detector}`\n      const existing = findings.get(id)\n      if (!existing) {\n        findings.set(id, { ...finding, paths: [...finding.paths] })\n        continue\n      }\n      existing.count += finding.count\n      for (const path of finding.paths) if (existing.paths.length < 5) existing.paths.push(path)\n    }\n  }\n  return verdictFrom(\n    profile,\n    [...findings.values()],\n    [...verdicts.flatMap((verdict) => verdict.unreadable), ...unreadable],\n  )\n}\n\nfunction verdictFrom(\n  profile: RedactionProfile,\n  findings: readonly ShareSafetyFinding[],\n  unreadable: readonly string[],\n): ShareSafetyVerdict {\n  const status: ShareSafetyStatus =\n    unreadable.length > 0\n      ? 'UNKNOWN'\n      : findings.some((finding) => finding.severity === 'error')\n        ? 'UNSAFE'\n        : findings.length > 0\n          ? 'SAFE_WITH_WARNINGS'\n          : 'SAFE'\n  return { status, profile, findings: [...findings], unreadable: [...unreadable] }\n}\n\n/** Whether a verdict allows sharing: SAFE or SAFE_WITH_WARNINGS. UNSAFE and UNKNOWN refuse. */\nexport function shareAllowed(verdict: ShareSafetyVerdict): boolean {\n  return verdict.status === 'SAFE' || verdict.status === 'SAFE_WITH_WARNINGS'\n}\n\n/**\n * Redact `value` under `profile`, then assess the redacted output. The\n * verdict describes what would actually be shared: a detector that failed to\n * remove something shows up as UNSAFE here.\n */\nexport function redactForShare<T>(\n  value: T,\n  options: RedactOptions = {},\n): { value: T; report: RedactionReport; verdict: ShareSafetyVerdict } {\n  const redacted = redact(value, options)\n  const verdict = assessShareSafety(redacted.value, {\n    profile: options.profile,\n    knownSecrets: options.knownSecrets,\n  })\n  return { value: redacted.value, report: redacted.report, verdict }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,MAAa,qBAAkD;CAAC;CAAW;CAAS;AAAQ;;;;;;AAU5F,MAAa,oBAAoB;AAwEjC,MAAM,MAAM;AAEZ,MAAM,gBAAwD;CAC5D,SAAS;EACP,gBAAgB,OAAO;EACvB,4BAAY,IAAI,IAAI;EACpB,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY,KAAA;GACZ,eAAe;GACf,OAAO;EACT;CACF;CACA,OAAO;EACL,gBAAgB,KAAK;EACrB,4BAAY,IAAI,IAAI,CAAC,kBAAkB,YAAY,CAAC;EACpD,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY;GACZ,eAAe;GACf,OAAO;EACT;CACF;CACA,QAAQ;EACN,gBAAgB,IAAI;EACpB,4BAAY,IAAI,IAAI;GAAC;GAAkB;GAAc;EAAa,CAAC;EACnE,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY;GACZ,eAAe;GACf,OAAO;EACT;CACF;AACF;;;;;;AASA,SAAgB,aAAa,KAAqB;CAChD,OAAO,IACJ,QAAQ,sBAAsB,OAAO,CAAC,CACtC,YAAY,CAAC,CACb,QAAQ,eAAe,GAAG,CAAC,CAC3B,QAAQ,YAAY,EAAE;AAC3B;;AAGA,MAAM,4CAAiD,IAAI,IAAI;CAC7D;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,aAAa,CAAC,SAAS,eAAe;;AAG5C,MAAM,sBAAsB;CAC1B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,mBAAmB;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;AAUA,SAAS,eAAe,YAAoB,MAAkC;CAC5E,KAAK,MAAM,OAAO,MAChB,IAAI,eAAe,OAAO,WAAW,SAAS,IAAI,KAAK,GAAG,OAAO;CAEnE,OAAO;AACT;AAEA,SAAS,qBAAqB,YAA6B;CACzD,IAAI,0BAA0B,IAAI,UAAU,GAAG,OAAO;CACtD,IAAI,eAAe,SAAS,OAAO;CAEnC,IAAI,WAAW,SAAS,QAAQ,GAAG,OAAO;CAC1C,OAAO,WAAW,SAAS,OAAO;AACpC;;AAKA,MAAM,gCAAgB,IAAI,IAA6B;AAEvD,SAAS,gBAAgB,KAAmC;CAC1D,MAAM,SAAS,cAAc,IAAI,GAAG;CACpC,IAAI,WAAW,KAAA,GAAW,OAAO,UAAU,KAAA;CAC3C,MAAM,OAAO,sBAAsB,aAAa,GAAG,CAAC;CACpD,IAAI,cAAc,QAAQ,KAAQ,cAAc,MAAM;CACtD,cAAc,IAAI,KAAK,QAAQ,IAAI;CACnC,OAAO;AACT;AAEA,SAAS,sBAAsB,YAA0C;CACvE,IAAI,CAAC,cAAc,0BAA0B,IAAI,UAAU,GAAG,OAAO,KAAA;CACrE,IAAI,qBAAqB,UAAU,GAAG,OAAO;CAC7C,IAAI,eAAe,YAAY,eAAe,GAAG,OAAO;CACxD,IAAI,eAAe,YAAY,UAAU,GAAG,OAAO;CACnD,IAAI,eAAe,YAAY,mBAAmB,GAAG,OAAO;CAC5D,IAAI,eAAe,YAAY,eAAe,GAAG,OAAO;CACxD,IAAI,eAAe,YAAY,gBAAgB,GAAG,OAAO;AAE3D;;;;;;AAOA,SAAgB,YAAY,KAAyC;CACnE,MAAM,OAAO,gBAAgB,GAAG;CAChC,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,IAAI,SAAS,cAAc,OAAO;CAClC,IAAI,SAAS,cAAc,OAAO;CAClC,IAAI,SAAS,eAAe,OAAO;CACnC,OAAO;AACT;;;;;AAaA,MAAM,uBAAiD;CACrD;EAAE,IAAI;EAAe,SAAS;CAAwC;CACtE;EAAE,IAAI;EAAO,SAAS;CAA+D;CACrF;EAAE,IAAI;EAAU,SAAS;CAAsC;CAC/D;EACE,IAAI;EACJ,SAAS;CACX;CACA;EAAE,IAAI;EAAiB,SAAS;CAA8B;CAC9D;EAAE,IAAI;EAAgB,SAAS;CAAyC;CACxE;EAAE,IAAI;EAAc,SAAS;CAA8C;CAC3E;EAAE,IAAI;EAAkB,SAAS;CAA2B;CAC5D;EAAE,IAAI;EAAgB,SAAS;CAAiE;CAChG;EAAE,IAAI;EAAe,SAAS;CAAmC;CACjE;EAAE,IAAI;EAAkB,SAAS;CAAgC;CACjE;EAAE,IAAI;EAAqB,SAAS;CAAuC;CAC3E;EAAE,IAAI;EAAmB,SAAS;CAA+C;CACjF;EACE,IAAI;EACJ,SACE;CACJ;CACA;EAME,IAAI;EACJ,SACE;CACJ;AACF;;AAGA,MAAM,0BAIC;CACL;EACE,IAAI;EACJ,UAAU;EACV,SAAS;EACT,QAAQ;CACV;CACA;EAKE,IAAI;EACJ,SACE;EACF,SAAS,UAAU;GACjB,MAAM,SAAS,MAAM,QAAQ,SAAS,EAAE;GACxC,OAAO,YAAY,KAAK,MAAM,KAAK,UAAU,MAAM;EACrD;CACF;CACA;EAAE,IAAI;EAAO,SAAS;CAAyB;CAC/C;EAEE,IAAI;EACJ,SAAS;CACX;AACF;;AAGA,MAAM,cAAc;;;;;AAMpB,MAAM,iCAAsC,IAAI,IAAI;CAClD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,SAAS,eAAe,OAAwB;CAE9C,IAAI,MAAM,YAAY,CAAC,CAAC,WAAW,MAAM,GAAG,OAAO;CACnD,MAAM,MAAM,MAAM,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY;CAChE,OAAO,CAAC,eAAe,IAAI,GAAG;AAChC;AAEA,SAAS,UAAU,QAAyB;CAC1C,IAAI,YAAY,KAAK,MAAM,GAAG,OAAO;CACrC,IAAI,MAAM;CACV,IAAI,SAAS;CACb,KAAK,IAAI,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EAC1D,IAAI,QAAQ,OAAO,WAAW,KAAK,IAAI;EACvC,IAAI,QAAQ;GACV,SAAS;GACT,IAAI,QAAQ,GAAG,SAAS;EAC1B;EACA,OAAO;EACP,SAAS,CAAC;CACZ;CACA,OAAO,MAAM,OAAO;AACtB;;AAGA,SAAgB,iBAAiB,MAAkC;CACjE,KAAK,MAAM,YAAY,sBACrB,IAAI,SAAS,QAAQ,KAAK,IAAI,GAAG,OAAO,SAAS;AAGrD;;AAGA,SAAgB,mBAAmB,MAAwB;CACzD,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,YAAY,yBAAyB;EAC9C,IAAI,SAAS,YAAY,CAAC,KAAK,SAAS,SAAS,QAAQ,GAAG;EAC5D,SAAS,QAAQ,YAAY;EAC7B,KAAK,MAAM,SAAS,KAAK,SAAS,SAAS,OAAO,GAChD,IAAI,CAAC,SAAS,UAAU,SAAS,OAAO,MAAM,EAAE,GAAG;GACjD,KAAK,KAAK,SAAS,EAAE;GACrB;EACF;CAEJ;CACA,OAAO;AACT;;;;;;AAOA,SAAS,iBAAiB,QAAiD;CACzE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,SAAS,UAAU,CAAC,GAAG;EAChC,IAAI,MAAM,SAAS,GAAG;EACtB,MAAM,QAAQ,OAAO,KAAK,OAAO,MAAM;EACvC,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,MAAM,SAAS,QAAQ,CAAC;EAClC,MAAM,IAAI,MAAM,SAAS,WAAW,CAAC;EACrC,MAAM,IAAI,mBAAmB,KAAK,CAAC;CACrC;CAEA,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM;AACpE;AAEA,MAAM,cAAc;AAEpB,SAAS,oBAAoB,MAAc,OAAmC;CAC5E,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,IAAI,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,OAAO;CAEtD,IAAI,KAAK,SAAS,KAAK,CAAC,YAAY,KAAK,IAAI,GAAG,OAAO;CACvD,MAAM,UAAU,OAAO,KACrB,MACA,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,IAAI,cAAc,QAC3D,CAAC,CAAC,SAAS,MAAM;CACjB,OAAO,MAAM,MAAM,SAAS,QAAQ,SAAS,IAAI,CAAC;AACpD;;AAGA,SAAS,aAAa,MAAc,cAAqD;CACvF,OAAO,oBAAoB,MAAM,YAAY,IAAI,iBAAiB,iBAAiB,IAAI;AACzF;AAEA,MAAM,gBAAgB;AAEtB,SAAS,OAAO,UAA0B;CACxC,OAAO,GAAG,gBAAgB,SAAS;AACrC;;;;;AAMA,MAAM,uBACJ;AAEF,SAAS,cAAc,OAAwB;CAC7C,OAAO,UAAU,MAAM,qBAAqB,KAAK,KAAK;AACxD;AAEA,MAAM,WAAW;AAIjB,MAAM,YAAY;AAWlB,SAAS,OACP,OACA,MACA,UACA,UACA,QACM;CACN,MAAM,SAAS,MAAM;CACrB,IAAI,WAAW,aAAa,OAAO,kBAAkB;CACrD,OAAO,kBAAkB;CACzB,OAAO,WAAW,aAAa,OAAO,WAAW,aAAa,KAAK;CACnE,OAAO,SAAS,KAAK;EAAE;EAAM;EAAU;EAAU;CAAO,CAAC;AAC3D;AAEA,SAAS,QAAQ,QAAgB,KAA8B;CAC7D,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,CAAC,QAAQ,OAAO,IAAI;AACzE;AAEA,SAAS,aAAa,MAAc,UAAsC;CACxE,IAAI,KAAK,UAAU,WAAW,GAAG,OAAO,KAAA;CACxC,MAAM,QAAQ,OAAO,KAAK,MAAM,MAAM;CACtC,IAAI,MAAM,UAAU,UAAU,OAAO,KAAA;CAErC,IAAI,MAAM;CACV,OAAO,MAAM,OAAO,MAAM,QAAQ,KAAK,SAAU,KAAM,OAAO;CAC9D,OAAO,GAAG,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,cAAc,MAAM,SAAS,IAAI;AACrF;AAEA,SAAS,eAAe,MAAc,MAAc,OAA0B;CAC5E,IAAI,cAAc,IAAI,GAAG,OAAO;CAChC,IAAI,SAAS,KAAK,IAAI,GAAG;EACvB,IAAI,CAAC,MAAM,MAAM,aAAa,OAAO;EACrC,OAAO,OAAO,MAAM,SAAS,SAAS,UAAU;EAChD,OAAO,OAAO,OAAO;CACvB;CACA,MAAM,aAAa,aAAa,MAAM,MAAM,YAAY;CACxD,IAAI,YAAY;EACd,OAAO,OAAO,MAAM,cAAc,YAAY,UAAU;EACxD,OAAO,OAAO,UAAU;CAC1B;CACA,IAAI,SAAS;CACb,KAAK,MAAM,YAAY,yBAAyB;EAC9C,IAAI,SAAS,YAAY,CAAC,OAAO,SAAS,SAAS,QAAQ,GAAG;EAC9D,SAAS,OAAO,QAAQ,SAAS,UAAU,UAAU;GACnD,IAAI,SAAS,UAAU,CAAC,SAAS,OAAO,KAAK,GAAG,OAAO;GACvD,OAAO,OAAO,MAAM,iBAAiB,SAAS,IAAI,UAAU;GAC5D,OAAO,OAAO,SAAS,EAAE;EAC3B,CAAC;CACH;CACA,MAAM,YAAY,aAAa,QAAQ,MAAM,cAAc;CAC3D,IAAI,cAAc,KAAA,GAAW,OAAO;CACpC,OAAO,OAAO,MAAM,eAAe,YAAY,WAAW;CAC1D,OAAO;AACT;AAEA,SAAS,UAAU,OAAwB,OAA0B;CAEnE,OAAO,OADQ,WAAW,UAAU,MAAM,YAAY,CAAC,CAAC,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAClE,CAAC,CAAC,MAAM,GAAG,EAAE,EAAE;AACpC;AAEA,SAAS,YACP,KACA,OACA,MACA,OACA,OACS;CACT,MAAM,OAAO,gBAAgB,GAAG;CAChC,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU,WAC5D,OAAO;CAET,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,GAAG,OAAO;CAE9D,IAAI,SAAS,gBAAgB,OAAO,UAAU,UAAU;EACtD,OAAO,OAAO,MAAM,cAAc,kBAAkB,UAAU;EAC9D,OAAO,OAAO,gBAAgB;CAChC;CACA,IACE,SAAS,WACR,SAAS,oBAAoB,MAAM,MAAM,WAAW,IAAI,gBAAgB,GAErE;MAAA,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;GAC1D,OAAO,OAAO,MAAM,iBAAiB,qBAAqB,UAAU;GACpE,OAAO,OAAO,mBAAmB;EACnC;;CAEF,IAAI,SAAS,gBAAgB,MAAM,MAAM,WAAW,IAAI,YAAY,GAC9D;MAAA,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;GAC1D,OAAO,OAAO,MAAM,cAAc,kBAAkB,eAAe;GACnE,OAAO,UAAU,OAAO,KAAK;EAC/B;;CAEF,IACE,SAAS,iBACT,MAAM,MAAM,WAAW,IAAI,aAAa,KACxC,OAAO,UAAU,UACjB;EACA,OAAO,OAAO,MAAM,eAAe,mBAAmB,UAAU;EAChE,OAAO,OAAO,iBAAiB;CACjC;CACA,OAAO,KAAK,OAAO,MAAM,QAAQ,GAAG,KAAK;AAC3C;AAEA,SAAS,KAAK,OAAgB,MAAc,OAAe,OAA2B;CACpF,IAAI,OAAO,UAAU,UAAU,OAAO,eAAe,OAAO,MAAM,KAAK;CACvE,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,IAAI,YAAY,OAAO,KAAK,KAAK,iBAAiB,aAAa;EAC7D,OAAO,OAAO,MAAM,SAAS,UAAU,UAAU;EACjD,OAAO,OAAO,QAAQ;CACxB;CACA,IAAI,iBAAiB,MAAM,OAAO;CAClC,IAAI,QAAQ,WAAW;EACrB,OAAO,OAAO,MAAM,eAAe,eAAe,WAAW;EAC7D,OAAO,OAAO,aAAa;CAC7B;CACA,IAAI,MAAM,KAAK,IAAI,KAAK,GAAG;EACzB,OAAO,OAAO,MAAM,eAAe,YAAY,UAAU;EACzD,OAAO,OAAO,UAAU;CAC1B;CACA,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,MAAM,UAAU,KAAK,MAAM,QAAQ,MAAM,KAAK,GAAG,QAAQ,GAAG,KAAK,CAAC;EAEtF,MAAM,MAA+B,CAAC;EACtC,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAgC,GAAG;GAC1E,IAAI,SAAS;GACb,MAAM,gBAAgB,aAAa,KAAK,MAAM,YAAY;GAC1D,IAAI,eAAe;IACjB,WAAW;IACX,SAAS,GAAG,OAAO,aAAa,EAAE,GAAG;IACrC,OAAO,OAAO,QAAQ,MAAM,MAAM,GAAG,cAAc,eAAe,UAAU;GAC9E;GACA,IAAI,UAAU,YAAY,KAAK,MAAM,QAAQ,MAAM,MAAM,GAAG,OAAO,KAAK;EAC1E;EACA,OAAO;CACT,UAAU;EACR,MAAM,KAAK,OAAO,KAAK;CACzB;AACF;AAEA,SAAS,UAAU,SAA4C;CAC7D,OAAO;EACL,SAAS;EACT;EACA,gBAAgB;EAChB,YAAY,CAAC;EACb,gBAAgB;EAChB,UAAU,CAAC;CACb;AACF;AAEA,SAAS,SAAS,SAAwB,QAAqC;CAC7E,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,QAAQ,cAAc;CAC5B,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG;CAC3E,MAAM,YAAY,QAAQ;CAK1B,OAAO;EACL;EACA,gBALA,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,aAAa,IACxE,KAAK,IAAI,KAAK,MAAM,SAAS,GAAG,MAAM,cAAc,IACpD,MAAM;EAIV,cAAc,iBAAiB,QAAQ,YAAY;EACnD,QAAQ,UAAU,UAAU,OAAO;EACnC,cAAc,YAAY,EAAE;EAC5B,sBAAM,IAAI,QAAQ;CACpB;AACF;;;;;;AAOA,SAAgB,OACd,OACA,UAAyB,CAAC,GACa;CACvC,MAAM,QAAQ,SAAS,SAAS,QAAQ,MAAM;CAE9C,OAAO;EAAE,OADG,KAAK,OAAO,IAAI,GAAG,KACb;EAAG,QAAQ,MAAM;CAAO;AAC5C;;;;;AAMA,SAAgB,WAAW,MAAc,UAAyB,CAAC,GAAW;CAE5E,OAAO,eAAe,MAAM,IADd,SAAS,SAAS,QAAQ,MACJ,CAAC;AACvC;;AAGA,SAAgB,qBAAqB,UAA4B,WAA4B;CAC3F,OAAO,UAAU,OAAO;AAC1B;AAaA,SAAS,KAAK,OAAkB,MAAc,UAA0B,UAAwB;CAC9F,MAAM,WAAW,MAAM,MAAM,SAAS;CACtC,IAAI,CAAC,UAAU;CACf,MAAM,KAAK,GAAG,SAAS,QAAQ;CAC/B,MAAM,WAAW,MAAM,SAAS,IAAI,EAAE;CACtC,IAAI,UAAU;EACZ,SAAS,SAAS;EAClB,IAAI,SAAS,MAAM,SAAS,GAAG,SAAS,MAAM,KAAK,IAAI;EACvD;CACF;CACA,MAAM,SAAS,IAAI,IAAI;EAAE;EAAU;EAAU;EAAU,OAAO;EAAG,OAAO,CAAC,IAAI;CAAE,CAAC;AAClF;AAEA,SAAS,WAAW,MAAc,MAAc,OAAwB;CACtE,IAAI,cAAc,IAAI,GAAG;CACzB,IAAI,SAAS,KAAK,IAAI,GAAG;EACvB,KAAK,OAAO,MAAM,SAAS,OAAO;EAClC;CACF;CACA,MAAM,aAAa,aAAa,MAAM,MAAM,YAAY;CACxD,IAAI,YAAY;EACd,KAAK,OAAO,MAAM,cAAc,UAAU;EAC1C;CACF;CACA,KAAK,MAAM,YAAY,mBAAmB,IAAI,GAAG,KAAK,OAAO,MAAM,iBAAiB,QAAQ;AAC9F;AAEA,SAAS,UACP,KACA,OACA,MACA,OACA,OACM;CACN,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU,WAAW;CACzE,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,GAAG;CACvD,MAAM,WAAW,YAAY,GAAG;CAChC,IAAI,aAAa,gBAAgB,OAAO,UAAU,UAAU;EAC1D,KAAK,OAAO,MAAM,cAAc,gBAAgB;EAChD;CACF;CACA,MAAM,SAAS,OAAO,UAAU,YAAY,OAAO,UAAU;CAC7D,IAAI,aAAa,mBAAmB,QACrB;MAAA,gBAAgB,GAEtB,MAAM,WAAW,MAAM,YAAY,WAAW;GACnD,KAAK,OAAO,MAAM,iBAAiB,mBAAmB;GACtD;EACF;;CAEF,IAAI,aAAa,gBAAgB,QAAQ,KAAK,OAAO,MAAM,cAAc,gBAAgB;CACzF,IAAI,aAAa,iBAAiB,OAAO,UAAU,UACjD,KAAK,OAAO,MAAM,eAAe,iBAAiB;CACpD,KAAK,OAAO,MAAM,QAAQ,GAAG,KAAK;AACpC;AAEA,SAAS,KAAK,OAAgB,MAAc,OAAe,OAAwB;CACjF,IAAI,OAAO,UAAU,UAAU;EAC7B,WAAW,OAAO,MAAM,KAAK;EAC7B;CACF;CACA,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;CACjD,IAAI,YAAY,OAAO,KAAK,KAAK,iBAAiB,aAAa;EAC7D,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,cAAc;EACnD;CACF;CACA,IAAI,iBAAiB,MAAM;CAC3B,IAAI,QAAQ,WAAW;EACrB,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,uBAAuB,UAAU,QAAQ;EAC9E;CACF;CACA,IAAI,MAAM,KAAK,IAAI,KAAK,GAAG;EACzB,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,qBAAqB;EAC1D;CACF;CACA,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,KAAK,MAAM,CAAC,OAAO,SAAS,MAAM,QAAQ,GACxC,KAAK,MAAM,QAAQ,MAAM,KAAK,GAAG,QAAQ,GAAG,KAAK;GACnD;EACF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAgC,GAAG;GAE1E,MAAM,gBAAgB,aAAa,KAAK,MAAM,YAAY;GAC1D,MAAM,UAAU,gBAAgB,OAAO,aAAa,IAAI;GACxD,IAAI,eAAe,KAAK,OAAO,QAAQ,MAAM,OAAO,GAAG,cAAc,aAAa;GAClF,UAAU,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG,OAAO,KAAK;EAC3D;CACF,UAAU;EACR,MAAM,KAAK,OAAO,KAAK;CACzB;AACF;;;;;;;AAQA,SAAgB,kBAAkB,OAAgB,UAAyB,CAAC,GAAuB;CACjG,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,QAAQ,cAAc;CAC5B,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG;CAC3E,MAAM,QAAmB;EACvB;EACA;EACA,cAAc,iBAAiB,QAAQ,YAAY;EACnD,0BAAU,IAAI,IAAI;EAClB,YAAY,CAAC;EACb,sBAAM,IAAI,QAAQ;CACpB;CACA,KAAK,OAAO,IAAI,GAAG,KAAK;CACxB,OAAO,YAAY,SAAS,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC,GAAG,MAAM,UAAU;AAC5E;;;;;AAMA,SAAgB,gBACd,SACA,UACA,aAAgC,CAAC,GACb;CACpB,MAAM,2BAAW,IAAI,IAAgC;CACrD,KAAK,MAAM,WAAW,UACpB,KAAK,MAAM,WAAW,QAAQ,UAAU;EACtC,MAAM,KAAK,GAAG,QAAQ,SAAS,QAAQ,QAAQ;EAC/C,MAAM,WAAW,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,UAAU;GACb,SAAS,IAAI,IAAI;IAAE,GAAG;IAAS,OAAO,CAAC,GAAG,QAAQ,KAAK;GAAE,CAAC;GAC1D;EACF;EACA,SAAS,SAAS,QAAQ;EAC1B,KAAK,MAAM,QAAQ,QAAQ,OAAO,IAAI,SAAS,MAAM,SAAS,GAAG,SAAS,MAAM,KAAK,IAAI;CAC3F;CAEF,OAAO,YACL,SACA,CAAC,GAAG,SAAS,OAAO,CAAC,GACrB,CAAC,GAAG,SAAS,SAAS,YAAY,QAAQ,UAAU,GAAG,GAAG,UAAU,CACtE;AACF;AAEA,SAAS,YACP,SACA,UACA,YACoB;CASpB,OAAO;EAAE,QAPP,WAAW,SAAS,IAChB,YACA,SAAS,MAAM,YAAY,QAAQ,aAAa,OAAO,IACrD,WACA,SAAS,SAAS,IAChB,uBACA;EACO;EAAS,UAAU,CAAC,GAAG,QAAQ;EAAG,YAAY,CAAC,GAAG,UAAU;CAAE;AACjF;;AAGA,SAAgB,aAAa,SAAsC;CACjE,OAAO,QAAQ,WAAW,UAAU,QAAQ,WAAW;AACzD;;;;;;AAOA,SAAgB,eACd,OACA,UAAyB,CAAC,GAC0C;CACpE,MAAM,WAAW,OAAO,OAAO,OAAO;CACtC,MAAM,UAAU,kBAAkB,SAAS,OAAO;EAChD,SAAS,QAAQ;EACjB,cAAc,QAAQ;CACxB,CAAC;CACD,OAAO;EAAE,OAAO,SAAS;EAAO,QAAQ,SAAS;EAAQ;CAAQ;AACnE"}