@adcp/sdk 12.0.0 → 12.0.2

package/dist/lib/validation/schema-loader.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/validation/schema-loader.ts"],"sourcesContent":["/**\n * JSON Schema loader for AdCP tool request/response validation.\n *\n * Loads the bundled per-tool schemas shipped with the SDK plus the\n * `core/` schemas that async response variants `$ref`, then compiles\n * AJV validators lazily by `(toolName, direction)`.\n *\n * Stage 3: state is per-AdCP-version. The same SDK instance can hold\n * compiled validators for `3.0.0`, `3.0.1`, `3.1.0-beta.1`, etc. side by\n * side; callers pass the version they're validating against. Default is\n * the SDK-pinned `ADCP_VERSION` so callers that don't care about\n * cross-version selection (most internal call sites) keep working\n * unchanged.\n */\n\nimport Ajv, { type ValidateFunction } from 'ajv';\nimport addFormats from 'ajv-formats';\nimport { AsyncLocalStorage } from 'async_hooks';\nimport { readdirSync, readFileSync, existsSync } from 'fs';\nimport path from 'path';\nimport { ADCP_VERSION } from '../version';\nimport { ConfigurationError } from '../errors';\n\nexport type ResponseVariant = 'sync' | 'submitted' | 'working' | 'input-required';\nexport type Direction = 'request' | ResponseVariant;\n\ninterface LoadedSchema {\n  $id?: string;\n  [k: string]: unknown;\n}\n\nconst SCHEMA_FILENAME_SUFFIX: Record<Direction, string> = {\n  request: 'request',\n  sync: 'response',\n  submitted: 'async-response-submitted',\n  working: 'async-response-working',\n  'input-required': 'async-response-input-required',\n};\n\n/**\n * Map a consumer-provided version pin to the loader's bundle key.\n *\n *   - Stable semver `'3.0.0'` / `'3.0.1'` → `'3.0'` (latest patch in minor)\n *   - Bare minor `'3.0'` → `'3.0'` (already the bundle key)\n *   - Release-precision prerelease `'3.1-beta'` / `'3.1-beta.0'` →\n *     returned verbatim. {@link resolveSchemaRoot} fuzzy-resolves to the\n *     highest cached prerelease directory whose own release-precision form\n *     matches (e.g. `'3.1-beta'` matches `schemas/cache/3.1.0-beta.0/`).\n *     Accepted because sellers advertise `supported_versions` in this\n *     shape (`[\"3.1-beta\"]`), and a buyer reading that off the wire must\n *     be able to pin to it.\n *   - Full prerelease semver `'3.1.0-beta.1'` → `'3.1.0-beta.1'`\n *     (exact-version, intentional pin)\n *   - Legacy alias `'v3'` / `'v2.5'` / `'v2.6'` → returned verbatim (cache\n *     historically keyed these directories by the alias name)\n *\n * Per the AdCP spec convention patches don't change wire shape, so collapsing\n * stable patches into the minor is functionally equivalent for any validator\n * consumer. Prereleases are kept exact because pinning a beta is intentional\n * and bit-fidelity matters for cross-version interop tests.\n *\n * Throws `ConfigurationError` for any input that doesn't match one of the\n * recognized shapes. Strings reach `path.join` via `resolveSchemaRoot`, and\n * pass-through of arbitrary garbage (`'../etc'`, `'3foo'`) lets a non-version\n * directory probe leak through `hasSchemaBundle`'s boolean. The throw is\n * caught by `hasSchemaBundle`'s try/catch (still returns false) and surfaces\n * with a useful field name from `resolveAdcpVersion`.\n */\nexport function resolveBundleKey(version: string): string {\n  // Bare 'MAJOR.MINOR' (no patch).\n  const minorOnly = version.match(/^(\\d+)\\.(\\d+)$/);\n  if (minorOnly) return `${minorOnly[1]}.${minorOnly[2]}`;\n  // Release-precision prerelease 'MAJOR.MINOR-PRE' (no patch). Same SemVer §9\n  // prerelease constraint as the full-semver branch — `'3.1-/../etc'`-style\n  // strings can't slip through. Returns verbatim; resolveSchemaRoot does the\n  // fuzzy directory match.\n  const releasePrecisionPre = version.match(/^(\\d+)\\.(\\d+)-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*$/);\n  if (releasePrecisionPre) return version;\n  // Full 'MAJOR.MINOR.PATCH' with optional prerelease. Prerelease group\n  // restricted to SemVer §9 identifiers (alphanumerics + hyphen,\n  // dot-separated) so `'3.0.0-/../etc'`-style strings can't slip through\n  // and reach `path.join` as a directory component. The full version is\n  // returned verbatim for prereleases, so this is the last line of defense\n  // before that string becomes a path segment.\n  const semver = version.match(/^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*))?$/);\n  if (semver) {\n    const [, major, minor, , prerelease] = semver;\n    if (prerelease !== undefined) return version;\n    return `${major}.${minor}`;\n  }\n  // Legacy alias: 'v' followed by a major and optional minor. Restricted to\n  // this exact shape so non-version garbage can't reach the filesystem.\n  const legacyAlias = version.match(/^v\\d+(\\.\\d+)?$/);\n  if (legacyAlias) return version;\n  throw new ConfigurationError(\n    `AdCP version ${JSON.stringify(version)} is not a recognized version format. ` +\n      `Expected semver (e.g. '3.0.1', '3.1.0-beta.1'), bare minor ('3.0'), ` +\n      `release-precision ('3.1-beta'), or legacy alias ('v3', 'v2.5').`,\n    'adcpVersion'\n  );\n}\n\n/**\n * Collapse a bundle key to the release-precision string the AdCP wire schema\n * accepts for the `adcp_version` envelope field (spec PR\n * `adcontextprotocol/adcp#3493`). The wire pattern is\n * `^\\d+\\.\\d+(-[a-zA-Z0-9.-]+)?$` — release-precision (MAJOR.MINOR with\n * optional prerelease), never full MAJOR.MINOR.PATCH semver.\n *\n *   - Stable bundle key `'3.0'` / `'3.1'` → returned verbatim.\n *   - Prerelease bundle key `'3.1.0-beta.0'` → `'3.1-beta.0'` (PATCH segment\n *     dropped; the prerelease tag is the wire-meaningful release identifier,\n *     PATCH is implementation-internal).\n *   - Full stable semver `'3.0.11'` → `'3.0'` (patches don't change wire\n *     shape; surface them via `build_version` on capabilities instead).\n *   - Legacy alias `'v3'` / `'v2.5'` — returned verbatim. The wire spec\n *     predates the envelope field, so legacy-aliased clients won't emit\n *     `adcp_version` anyway (gated by `bundleSupportsAdcpVersionField`).\n *\n * The normalization rule is declared in `core/version-envelope.json`:\n *\n *   > SDKs that read full-semver values from bundle metadata (e.g.\n *   > ComplianceIndex.published_version = \"3.1.0-beta.1\") MUST normalize to\n *   > release-precision (\"3.1-beta.1\") before emitting on the wire —\n *   > meta-field values are NOT valid wire values.\n *\n * **Idempotent.** Re-applying to an already-wire-shaped value is a no-op:\n * `toReleasePrecisionWire('3.1-beta.0') === '3.1-beta.0'`. Safe to call\n * defensively on values a caller read off the wire and is passing back.\n *\n * **Prerelease regex is stricter than the wire pattern by design.** The wire\n * pattern allows `[a-zA-Z0-9.-]+` (any mix of dots and hyphens), but this\n * function only accepts SemVer §9-shaped prerelease tags\n * (`[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*`) — disallowing leading dots, double\n * dots, or trailing dots. Mirrors the path-traversal hardening on\n * {@link resolveBundleKey} (`'3.0.0-/../etc'`-style strings can't reach the\n * filesystem there, and shouldn't be silently mirrored to the wire here).\n * A future reader who wants to \"fix\" this to match the wire regex\n * character-for-character should NOT — the strictness is intentional.\n *\n * Defense: rejecting unrecognized shapes here surfaces SDK-internal misuse\n * (someone calling this with raw garbage) loudly instead of silently\n * emitting a non-spec wire string.\n */\n/**\n * The exact pattern `core/version-envelope.json` applies to `adcp_version`\n * on the wire. Kept verbatim so {@link validateAdcpVersionWire} doesn't\n * drift from the spec — bump only when the spec itself bumps.\n */\nconst ADCP_VERSION_WIRE_PATTERN = /^\\d+\\.\\d+(-[a-zA-Z0-9.-]+)?$/;\n\n/**\n * Validate a string against the AdCP 3.1 `adcp_version` wire pattern.\n * Throws `ConfigurationError` with a hint that points at\n * {@link toReleasePrecisionWire} when the value would be sent on the wire\n * but doesn't satisfy `core/version-envelope.json`'s pattern.\n *\n * Use this when you're constructing a request envelope by hand (storyboard\n * fixtures, conformance harnesses, custom transports) and want a clear\n * error rather than a downstream AJV pattern-mismatch from the seller —\n * by the time the seller rejects the request, the buyer's stack frame is\n * long gone and `core/version-envelope.json/properties/adcp_version/pattern`\n * is the only clue.\n *\n * The SDK's own `buildVersionEnvelope` calls this as a postcondition after\n * normalizing the bundle key — should never throw in well-formed SDK code,\n * but if a future refactor breaks the normalization the assertion fires\n * with a message that names the helper to call.\n *\n * Returns the value with the type narrowed to `string` via assertion.\n */\nexport function validateAdcpVersionWire(value: unknown): asserts value is string {\n  if (typeof value !== 'string') {\n    throw new ConfigurationError(\n      `adcp_version must be a string. Got ${typeof value}. ` +\n        `Use toReleasePrecisionWire() to convert a bundle key or full-semver pin to a wire-shaped string.`,\n      'adcp_version'\n    );\n  }\n  if (!ADCP_VERSION_WIRE_PATTERN.test(value)) {\n    throw new ConfigurationError(\n      `adcp_version ${JSON.stringify(value)} doesn't match the AdCP 3.1 wire pattern ${ADCP_VERSION_WIRE_PATTERN}. ` +\n        `Full-semver bundle keys (e.g. \"3.1.0-beta.0\") are NOT valid wire values — ` +\n        `call toReleasePrecisionWire() to normalize (e.g. \"3.1.0-beta.0\" → \"3.1-beta.0\").`,\n      'adcp_version'\n    );\n  }\n}\n\nexport function toReleasePrecisionWire(bundleKeyOrVersion: string): string {\n  // Bare release-precision (MAJOR.MINOR or MAJOR.MINOR-PRE) — already wire-shaped.\n  const releasePrecision = bundleKeyOrVersion.match(/^(\\d+)\\.(\\d+)(-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$/);\n  if (releasePrecision) {\n    const [, major, minor, prerelease = ''] = releasePrecision;\n    return `${major}.${minor}${prerelease}`;\n  }\n  // Full semver — collapse PATCH segment. Prerelease (if any) is preserved.\n  const fullSemver = bundleKeyOrVersion.match(/^(\\d+)\\.(\\d+)\\.\\d+(-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$/);\n  if (fullSemver) {\n    const [, major, minor, prerelease = ''] = fullSemver;\n    return `${major}.${minor}${prerelease}`;\n  }\n  // Legacy alias passthrough. Callers that reach here with a legacy alias\n  // shouldn't be emitting `adcp_version` (no version-envelope support), but\n  // returning the input verbatim is least-surprise.\n  if (/^v\\d+(\\.\\d+)?$/.test(bundleKeyOrVersion)) return bundleKeyOrVersion;\n  throw new ConfigurationError(\n    `Cannot normalize ${JSON.stringify(bundleKeyOrVersion)} to release-precision wire format. ` +\n      `Expected a bundle key or AdCP version string.`,\n    'adcpVersion'\n  );\n}\n\n/**\n * Resolve the directory that holds the bundled + core schemas for a given\n * AdCP version. Source layout (dev):\n *   schemas/cache/<exact-version>/{bundled,core}\n * Built layout (dist):\n *   dist/lib/schemas-data/<bundle-key>/{bundled,core}\n *\n * Stable releases use minor-name keys (`3.0/`); prereleases use full-version\n * keys (`3.1.0-beta.1/`). See {@link resolveBundleKey}.\n *\n * Falls back to the source-tree cache when dist isn't built (dev workflow\n * before `npm run build:lib`). For stable pins, the cache fallback scans\n * for the highest-patch sibling in the requested minor — `'3.0.0'` resolves\n * to `schemas/cache/3.0.1/` when only `3.0.1` is cached, matching dist's\n * collapse behavior.\n *\n * Throws when no bundle exists. Callers pinning a specific prerelease\n * surface the error; the construction-time fence in `resolveAdcpVersion`\n * catches most cross-major mistakes before this point.\n */\nfunction resolveSchemaRoot(version: string): string {\n  const key = resolveBundleKey(version);\n  const scopedRoot = scopedExternalSchemaRoots.getStore()?.get(key);\n  if (scopedRoot && existsSync(scopedRoot)) return scopedRoot;\n\n  const externalRoot = externalSchemaRoots.get(key);\n  if (externalRoot && existsSync(externalRoot)) return externalRoot;\n\n  const distCandidate = path.join(__dirname, '..', 'schemas-data', key);\n  if (existsSync(distCandidate)) return distCandidate;\n\n  // Published builds carry exact prerelease bundle directories\n  // (`3.1.0-rc.1/`), while callers may pin the release-precision family\n  // alias (`3.1-rc`). Resolve that alias before falling back to source cache.\n  const releasePrecisionMatch = /^\\d+\\.\\d+-/.test(key);\n  if (releasePrecisionMatch) {\n    const distPrereleaseCandidate = findPrereleaseBundle(path.join(__dirname, '..', 'schemas-data'), key);\n    if (distPrereleaseCandidate) return distPrereleaseCandidate;\n  }\n\n  // Source-tree fallback: cache stays exact-version-named, so map the key\n  // back to the highest-patch cache directory in the same minor for stable\n  // pins. Prereleases need an exact match.\n  const cacheRoot = path.join(__dirname, '..', '..', '..', 'schemas', 'cache');\n  const exactCandidate = path.join(cacheRoot, version);\n  if (existsSync(exactCandidate)) return exactCandidate;\n\n  // For minor-only or stable-patch pins, find the highest stable patch in\n  // the cache that matches the resolved minor. Skip `*.previous` snapshots\n  // — `sync-schemas` writes those as transient backups during replaceTree;\n  // a partially-written snapshot whose patch number happens to be highest\n  // would otherwise win the sort.\n  const minorMatch = key.match(/^(\\d+)\\.(\\d+)$/);\n  if (minorMatch && existsSync(cacheRoot)) {\n    const [, major, minor] = minorMatch;\n    const prefix = `${major}.${minor}.`;\n    const cached = readdirSync(cacheRoot, { withFileTypes: true })\n      .filter(\n        e =>\n          e.isDirectory() &&\n          e.name.startsWith(prefix) &&\n          !e.name.endsWith('.previous') &&\n          /^\\d+\\.\\d+\\.\\d+$/.test(e.name)\n      )\n      .map(e => ({\n        name: e.name,\n        patch: parseInt(e.name.slice(prefix.length), 10),\n      }))\n      .filter(c => Number.isFinite(c.patch))\n      .sort((a, b) => b.patch - a.patch);\n    if (cached.length > 0) return path.join(cacheRoot, cached[0]!.name);\n  }\n\n  // For release-precision prerelease pins (`'3.1-beta'`, `'3.1-beta.0'`),\n  // find the highest cached prerelease directory whose own release-precision\n  // form starts with the requested key. A pin of `'3.1-beta'` matches any\n  // directory whose `toReleasePrecisionWire` form is `'3.1-beta'` or\n  // `'3.1-beta.*'`. A pin of `'3.1-beta.0'` matches `'3.1-beta.0'` or\n  // `'3.1-beta.0.*'`. Sort newest-first by directory name with numeric\n  // collation so rc.10 wins over rc.9.\n  if (releasePrecisionMatch) {\n    const cachePrereleaseCandidate = findPrereleaseBundle(cacheRoot, key);\n    if (cachePrereleaseCandidate) return cachePrereleaseCandidate;\n  }\n\n  throw new Error(\n    `AdCP schema data for version \"${version}\" not found. ` +\n      `Looked for bundle key \"${key}\" in ${distCandidate}, exact path ${exactCandidate}, ` +\n      `and the latest-patch fallback in ${cacheRoot}. ` +\n      `Run \\`npm run sync-schemas\\` and \\`npm run build:lib\\` to populate the bundle.`\n  );\n}\n\nfunction findPrereleaseBundle(root: string, key: string): string | undefined {\n  if (!existsSync(root)) return undefined;\n  const cached = readdirSync(root, { withFileTypes: true })\n    .filter(e => e.isDirectory() && !e.name.endsWith('.previous'))\n    .map(e => {\n      try {\n        return { name: e.name, rp: toReleasePrecisionWire(e.name) };\n      } catch {\n        return null;\n      }\n    })\n    .filter((c): c is { name: string; rp: string } => c !== null)\n    .filter(c => c.rp === key || c.rp.startsWith(`${key}.`))\n    .sort((a, b) => compareBundleNamesDesc(a.name, b.name));\n  if (cached.length === 0) return undefined;\n  return path.join(root, cached[0]!.name);\n}\n\nfunction compareBundleNamesDesc(a: string, b: string): number {\n  return b.localeCompare(a, undefined, { numeric: true, sensitivity: 'base' });\n}\n\ninterface LoaderState {\n  ajv: Ajv;\n  fileIndex: Map<string, string>;\n  validators: Map<string, ValidateFunction>;\n  rawSchemas: Map<string, Record<string, unknown>>;\n  root: string;\n  coreLoaded: boolean;\n  version: string;\n}\n\nconst states: Map<string, LoaderState> = new Map();\nconst externalSchemaRoots: Map<string, string> = new Map();\nconst scopedExternalSchemaRoots = new AsyncLocalStorage<Map<string, string>>();\n\nfunction stateCacheKey(bundleKey: string, root: string): string {\n  return `${bundleKey}\\0${root}`;\n}\n\nfunction clearStatesForBundle(bundleKey: string): void {\n  for (const [stateKey, state] of states) {\n    if (state.version === bundleKey) states.delete(stateKey);\n  }\n}\n\nfunction hasSchemaRootShape(root: string): boolean {\n  if (!existsSync(root)) return false;\n  const bundledRoot = path.join(root, 'bundled');\n  const files = existsSync(bundledRoot) ? walkJsonFiles(bundledRoot) : walkJsonFiles(root);\n  return files.some(file => {\n    try {\n      const schema = loadJson(file);\n      return typeof schema.$id === 'string' || typeof schema.$schema === 'string';\n    } catch {\n      return false;\n    }\n  });\n}\n\nfunction schemaIdVersionHint(schemaId: string): string | undefined {\n  return schemaId.match(/\\/schemas\\/([^/]+)\\//)?.[1];\n}\n\nfunction collectSchemaRootVersionAliases(root: string): Set<string> {\n  const aliases = new Set<string>();\n  for (const file of walkJsonFiles(root)) {\n    let schema: LoadedSchema;\n    try {\n      schema = loadJson(file);\n    } catch {\n      continue;\n    }\n    if (typeof schema.$id !== 'string') continue;\n    const hint = schemaIdVersionHint(schema.$id);\n    if (!hint) continue;\n    for (const alias of schemaRootVersionAliases(hint)) aliases.add(alias);\n  }\n  return aliases;\n}\n\nfunction schemaRootVersionAliases(version: string): Set<string> {\n  const aliases = new Set<string>([version]);\n  try {\n    aliases.add(resolveBundleKey(version));\n  } catch {\n    // Keep the raw value only; callers that care will throw separately.\n  }\n  try {\n    const releasePrecision = toReleasePrecisionWire(version);\n    aliases.add(releasePrecision);\n    const family = prereleaseFamilyAlias(releasePrecision);\n    if (family) aliases.add(family);\n  } catch {\n    // Keep any aliases already collected.\n  }\n  return aliases;\n}\n\nfunction prereleaseFamilyAlias(releasePrecisionVersion: string): string | undefined {\n  return releasePrecisionVersion.match(/^(\\d+\\.\\d+-[0-9A-Za-z-]+)\\.\\d+$/)?.[1];\n}\n\nfunction collectSchemaRootVersionAliasGroups(root: string): Array<{ hint: string; aliases: Set<string> }> {\n  const groups: Array<{ hint: string; aliases: Set<string> }> = [];\n  for (const file of walkJsonFiles(root)) {\n    let schema: LoadedSchema;\n    try {\n      schema = loadJson(file);\n    } catch {\n      continue;\n    }\n    if (typeof schema.$id !== 'string') continue;\n    const hint = schemaIdVersionHint(schema.$id);\n    if (!hint) continue;\n    groups.push({ hint, aliases: schemaRootVersionAliases(hint) });\n  }\n  return groups;\n}\n\nfunction assertSchemaRootMatchesVersion(version: string, root: string): Set<string> {\n  const expectedAliases = schemaRootVersionAliases(version);\n  const rootGroups = collectSchemaRootVersionAliasGroups(root);\n  const rootAliases = collectSchemaRootVersionAliases(root);\n  if (\n    rootGroups.length > 0 &&\n    rootGroups.every(group => [...group.aliases].some(alias => expectedAliases.has(alias)))\n  ) {\n    return new Set([...expectedAliases, ...rootAliases]);\n  }\n  const found =\n    rootGroups.length === 0\n      ? 'no AdCP schema ids'\n      : rootGroups\n          .map(group => `${group.hint} (${Array.from(group.aliases).sort().join(', ')})`)\n          .sort()\n          .join(', ');\n  throw new Error(\n    `External AdCP schema root for version \"${version}\" at ${root} does not match the requested version and ` +\n      `must contain only schema ids matching ${Array.from(expectedAliases).sort().join(', ')}; found ${found}.`\n  );\n}\n\nconst externalSchemaRootAliases: Map<string, Set<string>> = new Map();\n\n/**\n * Register a schema bundle supplied outside the installed SDK package.\n *\n * Compliance runners use this when `--compliance-dir` points at another\n * package/check-out whose storyboards and schema bundle should be used\n * together. The root must be the schema-data directory itself, e.g.\n * `.../dist/lib/schemas-data/3.0`.\n */\nexport function registerExternalSchemaRoot(version: string, root: string): void {\n  const key = resolveBundleKey(version);\n  if (!hasSchemaRootShape(root)) {\n    throw new Error(`External AdCP schema root for version \"${version}\" not found or empty at ${root}`);\n  }\n  const aliases = assertSchemaRootMatchesVersion(version, root);\n  externalSchemaRootAliases.set(key, aliases);\n  for (const alias of aliases) {\n    const previous = externalSchemaRoots.get(alias);\n    externalSchemaRoots.set(alias, root);\n    if (previous !== root) clearStatesForBundle(alias);\n  }\n}\n\n/** Test/helper hook for unregistering an external schema bundle. */\nexport function unregisterExternalSchemaRoot(version: string): void {\n  const key = resolveBundleKey(version);\n  const aliases = new Set(schemaRootVersionAliases(version));\n  for (const [registeredKey, registeredAliases] of externalSchemaRootAliases) {\n    if (\n      registeredKey === key ||\n      registeredAliases.has(key) ||\n      [...aliases].some(alias => registeredAliases.has(alias))\n    ) {\n      for (const alias of registeredAliases) aliases.add(alias);\n      externalSchemaRootAliases.delete(registeredKey);\n    }\n  }\n  for (const alias of aliases) {\n    externalSchemaRoots.delete(alias);\n    clearStatesForBundle(alias);\n  }\n}\n\n/**\n * Run a callback with an external schema root scoped to the current async\n * execution chain. Unlike `registerExternalSchemaRoot`, this does not poison\n * process-global validation state for later hosted/compliance runs.\n */\nexport function withExternalSchemaRoot<T>(version: string, root: string | undefined, fn: () => T): T {\n  if (root === undefined) return fn();\n  if (!hasSchemaRootShape(root)) {\n    throw new Error(`External AdCP schema root for version \"${version}\" not found or empty at ${root}`);\n  }\n  const aliases = assertSchemaRootMatchesVersion(version, root);\n  const parent = scopedExternalSchemaRoots.getStore();\n  const next = new Map(parent);\n  for (const alias of aliases) {\n    next.set(alias, root);\n    clearStatesForBundle(alias);\n  }\n  return scopedExternalSchemaRoots.run(next, fn);\n}\n\nfunction walkJsonFiles(dir: string): string[] {\n  if (!existsSync(dir)) return [];\n  const out: string[] = [];\n  for (const entry of readdirSync(dir, { withFileTypes: true })) {\n    const full = path.join(dir, entry.name);\n    if (entry.isDirectory()) out.push(...walkJsonFiles(full));\n    else if (entry.isFile() && entry.name.endsWith('.json')) out.push(full);\n  }\n  return out;\n}\n\nfunction loadJson(file: string): LoadedSchema {\n  return JSON.parse(readFileSync(file, 'utf-8')) as LoadedSchema;\n}\n\n/**\n * Clear `additionalProperties: false` at the response root so envelope\n * fields (`replayed`, `context`, `ext`, and future envelope additions)\n * can ride alongside the tool-specific body — per security.mdx the\n * envelope is always extensible. Upstream bundled schemas pin\n * `additionalProperties: false` at the root on a handful of mutating\n * tools (the property-list family), which rejects envelope fields like\n * `replayed` that aren't declared in the tool-specific body.\n *\n * Scope is deliberately narrow: only the top-level object, plus each\n * direct branch of a root-level `oneOf` / `anyOf` / `allOf`. Nested\n * bodies stay strict so response-side drift detection still catches\n * typos inside `Product`, `Package`, `MediaBuy` etc. Applied only to\n * response variants; request schemas stay strict so outgoing drift\n * fails at the edge.\n */\nfunction relaxResponseRoot(schema: LoadedSchema): LoadedSchema {\n  const clone = { ...schema };\n  if (clone.additionalProperties === false) {\n    clone.additionalProperties = true;\n  }\n  for (const key of ['oneOf', 'anyOf', 'allOf'] as const) {\n    const branches = clone[key];\n    if (Array.isArray(branches)) {\n      clone[key] = branches.map(branch => {\n        if (!branch || typeof branch !== 'object') return branch;\n        const branchClone = { ...(branch as Record<string, unknown>) };\n        if (branchClone.additionalProperties === false) {\n          branchClone.additionalProperties = true;\n        }\n        return branchClone;\n      });\n    }\n  }\n  return clone;\n}\n\nfunction getAjvRegisteredIds(ajv: Ajv): Set<string> {\n  const internals = ajv as unknown as {\n    schemas?: Record<string, unknown>;\n    refs?: Record<string, unknown>;\n  };\n  return new Set([...Object.keys(internals.schemas ?? {}), ...Object.keys(internals.refs ?? {})]);\n}\n\n/**\n * Build the (toolName, direction) → file path index by scanning the schema\n * tree once. Runs eagerly at first validator lookup.\n */\nfunction buildFileIndex(root: string): Map<string, string> {\n  const index = new Map<string, string>();\n  const record = (toolName: string, direction: Direction, file: string): void => {\n    index.set(`${toolName}::${direction}`, file);\n  };\n\n  // Sync request/response live in the pre-resolved bundled/ tree.\n  const bundledRoot = path.join(root, 'bundled');\n  for (const file of walkJsonFiles(bundledRoot)) {\n    const base = path.basename(file, '.json');\n    if (base.endsWith('-request')) {\n      const tool = base.slice(0, -'-request'.length).replace(/-/g, '_');\n      record(tool, 'request', file);\n    } else if (base.endsWith('-response')) {\n      const tool = base.slice(0, -'-response'.length).replace(/-/g, '_');\n      record(tool, 'sync', file);\n    }\n  }\n\n  // Async variants AND domain schemas that ship flat (not pre-bundled) both\n  // live in the per-domain directories. Walk each for sync request/response\n  // files and async variant files. Skip `bundled/` (already indexed above)\n  // and `core/` (pure $ref targets, no tools).\n  //\n  // Flat-tree domains include `governance/`, `brand/`, `account/`,\n  // `content-standards/`, `property/`, `collection/` — their schemas are\n  // NOT pre-resolved into `bundled/`, so a bundled-only walk would miss\n  // every `check_governance` / `acquire_rights` / `creative_approval` /\n  // `sync_governance` / `*_property_list` request-response pair. That gap\n  // (flagged by the ad-tech-protocol reviewer on PR #831) would leave\n  // protocol-wide-requirement-bearing tasks (idempotency_key pattern,\n  // `format: uri` on `caller`) invisible to the strict-validation signal.\n  // Register flat-tree sync pairs only when `bundled/` didn't already\n  // index them, so pre-resolved schemas (with $refs already inlined) win\n  // for any domain that ships both.\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory()) continue;\n    if (entry.name === 'bundled' || entry.name === 'core') continue;\n    const domainDir = path.join(root, entry.name);\n    for (const file of walkJsonFiles(domainDir)) {\n      const base = path.basename(file, '.json');\n      if (base.endsWith('-async-response-submitted')) {\n        const tool = base.slice(0, -'-async-response-submitted'.length).replace(/-/g, '_');\n        record(tool, 'submitted', file);\n      } else if (base.endsWith('-async-response-working')) {\n        const tool = base.slice(0, -'-async-response-working'.length).replace(/-/g, '_');\n        record(tool, 'working', file);\n      } else if (base.endsWith('-async-response-input-required')) {\n        const tool = base.slice(0, -'-async-response-input-required'.length).replace(/-/g, '_');\n        record(tool, 'input-required', file);\n      } else if (base.endsWith('-request')) {\n        const tool = base.slice(0, -'-request'.length).replace(/-/g, '_');\n        if (!index.has(`${tool}::request`)) record(tool, 'request', file);\n      } else if (base.endsWith('-response')) {\n        const tool = base.slice(0, -'-response'.length).replace(/-/g, '_');\n        if (!index.has(`${tool}::sync`)) record(tool, 'sync', file);\n      }\n    }\n  }\n\n  return index;\n}\n\nfunction ensureInit(version: string): LoaderState {\n  // States are keyed by bundle key, not by raw version string, so\n  // `getValidator('foo', 'request', '3.0.0')` and the same call with\n  // `'3.0.1'` share state — both resolve to bundle key `'3.0'` and the\n  // same compiled AJV instance.\n  const key = resolveBundleKey(version);\n  const root = resolveSchemaRoot(version);\n  const cacheKey = stateCacheKey(key, root);\n  const cached = states.get(cacheKey);\n  if (cached) return cached;\n  const ajv = new Ajv({\n    strict: false,\n    allErrors: true,\n    allowUnionTypes: true,\n  });\n  addFormats(ajv);\n\n  const state: LoaderState = {\n    ajv,\n    fileIndex: buildFileIndex(root),\n    validators: new Map(),\n    rawSchemas: new Map(),\n    root,\n    coreLoaded: false,\n    version: key,\n  };\n  states.set(cacheKey, state);\n  return state;\n}\n\n/**\n * Lazily pre-register every non-tool JSON schema shipped with the SDK so\n * cross-domain `$ref`s compile. Async response variants and flat-tree\n * domain schemas `$ref` out to three classes of building-block schemas:\n *\n *   - `core/` + `enums/` — shared primitives referenced by every domain.\n *   - `pricing-options/`, `error-details/`, `extensions/` — stand-alone\n *     fragment trees.\n *   - Sibling fragments inside each domain directory — e.g.\n *     `governance/audience-constraints.json` referenced by\n *     `governance/sync-plans-request.json`, or `signals/*` fragments\n *     referenced by `signals/activate-signal-*.json`.\n *\n * Walk every directory except `bundled/` (pre-resolved schemas with refs\n * already inlined). Response files that `buildFileIndex` registered as tools\n * are registered with `relaxResponseRoot` applied, matching `getValidator`.\n * The fileIndex check is stricter than a filename-suffix match:\n * building-block fragments like `core/pagination-response.json` end in\n * `-response.json` but aren't tools, so suffix-matching would wrongly treat\n * them as relaxable response roots.\n */\nfunction ensureCoreLoaded(s: LoaderState): void {\n  if (s.coreLoaded) return;\n  // Tool response files are pre-registered with the same response-root\n  // relaxation `getValidator` would apply. This matters for the async response\n  // union: `core/async-response-data.json` can `$ref` both async variants and\n  // sync responses, so callers must not have to prewarm response validators\n  // before compiling a request that references the union.\n  //\n  // Why this matters: bundles whose source tree doesn't include a `bundled/`\n  // pre-resolved subtree (e.g. v2.5, where the spec ships flat schemas with\n  // unresolved `$ref`s) classify fragments like `media-buy/package-request.json`\n  // as tool `package::request` via the filename-suffix heuristic in\n  // `buildFileIndex`. Skipping all tool files would leave that fragment\n  // unregistered, so a later compile of `create_media_buy` fails on\n  // `MissingRefError: can't resolve /schemas/media-buy/package-request.json`.\n  //\n  const responseToolFiles = new Map<string, Direction>();\n  for (const [key, file] of s.fileIndex) {\n    if (key.endsWith('::request')) continue;\n    const direction = key.slice(key.indexOf('::') + 2) as Direction;\n    responseToolFiles.set(file, direction);\n  }\n  const registeredIds = getAjvRegisteredIds(s.ajv);\n  for (const entry of readdirSync(s.root, { withFileTypes: true })) {\n    if (!entry.isDirectory()) continue;\n    if (entry.name === 'bundled') continue;\n    const abs = path.join(s.root, entry.name);\n    for (const file of walkJsonFiles(abs)) {\n      const responseDirection = responseToolFiles.get(file);\n      const schema = loadJson(file);\n      const schemaToRegister = responseDirection === undefined ? schema : relaxResponseRoot(schema);\n      if (typeof schemaToRegister.$id === 'string' && !registeredIds.has(schemaToRegister.$id)) {\n        s.ajv.addSchema(schemaToRegister);\n        registeredIds.add(schemaToRegister.$id);\n      }\n    }\n  }\n  s.coreLoaded = true;\n}\n\n/**\n * Look up the compiled AJV validator for a given tool + direction in the\n * specified AdCP version's schema bundle. Returns `undefined` when no\n * schema exists for the pair — callers can skip validation cleanly (e.g.,\n * custom tools outside the AdCP spec).\n *\n * `version` defaults to the SDK-pinned `ADCP_VERSION`. Pass the per-instance\n * `getAdcpVersion()` value when the validator should track the client/server's\n * configured pin (Stage 3+).\n */\nexport function getValidator(\n  toolName: string,\n  direction: Direction,\n  version: string = ADCP_VERSION\n): ValidateFunction | undefined {\n  const s = ensureInit(version);\n  const cacheKey = `${toolName}::${direction}`;\n  const cached = s.validators.get(cacheKey);\n  if (cached) return cached;\n\n  const file = s.fileIndex.get(cacheKey);\n  if (!file) return undefined;\n\n  // Schemas that $ref into core/ and enums/ need those trees registered\n  // before compile. Async response variants always do; flat-tree domain\n  // schemas (anything outside `bundled/`) do too — their $refs weren't\n  // pre-resolved at spec-publish time.\n  const fromBundled = file.includes(`${path.sep}bundled${path.sep}`);\n  if (direction === 'request' || !fromBundled) ensureCoreLoaded(s);\n\n  const rawSchema = loadJson(file);\n  // Bundled files inline every referenced subschema with the original\n  // canonical `$id` (e.g. `core/version-envelope.json` appears nested\n  // inside every bundled tool response). Bundled files carry NO\n  // internal `$ref`s — the spec publishes them fully resolved, see\n  // the `note: \"This is a bundled schema with all $ref resolved inline\"`\n  // tag on every bundled file. Once `ensureCoreLoaded` has registered\n  // any of those core schemas standalone (which it does for the flat-\n  // tree governance / brand / property domains), Ajv's compile of a\n  // bundled file trips the ambiguous-ref check on every nested $id.\n  //\n  // The fix: strip nested `$id` fields before compile on bundled\n  // schemas. The root `$id` is kept (it's the validator's lookup key);\n  // every other `$id` in the tree was just metadata anyway.\n  const prepared = fromBundled ? stripNestedIds(rawSchema) : rawSchema;\n  const schema = direction === 'request' ? prepared : relaxResponseRoot(prepared);\n  const existing = typeof schema.$id === 'string' ? s.ajv.getSchema(schema.$id) : undefined;\n  const compiled = existing ?? s.ajv.compile(schema);\n  s.validators.set(cacheKey, compiled);\n  return compiled;\n}\n\n/**\n * Compile an arbitrary schema from the cached bundle by path, e.g.\n * `core/mcp-webhook-payload.json`. Used by storyboard webhook assertions\n * whose payload schema is not tied to a tool request/response pair.\n */\nexport function getSchemaValidatorByRef(\n  schemaRef: string,\n  version: string = ADCP_VERSION\n): ValidateFunction | undefined {\n  const s = ensureInit(version);\n  const normalized = normalizeSchemaRef(schemaRef);\n  if (!normalized) return undefined;\n\n  const cacheKey = `schema-ref::${normalized}`;\n  const cached = s.validators.get(cacheKey);\n  if (cached) return cached;\n\n  const file = path.join(s.root, normalized);\n  if (!existsSync(file)) return undefined;\n\n  // Use an isolated AJV instance for arbitrary schema refs. Tool response\n  // validators deliberately relax some roots for SDK back-compat; webhook\n  // payload schemas need strict raw JSON Schema behavior without polluting the\n  // shared tool-validator registry with unrelaxed response schemas.\n  const ajv = new Ajv({\n    strict: false,\n    allErrors: true,\n    allowUnionTypes: true,\n  });\n  addFormats(ajv);\n  const dependencySchemas: LoadedSchema[] = [];\n  const registeredIds = new Set<string>();\n  for (const schemaFile of walkJsonFiles(s.root)) {\n    if (schemaFile.includes(`${path.sep}bundled${path.sep}`)) continue;\n    if (schemaFile === file) continue;\n    const schema = loadJson(schemaFile);\n    if (typeof schema.$id === 'string' && !registeredIds.has(schema.$id)) {\n      registeredIds.add(schema.$id);\n      dependencySchemas.push(schema);\n    }\n  }\n  if (dependencySchemas.length > 0) {\n    ajv.addSchema(dependencySchemas);\n  }\n  const rawSchema = loadJson(file);\n  const compiled = ajv.compile(rawSchema);\n  s.validators.set(cacheKey, compiled);\n  return compiled;\n}\n\nfunction normalizeSchemaRef(schemaRef: string): string | undefined {\n  const trimmed = schemaRef.replace(/^\\/+/, '');\n  if (trimmed.length === 0) return undefined;\n  const normalized = path.normalize(trimmed);\n  if (normalized.startsWith('..') || path.isAbsolute(normalized)) return undefined;\n  return normalized;\n}\n\n/**\n * Strip `$id` from every subschema of a bundled response file, preserving\n * the root `$id`. Bundled files are fully inlined (no internal `$ref`s),\n * so the nested `$id`s are vestigial metadata — Ajv only cares about the\n * root `$id` for validator lookup. Without this strip, Ajv's\n * `checkAmbiguousRef` throws when an inlined nested `$id` matches one\n * already registered standalone via `ensureCoreLoaded`.\n *\n * Returns a deep-copied tree; the input is not mutated.\n */\nfunction stripNestedIds(schema: LoadedSchema): LoadedSchema {\n  const root = JSON.parse(JSON.stringify(schema)) as LoadedSchema;\n  const rootId = typeof root.$id === 'string' ? root.$id : undefined;\n  const walk = (node: unknown): void => {\n    if (Array.isArray(node)) {\n      for (const item of node) walk(item);\n      return;\n    }\n    if (!node || typeof node !== 'object') return;\n    const obj = node as Record<string, unknown>;\n    if (typeof obj.$id === 'string' && obj.$id !== rootId) {\n      delete obj.$id;\n    }\n    for (const value of Object.values(obj)) walk(value);\n  };\n  walk(root);\n  return root;\n}\n\n/** List of (toolName, direction) pairs that have schemas. Used by tests. */\nexport function listValidatorKeys(version: string = ADCP_VERSION): string[] {\n  const s = ensureInit(version);\n  return [...s.fileIndex.keys()].sort();\n}\n\n/**\n * `$id`s of every schema currently registered with the AdCP validator's AJV\n * instance for `version`. Used by the schema-validator to extract the\n * rejecting sub-schema's `$id` from an Ajv error's `schemaPath`: when a\n * `$ref` is followed, Ajv prefixes the schemaPath with the target schema's\n * `$id`, so the longest registered `$id` that prefixes a schemaPath is the\n * sub-schema responsible for the failure.\n *\n * The set grows as `getValidator` calls trigger `ensureCoreLoaded` and\n * compile new tool roots — callers should read it AFTER the validate call\n * they're projecting errors from.\n */\nexport function getRegisteredSchemaIds(version: string = ADCP_VERSION): readonly string[] {\n  const s = ensureInit(version);\n  // Ajv 8 keeps registered schemas at `ajv.schemas` (URI → SchemaEnv). Returning\n  // the keys is enough for prefix matching; we don't expose the SchemaEnv values.\n  const registry = (s.ajv as unknown as { schemas?: Record<string, unknown> }).schemas;\n  return registry ? Object.keys(registry) : [];\n}\n\n/** Suffix used in the suffix table — exported for testing. */\nexport { SCHEMA_FILENAME_SUFFIX };\n\n/**\n * Returns true when the schema bundle for `version` is reachable from the\n * dist build or the source-tree fallback. Cheap synchronous check; safe\n * to call at construction time of clients/servers to fail fast on a pin\n * we don't have schemas for.\n */\nexport function hasSchemaBundle(version: string): boolean {\n  try {\n    resolveSchemaRoot(version);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Test hook: reset cached state. With no argument, clears every version's\n * loader state; with a version, clears only the bundle that version\n * resolves to (so passing `'3.0.0'` and `'3.0.1'` both clear the `'3.0'`\n * bundle).\n */\nexport function _resetValidationLoader(version?: string): void {\n  if (version === undefined) {\n    states.clear();\n  } else {\n    clearStatesForBundle(resolveBundleKey(version));\n  }\n}\n\n/**\n * Returns true when `field` is **explicitly declared** as a top-level property\n * in the request schema for `toolName`, or when no schema is available\n * (fail-open). Used by the storyboard runner to decide whether to inject\n * envelope fields that aren't universally present across tools (e.g. `brand`,\n * `account`, `ext`).\n *\n * Reads the raw JSON schema file without compiling — avoids coupling to AJV\n * internals. Only inspects the top-level `properties` map; nested sub-schemas\n * are not traversed. Results are memoized in `LoaderState.rawSchemas` so\n * multi-step storyboard runs don't re-read the same file on each step.\n *\n * **Semantic note**: AdCP 3.1.0-beta.3 set `additionalProperties: true` on\n * mutating request schemas (vendor-extension friendly). Before that flip, the\n * helper used `additionalProperties: false` as the gate — \"if the schema is\n * strict, only `properties` keys are allowed.\" Now requests are universally\n * permissive at the schema level, so that gate would say `true` for any field\n * on any request — defeating the storyboard runner's intent (\"only inject\n * envelope fields the tool's schema declares it expects to see\"). The helper\n * now checks `field in properties` directly: the question we actually care\n * about is **\"does the schema declare this field at top level?\"**, not\n * \"does the schema permit this field at top level?\" (it permits everything).\n *\n * Fails open (returns `true`) when:\n * - No schema file is indexed for the tool (custom tool, schema not synced)\n * - The schema root is not reachable (schemas not built/synced yet)\n * - Any I/O / parse error during the read\n *\n * @internal — not part of the public API surface; may change without a major bump.\n */\nexport function schemaAllowsTopLevelField(toolName: string, field: string, version: string = ADCP_VERSION): boolean {\n  try {\n    const s = ensureInit(version);\n    const cacheKey = `${toolName}::request`;\n    const file = s.fileIndex.get(cacheKey);\n    if (!file) return true;\n    let schema = s.rawSchemas.get(cacheKey);\n    if (!schema) {\n      schema = loadJson(file) as Record<string, unknown>;\n      s.rawSchemas.set(cacheKey, schema);\n    }\n    const props = schema.properties as Record<string, unknown> | undefined;\n    return props !== undefined && field in props;\n  } catch {\n    return true;\n  }\n}\n\n/**\n * Resolve a JSON Schema `default` value by walking a dot-separated property\n * path through a schema's nested `properties` maps.\n *\n * This intentionally does not instantiate AJV's `useDefaults` mutation mode.\n * Callers decide when a schema default is semantically meaningful for their\n * runtime object; this helper only reports what the bundled schema declares.\n *\n * Fails closed (`undefined`) when the schema is unavailable, the path is not a\n * concrete properties path, or the target schema node has no `default`.\n *\n * @internal — not part of the public API surface; may change without a major bump.\n */\nexport function getSchemaDefaultByPath(schemaRef: string, dottedPath: string, version: string = ADCP_VERSION): unknown {\n  try {\n    const s = ensureInit(version);\n    const normalized = normalizeSchemaRef(schemaRef);\n    if (!normalized) return undefined;\n\n    const cacheKey = `schema-ref::${normalized}`;\n    const file = path.join(s.root, normalized);\n    if (!existsSync(file)) return undefined;\n\n    let schema = s.rawSchemas.get(cacheKey);\n    if (!schema) {\n      schema = loadJson(file) as Record<string, unknown>;\n      s.rawSchemas.set(cacheKey, schema);\n    }\n\n    const node = resolveSchemaPropertyPath(schema, dottedPath);\n    if (!node || !Object.prototype.hasOwnProperty.call(node, 'default')) return undefined;\n    return cloneJsonValue((node as { default: unknown }).default);\n  } catch {\n    return undefined;\n  }\n}\n\nfunction resolveSchemaPropertyPath(\n  schema: Record<string, unknown>,\n  dottedPath: string\n): Record<string, unknown> | undefined {\n  let current: unknown = schema;\n  for (const key of dottedPath.split('.')) {\n    if (!current || typeof current !== 'object') return undefined;\n    const props = (current as Record<string, unknown>).properties;\n    if (!props || typeof props !== 'object') return undefined;\n    if (!Object.prototype.hasOwnProperty.call(props, key)) return undefined;\n    current = (props as Record<string, unknown>)[key];\n  }\n  return current && typeof current === 'object' ? (current as Record<string, unknown>) : undefined;\n}\n\nfunction cloneJsonValue(value: unknown): unknown {\n  if (value === null || typeof value !== 'object') return value;\n  return JSON.parse(JSON.stringify(value)) as unknown;\n}\n"],"mappings":";;;;;;AAeA,OAAO,SAAoC;AAC3C,OAAO,gBAAgB;AACvB,SAAS,yBAAyB;AAClC,SAAS,aAAa,cAAc,kBAAkB;AACtD,OAAO,UAAU;AACjB,SAAS,oBAAoB;AAC7B,SAAS,0BAA0B;AAUnC,MAAM,yBAAoD;AAAA,EACxD,SAAS;AAAA,EACT,MAAM;AAAA,EACN,WAAW;AAAA,EACX,SAAS;AAAA,EACT,kBAAkB;AACpB;AA+BO,SAAS,iBAAiB,SAAyB;AAExD,QAAM,YAAY,QAAQ,MAAM,gBAAgB;AAChD,MAAI,UAAW,QAAO,GAAG,UAAU,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC;AAKrD,QAAM,sBAAsB,QAAQ,MAAM,kDAAkD;AAC5F,MAAI,oBAAqB,QAAO;AAOhC,QAAM,SAAS,QAAQ,MAAM,gEAAgE;AAC7F,MAAI,QAAQ;AACV,UAAM,CAAC,EAAE,OAAO,OAAO,EAAE,UAAU,IAAI;AACvC,QAAI,eAAe,OAAW,QAAO;AACrC,WAAO,GAAG,KAAK,IAAI,KAAK;AAAA,EAC1B;AAGA,QAAM,cAAc,QAAQ,MAAM,gBAAgB;AAClD,MAAI,YAAa,QAAO;AACxB,QAAM,IAAI;AAAA,IACR,gBAAgB,KAAK,UAAU,OAAO,CAAC;AAAA,IAGvC;AAAA,EACF;AACF;AAiDA,MAAM,4BAA4B;AAsB3B,SAAS,wBAAwB,OAAyC;AAC/E,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI;AAAA,MACR,sCAAsC,OAAO,KAAK;AAAA,MAElD;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,gBAAgB,KAAK,UAAU,KAAK,CAAC,4CAA4C,yBAAyB;AAAA,MAG1G;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,uBAAuB,oBAAoC;AAEzE,QAAM,mBAAmB,mBAAmB,MAAM,qDAAqD;AACvG,MAAI,kBAAkB;AACpB,UAAM,CAAC,EAAE,OAAO,OAAO,aAAa,EAAE,IAAI;AAC1C,WAAO,GAAG,KAAK,IAAI,KAAK,GAAG,UAAU;AAAA,EACvC;AAEA,QAAM,aAAa,mBAAmB,MAAM,0DAA0D;AACtG,MAAI,YAAY;AACd,UAAM,CAAC,EAAE,OAAO,OAAO,aAAa,EAAE,IAAI;AAC1C,WAAO,GAAG,KAAK,IAAI,KAAK,GAAG,UAAU;AAAA,EACvC;AAIA,MAAI,iBAAiB,KAAK,kBAAkB,EAAG,QAAO;AACtD,QAAM,IAAI;AAAA,IACR,oBAAoB,KAAK,UAAU,kBAAkB,CAAC;AAAA,IAEtD;AAAA,EACF;AACF;AAsBA,SAAS,kBAAkB,SAAyB;AAClD,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,aAAa,0BAA0B,SAAS,GAAG,IAAI,GAAG;AAChE,MAAI,cAAc,WAAW,UAAU,EAAG,QAAO;AAEjD,QAAM,eAAe,oBAAoB,IAAI,GAAG;AAChD,MAAI,gBAAgB,WAAW,YAAY,EAAG,QAAO;AAErD,QAAM,gBAAgB,KAAK,KAAK,WAAW,MAAM,gBAAgB,GAAG;AACpE,MAAI,WAAW,aAAa,EAAG,QAAO;AAKtC,QAAM,wBAAwB,aAAa,KAAK,GAAG;AACnD,MAAI,uBAAuB;AACzB,UAAM,0BAA0B,qBAAqB,KAAK,KAAK,WAAW,MAAM,cAAc,GAAG,GAAG;AACpG,QAAI,wBAAyB,QAAO;AAAA,EACtC;AAKA,QAAM,YAAY,KAAK,KAAK,WAAW,MAAM,MAAM,MAAM,WAAW,OAAO;AAC3E,QAAM,iBAAiB,KAAK,KAAK,WAAW,OAAO;AACnD,MAAI,WAAW,cAAc,EAAG,QAAO;AAOvC,QAAM,aAAa,IAAI,MAAM,gBAAgB;AAC7C,MAAI,cAAc,WAAW,SAAS,GAAG;AACvC,UAAM,CAAC,EAAE,OAAO,KAAK,IAAI;AACzB,UAAM,SAAS,GAAG,KAAK,IAAI,KAAK;AAChC,UAAM,SAAS,YAAY,WAAW,EAAE,eAAe,KAAK,CAAC,EAC1D;AAAA,MACC,OACE,EAAE,YAAY,KACd,EAAE,KAAK,WAAW,MAAM,KACxB,CAAC,EAAE,KAAK,SAAS,WAAW,KAC5B,kBAAkB,KAAK,EAAE,IAAI;AAAA,IACjC,EACC,IAAI,QAAM;AAAA,MACT,MAAM,EAAE;AAAA,MACR,OAAO,SAAS,EAAE,KAAK,MAAM,OAAO,MAAM,GAAG,EAAE;AAAA,IACjD,EAAE,EACD,OAAO,OAAK,OAAO,SAAS,EAAE,KAAK,CAAC,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACnC,QAAI,OAAO,SAAS,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO,CAAC,EAAG,IAAI;AAAA,EACpE;AASA,MAAI,uBAAuB;AACzB,UAAM,2BAA2B,qBAAqB,WAAW,GAAG;AACpE,QAAI,yBAA0B,QAAO;AAAA,EACvC;AAEA,QAAM,IAAI;AAAA,IACR,iCAAiC,OAAO,uCACZ,GAAG,QAAQ,aAAa,gBAAgB,cAAc,sCAC5C,SAAS;AAAA,EAEjD;AACF;AAEA,SAAS,qBAAqB,MAAc,KAAiC;AAC3E,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,EACrD,OAAO,OAAK,EAAE,YAAY,KAAK,CAAC,EAAE,KAAK,SAAS,WAAW,CAAC,EAC5D,IAAI,OAAK;AACR,QAAI;AACF,aAAO,EAAE,MAAM,EAAE,MAAM,IAAI,uBAAuB,EAAE,IAAI,EAAE;AAAA,IAC5D,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,CAAC,EACA,OAAO,CAAC,MAAyC,MAAM,IAAI,EAC3D,OAAO,OAAK,EAAE,OAAO,OAAO,EAAE,GAAG,WAAW,GAAG,GAAG,GAAG,CAAC,EACtD,KAAK,CAAC,GAAG,MAAM,uBAAuB,EAAE,MAAM,EAAE,IAAI,CAAC;AACxD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO,KAAK,KAAK,MAAM,OAAO,CAAC,EAAG,IAAI;AACxC;AAEA,SAAS,uBAAuB,GAAW,GAAmB;AAC5D,SAAO,EAAE,cAAc,GAAG,QAAW,EAAE,SAAS,MAAM,aAAa,OAAO,CAAC;AAC7E;AAYA,MAAM,SAAmC,oBAAI,IAAI;AACjD,MAAM,sBAA2C,oBAAI,IAAI;AACzD,MAAM,4BAA4B,IAAI,kBAAuC;AAE7E,SAAS,cAAc,WAAmB,MAAsB;AAC9D,SAAO,GAAG,SAAS,KAAK,IAAI;AAC9B;AAEA,SAAS,qBAAqB,WAAyB;AACrD,aAAW,CAAC,UAAU,KAAK,KAAK,QAAQ;AACtC,QAAI,MAAM,YAAY,UAAW,QAAO,OAAO,QAAQ;AAAA,EACzD;AACF;AAEA,SAAS,mBAAmB,MAAuB;AACjD,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,cAAc,KAAK,KAAK,MAAM,SAAS;AAC7C,QAAM,QAAQ,WAAW,WAAW,IAAI,cAAc,WAAW,IAAI,cAAc,IAAI;AACvF,SAAO,MAAM,KAAK,UAAQ;AACxB,QAAI;AACF,YAAM,SAAS,SAAS,IAAI;AAC5B,aAAO,OAAO,OAAO,QAAQ,YAAY,OAAO,OAAO,YAAY;AAAA,IACrE,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;AAEA,SAAS,oBAAoB,UAAsC;AACjE,SAAO,SAAS,MAAM,sBAAsB,IAAI,CAAC;AACnD;AAEA,SAAS,gCAAgC,MAA2B;AAClE,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,cAAc,IAAI,GAAG;AACtC,QAAI;AACJ,QAAI;AACF,eAAS,SAAS,IAAI;AAAA,IACxB,QAAQ;AACN;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,SAAU;AACpC,UAAM,OAAO,oBAAoB,OAAO,GAAG;AAC3C,QAAI,CAAC,KAAM;AACX,eAAW,SAAS,yBAAyB,IAAI,EAAG,SAAQ,IAAI,KAAK;AAAA,EACvE;AACA,SAAO;AACT;AAEA,SAAS,yBAAyB,SAA8B;AAC9D,QAAM,UAAU,oBAAI,IAAY,CAAC,OAAO,CAAC;AACzC,MAAI;AACF,YAAQ,IAAI,iBAAiB,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AACA,MAAI;AACF,UAAM,mBAAmB,uBAAuB,OAAO;AACvD,YAAQ,IAAI,gBAAgB;AAC5B,UAAM,SAAS,sBAAsB,gBAAgB;AACrD,QAAI,OAAQ,SAAQ,IAAI,MAAM;AAAA,EAChC,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,yBAAqD;AAClF,SAAO,wBAAwB,MAAM,iCAAiC,IAAI,CAAC;AAC7E;AAEA,SAAS,oCAAoC,MAA6D;AACxG,QAAM,SAAwD,CAAC;AAC/D,aAAW,QAAQ,cAAc,IAAI,GAAG;AACtC,QAAI;AACJ,QAAI;AACF,eAAS,SAAS,IAAI;AAAA,IACxB,QAAQ;AACN;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,SAAU;AACpC,UAAM,OAAO,oBAAoB,OAAO,GAAG;AAC3C,QAAI,CAAC,KAAM;AACX,WAAO,KAAK,EAAE,MAAM,SAAS,yBAAyB,IAAI,EAAE,CAAC;AAAA,EAC/D;AACA,SAAO;AACT;AAEA,SAAS,+BAA+B,SAAiB,MAA2B;AAClF,QAAM,kBAAkB,yBAAyB,OAAO;AACxD,QAAM,aAAa,oCAAoC,IAAI;AAC3D,QAAM,cAAc,gCAAgC,IAAI;AACxD,MACE,WAAW,SAAS,KACpB,WAAW,MAAM,WAAS,CAAC,GAAG,MAAM,OAAO,EAAE,KAAK,WAAS,gBAAgB,IAAI,KAAK,CAAC,CAAC,GACtF;AACA,WAAO,oBAAI,IAAI,CAAC,GAAG,iBAAiB,GAAG,WAAW,CAAC;AAAA,EACrD;AACA,QAAM,QACJ,WAAW,WAAW,IAClB,uBACA,WACG,IAAI,WAAS,GAAG,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,OAAO,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,EAC7E,KAAK,EACL,KAAK,IAAI;AAClB,QAAM,IAAI;AAAA,IACR,0CAA0C,OAAO,QAAQ,IAAI,mFAClB,MAAM,KAAK,eAAe,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,WAAW,KAAK;AAAA,EAC1G;AACF;AAEA,MAAM,4BAAsD,oBAAI,IAAI;AAU7D,SAAS,2BAA2B,SAAiB,MAAoB;AAC9E,QAAM,MAAM,iBAAiB,OAAO;AACpC,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,UAAM,IAAI,MAAM,0CAA0C,OAAO,2BAA2B,IAAI,EAAE;AAAA,EACpG;AACA,QAAM,UAAU,+BAA+B,SAAS,IAAI;AAC5D,4BAA0B,IAAI,KAAK,OAAO;AAC1C,aAAW,SAAS,SAAS;AAC3B,UAAM,WAAW,oBAAoB,IAAI,KAAK;AAC9C,wBAAoB,IAAI,OAAO,IAAI;AACnC,QAAI,aAAa,KAAM,sBAAqB,KAAK;AAAA,EACnD;AACF;AAGO,SAAS,6BAA6B,SAAuB;AAClE,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,UAAU,IAAI,IAAI,yBAAyB,OAAO,CAAC;AACzD,aAAW,CAAC,eAAe,iBAAiB,KAAK,2BAA2B;AAC1E,QACE,kBAAkB,OAClB,kBAAkB,IAAI,GAAG,KACzB,CAAC,GAAG,OAAO,EAAE,KAAK,WAAS,kBAAkB,IAAI,KAAK,CAAC,GACvD;AACA,iBAAW,SAAS,kBAAmB,SAAQ,IAAI,KAAK;AACxD,gCAA0B,OAAO,aAAa;AAAA,IAChD;AAAA,EACF;AACA,aAAW,SAAS,SAAS;AAC3B,wBAAoB,OAAO,KAAK;AAChC,yBAAqB,KAAK;AAAA,EAC5B;AACF;AAOO,SAAS,uBAA0B,SAAiB,MAA0B,IAAgB;AACnG,MAAI,SAAS,OAAW,QAAO,GAAG;AAClC,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,UAAM,IAAI,MAAM,0CAA0C,OAAO,2BAA2B,IAAI,EAAE;AAAA,EACpG;AACA,QAAM,UAAU,+BAA+B,SAAS,IAAI;AAC5D,QAAM,SAAS,0BAA0B,SAAS;AAClD,QAAM,OAAO,IAAI,IAAI,MAAM;AAC3B,aAAW,SAAS,SAAS;AAC3B,SAAK,IAAI,OAAO,IAAI;AACpB,yBAAqB,KAAK;AAAA,EAC5B;AACA,SAAO,0BAA0B,IAAI,MAAM,EAAE;AAC/C;AAEA,SAAS,cAAc,KAAuB;AAC5C,MAAI,CAAC,WAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,QAAM,MAAgB,CAAC;AACvB,aAAW,SAAS,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC,GAAG;AAC7D,UAAM,OAAO,KAAK,KAAK,KAAK,MAAM,IAAI;AACtC,QAAI,MAAM,YAAY,EAAG,KAAI,KAAK,GAAG,cAAc,IAAI,CAAC;AAAA,aAC/C,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,OAAO,EAAG,KAAI,KAAK,IAAI;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAA4B;AAC5C,SAAO,KAAK,MAAM,aAAa,MAAM,OAAO,CAAC;AAC/C;AAkBA,SAAS,kBAAkB,QAAoC;AAC7D,QAAM,QAAQ,EAAE,GAAG,OAAO;AAC1B,MAAI,MAAM,yBAAyB,OAAO;AACxC,UAAM,uBAAuB;AAAA,EAC/B;AACA,aAAW,OAAO,CAAC,SAAS,SAAS,OAAO,GAAY;AACtD,UAAM,WAAW,MAAM,GAAG;AAC1B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,YAAM,GAAG,IAAI,SAAS,IAAI,YAAU;AAClC,YAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO;AAClD,cAAM,cAAc,EAAE,GAAI,OAAmC;AAC7D,YAAI,YAAY,yBAAyB,OAAO;AAC9C,sBAAY,uBAAuB;AAAA,QACrC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,KAAuB;AAClD,QAAM,YAAY;AAIlB,SAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,UAAU,WAAW,CAAC,CAAC,GAAG,GAAG,OAAO,KAAK,UAAU,QAAQ,CAAC,CAAC,CAAC,CAAC;AAChG;AAMA,SAAS,eAAe,MAAmC;AACzD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,SAAS,CAAC,UAAkB,WAAsB,SAAuB;AAC7E,UAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,IAAI,IAAI;AAAA,EAC7C;AAGA,QAAM,cAAc,KAAK,KAAK,MAAM,SAAS;AAC7C,aAAW,QAAQ,cAAc,WAAW,GAAG;AAC7C,UAAM,OAAO,KAAK,SAAS,MAAM,OAAO;AACxC,QAAI,KAAK,SAAS,UAAU,GAAG;AAC7B,YAAM,OAAO,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,EAAE,QAAQ,MAAM,GAAG;AAChE,aAAO,MAAM,WAAW,IAAI;AAAA,IAC9B,WAAW,KAAK,SAAS,WAAW,GAAG;AACrC,YAAM,OAAO,KAAK,MAAM,GAAG,CAAC,YAAY,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjE,aAAO,MAAM,QAAQ,IAAI;AAAA,IAC3B;AAAA,EACF;AAkBA,aAAW,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAC9D,QAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,QAAI,MAAM,SAAS,aAAa,MAAM,SAAS,OAAQ;AACvD,UAAM,YAAY,KAAK,KAAK,MAAM,MAAM,IAAI;AAC5C,eAAW,QAAQ,cAAc,SAAS,GAAG;AAC3C,YAAM,OAAO,KAAK,SAAS,MAAM,OAAO;AACxC,UAAI,KAAK,SAAS,2BAA2B,GAAG;AAC9C,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,4BAA4B,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjF,eAAO,MAAM,aAAa,IAAI;AAAA,MAChC,WAAW,KAAK,SAAS,yBAAyB,GAAG;AACnD,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,0BAA0B,MAAM,EAAE,QAAQ,MAAM,GAAG;AAC/E,eAAO,MAAM,WAAW,IAAI;AAAA,MAC9B,WAAW,KAAK,SAAS,gCAAgC,GAAG;AAC1D,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,iCAAiC,MAAM,EAAE,QAAQ,MAAM,GAAG;AACtF,eAAO,MAAM,kBAAkB,IAAI;AAAA,MACrC,WAAW,KAAK,SAAS,UAAU,GAAG;AACpC,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,EAAE,QAAQ,MAAM,GAAG;AAChE,YAAI,CAAC,MAAM,IAAI,GAAG,IAAI,WAAW,EAAG,QAAO,MAAM,WAAW,IAAI;AAAA,MAClE,WAAW,KAAK,SAAS,WAAW,GAAG;AACrC,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,YAAY,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjE,YAAI,CAAC,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAG,QAAO,MAAM,QAAQ,IAAI;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,WAAW,SAA8B;AAKhD,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,OAAO,kBAAkB,OAAO;AACtC,QAAM,WAAW,cAAc,KAAK,IAAI;AACxC,QAAM,SAAS,OAAO,IAAI,QAAQ;AAClC,MAAI,OAAQ,QAAO;AACnB,QAAM,MAAM,IAAI,IAAI;AAAA,IAClB,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,CAAC;AACD,aAAW,GAAG;AAEd,QAAM,QAAqB;AAAA,IACzB;AAAA,IACA,WAAW,eAAe,IAAI;AAAA,IAC9B,YAAY,oBAAI,IAAI;AAAA,IACpB,YAAY,oBAAI,IAAI;AAAA,IACpB;AAAA,IACA,YAAY;AAAA,IACZ,SAAS;AAAA,EACX;AACA,SAAO,IAAI,UAAU,KAAK;AAC1B,SAAO;AACT;AAuBA,SAAS,iBAAiB,GAAsB;AAC9C,MAAI,EAAE,WAAY;AAelB,QAAM,oBAAoB,oBAAI,IAAuB;AACrD,aAAW,CAAC,KAAK,IAAI,KAAK,EAAE,WAAW;AACrC,QAAI,IAAI,SAAS,WAAW,EAAG;AAC/B,UAAM,YAAY,IAAI,MAAM,IAAI,QAAQ,IAAI,IAAI,CAAC;AACjD,sBAAkB,IAAI,MAAM,SAAS;AAAA,EACvC;AACA,QAAM,gBAAgB,oBAAoB,EAAE,GAAG;AAC/C,aAAW,SAAS,YAAY,EAAE,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAChE,QAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,QAAI,MAAM,SAAS,UAAW;AAC9B,UAAM,MAAM,KAAK,KAAK,EAAE,MAAM,MAAM,IAAI;AACxC,eAAW,QAAQ,cAAc,GAAG,GAAG;AACrC,YAAM,oBAAoB,kBAAkB,IAAI,IAAI;AACpD,YAAM,SAAS,SAAS,IAAI;AAC5B,YAAM,mBAAmB,sBAAsB,SAAY,SAAS,kBAAkB,MAAM;AAC5F,UAAI,OAAO,iBAAiB,QAAQ,YAAY,CAAC,cAAc,IAAI,iBAAiB,GAAG,GAAG;AACxF,UAAE,IAAI,UAAU,gBAAgB;AAChC,sBAAc,IAAI,iBAAiB,GAAG;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AACA,IAAE,aAAa;AACjB;AAYO,SAAS,aACd,UACA,WACA,UAAkB,cACY;AAC9B,QAAM,IAAI,WAAW,OAAO;AAC5B,QAAM,WAAW,GAAG,QAAQ,KAAK,SAAS;AAC1C,QAAM,SAAS,EAAE,WAAW,IAAI,QAAQ;AACxC,MAAI,OAAQ,QAAO;AAEnB,QAAM,OAAO,EAAE,UAAU,IAAI,QAAQ;AACrC,MAAI,CAAC,KAAM,QAAO;AAMlB,QAAM,cAAc,KAAK,SAAS,GAAG,KAAK,GAAG,UAAU,KAAK,GAAG,EAAE;AACjE,MAAI,cAAc,aAAa,CAAC,YAAa,kBAAiB,CAAC;AAE/D,QAAM,YAAY,SAAS,IAAI;AAc/B,QAAM,WAAW,cAAc,eAAe,SAAS,IAAI;AAC3D,QAAM,SAAS,cAAc,YAAY,WAAW,kBAAkB,QAAQ;AAC9E,QAAM,WAAW,OAAO,OAAO,QAAQ,WAAW,EAAE,IAAI,UAAU,OAAO,GAAG,IAAI;AAChF,QAAM,WAAW,YAAY,EAAE,IAAI,QAAQ,MAAM;AACjD,IAAE,WAAW,IAAI,UAAU,QAAQ;AACnC,SAAO;AACT;AAOO,SAAS,wBACd,WACA,UAAkB,cACY;AAC9B,QAAM,IAAI,WAAW,OAAO;AAC5B,QAAM,aAAa,mBAAmB,SAAS;AAC/C,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,WAAW,eAAe,UAAU;AAC1C,QAAM,SAAS,EAAE,WAAW,IAAI,QAAQ;AACxC,MAAI,OAAQ,QAAO;AAEnB,QAAM,OAAO,KAAK,KAAK,EAAE,MAAM,UAAU;AACzC,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAM9B,QAAM,MAAM,IAAI,IAAI;AAAA,IAClB,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,CAAC;AACD,aAAW,GAAG;AACd,QAAM,oBAAoC,CAAC;AAC3C,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,cAAc,cAAc,EAAE,IAAI,GAAG;AAC9C,QAAI,WAAW,SAAS,GAAG,KAAK,GAAG,UAAU,KAAK,GAAG,EAAE,EAAG;AAC1D,QAAI,eAAe,KAAM;AACzB,UAAM,SAAS,SAAS,UAAU;AAClC,QAAI,OAAO,OAAO,QAAQ,YAAY,CAAC,cAAc,IAAI,OAAO,GAAG,GAAG;AACpE,oBAAc,IAAI,OAAO,GAAG;AAC5B,wBAAkB,KAAK,MAAM;AAAA,IAC/B;AAAA,EACF;AACA,MAAI,kBAAkB,SAAS,GAAG;AAChC,QAAI,UAAU,iBAAiB;AAAA,EACjC;AACA,QAAM,YAAY,SAAS,IAAI;AAC/B,QAAM,WAAW,IAAI,QAAQ,SAAS;AACtC,IAAE,WAAW,IAAI,UAAU,QAAQ;AACnC,SAAO;AACT;AAEA,SAAS,mBAAmB,WAAuC;AACjE,QAAM,UAAU,UAAU,QAAQ,QAAQ,EAAE;AAC5C,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,aAAa,KAAK,UAAU,OAAO;AACzC,MAAI,WAAW,WAAW,IAAI,KAAK,KAAK,WAAW,UAAU,EAAG,QAAO;AACvE,SAAO;AACT;AAYA,SAAS,eAAe,QAAoC;AAC1D,QAAM,OAAO,KAAK,MAAM,KAAK,UAAU,MAAM,CAAC;AAC9C,QAAM,SAAS,OAAO,KAAK,QAAQ,WAAW,KAAK,MAAM;AACzD,QAAM,OAAO,CAAC,SAAwB;AACpC,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,iBAAW,QAAQ,KAAM,MAAK,IAAI;AAClC;AAAA,IACF;AACA,QAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AACvC,UAAM,MAAM;AACZ,QAAI,OAAO,IAAI,QAAQ,YAAY,IAAI,QAAQ,QAAQ;AACrD,aAAO,IAAI;AAAA,IACb;AACA,eAAW,SAAS,OAAO,OAAO,GAAG,EAAG,MAAK,KAAK;AAAA,EACpD;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAGO,SAAS,kBAAkB,UAAkB,cAAwB;AAC1E,QAAM,IAAI,WAAW,OAAO;AAC5B,SAAO,CAAC,GAAG,EAAE,UAAU,KAAK,CAAC,EAAE,KAAK;AACtC;AAcO,SAAS,uBAAuB,UAAkB,cAAiC;AACxF,QAAM,IAAI,WAAW,OAAO;AAG5B,QAAM,WAAY,EAAE,IAAyD;AAC7E,SAAO,WAAW,OAAO,KAAK,QAAQ,IAAI,CAAC;AAC7C;AAWO,SAAS,gBAAgB,SAA0B;AACxD,MAAI;AACF,sBAAkB,OAAO;AACzB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQO,SAAS,uBAAuB,SAAwB;AAC7D,MAAI,YAAY,QAAW;AACzB,WAAO,MAAM;AAAA,EACf,OAAO;AACL,yBAAqB,iBAAiB,OAAO,CAAC;AAAA,EAChD;AACF;AAgCO,SAAS,0BAA0B,UAAkB,OAAe,UAAkB,cAAuB;AAClH,MAAI;AACF,UAAM,IAAI,WAAW,OAAO;AAC5B,UAAM,WAAW,GAAG,QAAQ;AAC5B,UAAM,OAAO,EAAE,UAAU,IAAI,QAAQ;AACrC,QAAI,CAAC,KAAM,QAAO;AAClB,QAAI,SAAS,EAAE,WAAW,IAAI,QAAQ;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,SAAS,IAAI;AACtB,QAAE,WAAW,IAAI,UAAU,MAAM;AAAA,IACnC;AACA,UAAM,QAAQ,OAAO;AACrB,WAAO,UAAU,UAAa,SAAS;AAAA,EACzC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAeO,SAAS,uBAAuB,WAAmB,YAAoB,UAAkB,cAAuB;AACrH,MAAI;AACF,UAAM,IAAI,WAAW,OAAO;AAC5B,UAAM,aAAa,mBAAmB,SAAS;AAC/C,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,WAAW,eAAe,UAAU;AAC1C,UAAM,OAAO,KAAK,KAAK,EAAE,MAAM,UAAU;AACzC,QAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAE9B,QAAI,SAAS,EAAE,WAAW,IAAI,QAAQ;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,SAAS,IAAI;AACtB,QAAE,WAAW,IAAI,UAAU,MAAM;AAAA,IACnC;AAEA,UAAM,OAAO,0BAA0B,QAAQ,UAAU;AACzD,QAAI,CAAC,QAAQ,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,SAAS,EAAG,QAAO;AAC5E,WAAO,eAAgB,KAA8B,OAAO;AAAA,EAC9D,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,0BACP,QACA,YACqC;AACrC,MAAI,UAAmB;AACvB,aAAW,OAAO,WAAW,MAAM,GAAG,GAAG;AACvC,QAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AACpD,UAAM,QAAS,QAAoC;AACnD,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,OAAO,GAAG,EAAG,QAAO;AAC9D,cAAW,MAAkC,GAAG;AAAA,EAClD;AACA,SAAO,WAAW,OAAO,YAAY,WAAY,UAAsC;AACzF;AAEA,SAAS,eAAe,OAAyB;AAC/C,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,SAAO,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AACzC;","names":[]}
+{"version":3,"sources":["../../../src/lib/validation/schema-loader.ts"],"sourcesContent":["import { fileURLToPath as __adcpFileURLToPath } from 'node:url';\nimport { dirname as __adcpDirname } from 'node:path';\nimport { createRequire as __adcpCreateRequire } from 'node:module';\nconst __dirname = __adcpDirname(__adcpFileURLToPath(import.meta.url));\nconst require = __adcpCreateRequire(import.meta.url);\n/**\n * JSON Schema loader for AdCP tool request/response validation.\n *\n * Loads the bundled per-tool schemas shipped with the SDK plus the\n * `core/` schemas that async response variants `$ref`, then compiles\n * AJV validators lazily by `(toolName, direction)`.\n *\n * Stage 3: state is per-AdCP-version. The same SDK instance can hold\n * compiled validators for `3.0.0`, `3.0.1`, `3.1.0-beta.1`, etc. side by\n * side; callers pass the version they're validating against. Default is\n * the SDK-pinned `ADCP_VERSION` so callers that don't care about\n * cross-version selection (most internal call sites) keep working\n * unchanged.\n */\n\nimport Ajv, { type ValidateFunction } from 'ajv';\nimport addFormats from 'ajv-formats';\nimport { AsyncLocalStorage } from 'async_hooks';\nimport { readdirSync, readFileSync, existsSync } from 'fs';\nimport path from 'path';\nimport { ADCP_VERSION } from '../version';\nimport { ConfigurationError } from '../errors';\n\nexport type ResponseVariant = 'sync' | 'submitted' | 'working' | 'input-required';\nexport type Direction = 'request' | ResponseVariant;\n\ninterface LoadedSchema {\n  $id?: string;\n  [k: string]: unknown;\n}\n\nconst SCHEMA_FILENAME_SUFFIX: Record<Direction, string> = {\n  request: 'request',\n  sync: 'response',\n  submitted: 'async-response-submitted',\n  working: 'async-response-working',\n  'input-required': 'async-response-input-required',\n};\n\n/**\n * Map a consumer-provided version pin to the loader's bundle key.\n *\n *   - Stable semver `'3.0.0'` / `'3.0.1'` → `'3.0'` (latest patch in minor)\n *   - Bare minor `'3.0'` → `'3.0'` (already the bundle key)\n *   - Release-precision prerelease `'3.1-beta'` / `'3.1-beta.0'` →\n *     returned verbatim. {@link resolveSchemaRoot} fuzzy-resolves to the\n *     highest cached prerelease directory whose own release-precision form\n *     matches (e.g. `'3.1-beta'` matches `schemas/cache/3.1.0-beta.0/`).\n *     Accepted because sellers advertise `supported_versions` in this\n *     shape (`[\"3.1-beta\"]`), and a buyer reading that off the wire must\n *     be able to pin to it.\n *   - Full prerelease semver `'3.1.0-beta.1'` → `'3.1.0-beta.1'`\n *     (exact-version, intentional pin)\n *   - Legacy alias `'v3'` / `'v2.5'` / `'v2.6'` → returned verbatim (cache\n *     historically keyed these directories by the alias name)\n *\n * Per the AdCP spec convention patches don't change wire shape, so collapsing\n * stable patches into the minor is functionally equivalent for any validator\n * consumer. Prereleases are kept exact because pinning a beta is intentional\n * and bit-fidelity matters for cross-version interop tests.\n *\n * Throws `ConfigurationError` for any input that doesn't match one of the\n * recognized shapes. Strings reach `path.join` via `resolveSchemaRoot`, and\n * pass-through of arbitrary garbage (`'../etc'`, `'3foo'`) lets a non-version\n * directory probe leak through `hasSchemaBundle`'s boolean. The throw is\n * caught by `hasSchemaBundle`'s try/catch (still returns false) and surfaces\n * with a useful field name from `resolveAdcpVersion`.\n */\nexport function resolveBundleKey(version: string): string {\n  // Bare 'MAJOR.MINOR' (no patch).\n  const minorOnly = version.match(/^(\\d+)\\.(\\d+)$/);\n  if (minorOnly) return `${minorOnly[1]}.${minorOnly[2]}`;\n  // Release-precision prerelease 'MAJOR.MINOR-PRE' (no patch). Same SemVer §9\n  // prerelease constraint as the full-semver branch — `'3.1-/../etc'`-style\n  // strings can't slip through. Returns verbatim; resolveSchemaRoot does the\n  // fuzzy directory match.\n  const releasePrecisionPre = version.match(/^(\\d+)\\.(\\d+)-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*$/);\n  if (releasePrecisionPre) return version;\n  // Full 'MAJOR.MINOR.PATCH' with optional prerelease. Prerelease group\n  // restricted to SemVer §9 identifiers (alphanumerics + hyphen,\n  // dot-separated) so `'3.0.0-/../etc'`-style strings can't slip through\n  // and reach `path.join` as a directory component. The full version is\n  // returned verbatim for prereleases, so this is the last line of defense\n  // before that string becomes a path segment.\n  const semver = version.match(/^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*))?$/);\n  if (semver) {\n    const [, major, minor, , prerelease] = semver;\n    if (prerelease !== undefined) return version;\n    return `${major}.${minor}`;\n  }\n  // Legacy alias: 'v' followed by a major and optional minor. Restricted to\n  // this exact shape so non-version garbage can't reach the filesystem.\n  const legacyAlias = version.match(/^v\\d+(\\.\\d+)?$/);\n  if (legacyAlias) return version;\n  throw new ConfigurationError(\n    `AdCP version ${JSON.stringify(version)} is not a recognized version format. ` +\n      `Expected semver (e.g. '3.0.1', '3.1.0-beta.1'), bare minor ('3.0'), ` +\n      `release-precision ('3.1-beta'), or legacy alias ('v3', 'v2.5').`,\n    'adcpVersion'\n  );\n}\n\n/**\n * Collapse a bundle key to the release-precision string the AdCP wire schema\n * accepts for the `adcp_version` envelope field (spec PR\n * `adcontextprotocol/adcp#3493`). The wire pattern is\n * `^\\d+\\.\\d+(-[a-zA-Z0-9.-]+)?$` — release-precision (MAJOR.MINOR with\n * optional prerelease), never full MAJOR.MINOR.PATCH semver.\n *\n *   - Stable bundle key `'3.0'` / `'3.1'` → returned verbatim.\n *   - Prerelease bundle key `'3.1.0-beta.0'` → `'3.1-beta.0'` (PATCH segment\n *     dropped; the prerelease tag is the wire-meaningful release identifier,\n *     PATCH is implementation-internal).\n *   - Full stable semver `'3.0.11'` → `'3.0'` (patches don't change wire\n *     shape; surface them via `build_version` on capabilities instead).\n *   - Legacy alias `'v3'` / `'v2.5'` — returned verbatim. The wire spec\n *     predates the envelope field, so legacy-aliased clients won't emit\n *     `adcp_version` anyway (gated by `bundleSupportsAdcpVersionField`).\n *\n * The normalization rule is declared in `core/version-envelope.json`:\n *\n *   > SDKs that read full-semver values from bundle metadata (e.g.\n *   > ComplianceIndex.published_version = \"3.1.0-beta.1\") MUST normalize to\n *   > release-precision (\"3.1-beta.1\") before emitting on the wire —\n *   > meta-field values are NOT valid wire values.\n *\n * **Idempotent.** Re-applying to an already-wire-shaped value is a no-op:\n * `toReleasePrecisionWire('3.1-beta.0') === '3.1-beta.0'`. Safe to call\n * defensively on values a caller read off the wire and is passing back.\n *\n * **Prerelease regex is stricter than the wire pattern by design.** The wire\n * pattern allows `[a-zA-Z0-9.-]+` (any mix of dots and hyphens), but this\n * function only accepts SemVer §9-shaped prerelease tags\n * (`[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*`) — disallowing leading dots, double\n * dots, or trailing dots. Mirrors the path-traversal hardening on\n * {@link resolveBundleKey} (`'3.0.0-/../etc'`-style strings can't reach the\n * filesystem there, and shouldn't be silently mirrored to the wire here).\n * A future reader who wants to \"fix\" this to match the wire regex\n * character-for-character should NOT — the strictness is intentional.\n *\n * Defense: rejecting unrecognized shapes here surfaces SDK-internal misuse\n * (someone calling this with raw garbage) loudly instead of silently\n * emitting a non-spec wire string.\n */\n/**\n * The exact pattern `core/version-envelope.json` applies to `adcp_version`\n * on the wire. Kept verbatim so {@link validateAdcpVersionWire} doesn't\n * drift from the spec — bump only when the spec itself bumps.\n */\nconst ADCP_VERSION_WIRE_PATTERN = /^\\d+\\.\\d+(-[a-zA-Z0-9.-]+)?$/;\n\n/**\n * Validate a string against the AdCP 3.1 `adcp_version` wire pattern.\n * Throws `ConfigurationError` with a hint that points at\n * {@link toReleasePrecisionWire} when the value would be sent on the wire\n * but doesn't satisfy `core/version-envelope.json`'s pattern.\n *\n * Use this when you're constructing a request envelope by hand (storyboard\n * fixtures, conformance harnesses, custom transports) and want a clear\n * error rather than a downstream AJV pattern-mismatch from the seller —\n * by the time the seller rejects the request, the buyer's stack frame is\n * long gone and `core/version-envelope.json/properties/adcp_version/pattern`\n * is the only clue.\n *\n * The SDK's own `buildVersionEnvelope` calls this as a postcondition after\n * normalizing the bundle key — should never throw in well-formed SDK code,\n * but if a future refactor breaks the normalization the assertion fires\n * with a message that names the helper to call.\n *\n * Returns the value with the type narrowed to `string` via assertion.\n */\nexport function validateAdcpVersionWire(value: unknown): asserts value is string {\n  if (typeof value !== 'string') {\n    throw new ConfigurationError(\n      `adcp_version must be a string. Got ${typeof value}. ` +\n        `Use toReleasePrecisionWire() to convert a bundle key or full-semver pin to a wire-shaped string.`,\n      'adcp_version'\n    );\n  }\n  if (!ADCP_VERSION_WIRE_PATTERN.test(value)) {\n    throw new ConfigurationError(\n      `adcp_version ${JSON.stringify(value)} doesn't match the AdCP 3.1 wire pattern ${ADCP_VERSION_WIRE_PATTERN}. ` +\n        `Full-semver bundle keys (e.g. \"3.1.0-beta.0\") are NOT valid wire values — ` +\n        `call toReleasePrecisionWire() to normalize (e.g. \"3.1.0-beta.0\" → \"3.1-beta.0\").`,\n      'adcp_version'\n    );\n  }\n}\n\nexport function toReleasePrecisionWire(bundleKeyOrVersion: string): string {\n  // Bare release-precision (MAJOR.MINOR or MAJOR.MINOR-PRE) — already wire-shaped.\n  const releasePrecision = bundleKeyOrVersion.match(/^(\\d+)\\.(\\d+)(-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$/);\n  if (releasePrecision) {\n    const [, major, minor, prerelease = ''] = releasePrecision;\n    return `${major}.${minor}${prerelease}`;\n  }\n  // Full semver — collapse PATCH segment. Prerelease (if any) is preserved.\n  const fullSemver = bundleKeyOrVersion.match(/^(\\d+)\\.(\\d+)\\.\\d+(-[0-9A-Za-z-]+(?:\\.[0-9A-Za-z-]+)*)?$/);\n  if (fullSemver) {\n    const [, major, minor, prerelease = ''] = fullSemver;\n    return `${major}.${minor}${prerelease}`;\n  }\n  // Legacy alias passthrough. Callers that reach here with a legacy alias\n  // shouldn't be emitting `adcp_version` (no version-envelope support), but\n  // returning the input verbatim is least-surprise.\n  if (/^v\\d+(\\.\\d+)?$/.test(bundleKeyOrVersion)) return bundleKeyOrVersion;\n  throw new ConfigurationError(\n    `Cannot normalize ${JSON.stringify(bundleKeyOrVersion)} to release-precision wire format. ` +\n      `Expected a bundle key or AdCP version string.`,\n    'adcpVersion'\n  );\n}\n\n/**\n * Resolve the directory that holds the bundled + core schemas for a given\n * AdCP version. Source layout (dev):\n *   schemas/cache/<exact-version>/{bundled,core}\n * Built layout (dist):\n *   dist/lib/schemas-data/<bundle-key>/{bundled,core}\n *\n * Stable releases use minor-name keys (`3.0/`); prereleases use full-version\n * keys (`3.1.0-beta.1/`). See {@link resolveBundleKey}.\n *\n * Falls back to the source-tree cache when dist isn't built (dev workflow\n * before `npm run build:lib`). For stable pins, the cache fallback scans\n * for the highest-patch sibling in the requested minor — `'3.0.0'` resolves\n * to `schemas/cache/3.0.1/` when only `3.0.1` is cached, matching dist's\n * collapse behavior.\n *\n * Throws when no bundle exists. Callers pinning a specific prerelease\n * surface the error; the construction-time fence in `resolveAdcpVersion`\n * catches most cross-major mistakes before this point.\n */\nfunction resolveSchemaRoot(version: string): string {\n  const key = resolveBundleKey(version);\n  const scopedRoot = scopedExternalSchemaRoots.getStore()?.get(key);\n  if (scopedRoot && existsSync(scopedRoot)) return scopedRoot;\n\n  const externalRoot = externalSchemaRoots.get(key);\n  if (externalRoot && existsSync(externalRoot)) return externalRoot;\n\n  const distCandidate = path.join(__dirname, '..', 'schemas-data', key);\n  if (existsSync(distCandidate)) return distCandidate;\n\n  // Published builds carry exact prerelease bundle directories\n  // (`3.1.0-rc.1/`), while callers may pin the release-precision family\n  // alias (`3.1-rc`). Resolve that alias before falling back to source cache.\n  const releasePrecisionMatch = /^\\d+\\.\\d+-/.test(key);\n  if (releasePrecisionMatch) {\n    const distPrereleaseCandidate = findPrereleaseBundle(path.join(__dirname, '..', 'schemas-data'), key);\n    if (distPrereleaseCandidate) return distPrereleaseCandidate;\n  }\n\n  // Source-tree fallback: cache stays exact-version-named, so map the key\n  // back to the highest-patch cache directory in the same minor for stable\n  // pins. Prereleases need an exact match.\n  const cacheRoot = path.join(__dirname, '..', '..', '..', 'schemas', 'cache');\n  const exactCandidate = path.join(cacheRoot, version);\n  if (existsSync(exactCandidate)) return exactCandidate;\n\n  // For minor-only or stable-patch pins, find the highest stable patch in\n  // the cache that matches the resolved minor. Skip `*.previous` snapshots\n  // — `sync-schemas` writes those as transient backups during replaceTree;\n  // a partially-written snapshot whose patch number happens to be highest\n  // would otherwise win the sort.\n  const minorMatch = key.match(/^(\\d+)\\.(\\d+)$/);\n  if (minorMatch && existsSync(cacheRoot)) {\n    const [, major, minor] = minorMatch;\n    const prefix = `${major}.${minor}.`;\n    const cached = readdirSync(cacheRoot, { withFileTypes: true })\n      .filter(\n        e =>\n          e.isDirectory() &&\n          e.name.startsWith(prefix) &&\n          !e.name.endsWith('.previous') &&\n          /^\\d+\\.\\d+\\.\\d+$/.test(e.name)\n      )\n      .map(e => ({\n        name: e.name,\n        patch: parseInt(e.name.slice(prefix.length), 10),\n      }))\n      .filter(c => Number.isFinite(c.patch))\n      .sort((a, b) => b.patch - a.patch);\n    if (cached.length > 0) return path.join(cacheRoot, cached[0]!.name);\n  }\n\n  // For release-precision prerelease pins (`'3.1-beta'`, `'3.1-beta.0'`),\n  // find the highest cached prerelease directory whose own release-precision\n  // form starts with the requested key. A pin of `'3.1-beta'` matches any\n  // directory whose `toReleasePrecisionWire` form is `'3.1-beta'` or\n  // `'3.1-beta.*'`. A pin of `'3.1-beta.0'` matches `'3.1-beta.0'` or\n  // `'3.1-beta.0.*'`. Sort newest-first by directory name with numeric\n  // collation so rc.10 wins over rc.9.\n  if (releasePrecisionMatch) {\n    const cachePrereleaseCandidate = findPrereleaseBundle(cacheRoot, key);\n    if (cachePrereleaseCandidate) return cachePrereleaseCandidate;\n  }\n\n  throw new Error(\n    `AdCP schema data for version \"${version}\" not found. ` +\n      `Looked for bundle key \"${key}\" in ${distCandidate}, exact path ${exactCandidate}, ` +\n      `and the latest-patch fallback in ${cacheRoot}. ` +\n      `Run \\`npm run sync-schemas\\` and \\`npm run build:lib\\` to populate the bundle.`\n  );\n}\n\nfunction findPrereleaseBundle(root: string, key: string): string | undefined {\n  if (!existsSync(root)) return undefined;\n  const cached = readdirSync(root, { withFileTypes: true })\n    .filter(e => e.isDirectory() && !e.name.endsWith('.previous'))\n    .map(e => {\n      try {\n        return { name: e.name, rp: toReleasePrecisionWire(e.name) };\n      } catch {\n        return null;\n      }\n    })\n    .filter((c): c is { name: string; rp: string } => c !== null)\n    .filter(c => c.rp === key || c.rp.startsWith(`${key}.`))\n    .sort((a, b) => compareBundleNamesDesc(a.name, b.name));\n  if (cached.length === 0) return undefined;\n  return path.join(root, cached[0]!.name);\n}\n\nfunction compareBundleNamesDesc(a: string, b: string): number {\n  return b.localeCompare(a, undefined, { numeric: true, sensitivity: 'base' });\n}\n\ninterface LoaderState {\n  ajv: Ajv;\n  fileIndex: Map<string, string>;\n  validators: Map<string, ValidateFunction>;\n  rawSchemas: Map<string, Record<string, unknown>>;\n  root: string;\n  coreLoaded: boolean;\n  version: string;\n}\n\nconst states: Map<string, LoaderState> = new Map();\nconst externalSchemaRoots: Map<string, string> = new Map();\nconst scopedExternalSchemaRoots = new AsyncLocalStorage<Map<string, string>>();\n\nfunction stateCacheKey(bundleKey: string, root: string): string {\n  return `${bundleKey}\\0${root}`;\n}\n\nfunction clearStatesForBundle(bundleKey: string): void {\n  for (const [stateKey, state] of states) {\n    if (state.version === bundleKey) states.delete(stateKey);\n  }\n}\n\nfunction hasSchemaRootShape(root: string): boolean {\n  if (!existsSync(root)) return false;\n  const bundledRoot = path.join(root, 'bundled');\n  const files = existsSync(bundledRoot) ? walkJsonFiles(bundledRoot) : walkJsonFiles(root);\n  return files.some(file => {\n    try {\n      const schema = loadJson(file);\n      return typeof schema.$id === 'string' || typeof schema.$schema === 'string';\n    } catch {\n      return false;\n    }\n  });\n}\n\nfunction schemaIdVersionHint(schemaId: string): string | undefined {\n  return schemaId.match(/\\/schemas\\/([^/]+)\\//)?.[1];\n}\n\nfunction collectSchemaRootVersionAliases(root: string): Set<string> {\n  const aliases = new Set<string>();\n  for (const file of walkJsonFiles(root)) {\n    let schema: LoadedSchema;\n    try {\n      schema = loadJson(file);\n    } catch {\n      continue;\n    }\n    if (typeof schema.$id !== 'string') continue;\n    const hint = schemaIdVersionHint(schema.$id);\n    if (!hint) continue;\n    for (const alias of schemaRootVersionAliases(hint)) aliases.add(alias);\n  }\n  return aliases;\n}\n\nfunction schemaRootVersionAliases(version: string): Set<string> {\n  const aliases = new Set<string>([version]);\n  try {\n    aliases.add(resolveBundleKey(version));\n  } catch {\n    // Keep the raw value only; callers that care will throw separately.\n  }\n  try {\n    const releasePrecision = toReleasePrecisionWire(version);\n    aliases.add(releasePrecision);\n    const family = prereleaseFamilyAlias(releasePrecision);\n    if (family) aliases.add(family);\n  } catch {\n    // Keep any aliases already collected.\n  }\n  return aliases;\n}\n\nfunction prereleaseFamilyAlias(releasePrecisionVersion: string): string | undefined {\n  return releasePrecisionVersion.match(/^(\\d+\\.\\d+-[0-9A-Za-z-]+)\\.\\d+$/)?.[1];\n}\n\nfunction collectSchemaRootVersionAliasGroups(root: string): Array<{ hint: string; aliases: Set<string> }> {\n  const groups: Array<{ hint: string; aliases: Set<string> }> = [];\n  for (const file of walkJsonFiles(root)) {\n    let schema: LoadedSchema;\n    try {\n      schema = loadJson(file);\n    } catch {\n      continue;\n    }\n    if (typeof schema.$id !== 'string') continue;\n    const hint = schemaIdVersionHint(schema.$id);\n    if (!hint) continue;\n    groups.push({ hint, aliases: schemaRootVersionAliases(hint) });\n  }\n  return groups;\n}\n\nfunction assertSchemaRootMatchesVersion(version: string, root: string): Set<string> {\n  const expectedAliases = schemaRootVersionAliases(version);\n  const rootGroups = collectSchemaRootVersionAliasGroups(root);\n  const rootAliases = collectSchemaRootVersionAliases(root);\n  if (\n    rootGroups.length > 0 &&\n    rootGroups.every(group => [...group.aliases].some(alias => expectedAliases.has(alias)))\n  ) {\n    return new Set([...expectedAliases, ...rootAliases]);\n  }\n  const found =\n    rootGroups.length === 0\n      ? 'no AdCP schema ids'\n      : rootGroups\n          .map(group => `${group.hint} (${Array.from(group.aliases).sort().join(', ')})`)\n          .sort()\n          .join(', ');\n  throw new Error(\n    `External AdCP schema root for version \"${version}\" at ${root} does not match the requested version and ` +\n      `must contain only schema ids matching ${Array.from(expectedAliases).sort().join(', ')}; found ${found}.`\n  );\n}\n\nconst externalSchemaRootAliases: Map<string, Set<string>> = new Map();\n\n/**\n * Register a schema bundle supplied outside the installed SDK package.\n *\n * Compliance runners use this when `--compliance-dir` points at another\n * package/check-out whose storyboards and schema bundle should be used\n * together. The root must be the schema-data directory itself, e.g.\n * `.../dist/lib/schemas-data/3.0`.\n */\nexport function registerExternalSchemaRoot(version: string, root: string): void {\n  const key = resolveBundleKey(version);\n  if (!hasSchemaRootShape(root)) {\n    throw new Error(`External AdCP schema root for version \"${version}\" not found or empty at ${root}`);\n  }\n  const aliases = assertSchemaRootMatchesVersion(version, root);\n  externalSchemaRootAliases.set(key, aliases);\n  for (const alias of aliases) {\n    const previous = externalSchemaRoots.get(alias);\n    externalSchemaRoots.set(alias, root);\n    if (previous !== root) clearStatesForBundle(alias);\n  }\n}\n\n/** Test/helper hook for unregistering an external schema bundle. */\nexport function unregisterExternalSchemaRoot(version: string): void {\n  const key = resolveBundleKey(version);\n  const aliases = new Set(schemaRootVersionAliases(version));\n  for (const [registeredKey, registeredAliases] of externalSchemaRootAliases) {\n    if (\n      registeredKey === key ||\n      registeredAliases.has(key) ||\n      [...aliases].some(alias => registeredAliases.has(alias))\n    ) {\n      for (const alias of registeredAliases) aliases.add(alias);\n      externalSchemaRootAliases.delete(registeredKey);\n    }\n  }\n  for (const alias of aliases) {\n    externalSchemaRoots.delete(alias);\n    clearStatesForBundle(alias);\n  }\n}\n\n/**\n * Run a callback with an external schema root scoped to the current async\n * execution chain. Unlike `registerExternalSchemaRoot`, this does not poison\n * process-global validation state for later hosted/compliance runs.\n */\nexport function withExternalSchemaRoot<T>(version: string, root: string | undefined, fn: () => T): T {\n  if (root === undefined) return fn();\n  if (!hasSchemaRootShape(root)) {\n    throw new Error(`External AdCP schema root for version \"${version}\" not found or empty at ${root}`);\n  }\n  const aliases = assertSchemaRootMatchesVersion(version, root);\n  const parent = scopedExternalSchemaRoots.getStore();\n  const next = new Map(parent);\n  for (const alias of aliases) {\n    next.set(alias, root);\n    clearStatesForBundle(alias);\n  }\n  return scopedExternalSchemaRoots.run(next, fn);\n}\n\nfunction walkJsonFiles(dir: string): string[] {\n  if (!existsSync(dir)) return [];\n  const out: string[] = [];\n  for (const entry of readdirSync(dir, { withFileTypes: true })) {\n    const full = path.join(dir, entry.name);\n    if (entry.isDirectory()) out.push(...walkJsonFiles(full));\n    else if (entry.isFile() && entry.name.endsWith('.json')) out.push(full);\n  }\n  return out;\n}\n\nfunction loadJson(file: string): LoadedSchema {\n  return JSON.parse(readFileSync(file, 'utf-8')) as LoadedSchema;\n}\n\n/**\n * Clear `additionalProperties: false` at the response root so envelope\n * fields (`replayed`, `context`, `ext`, and future envelope additions)\n * can ride alongside the tool-specific body — per security.mdx the\n * envelope is always extensible. Upstream bundled schemas pin\n * `additionalProperties: false` at the root on a handful of mutating\n * tools (the property-list family), which rejects envelope fields like\n * `replayed` that aren't declared in the tool-specific body.\n *\n * Scope is deliberately narrow: only the top-level object, plus each\n * direct branch of a root-level `oneOf` / `anyOf` / `allOf`. Nested\n * bodies stay strict so response-side drift detection still catches\n * typos inside `Product`, `Package`, `MediaBuy` etc. Applied only to\n * response variants; request schemas stay strict so outgoing drift\n * fails at the edge.\n */\nfunction relaxResponseRoot(schema: LoadedSchema): LoadedSchema {\n  const clone = { ...schema };\n  if (clone.additionalProperties === false) {\n    clone.additionalProperties = true;\n  }\n  for (const key of ['oneOf', 'anyOf', 'allOf'] as const) {\n    const branches = clone[key];\n    if (Array.isArray(branches)) {\n      clone[key] = branches.map(branch => {\n        if (!branch || typeof branch !== 'object') return branch;\n        const branchClone = { ...(branch as Record<string, unknown>) };\n        if (branchClone.additionalProperties === false) {\n          branchClone.additionalProperties = true;\n        }\n        return branchClone;\n      });\n    }\n  }\n  return clone;\n}\n\nfunction getAjvRegisteredIds(ajv: Ajv): Set<string> {\n  const internals = ajv as unknown as {\n    schemas?: Record<string, unknown>;\n    refs?: Record<string, unknown>;\n  };\n  return new Set([...Object.keys(internals.schemas ?? {}), ...Object.keys(internals.refs ?? {})]);\n}\n\n/**\n * Build the (toolName, direction) → file path index by scanning the schema\n * tree once. Runs eagerly at first validator lookup.\n */\nfunction buildFileIndex(root: string): Map<string, string> {\n  const index = new Map<string, string>();\n  const record = (toolName: string, direction: Direction, file: string): void => {\n    index.set(`${toolName}::${direction}`, file);\n  };\n\n  // Sync request/response live in the pre-resolved bundled/ tree.\n  const bundledRoot = path.join(root, 'bundled');\n  for (const file of walkJsonFiles(bundledRoot)) {\n    const base = path.basename(file, '.json');\n    if (base.endsWith('-request')) {\n      const tool = base.slice(0, -'-request'.length).replace(/-/g, '_');\n      record(tool, 'request', file);\n    } else if (base.endsWith('-response')) {\n      const tool = base.slice(0, -'-response'.length).replace(/-/g, '_');\n      record(tool, 'sync', file);\n    }\n  }\n\n  // Async variants AND domain schemas that ship flat (not pre-bundled) both\n  // live in the per-domain directories. Walk each for sync request/response\n  // files and async variant files. Skip `bundled/` (already indexed above)\n  // and `core/` (pure $ref targets, no tools).\n  //\n  // Flat-tree domains include `governance/`, `brand/`, `account/`,\n  // `content-standards/`, `property/`, `collection/` — their schemas are\n  // NOT pre-resolved into `bundled/`, so a bundled-only walk would miss\n  // every `check_governance` / `acquire_rights` / `creative_approval` /\n  // `sync_governance` / `*_property_list` request-response pair. That gap\n  // (flagged by the ad-tech-protocol reviewer on PR #831) would leave\n  // protocol-wide-requirement-bearing tasks (idempotency_key pattern,\n  // `format: uri` on `caller`) invisible to the strict-validation signal.\n  // Register flat-tree sync pairs only when `bundled/` didn't already\n  // index them, so pre-resolved schemas (with $refs already inlined) win\n  // for any domain that ships both.\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory()) continue;\n    if (entry.name === 'bundled' || entry.name === 'core') continue;\n    const domainDir = path.join(root, entry.name);\n    for (const file of walkJsonFiles(domainDir)) {\n      const base = path.basename(file, '.json');\n      if (base.endsWith('-async-response-submitted')) {\n        const tool = base.slice(0, -'-async-response-submitted'.length).replace(/-/g, '_');\n        record(tool, 'submitted', file);\n      } else if (base.endsWith('-async-response-working')) {\n        const tool = base.slice(0, -'-async-response-working'.length).replace(/-/g, '_');\n        record(tool, 'working', file);\n      } else if (base.endsWith('-async-response-input-required')) {\n        const tool = base.slice(0, -'-async-response-input-required'.length).replace(/-/g, '_');\n        record(tool, 'input-required', file);\n      } else if (base.endsWith('-request')) {\n        const tool = base.slice(0, -'-request'.length).replace(/-/g, '_');\n        if (!index.has(`${tool}::request`)) record(tool, 'request', file);\n      } else if (base.endsWith('-response')) {\n        const tool = base.slice(0, -'-response'.length).replace(/-/g, '_');\n        if (!index.has(`${tool}::sync`)) record(tool, 'sync', file);\n      }\n    }\n  }\n\n  return index;\n}\n\nfunction ensureInit(version: string): LoaderState {\n  // States are keyed by bundle key, not by raw version string, so\n  // `getValidator('foo', 'request', '3.0.0')` and the same call with\n  // `'3.0.1'` share state — both resolve to bundle key `'3.0'` and the\n  // same compiled AJV instance.\n  const key = resolveBundleKey(version);\n  const root = resolveSchemaRoot(version);\n  const cacheKey = stateCacheKey(key, root);\n  const cached = states.get(cacheKey);\n  if (cached) return cached;\n  const ajv = new Ajv({\n    strict: false,\n    allErrors: true,\n    allowUnionTypes: true,\n  });\n  addFormats(ajv);\n\n  const state: LoaderState = {\n    ajv,\n    fileIndex: buildFileIndex(root),\n    validators: new Map(),\n    rawSchemas: new Map(),\n    root,\n    coreLoaded: false,\n    version: key,\n  };\n  states.set(cacheKey, state);\n  return state;\n}\n\n/**\n * Lazily pre-register every non-tool JSON schema shipped with the SDK so\n * cross-domain `$ref`s compile. Async response variants and flat-tree\n * domain schemas `$ref` out to three classes of building-block schemas:\n *\n *   - `core/` + `enums/` — shared primitives referenced by every domain.\n *   - `pricing-options/`, `error-details/`, `extensions/` — stand-alone\n *     fragment trees.\n *   - Sibling fragments inside each domain directory — e.g.\n *     `governance/audience-constraints.json` referenced by\n *     `governance/sync-plans-request.json`, or `signals/*` fragments\n *     referenced by `signals/activate-signal-*.json`.\n *\n * Walk every directory except `bundled/` (pre-resolved schemas with refs\n * already inlined). Response files that `buildFileIndex` registered as tools\n * are registered with `relaxResponseRoot` applied, matching `getValidator`.\n * The fileIndex check is stricter than a filename-suffix match:\n * building-block fragments like `core/pagination-response.json` end in\n * `-response.json` but aren't tools, so suffix-matching would wrongly treat\n * them as relaxable response roots.\n */\nfunction ensureCoreLoaded(s: LoaderState): void {\n  if (s.coreLoaded) return;\n  // Tool response files are pre-registered with the same response-root\n  // relaxation `getValidator` would apply. This matters for the async response\n  // union: `core/async-response-data.json` can `$ref` both async variants and\n  // sync responses, so callers must not have to prewarm response validators\n  // before compiling a request that references the union.\n  //\n  // Why this matters: bundles whose source tree doesn't include a `bundled/`\n  // pre-resolved subtree (e.g. v2.5, where the spec ships flat schemas with\n  // unresolved `$ref`s) classify fragments like `media-buy/package-request.json`\n  // as tool `package::request` via the filename-suffix heuristic in\n  // `buildFileIndex`. Skipping all tool files would leave that fragment\n  // unregistered, so a later compile of `create_media_buy` fails on\n  // `MissingRefError: can't resolve /schemas/media-buy/package-request.json`.\n  //\n  const responseToolFiles = new Map<string, Direction>();\n  for (const [key, file] of s.fileIndex) {\n    if (key.endsWith('::request')) continue;\n    const direction = key.slice(key.indexOf('::') + 2) as Direction;\n    responseToolFiles.set(file, direction);\n  }\n  const registeredIds = getAjvRegisteredIds(s.ajv);\n  for (const entry of readdirSync(s.root, { withFileTypes: true })) {\n    if (!entry.isDirectory()) continue;\n    if (entry.name === 'bundled') continue;\n    const abs = path.join(s.root, entry.name);\n    for (const file of walkJsonFiles(abs)) {\n      const responseDirection = responseToolFiles.get(file);\n      const schema = loadJson(file);\n      const schemaToRegister = responseDirection === undefined ? schema : relaxResponseRoot(schema);\n      if (typeof schemaToRegister.$id === 'string' && !registeredIds.has(schemaToRegister.$id)) {\n        s.ajv.addSchema(schemaToRegister);\n        registeredIds.add(schemaToRegister.$id);\n      }\n    }\n  }\n  s.coreLoaded = true;\n}\n\n/**\n * Look up the compiled AJV validator for a given tool + direction in the\n * specified AdCP version's schema bundle. Returns `undefined` when no\n * schema exists for the pair — callers can skip validation cleanly (e.g.,\n * custom tools outside the AdCP spec).\n *\n * `version` defaults to the SDK-pinned `ADCP_VERSION`. Pass the per-instance\n * `getAdcpVersion()` value when the validator should track the client/server's\n * configured pin (Stage 3+).\n */\nexport function getValidator(\n  toolName: string,\n  direction: Direction,\n  version: string = ADCP_VERSION\n): ValidateFunction | undefined {\n  const s = ensureInit(version);\n  const cacheKey = `${toolName}::${direction}`;\n  const cached = s.validators.get(cacheKey);\n  if (cached) return cached;\n\n  const file = s.fileIndex.get(cacheKey);\n  if (!file) return undefined;\n\n  // Schemas that $ref into core/ and enums/ need those trees registered\n  // before compile. Async response variants always do; flat-tree domain\n  // schemas (anything outside `bundled/`) do too — their $refs weren't\n  // pre-resolved at spec-publish time.\n  const fromBundled = file.includes(`${path.sep}bundled${path.sep}`);\n  if (direction === 'request' || !fromBundled) ensureCoreLoaded(s);\n\n  const rawSchema = loadJson(file);\n  // Bundled files inline every referenced subschema with the original\n  // canonical `$id` (e.g. `core/version-envelope.json` appears nested\n  // inside every bundled tool response). Bundled files carry NO\n  // internal `$ref`s — the spec publishes them fully resolved, see\n  // the `note: \"This is a bundled schema with all $ref resolved inline\"`\n  // tag on every bundled file. Once `ensureCoreLoaded` has registered\n  // any of those core schemas standalone (which it does for the flat-\n  // tree governance / brand / property domains), Ajv's compile of a\n  // bundled file trips the ambiguous-ref check on every nested $id.\n  //\n  // The fix: strip nested `$id` fields before compile on bundled\n  // schemas. The root `$id` is kept (it's the validator's lookup key);\n  // every other `$id` in the tree was just metadata anyway.\n  const prepared = fromBundled ? stripNestedIds(rawSchema) : rawSchema;\n  const schema = direction === 'request' ? prepared : relaxResponseRoot(prepared);\n  const existing = typeof schema.$id === 'string' ? s.ajv.getSchema(schema.$id) : undefined;\n  const compiled = existing ?? s.ajv.compile(schema);\n  s.validators.set(cacheKey, compiled);\n  return compiled;\n}\n\n/**\n * Compile an arbitrary schema from the cached bundle by path, e.g.\n * `core/mcp-webhook-payload.json`. Used by storyboard webhook assertions\n * whose payload schema is not tied to a tool request/response pair.\n */\nexport function getSchemaValidatorByRef(\n  schemaRef: string,\n  version: string = ADCP_VERSION\n): ValidateFunction | undefined {\n  const s = ensureInit(version);\n  const normalized = normalizeSchemaRef(schemaRef);\n  if (!normalized) return undefined;\n\n  const cacheKey = `schema-ref::${normalized}`;\n  const cached = s.validators.get(cacheKey);\n  if (cached) return cached;\n\n  const file = path.join(s.root, normalized);\n  if (!existsSync(file)) return undefined;\n\n  // Use an isolated AJV instance for arbitrary schema refs. Tool response\n  // validators deliberately relax some roots for SDK back-compat; webhook\n  // payload schemas need strict raw JSON Schema behavior without polluting the\n  // shared tool-validator registry with unrelaxed response schemas.\n  const ajv = new Ajv({\n    strict: false,\n    allErrors: true,\n    allowUnionTypes: true,\n  });\n  addFormats(ajv);\n  const dependencySchemas: LoadedSchema[] = [];\n  const registeredIds = new Set<string>();\n  for (const schemaFile of walkJsonFiles(s.root)) {\n    if (schemaFile.includes(`${path.sep}bundled${path.sep}`)) continue;\n    if (schemaFile === file) continue;\n    const schema = loadJson(schemaFile);\n    if (typeof schema.$id === 'string' && !registeredIds.has(schema.$id)) {\n      registeredIds.add(schema.$id);\n      dependencySchemas.push(schema);\n    }\n  }\n  if (dependencySchemas.length > 0) {\n    ajv.addSchema(dependencySchemas);\n  }\n  const rawSchema = loadJson(file);\n  const compiled = ajv.compile(rawSchema);\n  s.validators.set(cacheKey, compiled);\n  return compiled;\n}\n\nfunction normalizeSchemaRef(schemaRef: string): string | undefined {\n  const trimmed = schemaRef.replace(/^\\/+/, '');\n  if (trimmed.length === 0) return undefined;\n  const normalized = path.normalize(trimmed);\n  if (normalized.startsWith('..') || path.isAbsolute(normalized)) return undefined;\n  return normalized;\n}\n\n/**\n * Strip `$id` from every subschema of a bundled response file, preserving\n * the root `$id`. Bundled files are fully inlined (no internal `$ref`s),\n * so the nested `$id`s are vestigial metadata — Ajv only cares about the\n * root `$id` for validator lookup. Without this strip, Ajv's\n * `checkAmbiguousRef` throws when an inlined nested `$id` matches one\n * already registered standalone via `ensureCoreLoaded`.\n *\n * Returns a deep-copied tree; the input is not mutated.\n */\nfunction stripNestedIds(schema: LoadedSchema): LoadedSchema {\n  const root = JSON.parse(JSON.stringify(schema)) as LoadedSchema;\n  const rootId = typeof root.$id === 'string' ? root.$id : undefined;\n  const walk = (node: unknown): void => {\n    if (Array.isArray(node)) {\n      for (const item of node) walk(item);\n      return;\n    }\n    if (!node || typeof node !== 'object') return;\n    const obj = node as Record<string, unknown>;\n    if (typeof obj.$id === 'string' && obj.$id !== rootId) {\n      delete obj.$id;\n    }\n    for (const value of Object.values(obj)) walk(value);\n  };\n  walk(root);\n  return root;\n}\n\n/** List of (toolName, direction) pairs that have schemas. Used by tests. */\nexport function listValidatorKeys(version: string = ADCP_VERSION): string[] {\n  const s = ensureInit(version);\n  return [...s.fileIndex.keys()].sort();\n}\n\n/**\n * `$id`s of every schema currently registered with the AdCP validator's AJV\n * instance for `version`. Used by the schema-validator to extract the\n * rejecting sub-schema's `$id` from an Ajv error's `schemaPath`: when a\n * `$ref` is followed, Ajv prefixes the schemaPath with the target schema's\n * `$id`, so the longest registered `$id` that prefixes a schemaPath is the\n * sub-schema responsible for the failure.\n *\n * The set grows as `getValidator` calls trigger `ensureCoreLoaded` and\n * compile new tool roots — callers should read it AFTER the validate call\n * they're projecting errors from.\n */\nexport function getRegisteredSchemaIds(version: string = ADCP_VERSION): readonly string[] {\n  const s = ensureInit(version);\n  // Ajv 8 keeps registered schemas at `ajv.schemas` (URI → SchemaEnv). Returning\n  // the keys is enough for prefix matching; we don't expose the SchemaEnv values.\n  const registry = (s.ajv as unknown as { schemas?: Record<string, unknown> }).schemas;\n  return registry ? Object.keys(registry) : [];\n}\n\n/** Suffix used in the suffix table — exported for testing. */\nexport { SCHEMA_FILENAME_SUFFIX };\n\n/**\n * Returns true when the schema bundle for `version` is reachable from the\n * dist build or the source-tree fallback. Cheap synchronous check; safe\n * to call at construction time of clients/servers to fail fast on a pin\n * we don't have schemas for.\n */\nexport function hasSchemaBundle(version: string): boolean {\n  try {\n    resolveSchemaRoot(version);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Test hook: reset cached state. With no argument, clears every version's\n * loader state; with a version, clears only the bundle that version\n * resolves to (so passing `'3.0.0'` and `'3.0.1'` both clear the `'3.0'`\n * bundle).\n */\nexport function _resetValidationLoader(version?: string): void {\n  if (version === undefined) {\n    states.clear();\n  } else {\n    clearStatesForBundle(resolveBundleKey(version));\n  }\n}\n\n/**\n * Returns true when `field` is **explicitly declared** as a top-level property\n * in the request schema for `toolName`, or when no schema is available\n * (fail-open). Used by the storyboard runner to decide whether to inject\n * envelope fields that aren't universally present across tools (e.g. `brand`,\n * `account`, `ext`).\n *\n * Reads the raw JSON schema file without compiling — avoids coupling to AJV\n * internals. Only inspects the top-level `properties` map; nested sub-schemas\n * are not traversed. Results are memoized in `LoaderState.rawSchemas` so\n * multi-step storyboard runs don't re-read the same file on each step.\n *\n * **Semantic note**: AdCP 3.1.0-beta.3 set `additionalProperties: true` on\n * mutating request schemas (vendor-extension friendly). Before that flip, the\n * helper used `additionalProperties: false` as the gate — \"if the schema is\n * strict, only `properties` keys are allowed.\" Now requests are universally\n * permissive at the schema level, so that gate would say `true` for any field\n * on any request — defeating the storyboard runner's intent (\"only inject\n * envelope fields the tool's schema declares it expects to see\"). The helper\n * now checks `field in properties` directly: the question we actually care\n * about is **\"does the schema declare this field at top level?\"**, not\n * \"does the schema permit this field at top level?\" (it permits everything).\n *\n * Fails open (returns `true`) when:\n * - No schema file is indexed for the tool (custom tool, schema not synced)\n * - The schema root is not reachable (schemas not built/synced yet)\n * - Any I/O / parse error during the read\n *\n * @internal — not part of the public API surface; may change without a major bump.\n */\nexport function schemaAllowsTopLevelField(toolName: string, field: string, version: string = ADCP_VERSION): boolean {\n  try {\n    const s = ensureInit(version);\n    const cacheKey = `${toolName}::request`;\n    const file = s.fileIndex.get(cacheKey);\n    if (!file) return true;\n    let schema = s.rawSchemas.get(cacheKey);\n    if (!schema) {\n      schema = loadJson(file) as Record<string, unknown>;\n      s.rawSchemas.set(cacheKey, schema);\n    }\n    const props = schema.properties as Record<string, unknown> | undefined;\n    return props !== undefined && field in props;\n  } catch {\n    return true;\n  }\n}\n\n/**\n * Resolve a JSON Schema `default` value by walking a dot-separated property\n * path through a schema's nested `properties` maps.\n *\n * This intentionally does not instantiate AJV's `useDefaults` mutation mode.\n * Callers decide when a schema default is semantically meaningful for their\n * runtime object; this helper only reports what the bundled schema declares.\n *\n * Fails closed (`undefined`) when the schema is unavailable, the path is not a\n * concrete properties path, or the target schema node has no `default`.\n *\n * @internal — not part of the public API surface; may change without a major bump.\n */\nexport function getSchemaDefaultByPath(schemaRef: string, dottedPath: string, version: string = ADCP_VERSION): unknown {\n  try {\n    const s = ensureInit(version);\n    const normalized = normalizeSchemaRef(schemaRef);\n    if (!normalized) return undefined;\n\n    const cacheKey = `schema-ref::${normalized}`;\n    const file = path.join(s.root, normalized);\n    if (!existsSync(file)) return undefined;\n\n    let schema = s.rawSchemas.get(cacheKey);\n    if (!schema) {\n      schema = loadJson(file) as Record<string, unknown>;\n      s.rawSchemas.set(cacheKey, schema);\n    }\n\n    const node = resolveSchemaPropertyPath(schema, dottedPath);\n    if (!node || !Object.prototype.hasOwnProperty.call(node, 'default')) return undefined;\n    return cloneJsonValue((node as { default: unknown }).default);\n  } catch {\n    return undefined;\n  }\n}\n\nfunction resolveSchemaPropertyPath(\n  schema: Record<string, unknown>,\n  dottedPath: string\n): Record<string, unknown> | undefined {\n  let current: unknown = schema;\n  for (const key of dottedPath.split('.')) {\n    if (!current || typeof current !== 'object') return undefined;\n    const props = (current as Record<string, unknown>).properties;\n    if (!props || typeof props !== 'object') return undefined;\n    if (!Object.prototype.hasOwnProperty.call(props, key)) return undefined;\n    current = (props as Record<string, unknown>)[key];\n  }\n  return current && typeof current === 'object' ? (current as Record<string, unknown>) : undefined;\n}\n\nfunction cloneJsonValue(value: unknown): unknown {\n  if (value === null || typeof value !== 'object') return value;\n  return JSON.parse(JSON.stringify(value)) as unknown;\n}\n"],"mappings":"AAAA,SAAS,iBAAiB,2BAA2B;AACrD,SAAS,WAAW,qBAAqB;AACzC,SAAS,iBAAiB,2BAA2B;AACrD,MAAM,YAAY,cAAc,oBAAoB,YAAY,GAAG,CAAC;AACpE,MAAMA,WAAU,oBAAoB,YAAY,GAAG;AAgBnD,OAAO,SAAoC;AAC3C,OAAO,gBAAgB;AACvB,SAAS,yBAAyB;AAClC,SAAS,aAAa,cAAc,kBAAkB;AACtD,OAAO,UAAU;AACjB,SAAS,oBAAoB;AAC7B,SAAS,0BAA0B;AAUnC,MAAM,yBAAoD;AAAA,EACxD,SAAS;AAAA,EACT,MAAM;AAAA,EACN,WAAW;AAAA,EACX,SAAS;AAAA,EACT,kBAAkB;AACpB;AA+BO,SAAS,iBAAiB,SAAyB;AAExD,QAAM,YAAY,QAAQ,MAAM,gBAAgB;AAChD,MAAI,UAAW,QAAO,GAAG,UAAU,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC;AAKrD,QAAM,sBAAsB,QAAQ,MAAM,kDAAkD;AAC5F,MAAI,oBAAqB,QAAO;AAOhC,QAAM,SAAS,QAAQ,MAAM,gEAAgE;AAC7F,MAAI,QAAQ;AACV,UAAM,CAAC,EAAE,OAAO,OAAO,EAAE,UAAU,IAAI;AACvC,QAAI,eAAe,OAAW,QAAO;AACrC,WAAO,GAAG,KAAK,IAAI,KAAK;AAAA,EAC1B;AAGA,QAAM,cAAc,QAAQ,MAAM,gBAAgB;AAClD,MAAI,YAAa,QAAO;AACxB,QAAM,IAAI;AAAA,IACR,gBAAgB,KAAK,UAAU,OAAO,CAAC;AAAA,IAGvC;AAAA,EACF;AACF;AAiDA,MAAM,4BAA4B;AAsB3B,SAAS,wBAAwB,OAAyC;AAC/E,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI;AAAA,MACR,sCAAsC,OAAO,KAAK;AAAA,MAElD;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,0BAA0B,KAAK,KAAK,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,gBAAgB,KAAK,UAAU,KAAK,CAAC,4CAA4C,yBAAyB;AAAA,MAG1G;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,uBAAuB,oBAAoC;AAEzE,QAAM,mBAAmB,mBAAmB,MAAM,qDAAqD;AACvG,MAAI,kBAAkB;AACpB,UAAM,CAAC,EAAE,OAAO,OAAO,aAAa,EAAE,IAAI;AAC1C,WAAO,GAAG,KAAK,IAAI,KAAK,GAAG,UAAU;AAAA,EACvC;AAEA,QAAM,aAAa,mBAAmB,MAAM,0DAA0D;AACtG,MAAI,YAAY;AACd,UAAM,CAAC,EAAE,OAAO,OAAO,aAAa,EAAE,IAAI;AAC1C,WAAO,GAAG,KAAK,IAAI,KAAK,GAAG,UAAU;AAAA,EACvC;AAIA,MAAI,iBAAiB,KAAK,kBAAkB,EAAG,QAAO;AACtD,QAAM,IAAI;AAAA,IACR,oBAAoB,KAAK,UAAU,kBAAkB,CAAC;AAAA,IAEtD;AAAA,EACF;AACF;AAsBA,SAAS,kBAAkB,SAAyB;AAClD,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,aAAa,0BAA0B,SAAS,GAAG,IAAI,GAAG;AAChE,MAAI,cAAc,WAAW,UAAU,EAAG,QAAO;AAEjD,QAAM,eAAe,oBAAoB,IAAI,GAAG;AAChD,MAAI,gBAAgB,WAAW,YAAY,EAAG,QAAO;AAErD,QAAM,gBAAgB,KAAK,KAAK,WAAW,MAAM,gBAAgB,GAAG;AACpE,MAAI,WAAW,aAAa,EAAG,QAAO;AAKtC,QAAM,wBAAwB,aAAa,KAAK,GAAG;AACnD,MAAI,uBAAuB;AACzB,UAAM,0BAA0B,qBAAqB,KAAK,KAAK,WAAW,MAAM,cAAc,GAAG,GAAG;AACpG,QAAI,wBAAyB,QAAO;AAAA,EACtC;AAKA,QAAM,YAAY,KAAK,KAAK,WAAW,MAAM,MAAM,MAAM,WAAW,OAAO;AAC3E,QAAM,iBAAiB,KAAK,KAAK,WAAW,OAAO;AACnD,MAAI,WAAW,cAAc,EAAG,QAAO;AAOvC,QAAM,aAAa,IAAI,MAAM,gBAAgB;AAC7C,MAAI,cAAc,WAAW,SAAS,GAAG;AACvC,UAAM,CAAC,EAAE,OAAO,KAAK,IAAI;AACzB,UAAM,SAAS,GAAG,KAAK,IAAI,KAAK;AAChC,UAAM,SAAS,YAAY,WAAW,EAAE,eAAe,KAAK,CAAC,EAC1D;AAAA,MACC,OACE,EAAE,YAAY,KACd,EAAE,KAAK,WAAW,MAAM,KACxB,CAAC,EAAE,KAAK,SAAS,WAAW,KAC5B,kBAAkB,KAAK,EAAE,IAAI;AAAA,IACjC,EACC,IAAI,QAAM;AAAA,MACT,MAAM,EAAE;AAAA,MACR,OAAO,SAAS,EAAE,KAAK,MAAM,OAAO,MAAM,GAAG,EAAE;AAAA,IACjD,EAAE,EACD,OAAO,OAAK,OAAO,SAAS,EAAE,KAAK,CAAC,EACpC,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACnC,QAAI,OAAO,SAAS,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO,CAAC,EAAG,IAAI;AAAA,EACpE;AASA,MAAI,uBAAuB;AACzB,UAAM,2BAA2B,qBAAqB,WAAW,GAAG;AACpE,QAAI,yBAA0B,QAAO;AAAA,EACvC;AAEA,QAAM,IAAI;AAAA,IACR,iCAAiC,OAAO,uCACZ,GAAG,QAAQ,aAAa,gBAAgB,cAAc,sCAC5C,SAAS;AAAA,EAEjD;AACF;AAEA,SAAS,qBAAqB,MAAc,KAAiC;AAC3E,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,EACrD,OAAO,OAAK,EAAE,YAAY,KAAK,CAAC,EAAE,KAAK,SAAS,WAAW,CAAC,EAC5D,IAAI,OAAK;AACR,QAAI;AACF,aAAO,EAAE,MAAM,EAAE,MAAM,IAAI,uBAAuB,EAAE,IAAI,EAAE;AAAA,IAC5D,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,CAAC,EACA,OAAO,CAAC,MAAyC,MAAM,IAAI,EAC3D,OAAO,OAAK,EAAE,OAAO,OAAO,EAAE,GAAG,WAAW,GAAG,GAAG,GAAG,CAAC,EACtD,KAAK,CAAC,GAAG,MAAM,uBAAuB,EAAE,MAAM,EAAE,IAAI,CAAC;AACxD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO,KAAK,KAAK,MAAM,OAAO,CAAC,EAAG,IAAI;AACxC;AAEA,SAAS,uBAAuB,GAAW,GAAmB;AAC5D,SAAO,EAAE,cAAc,GAAG,QAAW,EAAE,SAAS,MAAM,aAAa,OAAO,CAAC;AAC7E;AAYA,MAAM,SAAmC,oBAAI,IAAI;AACjD,MAAM,sBAA2C,oBAAI,IAAI;AACzD,MAAM,4BAA4B,IAAI,kBAAuC;AAE7E,SAAS,cAAc,WAAmB,MAAsB;AAC9D,SAAO,GAAG,SAAS,KAAK,IAAI;AAC9B;AAEA,SAAS,qBAAqB,WAAyB;AACrD,aAAW,CAAC,UAAU,KAAK,KAAK,QAAQ;AACtC,QAAI,MAAM,YAAY,UAAW,QAAO,OAAO,QAAQ;AAAA,EACzD;AACF;AAEA,SAAS,mBAAmB,MAAuB;AACjD,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,cAAc,KAAK,KAAK,MAAM,SAAS;AAC7C,QAAM,QAAQ,WAAW,WAAW,IAAI,cAAc,WAAW,IAAI,cAAc,IAAI;AACvF,SAAO,MAAM,KAAK,UAAQ;AACxB,QAAI;AACF,YAAM,SAAS,SAAS,IAAI;AAC5B,aAAO,OAAO,OAAO,QAAQ,YAAY,OAAO,OAAO,YAAY;AAAA,IACrE,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;AAEA,SAAS,oBAAoB,UAAsC;AACjE,SAAO,SAAS,MAAM,sBAAsB,IAAI,CAAC;AACnD;AAEA,SAAS,gCAAgC,MAA2B;AAClE,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,QAAQ,cAAc,IAAI,GAAG;AACtC,QAAI;AACJ,QAAI;AACF,eAAS,SAAS,IAAI;AAAA,IACxB,QAAQ;AACN;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,SAAU;AACpC,UAAM,OAAO,oBAAoB,OAAO,GAAG;AAC3C,QAAI,CAAC,KAAM;AACX,eAAW,SAAS,yBAAyB,IAAI,EAAG,SAAQ,IAAI,KAAK;AAAA,EACvE;AACA,SAAO;AACT;AAEA,SAAS,yBAAyB,SAA8B;AAC9D,QAAM,UAAU,oBAAI,IAAY,CAAC,OAAO,CAAC;AACzC,MAAI;AACF,YAAQ,IAAI,iBAAiB,OAAO,CAAC;AAAA,EACvC,QAAQ;AAAA,EAER;AACA,MAAI;AACF,UAAM,mBAAmB,uBAAuB,OAAO;AACvD,YAAQ,IAAI,gBAAgB;AAC5B,UAAM,SAAS,sBAAsB,gBAAgB;AACrD,QAAI,OAAQ,SAAQ,IAAI,MAAM;AAAA,EAChC,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,yBAAqD;AAClF,SAAO,wBAAwB,MAAM,iCAAiC,IAAI,CAAC;AAC7E;AAEA,SAAS,oCAAoC,MAA6D;AACxG,QAAM,SAAwD,CAAC;AAC/D,aAAW,QAAQ,cAAc,IAAI,GAAG;AACtC,QAAI;AACJ,QAAI;AACF,eAAS,SAAS,IAAI;AAAA,IACxB,QAAQ;AACN;AAAA,IACF;AACA,QAAI,OAAO,OAAO,QAAQ,SAAU;AACpC,UAAM,OAAO,oBAAoB,OAAO,GAAG;AAC3C,QAAI,CAAC,KAAM;AACX,WAAO,KAAK,EAAE,MAAM,SAAS,yBAAyB,IAAI,EAAE,CAAC;AAAA,EAC/D;AACA,SAAO;AACT;AAEA,SAAS,+BAA+B,SAAiB,MAA2B;AAClF,QAAM,kBAAkB,yBAAyB,OAAO;AACxD,QAAM,aAAa,oCAAoC,IAAI;AAC3D,QAAM,cAAc,gCAAgC,IAAI;AACxD,MACE,WAAW,SAAS,KACpB,WAAW,MAAM,WAAS,CAAC,GAAG,MAAM,OAAO,EAAE,KAAK,WAAS,gBAAgB,IAAI,KAAK,CAAC,CAAC,GACtF;AACA,WAAO,oBAAI,IAAI,CAAC,GAAG,iBAAiB,GAAG,WAAW,CAAC;AAAA,EACrD;AACA,QAAM,QACJ,WAAW,WAAW,IAClB,uBACA,WACG,IAAI,WAAS,GAAG,MAAM,IAAI,KAAK,MAAM,KAAK,MAAM,OAAO,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,GAAG,EAC7E,KAAK,EACL,KAAK,IAAI;AAClB,QAAM,IAAI;AAAA,IACR,0CAA0C,OAAO,QAAQ,IAAI,mFAClB,MAAM,KAAK,eAAe,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,WAAW,KAAK;AAAA,EAC1G;AACF;AAEA,MAAM,4BAAsD,oBAAI,IAAI;AAU7D,SAAS,2BAA2B,SAAiB,MAAoB;AAC9E,QAAM,MAAM,iBAAiB,OAAO;AACpC,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,UAAM,IAAI,MAAM,0CAA0C,OAAO,2BAA2B,IAAI,EAAE;AAAA,EACpG;AACA,QAAM,UAAU,+BAA+B,SAAS,IAAI;AAC5D,4BAA0B,IAAI,KAAK,OAAO;AAC1C,aAAW,SAAS,SAAS;AAC3B,UAAM,WAAW,oBAAoB,IAAI,KAAK;AAC9C,wBAAoB,IAAI,OAAO,IAAI;AACnC,QAAI,aAAa,KAAM,sBAAqB,KAAK;AAAA,EACnD;AACF;AAGO,SAAS,6BAA6B,SAAuB;AAClE,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,UAAU,IAAI,IAAI,yBAAyB,OAAO,CAAC;AACzD,aAAW,CAAC,eAAe,iBAAiB,KAAK,2BAA2B;AAC1E,QACE,kBAAkB,OAClB,kBAAkB,IAAI,GAAG,KACzB,CAAC,GAAG,OAAO,EAAE,KAAK,WAAS,kBAAkB,IAAI,KAAK,CAAC,GACvD;AACA,iBAAW,SAAS,kBAAmB,SAAQ,IAAI,KAAK;AACxD,gCAA0B,OAAO,aAAa;AAAA,IAChD;AAAA,EACF;AACA,aAAW,SAAS,SAAS;AAC3B,wBAAoB,OAAO,KAAK;AAChC,yBAAqB,KAAK;AAAA,EAC5B;AACF;AAOO,SAAS,uBAA0B,SAAiB,MAA0B,IAAgB;AACnG,MAAI,SAAS,OAAW,QAAO,GAAG;AAClC,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,UAAM,IAAI,MAAM,0CAA0C,OAAO,2BAA2B,IAAI,EAAE;AAAA,EACpG;AACA,QAAM,UAAU,+BAA+B,SAAS,IAAI;AAC5D,QAAM,SAAS,0BAA0B,SAAS;AAClD,QAAM,OAAO,IAAI,IAAI,MAAM;AAC3B,aAAW,SAAS,SAAS;AAC3B,SAAK,IAAI,OAAO,IAAI;AACpB,yBAAqB,KAAK;AAAA,EAC5B;AACA,SAAO,0BAA0B,IAAI,MAAM,EAAE;AAC/C;AAEA,SAAS,cAAc,KAAuB;AAC5C,MAAI,CAAC,WAAW,GAAG,EAAG,QAAO,CAAC;AAC9B,QAAM,MAAgB,CAAC;AACvB,aAAW,SAAS,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC,GAAG;AAC7D,UAAM,OAAO,KAAK,KAAK,KAAK,MAAM,IAAI;AACtC,QAAI,MAAM,YAAY,EAAG,KAAI,KAAK,GAAG,cAAc,IAAI,CAAC;AAAA,aAC/C,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,OAAO,EAAG,KAAI,KAAK,IAAI;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAA4B;AAC5C,SAAO,KAAK,MAAM,aAAa,MAAM,OAAO,CAAC;AAC/C;AAkBA,SAAS,kBAAkB,QAAoC;AAC7D,QAAM,QAAQ,EAAE,GAAG,OAAO;AAC1B,MAAI,MAAM,yBAAyB,OAAO;AACxC,UAAM,uBAAuB;AAAA,EAC/B;AACA,aAAW,OAAO,CAAC,SAAS,SAAS,OAAO,GAAY;AACtD,UAAM,WAAW,MAAM,GAAG;AAC1B,QAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,YAAM,GAAG,IAAI,SAAS,IAAI,YAAU;AAClC,YAAI,CAAC,UAAU,OAAO,WAAW,SAAU,QAAO;AAClD,cAAM,cAAc,EAAE,GAAI,OAAmC;AAC7D,YAAI,YAAY,yBAAyB,OAAO;AAC9C,sBAAY,uBAAuB;AAAA,QACrC;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,KAAuB;AAClD,QAAM,YAAY;AAIlB,SAAO,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,UAAU,WAAW,CAAC,CAAC,GAAG,GAAG,OAAO,KAAK,UAAU,QAAQ,CAAC,CAAC,CAAC,CAAC;AAChG;AAMA,SAAS,eAAe,MAAmC;AACzD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,QAAM,SAAS,CAAC,UAAkB,WAAsB,SAAuB;AAC7E,UAAM,IAAI,GAAG,QAAQ,KAAK,SAAS,IAAI,IAAI;AAAA,EAC7C;AAGA,QAAM,cAAc,KAAK,KAAK,MAAM,SAAS;AAC7C,aAAW,QAAQ,cAAc,WAAW,GAAG;AAC7C,UAAM,OAAO,KAAK,SAAS,MAAM,OAAO;AACxC,QAAI,KAAK,SAAS,UAAU,GAAG;AAC7B,YAAM,OAAO,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,EAAE,QAAQ,MAAM,GAAG;AAChE,aAAO,MAAM,WAAW,IAAI;AAAA,IAC9B,WAAW,KAAK,SAAS,WAAW,GAAG;AACrC,YAAM,OAAO,KAAK,MAAM,GAAG,CAAC,YAAY,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjE,aAAO,MAAM,QAAQ,IAAI;AAAA,IAC3B;AAAA,EACF;AAkBA,aAAW,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAC9D,QAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,QAAI,MAAM,SAAS,aAAa,MAAM,SAAS,OAAQ;AACvD,UAAM,YAAY,KAAK,KAAK,MAAM,MAAM,IAAI;AAC5C,eAAW,QAAQ,cAAc,SAAS,GAAG;AAC3C,YAAM,OAAO,KAAK,SAAS,MAAM,OAAO;AACxC,UAAI,KAAK,SAAS,2BAA2B,GAAG;AAC9C,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,4BAA4B,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjF,eAAO,MAAM,aAAa,IAAI;AAAA,MAChC,WAAW,KAAK,SAAS,yBAAyB,GAAG;AACnD,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,0BAA0B,MAAM,EAAE,QAAQ,MAAM,GAAG;AAC/E,eAAO,MAAM,WAAW,IAAI;AAAA,MAC9B,WAAW,KAAK,SAAS,gCAAgC,GAAG;AAC1D,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,iCAAiC,MAAM,EAAE,QAAQ,MAAM,GAAG;AACtF,eAAO,MAAM,kBAAkB,IAAI;AAAA,MACrC,WAAW,KAAK,SAAS,UAAU,GAAG;AACpC,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,EAAE,QAAQ,MAAM,GAAG;AAChE,YAAI,CAAC,MAAM,IAAI,GAAG,IAAI,WAAW,EAAG,QAAO,MAAM,WAAW,IAAI;AAAA,MAClE,WAAW,KAAK,SAAS,WAAW,GAAG;AACrC,cAAM,OAAO,KAAK,MAAM,GAAG,CAAC,YAAY,MAAM,EAAE,QAAQ,MAAM,GAAG;AACjE,YAAI,CAAC,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAG,QAAO,MAAM,QAAQ,IAAI;AAAA,MAC5D;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,WAAW,SAA8B;AAKhD,QAAM,MAAM,iBAAiB,OAAO;AACpC,QAAM,OAAO,kBAAkB,OAAO;AACtC,QAAM,WAAW,cAAc,KAAK,IAAI;AACxC,QAAM,SAAS,OAAO,IAAI,QAAQ;AAClC,MAAI,OAAQ,QAAO;AACnB,QAAM,MAAM,IAAI,IAAI;AAAA,IAClB,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,CAAC;AACD,aAAW,GAAG;AAEd,QAAM,QAAqB;AAAA,IACzB;AAAA,IACA,WAAW,eAAe,IAAI;AAAA,IAC9B,YAAY,oBAAI,IAAI;AAAA,IACpB,YAAY,oBAAI,IAAI;AAAA,IACpB;AAAA,IACA,YAAY;AAAA,IACZ,SAAS;AAAA,EACX;AACA,SAAO,IAAI,UAAU,KAAK;AAC1B,SAAO;AACT;AAuBA,SAAS,iBAAiB,GAAsB;AAC9C,MAAI,EAAE,WAAY;AAelB,QAAM,oBAAoB,oBAAI,IAAuB;AACrD,aAAW,CAAC,KAAK,IAAI,KAAK,EAAE,WAAW;AACrC,QAAI,IAAI,SAAS,WAAW,EAAG;AAC/B,UAAM,YAAY,IAAI,MAAM,IAAI,QAAQ,IAAI,IAAI,CAAC;AACjD,sBAAkB,IAAI,MAAM,SAAS;AAAA,EACvC;AACA,QAAM,gBAAgB,oBAAoB,EAAE,GAAG;AAC/C,aAAW,SAAS,YAAY,EAAE,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;AAChE,QAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,QAAI,MAAM,SAAS,UAAW;AAC9B,UAAM,MAAM,KAAK,KAAK,EAAE,MAAM,MAAM,IAAI;AACxC,eAAW,QAAQ,cAAc,GAAG,GAAG;AACrC,YAAM,oBAAoB,kBAAkB,IAAI,IAAI;AACpD,YAAM,SAAS,SAAS,IAAI;AAC5B,YAAM,mBAAmB,sBAAsB,SAAY,SAAS,kBAAkB,MAAM;AAC5F,UAAI,OAAO,iBAAiB,QAAQ,YAAY,CAAC,cAAc,IAAI,iBAAiB,GAAG,GAAG;AACxF,UAAE,IAAI,UAAU,gBAAgB;AAChC,sBAAc,IAAI,iBAAiB,GAAG;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AACA,IAAE,aAAa;AACjB;AAYO,SAAS,aACd,UACA,WACA,UAAkB,cACY;AAC9B,QAAM,IAAI,WAAW,OAAO;AAC5B,QAAM,WAAW,GAAG,QAAQ,KAAK,SAAS;AAC1C,QAAM,SAAS,EAAE,WAAW,IAAI,QAAQ;AACxC,MAAI,OAAQ,QAAO;AAEnB,QAAM,OAAO,EAAE,UAAU,IAAI,QAAQ;AACrC,MAAI,CAAC,KAAM,QAAO;AAMlB,QAAM,cAAc,KAAK,SAAS,GAAG,KAAK,GAAG,UAAU,KAAK,GAAG,EAAE;AACjE,MAAI,cAAc,aAAa,CAAC,YAAa,kBAAiB,CAAC;AAE/D,QAAM,YAAY,SAAS,IAAI;AAc/B,QAAM,WAAW,cAAc,eAAe,SAAS,IAAI;AAC3D,QAAM,SAAS,cAAc,YAAY,WAAW,kBAAkB,QAAQ;AAC9E,QAAM,WAAW,OAAO,OAAO,QAAQ,WAAW,EAAE,IAAI,UAAU,OAAO,GAAG,IAAI;AAChF,QAAM,WAAW,YAAY,EAAE,IAAI,QAAQ,MAAM;AACjD,IAAE,WAAW,IAAI,UAAU,QAAQ;AACnC,SAAO;AACT;AAOO,SAAS,wBACd,WACA,UAAkB,cACY;AAC9B,QAAM,IAAI,WAAW,OAAO;AAC5B,QAAM,aAAa,mBAAmB,SAAS;AAC/C,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,WAAW,eAAe,UAAU;AAC1C,QAAM,SAAS,EAAE,WAAW,IAAI,QAAQ;AACxC,MAAI,OAAQ,QAAO;AAEnB,QAAM,OAAO,KAAK,KAAK,EAAE,MAAM,UAAU;AACzC,MAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAM9B,QAAM,MAAM,IAAI,IAAI;AAAA,IAClB,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB,CAAC;AACD,aAAW,GAAG;AACd,QAAM,oBAAoC,CAAC;AAC3C,QAAM,gBAAgB,oBAAI,IAAY;AACtC,aAAW,cAAc,cAAc,EAAE,IAAI,GAAG;AAC9C,QAAI,WAAW,SAAS,GAAG,KAAK,GAAG,UAAU,KAAK,GAAG,EAAE,EAAG;AAC1D,QAAI,eAAe,KAAM;AACzB,UAAM,SAAS,SAAS,UAAU;AAClC,QAAI,OAAO,OAAO,QAAQ,YAAY,CAAC,cAAc,IAAI,OAAO,GAAG,GAAG;AACpE,oBAAc,IAAI,OAAO,GAAG;AAC5B,wBAAkB,KAAK,MAAM;AAAA,IAC/B;AAAA,EACF;AACA,MAAI,kBAAkB,SAAS,GAAG;AAChC,QAAI,UAAU,iBAAiB;AAAA,EACjC;AACA,QAAM,YAAY,SAAS,IAAI;AAC/B,QAAM,WAAW,IAAI,QAAQ,SAAS;AACtC,IAAE,WAAW,IAAI,UAAU,QAAQ;AACnC,SAAO;AACT;AAEA,SAAS,mBAAmB,WAAuC;AACjE,QAAM,UAAU,UAAU,QAAQ,QAAQ,EAAE;AAC5C,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,aAAa,KAAK,UAAU,OAAO;AACzC,MAAI,WAAW,WAAW,IAAI,KAAK,KAAK,WAAW,UAAU,EAAG,QAAO;AACvE,SAAO;AACT;AAYA,SAAS,eAAe,QAAoC;AAC1D,QAAM,OAAO,KAAK,MAAM,KAAK,UAAU,MAAM,CAAC;AAC9C,QAAM,SAAS,OAAO,KAAK,QAAQ,WAAW,KAAK,MAAM;AACzD,QAAM,OAAO,CAAC,SAAwB;AACpC,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,iBAAW,QAAQ,KAAM,MAAK,IAAI;AAClC;AAAA,IACF;AACA,QAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AACvC,UAAM,MAAM;AACZ,QAAI,OAAO,IAAI,QAAQ,YAAY,IAAI,QAAQ,QAAQ;AACrD,aAAO,IAAI;AAAA,IACb;AACA,eAAW,SAAS,OAAO,OAAO,GAAG,EAAG,MAAK,KAAK;AAAA,EACpD;AACA,OAAK,IAAI;AACT,SAAO;AACT;AAGO,SAAS,kBAAkB,UAAkB,cAAwB;AAC1E,QAAM,IAAI,WAAW,OAAO;AAC5B,SAAO,CAAC,GAAG,EAAE,UAAU,KAAK,CAAC,EAAE,KAAK;AACtC;AAcO,SAAS,uBAAuB,UAAkB,cAAiC;AACxF,QAAM,IAAI,WAAW,OAAO;AAG5B,QAAM,WAAY,EAAE,IAAyD;AAC7E,SAAO,WAAW,OAAO,KAAK,QAAQ,IAAI,CAAC;AAC7C;AAWO,SAAS,gBAAgB,SAA0B;AACxD,MAAI;AACF,sBAAkB,OAAO;AACzB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQO,SAAS,uBAAuB,SAAwB;AAC7D,MAAI,YAAY,QAAW;AACzB,WAAO,MAAM;AAAA,EACf,OAAO;AACL,yBAAqB,iBAAiB,OAAO,CAAC;AAAA,EAChD;AACF;AAgCO,SAAS,0BAA0B,UAAkB,OAAe,UAAkB,cAAuB;AAClH,MAAI;AACF,UAAM,IAAI,WAAW,OAAO;AAC5B,UAAM,WAAW,GAAG,QAAQ;AAC5B,UAAM,OAAO,EAAE,UAAU,IAAI,QAAQ;AACrC,QAAI,CAAC,KAAM,QAAO;AAClB,QAAI,SAAS,EAAE,WAAW,IAAI,QAAQ;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,SAAS,IAAI;AACtB,QAAE,WAAW,IAAI,UAAU,MAAM;AAAA,IACnC;AACA,UAAM,QAAQ,OAAO;AACrB,WAAO,UAAU,UAAa,SAAS;AAAA,EACzC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAeO,SAAS,uBAAuB,WAAmB,YAAoB,UAAkB,cAAuB;AACrH,MAAI;AACF,UAAM,IAAI,WAAW,OAAO;AAC5B,UAAM,aAAa,mBAAmB,SAAS;AAC/C,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,WAAW,eAAe,UAAU;AAC1C,UAAM,OAAO,KAAK,KAAK,EAAE,MAAM,UAAU;AACzC,QAAI,CAAC,WAAW,IAAI,EAAG,QAAO;AAE9B,QAAI,SAAS,EAAE,WAAW,IAAI,QAAQ;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,SAAS,IAAI;AACtB,QAAE,WAAW,IAAI,UAAU,MAAM;AAAA,IACnC;AAEA,UAAM,OAAO,0BAA0B,QAAQ,UAAU;AACzD,QAAI,CAAC,QAAQ,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,SAAS,EAAG,QAAO;AAC5E,WAAO,eAAgB,KAA8B,OAAO;AAAA,EAC9D,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,0BACP,QACA,YACqC;AACrC,MAAI,UAAmB;AACvB,aAAW,OAAO,WAAW,MAAM,GAAG,GAAG;AACvC,QAAI,CAAC,WAAW,OAAO,YAAY,SAAU,QAAO;AACpD,UAAM,QAAS,QAAoC;AACnD,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,OAAO,GAAG,EAAG,QAAO;AAC9D,cAAW,MAAkC,GAAG;AAAA,EAClD;AACA,SAAO,WAAW,OAAO,YAAY,WAAY,UAAsC;AACzF;AAEA,SAAS,eAAe,OAAyB;AAC/C,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,SAAO,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AACzC;","names":["require"]}

package/dist/lib/validation/schema-validator.mjs

@@ -1,9 +1,3 @@
-import { fileURLToPath as __adcpFileURLToPath } from 'node:url';
-import { dirname as __adcpDirname } from 'node:path';
-import { createRequire as __adcpCreateRequire } from 'node:module';
-const __filename = __adcpFileURLToPath(import.meta.url);
-const __dirname = __adcpDirname(__filename);
-const require = __adcpCreateRequire(import.meta.url);
 import { getValidator, getRegisteredSchemaIds } from "./schema-loader.mjs";
 import { parseAdcpMajorVersion } from "../version.mjs";
 import { findHint } from "./hints.mjs";

package/dist/lib/validation/schema-validator.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/validation/schema-validator.ts"],"sourcesContent":["/**\n * Schema-driven validation for AdCP tool requests and responses.\n *\n * The client uses this pre-send and post-receive; the opt-in server\n * middleware uses the same core to reject drift at the dispatcher.\n */\n\nimport type { ErrorObject } from 'ajv';\nimport { getValidator, getRegisteredSchemaIds, type Direction, type ResponseVariant } from './schema-loader';\nimport { parseAdcpMajorVersion } from '../version';\nimport { findHint } from './hints';\nimport { injectLegacyEnvelopeStatus } from '../utils/envelope-status-compat';\n\n/**\n * One variant of a `oneOf` / `anyOf` that the caller's payload could have\n * matched, summarized down to what a client (human or LLM) needs to know\n * to pick one. Attached to `ValidationIssue` when `keyword` is `oneOf`\n * or `anyOf`. Omitted otherwise.\n */\nexport interface ValidationIssueVariant {\n  /** Zero-based index of the variant in the schema's `oneOf`/`anyOf` array. */\n  index: number;\n  /** Required property names on this variant (per its `required` array). */\n  required: string[];\n  /**\n   * Keys declared in the variant's `properties`. Useful for clients that\n   * want to show \"this variant accepts X, Y, Z\" without fetching the\n   * full schema. Empty if the variant doesn't declare properties.\n   */\n  properties: string[];\n}\n\n/**\n * A single validation failure with a JSON Pointer to the offending field,\n * the AJV message, and the schema path that rejected it. Mirrors the\n * format a `VALIDATION_ERROR` carries at `adcp_error.issues` (top level)\n * and `adcp_error.details.issues` (spec-convention mirror).\n */\nexport interface ValidationIssue {\n  /** RFC 6901 JSON Pointer to the offending field in the payload. */\n  pointer: string;\n  /** Human-readable message from the schema. */\n  message: string;\n  /** AJV keyword that rejected the payload (e.g., `required`, `type`). */\n  keyword: string;\n  /** Path inside the schema that rejected the payload. */\n  schemaPath: string;\n  /**\n   * `$id` of the rejecting schema. Resolved by finding the longest\n   * registered AJV `$id` that prefixes {@link schemaPath}.\n   *\n   * Bundling caveat: AdCP ships most tools through `schemas/cache/<v>/bundled/`\n   * with `$ref`s pre-resolved and inner `$id`s stripped at bundle time. For\n   * those tools, `schemaId` resolves to the response root (e.g.\n   * `/schemas/3.0.4/bundled/signals/activate-signal-response.json`), not\n   * the deeper sub-schema. Tools served from the flat tree (`governance/`,\n   * `brand/`, etc.) preserve sub-schema `$id`s, so `schemaId` can land on\n   * something deeper like `/schemas/3.0.4/core/activation-key.json`. Either\n   * way, the field names exactly the schema the validator looked at.\n   *\n   * Always projected — the `$id` is the published spec URI, not internal\n   * handler shape. (Same precedent as {@link ValidationIssue.variants} and\n   * {@link ValidationIssue.allowedValues}, both of which already ship\n   * always-on with the same rationale.)\n   *\n   * Absent only when the rejecting schema didn't declare an `$id`.\n   */\n  schemaId?: string;\n  /**\n   * Discriminator field/value pair(s) of a `oneOf`/`anyOf` that the payload\n   * was inferred to be targeting. Populated by {@link compactUnionErrors}\n   * when a const-discriminator collapse picks a \"best surviving variant\" —\n   * the variant the user matched the discriminator of but missed required\n   * fields or other constraints in. Compound discriminators like\n   * `audience-selector`'s `(type, value_type)` produce multi-entry arrays.\n   *\n   * Names align with OpenAPI 3.x `discriminator.propertyName`.\n   *\n   * Absent when no discriminator could be resolved — either the keyword\n   * isn't a union, the union has no `const`-asserting properties, or the\n   * payload didn't match any branch's discriminator (in which case the\n   * synthetic `enum`-keyword issue carries `allowedValues` instead).\n   */\n  discriminator?: ReadonlyArray<{ field: string; value: unknown }>;\n  /**\n   * Variants a caller can pick from when `keyword === 'oneOf'` or\n   * `'anyOf'`. Each entry carries the variant's required fields + known\n   * properties so a naive LLM client can recover without fetching the\n   * full schema. Absent on non-union keywords.\n   *\n   * Unlike {@link ValidationIssue.schemaPath} (which is gated behind\n   * `exposeSchemaPath` because it encodes which branch the seller's\n   * handler rejected first — an implementation detail), `variants[]`\n   * ships on the wire by default. Rationale: it reflects the PUBLIC\n   * spec's union shape, which the bundled AdCP schemas under\n   * `schemas/cache/<version>/` already make available to anyone with\n   * `@adcp/sdk` installed. Gating would hurt naive LLM clients in\n   * production — exactly the audience this field was built to help\n   * (adcp-client#919).\n   */\n  variants?: ValidationIssueVariant[];\n  /**\n   * Closed enum values the payload MUST match for `keyword: 'enum'`\n   * issues. AdCP wire schemas use enum heavily for status fields,\n   * channels, pricing models, delivery types, etc. Without this list\n   * on the wire envelope, both LLM-generated platforms and humans\n   * have to fetch the schema just to discover the allowed values —\n   * the most common self-correction failure surfaced by the Emma matrix.\n   *\n   * Absent on non-enum keywords. Always projected (not gated behind\n   * `exposeSchemaPath`) — these are PUBLIC spec values, not internal\n   * branch detail.\n   */\n  allowedValues?: readonly unknown[];\n  /**\n   * Curated one-sentence hint naming the most common adopter mistake for\n   * a recognized failure pattern (e.g. \"type='key_value' requires\n   * top-level `key` and `value` strings; do not nest under a `key_value`\n   * field\"). Sourced from {@link import('./hints').findHint} — see\n   * `validation/hints.ts` for the rule table and the\n   * empirical-evidence quality bar for adding new entries.\n   *\n   * Absent for issues that don't match a curated rule. Most issues\n   * won't have a hint, and that's fine — the structured `pointer` +\n   * `keyword` + `discriminator` + `variants` already cover the long\n   * tail. Hints are reserved for shape gotchas where the validator's\n   * raw message reads as ambiguous to a first-time adopter.\n   */\n  hint?: string;\n}\n\nexport interface ValidationOutcome {\n  valid: boolean;\n  issues: ValidationIssue[];\n  /** Which schema variant was selected — useful for logging/debugging. */\n  variant: Direction | 'skipped';\n  /**\n   * `$id` of the root validator that produced this outcome (e.g.\n   * `/schemas/3.0.4/bundled/signals/activate-signal-response.json`). Lets\n   * downstream callers suppress redundant `(schema: ...)` prose suffixes\n   * on issues that landed on the response root — typical for the bundled\n   * tree, where most issues do. Absent when no schema was applied\n   * (`variant: 'skipped'`) or the root schema didn't declare an `$id`.\n   */\n  schemaId?: string;\n  /**\n   * True when the response's `status` field named an async variant\n   * (`submitted` / `working` / `input-required`) but no compiled schema\n   * existed for that variant, so validation fell back to the sync\n   * response schema. The agent is using an async shape that this tool\n   * doesn't explicitly schema — a conformance signal the sync-fallback\n   * validation can't render by itself. Absent on normal sync or\n   * fully-schema-covered async flows.\n   */\n  variant_fallback_applied?: boolean;\n  /** Variant requested by payload shape before fallback. Set iff `variant_fallback_applied`. */\n  requested_variant?: ResponseVariant;\n}\n\nconst OK: ValidationOutcome = Object.freeze({ valid: true, issues: [], variant: 'skipped' });\n\n/**\n * Marker attached by {@link compactUnionErrors} to the residual errors of\n * the variant it picked as the best surviving branch. Carries the\n * discriminator field+value pair(s) that variant requires, so\n * {@link formatIssue} can surface the branch identifier on every issue\n * inherited from that variant. Marker key is namespaced with `__adcp_` to\n * avoid colliding with anything Ajv may add.\n */\ntype AdcpDiscriminatedError = ErrorObject & {\n  __adcp_discriminator?: ReadonlyArray<{ field: string; value: unknown }>;\n};\n\n/**\n * Find the longest registered AJV `$id` that prefixes `schemaPath` — that\n * `$id` belongs to the schema (or `$ref`'d sub-schema) responsible for the\n * failure. Returns `undefined` for inline (`#/...`) paths when the root\n * schema doesn't declare an `$id`.\n *\n * AJV 8 prefixes a `$ref`'d schema's errors with the target schema's `$id`\n * (e.g. `/schemas/3.0.4/core/activation-key.json/oneOf/1/required`), so\n * the prefix search resolves cleanly without re-traversing the schema\n * graph. The match must end at a path boundary — `'/'` or `'#'` — so an\n * `$id` ending in `.json` can't false-match a sibling whose `$id` is a\n * proper extension of it.\n */\nfunction extractSchemaId(\n  schemaPath: string,\n  rootSchema: unknown,\n  registeredIds: readonly string[]\n): string | undefined {\n  if (schemaPath.startsWith('#') || schemaPath === '') {\n    const id = (rootSchema as { $id?: unknown } | null | undefined)?.$id;\n    return typeof id === 'string' ? id : undefined;\n  }\n  // The Ajv registry includes the JSON Schema meta-schema\n  // (`http://json-schema.org/draft-07/schema`) alongside AdCP `$id`s. Ajv\n  // never emits schemaPaths prefixed with the meta-schema URL — those\n  // paths use the relative `#/...` form and take the branch above — so\n  // the meta-schema entry never false-matches here.\n  let best: string | undefined;\n  for (const id of registeredIds) {\n    if (!id) continue;\n    if (schemaPath === id || schemaPath.startsWith(`${id}/`) || schemaPath.startsWith(`${id}#`)) {\n      if (best === undefined || id.length > best.length) best = id;\n    }\n  }\n  return best;\n}\n\ninterface FormatContext {\n  rootSchema: unknown;\n  registeredIds: readonly string[];\n  /**\n   * Tool name being validated. Threaded into {@link findHint} so curated\n   * hints that gate on tool name can fire. Optional only because\n   * `validateRequest` / `validateResponse` always pass it; tests that\n   * call `formatIssue` directly are the rare exception.\n   */\n  toolName?: string;\n}\n\nfunction formatIssue(err: ErrorObject, ctx: FormatContext): ValidationIssue {\n  const instancePath = err.instancePath || '';\n  const missingProperty =\n    err.keyword === 'required' &&\n    err.params &&\n    typeof (err.params as { missingProperty?: string }).missingProperty === 'string'\n      ? `/${(err.params as { missingProperty: string }).missingProperty}`\n      : '';\n\n  // Enrich enum errors with the allowed values from AJV's params + replace\n  // the opaque \"must be equal to one of the allowed values\" message with\n  // the actual list. Without this, LLM-generated platforms can't self-\n  // correct (Emma matrix v17, 2026-04-30): the validation cascade from\n  // a single bad enum value swallows ~30 storyboard steps because no\n  // self-correction signal is available without fetching the schema.\n  const isEnum =\n    err.keyword === 'enum' &&\n    err.params != null &&\n    Array.isArray((err.params as { allowedValues?: unknown[] }).allowedValues);\n  const allowedValues = isEnum ? (err.params as { allowedValues: readonly unknown[] }).allowedValues : undefined;\n  const message = isEnum\n    ? `must be one of: ${allowedValues!.map(v => JSON.stringify(v)).join(', ')}`\n    : (err.message ?? 'validation failed');\n\n  const schemaId = extractSchemaId(err.schemaPath, ctx.rootSchema, ctx.registeredIds);\n  const discriminator = (err as AdcpDiscriminatedError).__adcp_discriminator;\n  const issue: ValidationIssue = {\n    pointer: `${instancePath}${missingProperty}` || '/',\n    message,\n    keyword: err.keyword,\n    schemaPath: err.schemaPath,\n    ...(schemaId !== undefined && { schemaId }),\n    ...(discriminator !== undefined && discriminator.length > 0 && { discriminator }),\n    ...(allowedValues !== undefined && { allowedValues }),\n  };\n  // Attach a curated `hint` last so the matcher can read every other\n  // resolved field (schemaId, discriminator, pointer, keyword) when\n  // deciding whether to fire. Most issues won't match any rule —\n  // findHint returns undefined, and the field stays absent.\n  const hint = findHint(issue, ctx.toolName);\n  if (hint !== undefined) issue.hint = hint;\n  return issue;\n}\n\n// Path segments we refuse to walk into during schema-path resolution. AJV\n// emits trusted `schemaPath` strings today, but the function is exported in\n// shape (anything in this file is reachable via the compiled JS), so any\n// future caller passing user-influenced paths can't traverse into prototype\n// chains. Bundled schemas have no use for these names either.\nconst FORBIDDEN_SCHEMA_PATH_SEGMENTS = new Set(['__proto__', 'constructor', 'prototype']);\n\n/**\n * Resolve an AJV `schemaPath` like `\"#/properties/account/oneOf\"` against\n * the compiled validator's root schema. Returns `undefined` if the path\n * doesn't land on an object. Handles URI-encoded path segments (AJV\n * escapes `~` as `~0` and `/` as `~1` per RFC 6901).\n *\n * Refuses prototype-chain segments and uses own-property indexing so a\n * future caller (or a pathological future schema) can't induce a walk\n * into `Object.prototype`.\n */\nfunction resolveSchemaPath(rootSchema: unknown, schemaPath: string): unknown {\n  if (rootSchema == null) return undefined;\n  const clean = schemaPath.replace(/^#\\/?/, '');\n  if (clean.length === 0) return rootSchema;\n  let cursor: unknown = rootSchema;\n  for (const raw of clean.split('/')) {\n    if (cursor == null || (typeof cursor !== 'object' && !Array.isArray(cursor))) return undefined;\n    const decoded = raw.replace(/~1/g, '/').replace(/~0/g, '~');\n    if (FORBIDDEN_SCHEMA_PATH_SEGMENTS.has(decoded)) return undefined;\n    if (!Object.prototype.hasOwnProperty.call(cursor, decoded)) return undefined;\n    cursor = (cursor as Record<string, unknown>)[decoded];\n  }\n  return cursor;\n}\n\n/**\n * Compact AJV's `oneOf` / `anyOf` cascades before they reach the wire.\n *\n * AJV with `allErrors: true` emits one error per non-matching variant\n * plus a synthetic \"must match exactly one schema\" root. For a 9-way\n * `pricing_options` union with a single bad `pricing_model` value that\n * is 14+ errors per failed item, drowning real residual errors elsewhere\n * in the same payload (adcontextprotocol/adcp-client#1111).\n *\n * Strategy:\n *  1. For each union root, group variant errors by variant index.\n *  2. Inspect each variant's schema for `const`-constrained properties.\n *     A property where ≥2 variants assert `const` at the same path is a\n *     candidate discriminator (covers single-field discriminators like\n *     `pricing_model` and composite ones like `audience-selector`'s\n *     `(type, value_type)`).\n *  3. Collapse a candidate path iff EVERY variant that asserts `const`\n *     there emitted a `const` error. (If some variants silently passed,\n *     the user's value matched some allowed const — collapsing would\n *     hide that and tell them their valid value was wrong.)\n *  4. Each collapse becomes a synthetic `enum`-keyword issue carrying\n *     the union of allowed const values; the existing `formatIssue`\n *     enrichment then renders \"must be one of: A, B, ...\".\n *  5. After collapse, if any variant has zero residual errors, the\n *     discriminator collapse fully explains the failure — drop the\n *     synthetic union root and the residuals from the other variants.\n *  6. Otherwise pick the variant with the fewest residual errors,\n *     tie-breaking by fewest residual `const` errors so a variant the\n *     user's discriminator value satisfied wins over a sibling whose\n *     discriminator they violated. Drop the rest.\n */\nfunction compactUnionErrors(errors: readonly ErrorObject[], rootSchema: unknown): ErrorObject[] {\n  if (errors.length === 0) return [...errors];\n\n  // Pre-bucket once so each error is scanned a constant number of times even\n  // when a malicious or pathological payload pushes Ajv to emit thousands of\n  // errors across many union failures. The naive `for root in unionRoots: for\n  // e in errors` form is O(U·N) — at K=100 product items each producing a\n  // 14-error pricing-options cascade that's ~140k iterations on the\n  // request-validation hot path.\n  const errorsByOneOfPath = new Map<string, ErrorObject[]>();\n  for (const e of errors) {\n    const m = e.schemaPath.match(/^(.*\\/(?:oneOf|anyOf))\\/\\d+(?:\\/|$)/);\n    if (!m) continue;\n    const root = m[1]!;\n    const bucket = errorsByOneOfPath.get(root);\n    if (bucket) bucket.push(e);\n    else errorsByOneOfPath.set(root, [e]);\n  }\n\n  const dropped = new Set<ErrorObject>();\n  const added: ErrorObject[] = [];\n\n  // Deepest-first ordering matters for nested unions: by the time the outer\n  // root is evaluated, the inner cascade has already been replaced by a\n  // synthetic enum at a `<...>/discriminator/<field>` schemaPath that won't\n  // match the outer's `oneOfPath + '/'` prefix and stays independent.\n  const unionRoots = errors\n    .filter(e => e.keyword === 'oneOf' || e.keyword === 'anyOf')\n    .slice()\n    .sort((a, b) => b.schemaPath.length - a.schemaPath.length);\n\n  for (const root of unionRoots) {\n    if (dropped.has(root)) continue;\n    const oneOfPath = root.schemaPath;\n    const rootInstance = root.instancePath;\n\n    // Variant errors: pulled from the prebuilt index (constant per-error work\n    // above), then grouped by variant index. instancePath scoping keeps two\n    // separate union failures sharing the same `schemaPath` but different\n    // instancePaths — e.g., `products[0].pricing_options[0]` and\n    // `products[1]...` — independent.\n    const candidateErrors = errorsByOneOfPath.get(oneOfPath) ?? [];\n    const byVariant = new Map<number, ErrorObject[]>();\n    for (const e of candidateErrors) {\n      if (e === root || dropped.has(e)) continue;\n      const tail = e.schemaPath.slice(oneOfPath.length + 1);\n      const m = tail.match(/^(\\d+)(?:\\/|$)/);\n      if (!m) continue;\n      if (e.instancePath !== rootInstance && !e.instancePath.startsWith(rootInstance + '/')) continue;\n      const idx = parseInt(m[1]!, 10);\n      const bucket = byVariant.get(idx);\n      if (bucket) bucket.push(e);\n      else byVariant.set(idx, [e]);\n    }\n    if (byVariant.size === 0) continue;\n\n    // Resolve the variant schema array. Without it we fall back to a pure\n    // error-shape collapse (still correct, just less precise on which\n    // variants asserted const where the user happened to match).\n    const variantSchemas = resolveSchemaPath(rootSchema, oneOfPath);\n    const variantArr: readonly unknown[] = Array.isArray(variantSchemas) ? variantSchemas : [];\n\n    // For each top-level property in each variant, record which variants\n    // declare a `const` value there. Top-level only — composite\n    // discriminators in AdCP (`audience-selector`, pricing-option) all\n    // sit at the variant root.\n    const constAsserters = new Map<string, Map<number, unknown>>();\n    for (let i = 0; i < variantArr.length; i++) {\n      const variant = variantArr[i];\n      if (!variant || typeof variant !== 'object') continue;\n      const props = (variant as { properties?: unknown }).properties;\n      if (!props || typeof props !== 'object') continue;\n      for (const [key, prop] of Object.entries(props as Record<string, unknown>)) {\n        if (prop && typeof prop === 'object' && 'const' in prop) {\n          const path = `/${key.replace(/~/g, '~0').replace(/\\//g, '~1')}`;\n          let m = constAsserters.get(path);\n          if (!m) constAsserters.set(path, (m = new Map()));\n          m.set(i, (prop as { const: unknown }).const);\n        }\n      }\n    }\n\n    // For each candidate path with ≥2 asserters, did every asserter emit?\n    const collapsedPaths = new Set<string>();\n    for (const [relPath, asserters] of constAsserters) {\n      if (asserters.size < 2) continue;\n      const absolutePath = rootInstance + relPath;\n      const emittersByVariant = new Map<number, ErrorObject>();\n      for (const [idx, errs] of byVariant) {\n        for (const e of errs) {\n          if (e.keyword === 'const' && e.instancePath === absolutePath) {\n            emittersByVariant.set(idx, e);\n            break;\n          }\n        }\n      }\n      let allEmitted = true;\n      for (const idx of asserters.keys()) {\n        if (!emittersByVariant.has(idx)) {\n          allEmitted = false;\n          break;\n        }\n      }\n      if (!allEmitted) continue;\n\n      const allowedValues: unknown[] = [];\n      for (const v of asserters.values()) {\n        const already = allowedValues.some(existing => existing === v);\n        if (!already) allowedValues.push(v);\n      }\n      const sample = emittersByVariant.values().next().value as ErrorObject;\n      // Synthetic enum issue. `schemaPath: ''` keeps it out of any caller\n      // that walks the path back to a real schema location (the synthesized\n      // `<oneOfPath>/discriminator/<field>` would dangle if dereferenced)\n      // while still satisfying the wire shape — the response-side errors\n      // helper already gates `schemaPath` exposure via `exposeSchemaPath`.\n      // `JSON.stringify` on the const values is safe: they come from the\n      // bundled (trusted) schema and the outer wire envelope re-encodes\n      // anyway, so control characters or quotes can't break framing.\n      added.push({\n        ...sample,\n        keyword: 'enum',\n        schemaPath: '',\n        message: `must be one of: ${allowedValues.map(v => JSON.stringify(v)).join(', ')}`,\n        params: { allowedValues },\n      } as ErrorObject);\n      for (const e of emittersByVariant.values()) dropped.add(e);\n      collapsedPaths.add(absolutePath);\n    }\n\n    // Compute residuals after the collapse.\n    const residualByVariant = new Map<number, ErrorObject[]>();\n    for (const [idx, errs] of byVariant) {\n      residualByVariant.set(\n        idx,\n        errs.filter(e => !dropped.has(e))\n      );\n    }\n\n    if (collapsedPaths.size > 0) {\n      const anyZeroResidual = [...residualByVariant.values()].some(r => r.length === 0);\n      if (anyZeroResidual) {\n        for (const errs of residualByVariant.values()) for (const e of errs) dropped.add(e);\n        dropped.add(root);\n        continue;\n      }\n    }\n\n    // Variants with a `not` keyword failure are excluded from candidacy:\n    // the payload populates fields the variant forbids by design (e.g. an\n    // Error variant whose `not` clause rejects payloads that carry the\n    // Success variant's `account` / `currency` / `period` fields). The\n    // adopter's actionable lever is the OTHER variant's residuals (missing\n    // required fields they need to add) — surfacing the `not` failure\n    // points at a path the adopter shouldn't take. See adcp-client#1337.\n    //\n    // **Spec assumption.** AdCP 3.x uses `not` only as an envelope-level\n    // mutual-exclusion guard between Success ↔ Error arms of a response\n    // oneOf — never as an intra-arm discriminator (those use `const` on a\n    // tag field, e.g. async `status: 'submitted' | 'working' | ...`).\n    // The exclusion logic here targets that dominant pattern. If a future\n    // spec ever inverts the convention (a Success arm using `not` to\n    // discriminate sub-variants), this heuristic would suppress an\n    // actionable diagnostic — re-evaluate the assumption when adopting\n    // any AdCP version that does so.\n    //\n    // If every variant has a `not` failure, fall back to the unconstrained\n    // pick — preserves diagnostic on contrived schemas where mutual-\n    // exclusion is the only signal.\n    const variantsWithNotFailure = new Set<number>();\n    for (const [idx, errs] of byVariant) {\n      for (const e of errs) {\n        if (e.keyword === 'not') {\n          variantsWithNotFailure.add(idx);\n          break;\n        }\n      }\n    }\n    const allVariantsHaveNot = variantsWithNotFailure.size === byVariant.size && byVariant.size > 0;\n\n    // Pick the best surviving variant; prefer fewest residuals, tie-break\n    // by fewest residual `const` errors (so variants whose discriminator\n    // the user actually picked win over siblings whose discriminator they\n    // violated). Excluded variants (mutual-exclusion `not` rejections) are\n    // skipped unless all variants are excluded.\n    let bestIdx = -1;\n    let bestCount = Infinity;\n    let bestConsts = Infinity;\n    for (const [idx, residual] of residualByVariant) {\n      if (!allVariantsHaveNot && variantsWithNotFailure.has(idx)) continue;\n      const constCount = residual.reduce((n, e) => (e.keyword === 'const' ? n + 1 : n), 0);\n      if (residual.length < bestCount || (residual.length === bestCount && constCount < bestConsts)) {\n        bestIdx = idx;\n        bestCount = residual.length;\n        bestConsts = constCount;\n      }\n    }\n    for (const [idx, residual] of residualByVariant) {\n      if (idx !== bestIdx) for (const e of residual) dropped.add(e);\n    }\n\n    // Tag the surviving variant's residuals with the discriminator\n    // field+value pair(s) it requires. Adopters reading the projected\n    // issue see \"branch: type='key_value'\" alongside the missing-required\n    // error, so they know which branch the seller's payload was inferred\n    // to be targeting (issue #1283). Compound discriminators (e.g.,\n    // `audience-selector`'s (type, value_type)) become multi-entry\n    // arrays — order follows iteration of `constAsserters`, which mirrors\n    // the variant's `properties` declaration order.\n    if (bestIdx >= 0) {\n      const pairs: Array<{ field: string; value: unknown }> = [];\n      for (const [relPath, asserters] of constAsserters) {\n        const constValue = asserters.get(bestIdx);\n        if (constValue === undefined) continue;\n        const field = relPath.startsWith('/') ? relPath.slice(1) : relPath;\n        pairs.push({ field, value: constValue });\n      }\n      if (pairs.length > 0) {\n        const surviving = residualByVariant.get(bestIdx) ?? [];\n        for (const e of surviving) {\n          // Deepest-first ordering means inner unions tag first; if a\n          // residual is already tagged it carries the more specific\n          // (deeper) discriminator, which is what the adopter needs to\n          // fix. Don't clobber it with the outer union's tag — the outer\n          // discriminator is context, not the actionable lever.\n          // Bucketing-by-deepest-prefix in `errorsByOneOfPath` already\n          // protects most leaf errors from entering this loop, but the\n          // explicit guard makes the invariant resilient to future\n          // changes in that bucket scheme.\n          if ((e as AdcpDiscriminatedError).__adcp_discriminator !== undefined) continue;\n          (e as AdcpDiscriminatedError).__adcp_discriminator = pairs;\n        }\n      }\n    }\n  }\n\n  return [...errors.filter(e => !dropped.has(e)), ...added];\n}\n\n/**\n * When an AJV error has `keyword: 'oneOf' | 'anyOf'`, resolve the\n * schema's variant array and summarize each variant so a client can\n * pick one without fetching the full schema. See {@link ValidationIssueVariant}.\n * Returns the issue unchanged when the keyword doesn't match or the\n * resolution fails (e.g. the variant list is inlined in an unexpected\n * way).\n */\nfunction enrichWithVariants(issue: ValidationIssue, rootSchema: unknown): ValidationIssue {\n  if (issue.keyword !== 'oneOf' && issue.keyword !== 'anyOf') return issue;\n  const resolved = resolveSchemaPath(rootSchema, issue.schemaPath);\n  if (!Array.isArray(resolved)) return issue;\n  const variants: ValidationIssueVariant[] = resolved.map((variant: unknown, index: number) => {\n    if (variant == null || typeof variant !== 'object') {\n      return { index, required: [], properties: [] };\n    }\n    const v = variant as Record<string, unknown>;\n    const required = Array.isArray(v.required) ? (v.required.filter(r => typeof r === 'string') as string[]) : [];\n    const properties =\n      v.properties != null && typeof v.properties === 'object' ? Object.keys(v.properties as object) : [];\n    return { index, required, properties };\n  });\n  return { ...issue, variants };\n}\n\n/**\n * Validate an outgoing request against `{tool}-request.json`.\n *\n * `version` selects which AdCP version's schema bundle to validate against;\n * defaults to the SDK-pinned `ADCP_VERSION`. Pass the per-instance value\n * from `getAdcpVersion()` to validate against a pinned-version client/server's\n * schema.\n */\nexport function validateRequest(toolName: string, payload: unknown, version?: string): ValidationOutcome {\n  const validator = getValidator(toolName, 'request', version);\n  if (!validator) return OK;\n  const valid = validator(payload) as boolean;\n  const rootSchema = (validator as { schema?: unknown }).schema;\n  const rootSchemaId =\n    rootSchema && typeof rootSchema === 'object' && typeof (rootSchema as { $id?: unknown }).$id === 'string'\n      ? ((rootSchema as { $id: string }).$id as string)\n      : undefined;\n  if (valid) return { valid: true, issues: [], variant: 'request', ...(rootSchemaId && { schemaId: rootSchemaId }) };\n  const registeredIds = getRegisteredSchemaIds(version);\n  const ctx: FormatContext = { rootSchema, registeredIds, toolName };\n  const compacted = compactUnionErrors(validator.errors ?? [], rootSchema);\n  return {\n    valid: false,\n    issues: compacted.map(e => formatIssue(e, ctx)).map(i => enrichWithVariants(i, rootSchema)),\n    variant: 'request',\n    ...(rootSchemaId && { schemaId: rootSchemaId }),\n  };\n}\n\n/**\n * Strip top-level optional fields whose value is `null` but whose declared\n * schema type is not nullable (`type` does not include `'null'`).\n *\n * Applies only when validating against a v2.x schema bundle. v2.5 sellers\n * (Pydantic-origin) commonly emit `errors: null`, `context: null`, `ext: null`\n * to signal \"nothing here\" rather than omitting the key. The v2.5 schemas\n * don't include `null` in those types, so Ajv spuriously rejects them.\n *\n * Gated to v2.x only — in v3, `errors` is a required field on failure\n * branches, and silently stripping it across all versions would mask real\n * bugs in v3 seller responses.\n *\n * Returns a shallow clone with the offending keys removed, or the original\n * object unchanged if nothing was stripped. Safe to pass to an Ajv validator:\n * Ajv 8 (without `removeAdditional`/`useDefaults`/`coerceTypes`) does not\n * mutate its input.\n */\nfunction stripEnvelopeNulls(payload: unknown, schema: unknown): unknown {\n  if (payload == null || typeof payload !== 'object' || Array.isArray(payload)) return payload;\n  const s = schema as Record<string, unknown> | null;\n  if (!s) return payload;\n  const properties = s.properties as Record<string, unknown> | undefined;\n  if (!properties) return payload;\n  const required = new Set<string>(Array.isArray(s.required) ? (s.required as string[]) : []);\n  const payloadObj = payload as Record<string, unknown>;\n  let cloned: Record<string, unknown> | null = null;\n  for (const [key, value] of Object.entries(payloadObj)) {\n    if (value !== null) continue;\n    if (required.has(key)) continue;\n    const propSchema = properties[key] as Record<string, unknown> | undefined;\n    if (!propSchema) continue;\n    const type = propSchema.type;\n    const isNullable = type === 'null' || (Array.isArray(type) && (type as string[]).includes('null'));\n    if (!isNullable) {\n      if (!cloned) cloned = { ...payloadObj };\n      delete cloned[key];\n    }\n  }\n  return cloned ?? payload;\n}\n\n/**\n * Select the response variant by payload shape (per issue #688: choose by\n * `status` field, not just the tool name). Matches the AdCP 3.0 async\n * contract: `submitted`, `working`, `input-required`, and the sync\n * terminal states (`completed` / no status).\n */\nfunction selectResponseVariant(payload: unknown): ResponseVariant {\n  if (payload && typeof payload === 'object' && 'status' in (payload as Record<string, unknown>)) {\n    const status = (payload as Record<string, unknown>).status;\n    if (status === 'submitted') return 'submitted';\n    if (status === 'working') return 'working';\n    if (status === 'input-required') return 'input-required';\n  }\n  return 'sync';\n}\n\n/**\n * Validate an incoming response; picks the async variant by payload shape.\n *\n * `version` selects which AdCP version's schema bundle to validate against;\n * defaults to the SDK-pinned `ADCP_VERSION`. See {@link validateRequest} for\n * the per-instance use case.\n */\nexport function validateResponse(toolName: string, payload: unknown, version?: string): ValidationOutcome {\n  // 3.0.x back-compat: synthesize envelope `status` when the payload\n  // declares itself as 3.0.x (or carries no version field at all). 3.1+\n  // payloads remain unchanged so the strict validator still rejects a\n  // 3.1 peer that omits `status`. Applied before variant selection so a\n  // synthesized `completed` doesn't get misrouted to the async-variant\n  // schema. See `utils/envelope-status-compat.ts`.\n  const compatPayload =\n    payload && typeof payload === 'object' && !Array.isArray(payload)\n      ? injectLegacyEnvelopeStatus(payload as Record<string, unknown>, { toolName })\n      : payload;\n  const variant = selectResponseVariant(compatPayload);\n  const validator = getValidator(toolName, variant, version);\n  // If an async variant schema is missing, fall back to the sync one —\n  // some tools declare `-response.json` only and use `status` as an\n  // in-band marker without a dedicated variant schema.\n  const effective = validator ?? (variant !== 'sync' ? getValidator(toolName, 'sync', version) : undefined);\n  if (!effective) return OK;\n  const rootSchema = (effective as { schema?: unknown }).schema;\n  // v2.x sellers (Pydantic-origin) emit optional envelope fields as null instead\n  // of omitting them. Strip before Ajv to avoid spurious type errors on `errors`,\n  // `context`, and `ext`. Gated to v2.x only — see stripEnvelopeNulls JSDoc.\n  const isV2Bundle = version != null && parseAdcpMajorVersion(version) === 2;\n  const normalizedPayload = isV2Bundle ? stripEnvelopeNulls(compatPayload, rootSchema) : compatPayload;\n  const valid = effective(normalizedPayload) as boolean;\n  const usedVariant: Direction = validator ? variant : 'sync';\n  const variantFallback = !validator && variant !== 'sync';\n  const fallbackFields: Pick<ValidationOutcome, 'variant_fallback_applied' | 'requested_variant'> = variantFallback\n    ? { variant_fallback_applied: true, requested_variant: variant }\n    : {};\n  const rootSchemaId =\n    rootSchema && typeof rootSchema === 'object' && typeof (rootSchema as { $id?: unknown }).$id === 'string'\n      ? ((rootSchema as { $id: string }).$id as string)\n      : undefined;\n  if (valid) {\n    return {\n      valid: true,\n      issues: [],\n      variant: usedVariant,\n      ...(rootSchemaId && { schemaId: rootSchemaId }),\n      ...fallbackFields,\n    };\n  }\n  const registeredIds = getRegisteredSchemaIds(version);\n  const ctx: FormatContext = { rootSchema, registeredIds, toolName };\n  const compacted = compactUnionErrors(effective.errors ?? [], rootSchema);\n  return {\n    valid: false,\n    issues: compacted.map(e => formatIssue(e, ctx)).map(i => enrichWithVariants(i, rootSchema)),\n    variant: usedVariant,\n    ...(rootSchemaId && { schemaId: rootSchemaId }),\n    ...fallbackFields,\n  };\n}\n\n/**\n * Render `discriminator[]` as `field='value', other='x'`. Strings are\n * single-quoted (matches the issue #1283 example shape) with embedded\n * apostrophes backslash-escaped so a future spec const containing `'`\n * can't produce ambiguous output. Other JSON-safe values use\n * `JSON.stringify` so booleans and numbers stay unambiguous. Returns an\n * empty string when the array is empty so callers can compose\n * conditionally.\n */\nexport function formatDiscriminator(\n  discriminator: ReadonlyArray<{ field: string; value: unknown }> | undefined\n): string {\n  if (!discriminator || discriminator.length === 0) return '';\n  return discriminator\n    .map(({ field, value }) => {\n      if (typeof value !== 'string') return `${field}=${JSON.stringify(value)}`;\n      const escaped = value.replace(/\\\\/g, '\\\\\\\\').replace(/'/g, \"\\\\'\");\n      return `${field}='${escaped}'`;\n    })\n    .join(', ');\n}\n\n/**\n * One-line render of a validation issue with `(schema: <$id>)`,\n * `(discriminator: <field>='<value>')`, and `(hint: …)` suffixes when\n * the issue carries them. Used by both {@link formatIssues} and the\n * prose `message` field on `VALIDATION_ERROR` envelopes (issue #1283\n * for schema/discriminator, #1309 for hint), so adopters debugging from\n * the wire envelope alone see the rejecting schema, union discriminator,\n * and curated mistake-recipe without having to walk `issues[]`.\n *\n * The `(schema: ...)` suffix is suppressed for inline failures whose\n * `schemaId` is the response root — the tool name already conveys that,\n * and AdCP's bundled tree strips inner `$id`s so most issues land on the\n * root. Suppressing keeps the prose tight on the cases where the schema\n * field would just restate the tool the adopter already knows. Adopters\n * who want the field unconditionally read it from the structured\n * `issues[].schemaId`.\n */\nexport function formatIssueLine(issue: ValidationIssue, options: { rootSchemaId?: string } = {}): string {\n  const parts: string[] = [`${issue.pointer} ${issue.message}`];\n  if (issue.schemaId && issue.schemaId !== options.rootSchemaId) {\n    parts.push(`(schema: ${issue.schemaId})`);\n  }\n  const discriminator = formatDiscriminator(issue.discriminator);\n  if (discriminator) parts.push(`(discriminator: ${discriminator})`);\n  if (issue.hint) parts.push(`(hint: ${issue.hint})`);\n  return parts.join(' ');\n}\n\n/**\n * Render a compact one-line summary of the failures — useful for logs.\n *\n * `rootSchemaId`, when supplied, suppresses the `(schema: ...)` suffix on\n * issues whose `schemaId` matches it (typical for issues that landed on\n * the response root). Pass `undefined` to always emit the suffix.\n */\nexport function formatIssues(issues: ValidationIssue[], limit = 3, options: { rootSchemaId?: string } = {}): string {\n  const head = issues\n    .slice(0, limit)\n    .map(i => formatIssueLine(i, options))\n    .join('; ');\n  const rest = issues.length - limit;\n  return rest > 0 ? `${head} (+${rest} more)` : head;\n}\n"],"mappings":";;;;;;AAQA,SAAS,cAAc,8BAAoE;AAC3F,SAAS,6BAA6B;AACtC,SAAS,gBAAgB;AACzB,SAAS,kCAAkC;AAoJ3C,MAAM,KAAwB,OAAO,OAAO,EAAE,OAAO,MAAM,QAAQ,CAAC,GAAG,SAAS,UAAU,CAAC;AA2B3F,SAAS,gBACP,YACA,YACA,eACoB;AACpB,MAAI,WAAW,WAAW,GAAG,KAAK,eAAe,IAAI;AACnD,UAAM,KAAM,YAAqD;AACjE,WAAO,OAAO,OAAO,WAAW,KAAK;AAAA,EACvC;AAMA,MAAI;AACJ,aAAW,MAAM,eAAe;AAC9B,QAAI,CAAC,GAAI;AACT,QAAI,eAAe,MAAM,WAAW,WAAW,GAAG,EAAE,GAAG,KAAK,WAAW,WAAW,GAAG,EAAE,GAAG,GAAG;AAC3F,UAAI,SAAS,UAAa,GAAG,SAAS,KAAK,OAAQ,QAAO;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAcA,SAAS,YAAY,KAAkB,KAAqC;AAC1E,QAAM,eAAe,IAAI,gBAAgB;AACzC,QAAM,kBACJ,IAAI,YAAY,cAChB,IAAI,UACJ,OAAQ,IAAI,OAAwC,oBAAoB,WACpE,IAAK,IAAI,OAAuC,eAAe,KAC/D;AAQN,QAAM,SACJ,IAAI,YAAY,UAChB,IAAI,UAAU,QACd,MAAM,QAAS,IAAI,OAAyC,aAAa;AAC3E,QAAM,gBAAgB,SAAU,IAAI,OAAiD,gBAAgB;AACrG,QAAM,UAAU,SACZ,mBAAmB,cAAe,IAAI,OAAK,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,KACvE,IAAI,WAAW;AAEpB,QAAM,WAAW,gBAAgB,IAAI,YAAY,IAAI,YAAY,IAAI,aAAa;AAClF,QAAM,gBAAiB,IAA+B;AACtD,QAAM,QAAyB;AAAA,IAC7B,SAAS,GAAG,YAAY,GAAG,eAAe,MAAM;AAAA,IAChD;AAAA,IACA,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,GAAI,aAAa,UAAa,EAAE,SAAS;AAAA,IACzC,GAAI,kBAAkB,UAAa,cAAc,SAAS,KAAK,EAAE,cAAc;AAAA,IAC/E,GAAI,kBAAkB,UAAa,EAAE,cAAc;AAAA,EACrD;AAKA,QAAM,OAAO,SAAS,OAAO,IAAI,QAAQ;AACzC,MAAI,SAAS,OAAW,OAAM,OAAO;AACrC,SAAO;AACT;AAOA,MAAM,iCAAiC,oBAAI,IAAI,CAAC,aAAa,eAAe,WAAW,CAAC;AAYxF,SAAS,kBAAkB,YAAqB,YAA6B;AAC3E,MAAI,cAAc,KAAM,QAAO;AAC/B,QAAM,QAAQ,WAAW,QAAQ,SAAS,EAAE;AAC5C,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,MAAI,SAAkB;AACtB,aAAW,OAAO,MAAM,MAAM,GAAG,GAAG;AAClC,QAAI,UAAU,QAAS,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,EAAI,QAAO;AACrF,UAAM,UAAU,IAAI,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC1D,QAAI,+BAA+B,IAAI,OAAO,EAAG,QAAO;AACxD,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,OAAO,EAAG,QAAO;AACnE,aAAU,OAAmC,OAAO;AAAA,EACtD;AACA,SAAO;AACT;AAiCA,SAAS,mBAAmB,QAAgC,YAAoC;AAC9F,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC,GAAG,MAAM;AAQ1C,QAAM,oBAAoB,oBAAI,IAA2B;AACzD,aAAW,KAAK,QAAQ;AACtB,UAAM,IAAI,EAAE,WAAW,MAAM,qCAAqC;AAClE,QAAI,CAAC,EAAG;AACR,UAAM,OAAO,EAAE,CAAC;AAChB,UAAM,SAAS,kBAAkB,IAAI,IAAI;AACzC,QAAI,OAAQ,QAAO,KAAK,CAAC;AAAA,QACpB,mBAAkB,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,EACtC;AAEA,QAAM,UAAU,oBAAI,IAAiB;AACrC,QAAM,QAAuB,CAAC;AAM9B,QAAM,aAAa,OAChB,OAAO,OAAK,EAAE,YAAY,WAAW,EAAE,YAAY,OAAO,EAC1D,MAAM,EACN,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,SAAS,EAAE,WAAW,MAAM;AAE3D,aAAW,QAAQ,YAAY;AAC7B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,UAAM,YAAY,KAAK;AACvB,UAAM,eAAe,KAAK;AAO1B,UAAM,kBAAkB,kBAAkB,IAAI,SAAS,KAAK,CAAC;AAC7D,UAAM,YAAY,oBAAI,IAA2B;AACjD,eAAW,KAAK,iBAAiB;AAC/B,UAAI,MAAM,QAAQ,QAAQ,IAAI,CAAC,EAAG;AAClC,YAAM,OAAO,EAAE,WAAW,MAAM,UAAU,SAAS,CAAC;AACpD,YAAM,IAAI,KAAK,MAAM,gBAAgB;AACrC,UAAI,CAAC,EAAG;AACR,UAAI,EAAE,iBAAiB,gBAAgB,CAAC,EAAE,aAAa,WAAW,eAAe,GAAG,EAAG;AACvF,YAAM,MAAM,SAAS,EAAE,CAAC,GAAI,EAAE;AAC9B,YAAM,SAAS,UAAU,IAAI,GAAG;AAChC,UAAI,OAAQ,QAAO,KAAK,CAAC;AAAA,UACpB,WAAU,IAAI,KAAK,CAAC,CAAC,CAAC;AAAA,IAC7B;AACA,QAAI,UAAU,SAAS,EAAG;AAK1B,UAAM,iBAAiB,kBAAkB,YAAY,SAAS;AAC9D,UAAM,aAAiC,MAAM,QAAQ,cAAc,IAAI,iBAAiB,CAAC;AAMzF,UAAM,iBAAiB,oBAAI,IAAkC;AAC7D,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,UAAU,WAAW,CAAC;AAC5B,UAAI,CAAC,WAAW,OAAO,YAAY,SAAU;AAC7C,YAAM,QAAS,QAAqC;AACpD,UAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,iBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,KAAgC,GAAG;AAC1E,YAAI,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM;AACvD,gBAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI,CAAC;AAC7D,cAAI,IAAI,eAAe,IAAI,IAAI;AAC/B,cAAI,CAAC,EAAG,gBAAe,IAAI,MAAO,IAAI,oBAAI,IAAI,CAAE;AAChD,YAAE,IAAI,GAAI,KAA4B,KAAK;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAGA,UAAM,iBAAiB,oBAAI,IAAY;AACvC,eAAW,CAAC,SAAS,SAAS,KAAK,gBAAgB;AACjD,UAAI,UAAU,OAAO,EAAG;AACxB,YAAM,eAAe,eAAe;AACpC,YAAM,oBAAoB,oBAAI,IAAyB;AACvD,iBAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,mBAAW,KAAK,MAAM;AACpB,cAAI,EAAE,YAAY,WAAW,EAAE,iBAAiB,cAAc;AAC5D,8BAAkB,IAAI,KAAK,CAAC;AAC5B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,aAAa;AACjB,iBAAW,OAAO,UAAU,KAAK,GAAG;AAClC,YAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;AAC/B,uBAAa;AACb;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,WAAY;AAEjB,YAAM,gBAA2B,CAAC;AAClC,iBAAW,KAAK,UAAU,OAAO,GAAG;AAClC,cAAM,UAAU,cAAc,KAAK,cAAY,aAAa,CAAC;AAC7D,YAAI,CAAC,QAAS,eAAc,KAAK,CAAC;AAAA,MACpC;AACA,YAAM,SAAS,kBAAkB,OAAO,EAAE,KAAK,EAAE;AASjD,YAAM,KAAK;AAAA,QACT,GAAG;AAAA,QACH,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,SAAS,mBAAmB,cAAc,IAAI,OAAK,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,QAChF,QAAQ,EAAE,cAAc;AAAA,MAC1B,CAAgB;AAChB,iBAAW,KAAK,kBAAkB,OAAO,EAAG,SAAQ,IAAI,CAAC;AACzD,qBAAe,IAAI,YAAY;AAAA,IACjC;AAGA,UAAM,oBAAoB,oBAAI,IAA2B;AACzD,eAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,wBAAkB;AAAA,QAChB;AAAA,QACA,KAAK,OAAO,OAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClC;AAAA,IACF;AAEA,QAAI,eAAe,OAAO,GAAG;AAC3B,YAAM,kBAAkB,CAAC,GAAG,kBAAkB,OAAO,CAAC,EAAE,KAAK,OAAK,EAAE,WAAW,CAAC;AAChF,UAAI,iBAAiB;AACnB,mBAAW,QAAQ,kBAAkB,OAAO,EAAG,YAAW,KAAK,KAAM,SAAQ,IAAI,CAAC;AAClF,gBAAQ,IAAI,IAAI;AAChB;AAAA,MACF;AAAA,IACF;AAuBA,UAAM,yBAAyB,oBAAI,IAAY;AAC/C,eAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,iBAAW,KAAK,MAAM;AACpB,YAAI,EAAE,YAAY,OAAO;AACvB,iCAAuB,IAAI,GAAG;AAC9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,qBAAqB,uBAAuB,SAAS,UAAU,QAAQ,UAAU,OAAO;AAO9F,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,QAAI,aAAa;AACjB,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAmB;AAC/C,UAAI,CAAC,sBAAsB,uBAAuB,IAAI,GAAG,EAAG;AAC5D,YAAM,aAAa,SAAS,OAAO,CAAC,GAAG,MAAO,EAAE,YAAY,UAAU,IAAI,IAAI,GAAI,CAAC;AACnF,UAAI,SAAS,SAAS,aAAc,SAAS,WAAW,aAAa,aAAa,YAAa;AAC7F,kBAAU;AACV,oBAAY,SAAS;AACrB,qBAAa;AAAA,MACf;AAAA,IACF;AACA,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAmB;AAC/C,UAAI,QAAQ,QAAS,YAAW,KAAK,SAAU,SAAQ,IAAI,CAAC;AAAA,IAC9D;AAUA,QAAI,WAAW,GAAG;AAChB,YAAM,QAAkD,CAAC;AACzD,iBAAW,CAAC,SAAS,SAAS,KAAK,gBAAgB;AACjD,cAAM,aAAa,UAAU,IAAI,OAAO;AACxC,YAAI,eAAe,OAAW;AAC9B,cAAM,QAAQ,QAAQ,WAAW,GAAG,IAAI,QAAQ,MAAM,CAAC,IAAI;AAC3D,cAAM,KAAK,EAAE,OAAO,OAAO,WAAW,CAAC;AAAA,MACzC;AACA,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM,YAAY,kBAAkB,IAAI,OAAO,KAAK,CAAC;AACrD,mBAAW,KAAK,WAAW;AAUzB,cAAK,EAA6B,yBAAyB,OAAW;AACtE,UAAC,EAA6B,uBAAuB;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,OAAO,OAAO,OAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,GAAG,KAAK;AAC1D;AAUA,SAAS,mBAAmB,OAAwB,YAAsC;AACxF,MAAI,MAAM,YAAY,WAAW,MAAM,YAAY,QAAS,QAAO;AACnE,QAAM,WAAW,kBAAkB,YAAY,MAAM,UAAU;AAC/D,MAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG,QAAO;AACrC,QAAM,WAAqC,SAAS,IAAI,CAAC,SAAkB,UAAkB;AAC3F,QAAI,WAAW,QAAQ,OAAO,YAAY,UAAU;AAClD,aAAO,EAAE,OAAO,UAAU,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,IAC/C;AACA,UAAM,IAAI;AACV,UAAM,WAAW,MAAM,QAAQ,EAAE,QAAQ,IAAK,EAAE,SAAS,OAAO,OAAK,OAAO,MAAM,QAAQ,IAAiB,CAAC;AAC5G,UAAM,aACJ,EAAE,cAAc,QAAQ,OAAO,EAAE,eAAe,WAAW,OAAO,KAAK,EAAE,UAAoB,IAAI,CAAC;AACpG,WAAO,EAAE,OAAO,UAAU,WAAW;AAAA,EACvC,CAAC;AACD,SAAO,EAAE,GAAG,OAAO,SAAS;AAC9B;AAUO,SAAS,gBAAgB,UAAkB,SAAkB,SAAqC;AACvG,QAAM,YAAY,aAAa,UAAU,WAAW,OAAO;AAC3D,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,QAAQ,UAAU,OAAO;AAC/B,QAAM,aAAc,UAAmC;AACvD,QAAM,eACJ,cAAc,OAAO,eAAe,YAAY,OAAQ,WAAiC,QAAQ,WAC3F,WAA+B,MACjC;AACN,MAAI,MAAO,QAAO,EAAE,OAAO,MAAM,QAAQ,CAAC,GAAG,SAAS,WAAW,GAAI,gBAAgB,EAAE,UAAU,aAAa,EAAG;AACjH,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,MAAqB,EAAE,YAAY,eAAe,SAAS;AACjE,QAAM,YAAY,mBAAmB,UAAU,UAAU,CAAC,GAAG,UAAU;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ,UAAU,IAAI,OAAK,YAAY,GAAG,GAAG,CAAC,EAAE,IAAI,OAAK,mBAAmB,GAAG,UAAU,CAAC;AAAA,IAC1F,SAAS;AAAA,IACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,EAC/C;AACF;AAoBA,SAAS,mBAAmB,SAAkB,QAA0B;AACtE,MAAI,WAAW,QAAQ,OAAO,YAAY,YAAY,MAAM,QAAQ,OAAO,EAAG,QAAO;AACrF,QAAM,IAAI;AACV,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,aAAa,EAAE;AACrB,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,WAAW,IAAI,IAAY,MAAM,QAAQ,EAAE,QAAQ,IAAK,EAAE,WAAwB,CAAC,CAAC;AAC1F,QAAM,aAAa;AACnB,MAAI,SAAyC;AAC7C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,UAAU,GAAG;AACrD,QAAI,UAAU,KAAM;AACpB,QAAI,SAAS,IAAI,GAAG,EAAG;AACvB,UAAM,aAAa,WAAW,GAAG;AACjC,QAAI,CAAC,WAAY;AACjB,UAAM,OAAO,WAAW;AACxB,UAAM,aAAa,SAAS,UAAW,MAAM,QAAQ,IAAI,KAAM,KAAkB,SAAS,MAAM;AAChG,QAAI,CAAC,YAAY;AACf,UAAI,CAAC,OAAQ,UAAS,EAAE,GAAG,WAAW;AACtC,aAAO,OAAO,GAAG;AAAA,IACnB;AAAA,EACF;AACA,SAAO,UAAU;AACnB;AAQA,SAAS,sBAAsB,SAAmC;AAChE,MAAI,WAAW,OAAO,YAAY,YAAY,YAAa,SAAqC;AAC9F,UAAM,SAAU,QAAoC;AACpD,QAAI,WAAW,YAAa,QAAO;AACnC,QAAI,WAAW,UAAW,QAAO;AACjC,QAAI,WAAW,iBAAkB,QAAO;AAAA,EAC1C;AACA,SAAO;AACT;AASO,SAAS,iBAAiB,UAAkB,SAAkB,SAAqC;AAOxG,QAAM,gBACJ,WAAW,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IAC5D,2BAA2B,SAAoC,EAAE,SAAS,CAAC,IAC3E;AACN,QAAM,UAAU,sBAAsB,aAAa;AACnD,QAAM,YAAY,aAAa,UAAU,SAAS,OAAO;AAIzD,QAAM,YAAY,cAAc,YAAY,SAAS,aAAa,UAAU,QAAQ,OAAO,IAAI;AAC/F,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,aAAc,UAAmC;AAIvD,QAAM,aAAa,WAAW,QAAQ,sBAAsB,OAAO,MAAM;AACzE,QAAM,oBAAoB,aAAa,mBAAmB,eAAe,UAAU,IAAI;AACvF,QAAM,QAAQ,UAAU,iBAAiB;AACzC,QAAM,cAAyB,YAAY,UAAU;AACrD,QAAM,kBAAkB,CAAC,aAAa,YAAY;AAClD,QAAM,iBAA4F,kBAC9F,EAAE,0BAA0B,MAAM,mBAAmB,QAAQ,IAC7D,CAAC;AACL,QAAM,eACJ,cAAc,OAAO,eAAe,YAAY,OAAQ,WAAiC,QAAQ,WAC3F,WAA+B,MACjC;AACN,MAAI,OAAO;AACT,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ,CAAC;AAAA,MACT,SAAS;AAAA,MACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,MAC7C,GAAG;AAAA,IACL;AAAA,EACF;AACA,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,MAAqB,EAAE,YAAY,eAAe,SAAS;AACjE,QAAM,YAAY,mBAAmB,UAAU,UAAU,CAAC,GAAG,UAAU;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ,UAAU,IAAI,OAAK,YAAY,GAAG,GAAG,CAAC,EAAE,IAAI,OAAK,mBAAmB,GAAG,UAAU,CAAC;AAAA,IAC1F,SAAS;AAAA,IACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,IAC7C,GAAG;AAAA,EACL;AACF;AAWO,SAAS,oBACd,eACQ;AACR,MAAI,CAAC,iBAAiB,cAAc,WAAW,EAAG,QAAO;AACzD,SAAO,cACJ,IAAI,CAAC,EAAE,OAAO,MAAM,MAAM;AACzB,QAAI,OAAO,UAAU,SAAU,QAAO,GAAG,KAAK,IAAI,KAAK,UAAU,KAAK,CAAC;AACvE,UAAM,UAAU,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AAChE,WAAO,GAAG,KAAK,KAAK,OAAO;AAAA,EAC7B,CAAC,EACA,KAAK,IAAI;AACd;AAmBO,SAAS,gBAAgB,OAAwB,UAAqC,CAAC,GAAW;AACvG,QAAM,QAAkB,CAAC,GAAG,MAAM,OAAO,IAAI,MAAM,OAAO,EAAE;AAC5D,MAAI,MAAM,YAAY,MAAM,aAAa,QAAQ,cAAc;AAC7D,UAAM,KAAK,YAAY,MAAM,QAAQ,GAAG;AAAA,EAC1C;AACA,QAAM,gBAAgB,oBAAoB,MAAM,aAAa;AAC7D,MAAI,cAAe,OAAM,KAAK,mBAAmB,aAAa,GAAG;AACjE,MAAI,MAAM,KAAM,OAAM,KAAK,UAAU,MAAM,IAAI,GAAG;AAClD,SAAO,MAAM,KAAK,GAAG;AACvB;AASO,SAAS,aAAa,QAA2B,QAAQ,GAAG,UAAqC,CAAC,GAAW;AAClH,QAAM,OAAO,OACV,MAAM,GAAG,KAAK,EACd,IAAI,OAAK,gBAAgB,GAAG,OAAO,CAAC,EACpC,KAAK,IAAI;AACZ,QAAM,OAAO,OAAO,SAAS;AAC7B,SAAO,OAAO,IAAI,GAAG,IAAI,MAAM,IAAI,WAAW;AAChD;","names":[]}
+{"version":3,"sources":["../../../src/lib/validation/schema-validator.ts"],"sourcesContent":["/**\n * Schema-driven validation for AdCP tool requests and responses.\n *\n * The client uses this pre-send and post-receive; the opt-in server\n * middleware uses the same core to reject drift at the dispatcher.\n */\n\nimport type { ErrorObject } from 'ajv';\nimport { getValidator, getRegisteredSchemaIds, type Direction, type ResponseVariant } from './schema-loader';\nimport { parseAdcpMajorVersion } from '../version';\nimport { findHint } from './hints';\nimport { injectLegacyEnvelopeStatus } from '../utils/envelope-status-compat';\n\n/**\n * One variant of a `oneOf` / `anyOf` that the caller's payload could have\n * matched, summarized down to what a client (human or LLM) needs to know\n * to pick one. Attached to `ValidationIssue` when `keyword` is `oneOf`\n * or `anyOf`. Omitted otherwise.\n */\nexport interface ValidationIssueVariant {\n  /** Zero-based index of the variant in the schema's `oneOf`/`anyOf` array. */\n  index: number;\n  /** Required property names on this variant (per its `required` array). */\n  required: string[];\n  /**\n   * Keys declared in the variant's `properties`. Useful for clients that\n   * want to show \"this variant accepts X, Y, Z\" without fetching the\n   * full schema. Empty if the variant doesn't declare properties.\n   */\n  properties: string[];\n}\n\n/**\n * A single validation failure with a JSON Pointer to the offending field,\n * the AJV message, and the schema path that rejected it. Mirrors the\n * format a `VALIDATION_ERROR` carries at `adcp_error.issues` (top level)\n * and `adcp_error.details.issues` (spec-convention mirror).\n */\nexport interface ValidationIssue {\n  /** RFC 6901 JSON Pointer to the offending field in the payload. */\n  pointer: string;\n  /** Human-readable message from the schema. */\n  message: string;\n  /** AJV keyword that rejected the payload (e.g., `required`, `type`). */\n  keyword: string;\n  /** Path inside the schema that rejected the payload. */\n  schemaPath: string;\n  /**\n   * `$id` of the rejecting schema. Resolved by finding the longest\n   * registered AJV `$id` that prefixes {@link schemaPath}.\n   *\n   * Bundling caveat: AdCP ships most tools through `schemas/cache/<v>/bundled/`\n   * with `$ref`s pre-resolved and inner `$id`s stripped at bundle time. For\n   * those tools, `schemaId` resolves to the response root (e.g.\n   * `/schemas/3.0.4/bundled/signals/activate-signal-response.json`), not\n   * the deeper sub-schema. Tools served from the flat tree (`governance/`,\n   * `brand/`, etc.) preserve sub-schema `$id`s, so `schemaId` can land on\n   * something deeper like `/schemas/3.0.4/core/activation-key.json`. Either\n   * way, the field names exactly the schema the validator looked at.\n   *\n   * Always projected — the `$id` is the published spec URI, not internal\n   * handler shape. (Same precedent as {@link ValidationIssue.variants} and\n   * {@link ValidationIssue.allowedValues}, both of which already ship\n   * always-on with the same rationale.)\n   *\n   * Absent only when the rejecting schema didn't declare an `$id`.\n   */\n  schemaId?: string;\n  /**\n   * Discriminator field/value pair(s) of a `oneOf`/`anyOf` that the payload\n   * was inferred to be targeting. Populated by {@link compactUnionErrors}\n   * when a const-discriminator collapse picks a \"best surviving variant\" —\n   * the variant the user matched the discriminator of but missed required\n   * fields or other constraints in. Compound discriminators like\n   * `audience-selector`'s `(type, value_type)` produce multi-entry arrays.\n   *\n   * Names align with OpenAPI 3.x `discriminator.propertyName`.\n   *\n   * Absent when no discriminator could be resolved — either the keyword\n   * isn't a union, the union has no `const`-asserting properties, or the\n   * payload didn't match any branch's discriminator (in which case the\n   * synthetic `enum`-keyword issue carries `allowedValues` instead).\n   */\n  discriminator?: ReadonlyArray<{ field: string; value: unknown }>;\n  /**\n   * Variants a caller can pick from when `keyword === 'oneOf'` or\n   * `'anyOf'`. Each entry carries the variant's required fields + known\n   * properties so a naive LLM client can recover without fetching the\n   * full schema. Absent on non-union keywords.\n   *\n   * Unlike {@link ValidationIssue.schemaPath} (which is gated behind\n   * `exposeSchemaPath` because it encodes which branch the seller's\n   * handler rejected first — an implementation detail), `variants[]`\n   * ships on the wire by default. Rationale: it reflects the PUBLIC\n   * spec's union shape, which the bundled AdCP schemas under\n   * `schemas/cache/<version>/` already make available to anyone with\n   * `@adcp/sdk` installed. Gating would hurt naive LLM clients in\n   * production — exactly the audience this field was built to help\n   * (adcp-client#919).\n   */\n  variants?: ValidationIssueVariant[];\n  /**\n   * Closed enum values the payload MUST match for `keyword: 'enum'`\n   * issues. AdCP wire schemas use enum heavily for status fields,\n   * channels, pricing models, delivery types, etc. Without this list\n   * on the wire envelope, both LLM-generated platforms and humans\n   * have to fetch the schema just to discover the allowed values —\n   * the most common self-correction failure surfaced by the Emma matrix.\n   *\n   * Absent on non-enum keywords. Always projected (not gated behind\n   * `exposeSchemaPath`) — these are PUBLIC spec values, not internal\n   * branch detail.\n   */\n  allowedValues?: readonly unknown[];\n  /**\n   * Curated one-sentence hint naming the most common adopter mistake for\n   * a recognized failure pattern (e.g. \"type='key_value' requires\n   * top-level `key` and `value` strings; do not nest under a `key_value`\n   * field\"). Sourced from {@link import('./hints').findHint} — see\n   * `validation/hints.ts` for the rule table and the\n   * empirical-evidence quality bar for adding new entries.\n   *\n   * Absent for issues that don't match a curated rule. Most issues\n   * won't have a hint, and that's fine — the structured `pointer` +\n   * `keyword` + `discriminator` + `variants` already cover the long\n   * tail. Hints are reserved for shape gotchas where the validator's\n   * raw message reads as ambiguous to a first-time adopter.\n   */\n  hint?: string;\n}\n\nexport interface ValidationOutcome {\n  valid: boolean;\n  issues: ValidationIssue[];\n  /** Which schema variant was selected — useful for logging/debugging. */\n  variant: Direction | 'skipped';\n  /**\n   * `$id` of the root validator that produced this outcome (e.g.\n   * `/schemas/3.0.4/bundled/signals/activate-signal-response.json`). Lets\n   * downstream callers suppress redundant `(schema: ...)` prose suffixes\n   * on issues that landed on the response root — typical for the bundled\n   * tree, where most issues do. Absent when no schema was applied\n   * (`variant: 'skipped'`) or the root schema didn't declare an `$id`.\n   */\n  schemaId?: string;\n  /**\n   * True when the response's `status` field named an async variant\n   * (`submitted` / `working` / `input-required`) but no compiled schema\n   * existed for that variant, so validation fell back to the sync\n   * response schema. The agent is using an async shape that this tool\n   * doesn't explicitly schema — a conformance signal the sync-fallback\n   * validation can't render by itself. Absent on normal sync or\n   * fully-schema-covered async flows.\n   */\n  variant_fallback_applied?: boolean;\n  /** Variant requested by payload shape before fallback. Set iff `variant_fallback_applied`. */\n  requested_variant?: ResponseVariant;\n}\n\nconst OK: ValidationOutcome = Object.freeze({ valid: true, issues: [], variant: 'skipped' });\n\n/**\n * Marker attached by {@link compactUnionErrors} to the residual errors of\n * the variant it picked as the best surviving branch. Carries the\n * discriminator field+value pair(s) that variant requires, so\n * {@link formatIssue} can surface the branch identifier on every issue\n * inherited from that variant. Marker key is namespaced with `__adcp_` to\n * avoid colliding with anything Ajv may add.\n */\ntype AdcpDiscriminatedError = ErrorObject & {\n  __adcp_discriminator?: ReadonlyArray<{ field: string; value: unknown }>;\n};\n\n/**\n * Find the longest registered AJV `$id` that prefixes `schemaPath` — that\n * `$id` belongs to the schema (or `$ref`'d sub-schema) responsible for the\n * failure. Returns `undefined` for inline (`#/...`) paths when the root\n * schema doesn't declare an `$id`.\n *\n * AJV 8 prefixes a `$ref`'d schema's errors with the target schema's `$id`\n * (e.g. `/schemas/3.0.4/core/activation-key.json/oneOf/1/required`), so\n * the prefix search resolves cleanly without re-traversing the schema\n * graph. The match must end at a path boundary — `'/'` or `'#'` — so an\n * `$id` ending in `.json` can't false-match a sibling whose `$id` is a\n * proper extension of it.\n */\nfunction extractSchemaId(\n  schemaPath: string,\n  rootSchema: unknown,\n  registeredIds: readonly string[]\n): string | undefined {\n  if (schemaPath.startsWith('#') || schemaPath === '') {\n    const id = (rootSchema as { $id?: unknown } | null | undefined)?.$id;\n    return typeof id === 'string' ? id : undefined;\n  }\n  // The Ajv registry includes the JSON Schema meta-schema\n  // (`http://json-schema.org/draft-07/schema`) alongside AdCP `$id`s. Ajv\n  // never emits schemaPaths prefixed with the meta-schema URL — those\n  // paths use the relative `#/...` form and take the branch above — so\n  // the meta-schema entry never false-matches here.\n  let best: string | undefined;\n  for (const id of registeredIds) {\n    if (!id) continue;\n    if (schemaPath === id || schemaPath.startsWith(`${id}/`) || schemaPath.startsWith(`${id}#`)) {\n      if (best === undefined || id.length > best.length) best = id;\n    }\n  }\n  return best;\n}\n\ninterface FormatContext {\n  rootSchema: unknown;\n  registeredIds: readonly string[];\n  /**\n   * Tool name being validated. Threaded into {@link findHint} so curated\n   * hints that gate on tool name can fire. Optional only because\n   * `validateRequest` / `validateResponse` always pass it; tests that\n   * call `formatIssue` directly are the rare exception.\n   */\n  toolName?: string;\n}\n\nfunction formatIssue(err: ErrorObject, ctx: FormatContext): ValidationIssue {\n  const instancePath = err.instancePath || '';\n  const missingProperty =\n    err.keyword === 'required' &&\n    err.params &&\n    typeof (err.params as { missingProperty?: string }).missingProperty === 'string'\n      ? `/${(err.params as { missingProperty: string }).missingProperty}`\n      : '';\n\n  // Enrich enum errors with the allowed values from AJV's params + replace\n  // the opaque \"must be equal to one of the allowed values\" message with\n  // the actual list. Without this, LLM-generated platforms can't self-\n  // correct (Emma matrix v17, 2026-04-30): the validation cascade from\n  // a single bad enum value swallows ~30 storyboard steps because no\n  // self-correction signal is available without fetching the schema.\n  const isEnum =\n    err.keyword === 'enum' &&\n    err.params != null &&\n    Array.isArray((err.params as { allowedValues?: unknown[] }).allowedValues);\n  const allowedValues = isEnum ? (err.params as { allowedValues: readonly unknown[] }).allowedValues : undefined;\n  const message = isEnum\n    ? `must be one of: ${allowedValues!.map(v => JSON.stringify(v)).join(', ')}`\n    : (err.message ?? 'validation failed');\n\n  const schemaId = extractSchemaId(err.schemaPath, ctx.rootSchema, ctx.registeredIds);\n  const discriminator = (err as AdcpDiscriminatedError).__adcp_discriminator;\n  const issue: ValidationIssue = {\n    pointer: `${instancePath}${missingProperty}` || '/',\n    message,\n    keyword: err.keyword,\n    schemaPath: err.schemaPath,\n    ...(schemaId !== undefined && { schemaId }),\n    ...(discriminator !== undefined && discriminator.length > 0 && { discriminator }),\n    ...(allowedValues !== undefined && { allowedValues }),\n  };\n  // Attach a curated `hint` last so the matcher can read every other\n  // resolved field (schemaId, discriminator, pointer, keyword) when\n  // deciding whether to fire. Most issues won't match any rule —\n  // findHint returns undefined, and the field stays absent.\n  const hint = findHint(issue, ctx.toolName);\n  if (hint !== undefined) issue.hint = hint;\n  return issue;\n}\n\n// Path segments we refuse to walk into during schema-path resolution. AJV\n// emits trusted `schemaPath` strings today, but the function is exported in\n// shape (anything in this file is reachable via the compiled JS), so any\n// future caller passing user-influenced paths can't traverse into prototype\n// chains. Bundled schemas have no use for these names either.\nconst FORBIDDEN_SCHEMA_PATH_SEGMENTS = new Set(['__proto__', 'constructor', 'prototype']);\n\n/**\n * Resolve an AJV `schemaPath` like `\"#/properties/account/oneOf\"` against\n * the compiled validator's root schema. Returns `undefined` if the path\n * doesn't land on an object. Handles URI-encoded path segments (AJV\n * escapes `~` as `~0` and `/` as `~1` per RFC 6901).\n *\n * Refuses prototype-chain segments and uses own-property indexing so a\n * future caller (or a pathological future schema) can't induce a walk\n * into `Object.prototype`.\n */\nfunction resolveSchemaPath(rootSchema: unknown, schemaPath: string): unknown {\n  if (rootSchema == null) return undefined;\n  const clean = schemaPath.replace(/^#\\/?/, '');\n  if (clean.length === 0) return rootSchema;\n  let cursor: unknown = rootSchema;\n  for (const raw of clean.split('/')) {\n    if (cursor == null || (typeof cursor !== 'object' && !Array.isArray(cursor))) return undefined;\n    const decoded = raw.replace(/~1/g, '/').replace(/~0/g, '~');\n    if (FORBIDDEN_SCHEMA_PATH_SEGMENTS.has(decoded)) return undefined;\n    if (!Object.prototype.hasOwnProperty.call(cursor, decoded)) return undefined;\n    cursor = (cursor as Record<string, unknown>)[decoded];\n  }\n  return cursor;\n}\n\n/**\n * Compact AJV's `oneOf` / `anyOf` cascades before they reach the wire.\n *\n * AJV with `allErrors: true` emits one error per non-matching variant\n * plus a synthetic \"must match exactly one schema\" root. For a 9-way\n * `pricing_options` union with a single bad `pricing_model` value that\n * is 14+ errors per failed item, drowning real residual errors elsewhere\n * in the same payload (adcontextprotocol/adcp-client#1111).\n *\n * Strategy:\n *  1. For each union root, group variant errors by variant index.\n *  2. Inspect each variant's schema for `const`-constrained properties.\n *     A property where ≥2 variants assert `const` at the same path is a\n *     candidate discriminator (covers single-field discriminators like\n *     `pricing_model` and composite ones like `audience-selector`'s\n *     `(type, value_type)`).\n *  3. Collapse a candidate path iff EVERY variant that asserts `const`\n *     there emitted a `const` error. (If some variants silently passed,\n *     the user's value matched some allowed const — collapsing would\n *     hide that and tell them their valid value was wrong.)\n *  4. Each collapse becomes a synthetic `enum`-keyword issue carrying\n *     the union of allowed const values; the existing `formatIssue`\n *     enrichment then renders \"must be one of: A, B, ...\".\n *  5. After collapse, if any variant has zero residual errors, the\n *     discriminator collapse fully explains the failure — drop the\n *     synthetic union root and the residuals from the other variants.\n *  6. Otherwise pick the variant with the fewest residual errors,\n *     tie-breaking by fewest residual `const` errors so a variant the\n *     user's discriminator value satisfied wins over a sibling whose\n *     discriminator they violated. Drop the rest.\n */\nfunction compactUnionErrors(errors: readonly ErrorObject[], rootSchema: unknown): ErrorObject[] {\n  if (errors.length === 0) return [...errors];\n\n  // Pre-bucket once so each error is scanned a constant number of times even\n  // when a malicious or pathological payload pushes Ajv to emit thousands of\n  // errors across many union failures. The naive `for root in unionRoots: for\n  // e in errors` form is O(U·N) — at K=100 product items each producing a\n  // 14-error pricing-options cascade that's ~140k iterations on the\n  // request-validation hot path.\n  const errorsByOneOfPath = new Map<string, ErrorObject[]>();\n  for (const e of errors) {\n    const m = e.schemaPath.match(/^(.*\\/(?:oneOf|anyOf))\\/\\d+(?:\\/|$)/);\n    if (!m) continue;\n    const root = m[1]!;\n    const bucket = errorsByOneOfPath.get(root);\n    if (bucket) bucket.push(e);\n    else errorsByOneOfPath.set(root, [e]);\n  }\n\n  const dropped = new Set<ErrorObject>();\n  const added: ErrorObject[] = [];\n\n  // Deepest-first ordering matters for nested unions: by the time the outer\n  // root is evaluated, the inner cascade has already been replaced by a\n  // synthetic enum at a `<...>/discriminator/<field>` schemaPath that won't\n  // match the outer's `oneOfPath + '/'` prefix and stays independent.\n  const unionRoots = errors\n    .filter(e => e.keyword === 'oneOf' || e.keyword === 'anyOf')\n    .slice()\n    .sort((a, b) => b.schemaPath.length - a.schemaPath.length);\n\n  for (const root of unionRoots) {\n    if (dropped.has(root)) continue;\n    const oneOfPath = root.schemaPath;\n    const rootInstance = root.instancePath;\n\n    // Variant errors: pulled from the prebuilt index (constant per-error work\n    // above), then grouped by variant index. instancePath scoping keeps two\n    // separate union failures sharing the same `schemaPath` but different\n    // instancePaths — e.g., `products[0].pricing_options[0]` and\n    // `products[1]...` — independent.\n    const candidateErrors = errorsByOneOfPath.get(oneOfPath) ?? [];\n    const byVariant = new Map<number, ErrorObject[]>();\n    for (const e of candidateErrors) {\n      if (e === root || dropped.has(e)) continue;\n      const tail = e.schemaPath.slice(oneOfPath.length + 1);\n      const m = tail.match(/^(\\d+)(?:\\/|$)/);\n      if (!m) continue;\n      if (e.instancePath !== rootInstance && !e.instancePath.startsWith(rootInstance + '/')) continue;\n      const idx = parseInt(m[1]!, 10);\n      const bucket = byVariant.get(idx);\n      if (bucket) bucket.push(e);\n      else byVariant.set(idx, [e]);\n    }\n    if (byVariant.size === 0) continue;\n\n    // Resolve the variant schema array. Without it we fall back to a pure\n    // error-shape collapse (still correct, just less precise on which\n    // variants asserted const where the user happened to match).\n    const variantSchemas = resolveSchemaPath(rootSchema, oneOfPath);\n    const variantArr: readonly unknown[] = Array.isArray(variantSchemas) ? variantSchemas : [];\n\n    // For each top-level property in each variant, record which variants\n    // declare a `const` value there. Top-level only — composite\n    // discriminators in AdCP (`audience-selector`, pricing-option) all\n    // sit at the variant root.\n    const constAsserters = new Map<string, Map<number, unknown>>();\n    for (let i = 0; i < variantArr.length; i++) {\n      const variant = variantArr[i];\n      if (!variant || typeof variant !== 'object') continue;\n      const props = (variant as { properties?: unknown }).properties;\n      if (!props || typeof props !== 'object') continue;\n      for (const [key, prop] of Object.entries(props as Record<string, unknown>)) {\n        if (prop && typeof prop === 'object' && 'const' in prop) {\n          const path = `/${key.replace(/~/g, '~0').replace(/\\//g, '~1')}`;\n          let m = constAsserters.get(path);\n          if (!m) constAsserters.set(path, (m = new Map()));\n          m.set(i, (prop as { const: unknown }).const);\n        }\n      }\n    }\n\n    // For each candidate path with ≥2 asserters, did every asserter emit?\n    const collapsedPaths = new Set<string>();\n    for (const [relPath, asserters] of constAsserters) {\n      if (asserters.size < 2) continue;\n      const absolutePath = rootInstance + relPath;\n      const emittersByVariant = new Map<number, ErrorObject>();\n      for (const [idx, errs] of byVariant) {\n        for (const e of errs) {\n          if (e.keyword === 'const' && e.instancePath === absolutePath) {\n            emittersByVariant.set(idx, e);\n            break;\n          }\n        }\n      }\n      let allEmitted = true;\n      for (const idx of asserters.keys()) {\n        if (!emittersByVariant.has(idx)) {\n          allEmitted = false;\n          break;\n        }\n      }\n      if (!allEmitted) continue;\n\n      const allowedValues: unknown[] = [];\n      for (const v of asserters.values()) {\n        const already = allowedValues.some(existing => existing === v);\n        if (!already) allowedValues.push(v);\n      }\n      const sample = emittersByVariant.values().next().value as ErrorObject;\n      // Synthetic enum issue. `schemaPath: ''` keeps it out of any caller\n      // that walks the path back to a real schema location (the synthesized\n      // `<oneOfPath>/discriminator/<field>` would dangle if dereferenced)\n      // while still satisfying the wire shape — the response-side errors\n      // helper already gates `schemaPath` exposure via `exposeSchemaPath`.\n      // `JSON.stringify` on the const values is safe: they come from the\n      // bundled (trusted) schema and the outer wire envelope re-encodes\n      // anyway, so control characters or quotes can't break framing.\n      added.push({\n        ...sample,\n        keyword: 'enum',\n        schemaPath: '',\n        message: `must be one of: ${allowedValues.map(v => JSON.stringify(v)).join(', ')}`,\n        params: { allowedValues },\n      } as ErrorObject);\n      for (const e of emittersByVariant.values()) dropped.add(e);\n      collapsedPaths.add(absolutePath);\n    }\n\n    // Compute residuals after the collapse.\n    const residualByVariant = new Map<number, ErrorObject[]>();\n    for (const [idx, errs] of byVariant) {\n      residualByVariant.set(\n        idx,\n        errs.filter(e => !dropped.has(e))\n      );\n    }\n\n    if (collapsedPaths.size > 0) {\n      const anyZeroResidual = [...residualByVariant.values()].some(r => r.length === 0);\n      if (anyZeroResidual) {\n        for (const errs of residualByVariant.values()) for (const e of errs) dropped.add(e);\n        dropped.add(root);\n        continue;\n      }\n    }\n\n    // Variants with a `not` keyword failure are excluded from candidacy:\n    // the payload populates fields the variant forbids by design (e.g. an\n    // Error variant whose `not` clause rejects payloads that carry the\n    // Success variant's `account` / `currency` / `period` fields). The\n    // adopter's actionable lever is the OTHER variant's residuals (missing\n    // required fields they need to add) — surfacing the `not` failure\n    // points at a path the adopter shouldn't take. See adcp-client#1337.\n    //\n    // **Spec assumption.** AdCP 3.x uses `not` only as an envelope-level\n    // mutual-exclusion guard between Success ↔ Error arms of a response\n    // oneOf — never as an intra-arm discriminator (those use `const` on a\n    // tag field, e.g. async `status: 'submitted' | 'working' | ...`).\n    // The exclusion logic here targets that dominant pattern. If a future\n    // spec ever inverts the convention (a Success arm using `not` to\n    // discriminate sub-variants), this heuristic would suppress an\n    // actionable diagnostic — re-evaluate the assumption when adopting\n    // any AdCP version that does so.\n    //\n    // If every variant has a `not` failure, fall back to the unconstrained\n    // pick — preserves diagnostic on contrived schemas where mutual-\n    // exclusion is the only signal.\n    const variantsWithNotFailure = new Set<number>();\n    for (const [idx, errs] of byVariant) {\n      for (const e of errs) {\n        if (e.keyword === 'not') {\n          variantsWithNotFailure.add(idx);\n          break;\n        }\n      }\n    }\n    const allVariantsHaveNot = variantsWithNotFailure.size === byVariant.size && byVariant.size > 0;\n\n    // Pick the best surviving variant; prefer fewest residuals, tie-break\n    // by fewest residual `const` errors (so variants whose discriminator\n    // the user actually picked win over siblings whose discriminator they\n    // violated). Excluded variants (mutual-exclusion `not` rejections) are\n    // skipped unless all variants are excluded.\n    let bestIdx = -1;\n    let bestCount = Infinity;\n    let bestConsts = Infinity;\n    for (const [idx, residual] of residualByVariant) {\n      if (!allVariantsHaveNot && variantsWithNotFailure.has(idx)) continue;\n      const constCount = residual.reduce((n, e) => (e.keyword === 'const' ? n + 1 : n), 0);\n      if (residual.length < bestCount || (residual.length === bestCount && constCount < bestConsts)) {\n        bestIdx = idx;\n        bestCount = residual.length;\n        bestConsts = constCount;\n      }\n    }\n    for (const [idx, residual] of residualByVariant) {\n      if (idx !== bestIdx) for (const e of residual) dropped.add(e);\n    }\n\n    // Tag the surviving variant's residuals with the discriminator\n    // field+value pair(s) it requires. Adopters reading the projected\n    // issue see \"branch: type='key_value'\" alongside the missing-required\n    // error, so they know which branch the seller's payload was inferred\n    // to be targeting (issue #1283). Compound discriminators (e.g.,\n    // `audience-selector`'s (type, value_type)) become multi-entry\n    // arrays — order follows iteration of `constAsserters`, which mirrors\n    // the variant's `properties` declaration order.\n    if (bestIdx >= 0) {\n      const pairs: Array<{ field: string; value: unknown }> = [];\n      for (const [relPath, asserters] of constAsserters) {\n        const constValue = asserters.get(bestIdx);\n        if (constValue === undefined) continue;\n        const field = relPath.startsWith('/') ? relPath.slice(1) : relPath;\n        pairs.push({ field, value: constValue });\n      }\n      if (pairs.length > 0) {\n        const surviving = residualByVariant.get(bestIdx) ?? [];\n        for (const e of surviving) {\n          // Deepest-first ordering means inner unions tag first; if a\n          // residual is already tagged it carries the more specific\n          // (deeper) discriminator, which is what the adopter needs to\n          // fix. Don't clobber it with the outer union's tag — the outer\n          // discriminator is context, not the actionable lever.\n          // Bucketing-by-deepest-prefix in `errorsByOneOfPath` already\n          // protects most leaf errors from entering this loop, but the\n          // explicit guard makes the invariant resilient to future\n          // changes in that bucket scheme.\n          if ((e as AdcpDiscriminatedError).__adcp_discriminator !== undefined) continue;\n          (e as AdcpDiscriminatedError).__adcp_discriminator = pairs;\n        }\n      }\n    }\n  }\n\n  return [...errors.filter(e => !dropped.has(e)), ...added];\n}\n\n/**\n * When an AJV error has `keyword: 'oneOf' | 'anyOf'`, resolve the\n * schema's variant array and summarize each variant so a client can\n * pick one without fetching the full schema. See {@link ValidationIssueVariant}.\n * Returns the issue unchanged when the keyword doesn't match or the\n * resolution fails (e.g. the variant list is inlined in an unexpected\n * way).\n */\nfunction enrichWithVariants(issue: ValidationIssue, rootSchema: unknown): ValidationIssue {\n  if (issue.keyword !== 'oneOf' && issue.keyword !== 'anyOf') return issue;\n  const resolved = resolveSchemaPath(rootSchema, issue.schemaPath);\n  if (!Array.isArray(resolved)) return issue;\n  const variants: ValidationIssueVariant[] = resolved.map((variant: unknown, index: number) => {\n    if (variant == null || typeof variant !== 'object') {\n      return { index, required: [], properties: [] };\n    }\n    const v = variant as Record<string, unknown>;\n    const required = Array.isArray(v.required) ? (v.required.filter(r => typeof r === 'string') as string[]) : [];\n    const properties =\n      v.properties != null && typeof v.properties === 'object' ? Object.keys(v.properties as object) : [];\n    return { index, required, properties };\n  });\n  return { ...issue, variants };\n}\n\n/**\n * Validate an outgoing request against `{tool}-request.json`.\n *\n * `version` selects which AdCP version's schema bundle to validate against;\n * defaults to the SDK-pinned `ADCP_VERSION`. Pass the per-instance value\n * from `getAdcpVersion()` to validate against a pinned-version client/server's\n * schema.\n */\nexport function validateRequest(toolName: string, payload: unknown, version?: string): ValidationOutcome {\n  const validator = getValidator(toolName, 'request', version);\n  if (!validator) return OK;\n  const valid = validator(payload) as boolean;\n  const rootSchema = (validator as { schema?: unknown }).schema;\n  const rootSchemaId =\n    rootSchema && typeof rootSchema === 'object' && typeof (rootSchema as { $id?: unknown }).$id === 'string'\n      ? ((rootSchema as { $id: string }).$id as string)\n      : undefined;\n  if (valid) return { valid: true, issues: [], variant: 'request', ...(rootSchemaId && { schemaId: rootSchemaId }) };\n  const registeredIds = getRegisteredSchemaIds(version);\n  const ctx: FormatContext = { rootSchema, registeredIds, toolName };\n  const compacted = compactUnionErrors(validator.errors ?? [], rootSchema);\n  return {\n    valid: false,\n    issues: compacted.map(e => formatIssue(e, ctx)).map(i => enrichWithVariants(i, rootSchema)),\n    variant: 'request',\n    ...(rootSchemaId && { schemaId: rootSchemaId }),\n  };\n}\n\n/**\n * Strip top-level optional fields whose value is `null` but whose declared\n * schema type is not nullable (`type` does not include `'null'`).\n *\n * Applies only when validating against a v2.x schema bundle. v2.5 sellers\n * (Pydantic-origin) commonly emit `errors: null`, `context: null`, `ext: null`\n * to signal \"nothing here\" rather than omitting the key. The v2.5 schemas\n * don't include `null` in those types, so Ajv spuriously rejects them.\n *\n * Gated to v2.x only — in v3, `errors` is a required field on failure\n * branches, and silently stripping it across all versions would mask real\n * bugs in v3 seller responses.\n *\n * Returns a shallow clone with the offending keys removed, or the original\n * object unchanged if nothing was stripped. Safe to pass to an Ajv validator:\n * Ajv 8 (without `removeAdditional`/`useDefaults`/`coerceTypes`) does not\n * mutate its input.\n */\nfunction stripEnvelopeNulls(payload: unknown, schema: unknown): unknown {\n  if (payload == null || typeof payload !== 'object' || Array.isArray(payload)) return payload;\n  const s = schema as Record<string, unknown> | null;\n  if (!s) return payload;\n  const properties = s.properties as Record<string, unknown> | undefined;\n  if (!properties) return payload;\n  const required = new Set<string>(Array.isArray(s.required) ? (s.required as string[]) : []);\n  const payloadObj = payload as Record<string, unknown>;\n  let cloned: Record<string, unknown> | null = null;\n  for (const [key, value] of Object.entries(payloadObj)) {\n    if (value !== null) continue;\n    if (required.has(key)) continue;\n    const propSchema = properties[key] as Record<string, unknown> | undefined;\n    if (!propSchema) continue;\n    const type = propSchema.type;\n    const isNullable = type === 'null' || (Array.isArray(type) && (type as string[]).includes('null'));\n    if (!isNullable) {\n      if (!cloned) cloned = { ...payloadObj };\n      delete cloned[key];\n    }\n  }\n  return cloned ?? payload;\n}\n\n/**\n * Select the response variant by payload shape (per issue #688: choose by\n * `status` field, not just the tool name). Matches the AdCP 3.0 async\n * contract: `submitted`, `working`, `input-required`, and the sync\n * terminal states (`completed` / no status).\n */\nfunction selectResponseVariant(payload: unknown): ResponseVariant {\n  if (payload && typeof payload === 'object' && 'status' in (payload as Record<string, unknown>)) {\n    const status = (payload as Record<string, unknown>).status;\n    if (status === 'submitted') return 'submitted';\n    if (status === 'working') return 'working';\n    if (status === 'input-required') return 'input-required';\n  }\n  return 'sync';\n}\n\n/**\n * Validate an incoming response; picks the async variant by payload shape.\n *\n * `version` selects which AdCP version's schema bundle to validate against;\n * defaults to the SDK-pinned `ADCP_VERSION`. See {@link validateRequest} for\n * the per-instance use case.\n */\nexport function validateResponse(toolName: string, payload: unknown, version?: string): ValidationOutcome {\n  // 3.0.x back-compat: synthesize envelope `status` when the payload\n  // declares itself as 3.0.x (or carries no version field at all). 3.1+\n  // payloads remain unchanged so the strict validator still rejects a\n  // 3.1 peer that omits `status`. Applied before variant selection so a\n  // synthesized `completed` doesn't get misrouted to the async-variant\n  // schema. See `utils/envelope-status-compat.ts`.\n  const compatPayload =\n    payload && typeof payload === 'object' && !Array.isArray(payload)\n      ? injectLegacyEnvelopeStatus(payload as Record<string, unknown>, { toolName })\n      : payload;\n  const variant = selectResponseVariant(compatPayload);\n  const validator = getValidator(toolName, variant, version);\n  // If an async variant schema is missing, fall back to the sync one —\n  // some tools declare `-response.json` only and use `status` as an\n  // in-band marker without a dedicated variant schema.\n  const effective = validator ?? (variant !== 'sync' ? getValidator(toolName, 'sync', version) : undefined);\n  if (!effective) return OK;\n  const rootSchema = (effective as { schema?: unknown }).schema;\n  // v2.x sellers (Pydantic-origin) emit optional envelope fields as null instead\n  // of omitting them. Strip before Ajv to avoid spurious type errors on `errors`,\n  // `context`, and `ext`. Gated to v2.x only — see stripEnvelopeNulls JSDoc.\n  const isV2Bundle = version != null && parseAdcpMajorVersion(version) === 2;\n  const normalizedPayload = isV2Bundle ? stripEnvelopeNulls(compatPayload, rootSchema) : compatPayload;\n  const valid = effective(normalizedPayload) as boolean;\n  const usedVariant: Direction = validator ? variant : 'sync';\n  const variantFallback = !validator && variant !== 'sync';\n  const fallbackFields: Pick<ValidationOutcome, 'variant_fallback_applied' | 'requested_variant'> = variantFallback\n    ? { variant_fallback_applied: true, requested_variant: variant }\n    : {};\n  const rootSchemaId =\n    rootSchema && typeof rootSchema === 'object' && typeof (rootSchema as { $id?: unknown }).$id === 'string'\n      ? ((rootSchema as { $id: string }).$id as string)\n      : undefined;\n  if (valid) {\n    return {\n      valid: true,\n      issues: [],\n      variant: usedVariant,\n      ...(rootSchemaId && { schemaId: rootSchemaId }),\n      ...fallbackFields,\n    };\n  }\n  const registeredIds = getRegisteredSchemaIds(version);\n  const ctx: FormatContext = { rootSchema, registeredIds, toolName };\n  const compacted = compactUnionErrors(effective.errors ?? [], rootSchema);\n  return {\n    valid: false,\n    issues: compacted.map(e => formatIssue(e, ctx)).map(i => enrichWithVariants(i, rootSchema)),\n    variant: usedVariant,\n    ...(rootSchemaId && { schemaId: rootSchemaId }),\n    ...fallbackFields,\n  };\n}\n\n/**\n * Render `discriminator[]` as `field='value', other='x'`. Strings are\n * single-quoted (matches the issue #1283 example shape) with embedded\n * apostrophes backslash-escaped so a future spec const containing `'`\n * can't produce ambiguous output. Other JSON-safe values use\n * `JSON.stringify` so booleans and numbers stay unambiguous. Returns an\n * empty string when the array is empty so callers can compose\n * conditionally.\n */\nexport function formatDiscriminator(\n  discriminator: ReadonlyArray<{ field: string; value: unknown }> | undefined\n): string {\n  if (!discriminator || discriminator.length === 0) return '';\n  return discriminator\n    .map(({ field, value }) => {\n      if (typeof value !== 'string') return `${field}=${JSON.stringify(value)}`;\n      const escaped = value.replace(/\\\\/g, '\\\\\\\\').replace(/'/g, \"\\\\'\");\n      return `${field}='${escaped}'`;\n    })\n    .join(', ');\n}\n\n/**\n * One-line render of a validation issue with `(schema: <$id>)`,\n * `(discriminator: <field>='<value>')`, and `(hint: …)` suffixes when\n * the issue carries them. Used by both {@link formatIssues} and the\n * prose `message` field on `VALIDATION_ERROR` envelopes (issue #1283\n * for schema/discriminator, #1309 for hint), so adopters debugging from\n * the wire envelope alone see the rejecting schema, union discriminator,\n * and curated mistake-recipe without having to walk `issues[]`.\n *\n * The `(schema: ...)` suffix is suppressed for inline failures whose\n * `schemaId` is the response root — the tool name already conveys that,\n * and AdCP's bundled tree strips inner `$id`s so most issues land on the\n * root. Suppressing keeps the prose tight on the cases where the schema\n * field would just restate the tool the adopter already knows. Adopters\n * who want the field unconditionally read it from the structured\n * `issues[].schemaId`.\n */\nexport function formatIssueLine(issue: ValidationIssue, options: { rootSchemaId?: string } = {}): string {\n  const parts: string[] = [`${issue.pointer} ${issue.message}`];\n  if (issue.schemaId && issue.schemaId !== options.rootSchemaId) {\n    parts.push(`(schema: ${issue.schemaId})`);\n  }\n  const discriminator = formatDiscriminator(issue.discriminator);\n  if (discriminator) parts.push(`(discriminator: ${discriminator})`);\n  if (issue.hint) parts.push(`(hint: ${issue.hint})`);\n  return parts.join(' ');\n}\n\n/**\n * Render a compact one-line summary of the failures — useful for logs.\n *\n * `rootSchemaId`, when supplied, suppresses the `(schema: ...)` suffix on\n * issues whose `schemaId` matches it (typical for issues that landed on\n * the response root). Pass `undefined` to always emit the suffix.\n */\nexport function formatIssues(issues: ValidationIssue[], limit = 3, options: { rootSchemaId?: string } = {}): string {\n  const head = issues\n    .slice(0, limit)\n    .map(i => formatIssueLine(i, options))\n    .join('; ');\n  const rest = issues.length - limit;\n  return rest > 0 ? `${head} (+${rest} more)` : head;\n}\n"],"mappings":"AAQA,SAAS,cAAc,8BAAoE;AAC3F,SAAS,6BAA6B;AACtC,SAAS,gBAAgB;AACzB,SAAS,kCAAkC;AAoJ3C,MAAM,KAAwB,OAAO,OAAO,EAAE,OAAO,MAAM,QAAQ,CAAC,GAAG,SAAS,UAAU,CAAC;AA2B3F,SAAS,gBACP,YACA,YACA,eACoB;AACpB,MAAI,WAAW,WAAW,GAAG,KAAK,eAAe,IAAI;AACnD,UAAM,KAAM,YAAqD;AACjE,WAAO,OAAO,OAAO,WAAW,KAAK;AAAA,EACvC;AAMA,MAAI;AACJ,aAAW,MAAM,eAAe;AAC9B,QAAI,CAAC,GAAI;AACT,QAAI,eAAe,MAAM,WAAW,WAAW,GAAG,EAAE,GAAG,KAAK,WAAW,WAAW,GAAG,EAAE,GAAG,GAAG;AAC3F,UAAI,SAAS,UAAa,GAAG,SAAS,KAAK,OAAQ,QAAO;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;AAcA,SAAS,YAAY,KAAkB,KAAqC;AAC1E,QAAM,eAAe,IAAI,gBAAgB;AACzC,QAAM,kBACJ,IAAI,YAAY,cAChB,IAAI,UACJ,OAAQ,IAAI,OAAwC,oBAAoB,WACpE,IAAK,IAAI,OAAuC,eAAe,KAC/D;AAQN,QAAM,SACJ,IAAI,YAAY,UAChB,IAAI,UAAU,QACd,MAAM,QAAS,IAAI,OAAyC,aAAa;AAC3E,QAAM,gBAAgB,SAAU,IAAI,OAAiD,gBAAgB;AACrG,QAAM,UAAU,SACZ,mBAAmB,cAAe,IAAI,OAAK,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,KACvE,IAAI,WAAW;AAEpB,QAAM,WAAW,gBAAgB,IAAI,YAAY,IAAI,YAAY,IAAI,aAAa;AAClF,QAAM,gBAAiB,IAA+B;AACtD,QAAM,QAAyB;AAAA,IAC7B,SAAS,GAAG,YAAY,GAAG,eAAe,MAAM;AAAA,IAChD;AAAA,IACA,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,GAAI,aAAa,UAAa,EAAE,SAAS;AAAA,IACzC,GAAI,kBAAkB,UAAa,cAAc,SAAS,KAAK,EAAE,cAAc;AAAA,IAC/E,GAAI,kBAAkB,UAAa,EAAE,cAAc;AAAA,EACrD;AAKA,QAAM,OAAO,SAAS,OAAO,IAAI,QAAQ;AACzC,MAAI,SAAS,OAAW,OAAM,OAAO;AACrC,SAAO;AACT;AAOA,MAAM,iCAAiC,oBAAI,IAAI,CAAC,aAAa,eAAe,WAAW,CAAC;AAYxF,SAAS,kBAAkB,YAAqB,YAA6B;AAC3E,MAAI,cAAc,KAAM,QAAO;AAC/B,QAAM,QAAQ,WAAW,QAAQ,SAAS,EAAE;AAC5C,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,MAAI,SAAkB;AACtB,aAAW,OAAO,MAAM,MAAM,GAAG,GAAG;AAClC,QAAI,UAAU,QAAS,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,EAAI,QAAO;AACrF,UAAM,UAAU,IAAI,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC1D,QAAI,+BAA+B,IAAI,OAAO,EAAG,QAAO;AACxD,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,OAAO,EAAG,QAAO;AACnE,aAAU,OAAmC,OAAO;AAAA,EACtD;AACA,SAAO;AACT;AAiCA,SAAS,mBAAmB,QAAgC,YAAoC;AAC9F,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC,GAAG,MAAM;AAQ1C,QAAM,oBAAoB,oBAAI,IAA2B;AACzD,aAAW,KAAK,QAAQ;AACtB,UAAM,IAAI,EAAE,WAAW,MAAM,qCAAqC;AAClE,QAAI,CAAC,EAAG;AACR,UAAM,OAAO,EAAE,CAAC;AAChB,UAAM,SAAS,kBAAkB,IAAI,IAAI;AACzC,QAAI,OAAQ,QAAO,KAAK,CAAC;AAAA,QACpB,mBAAkB,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,EACtC;AAEA,QAAM,UAAU,oBAAI,IAAiB;AACrC,QAAM,QAAuB,CAAC;AAM9B,QAAM,aAAa,OAChB,OAAO,OAAK,EAAE,YAAY,WAAW,EAAE,YAAY,OAAO,EAC1D,MAAM,EACN,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,SAAS,EAAE,WAAW,MAAM;AAE3D,aAAW,QAAQ,YAAY;AAC7B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,UAAM,YAAY,KAAK;AACvB,UAAM,eAAe,KAAK;AAO1B,UAAM,kBAAkB,kBAAkB,IAAI,SAAS,KAAK,CAAC;AAC7D,UAAM,YAAY,oBAAI,IAA2B;AACjD,eAAW,KAAK,iBAAiB;AAC/B,UAAI,MAAM,QAAQ,QAAQ,IAAI,CAAC,EAAG;AAClC,YAAM,OAAO,EAAE,WAAW,MAAM,UAAU,SAAS,CAAC;AACpD,YAAM,IAAI,KAAK,MAAM,gBAAgB;AACrC,UAAI,CAAC,EAAG;AACR,UAAI,EAAE,iBAAiB,gBAAgB,CAAC,EAAE,aAAa,WAAW,eAAe,GAAG,EAAG;AACvF,YAAM,MAAM,SAAS,EAAE,CAAC,GAAI,EAAE;AAC9B,YAAM,SAAS,UAAU,IAAI,GAAG;AAChC,UAAI,OAAQ,QAAO,KAAK,CAAC;AAAA,UACpB,WAAU,IAAI,KAAK,CAAC,CAAC,CAAC;AAAA,IAC7B;AACA,QAAI,UAAU,SAAS,EAAG;AAK1B,UAAM,iBAAiB,kBAAkB,YAAY,SAAS;AAC9D,UAAM,aAAiC,MAAM,QAAQ,cAAc,IAAI,iBAAiB,CAAC;AAMzF,UAAM,iBAAiB,oBAAI,IAAkC;AAC7D,aAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAM,UAAU,WAAW,CAAC;AAC5B,UAAI,CAAC,WAAW,OAAO,YAAY,SAAU;AAC7C,YAAM,QAAS,QAAqC;AACpD,UAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,iBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,KAAgC,GAAG;AAC1E,YAAI,QAAQ,OAAO,SAAS,YAAY,WAAW,MAAM;AACvD,gBAAM,OAAO,IAAI,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI,CAAC;AAC7D,cAAI,IAAI,eAAe,IAAI,IAAI;AAC/B,cAAI,CAAC,EAAG,gBAAe,IAAI,MAAO,IAAI,oBAAI,IAAI,CAAE;AAChD,YAAE,IAAI,GAAI,KAA4B,KAAK;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAGA,UAAM,iBAAiB,oBAAI,IAAY;AACvC,eAAW,CAAC,SAAS,SAAS,KAAK,gBAAgB;AACjD,UAAI,UAAU,OAAO,EAAG;AACxB,YAAM,eAAe,eAAe;AACpC,YAAM,oBAAoB,oBAAI,IAAyB;AACvD,iBAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,mBAAW,KAAK,MAAM;AACpB,cAAI,EAAE,YAAY,WAAW,EAAE,iBAAiB,cAAc;AAC5D,8BAAkB,IAAI,KAAK,CAAC;AAC5B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,aAAa;AACjB,iBAAW,OAAO,UAAU,KAAK,GAAG;AAClC,YAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;AAC/B,uBAAa;AACb;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,WAAY;AAEjB,YAAM,gBAA2B,CAAC;AAClC,iBAAW,KAAK,UAAU,OAAO,GAAG;AAClC,cAAM,UAAU,cAAc,KAAK,cAAY,aAAa,CAAC;AAC7D,YAAI,CAAC,QAAS,eAAc,KAAK,CAAC;AAAA,MACpC;AACA,YAAM,SAAS,kBAAkB,OAAO,EAAE,KAAK,EAAE;AASjD,YAAM,KAAK;AAAA,QACT,GAAG;AAAA,QACH,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,SAAS,mBAAmB,cAAc,IAAI,OAAK,KAAK,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,QAChF,QAAQ,EAAE,cAAc;AAAA,MAC1B,CAAgB;AAChB,iBAAW,KAAK,kBAAkB,OAAO,EAAG,SAAQ,IAAI,CAAC;AACzD,qBAAe,IAAI,YAAY;AAAA,IACjC;AAGA,UAAM,oBAAoB,oBAAI,IAA2B;AACzD,eAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,wBAAkB;AAAA,QAChB;AAAA,QACA,KAAK,OAAO,OAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClC;AAAA,IACF;AAEA,QAAI,eAAe,OAAO,GAAG;AAC3B,YAAM,kBAAkB,CAAC,GAAG,kBAAkB,OAAO,CAAC,EAAE,KAAK,OAAK,EAAE,WAAW,CAAC;AAChF,UAAI,iBAAiB;AACnB,mBAAW,QAAQ,kBAAkB,OAAO,EAAG,YAAW,KAAK,KAAM,SAAQ,IAAI,CAAC;AAClF,gBAAQ,IAAI,IAAI;AAChB;AAAA,MACF;AAAA,IACF;AAuBA,UAAM,yBAAyB,oBAAI,IAAY;AAC/C,eAAW,CAAC,KAAK,IAAI,KAAK,WAAW;AACnC,iBAAW,KAAK,MAAM;AACpB,YAAI,EAAE,YAAY,OAAO;AACvB,iCAAuB,IAAI,GAAG;AAC9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,UAAM,qBAAqB,uBAAuB,SAAS,UAAU,QAAQ,UAAU,OAAO;AAO9F,QAAI,UAAU;AACd,QAAI,YAAY;AAChB,QAAI,aAAa;AACjB,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAmB;AAC/C,UAAI,CAAC,sBAAsB,uBAAuB,IAAI,GAAG,EAAG;AAC5D,YAAM,aAAa,SAAS,OAAO,CAAC,GAAG,MAAO,EAAE,YAAY,UAAU,IAAI,IAAI,GAAI,CAAC;AACnF,UAAI,SAAS,SAAS,aAAc,SAAS,WAAW,aAAa,aAAa,YAAa;AAC7F,kBAAU;AACV,oBAAY,SAAS;AACrB,qBAAa;AAAA,MACf;AAAA,IACF;AACA,eAAW,CAAC,KAAK,QAAQ,KAAK,mBAAmB;AAC/C,UAAI,QAAQ,QAAS,YAAW,KAAK,SAAU,SAAQ,IAAI,CAAC;AAAA,IAC9D;AAUA,QAAI,WAAW,GAAG;AAChB,YAAM,QAAkD,CAAC;AACzD,iBAAW,CAAC,SAAS,SAAS,KAAK,gBAAgB;AACjD,cAAM,aAAa,UAAU,IAAI,OAAO;AACxC,YAAI,eAAe,OAAW;AAC9B,cAAM,QAAQ,QAAQ,WAAW,GAAG,IAAI,QAAQ,MAAM,CAAC,IAAI;AAC3D,cAAM,KAAK,EAAE,OAAO,OAAO,WAAW,CAAC;AAAA,MACzC;AACA,UAAI,MAAM,SAAS,GAAG;AACpB,cAAM,YAAY,kBAAkB,IAAI,OAAO,KAAK,CAAC;AACrD,mBAAW,KAAK,WAAW;AAUzB,cAAK,EAA6B,yBAAyB,OAAW;AACtE,UAAC,EAA6B,uBAAuB;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,OAAO,OAAO,OAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,GAAG,KAAK;AAC1D;AAUA,SAAS,mBAAmB,OAAwB,YAAsC;AACxF,MAAI,MAAM,YAAY,WAAW,MAAM,YAAY,QAAS,QAAO;AACnE,QAAM,WAAW,kBAAkB,YAAY,MAAM,UAAU;AAC/D,MAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG,QAAO;AACrC,QAAM,WAAqC,SAAS,IAAI,CAAC,SAAkB,UAAkB;AAC3F,QAAI,WAAW,QAAQ,OAAO,YAAY,UAAU;AAClD,aAAO,EAAE,OAAO,UAAU,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,IAC/C;AACA,UAAM,IAAI;AACV,UAAM,WAAW,MAAM,QAAQ,EAAE,QAAQ,IAAK,EAAE,SAAS,OAAO,OAAK,OAAO,MAAM,QAAQ,IAAiB,CAAC;AAC5G,UAAM,aACJ,EAAE,cAAc,QAAQ,OAAO,EAAE,eAAe,WAAW,OAAO,KAAK,EAAE,UAAoB,IAAI,CAAC;AACpG,WAAO,EAAE,OAAO,UAAU,WAAW;AAAA,EACvC,CAAC;AACD,SAAO,EAAE,GAAG,OAAO,SAAS;AAC9B;AAUO,SAAS,gBAAgB,UAAkB,SAAkB,SAAqC;AACvG,QAAM,YAAY,aAAa,UAAU,WAAW,OAAO;AAC3D,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,QAAQ,UAAU,OAAO;AAC/B,QAAM,aAAc,UAAmC;AACvD,QAAM,eACJ,cAAc,OAAO,eAAe,YAAY,OAAQ,WAAiC,QAAQ,WAC3F,WAA+B,MACjC;AACN,MAAI,MAAO,QAAO,EAAE,OAAO,MAAM,QAAQ,CAAC,GAAG,SAAS,WAAW,GAAI,gBAAgB,EAAE,UAAU,aAAa,EAAG;AACjH,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,MAAqB,EAAE,YAAY,eAAe,SAAS;AACjE,QAAM,YAAY,mBAAmB,UAAU,UAAU,CAAC,GAAG,UAAU;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ,UAAU,IAAI,OAAK,YAAY,GAAG,GAAG,CAAC,EAAE,IAAI,OAAK,mBAAmB,GAAG,UAAU,CAAC;AAAA,IAC1F,SAAS;AAAA,IACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,EAC/C;AACF;AAoBA,SAAS,mBAAmB,SAAkB,QAA0B;AACtE,MAAI,WAAW,QAAQ,OAAO,YAAY,YAAY,MAAM,QAAQ,OAAO,EAAG,QAAO;AACrF,QAAM,IAAI;AACV,MAAI,CAAC,EAAG,QAAO;AACf,QAAM,aAAa,EAAE;AACrB,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,WAAW,IAAI,IAAY,MAAM,QAAQ,EAAE,QAAQ,IAAK,EAAE,WAAwB,CAAC,CAAC;AAC1F,QAAM,aAAa;AACnB,MAAI,SAAyC;AAC7C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,UAAU,GAAG;AACrD,QAAI,UAAU,KAAM;AACpB,QAAI,SAAS,IAAI,GAAG,EAAG;AACvB,UAAM,aAAa,WAAW,GAAG;AACjC,QAAI,CAAC,WAAY;AACjB,UAAM,OAAO,WAAW;AACxB,UAAM,aAAa,SAAS,UAAW,MAAM,QAAQ,IAAI,KAAM,KAAkB,SAAS,MAAM;AAChG,QAAI,CAAC,YAAY;AACf,UAAI,CAAC,OAAQ,UAAS,EAAE,GAAG,WAAW;AACtC,aAAO,OAAO,GAAG;AAAA,IACnB;AAAA,EACF;AACA,SAAO,UAAU;AACnB;AAQA,SAAS,sBAAsB,SAAmC;AAChE,MAAI,WAAW,OAAO,YAAY,YAAY,YAAa,SAAqC;AAC9F,UAAM,SAAU,QAAoC;AACpD,QAAI,WAAW,YAAa,QAAO;AACnC,QAAI,WAAW,UAAW,QAAO;AACjC,QAAI,WAAW,iBAAkB,QAAO;AAAA,EAC1C;AACA,SAAO;AACT;AASO,SAAS,iBAAiB,UAAkB,SAAkB,SAAqC;AAOxG,QAAM,gBACJ,WAAW,OAAO,YAAY,YAAY,CAAC,MAAM,QAAQ,OAAO,IAC5D,2BAA2B,SAAoC,EAAE,SAAS,CAAC,IAC3E;AACN,QAAM,UAAU,sBAAsB,aAAa;AACnD,QAAM,YAAY,aAAa,UAAU,SAAS,OAAO;AAIzD,QAAM,YAAY,cAAc,YAAY,SAAS,aAAa,UAAU,QAAQ,OAAO,IAAI;AAC/F,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,aAAc,UAAmC;AAIvD,QAAM,aAAa,WAAW,QAAQ,sBAAsB,OAAO,MAAM;AACzE,QAAM,oBAAoB,aAAa,mBAAmB,eAAe,UAAU,IAAI;AACvF,QAAM,QAAQ,UAAU,iBAAiB;AACzC,QAAM,cAAyB,YAAY,UAAU;AACrD,QAAM,kBAAkB,CAAC,aAAa,YAAY;AAClD,QAAM,iBAA4F,kBAC9F,EAAE,0BAA0B,MAAM,mBAAmB,QAAQ,IAC7D,CAAC;AACL,QAAM,eACJ,cAAc,OAAO,eAAe,YAAY,OAAQ,WAAiC,QAAQ,WAC3F,WAA+B,MACjC;AACN,MAAI,OAAO;AACT,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ,CAAC;AAAA,MACT,SAAS;AAAA,MACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,MAC7C,GAAG;AAAA,IACL;AAAA,EACF;AACA,QAAM,gBAAgB,uBAAuB,OAAO;AACpD,QAAM,MAAqB,EAAE,YAAY,eAAe,SAAS;AACjE,QAAM,YAAY,mBAAmB,UAAU,UAAU,CAAC,GAAG,UAAU;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,QAAQ,UAAU,IAAI,OAAK,YAAY,GAAG,GAAG,CAAC,EAAE,IAAI,OAAK,mBAAmB,GAAG,UAAU,CAAC;AAAA,IAC1F,SAAS;AAAA,IACT,GAAI,gBAAgB,EAAE,UAAU,aAAa;AAAA,IAC7C,GAAG;AAAA,EACL;AACF;AAWO,SAAS,oBACd,eACQ;AACR,MAAI,CAAC,iBAAiB,cAAc,WAAW,EAAG,QAAO;AACzD,SAAO,cACJ,IAAI,CAAC,EAAE,OAAO,MAAM,MAAM;AACzB,QAAI,OAAO,UAAU,SAAU,QAAO,GAAG,KAAK,IAAI,KAAK,UAAU,KAAK,CAAC;AACvE,UAAM,UAAU,MAAM,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK;AAChE,WAAO,GAAG,KAAK,KAAK,OAAO;AAAA,EAC7B,CAAC,EACA,KAAK,IAAI;AACd;AAmBO,SAAS,gBAAgB,OAAwB,UAAqC,CAAC,GAAW;AACvG,QAAM,QAAkB,CAAC,GAAG,MAAM,OAAO,IAAI,MAAM,OAAO,EAAE;AAC5D,MAAI,MAAM,YAAY,MAAM,aAAa,QAAQ,cAAc;AAC7D,UAAM,KAAK,YAAY,MAAM,QAAQ,GAAG;AAAA,EAC1C;AACA,QAAM,gBAAgB,oBAAoB,MAAM,aAAa;AAC7D,MAAI,cAAe,OAAM,KAAK,mBAAmB,aAAa,GAAG;AACjE,MAAI,MAAM,KAAM,OAAM,KAAK,UAAU,MAAM,IAAI,GAAG;AAClD,SAAO,MAAM,KAAK,GAAG;AACvB;AASO,SAAS,aAAa,QAA2B,QAAQ,GAAG,UAAqC,CAAC,GAAW;AAClH,QAAM,OAAO,OACV,MAAM,GAAG,KAAK,EACd,IAAI,OAAK,gBAAgB,GAAG,OAAO,CAAC,EACpC,KAAK,IAAI;AACZ,QAAM,OAAO,OAAO,SAAS;AAC7B,SAAO,OAAO,IAAI,GAAG,IAAI,MAAM,IAAI,WAAW;AAChD;","names":[]}

package/dist/lib/validation/sync-creatives.mjs

@@ -1,9 +1,3 @@
-import { fileURLToPath as __adcpFileURLToPath } from 'node:url';
-import { dirname as __adcpDirname } from 'node:path';
-import { createRequire as __adcpCreateRequire } from 'node:module';
-const __filename = __adcpFileURLToPath(import.meta.url);
-const __dirname = __adcpDirname(__filename);
-const require = __adcpCreateRequire(import.meta.url);
 import { z } from "zod";
 import {
   AccountSchema,

package/dist/lib/validation/sync-creatives.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/validation/sync-creatives.ts"],"sourcesContent":["import { z } from 'zod';\nimport {\n  AccountSchema,\n  CreativeStatusSchema,\n  ErrorSchema,\n  ContextObjectSchema,\n  ExtensionObjectSchema,\n  SyncCreativesErrorSchema,\n  SyncCreativesSubmittedSchema,\n} from '../types/schemas.generated';\n\nexport const SyncCreativesActionSchema = z.union([\n  z.literal('created'),\n  z.literal('updated'),\n  z.literal('unchanged'),\n  z.literal('failed'),\n  z.literal('deleted'),\n]);\n\nconst ASSIGNMENT_ERROR_KEY = /^[a-zA-Z0-9_-]+$/;\n\nconst HttpUrlSchema = z\n  .string()\n  .url()\n  .refine(v => /^https?:\\/\\//i.test(v), {\n    message: 'URL must use http(s) scheme',\n  });\n\nexport const SyncCreativesItemSchema = z\n  .object({\n    creative_id: z.string(),\n    action: SyncCreativesActionSchema,\n    account: AccountSchema.optional(),\n    status: CreativeStatusSchema.optional(),\n    platform_id: z.string().optional(),\n    changes: z.array(z.string()).optional(),\n    errors: z.array(ErrorSchema).optional(),\n    warnings: z.array(z.string()).optional(),\n    preview_url: HttpUrlSchema.optional(),\n    expires_at: z.string().datetime({ offset: true }).optional(),\n    assigned_to: z.array(z.string()).optional(),\n    assignment_errors: z\n      .record(z.string().regex(ASSIGNMENT_ERROR_KEY, 'assignment_errors key must match ^[a-zA-Z0-9_-]+$'), z.string())\n      .optional(),\n  })\n  .passthrough()\n  .superRefine((item, ctx) => {\n    // Spec: when action ∈ {failed, deleted}, `status` MUST be absent.\n    if ((item.action === 'failed' || item.action === 'deleted') && item.status !== undefined) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        path: ['status'],\n        message: `status must be omitted when action is '${item.action}'`,\n      });\n    }\n  });\n\nexport type SyncCreativesItem = z.infer<typeof SyncCreativesItemSchema>;\n\nexport const SyncCreativesSuccessStrictSchema = z\n  .object({\n    dry_run: z.boolean().optional(),\n    creatives: z.array(SyncCreativesItemSchema),\n    sandbox: z.boolean().optional(),\n    context: ContextObjectSchema.optional(),\n    ext: ExtensionObjectSchema.optional(),\n  })\n  .passthrough();\n\nexport type SyncCreativesSuccessStrict = z.infer<typeof SyncCreativesSuccessStrictSchema>;\n\n/**\n * Strict response schema for sync_creatives.\n *\n * The generated `SyncCreativesResponseSchema` degrades `creatives[]` to\n * `z.array(z.record(z.string(), z.unknown()))` because the upstream JSON\n * Schema inlines the item shape without a named $ref. This schema supplies\n * the per-item shape (creative_id + action required, plus the spec's\n * conditional that forbids `status` on failed/deleted items) so strict\n * response validation catches per-item drift at the SDK boundary.\n */\nexport const SyncCreativesResponseStrictSchema = z.union([\n  SyncCreativesSuccessStrictSchema,\n  SyncCreativesErrorSchema,\n  SyncCreativesSubmittedSchema,\n]);\n"],"mappings":";;;;;;AAAA,SAAS,SAAS;AAClB;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEA,MAAM,4BAA4B,EAAE,MAAM;AAAA,EAC/C,EAAE,QAAQ,SAAS;AAAA,EACnB,EAAE,QAAQ,SAAS;AAAA,EACnB,EAAE,QAAQ,WAAW;AAAA,EACrB,EAAE,QAAQ,QAAQ;AAAA,EAClB,EAAE,QAAQ,SAAS;AACrB,CAAC;AAED,MAAM,uBAAuB;AAE7B,MAAM,gBAAgB,EACnB,OAAO,EACP,IAAI,EACJ,OAAO,OAAK,gBAAgB,KAAK,CAAC,GAAG;AAAA,EACpC,SAAS;AACX,CAAC;AAEI,MAAM,0BAA0B,EACpC,OAAO;AAAA,EACN,aAAa,EAAE,OAAO;AAAA,EACtB,QAAQ;AAAA,EACR,SAAS,cAAc,SAAS;AAAA,EAChC,QAAQ,qBAAqB,SAAS;AAAA,EACtC,aAAa,EAAE,OAAO,EAAE,SAAS;AAAA,EACjC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EACtC,QAAQ,EAAE,MAAM,WAAW,EAAE,SAAS;AAAA,EACtC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EACvC,aAAa,cAAc,SAAS;AAAA,EACpC,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,KAAK,CAAC,EAAE,SAAS;AAAA,EAC3D,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EAC1C,mBAAmB,EAChB,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,mDAAmD,GAAG,EAAE,OAAO,CAAC,EAC9G,SAAS;AACd,CAAC,EACA,YAAY,EACZ,YAAY,CAAC,MAAM,QAAQ;AAE1B,OAAK,KAAK,WAAW,YAAY,KAAK,WAAW,cAAc,KAAK,WAAW,QAAW;AACxF,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,MAAM,CAAC,QAAQ;AAAA,MACf,SAAS,0CAA0C,KAAK,MAAM;AAAA,IAChE,CAAC;AAAA,EACH;AACF,CAAC;AAII,MAAM,mCAAmC,EAC7C,OAAO;AAAA,EACN,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,EAC9B,WAAW,EAAE,MAAM,uBAAuB;AAAA,EAC1C,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,EAC9B,SAAS,oBAAoB,SAAS;AAAA,EACtC,KAAK,sBAAsB,SAAS;AACtC,CAAC,EACA,YAAY;AAcR,MAAM,oCAAoC,EAAE,MAAM;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AACF,CAAC;","names":[]}
+{"version":3,"sources":["../../../src/lib/validation/sync-creatives.ts"],"sourcesContent":["import { z } from 'zod';\nimport {\n  AccountSchema,\n  CreativeStatusSchema,\n  ErrorSchema,\n  ContextObjectSchema,\n  ExtensionObjectSchema,\n  SyncCreativesErrorSchema,\n  SyncCreativesSubmittedSchema,\n} from '../types/schemas.generated';\n\nexport const SyncCreativesActionSchema = z.union([\n  z.literal('created'),\n  z.literal('updated'),\n  z.literal('unchanged'),\n  z.literal('failed'),\n  z.literal('deleted'),\n]);\n\nconst ASSIGNMENT_ERROR_KEY = /^[a-zA-Z0-9_-]+$/;\n\nconst HttpUrlSchema = z\n  .string()\n  .url()\n  .refine(v => /^https?:\\/\\//i.test(v), {\n    message: 'URL must use http(s) scheme',\n  });\n\nexport const SyncCreativesItemSchema = z\n  .object({\n    creative_id: z.string(),\n    action: SyncCreativesActionSchema,\n    account: AccountSchema.optional(),\n    status: CreativeStatusSchema.optional(),\n    platform_id: z.string().optional(),\n    changes: z.array(z.string()).optional(),\n    errors: z.array(ErrorSchema).optional(),\n    warnings: z.array(z.string()).optional(),\n    preview_url: HttpUrlSchema.optional(),\n    expires_at: z.string().datetime({ offset: true }).optional(),\n    assigned_to: z.array(z.string()).optional(),\n    assignment_errors: z\n      .record(z.string().regex(ASSIGNMENT_ERROR_KEY, 'assignment_errors key must match ^[a-zA-Z0-9_-]+$'), z.string())\n      .optional(),\n  })\n  .passthrough()\n  .superRefine((item, ctx) => {\n    // Spec: when action ∈ {failed, deleted}, `status` MUST be absent.\n    if ((item.action === 'failed' || item.action === 'deleted') && item.status !== undefined) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        path: ['status'],\n        message: `status must be omitted when action is '${item.action}'`,\n      });\n    }\n  });\n\nexport type SyncCreativesItem = z.infer<typeof SyncCreativesItemSchema>;\n\nexport const SyncCreativesSuccessStrictSchema = z\n  .object({\n    dry_run: z.boolean().optional(),\n    creatives: z.array(SyncCreativesItemSchema),\n    sandbox: z.boolean().optional(),\n    context: ContextObjectSchema.optional(),\n    ext: ExtensionObjectSchema.optional(),\n  })\n  .passthrough();\n\nexport type SyncCreativesSuccessStrict = z.infer<typeof SyncCreativesSuccessStrictSchema>;\n\n/**\n * Strict response schema for sync_creatives.\n *\n * The generated `SyncCreativesResponseSchema` degrades `creatives[]` to\n * `z.array(z.record(z.string(), z.unknown()))` because the upstream JSON\n * Schema inlines the item shape without a named $ref. This schema supplies\n * the per-item shape (creative_id + action required, plus the spec's\n * conditional that forbids `status` on failed/deleted items) so strict\n * response validation catches per-item drift at the SDK boundary.\n */\nexport const SyncCreativesResponseStrictSchema = z.union([\n  SyncCreativesSuccessStrictSchema,\n  SyncCreativesErrorSchema,\n  SyncCreativesSubmittedSchema,\n]);\n"],"mappings":"AAAA,SAAS,SAAS;AAClB;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEA,MAAM,4BAA4B,EAAE,MAAM;AAAA,EAC/C,EAAE,QAAQ,SAAS;AAAA,EACnB,EAAE,QAAQ,SAAS;AAAA,EACnB,EAAE,QAAQ,WAAW;AAAA,EACrB,EAAE,QAAQ,QAAQ;AAAA,EAClB,EAAE,QAAQ,SAAS;AACrB,CAAC;AAED,MAAM,uBAAuB;AAE7B,MAAM,gBAAgB,EACnB,OAAO,EACP,IAAI,EACJ,OAAO,OAAK,gBAAgB,KAAK,CAAC,GAAG;AAAA,EACpC,SAAS;AACX,CAAC;AAEI,MAAM,0BAA0B,EACpC,OAAO;AAAA,EACN,aAAa,EAAE,OAAO;AAAA,EACtB,QAAQ;AAAA,EACR,SAAS,cAAc,SAAS;AAAA,EAChC,QAAQ,qBAAqB,SAAS;AAAA,EACtC,aAAa,EAAE,OAAO,EAAE,SAAS;AAAA,EACjC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EACtC,QAAQ,EAAE,MAAM,WAAW,EAAE,SAAS;AAAA,EACtC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EACvC,aAAa,cAAc,SAAS;AAAA,EACpC,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,KAAK,CAAC,EAAE,SAAS;AAAA,EAC3D,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EAC1C,mBAAmB,EAChB,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,mDAAmD,GAAG,EAAE,OAAO,CAAC,EAC9G,SAAS;AACd,CAAC,EACA,YAAY,EACZ,YAAY,CAAC,MAAM,QAAQ;AAE1B,OAAK,KAAK,WAAW,YAAY,KAAK,WAAW,cAAc,KAAK,WAAW,QAAW;AACxF,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,MAAM,CAAC,QAAQ;AAAA,MACf,SAAS,0CAA0C,KAAK,MAAM;AAAA,IAChE,CAAC;AAAA,EACH;AACF,CAAC;AAII,MAAM,mCAAmC,EAC7C,OAAO;AAAA,EACN,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,EAC9B,WAAW,EAAE,MAAM,uBAAuB;AAAA,EAC1C,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,EAC9B,SAAS,oBAAoB,SAAS;AAAA,EACtC,KAAK,sBAAsB,SAAS;AACtC,CAAC,EACA,YAAY;AAcR,MAAM,oCAAoC,EAAE,MAAM;AAAA,EACvD;AAAA,EACA;AAAA,EACA;AACF,CAAC;","names":[]}