@tangle-network/agent-runtime 0.349.0 → 0.352.1

package/dist/profiles.js.map

@@ -1 +1 @@
-{"version":3,"file":"profiles.js","names":[],"sources":["../src/profiles/researcher.ts","../src/profiles/ui-auditor/lens-prompts.ts","../src/profiles/ui-auditor/output-adapter.ts"],"sourcesContent":["/**\n * Opinionated preset for source-grounded research\n * tasks. The agent is told to:\n *   - bound its work to a single `knowledgeNamespace`\n *   - emit `items[]` carrying provenance + confidence\n *   - emit `citations[]` linking quotes back to source urls\n *   - emit `proposedWrites[]` — never call materialize itself\n *   - describe `gaps` it could not answer\n *\n * The profile is stateless and agent-agnostic. The caller supplies the exact execution profile;\n * this preset adds only the researcher prompt, tools, parser, and validator.\n *\n * Propose-don't-apply: the profile NEVER writes to the knowledge base.\n * It produces `proposedWrites: KnowledgeUpdate[]` in the output. The\n * caller (gtm-agent, journey-eval, user) decides whether to feed those\n * updates through `applyKnowledgeWriteBlocks` / a KbStore put.\n *\n * Namespace isolation: every `KnowledgeItem` + `KnowledgeUpdate` in the\n * output carries `namespace`. The validator hard-fails when any item\n * touches a namespace other than `task.knowledgeNamespace`.\n *\n * @experimental\n */\n\nimport { isRecord } from '@tangle-network/agent-core'\nimport { type AgentProfile, agentProfileSchema } from '@tangle-network/agent-interface'\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { ConfigError } from '../errors'\nimport { assertExecutableAgentProfile } from '../runtime/supervise/model-policy'\nimport type {\n  AgentRunSpec,\n  DefaultVerdict,\n  Driver,\n  OutputAdapter,\n  Validator,\n} from '../runtime/types'\n\n/** Source families a researcher profile may prefer for a task. One owner: the delegation\n *  vocabulary (`DelegateResearchArgs.sources`) re-exports this type rather than restating it.\n *  @experimental */\nexport type ResearchSource = 'web' | 'corpus' | 'twitter' | 'github' | 'docs'\n\n/** Task contract for a source-grounded research agent. @experimental */\nexport interface ResearchTask {\n  /** The research question to answer. */\n  question: string\n  /** Bound: e.g. \"audience for cpg-founder ICP\". */\n  scope?: string\n  /** Multi-tenant scope (customer-id, workspace-id). Validator enforces. */\n  knowledgeNamespace: string\n  sources?: ResearchSource[]\n  recencyWindow?: { since?: Date; until?: Date }\n  maxItems?: number\n  /** Per-item minimum confidence in [0, 1]. Validator scores recall vs this. */\n  minConfidence?: number\n}\n\n/**\n * Knowledge item emitted by the researcher.\n *\n * Profile-local type. When agent-knowledge promotes `KnowledgeClaim` →\n * top-level `KnowledgeItem` substrate-wide, these fields collapse 1:1.\n *\n * @experimental\n */\nexport interface KnowledgeItem {\n  id: string\n  /** Multi-tenant scope. MUST equal `task.knowledgeNamespace`. */\n  namespace: string\n  /** The factual claim, in the researcher's words. */\n  claim: string\n  /** Provenance — at least one entry required. */\n  evidence: Array<{ source: string; quote?: string; url?: string; capturedAt: number }>\n  /** Researcher's self-reported confidence in [0, 1]. */\n  confidence: number\n  /** Prior item ids this supersedes (chain). */\n  supersedes?: string[]\n  /** Set if the agent is retracting an earlier item. Unix ms. */\n  retractedAt?: number\n  authoredBy: { kind: 'human' | 'agent'; id: string }\n}\n\n/**\n * A proposed write to the knowledge base. The profile does NOT apply\n * these — the caller decides.\n *\n * @experimental\n */\nexport type KnowledgeUpdate =\n  | { kind: 'insert'; namespace: string; item: KnowledgeItem }\n  | { kind: 'supersede'; namespace: string; previousId: string; item: KnowledgeItem }\n  | { kind: 'retract'; namespace: string; itemId: string; reason: string }\n\n/**\n * Researcher output. Required fields are typed; optional fields preserve\n * the agent's free-form intelligence (`notes`, `raw`). The validator\n * enforces the typed minimum.\n *\n * @experimental\n */\nexport interface ResearchOutput {\n  items: KnowledgeItem[]\n  citations: Array<{ url: string; quote: string; confidence: number }>\n  proposedWrites: KnowledgeUpdate[]\n  gaps?: string[]\n  notes?: string\n  /** Anything the agent emitted beyond the typed fields. */\n  raw?: unknown\n}\n\n/** Options for the source-grounded researcher profile preset. @experimental */\nexport interface ResearcherProfileOptions {\n  /** Caller-owned exact harness/provider/model identity. */\n  profile: AgentProfile\n  /** Custom system prompt replacement. Default = built-in researcher preset. */\n  systemPrompt?: string\n  /** Stable name for `AgentRunSpec.name`. Default = `profile.name`. */\n  name?: string\n  /**\n   * Default 0.7. Minimum (citations with quote) / items ratio for `valid=true`.\n   * Below this floor, citation_density scores < 1 and the item set is gated.\n   */\n  citationDensityMin?: number\n}\n\nconst DEFAULT_CITATION_DENSITY_MIN = 0.7\n\n/** Build a source-grounded researcher profile with output parsing and validation. @experimental */\nexport function researcherProfile(options: ResearcherProfileOptions & { task?: ResearchTask }): {\n  profile: AgentProfile\n  taskToPrompt: (task: ResearchTask) => string\n  output: OutputAdapter<ResearchOutput>\n  validator: Validator<ResearchOutput>\n  agentRunSpec: AgentRunSpec<ResearchTask>\n} {\n  const base = agentProfileSchema.parse(options.profile) as AgentProfile\n  assertExecutableAgentProfile(base, 'researcherProfile')\n  const name = options.name ?? base.name\n  const systemPrompt = options.systemPrompt ?? RESEARCHER_SYSTEM_PROMPT\n  const citationDensityMin = options.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN\n  const profile: AgentProfile = {\n    ...base,\n    name,\n    description: base.description ?? \"Source-grounded research agent. Propose-don't-apply.\",\n    prompt: { ...base.prompt, systemPrompt },\n    tools: { web_search: true, fs: true, shell: true, ...base.tools },\n    metadata: { ...base.metadata, specialty: 'researcher' },\n  }\n  const output: OutputAdapter<ResearchOutput> = { parse: parseResearcherEvents }\n  const validator: Validator<ResearchOutput> = options.task\n    ? createResearcherValidator(options.task, { citationDensityMin })\n    : createResearcherValidator(\n        { question: '', knowledgeNamespace: '' },\n        { citationDensityMin, namespaceCheck: false },\n      )\n  const agentRunSpec: AgentRunSpec<ResearchTask> = {\n    name,\n    profile,\n    taskToPrompt: formatResearcherPrompt,\n  }\n  return { profile, taskToPrompt: formatResearcherPrompt, output, validator, agentRunSpec }\n}\n\n/** @experimental */\ninterface MultiHarnessResearcherFanoutOptions {\n  /** Exact execution profiles, one per parallel researcher. */\n  profiles: ReadonlyArray<AgentProfile>\n  /** Default citation density floor for the shared validator. */\n  citationDensityMin?: number\n  /** Optional task — narrows the validator's namespace check. */\n  task?: ResearchTask\n}\n\n/**\n * Build a fanout topology over multiple harnesses. The kernel round-robins\n * `agentRuns` across the N parallel iterations and the `FanoutVote` driver\n * picks the highest-scoring valid output.\n *\n * @experimental\n */\nexport function multiHarnessResearcherFanout(options: MultiHarnessResearcherFanoutOptions): {\n  agentRuns: AgentRunSpec<ResearchTask>[]\n  output: OutputAdapter<ResearchOutput>\n  validator: Validator<ResearchOutput>\n  driver: Driver<ResearchTask, ResearchOutput, 'done'>\n} {\n  if (options.profiles.length === 0) {\n    throw new ConfigError('multiHarnessResearcherFanout: at least one exact profile is required')\n  }\n  const agentRuns = options.profiles.map((profile) => {\n    const { agentRunSpec } = researcherProfile({ profile })\n    return agentRunSpec\n  })\n  const { output, validator } = researcherProfile({\n    profile: options.profiles[0]!,\n    citationDensityMin: options.citationDensityMin,\n    task: options.task,\n  })\n  // Single fanout round across the N harnesses, then stop: the kernel\n  // round-robins `agentRuns` over the N branches and selects the winner\n  // (best valid score) across all iterations via `defaultSelectWinner`.\n  const driver: Driver<ResearchTask, ResearchOutput, 'done'> = {\n    name: 'researcher-fanout',\n    async plan(task, history) {\n      return history.length === 0 ? Array.from({ length: agentRuns.length }, () => task) : []\n    },\n    // 'done' is a terminal decision in the kernel; the loop finalizes after\n    // the single fanout round and selects the winner via `defaultSelectWinner`.\n    decide() {\n      return 'done'\n    },\n    describePlan() {\n      return { kind: 'fanout' }\n    },\n  }\n  return { agentRuns, output, validator, driver }\n}\n\n/**\n * Build a validator that closes over a specific `ResearchTask`'s constraints.\n *\n * Checks in order:\n *   1. Items must be non-empty.\n *   2. Every item carries `evidence.length >= 1`.\n *   3. Every item + proposedWrite is scoped to `task.knowledgeNamespace`\n *      (hard-fail on any namespace mismatch — defence in depth for the\n *      multi-tenant invariant).\n *   4. Citation density (citations with quote / items) >= floor.\n *\n * Aggregate score:\n *   0.4 · citation_density\n * + 0.2 · source_diversity (distinct sources / max(items, 1))\n * + 0.2 · recency_match (mean fraction within `recencyWindow`)\n * + 0.2 · (1 − gaps/maxGaps), maxGaps = max(items, 1)\n *\n * @experimental\n */\nfunction createResearcherValidator(\n  task: ResearchTask,\n  config: { citationDensityMin?: number; namespaceCheck?: boolean } = {},\n): Validator<ResearchOutput> {\n  const citationDensityMin = config.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN\n  const namespaceCheck = config.namespaceCheck ?? true\n  return {\n    async validate(output) {\n      const notes: string[] = []\n      const scores: Record<string, number> = {}\n      let pass = true\n\n      if (!Array.isArray(output.items) || output.items.length === 0) {\n        pass = false\n        notes.push('no items')\n        scores.items = 0\n      } else {\n        scores.items = 1\n      }\n\n      const missingEvidence = (output.items ?? []).filter(\n        (item) => !Array.isArray(item.evidence) || item.evidence.length === 0,\n      )\n      if (missingEvidence.length > 0) {\n        pass = false\n        notes.push(`${missingEvidence.length} item(s) without evidence`)\n        scores.provenance = 0\n      } else {\n        scores.provenance = 1\n      }\n\n      if (namespaceCheck) {\n        const foreignItems = (output.items ?? []).filter(\n          (item) => item.namespace !== task.knowledgeNamespace,\n        )\n        const foreignWrites = (output.proposedWrites ?? []).filter(\n          (write) => write.namespace !== task.knowledgeNamespace,\n        )\n        if (foreignItems.length > 0 || foreignWrites.length > 0) {\n          pass = false\n          notes.push(\n            `namespace violation: ${foreignItems.length} item(s) + ${foreignWrites.length} write(s) ` +\n              `outside ${task.knowledgeNamespace}`,\n          )\n          scores.namespace = 0\n        } else {\n          scores.namespace = 1\n        }\n      }\n\n      const itemCount = Math.max(output.items?.length ?? 0, 1)\n      const citationsWithQuote = (output.citations ?? []).filter(\n        (citation) => typeof citation.quote === 'string' && citation.quote.length > 0,\n      ).length\n      const citationDensity = Math.min(1, citationsWithQuote / itemCount)\n      if (citationDensity < citationDensityMin) {\n        pass = false\n        notes.push(\n          `citation density ${citationDensity.toFixed(2)} below floor ${citationDensityMin.toFixed(2)}`,\n        )\n      }\n      scores.citation_density = citationDensity\n\n      const sourceSet = new Set<string>()\n      for (const item of output.items ?? []) {\n        for (const evidence of item.evidence ?? []) {\n          if (evidence.source) sourceSet.add(evidence.source)\n        }\n      }\n      scores.source_diversity = Math.min(1, sourceSet.size / itemCount)\n\n      scores.recency_match = recencyMatchScore(output.items ?? [], task.recencyWindow)\n\n      const maxGaps = itemCount\n      const gapCount = output.gaps?.length ?? 0\n      scores.gap_coverage = Math.max(0, 1 - gapCount / maxGaps)\n\n      const score =\n        0.4 * scores.citation_density +\n        0.2 * scores.source_diversity +\n        0.2 * scores.recency_match +\n        0.2 * scores.gap_coverage\n\n      const verdict: DefaultVerdict = {\n        valid: pass,\n        score: Number.isFinite(score) ? score : 0,\n        scores,\n      }\n      if (notes.length > 0) verdict.notes = notes.join('; ')\n      return verdict\n    },\n  }\n}\n\nfunction recencyMatchScore(items: KnowledgeItem[], window: ResearchTask['recencyWindow']): number {\n  if (!window || (window.since === undefined && window.until === undefined)) return 1\n  if (items.length === 0) return 0\n  const sinceMs = window.since?.getTime() ?? Number.NEGATIVE_INFINITY\n  const untilMs = window.until?.getTime() ?? Number.POSITIVE_INFINITY\n  let hits = 0\n  let total = 0\n  for (const item of items) {\n    for (const evidence of item.evidence ?? []) {\n      if (typeof evidence.capturedAt !== 'number') continue\n      total += 1\n      if (evidence.capturedAt >= sinceMs && evidence.capturedAt <= untilMs) hits += 1\n    }\n  }\n  return total === 0 ? 0 : hits / total\n}\n\n/** Built-in source-grounded research contract added to a caller-owned exact profile. */\nconst RESEARCHER_SYSTEM_PROMPT = [\n  'You are a research agent. Your job is to answer a research question with',\n  'source-grounded knowledge items that the caller will choose whether to',\n  'persist to a multi-tenant knowledge base.',\n  '',\n  'Hard rules:',\n  \"  1. Every item you emit MUST carry the task's knowledgeNamespace exactly.\",\n  '     Never write to a different namespace.',\n  '  2. Every item MUST carry at least one evidence entry with a source.',\n  '     A quote + url is strongly preferred; capturedAt is unix ms.',\n  '  3. You propose writes — you do NOT apply them. The caller decides.',\n  '  4. Self-report confidence honestly in [0, 1]. Do not inflate.',\n  '  5. List what you could not answer in `gaps`. Better to admit a gap',\n  '     than fabricate.',\n  '',\n  'When you finish, emit a single final structured message of the shape:',\n  '  ```json',\n  '  { \"items\": [{ \"id\": \"...\", \"namespace\": \"...\", \"claim\": \"...\",',\n  '                \"evidence\": [{ \"source\": \"...\", \"quote\": \"...\",',\n  '                               \"url\": \"...\", \"capturedAt\": 0 }],',\n  '                \"confidence\": 0.0,',\n  '                \"authoredBy\": { \"kind\": \"agent\", \"id\": \"...\" } }],',\n  '    \"citations\": [{ \"url\": \"...\", \"quote\": \"...\", \"confidence\": 0.0 }],',\n  '    \"proposedWrites\": [{ \"kind\": \"insert\", \"namespace\": \"...\",',\n  '                         \"item\": { /* same shape as items[] */ } }],',\n  '    \"gaps\": [\"...\"],',\n  '    \"notes\": \"free-form commentary\" }',\n  '  ```',\n].join('\\n')\n\nfunction formatResearcherPrompt(task: ResearchTask): string {\n  const sources = task.sources?.length ? task.sources.join(', ') : '(no preference)'\n  const window = formatRecencyWindow(task.recencyWindow)\n  return [\n    `Question: ${task.question}`,\n    `Knowledge namespace (DO NOT cross): ${task.knowledgeNamespace}`,\n    `Scope: ${task.scope ?? '(unspecified)'}`,\n    `Preferred sources: ${sources}`,\n    `Recency window: ${window}`,\n    `Max items: ${task.maxItems ?? '(no cap)'}`,\n    `Per-item minimum confidence: ${task.minConfidence ?? '(no floor)'}`,\n    '',\n    'Produce knowledge items with provenance + citations + proposed writes.',\n    'List gaps for anything you could not answer. Emit the final JSON',\n    'result block exactly as instructed.',\n  ].join('\\n')\n}\n\nfunction formatRecencyWindow(window: ResearchTask['recencyWindow']): string {\n  if (!window) return '(none)'\n  const since = window.since ? window.since.toISOString() : '-∞'\n  const until = window.until ? window.until.toISOString() : 'now'\n  return `${since} .. ${until}`\n}\n\n/**\n * Walk the event stream and return the last structured `research.result`\n * payload. Falls back to scanning text deltas for a fenced JSON block.\n */\nfunction parseResearcherEvents(events: SandboxEvent[]): ResearchOutput {\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const type = String(event.type ?? '')\n    const data = isRecord(event.data) ? event.data : {}\n    if (type === 'result' || type === 'final' || type === 'research.result') {\n      const direct = coerceResearchOutput(data.result ?? data.output ?? data)\n      // opencode reports the agent's terminal answer in `finalText` (not result/output).\n      // Parse it too, and prefer it when `direct` is an all-empty shape — otherwise an\n      // event carrying both `{items:[],citations:[],proposedWrites:[]}` and a rich\n      // finalText would silently drop the real answer.\n      const finalText = pickString(data.finalText)\n      const fenced = finalText ? extractFencedJson(finalText) : undefined\n      const fromFinalText = fenced ? coerceResearchOutput(fenced) : undefined\n      if (direct && !isEmptyOutput(direct)) return direct\n      if (fromFinalText) return fromFinalText\n      if (direct) return direct\n    }\n  }\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const data = isRecord(event.data) ? event.data : {}\n    const text = pickString(data.text) ?? pickString(data.delta) ?? pickString(data.finalText)\n    if (!text) continue\n    const fenced = extractFencedJson(text)\n    if (!fenced) continue\n    const coerced = coerceResearchOutput(fenced)\n    if (coerced) return coerced\n  }\n  return { items: [], citations: [], proposedWrites: [] }\n}\n\n/** A coerced output that carries no items, citations, or proposed writes. */\nfunction isEmptyOutput(o: ResearchOutput): boolean {\n  return o.items.length === 0 && o.citations.length === 0 && o.proposedWrites.length === 0\n}\n\nfunction pickString(value: unknown): string | undefined {\n  return typeof value === 'string' && value.length > 0 ? value : undefined\n}\n\nfunction extractFencedJson(text: string): unknown | undefined {\n  const match = text.match(/```(?:json)?\\s*([\\s\\S]*?)```/i)\n  if (!match) return undefined\n  const body = (match[1] ?? '').trim()\n  if (!body) return undefined\n  try {\n    return JSON.parse(body)\n  } catch {\n    return undefined\n  }\n}\n\nfunction coerceResearchOutput(value: unknown): ResearchOutput | undefined {\n  if (!isRecord(value)) return undefined\n  const items = coerceItems(value.items)\n  const citations = coerceCitations(value.citations)\n  const proposedWrites = coerceProposedWrites(value.proposedWrites)\n  // Reject completely empty payloads — those signal \"no result block\",\n  // not \"a valid empty result\".\n  if (items === undefined && citations === undefined && proposedWrites === undefined) {\n    return undefined\n  }\n  const output: ResearchOutput = {\n    items: items ?? [],\n    citations: citations ?? [],\n    proposedWrites: proposedWrites ?? [],\n  }\n  if (Array.isArray(value.gaps)) {\n    output.gaps = value.gaps.filter((entry): entry is string => typeof entry === 'string')\n  }\n  const notes = pickString(value.notes)\n  if (notes) output.notes = notes\n  // Preserve any extra fields the agent emitted that don't fit the typed\n  // surface — callers can inspect `raw` without forcing them through the\n  // typed coercion. We only include `raw` when the agent emitted fields\n  // beyond the known set.\n  const known = new Set(['items', 'citations', 'proposedWrites', 'gaps', 'notes'])\n  const extras: Record<string, unknown> = {}\n  let extrasCount = 0\n  for (const [key, val] of Object.entries(value)) {\n    if (known.has(key)) continue\n    extras[key] = val\n    extrasCount += 1\n  }\n  if (extrasCount > 0) output.raw = extras\n  return output\n}\n\nfunction coerceItems(value: unknown): KnowledgeItem[] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: KnowledgeItem[] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const id = pickString(entry.id)\n    const namespace = pickString(entry.namespace)\n    const claim = pickString(entry.claim)\n    const evidence = coerceEvidence(entry.evidence)\n    const confidence = toFiniteNumber(entry.confidence)\n    const authoredBy = coerceAuthoredBy(entry.authoredBy)\n    if (!id || !namespace || !claim || !authoredBy) continue\n    const item: KnowledgeItem = {\n      id,\n      namespace,\n      claim,\n      evidence,\n      confidence: clamp01(confidence),\n      authoredBy,\n    }\n    if (Array.isArray(entry.supersedes)) {\n      item.supersedes = entry.supersedes.filter((s): s is string => typeof s === 'string')\n    }\n    const retractedAt = toFiniteNumber(entry.retractedAt)\n    if (retractedAt > 0) item.retractedAt = retractedAt\n    out.push(item)\n  }\n  return out\n}\n\nfunction coerceEvidence(value: unknown): KnowledgeItem['evidence'] {\n  if (!Array.isArray(value)) return []\n  const out: KnowledgeItem['evidence'] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const source = pickString(entry.source)\n    if (!source) continue\n    const item: KnowledgeItem['evidence'][number] = {\n      source,\n      capturedAt: toFiniteNumber(entry.capturedAt),\n    }\n    const quote = pickString(entry.quote)\n    if (quote) item.quote = quote\n    const url = pickString(entry.url)\n    if (url) item.url = url\n    out.push(item)\n  }\n  return out\n}\n\nfunction coerceAuthoredBy(value: unknown): KnowledgeItem['authoredBy'] | undefined {\n  if (!isRecord(value)) return undefined\n  const kind = value.kind === 'human' || value.kind === 'agent' ? value.kind : undefined\n  const id = pickString(value.id)\n  if (!kind || !id) return undefined\n  return { kind, id }\n}\n\nfunction coerceCitations(value: unknown): ResearchOutput['citations'] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: ResearchOutput['citations'] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const url = pickString(entry.url)\n    const quote = pickString(entry.quote)\n    if (!url || !quote) continue\n    out.push({ url, quote, confidence: clamp01(toFiniteNumber(entry.confidence)) })\n  }\n  return out\n}\n\nfunction coerceProposedWrites(value: unknown): KnowledgeUpdate[] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: KnowledgeUpdate[] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const namespace = pickString(entry.namespace)\n    if (!namespace) continue\n    if (entry.kind === 'insert') {\n      const items = coerceItems([entry.item])\n      const item = items?.[0]\n      if (!item) continue\n      out.push({ kind: 'insert', namespace, item })\n    } else if (entry.kind === 'supersede') {\n      const previousId = pickString(entry.previousId)\n      const items = coerceItems([entry.item])\n      const item = items?.[0]\n      if (!previousId || !item) continue\n      out.push({ kind: 'supersede', namespace, previousId, item })\n    } else if (entry.kind === 'retract') {\n      const itemId = pickString(entry.itemId)\n      const reason = pickString(entry.reason)\n      if (!itemId || !reason) continue\n      out.push({ kind: 'retract', namespace, itemId, reason })\n    }\n  }\n  return out\n}\n\nfunction toFiniteNumber(value: unknown): number {\n  return typeof value === 'number' && Number.isFinite(value) ? value : 0\n}\n\nfunction clamp01(value: number): number {\n  if (!Number.isFinite(value)) return 0\n  if (value < 0) return 0\n  if (value > 1) return 1\n  return value\n}\n","/**\n *\n * Per-lens guidance the auditor inlines into its system prompt for an\n * iteration. Each entry is a self-contained brief — the same content the\n * standalone ui-issue-finder skill ships, embedded as a string constant so\n * agent-runtime carries no runtime dep on that external workspace.\n *\n * Briefs are deliberately concrete: they enumerate the SIGNALS to look for\n * and the cross-lens distinctions to respect, so the judge files fewer\n * pile-on findings under generic labels.\n *\n * @experimental\n */\n\nimport type { UiLens } from './substrate'\n\n/** Cross-lens rules injected into every UI audit iteration: finding quality standards and scope limits. @experimental */\nexport const SHARED_AUDITOR_RULES = `\nYou are auditing a UI for a specific class of problems. Stay strictly in your assigned lens — do not file issues that belong to another lens (a separate iteration will catch those).\n\nA finding is only valid if a thoughtful product designer would agree the screenshot shows something that should change. Avoid:\n- Personal taste (\"I'd prefer brand blue\").\n- Hallucinated text or controls you cannot actually see in the screenshot.\n- Suggestions that depend on requirements you don't have access to.\n- Pile-on findings about the same root cause — file ONE finding and use \\`similarTo\\` to link the rest.\n\nRequired for every finding:\n- title: concrete, names the offending element AND what's wrong (NOT \"improve UX\").\n- severity: critical=blocks a core task or accessibility blocker; high=noticeable friction; med=visible polish issue; low=nitpick.\n- observation: 1–3 sentences describing exactly what you see that is wrong.\n- impact: who is affected and how (concrete).\n- suggestedFix: a specific change a developer could apply without asking you back.\n- screenshots: refer to the captures attached to this iteration by path.\n- selector: when you can pin the offending element with a CSS selector.\n\nMost findings are med or low. Reserve high/critical for genuine blockers.\n`.trim()\n\n/** Per-lens auditor briefs: concrete signals to look for and cross-lens distinctions to respect. @experimental */\nexport const LENS_BRIEFS: Record<UiLens, string> = {\n  consistency: `\nLENS: consistency\nLook for inconsistencies in the design system — things that look like they came from different products glued together.\nSignals: multiple font families, inconsistent weights/sizes for the same role, two shades of \"primary\", arbitrary paddings/margins that don't snap to a scale (4/8/12/16/24), same control with different border-radius or shadow on different pages, mixed icon styles (filled vs outlined), inconsistent button heights/padding for the same variant, inconsistent capitalization (Title Case vs sentence case) for the same role.\nNOT this lens: layout misalignment (use \\`layout\\`), confusing user flow (use \\`ux-flow\\`), contrast/keyboard issues (use \\`accessibility\\`).\nTitle format: \\`Inconsistent <thing> between <A> and <B>\\`.\n`.trim(),\n  hierarchy: `\nLENS: hierarchy\nLook for broken visual hierarchy — places where the eye does not land on what matters most.\nSignals: primary CTA same weight as secondary/tertiary controls, headings (H1/H2/H3) nearly the same size, important data buried (headline number smaller than its label), decoration outshining content, too many emphases competing, wrong scan order, missing or overly heavy section dividers.\nNOT this lens: same-role styled differently (\\`consistency\\`), grid/alignment (\\`layout\\`), contrast-failing text (\\`accessibility\\`).\nTitle format: \\`Weak hierarchy: <element> does not read as the <intended-role>\\`.\n`.trim(),\n  layout: `\nLENS: layout\nLook for layout and organization problems — alignment, grouping, whitespace, structural choices that hurt scannability.\nSignals: misalignment within rows, inconsistent gutters in grids, orphan whitespace next to crammed regions, poor grouping (related fields separated, unrelated fields adjacent), no visual sections (long wall of content), container overflow (text/content punching out of card boundaries), cramped or oversized hit targets, sidebars/headers sized wrong relative to main content.\nNOT this lens: same-role styled differently (\\`consistency\\`), click-distance/friction (\\`ux-flow\\`), overflow specifically at small viewports (\\`responsive\\`).\nTitle format: \\`<Region> alignment/spacing problem\\` or \\`<Region> grouping unclear\\`.\n`.trim(),\n  'ux-flow': `\nLENS: ux-flow\nLook for interaction-flow friction — action sequences that are slower, more annoying, or more error-prone than necessary.\nSignals: sequential clicks far apart (e.g. Next top-right while user is bottom-left), destructive action adjacent to primary with same weight, confirmations that don't say what's being confirmed, primary CTA below the fold or hidden in a kebab menu, silent state changes (toggle gives no feedback), form ordering that fights real-world order, dead-end states after submit, lost inputs on back-navigation, hidden pre-selected options.\nNOT this lens: visual style only (\\`consistency\\`), component arrangement without a flow problem (\\`layout\\`), microcopy clarity (\\`content\\`).\nTitle format: \\`<Action A> → <Action B> friction: <root cause>\\`.\n`.trim(),\n  duplication: `\nLENS: duplication\nLook for redundancy — the same control, link, or piece of content appearing more than once with no good reason.\nSignals: two ways to do the same action on the same screen with no difference, repeated nav (same links in sidebar AND top nav), drifted duplicates (two copies that have diverged), content repeated verbatim, icon + label saying the same thing twice in one row, per-row + bulk actions that overlap confusingly, multiple status indicators conveying the same status.\nNOT this lens: inconsistent styling of duplicates (\\`consistency\\`) — this lens is about the existence of duplicates.\nTitle format: \\`Duplicate <thing> in <location A> and <location B>\\`.\n`.trim(),\n  accessibility: `\nLENS: accessibility\nLook for accessibility blockers and degradations. Be conservative — do not assume violations you cannot see.\nSignals: insufficient contrast on body text or controls, missing/invisible focus styles, tiny tap targets (<24px on mobile), color as sole signal (red border with no message), form labels missing or not associated (placeholders standing in for labels), broken heading order (H1 → H4), modals that don't trap focus, decorative elements that take focus, errors not announced, important text rendered inside images.\nNOT this lens: generic \"looks confusing\" (\\`hierarchy\\` or \\`content\\`), layout overflow at small viewports (\\`responsive\\`).\nTitle format: \\`Accessibility: <specific blocker> in <element>\\`.\n`.trim(),\n  responsive: `\nLENS: responsive\nLook for layout breakage across viewport sizes — content that works at one width but degrades at another. This iteration's captures should include the same surface at >=2 viewports; compare across them.\nSignals: horizontal scroll where content should reflow, overlapping elements (header overlaps content, fixed footer covers inputs), desktop nav crammed into mobile without collapsing, table columns that don't truncate, tap targets too close at touch sizes, controls vanishing at certain widths, layout flips that break grouping order, modals exceeding viewport height (confirm button unreachable).\nNOT this lens: issues present at every viewport (\\`consistency\\` / \\`hierarchy\\` instead).\nTitle format: \\`<Element/Region> breaks at <viewport>\\`.\n`.trim(),\n  states: `\nLENS: states\nLook for missing or broken UI states — the not-happy-paths that make a product feel finished or unfinished. The iteration's captures should depict at least one non-default state.\nSignals: empty lists with no guidance, skeletons that don't match final layout (CLS on settle), error states with no message or recovery action, disabled buttons with no explanation, toasts that disappear before being read, success states that don't confirm, missing hover/focus/active/disabled variants on primary controls, no long-content view, no-permission state broken.\nNOT this lens: generic polish on the happy path (other lenses), missing focus rings specifically (\\`accessibility\\`).\nTitle format: \\`Missing/broken <state> state on <surface>\\`.\n`.trim(),\n  content: `\nLENS: content\nLook for microcopy and content problems — text that is unclear, inconsistent, condescending, jargon-heavy, or wrong.\nSignals: jargon/internal language leaking (\"Provisioning a Tenant\" instead of \"Setting up your account\"), inconsistent terminology (workspace vs team), verbose button labels, empty-state copy that's just \"No results\", error messages blaming the user, tone inconsistency, truncation without affordance, mixed date/number formats on one page, placeholder used as a label, \"Saved!\" toast appearing before save completes, typos and grammar errors.\nNOT this lens: visual treatment of text (\\`hierarchy\\` / \\`consistency\\`), missing labels for a11y (\\`accessibility\\`).\nTitle format: \\`Copy: \"<actual text>\" in <location>\\` or \\`Inconsistent term: \"<A>\" vs \"<B>\"\\`.\n`.trim(),\n  interaction: `\nLENS: interaction\nLook for interaction quality problems — affordances, feedback, and micro-interactions.\nSignals: no affordance (clickable areas not looking clickable, non-clickable areas looking clickable), missing feedback (>100ms click with no progress), hover surprises (whole row highlights but only title clickable), cursor inconsistency, animations that block input, missing transitions where they're needed (accordion snaps open), drag-and-drop without indicators, scroll-jacking, click-through bugs (card click handler firing alongside button), hover-only revelations on touch.\nNOT this lens: position of controls (\\`layout\\` / \\`ux-flow\\`), missing focus styles (\\`accessibility\\`).\nTitle format: \\`<Action> on <element>: <missing/wrong> feedback\\`.\n`.trim(),\n  'performance-perceived': `\nLENS: performance-perceived\nLook for perceived-performance problems — visible jank a real user would notice, not benchmark numbers. This iteration's captures should include >=2 frames during load to show shift.\nSignals: layout shift (CLS) when late-arriving images/fonts/banners settle, FOUC (flash of unstyled content), font swap jumps, late-loading hero images that shift everything, skeletons that don't match final shape, spinners on instant local actions, loading state reappearing after content paints (refetch on focus), modal open animation longer than the operation it precedes.\nNOT this lens: slow API calls (file separately), stale data after navigation (\\`states\\`).\nTitle format: \\`Layout shift / late paint on <route>: <root cause>\\`.\n`.trim(),\n  other: `\nLENS: other\nUse ONLY when a finding is clearly a UI quality issue but does not fit any other lens. Strongly prefer a specific lens — \\`other\\` should be rare. Title must still be concrete.\n`.trim(),\n}\n\n/**\n * Build a system prompt for a single auditor iteration.\n *\n * @experimental\n */\nexport function buildAuditorSystemPrompt(lens: UiLens): string {\n  const brief = LENS_BRIEFS[lens]\n  return `${SHARED_AUDITOR_RULES}\\n\\n${brief}`\n}\n","/**\n *\n * Sandbox-event stream → UiAuditOutput decoder. The custom auditor\n * `SandboxClient` emits events of the form:\n *\n *   { type: 'audit.capture', data: UiAuditCapture }\n *   { type: 'audit.finding', data: UiFinding }\n *   { type: 'audit.notes',   data: { notes: string } }\n *   { type: 'audit.lens',    data: { lens: UiLens } }\n *   { type: 'done',          data: { tokenUsage: { ... }, totalCostUsd?: number } }\n *\n * Other event types are tolerated and ignored. The adapter is pure: it\n * folds an already-collected event array into a UiAuditOutput.\n *\n * @experimental\n */\n\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { UI_LENSES, type UiFinding, type UiLens } from './substrate'\nimport type { UiAuditCapture, UiAuditOutput } from './task'\n\n// Build the lens-validation set from the canonical UI_LENSES tuple so adding\n// a lens to the substrate automatically extends the parser; otherwise a new\n// lens would silently fail isUiLens() and parseAuditorEvents would drop\n// every event using it.\nconst KNOWN_LENS_VALUES = new Set<UiLens>(UI_LENSES)\n\nfunction isUiLens(v: unknown): v is UiLens {\n  return typeof v === 'string' && KNOWN_LENS_VALUES.has(v as UiLens)\n}\n\n/** Parse raw `SandboxEvent` emissions from an audit iteration into structured `UiAuditOutput`. @experimental */\nexport function parseAuditorEvents(events: SandboxEvent[]): UiAuditOutput {\n  const findings: UiFinding[] = []\n  const captures: UiAuditCapture[] = []\n  let lens: UiLens | undefined\n  let notes: string | undefined\n\n  for (const evt of events) {\n    if (!evt || typeof evt !== 'object') continue\n    const type = String(evt.type ?? '')\n    const data =\n      evt.data && typeof evt.data === 'object' ? (evt.data as Record<string, unknown>) : undefined\n    if (!data) continue\n\n    switch (type) {\n      case 'audit.lens': {\n        const v = data.lens\n        if (isUiLens(v)) lens = v\n        break\n      }\n      case 'audit.capture': {\n        const cap = data as unknown as Partial<UiAuditCapture>\n        if (\n          typeof cap.path === 'string' &&\n          typeof cap.viewport === 'string' &&\n          typeof cap.fullPage === 'boolean' &&\n          typeof cap.route === 'string' &&\n          typeof cap.url === 'string' &&\n          typeof cap.capturedAt === 'string'\n        ) {\n          const out: UiAuditCapture = {\n            path: cap.path,\n            viewport: cap.viewport,\n            fullPage: cap.fullPage,\n            route: cap.route,\n            url: cap.url,\n            capturedAt: cap.capturedAt,\n          }\n          if (cap.elementSelector) out.elementSelector = cap.elementSelector\n          if (cap.label) out.label = cap.label\n          captures.push(out)\n        }\n        break\n      }\n      case 'audit.finding': {\n        const f = data as unknown as Partial<UiFinding>\n        // Hard requirement: all the actionable fields must be present and\n        // non-empty for a finding to enter the output. The validator does the\n        // softer scoring; the adapter only filters structural junk.\n        if (\n          typeof f.title === 'string' &&\n          f.title.trim().length > 0 &&\n          isUiLens(f.lens) &&\n          typeof f.severity === 'string' &&\n          ['low', 'med', 'high', 'critical'].includes(f.severity) &&\n          typeof f.route === 'string' &&\n          typeof f.observation === 'string' &&\n          typeof f.impact === 'string' &&\n          typeof f.suggestedFix === 'string' &&\n          Array.isArray(f.screenshots)\n        ) {\n          findings.push(f as UiFinding)\n        }\n        break\n      }\n      case 'audit.notes': {\n        const n = data.notes\n        if (typeof n === 'string' && n.trim().length > 0) notes = n\n        break\n      }\n      default:\n        // Tolerate cost/usage events and other backend chatter — extractLlmCallEvent\n        // in run-loop.ts handles cost accounting upstream from the adapter.\n        break\n    }\n  }\n\n  const out: UiAuditOutput = { lens: lens ?? 'other', findings, captures }\n  if (notes) out.notes = notes\n  return out\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6HA,MAAM,+BAA+B;;AAGrC,SAAgB,kBAAkB,SAMhC;CACA,MAAM,OAAO,mBAAmB,MAAM,QAAQ,OAAO;CACrD,6BAA6B,MAAM,mBAAmB;CACtD,MAAM,OAAO,QAAQ,QAAQ,KAAK;CAClC,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,MAAM,qBAAqB,QAAQ,sBAAsB;CACzD,MAAM,UAAwB;EAC5B,GAAG;EACH;EACA,aAAa,KAAK,eAAe;EACjC,QAAQ;GAAE,GAAG,KAAK;GAAQ;EAAa;EACvC,OAAO;GAAE,YAAY;GAAM,IAAI;GAAM,OAAO;GAAM,GAAG,KAAK;EAAM;EAChE,UAAU;GAAE,GAAG,KAAK;GAAU,WAAW;EAAa;CACxD;CAaA,OAAO;EAAE;EAAS,cAAc;EAAwB,QAAA,EAZR,OAAO,sBAYM;EAAG,WAXnB,QAAQ,OACjD,0BAA0B,QAAQ,MAAM,EAAE,mBAAmB,CAAC,IAC9D,0BACE;GAAE,UAAU;GAAI,oBAAoB;EAAG,GACvC;GAAE;GAAoB,gBAAgB;EAAM,CAC9C;EAMuE,cAAA;GAJzE;GACA;GACA,cAAc;EAEsE;CAAE;AAC1F;;;;;;;;;;;;;;;;;;;;AA4EA,SAAS,0BACP,MACA,SAAoE,CAAC,GAC1C;CAC3B,MAAM,qBAAqB,OAAO,sBAAsB;CACxD,MAAM,iBAAiB,OAAO,kBAAkB;CAChD,OAAO,EACL,MAAM,SAAS,QAAQ;EACrB,MAAM,QAAkB,CAAC;EACzB,MAAM,SAAiC,CAAC;EACxC,IAAI,OAAO;EAEX,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,KAAK,OAAO,MAAM,WAAW,GAAG;GAC7D,OAAO;GACP,MAAM,KAAK,UAAU;GACrB,OAAO,QAAQ;EACjB,OACE,OAAO,QAAQ;EAGjB,MAAM,mBAAmB,OAAO,SAAS,CAAC,EAAA,CAAG,QAC1C,SAAS,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,WAAW,CACtE;EACA,IAAI,gBAAgB,SAAS,GAAG;GAC9B,OAAO;GACP,MAAM,KAAK,GAAG,gBAAgB,OAAO,0BAA0B;GAC/D,OAAO,aAAa;EACtB,OACE,OAAO,aAAa;EAGtB,IAAI,gBAAgB;GAClB,MAAM,gBAAgB,OAAO,SAAS,CAAC,EAAA,CAAG,QACvC,SAAS,KAAK,cAAc,KAAK,kBACpC;GACA,MAAM,iBAAiB,OAAO,kBAAkB,CAAC,EAAA,CAAG,QACjD,UAAU,MAAM,cAAc,KAAK,kBACtC;GACA,IAAI,aAAa,SAAS,KAAK,cAAc,SAAS,GAAG;IACvD,OAAO;IACP,MAAM,KACJ,wBAAwB,aAAa,OAAO,aAAa,cAAc,OAAO,oBACjE,KAAK,oBACpB;IACA,OAAO,YAAY;GACrB,OACE,OAAO,YAAY;EAEvB;EAEA,MAAM,YAAY,KAAK,IAAI,OAAO,OAAO,UAAU,GAAG,CAAC;EACvD,MAAM,sBAAsB,OAAO,aAAa,CAAC,EAAA,CAAG,QACjD,aAAa,OAAO,SAAS,UAAU,YAAY,SAAS,MAAM,SAAS,CAC9E,CAAC,CAAC;EACF,MAAM,kBAAkB,KAAK,IAAI,GAAG,qBAAqB,SAAS;EAClE,IAAI,kBAAkB,oBAAoB;GACxC,OAAO;GACP,MAAM,KACJ,oBAAoB,gBAAgB,QAAQ,CAAC,EAAE,eAAe,mBAAmB,QAAQ,CAAC,GAC5F;EACF;EACA,OAAO,mBAAmB;EAE1B,MAAM,4BAAY,IAAI,IAAY;EAClC,KAAK,MAAM,QAAQ,OAAO,SAAS,CAAC,GAClC,KAAK,MAAM,YAAY,KAAK,YAAY,CAAC,GACvC,IAAI,SAAS,QAAQ,UAAU,IAAI,SAAS,MAAM;EAGtD,OAAO,mBAAmB,KAAK,IAAI,GAAG,UAAU,OAAO,SAAS;EAEhE,OAAO,gBAAgB,kBAAkB,OAAO,SAAS,CAAC,GAAG,KAAK,aAAa;EAE/E,MAAM,UAAU;EAChB,MAAM,WAAW,OAAO,MAAM,UAAU;EACxC,OAAO,eAAe,KAAK,IAAI,GAAG,IAAI,WAAW,OAAO;EAExD,MAAM,QACJ,KAAM,OAAO,mBACb,KAAM,OAAO,mBACb,KAAM,OAAO,gBACb,KAAM,OAAO;EAEf,MAAM,UAA0B;GAC9B,OAAO;GACP,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;GACxC;EACF;EACA,IAAI,MAAM,SAAS,GAAG,QAAQ,QAAQ,MAAM,KAAK,IAAI;EACrD,OAAO;CACT,EACF;AACF;AAEA,SAAS,kBAAkB,OAAwB,QAA+C;CAChG,IAAI,CAAC,UAAW,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU,KAAA,GAAY,OAAO;CAClF,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,MAAM,UAAU,OAAO,OAAO,QAAQ,KAAK,OAAO;CAClD,MAAM,UAAU,OAAO,OAAO,QAAQ,KAAK,OAAO;CAClD,IAAI,OAAO;CACX,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,YAAY,KAAK,YAAY,CAAC,GAAG;EAC1C,IAAI,OAAO,SAAS,eAAe,UAAU;EAC7C,SAAS;EACT,IAAI,SAAS,cAAc,WAAW,SAAS,cAAc,SAAS,QAAQ;CAChF;CAEF,OAAO,UAAU,IAAI,IAAI,OAAO;AAClC;;AAGA,MAAM,2BAA2B;CAC/B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,IAAI;AAEX,SAAS,uBAAuB,MAA4B;CAC1D,MAAM,UAAU,KAAK,SAAS,SAAS,KAAK,QAAQ,KAAK,IAAI,IAAI;CACjE,MAAM,SAAS,oBAAoB,KAAK,aAAa;CACrD,OAAO;EACL,aAAa,KAAK;EAClB,uCAAuC,KAAK;EAC5C,UAAU,KAAK,SAAS;EACxB,sBAAsB;EACtB,mBAAmB;EACnB,cAAc,KAAK,YAAY;EAC/B,gCAAgC,KAAK,iBAAiB;EACtD;EACA;EACA;EACA;CACF,CAAC,CAAC,KAAK,IAAI;AACb;AAEA,SAAS,oBAAoB,QAA+C;CAC1E,IAAI,CAAC,QAAQ,OAAO;CAGpB,OAAO,GAFO,OAAO,QAAQ,OAAO,MAAM,YAAY,IAAI,KAE1C,MADF,OAAO,QAAQ,OAAO,MAAM,YAAY,IAAI;AAE5D;;;;;AAMA,SAAS,sBAAsB,QAAwC;CACrE,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC9C,MAAM,QAAQ,OAAO;EACrB,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,OAAO,MAAM,QAAQ,EAAE;EACpC,MAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;EAClD,IAAI,SAAS,YAAY,SAAS,WAAW,SAAS,mBAAmB;GACvE,MAAM,SAAS,qBAAqB,KAAK,UAAU,KAAK,UAAU,IAAI;GAKtE,MAAM,YAAY,WAAW,KAAK,SAAS;GAC3C,MAAM,SAAS,YAAY,kBAAkB,SAAS,IAAI,KAAA;GAC1D,MAAM,gBAAgB,SAAS,qBAAqB,MAAM,IAAI,KAAA;GAC9D,IAAI,UAAU,CAAC,cAAc,MAAM,GAAG,OAAO;GAC7C,IAAI,eAAe,OAAO;GAC1B,IAAI,QAAQ,OAAO;EACrB;CACF;CACA,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC9C,MAAM,QAAQ,OAAO;EACrB,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;EAClD,MAAM,OAAO,WAAW,KAAK,IAAI,KAAK,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,SAAS;EACzF,IAAI,CAAC,MAAM;EACX,MAAM,SAAS,kBAAkB,IAAI;EACrC,IAAI,CAAC,QAAQ;EACb,MAAM,UAAU,qBAAqB,MAAM;EAC3C,IAAI,SAAS,OAAO;CACtB;CACA,OAAO;EAAE,OAAO,CAAC;EAAG,WAAW,CAAC;EAAG,gBAAgB,CAAC;CAAE;AACxD;;AAGA,SAAS,cAAc,GAA4B;CACjD,OAAO,EAAE,MAAM,WAAW,KAAK,EAAE,UAAU,WAAW,KAAK,EAAE,eAAe,WAAW;AACzF;AAEA,SAAS,WAAW,OAAoC;CACtD,OAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ,KAAA;AACjE;AAEA,SAAS,kBAAkB,MAAmC;CAC5D,MAAM,QAAQ,KAAK,MAAM,+BAA+B;CACxD,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,QAAQ,MAAM,MAAM,GAAA,CAAI,KAAK;CACnC,IAAI,CAAC,MAAM,OAAO,KAAA;CAClB,IAAI;EACF,OAAO,KAAK,MAAM,IAAI;CACxB,QAAQ;EACN;CACF;AACF;AAEA,SAAS,qBAAqB,OAA4C;CACxE,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,QAAQ,YAAY,MAAM,KAAK;CACrC,MAAM,YAAY,gBAAgB,MAAM,SAAS;CACjD,MAAM,iBAAiB,qBAAqB,MAAM,cAAc;CAGhE,IAAI,UAAU,KAAA,KAAa,cAAc,KAAA,KAAa,mBAAmB,KAAA,GACvE;CAEF,MAAM,SAAyB;EAC7B,OAAO,SAAS,CAAC;EACjB,WAAW,aAAa,CAAC;EACzB,gBAAgB,kBAAkB,CAAC;CACrC;CACA,IAAI,MAAM,QAAQ,MAAM,IAAI,GAC1B,OAAO,OAAO,MAAM,KAAK,QAAQ,UAA2B,OAAO,UAAU,QAAQ;CAEvF,MAAM,QAAQ,WAAW,MAAM,KAAK;CACpC,IAAI,OAAO,OAAO,QAAQ;CAK1B,MAAM,wBAAQ,IAAI,IAAI;EAAC;EAAS;EAAa;EAAkB;EAAQ;CAAO,CAAC;CAC/E,MAAM,SAAkC,CAAC;CACzC,IAAI,cAAc;CAClB,KAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,KAAK,GAAG;EAC9C,IAAI,MAAM,IAAI,GAAG,GAAG;EACpB,OAAO,OAAO;EACd,eAAe;CACjB;CACA,IAAI,cAAc,GAAG,OAAO,MAAM;CAClC,OAAO;AACT;AAEA,SAAS,YAAY,OAA6C;CAChE,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,KAAK,WAAW,MAAM,EAAE;EAC9B,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,MAAM,WAAW,eAAe,MAAM,QAAQ;EAC9C,MAAM,aAAa,eAAe,MAAM,UAAU;EAClD,MAAM,aAAa,iBAAiB,MAAM,UAAU;EACpD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY;EAChD,MAAM,OAAsB;GAC1B;GACA;GACA;GACA;GACA,YAAY,QAAQ,UAAU;GAC9B;EACF;EACA,IAAI,MAAM,QAAQ,MAAM,UAAU,GAChC,KAAK,aAAa,MAAM,WAAW,QAAQ,MAAmB,OAAO,MAAM,QAAQ;EAErF,MAAM,cAAc,eAAe,MAAM,WAAW;EACpD,IAAI,cAAc,GAAG,KAAK,cAAc;EACxC,IAAI,KAAK,IAAI;CACf;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAA2C;CACjE,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC;CACnC,MAAM,MAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,SAAS,WAAW,MAAM,MAAM;EACtC,IAAI,CAAC,QAAQ;EACb,MAAM,OAA0C;GAC9C;GACA,YAAY,eAAe,MAAM,UAAU;EAC7C;EACA,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,IAAI,OAAO,KAAK,QAAQ;EACxB,MAAM,MAAM,WAAW,MAAM,GAAG;EAChC,IAAI,KAAK,KAAK,MAAM;EACpB,IAAI,KAAK,IAAI;CACf;CACA,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAyD;CACjF,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,OAAO,MAAM,SAAS,WAAW,MAAM,SAAS,UAAU,MAAM,OAAO,KAAA;CAC7E,MAAM,KAAK,WAAW,MAAM,EAAE;CAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,OAAO,KAAA;CACzB,OAAO;EAAE;EAAM;CAAG;AACpB;AAEA,SAAS,gBAAgB,OAAyD;CAChF,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAmC,CAAC;CAC1C,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,MAAM,WAAW,MAAM,GAAG;EAChC,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,IAAI,CAAC,OAAO,CAAC,OAAO;EACpB,IAAI,KAAK;GAAE;GAAK;GAAO,YAAY,QAAQ,eAAe,MAAM,UAAU,CAAC;EAAE,CAAC;CAChF;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,OAA+C;CAC3E,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAyB,CAAC;CAChC,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,IAAI,CAAC,WAAW;EAChB,IAAI,MAAM,SAAS,UAAU;GAE3B,MAAM,OADQ,YAAY,CAAC,MAAM,IAAI,CACpB,CAAC,GAAG;GACrB,IAAI,CAAC,MAAM;GACX,IAAI,KAAK;IAAE,MAAM;IAAU;IAAW;GAAK,CAAC;EAC9C,OAAO,IAAI,MAAM,SAAS,aAAa;GACrC,MAAM,aAAa,WAAW,MAAM,UAAU;GAE9C,MAAM,OADQ,YAAY,CAAC,MAAM,IAAI,CACpB,CAAC,GAAG;GACrB,IAAI,CAAC,cAAc,CAAC,MAAM;GAC1B,IAAI,KAAK;IAAE,MAAM;IAAa;IAAW;IAAY;GAAK,CAAC;EAC7D,OAAO,IAAI,MAAM,SAAS,WAAW;GACnC,MAAM,SAAS,WAAW,MAAM,MAAM;GACtC,MAAM,SAAS,WAAW,MAAM,MAAM;GACtC,IAAI,CAAC,UAAU,CAAC,QAAQ;GACxB,IAAI,KAAK;IAAE,MAAM;IAAW;IAAW;IAAQ;GAAO,CAAC;EACzD;CACF;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAAwB;CAC9C,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;AAEA,SAAS,QAAQ,OAAuB;CACtC,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CACpC,IAAI,QAAQ,GAAG,OAAO;CACtB,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO;AACT;;;;AC9kBA,MAAa,uBAAuB;;;;;;;;;;;;;;;;;;;EAmBlC,KAAK;;AAGP,MAAa,cAAsC;CACjD,aAAa;;;;;;EAMb,KAAK;CACL,WAAW;;;;;;EAMX,KAAK;CACL,QAAQ;;;;;;EAMR,KAAK;CACL,WAAW;;;;;;EAMX,KAAK;CACL,aAAa;;;;;;EAMb,KAAK;CACL,eAAe;;;;;;EAMf,KAAK;CACL,YAAY;;;;;;EAMZ,KAAK;CACL,QAAQ;;;;;;EAMR,KAAK;CACL,SAAS;;;;;;EAMT,KAAK;CACL,aAAa;;;;;;EAMb,KAAK;CACL,yBAAyB;;;;;;EAMzB,KAAK;CACL,OAAO;;;EAGP,KAAK;AACP;;;;;;AAOA,SAAgB,yBAAyB,MAAsB;CAC7D,MAAM,QAAQ,YAAY;CAC1B,OAAO,GAAG,qBAAqB,MAAM;AACvC;;;AC1GA,MAAM,oBAAoB,IAAI,IAAY,SAAS;AAEnD,SAAS,SAAS,GAAyB;CACzC,OAAO,OAAO,MAAM,YAAY,kBAAkB,IAAI,CAAW;AACnE;;AAGA,SAAgB,mBAAmB,QAAuC;CACxE,MAAM,WAAwB,CAAC;CAC/B,MAAM,WAA6B,CAAC;CACpC,IAAI;CACJ,IAAI;CAEJ,KAAK,MAAM,OAAO,QAAQ;EACxB,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;EACrC,MAAM,OAAO,OAAO,IAAI,QAAQ,EAAE;EAClC,MAAM,OACJ,IAAI,QAAQ,OAAO,IAAI,SAAS,WAAY,IAAI,OAAmC,KAAA;EACrF,IAAI,CAAC,MAAM;EAEX,QAAQ,MAAR;GACE,KAAK,cAAc;IACjB,MAAM,IAAI,KAAK;IACf,IAAI,SAAS,CAAC,GAAG,OAAO;IACxB;GACF;GACA,KAAK,iBAAiB;IACpB,MAAM,MAAM;IACZ,IACE,OAAO,IAAI,SAAS,YACpB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,aAAa,aACxB,OAAO,IAAI,UAAU,YACrB,OAAO,IAAI,QAAQ,YACnB,OAAO,IAAI,eAAe,UAC1B;KACA,MAAM,MAAsB;MAC1B,MAAM,IAAI;MACV,UAAU,IAAI;MACd,UAAU,IAAI;MACd,OAAO,IAAI;MACX,KAAK,IAAI;MACT,YAAY,IAAI;KAClB;KACA,IAAI,IAAI,iBAAiB,IAAI,kBAAkB,IAAI;KACnD,IAAI,IAAI,OAAO,IAAI,QAAQ,IAAI;KAC/B,SAAS,KAAK,GAAG;IACnB;IACA;GACF;GACA,KAAK,iBAAiB;IACpB,MAAM,IAAI;IAIV,IACE,OAAO,EAAE,UAAU,YACnB,EAAE,MAAM,KAAK,CAAC,CAAC,SAAS,KACxB,SAAS,EAAE,IAAI,KACf,OAAO,EAAE,aAAa,YACtB;KAAC;KAAO;KAAO;KAAQ;IAAU,CAAC,CAAC,SAAS,EAAE,QAAQ,KACtD,OAAO,EAAE,UAAU,YACnB,OAAO,EAAE,gBAAgB,YACzB,OAAO,EAAE,WAAW,YACpB,OAAO,EAAE,iBAAiB,YAC1B,MAAM,QAAQ,EAAE,WAAW,GAE3B,SAAS,KAAK,CAAc;IAE9B;GACF;GACA,KAAK,eAAe;IAClB,MAAM,IAAI,KAAK;IACf,IAAI,OAAO,MAAM,YAAY,EAAE,KAAK,CAAC,CAAC,SAAS,GAAG,QAAQ;IAC1D;GACF;GACA,SAGE;EACJ;CACF;CAEA,MAAM,MAAqB;EAAE,MAAM,QAAQ;EAAS;EAAU;CAAS;CACvE,IAAI,OAAO,IAAI,QAAQ;CACvB,OAAO;AACT"}
+{"version":3,"file":"profiles.js","names":[],"sources":["../src/profiles/graph-designer.ts","../src/profiles/researcher.ts","../src/profiles/ui-auditor/lens-prompts.ts","../src/profiles/ui-auditor/output-adapter.ts"],"sourcesContent":["import { readFileSync } from 'node:fs'\nimport { type AgentProfile, agentProfileSchema } from '@tangle-network/agent-interface'\nimport { ValidationError } from '../errors'\nimport { assertExecutableAgentProfile } from '../runtime/supervise/model-policy'\n\n/** Canonical owners of the separately bundled designer capabilities. */\nexport const graphDesignerSkillSources = Object.freeze({\n  'graph-designer':\n    'https://github.com/tangle-network/agent-runtime/blob/main/skills/graph-designer/SKILL.md',\n  'agent-graphs':\n    'https://github.com/tangle-network/agent-runtime/blob/main/skills/agent-graphs/SKILL.md',\n  'be-ambitious':\n    'https://github.com/drewstone/dotfiles/blob/main/claude/skills/be-ambitious/SKILL.md',\n})\n\ntype SkillResource = NonNullable<NonNullable<AgentProfile['resources']>['skills']>[number]\n\n/** Read this installation's bundled skills without depending on a user's skill installation.\n *  Self-resolution follows the public profiles entry in source checkouts and packed installs. */\nexport function graphDesignerSkills(): SkillResource[] {\n  const directory = new URL(\n    '../skills/',\n    import.meta.resolve('@tangle-network/agent-runtime/profiles'),\n  )\n  return Object.keys(graphDesignerSkillSources).map((name) => ({\n    kind: 'inline',\n    name,\n    content: readFileSync(new URL(`${name}/SKILL.md`, directory), 'utf8'),\n  }))\n}\n\nexport interface GraphDesignerProfileOptions {\n  /** Caller-owned exact harness/model, tools, permissions, connections and other capabilities. */\n  readonly profile: AgentProfile\n  readonly name?: string\n}\n\n/** Compose graph design capabilities onto a complete execution profile; the skills remain\n *  distinct resources carried through the normal profile materializer. */\nexport function graphDesignerProfile(options: GraphDesignerProfileOptions): AgentProfile {\n  const base = agentProfileSchema.parse(options.profile)\n  assertExecutableAgentProfile(base, 'graphDesignerProfile')\n  const skills = [...(base.resources?.skills ?? [])]\n  for (const skill of graphDesignerSkills()) {\n    const existing = skills.find((resource) => resource.name === skill.name)\n    if (existing) {\n      if (JSON.stringify(existing) !== JSON.stringify(skill))\n        throw new ValidationError(`graphDesignerProfile: conflicting skill resource ${skill.name}`)\n    } else skills.push(skill)\n  }\n  return agentProfileSchema.parse({\n    ...base,\n    name: options.name ?? base.name,\n    description: base.description ?? 'Design, replay and improve checked Runtime graphs.',\n    prompt: {\n      ...base.prompt,\n      instructions: [\n        ...(base.prompt?.instructions ?? []),\n        'You design or replay the graph requested by the task. Apply the bundled graph-designer, agent-graphs and be-ambitious skills; keep the task acceptance and granted authority fixed. Return the canonical graph file and its actual qualification evidence.',\n      ],\n    },\n    resources: { ...base.resources, skills, failOnError: true },\n  })\n}\n","/**\n * Opinionated preset for source-grounded research\n * tasks. The agent is told to:\n *   - bound its work to a single `knowledgeNamespace`\n *   - emit `items[]` carrying provenance + confidence\n *   - emit `citations[]` linking quotes back to source urls\n *   - emit `proposedWrites[]` — never call materialize itself\n *   - describe `gaps` it could not answer\n *\n * The profile is stateless and agent-agnostic. The caller supplies the exact execution profile;\n * this preset adds only the researcher prompt, tools, parser, and validator.\n *\n * Propose-don't-apply: the profile NEVER writes to the knowledge base.\n * It produces `proposedWrites: KnowledgeUpdate[]` in the output. The\n * caller (gtm-agent, journey-eval, user) decides whether to feed those\n * updates through `applyKnowledgeWriteBlocks` / a KbStore put.\n *\n * Namespace isolation: every `KnowledgeItem` + `KnowledgeUpdate` in the\n * output carries `namespace`. The validator hard-fails when any item\n * touches a namespace other than `task.knowledgeNamespace`.\n *\n * @experimental\n */\n\nimport { isRecord } from '@tangle-network/agent-core'\nimport { type AgentProfile, agentProfileSchema } from '@tangle-network/agent-interface'\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { ConfigError } from '../errors'\nimport { assertExecutableAgentProfile } from '../runtime/supervise/model-policy'\nimport type {\n  AgentRunSpec,\n  DefaultVerdict,\n  Driver,\n  OutputAdapter,\n  Validator,\n} from '../runtime/types'\n\n/** Source families a researcher profile may prefer for a task. One owner: the delegation\n *  vocabulary (`DelegateResearchArgs.sources`) re-exports this type rather than restating it.\n *  @experimental */\nexport type ResearchSource = 'web' | 'corpus' | 'twitter' | 'github' | 'docs'\n\n/** Task contract for a source-grounded research agent. @experimental */\nexport interface ResearchTask {\n  /** The research question to answer. */\n  question: string\n  /** Bound: e.g. \"audience for cpg-founder ICP\". */\n  scope?: string\n  /** Multi-tenant scope (customer-id, workspace-id). Validator enforces. */\n  knowledgeNamespace: string\n  sources?: ResearchSource[]\n  recencyWindow?: { since?: Date; until?: Date }\n  maxItems?: number\n  /** Per-item minimum confidence in [0, 1]. Validator scores recall vs this. */\n  minConfidence?: number\n}\n\n/**\n * Knowledge item emitted by the researcher.\n *\n * Profile-local type. When agent-knowledge promotes `KnowledgeClaim` →\n * top-level `KnowledgeItem` substrate-wide, these fields collapse 1:1.\n *\n * @experimental\n */\nexport interface KnowledgeItem {\n  id: string\n  /** Multi-tenant scope. MUST equal `task.knowledgeNamespace`. */\n  namespace: string\n  /** The factual claim, in the researcher's words. */\n  claim: string\n  /** Provenance — at least one entry required. */\n  evidence: Array<{ source: string; quote?: string; url?: string; capturedAt: number }>\n  /** Researcher's self-reported confidence in [0, 1]. */\n  confidence: number\n  /** Prior item ids this supersedes (chain). */\n  supersedes?: string[]\n  /** Set if the agent is retracting an earlier item. Unix ms. */\n  retractedAt?: number\n  authoredBy: { kind: 'human' | 'agent'; id: string }\n}\n\n/**\n * A proposed write to the knowledge base. The profile does NOT apply\n * these — the caller decides.\n *\n * @experimental\n */\nexport type KnowledgeUpdate =\n  | { kind: 'insert'; namespace: string; item: KnowledgeItem }\n  | { kind: 'supersede'; namespace: string; previousId: string; item: KnowledgeItem }\n  | { kind: 'retract'; namespace: string; itemId: string; reason: string }\n\n/**\n * Researcher output. Required fields are typed; optional fields preserve\n * the agent's free-form intelligence (`notes`, `raw`). The validator\n * enforces the typed minimum.\n *\n * @experimental\n */\nexport interface ResearchOutput {\n  items: KnowledgeItem[]\n  citations: Array<{ url: string; quote: string; confidence: number }>\n  proposedWrites: KnowledgeUpdate[]\n  gaps?: string[]\n  notes?: string\n  /** Anything the agent emitted beyond the typed fields. */\n  raw?: unknown\n}\n\n/** Options for the source-grounded researcher profile preset. @experimental */\nexport interface ResearcherProfileOptions {\n  /** Caller-owned exact harness/provider/model identity. */\n  profile: AgentProfile\n  /** Custom system prompt replacement. Default = built-in researcher preset. */\n  systemPrompt?: string\n  /** Stable name for `AgentRunSpec.name`. Default = `profile.name`. */\n  name?: string\n  /**\n   * Default 0.7. Minimum (citations with quote) / items ratio for `valid=true`.\n   * Below this floor, citation_density scores < 1 and the item set is gated.\n   */\n  citationDensityMin?: number\n}\n\nconst DEFAULT_CITATION_DENSITY_MIN = 0.7\n\n/** Build a source-grounded researcher profile with output parsing and validation. @experimental */\nexport function researcherProfile(options: ResearcherProfileOptions & { task?: ResearchTask }): {\n  profile: AgentProfile\n  taskToPrompt: (task: ResearchTask) => string\n  output: OutputAdapter<ResearchOutput>\n  validator: Validator<ResearchOutput>\n  agentRunSpec: AgentRunSpec<ResearchTask>\n} {\n  const base = agentProfileSchema.parse(options.profile) as AgentProfile\n  assertExecutableAgentProfile(base, 'researcherProfile')\n  const name = options.name ?? base.name\n  const systemPrompt = options.systemPrompt ?? RESEARCHER_SYSTEM_PROMPT\n  const citationDensityMin = options.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN\n  const profile: AgentProfile = {\n    ...base,\n    name,\n    description: base.description ?? \"Source-grounded research agent. Propose-don't-apply.\",\n    prompt: { ...base.prompt, systemPrompt },\n    tools: { web_search: true, fs: true, shell: true, ...base.tools },\n    metadata: { ...base.metadata, specialty: 'researcher' },\n  }\n  const output: OutputAdapter<ResearchOutput> = { parse: parseResearcherEvents }\n  const validator: Validator<ResearchOutput> = options.task\n    ? createResearcherValidator(options.task, { citationDensityMin })\n    : createResearcherValidator(\n        { question: '', knowledgeNamespace: '' },\n        { citationDensityMin, namespaceCheck: false },\n      )\n  const agentRunSpec: AgentRunSpec<ResearchTask> = {\n    name,\n    profile,\n    taskToPrompt: formatResearcherPrompt,\n  }\n  return { profile, taskToPrompt: formatResearcherPrompt, output, validator, agentRunSpec }\n}\n\n/** @experimental */\ninterface MultiHarnessResearcherFanoutOptions {\n  /** Exact execution profiles, one per parallel researcher. */\n  profiles: ReadonlyArray<AgentProfile>\n  /** Default citation density floor for the shared validator. */\n  citationDensityMin?: number\n  /** Optional task — narrows the validator's namespace check. */\n  task?: ResearchTask\n}\n\n/**\n * Build a fanout topology over multiple harnesses. The kernel round-robins\n * `agentRuns` across the N parallel iterations and the `FanoutVote` driver\n * picks the highest-scoring valid output.\n *\n * @experimental\n */\nexport function multiHarnessResearcherFanout(options: MultiHarnessResearcherFanoutOptions): {\n  agentRuns: AgentRunSpec<ResearchTask>[]\n  output: OutputAdapter<ResearchOutput>\n  validator: Validator<ResearchOutput>\n  driver: Driver<ResearchTask, ResearchOutput, 'done'>\n} {\n  if (options.profiles.length === 0) {\n    throw new ConfigError('multiHarnessResearcherFanout: at least one exact profile is required')\n  }\n  const agentRuns = options.profiles.map((profile) => {\n    const { agentRunSpec } = researcherProfile({ profile })\n    return agentRunSpec\n  })\n  const { output, validator } = researcherProfile({\n    profile: options.profiles[0]!,\n    citationDensityMin: options.citationDensityMin,\n    task: options.task,\n  })\n  // Single fanout round across the N harnesses, then stop: the kernel\n  // round-robins `agentRuns` over the N branches and selects the winner\n  // (best valid score) across all iterations via `defaultSelectWinner`.\n  const driver: Driver<ResearchTask, ResearchOutput, 'done'> = {\n    name: 'researcher-fanout',\n    async plan(task, history) {\n      return history.length === 0 ? Array.from({ length: agentRuns.length }, () => task) : []\n    },\n    // 'done' is a terminal decision in the kernel; the loop finalizes after\n    // the single fanout round and selects the winner via `defaultSelectWinner`.\n    decide() {\n      return 'done'\n    },\n    describePlan() {\n      return { kind: 'fanout' }\n    },\n  }\n  return { agentRuns, output, validator, driver }\n}\n\n/**\n * Build a validator that closes over a specific `ResearchTask`'s constraints.\n *\n * Checks in order:\n *   1. Items must be non-empty.\n *   2. Every item carries `evidence.length >= 1`.\n *   3. Every item + proposedWrite is scoped to `task.knowledgeNamespace`\n *      (hard-fail on any namespace mismatch — defence in depth for the\n *      multi-tenant invariant).\n *   4. Citation density (citations with quote / items) >= floor.\n *\n * Aggregate score:\n *   0.4 · citation_density\n * + 0.2 · source_diversity (distinct sources / max(items, 1))\n * + 0.2 · recency_match (mean fraction within `recencyWindow`)\n * + 0.2 · (1 − gaps/maxGaps), maxGaps = max(items, 1)\n *\n * @experimental\n */\nfunction createResearcherValidator(\n  task: ResearchTask,\n  config: { citationDensityMin?: number; namespaceCheck?: boolean } = {},\n): Validator<ResearchOutput> {\n  const citationDensityMin = config.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN\n  const namespaceCheck = config.namespaceCheck ?? true\n  return {\n    async validate(output) {\n      const notes: string[] = []\n      const scores: Record<string, number> = {}\n      let pass = true\n\n      if (!Array.isArray(output.items) || output.items.length === 0) {\n        pass = false\n        notes.push('no items')\n        scores.items = 0\n      } else {\n        scores.items = 1\n      }\n\n      const missingEvidence = (output.items ?? []).filter(\n        (item) => !Array.isArray(item.evidence) || item.evidence.length === 0,\n      )\n      if (missingEvidence.length > 0) {\n        pass = false\n        notes.push(`${missingEvidence.length} item(s) without evidence`)\n        scores.provenance = 0\n      } else {\n        scores.provenance = 1\n      }\n\n      if (namespaceCheck) {\n        const foreignItems = (output.items ?? []).filter(\n          (item) => item.namespace !== task.knowledgeNamespace,\n        )\n        const foreignWrites = (output.proposedWrites ?? []).filter(\n          (write) => write.namespace !== task.knowledgeNamespace,\n        )\n        if (foreignItems.length > 0 || foreignWrites.length > 0) {\n          pass = false\n          notes.push(\n            `namespace violation: ${foreignItems.length} item(s) + ${foreignWrites.length} write(s) ` +\n              `outside ${task.knowledgeNamespace}`,\n          )\n          scores.namespace = 0\n        } else {\n          scores.namespace = 1\n        }\n      }\n\n      const itemCount = Math.max(output.items?.length ?? 0, 1)\n      const citationsWithQuote = (output.citations ?? []).filter(\n        (citation) => typeof citation.quote === 'string' && citation.quote.length > 0,\n      ).length\n      const citationDensity = Math.min(1, citationsWithQuote / itemCount)\n      if (citationDensity < citationDensityMin) {\n        pass = false\n        notes.push(\n          `citation density ${citationDensity.toFixed(2)} below floor ${citationDensityMin.toFixed(2)}`,\n        )\n      }\n      scores.citation_density = citationDensity\n\n      const sourceSet = new Set<string>()\n      for (const item of output.items ?? []) {\n        for (const evidence of item.evidence ?? []) {\n          if (evidence.source) sourceSet.add(evidence.source)\n        }\n      }\n      scores.source_diversity = Math.min(1, sourceSet.size / itemCount)\n\n      scores.recency_match = recencyMatchScore(output.items ?? [], task.recencyWindow)\n\n      const maxGaps = itemCount\n      const gapCount = output.gaps?.length ?? 0\n      scores.gap_coverage = Math.max(0, 1 - gapCount / maxGaps)\n\n      const score =\n        0.4 * scores.citation_density +\n        0.2 * scores.source_diversity +\n        0.2 * scores.recency_match +\n        0.2 * scores.gap_coverage\n\n      const verdict: DefaultVerdict = {\n        valid: pass,\n        score: Number.isFinite(score) ? score : 0,\n        scores,\n      }\n      if (notes.length > 0) verdict.notes = notes.join('; ')\n      return verdict\n    },\n  }\n}\n\nfunction recencyMatchScore(items: KnowledgeItem[], window: ResearchTask['recencyWindow']): number {\n  if (!window || (window.since === undefined && window.until === undefined)) return 1\n  if (items.length === 0) return 0\n  const sinceMs = window.since?.getTime() ?? Number.NEGATIVE_INFINITY\n  const untilMs = window.until?.getTime() ?? Number.POSITIVE_INFINITY\n  let hits = 0\n  let total = 0\n  for (const item of items) {\n    for (const evidence of item.evidence ?? []) {\n      if (typeof evidence.capturedAt !== 'number') continue\n      total += 1\n      if (evidence.capturedAt >= sinceMs && evidence.capturedAt <= untilMs) hits += 1\n    }\n  }\n  return total === 0 ? 0 : hits / total\n}\n\n/** Built-in source-grounded research contract added to a caller-owned exact profile. */\nconst RESEARCHER_SYSTEM_PROMPT = [\n  'You are a research agent. Your job is to answer a research question with',\n  'source-grounded knowledge items that the caller will choose whether to',\n  'persist to a multi-tenant knowledge base.',\n  '',\n  'Hard rules:',\n  \"  1. Every item you emit MUST carry the task's knowledgeNamespace exactly.\",\n  '     Never write to a different namespace.',\n  '  2. Every item MUST carry at least one evidence entry with a source.',\n  '     A quote + url is strongly preferred; capturedAt is unix ms.',\n  '  3. You propose writes — you do NOT apply them. The caller decides.',\n  '  4. Self-report confidence honestly in [0, 1]. Do not inflate.',\n  '  5. List what you could not answer in `gaps`. Better to admit a gap',\n  '     than fabricate.',\n  '',\n  'When you finish, emit a single final structured message of the shape:',\n  '  ```json',\n  '  { \"items\": [{ \"id\": \"...\", \"namespace\": \"...\", \"claim\": \"...\",',\n  '                \"evidence\": [{ \"source\": \"...\", \"quote\": \"...\",',\n  '                               \"url\": \"...\", \"capturedAt\": 0 }],',\n  '                \"confidence\": 0.0,',\n  '                \"authoredBy\": { \"kind\": \"agent\", \"id\": \"...\" } }],',\n  '    \"citations\": [{ \"url\": \"...\", \"quote\": \"...\", \"confidence\": 0.0 }],',\n  '    \"proposedWrites\": [{ \"kind\": \"insert\", \"namespace\": \"...\",',\n  '                         \"item\": { /* same shape as items[] */ } }],',\n  '    \"gaps\": [\"...\"],',\n  '    \"notes\": \"free-form commentary\" }',\n  '  ```',\n].join('\\n')\n\nfunction formatResearcherPrompt(task: ResearchTask): string {\n  const sources = task.sources?.length ? task.sources.join(', ') : '(no preference)'\n  const window = formatRecencyWindow(task.recencyWindow)\n  return [\n    `Question: ${task.question}`,\n    `Knowledge namespace (DO NOT cross): ${task.knowledgeNamespace}`,\n    `Scope: ${task.scope ?? '(unspecified)'}`,\n    `Preferred sources: ${sources}`,\n    `Recency window: ${window}`,\n    `Max items: ${task.maxItems ?? '(no cap)'}`,\n    `Per-item minimum confidence: ${task.minConfidence ?? '(no floor)'}`,\n    '',\n    'Produce knowledge items with provenance + citations + proposed writes.',\n    'List gaps for anything you could not answer. Emit the final JSON',\n    'result block exactly as instructed.',\n  ].join('\\n')\n}\n\nfunction formatRecencyWindow(window: ResearchTask['recencyWindow']): string {\n  if (!window) return '(none)'\n  const since = window.since ? window.since.toISOString() : '-∞'\n  const until = window.until ? window.until.toISOString() : 'now'\n  return `${since} .. ${until}`\n}\n\n/**\n * Walk the event stream and return the last structured `research.result`\n * payload. Falls back to scanning text deltas for a fenced JSON block.\n */\nfunction parseResearcherEvents(events: SandboxEvent[]): ResearchOutput {\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const type = String(event.type ?? '')\n    const data = isRecord(event.data) ? event.data : {}\n    if (type === 'result' || type === 'final' || type === 'research.result') {\n      const direct = coerceResearchOutput(data.result ?? data.output ?? data)\n      // opencode reports the agent's terminal answer in `finalText` (not result/output).\n      // Parse it too, and prefer it when `direct` is an all-empty shape — otherwise an\n      // event carrying both `{items:[],citations:[],proposedWrites:[]}` and a rich\n      // finalText would silently drop the real answer.\n      const finalText = pickString(data.finalText)\n      const fenced = finalText ? extractFencedJson(finalText) : undefined\n      const fromFinalText = fenced ? coerceResearchOutput(fenced) : undefined\n      if (direct && !isEmptyOutput(direct)) return direct\n      if (fromFinalText) return fromFinalText\n      if (direct) return direct\n    }\n  }\n  for (let i = events.length - 1; i >= 0; i -= 1) {\n    const event = events[i]\n    if (!event) continue\n    const data = isRecord(event.data) ? event.data : {}\n    const text = pickString(data.text) ?? pickString(data.delta) ?? pickString(data.finalText)\n    if (!text) continue\n    const fenced = extractFencedJson(text)\n    if (!fenced) continue\n    const coerced = coerceResearchOutput(fenced)\n    if (coerced) return coerced\n  }\n  return { items: [], citations: [], proposedWrites: [] }\n}\n\n/** A coerced output that carries no items, citations, or proposed writes. */\nfunction isEmptyOutput(o: ResearchOutput): boolean {\n  return o.items.length === 0 && o.citations.length === 0 && o.proposedWrites.length === 0\n}\n\nfunction pickString(value: unknown): string | undefined {\n  return typeof value === 'string' && value.length > 0 ? value : undefined\n}\n\nfunction extractFencedJson(text: string): unknown | undefined {\n  const match = text.match(/```(?:json)?\\s*([\\s\\S]*?)```/i)\n  if (!match) return undefined\n  const body = (match[1] ?? '').trim()\n  if (!body) return undefined\n  try {\n    return JSON.parse(body)\n  } catch {\n    return undefined\n  }\n}\n\nfunction coerceResearchOutput(value: unknown): ResearchOutput | undefined {\n  if (!isRecord(value)) return undefined\n  const items = coerceItems(value.items)\n  const citations = coerceCitations(value.citations)\n  const proposedWrites = coerceProposedWrites(value.proposedWrites)\n  // Reject completely empty payloads — those signal \"no result block\",\n  // not \"a valid empty result\".\n  if (items === undefined && citations === undefined && proposedWrites === undefined) {\n    return undefined\n  }\n  const output: ResearchOutput = {\n    items: items ?? [],\n    citations: citations ?? [],\n    proposedWrites: proposedWrites ?? [],\n  }\n  if (Array.isArray(value.gaps)) {\n    output.gaps = value.gaps.filter((entry): entry is string => typeof entry === 'string')\n  }\n  const notes = pickString(value.notes)\n  if (notes) output.notes = notes\n  // Preserve any extra fields the agent emitted that don't fit the typed\n  // surface — callers can inspect `raw` without forcing them through the\n  // typed coercion. We only include `raw` when the agent emitted fields\n  // beyond the known set.\n  const known = new Set(['items', 'citations', 'proposedWrites', 'gaps', 'notes'])\n  const extras: Record<string, unknown> = {}\n  let extrasCount = 0\n  for (const [key, val] of Object.entries(value)) {\n    if (known.has(key)) continue\n    extras[key] = val\n    extrasCount += 1\n  }\n  if (extrasCount > 0) output.raw = extras\n  return output\n}\n\nfunction coerceItems(value: unknown): KnowledgeItem[] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: KnowledgeItem[] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const id = pickString(entry.id)\n    const namespace = pickString(entry.namespace)\n    const claim = pickString(entry.claim)\n    const evidence = coerceEvidence(entry.evidence)\n    const confidence = toFiniteNumber(entry.confidence)\n    const authoredBy = coerceAuthoredBy(entry.authoredBy)\n    if (!id || !namespace || !claim || !authoredBy) continue\n    const item: KnowledgeItem = {\n      id,\n      namespace,\n      claim,\n      evidence,\n      confidence: clamp01(confidence),\n      authoredBy,\n    }\n    if (Array.isArray(entry.supersedes)) {\n      item.supersedes = entry.supersedes.filter((s): s is string => typeof s === 'string')\n    }\n    const retractedAt = toFiniteNumber(entry.retractedAt)\n    if (retractedAt > 0) item.retractedAt = retractedAt\n    out.push(item)\n  }\n  return out\n}\n\nfunction coerceEvidence(value: unknown): KnowledgeItem['evidence'] {\n  if (!Array.isArray(value)) return []\n  const out: KnowledgeItem['evidence'] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const source = pickString(entry.source)\n    if (!source) continue\n    const item: KnowledgeItem['evidence'][number] = {\n      source,\n      capturedAt: toFiniteNumber(entry.capturedAt),\n    }\n    const quote = pickString(entry.quote)\n    if (quote) item.quote = quote\n    const url = pickString(entry.url)\n    if (url) item.url = url\n    out.push(item)\n  }\n  return out\n}\n\nfunction coerceAuthoredBy(value: unknown): KnowledgeItem['authoredBy'] | undefined {\n  if (!isRecord(value)) return undefined\n  const kind = value.kind === 'human' || value.kind === 'agent' ? value.kind : undefined\n  const id = pickString(value.id)\n  if (!kind || !id) return undefined\n  return { kind, id }\n}\n\nfunction coerceCitations(value: unknown): ResearchOutput['citations'] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: ResearchOutput['citations'] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const url = pickString(entry.url)\n    const quote = pickString(entry.quote)\n    if (!url || !quote) continue\n    out.push({ url, quote, confidence: clamp01(toFiniteNumber(entry.confidence)) })\n  }\n  return out\n}\n\nfunction coerceProposedWrites(value: unknown): KnowledgeUpdate[] | undefined {\n  if (!Array.isArray(value)) return undefined\n  const out: KnowledgeUpdate[] = []\n  for (const entry of value) {\n    if (!isRecord(entry)) continue\n    const namespace = pickString(entry.namespace)\n    if (!namespace) continue\n    if (entry.kind === 'insert') {\n      const items = coerceItems([entry.item])\n      const item = items?.[0]\n      if (!item) continue\n      out.push({ kind: 'insert', namespace, item })\n    } else if (entry.kind === 'supersede') {\n      const previousId = pickString(entry.previousId)\n      const items = coerceItems([entry.item])\n      const item = items?.[0]\n      if (!previousId || !item) continue\n      out.push({ kind: 'supersede', namespace, previousId, item })\n    } else if (entry.kind === 'retract') {\n      const itemId = pickString(entry.itemId)\n      const reason = pickString(entry.reason)\n      if (!itemId || !reason) continue\n      out.push({ kind: 'retract', namespace, itemId, reason })\n    }\n  }\n  return out\n}\n\nfunction toFiniteNumber(value: unknown): number {\n  return typeof value === 'number' && Number.isFinite(value) ? value : 0\n}\n\nfunction clamp01(value: number): number {\n  if (!Number.isFinite(value)) return 0\n  if (value < 0) return 0\n  if (value > 1) return 1\n  return value\n}\n","/**\n *\n * Per-lens guidance the auditor inlines into its system prompt for an\n * iteration. Each entry is a self-contained brief — the same content the\n * standalone ui-issue-finder skill ships, embedded as a string constant so\n * agent-runtime carries no runtime dep on that external workspace.\n *\n * Briefs are deliberately concrete: they enumerate the SIGNALS to look for\n * and the cross-lens distinctions to respect, so the judge files fewer\n * pile-on findings under generic labels.\n *\n * @experimental\n */\n\nimport type { UiLens } from './substrate'\n\n/** Cross-lens rules injected into every UI audit iteration: finding quality standards and scope limits. @experimental */\nexport const SHARED_AUDITOR_RULES = `\nYou are auditing a UI for a specific class of problems. Stay strictly in your assigned lens — do not file issues that belong to another lens (a separate iteration will catch those).\n\nA finding is only valid if a thoughtful product designer would agree the screenshot shows something that should change. Avoid:\n- Personal taste (\"I'd prefer brand blue\").\n- Hallucinated text or controls you cannot actually see in the screenshot.\n- Suggestions that depend on requirements you don't have access to.\n- Pile-on findings about the same root cause — file ONE finding and use \\`similarTo\\` to link the rest.\n\nRequired for every finding:\n- title: concrete, names the offending element AND what's wrong (NOT \"improve UX\").\n- severity: critical=blocks a core task or accessibility blocker; high=noticeable friction; med=visible polish issue; low=nitpick.\n- observation: 1–3 sentences describing exactly what you see that is wrong.\n- impact: who is affected and how (concrete).\n- suggestedFix: a specific change a developer could apply without asking you back.\n- screenshots: refer to the captures attached to this iteration by path.\n- selector: when you can pin the offending element with a CSS selector.\n\nMost findings are med or low. Reserve high/critical for genuine blockers.\n`.trim()\n\n/** Per-lens auditor briefs: concrete signals to look for and cross-lens distinctions to respect. @experimental */\nexport const LENS_BRIEFS: Record<UiLens, string> = {\n  consistency: `\nLENS: consistency\nLook for inconsistencies in the design system — things that look like they came from different products glued together.\nSignals: multiple font families, inconsistent weights/sizes for the same role, two shades of \"primary\", arbitrary paddings/margins that don't snap to a scale (4/8/12/16/24), same control with different border-radius or shadow on different pages, mixed icon styles (filled vs outlined), inconsistent button heights/padding for the same variant, inconsistent capitalization (Title Case vs sentence case) for the same role.\nNOT this lens: layout misalignment (use \\`layout\\`), confusing user flow (use \\`ux-flow\\`), contrast/keyboard issues (use \\`accessibility\\`).\nTitle format: \\`Inconsistent <thing> between <A> and <B>\\`.\n`.trim(),\n  hierarchy: `\nLENS: hierarchy\nLook for broken visual hierarchy — places where the eye does not land on what matters most.\nSignals: primary CTA same weight as secondary/tertiary controls, headings (H1/H2/H3) nearly the same size, important data buried (headline number smaller than its label), decoration outshining content, too many emphases competing, wrong scan order, missing or overly heavy section dividers.\nNOT this lens: same-role styled differently (\\`consistency\\`), grid/alignment (\\`layout\\`), contrast-failing text (\\`accessibility\\`).\nTitle format: \\`Weak hierarchy: <element> does not read as the <intended-role>\\`.\n`.trim(),\n  layout: `\nLENS: layout\nLook for layout and organization problems — alignment, grouping, whitespace, structural choices that hurt scannability.\nSignals: misalignment within rows, inconsistent gutters in grids, orphan whitespace next to crammed regions, poor grouping (related fields separated, unrelated fields adjacent), no visual sections (long wall of content), container overflow (text/content punching out of card boundaries), cramped or oversized hit targets, sidebars/headers sized wrong relative to main content.\nNOT this lens: same-role styled differently (\\`consistency\\`), click-distance/friction (\\`ux-flow\\`), overflow specifically at small viewports (\\`responsive\\`).\nTitle format: \\`<Region> alignment/spacing problem\\` or \\`<Region> grouping unclear\\`.\n`.trim(),\n  'ux-flow': `\nLENS: ux-flow\nLook for interaction-flow friction — action sequences that are slower, more annoying, or more error-prone than necessary.\nSignals: sequential clicks far apart (e.g. Next top-right while user is bottom-left), destructive action adjacent to primary with same weight, confirmations that don't say what's being confirmed, primary CTA below the fold or hidden in a kebab menu, silent state changes (toggle gives no feedback), form ordering that fights real-world order, dead-end states after submit, lost inputs on back-navigation, hidden pre-selected options.\nNOT this lens: visual style only (\\`consistency\\`), component arrangement without a flow problem (\\`layout\\`), microcopy clarity (\\`content\\`).\nTitle format: \\`<Action A> → <Action B> friction: <root cause>\\`.\n`.trim(),\n  duplication: `\nLENS: duplication\nLook for redundancy — the same control, link, or piece of content appearing more than once with no good reason.\nSignals: two ways to do the same action on the same screen with no difference, repeated nav (same links in sidebar AND top nav), drifted duplicates (two copies that have diverged), content repeated verbatim, icon + label saying the same thing twice in one row, per-row + bulk actions that overlap confusingly, multiple status indicators conveying the same status.\nNOT this lens: inconsistent styling of duplicates (\\`consistency\\`) — this lens is about the existence of duplicates.\nTitle format: \\`Duplicate <thing> in <location A> and <location B>\\`.\n`.trim(),\n  accessibility: `\nLENS: accessibility\nLook for accessibility blockers and degradations. Be conservative — do not assume violations you cannot see.\nSignals: insufficient contrast on body text or controls, missing/invisible focus styles, tiny tap targets (<24px on mobile), color as sole signal (red border with no message), form labels missing or not associated (placeholders standing in for labels), broken heading order (H1 → H4), modals that don't trap focus, decorative elements that take focus, errors not announced, important text rendered inside images.\nNOT this lens: generic \"looks confusing\" (\\`hierarchy\\` or \\`content\\`), layout overflow at small viewports (\\`responsive\\`).\nTitle format: \\`Accessibility: <specific blocker> in <element>\\`.\n`.trim(),\n  responsive: `\nLENS: responsive\nLook for layout breakage across viewport sizes — content that works at one width but degrades at another. This iteration's captures should include the same surface at >=2 viewports; compare across them.\nSignals: horizontal scroll where content should reflow, overlapping elements (header overlaps content, fixed footer covers inputs), desktop nav crammed into mobile without collapsing, table columns that don't truncate, tap targets too close at touch sizes, controls vanishing at certain widths, layout flips that break grouping order, modals exceeding viewport height (confirm button unreachable).\nNOT this lens: issues present at every viewport (\\`consistency\\` / \\`hierarchy\\` instead).\nTitle format: \\`<Element/Region> breaks at <viewport>\\`.\n`.trim(),\n  states: `\nLENS: states\nLook for missing or broken UI states — the not-happy-paths that make a product feel finished or unfinished. The iteration's captures should depict at least one non-default state.\nSignals: empty lists with no guidance, skeletons that don't match final layout (CLS on settle), error states with no message or recovery action, disabled buttons with no explanation, toasts that disappear before being read, success states that don't confirm, missing hover/focus/active/disabled variants on primary controls, no long-content view, no-permission state broken.\nNOT this lens: generic polish on the happy path (other lenses), missing focus rings specifically (\\`accessibility\\`).\nTitle format: \\`Missing/broken <state> state on <surface>\\`.\n`.trim(),\n  content: `\nLENS: content\nLook for microcopy and content problems — text that is unclear, inconsistent, condescending, jargon-heavy, or wrong.\nSignals: jargon/internal language leaking (\"Provisioning a Tenant\" instead of \"Setting up your account\"), inconsistent terminology (workspace vs team), verbose button labels, empty-state copy that's just \"No results\", error messages blaming the user, tone inconsistency, truncation without affordance, mixed date/number formats on one page, placeholder used as a label, \"Saved!\" toast appearing before save completes, typos and grammar errors.\nNOT this lens: visual treatment of text (\\`hierarchy\\` / \\`consistency\\`), missing labels for a11y (\\`accessibility\\`).\nTitle format: \\`Copy: \"<actual text>\" in <location>\\` or \\`Inconsistent term: \"<A>\" vs \"<B>\"\\`.\n`.trim(),\n  interaction: `\nLENS: interaction\nLook for interaction quality problems — affordances, feedback, and micro-interactions.\nSignals: no affordance (clickable areas not looking clickable, non-clickable areas looking clickable), missing feedback (>100ms click with no progress), hover surprises (whole row highlights but only title clickable), cursor inconsistency, animations that block input, missing transitions where they're needed (accordion snaps open), drag-and-drop without indicators, scroll-jacking, click-through bugs (card click handler firing alongside button), hover-only revelations on touch.\nNOT this lens: position of controls (\\`layout\\` / \\`ux-flow\\`), missing focus styles (\\`accessibility\\`).\nTitle format: \\`<Action> on <element>: <missing/wrong> feedback\\`.\n`.trim(),\n  'performance-perceived': `\nLENS: performance-perceived\nLook for perceived-performance problems — visible jank a real user would notice, not benchmark numbers. This iteration's captures should include >=2 frames during load to show shift.\nSignals: layout shift (CLS) when late-arriving images/fonts/banners settle, FOUC (flash of unstyled content), font swap jumps, late-loading hero images that shift everything, skeletons that don't match final shape, spinners on instant local actions, loading state reappearing after content paints (refetch on focus), modal open animation longer than the operation it precedes.\nNOT this lens: slow API calls (file separately), stale data after navigation (\\`states\\`).\nTitle format: \\`Layout shift / late paint on <route>: <root cause>\\`.\n`.trim(),\n  other: `\nLENS: other\nUse ONLY when a finding is clearly a UI quality issue but does not fit any other lens. Strongly prefer a specific lens — \\`other\\` should be rare. Title must still be concrete.\n`.trim(),\n}\n\n/**\n * Build a system prompt for a single auditor iteration.\n *\n * @experimental\n */\nexport function buildAuditorSystemPrompt(lens: UiLens): string {\n  const brief = LENS_BRIEFS[lens]\n  return `${SHARED_AUDITOR_RULES}\\n\\n${brief}`\n}\n","/**\n *\n * Sandbox-event stream → UiAuditOutput decoder. The custom auditor\n * `SandboxClient` emits events of the form:\n *\n *   { type: 'audit.capture', data: UiAuditCapture }\n *   { type: 'audit.finding', data: UiFinding }\n *   { type: 'audit.notes',   data: { notes: string } }\n *   { type: 'audit.lens',    data: { lens: UiLens } }\n *   { type: 'done',          data: { tokenUsage: { ... }, totalCostUsd?: number } }\n *\n * Other event types are tolerated and ignored. The adapter is pure: it\n * folds an already-collected event array into a UiAuditOutput.\n *\n * @experimental\n */\n\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { UI_LENSES, type UiFinding, type UiLens } from './substrate'\nimport type { UiAuditCapture, UiAuditOutput } from './task'\n\n// Build the lens-validation set from the canonical UI_LENSES tuple so adding\n// a lens to the substrate automatically extends the parser; otherwise a new\n// lens would silently fail isUiLens() and parseAuditorEvents would drop\n// every event using it.\nconst KNOWN_LENS_VALUES = new Set<UiLens>(UI_LENSES)\n\nfunction isUiLens(v: unknown): v is UiLens {\n  return typeof v === 'string' && KNOWN_LENS_VALUES.has(v as UiLens)\n}\n\n/** Parse raw `SandboxEvent` emissions from an audit iteration into structured `UiAuditOutput`. @experimental */\nexport function parseAuditorEvents(events: SandboxEvent[]): UiAuditOutput {\n  const findings: UiFinding[] = []\n  const captures: UiAuditCapture[] = []\n  let lens: UiLens | undefined\n  let notes: string | undefined\n\n  for (const evt of events) {\n    if (!evt || typeof evt !== 'object') continue\n    const type = String(evt.type ?? '')\n    const data =\n      evt.data && typeof evt.data === 'object' ? (evt.data as Record<string, unknown>) : undefined\n    if (!data) continue\n\n    switch (type) {\n      case 'audit.lens': {\n        const v = data.lens\n        if (isUiLens(v)) lens = v\n        break\n      }\n      case 'audit.capture': {\n        const cap = data as unknown as Partial<UiAuditCapture>\n        if (\n          typeof cap.path === 'string' &&\n          typeof cap.viewport === 'string' &&\n          typeof cap.fullPage === 'boolean' &&\n          typeof cap.route === 'string' &&\n          typeof cap.url === 'string' &&\n          typeof cap.capturedAt === 'string'\n        ) {\n          const out: UiAuditCapture = {\n            path: cap.path,\n            viewport: cap.viewport,\n            fullPage: cap.fullPage,\n            route: cap.route,\n            url: cap.url,\n            capturedAt: cap.capturedAt,\n          }\n          if (cap.elementSelector) out.elementSelector = cap.elementSelector\n          if (cap.label) out.label = cap.label\n          captures.push(out)\n        }\n        break\n      }\n      case 'audit.finding': {\n        const f = data as unknown as Partial<UiFinding>\n        // Hard requirement: all the actionable fields must be present and\n        // non-empty for a finding to enter the output. The validator does the\n        // softer scoring; the adapter only filters structural junk.\n        if (\n          typeof f.title === 'string' &&\n          f.title.trim().length > 0 &&\n          isUiLens(f.lens) &&\n          typeof f.severity === 'string' &&\n          ['low', 'med', 'high', 'critical'].includes(f.severity) &&\n          typeof f.route === 'string' &&\n          typeof f.observation === 'string' &&\n          typeof f.impact === 'string' &&\n          typeof f.suggestedFix === 'string' &&\n          Array.isArray(f.screenshots)\n        ) {\n          findings.push(f as UiFinding)\n        }\n        break\n      }\n      case 'audit.notes': {\n        const n = data.notes\n        if (typeof n === 'string' && n.trim().length > 0) notes = n\n        break\n      }\n      default:\n        // Tolerate cost/usage events and other backend chatter — extractLlmCallEvent\n        // in run-loop.ts handles cost accounting upstream from the adapter.\n        break\n    }\n  }\n\n  const out: UiAuditOutput = { lens: lens ?? 'other', findings, captures }\n  if (notes) out.notes = notes\n  return out\n}\n"],"mappings":";;;;;;;;AAMA,MAAa,4BAA4B,OAAO,OAAO;CACrD,kBACE;CACF,gBACE;CACF,gBACE;AACJ,CAAC;;;AAMD,SAAgB,sBAAuC;CACrD,MAAM,YAAY,IAAI,IACpB,cACA,YAAY,QAAQ,wCAAwC,CAC9D;CACA,OAAO,OAAO,KAAK,yBAAyB,CAAC,CAAC,KAAK,UAAU;EAC3D,MAAM;EACN;EACA,SAAS,aAAa,IAAI,IAAI,GAAG,KAAK,YAAY,SAAS,GAAG,MAAM;CACtE,EAAE;AACJ;;;AAUA,SAAgB,qBAAqB,SAAoD;CACvF,MAAM,OAAO,mBAAmB,MAAM,QAAQ,OAAO;CACrD,6BAA6B,MAAM,sBAAsB;CACzD,MAAM,SAAS,CAAC,GAAI,KAAK,WAAW,UAAU,CAAC,CAAE;CACjD,KAAK,MAAM,SAAS,oBAAoB,GAAG;EACzC,MAAM,WAAW,OAAO,MAAM,aAAa,SAAS,SAAS,MAAM,IAAI;EACvE,IAAI,UACE;OAAA,KAAK,UAAU,QAAQ,MAAM,KAAK,UAAU,KAAK,GACnD,MAAM,IAAI,gBAAgB,oDAAoD,MAAM,MAAM;EAAA,OACvF,OAAO,KAAK,KAAK;CAC1B;CACA,OAAO,mBAAmB,MAAM;EAC9B,GAAG;EACH,MAAM,QAAQ,QAAQ,KAAK;EAC3B,aAAa,KAAK,eAAe;EACjC,QAAQ;GACN,GAAG,KAAK;GACR,cAAc,CACZ,GAAI,KAAK,QAAQ,gBAAgB,CAAC,GAClC,4PACF;EACF;EACA,WAAW;GAAE,GAAG,KAAK;GAAW;GAAQ,aAAa;EAAK;CAC5D,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;;;AC8DA,MAAM,+BAA+B;;AAGrC,SAAgB,kBAAkB,SAMhC;CACA,MAAM,OAAO,mBAAmB,MAAM,QAAQ,OAAO;CACrD,6BAA6B,MAAM,mBAAmB;CACtD,MAAM,OAAO,QAAQ,QAAQ,KAAK;CAClC,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,MAAM,qBAAqB,QAAQ,sBAAsB;CACzD,MAAM,UAAwB;EAC5B,GAAG;EACH;EACA,aAAa,KAAK,eAAe;EACjC,QAAQ;GAAE,GAAG,KAAK;GAAQ;EAAa;EACvC,OAAO;GAAE,YAAY;GAAM,IAAI;GAAM,OAAO;GAAM,GAAG,KAAK;EAAM;EAChE,UAAU;GAAE,GAAG,KAAK;GAAU,WAAW;EAAa;CACxD;CAaA,OAAO;EAAE;EAAS,cAAc;EAAwB,QAAA,EAZR,OAAO,sBAYM;EAAG,WAXnB,QAAQ,OACjD,0BAA0B,QAAQ,MAAM,EAAE,mBAAmB,CAAC,IAC9D,0BACE;GAAE,UAAU;GAAI,oBAAoB;EAAG,GACvC;GAAE;GAAoB,gBAAgB;EAAM,CAC9C;EAMuE,cAAA;GAJzE;GACA;GACA,cAAc;EAEsE;CAAE;AAC1F;;;;;;;;;;;;;;;;;;;;AA4EA,SAAS,0BACP,MACA,SAAoE,CAAC,GAC1C;CAC3B,MAAM,qBAAqB,OAAO,sBAAsB;CACxD,MAAM,iBAAiB,OAAO,kBAAkB;CAChD,OAAO,EACL,MAAM,SAAS,QAAQ;EACrB,MAAM,QAAkB,CAAC;EACzB,MAAM,SAAiC,CAAC;EACxC,IAAI,OAAO;EAEX,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,KAAK,OAAO,MAAM,WAAW,GAAG;GAC7D,OAAO;GACP,MAAM,KAAK,UAAU;GACrB,OAAO,QAAQ;EACjB,OACE,OAAO,QAAQ;EAGjB,MAAM,mBAAmB,OAAO,SAAS,CAAC,EAAA,CAAG,QAC1C,SAAS,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,WAAW,CACtE;EACA,IAAI,gBAAgB,SAAS,GAAG;GAC9B,OAAO;GACP,MAAM,KAAK,GAAG,gBAAgB,OAAO,0BAA0B;GAC/D,OAAO,aAAa;EACtB,OACE,OAAO,aAAa;EAGtB,IAAI,gBAAgB;GAClB,MAAM,gBAAgB,OAAO,SAAS,CAAC,EAAA,CAAG,QACvC,SAAS,KAAK,cAAc,KAAK,kBACpC;GACA,MAAM,iBAAiB,OAAO,kBAAkB,CAAC,EAAA,CAAG,QACjD,UAAU,MAAM,cAAc,KAAK,kBACtC;GACA,IAAI,aAAa,SAAS,KAAK,cAAc,SAAS,GAAG;IACvD,OAAO;IACP,MAAM,KACJ,wBAAwB,aAAa,OAAO,aAAa,cAAc,OAAO,oBACjE,KAAK,oBACpB;IACA,OAAO,YAAY;GACrB,OACE,OAAO,YAAY;EAEvB;EAEA,MAAM,YAAY,KAAK,IAAI,OAAO,OAAO,UAAU,GAAG,CAAC;EACvD,MAAM,sBAAsB,OAAO,aAAa,CAAC,EAAA,CAAG,QACjD,aAAa,OAAO,SAAS,UAAU,YAAY,SAAS,MAAM,SAAS,CAC9E,CAAC,CAAC;EACF,MAAM,kBAAkB,KAAK,IAAI,GAAG,qBAAqB,SAAS;EAClE,IAAI,kBAAkB,oBAAoB;GACxC,OAAO;GACP,MAAM,KACJ,oBAAoB,gBAAgB,QAAQ,CAAC,EAAE,eAAe,mBAAmB,QAAQ,CAAC,GAC5F;EACF;EACA,OAAO,mBAAmB;EAE1B,MAAM,4BAAY,IAAI,IAAY;EAClC,KAAK,MAAM,QAAQ,OAAO,SAAS,CAAC,GAClC,KAAK,MAAM,YAAY,KAAK,YAAY,CAAC,GACvC,IAAI,SAAS,QAAQ,UAAU,IAAI,SAAS,MAAM;EAGtD,OAAO,mBAAmB,KAAK,IAAI,GAAG,UAAU,OAAO,SAAS;EAEhE,OAAO,gBAAgB,kBAAkB,OAAO,SAAS,CAAC,GAAG,KAAK,aAAa;EAE/E,MAAM,UAAU;EAChB,MAAM,WAAW,OAAO,MAAM,UAAU;EACxC,OAAO,eAAe,KAAK,IAAI,GAAG,IAAI,WAAW,OAAO;EAExD,MAAM,QACJ,KAAM,OAAO,mBACb,KAAM,OAAO,mBACb,KAAM,OAAO,gBACb,KAAM,OAAO;EAEf,MAAM,UAA0B;GAC9B,OAAO;GACP,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;GACxC;EACF;EACA,IAAI,MAAM,SAAS,GAAG,QAAQ,QAAQ,MAAM,KAAK,IAAI;EACrD,OAAO;CACT,EACF;AACF;AAEA,SAAS,kBAAkB,OAAwB,QAA+C;CAChG,IAAI,CAAC,UAAW,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU,KAAA,GAAY,OAAO;CAClF,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,MAAM,UAAU,OAAO,OAAO,QAAQ,KAAK,OAAO;CAClD,MAAM,UAAU,OAAO,OAAO,QAAQ,KAAK,OAAO;CAClD,IAAI,OAAO;CACX,IAAI,QAAQ;CACZ,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,YAAY,KAAK,YAAY,CAAC,GAAG;EAC1C,IAAI,OAAO,SAAS,eAAe,UAAU;EAC7C,SAAS;EACT,IAAI,SAAS,cAAc,WAAW,SAAS,cAAc,SAAS,QAAQ;CAChF;CAEF,OAAO,UAAU,IAAI,IAAI,OAAO;AAClC;;AAGA,MAAM,2BAA2B;CAC/B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,IAAI;AAEX,SAAS,uBAAuB,MAA4B;CAC1D,MAAM,UAAU,KAAK,SAAS,SAAS,KAAK,QAAQ,KAAK,IAAI,IAAI;CACjE,MAAM,SAAS,oBAAoB,KAAK,aAAa;CACrD,OAAO;EACL,aAAa,KAAK;EAClB,uCAAuC,KAAK;EAC5C,UAAU,KAAK,SAAS;EACxB,sBAAsB;EACtB,mBAAmB;EACnB,cAAc,KAAK,YAAY;EAC/B,gCAAgC,KAAK,iBAAiB;EACtD;EACA;EACA;EACA;CACF,CAAC,CAAC,KAAK,IAAI;AACb;AAEA,SAAS,oBAAoB,QAA+C;CAC1E,IAAI,CAAC,QAAQ,OAAO;CAGpB,OAAO,GAFO,OAAO,QAAQ,OAAO,MAAM,YAAY,IAAI,KAE1C,MADF,OAAO,QAAQ,OAAO,MAAM,YAAY,IAAI;AAE5D;;;;;AAMA,SAAS,sBAAsB,QAAwC;CACrE,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC9C,MAAM,QAAQ,OAAO;EACrB,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,OAAO,MAAM,QAAQ,EAAE;EACpC,MAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;EAClD,IAAI,SAAS,YAAY,SAAS,WAAW,SAAS,mBAAmB;GACvE,MAAM,SAAS,qBAAqB,KAAK,UAAU,KAAK,UAAU,IAAI;GAKtE,MAAM,YAAY,WAAW,KAAK,SAAS;GAC3C,MAAM,SAAS,YAAY,kBAAkB,SAAS,IAAI,KAAA;GAC1D,MAAM,gBAAgB,SAAS,qBAAqB,MAAM,IAAI,KAAA;GAC9D,IAAI,UAAU,CAAC,cAAc,MAAM,GAAG,OAAO;GAC7C,IAAI,eAAe,OAAO;GAC1B,IAAI,QAAQ,OAAO;EACrB;CACF;CACA,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;EAC9C,MAAM,QAAQ,OAAO;EACrB,IAAI,CAAC,OAAO;EACZ,MAAM,OAAO,SAAS,MAAM,IAAI,IAAI,MAAM,OAAO,CAAC;EAClD,MAAM,OAAO,WAAW,KAAK,IAAI,KAAK,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,SAAS;EACzF,IAAI,CAAC,MAAM;EACX,MAAM,SAAS,kBAAkB,IAAI;EACrC,IAAI,CAAC,QAAQ;EACb,MAAM,UAAU,qBAAqB,MAAM;EAC3C,IAAI,SAAS,OAAO;CACtB;CACA,OAAO;EAAE,OAAO,CAAC;EAAG,WAAW,CAAC;EAAG,gBAAgB,CAAC;CAAE;AACxD;;AAGA,SAAS,cAAc,GAA4B;CACjD,OAAO,EAAE,MAAM,WAAW,KAAK,EAAE,UAAU,WAAW,KAAK,EAAE,eAAe,WAAW;AACzF;AAEA,SAAS,WAAW,OAAoC;CACtD,OAAO,OAAO,UAAU,YAAY,MAAM,SAAS,IAAI,QAAQ,KAAA;AACjE;AAEA,SAAS,kBAAkB,MAAmC;CAC5D,MAAM,QAAQ,KAAK,MAAM,+BAA+B;CACxD,IAAI,CAAC,OAAO,OAAO,KAAA;CACnB,MAAM,QAAQ,MAAM,MAAM,GAAA,CAAI,KAAK;CACnC,IAAI,CAAC,MAAM,OAAO,KAAA;CAClB,IAAI;EACF,OAAO,KAAK,MAAM,IAAI;CACxB,QAAQ;EACN;CACF;AACF;AAEA,SAAS,qBAAqB,OAA4C;CACxE,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,QAAQ,YAAY,MAAM,KAAK;CACrC,MAAM,YAAY,gBAAgB,MAAM,SAAS;CACjD,MAAM,iBAAiB,qBAAqB,MAAM,cAAc;CAGhE,IAAI,UAAU,KAAA,KAAa,cAAc,KAAA,KAAa,mBAAmB,KAAA,GACvE;CAEF,MAAM,SAAyB;EAC7B,OAAO,SAAS,CAAC;EACjB,WAAW,aAAa,CAAC;EACzB,gBAAgB,kBAAkB,CAAC;CACrC;CACA,IAAI,MAAM,QAAQ,MAAM,IAAI,GAC1B,OAAO,OAAO,MAAM,KAAK,QAAQ,UAA2B,OAAO,UAAU,QAAQ;CAEvF,MAAM,QAAQ,WAAW,MAAM,KAAK;CACpC,IAAI,OAAO,OAAO,QAAQ;CAK1B,MAAM,wBAAQ,IAAI,IAAI;EAAC;EAAS;EAAa;EAAkB;EAAQ;CAAO,CAAC;CAC/E,MAAM,SAAkC,CAAC;CACzC,IAAI,cAAc;CAClB,KAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,KAAK,GAAG;EAC9C,IAAI,MAAM,IAAI,GAAG,GAAG;EACpB,OAAO,OAAO;EACd,eAAe;CACjB;CACA,IAAI,cAAc,GAAG,OAAO,MAAM;CAClC,OAAO;AACT;AAEA,SAAS,YAAY,OAA6C;CAChE,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,KAAK,WAAW,MAAM,EAAE;EAC9B,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,MAAM,WAAW,eAAe,MAAM,QAAQ;EAC9C,MAAM,aAAa,eAAe,MAAM,UAAU;EAClD,MAAM,aAAa,iBAAiB,MAAM,UAAU;EACpD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY;EAChD,MAAM,OAAsB;GAC1B;GACA;GACA;GACA;GACA,YAAY,QAAQ,UAAU;GAC9B;EACF;EACA,IAAI,MAAM,QAAQ,MAAM,UAAU,GAChC,KAAK,aAAa,MAAM,WAAW,QAAQ,MAAmB,OAAO,MAAM,QAAQ;EAErF,MAAM,cAAc,eAAe,MAAM,WAAW;EACpD,IAAI,cAAc,GAAG,KAAK,cAAc;EACxC,IAAI,KAAK,IAAI;CACf;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAA2C;CACjE,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC;CACnC,MAAM,MAAiC,CAAC;CACxC,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,SAAS,WAAW,MAAM,MAAM;EACtC,IAAI,CAAC,QAAQ;EACb,MAAM,OAA0C;GAC9C;GACA,YAAY,eAAe,MAAM,UAAU;EAC7C;EACA,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,IAAI,OAAO,KAAK,QAAQ;EACxB,MAAM,MAAM,WAAW,MAAM,GAAG;EAChC,IAAI,KAAK,KAAK,MAAM;EACpB,IAAI,KAAK,IAAI;CACf;CACA,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAyD;CACjF,IAAI,CAAC,SAAS,KAAK,GAAG,OAAO,KAAA;CAC7B,MAAM,OAAO,MAAM,SAAS,WAAW,MAAM,SAAS,UAAU,MAAM,OAAO,KAAA;CAC7E,MAAM,KAAK,WAAW,MAAM,EAAE;CAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,OAAO,KAAA;CACzB,OAAO;EAAE;EAAM;CAAG;AACpB;AAEA,SAAS,gBAAgB,OAAyD;CAChF,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAmC,CAAC;CAC1C,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,MAAM,WAAW,MAAM,GAAG;EAChC,MAAM,QAAQ,WAAW,MAAM,KAAK;EACpC,IAAI,CAAC,OAAO,CAAC,OAAO;EACpB,IAAI,KAAK;GAAE;GAAK;GAAO,YAAY,QAAQ,eAAe,MAAM,UAAU,CAAC;EAAE,CAAC;CAChF;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,OAA+C;CAC3E,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,KAAA;CAClC,MAAM,MAAyB,CAAC;CAChC,KAAK,MAAM,SAAS,OAAO;EACzB,IAAI,CAAC,SAAS,KAAK,GAAG;EACtB,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,IAAI,CAAC,WAAW;EAChB,IAAI,MAAM,SAAS,UAAU;GAE3B,MAAM,OADQ,YAAY,CAAC,MAAM,IAAI,CACpB,CAAC,GAAG;GACrB,IAAI,CAAC,MAAM;GACX,IAAI,KAAK;IAAE,MAAM;IAAU;IAAW;GAAK,CAAC;EAC9C,OAAO,IAAI,MAAM,SAAS,aAAa;GACrC,MAAM,aAAa,WAAW,MAAM,UAAU;GAE9C,MAAM,OADQ,YAAY,CAAC,MAAM,IAAI,CACpB,CAAC,GAAG;GACrB,IAAI,CAAC,cAAc,CAAC,MAAM;GAC1B,IAAI,KAAK;IAAE,MAAM;IAAa;IAAW;IAAY;GAAK,CAAC;EAC7D,OAAO,IAAI,MAAM,SAAS,WAAW;GACnC,MAAM,SAAS,WAAW,MAAM,MAAM;GACtC,MAAM,SAAS,WAAW,MAAM,MAAM;GACtC,IAAI,CAAC,UAAU,CAAC,QAAQ;GACxB,IAAI,KAAK;IAAE,MAAM;IAAW;IAAW;IAAQ;GAAO,CAAC;EACzD;CACF;CACA,OAAO;AACT;AAEA,SAAS,eAAe,OAAwB;CAC9C,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;AAEA,SAAS,QAAQ,OAAuB;CACtC,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,OAAO;CACpC,IAAI,QAAQ,GAAG,OAAO;CACtB,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO;AACT;;;AC9kBA,MAAa,uBAAuB;;;;;;;;;;;;;;;;;;;EAmBlC,KAAK;;AAGP,MAAa,cAAsC;CACjD,aAAa;;;;;;EAMb,KAAK;CACL,WAAW;;;;;;EAMX,KAAK;CACL,QAAQ;;;;;;EAMR,KAAK;CACL,WAAW;;;;;;EAMX,KAAK;CACL,aAAa;;;;;;EAMb,KAAK;CACL,eAAe;;;;;;EAMf,KAAK;CACL,YAAY;;;;;;EAMZ,KAAK;CACL,QAAQ;;;;;;EAMR,KAAK;CACL,SAAS;;;;;;EAMT,KAAK;CACL,aAAa;;;;;;EAMb,KAAK;CACL,yBAAyB;;;;;;EAMzB,KAAK;CACL,OAAO;;;EAGP,KAAK;AACP;;;;;;AAOA,SAAgB,yBAAyB,MAAsB;CAC7D,MAAM,QAAQ,YAAY;CAC1B,OAAO,GAAG,qBAAqB,MAAM;AACvC;;AC1GA,MAAM,oBAAoB,IAAI,IAAY,SAAS;AAEnD,SAAS,SAAS,GAAyB;CACzC,OAAO,OAAO,MAAM,YAAY,kBAAkB,IAAI,CAAW;AACnE;;AAGA,SAAgB,mBAAmB,QAAuC;CACxE,MAAM,WAAwB,CAAC;CAC/B,MAAM,WAA6B,CAAC;CACpC,IAAI;CACJ,IAAI;CAEJ,KAAK,MAAM,OAAO,QAAQ;EACxB,IAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;EACrC,MAAM,OAAO,OAAO,IAAI,QAAQ,EAAE;EAClC,MAAM,OACJ,IAAI,QAAQ,OAAO,IAAI,SAAS,WAAY,IAAI,OAAmC,KAAA;EACrF,IAAI,CAAC,MAAM;EAEX,QAAQ,MAAR;GACE,KAAK,cAAc;IACjB,MAAM,IAAI,KAAK;IACf,IAAI,SAAS,CAAC,GAAG,OAAO;IACxB;GACF;GACA,KAAK,iBAAiB;IACpB,MAAM,MAAM;IACZ,IACE,OAAO,IAAI,SAAS,YACpB,OAAO,IAAI,aAAa,YACxB,OAAO,IAAI,aAAa,aACxB,OAAO,IAAI,UAAU,YACrB,OAAO,IAAI,QAAQ,YACnB,OAAO,IAAI,eAAe,UAC1B;KACA,MAAM,MAAsB;MAC1B,MAAM,IAAI;MACV,UAAU,IAAI;MACd,UAAU,IAAI;MACd,OAAO,IAAI;MACX,KAAK,IAAI;MACT,YAAY,IAAI;KAClB;KACA,IAAI,IAAI,iBAAiB,IAAI,kBAAkB,IAAI;KACnD,IAAI,IAAI,OAAO,IAAI,QAAQ,IAAI;KAC/B,SAAS,KAAK,GAAG;IACnB;IACA;GACF;GACA,KAAK,iBAAiB;IACpB,MAAM,IAAI;IAIV,IACE,OAAO,EAAE,UAAU,YACnB,EAAE,MAAM,KAAK,CAAC,CAAC,SAAS,KACxB,SAAS,EAAE,IAAI,KACf,OAAO,EAAE,aAAa,YACtB;KAAC;KAAO;KAAO;KAAQ;IAAU,CAAC,CAAC,SAAS,EAAE,QAAQ,KACtD,OAAO,EAAE,UAAU,YACnB,OAAO,EAAE,gBAAgB,YACzB,OAAO,EAAE,WAAW,YACpB,OAAO,EAAE,iBAAiB,YAC1B,MAAM,QAAQ,EAAE,WAAW,GAE3B,SAAS,KAAK,CAAc;IAE9B;GACF;GACA,KAAK,eAAe;IAClB,MAAM,IAAI,KAAK;IACf,IAAI,OAAO,MAAM,YAAY,EAAE,KAAK,CAAC,CAAC,SAAS,GAAG,QAAQ;IAC1D;GACF;EAKF;CACF;CAEA,MAAM,MAAqB;EAAE,MAAM,QAAQ;EAAS;EAAU;CAAS;CACvE,IAAI,OAAO,IAAI,QAAQ;CACvB,OAAO;AACT"}

package/dist/{protected-model-port-DVVh-hEk.d.ts → protected-model-port-IKqhTypD.d.ts}

@@ -1,14 +1,11 @@
-import { $ as VerifiedAgentCandidate, F as AgentCandidateProtectedModelActivation, H as AgentCandidateTaskExecution, I as AgentCandidateProtectedModelReservation, L as AgentCandidateProtectedModelSettlement, M as AgentCandidateModelPort, N as AgentCandidateOutputArtifactPort, S as AgentCandidateExecutorPort, V as AgentCandidateRunFinalization, _ as AgentCandidateBenchmarkGraderPort, q as PreparedAgentCandidateExecution, y as AgentCandidateExecutionPorts } from "./workspace-streams-BiS4ABah.js";
+import { $ as VerifiedAgentCandidate, F as AgentCandidateProtectedModelActivation, H as AgentCandidateTaskExecution, I as AgentCandidateProtectedModelReservation, L as AgentCandidateProtectedModelSettlement, M as AgentCandidateModelPort, N as AgentCandidateOutputArtifactPort, S as AgentCandidateExecutorPort, V as AgentCandidateRunFinalization, _ as AgentCandidateBenchmarkGraderPort, q as PreparedAgentCandidateExecution, y as AgentCandidateExecutionPorts } from "./workspace-streams-Dq2Fzk3c.js";
 import { AgentCandidateArtifactRef, AgentCandidateAttemptPolicy, AgentCandidateExecutionLimits, AgentCandidateFixedSpend, AgentCandidateProfile, AgentCandidateProfileActivation, AgentCandidateProfilePlanEvidence, AgentCandidateResolvedModel, AgentProfile, AgentProfileDiff, HarnessType, Sha256Digest } from "@tangle-network/agent-interface";
 import { TraceStore } from "@tangle-network/agent-eval";
 import { HarnessId } from "@tangle-network/agent-profile-materialize";
-//#region src/candidate-execution/claim-file-formats.d.ts
 interface AgentCandidatePreparationEvidence {
   readonly executionPlan: AgentCandidateArtifactRef;
   readonly materializationReceipt: AgentCandidateArtifactRef;
 }
-//#endregion
-//#region src/candidate-execution/claim.d.ts
 /** Non-secret identities a trusted recovery worker needs to close an abandoned attempt. */
 interface AgentCandidateExecutionCleanupHandles {
   readonly preparationId: string;
@@ -180,8 +177,6 @@ interface AgentCandidateExecutionClaimStore {
    */
   recoverExpired(attempt: AgentCandidateExecutionAttemptRef, evidence: AgentCandidateExecutionRecoveryEvidence): Promise<AgentCandidateExecutionFinishResult>;
 }
-//#endregion
-//#region src/candidate-execution/execute.d.ts
 interface ExecutePreparedAgentCandidateOptions {
   executor: AgentCandidateExecutorPort;
   grader: AgentCandidateBenchmarkGraderPort;
@@ -196,8 +191,6 @@ interface ExecutePreparedAgentCandidateOptions {
 }
 /** Executes and finalizes one durably claimed candidate without exposing an unproven result. */
 declare function executePreparedAgentCandidate(prepared: PreparedAgentCandidateExecution, options: ExecutePreparedAgentCandidateOptions): Promise<AgentCandidateRunFinalization>;
-//#endregion
-//#region src/candidate-execution/prepare.d.ts
 interface PrepareAgentCandidateExecutionOptions {
   cleanupTimeoutMs?: number;
   /** Maximum time for task verification, executable grading, and receipt construction. */
@@ -205,8 +198,6 @@ interface PrepareAgentCandidateExecutionOptions {
 }
 /** Materializes a verified candidate into one immutable evaluator-owned execution plan. */
 declare function prepareAgentCandidateExecution(candidate: VerifiedAgentCandidate, task: AgentCandidateTaskExecution, ports: AgentCandidateExecutionPorts, options?: PrepareAgentCandidateExecutionOptions): Promise<PreparedAgentCandidateExecution>;
-//#endregion
-//#region src/candidate-execution/profile.d.ts
 /** Parse and check every native file hash plus both canonical document digests. */
 declare function parseAgentCandidateProfileActivation(input: unknown, expectedProfilePlanDigest?: AgentCandidateProfilePlanEvidence['digest']): AgentCandidateProfileActivation;
 /** Convert only behavior-preserving generic profile fields into the closed candidate contract. */
@@ -219,8 +210,6 @@ declare function parseExactAgentProfileDiff(input: unknown, label: string): Agen
 declare function applyExactAgentProfileDiff(baseInput: unknown, diffInput: unknown, label: string): AgentProfile;
 /** Convert the candidate profile contract into the portable interface profile it represents. */
 declare function agentCandidateProfileAsAgentProfile(candidate: AgentCandidateProfile): AgentProfile;
-//#endregion
-//#region src/candidate-execution/protected-model-port.d.ts
 type AgentCandidateModelGrantReserveInput = Parameters<AgentCandidateModelPort['reserveGrant']>[0];
 type AgentCandidateModelGrantActivateInput = Parameters<AgentCandidateModelPort['activateGrant']>[0];
 type AgentCandidateModelGrantSettleInput = Parameters<AgentCandidateModelPort['settleGrant']>[0];
@@ -256,6 +245,5 @@ interface CreateProtectedAgentCandidateModelPortOptions {
  * it to cross into candidate execution or durable receipt finalization.
  */
 declare function createProtectedAgentCandidateModelPort(options: CreateProtectedAgentCandidateModelPortOptions): AgentCandidateModelPort;
-//#endregion
 export { AgentCandidateExecutionTerminalResult as A, AgentCandidateExecutionFinishResult as C, AgentCandidateExecutionRecoveryEvidence as D, AgentCandidateExecutionPhaseResult as E, AgentCandidatePreparationEvidence as M, AgentCandidateExecutionStageResult as O, AgentCandidateExecutionFailureClass as S, AgentCandidateExecutionPhase as T, AgentCandidateExecutionAttemptRef as _, createProtectedAgentCandidateModelPort as a, AgentCandidateExecutionClaimStore as b, assertCandidateProfileBinding as c, parseExactAgentProfileDiff as d, PrepareAgentCandidateExecutionOptions as f, AgentCandidateExecutionAttemptRecord as g, executePreparedAgentCandidate as h, CreateProtectedAgentCandidateModelPortOptions as i, AgentCandidateRetryRejection as j, AgentCandidateExecutionTerminalRecord as k, freezeGenericAgentCandidateProfile as l, ExecutePreparedAgentCandidateOptions as m, AgentCandidateModelGrantClient as n, agentCandidateProfileAsAgentProfile as o, prepareAgentCandidateExecution as p, AgentCandidateModelGrantReserveInput as r, applyExactAgentProfileDiff as s, AgentCandidateModelGrantActivateInput as t, parseAgentCandidateProfileActivation as u, AgentCandidateExecutionClaim as v, AgentCandidateExecutionLease as w, AgentCandidateExecutionCleanupHandles as x, AgentCandidateExecutionClaimResult as y };
-//# sourceMappingURL=protected-model-port-DVVh-hEk.d.ts.map
+//# sourceMappingURL=protected-model-port-IKqhTypD.d.ts.map

package/dist/{protected-redaction-DFCeo4vg.js → protected-redaction-DilFZch5.js}

@@ -1,6 +1,6 @@
 import { REDACTION_VERSION, emptyRedactionReport, redactText } from "@tangle-network/agent-eval/traces";
 import { createHmac, randomBytes } from "node:crypto";
-//#region src/candidate-execution/protected-redaction.ts
+// src/candidate-execution/protected-redaction.ts
 /** Create one execution-local namespace for identifiers changed by redaction. */
 function createProtectedRecordRedactor(protectedValues) {
 	const identityKey = randomBytes(32);
@@ -188,7 +188,6 @@ function protectedValueVariants(protectedValues) {
 function normalizedProtectedValues(values) {
 	return [...new Set(values.filter((value) => value.length > 0))];
 }
-//#endregion
 export { redactProtectedValue as i, createProtectedRecordRedactor as n, redactProtectedReason as r, assertNoProtectedBytes as t };
 
-//# sourceMappingURL=protected-redaction-DFCeo4vg.js.map
+//# sourceMappingURL=protected-redaction-DilFZch5.js.map

package/dist/{protected-redaction-DFCeo4vg.js.map → protected-redaction-DilFZch5.js.map}

@@ -1 +1 @@
-{"version":3,"file":"protected-redaction-DFCeo4vg.js","names":[],"sources":["../src/candidate-execution/protected-redaction.ts"],"sourcesContent":["import { createHmac, randomBytes } from 'node:crypto'\n\nimport {\n  emptyRedactionReport,\n  REDACTION_VERSION,\n  redactText,\n} from '@tangle-network/agent-eval/traces'\n\n/**\n * Candidate evidence redaction: agent-eval's redaction core with the\n * execution's protected values as known secrets, applied string by string so\n * the record's structure (keys, arrays, byte fields) is kept. Identifier fields\n * that change get an execution-local HMAC suffix so relationships stay\n * queryable, and every result is checked for surviving protected values in\n * plain, base64, base64url and URL-encoded form.\n */\n\nexport interface ProtectedRedactionReport {\n  version: string\n  redactionCount: number\n  byRule: Record<string, number>\n}\n\nexport interface ProtectedTraceIdentity {\n  readonly runId: string\n  readonly tags: Readonly<Record<string, string>>\n}\n\ninterface ProtectedRecordRedactor {\n  record<T>(value: T): T\n  query<T>(value: T): T\n  identifier(value: string): string\n  traceIdentity(trace: ProtectedTraceIdentity): ProtectedTraceIdentity\n  report(): ProtectedRedactionReport\n}\n\n/** Create one execution-local namespace for identifiers changed by redaction. */\nexport function createProtectedRecordRedactor(\n  protectedValues: readonly string[],\n): ProtectedRecordRedactor {\n  const identityKey = randomBytes(32)\n  const aggregate: ProtectedRedactionReport = {\n    version: REDACTION_VERSION,\n    redactionCount: 0,\n    byRule: {},\n  }\n\n  const mergeReport = (report: ProtectedRedactionReport): void => {\n    aggregate.version = report.version\n    aggregate.redactionCount += report.redactionCount\n    for (const [rule, count] of Object.entries(report.byRule)) {\n      aggregate.byRule[rule] = (aggregate.byRule[rule] ?? 0) + count\n    }\n  }\n\n  const redactScalar = <T>(value: T, record: boolean): T => {\n    const redacted = redactProtectedValue(value, protectedValues)\n    if (record) mergeReport(redacted.report)\n    return redacted.value\n  }\n\n  const identifier = (value: string, record: boolean): string => {\n    const redacted = redactScalar(value, record)\n    if (redacted === value) return value\n    const digest = createHmac('sha256', identityKey).update(value).digest('hex')\n    return `${redacted}:hmac-sha256:${digest}`\n  }\n\n  const transform = <T>(value: T, record: boolean): T => {\n    const transformed = transformProtectedRecord(\n      value,\n      undefined,\n      record,\n      redactScalar,\n      identifier,\n    ) as T\n    assertNoProtectedEvidence(transformed, protectedValues)\n    return transformed\n  }\n\n  return Object.freeze({\n    record: <T>(value: T): T => transform(value, true),\n    query: <T>(value: T): T => transform(value, false),\n    identifier: (value: string): string => identifier(value, false),\n    traceIdentity: (trace: ProtectedTraceIdentity): ProtectedTraceIdentity =>\n      transform(trace, false),\n    report: (): ProtectedRedactionReport => ({\n      version: aggregate.version,\n      redactionCount: aggregate.redactionCount,\n      byRule: { ...aggregate.byRule },\n    }),\n  })\n}\n\n/** Redact protected values at the first persistence boundary, including object keys and bytes. */\nexport function redactProtectedValue<T>(\n  value: T,\n  protectedValues: readonly string[],\n): { value: T; report: ProtectedRedactionReport } {\n  const report: ProtectedRedactionReport = {\n    version: REDACTION_VERSION,\n    redactionCount: 0,\n    byRule: {},\n  }\n  const redacted = redactNode(value, protectedValues, report) as T\n  assertNoProtectedEvidence(redacted, protectedValues)\n  return { value: redacted, report }\n}\n\nexport function redactProtectedReason(reason: string, protectedValues: readonly string[]): string {\n  try {\n    return redactProtectedValue(reason, protectedValues).value\n  } catch {\n    return 'candidate execution failed with a protected error'\n  }\n}\n\nfunction assertNoProtectedEvidence(value: unknown, protectedValues: readonly string[]): void {\n  if (value instanceof Uint8Array) {\n    assertNoProtectedBytes(value, protectedValues)\n    return\n  }\n  if (typeof value === 'string') {\n    for (const protectedValue of protectedValueVariants(protectedValues)) {\n      if (value.includes(protectedValue)) {\n        throw new Error('protected value survived candidate evidence redaction')\n      }\n    }\n    if (decodedBase64ContainsProtectedValue(value, protectedValues)) {\n      throw new Error('base64 protected value survived candidate evidence redaction')\n    }\n    return\n  }\n  if (Array.isArray(value)) {\n    for (const entry of value) assertNoProtectedEvidence(entry, protectedValues)\n    return\n  }\n  if (value && typeof value === 'object') {\n    for (const [key, entry] of Object.entries(value)) {\n      assertNoProtectedEvidence(key, protectedValues)\n      assertNoProtectedEvidence(entry, protectedValues)\n    }\n  }\n}\n\nexport function assertNoProtectedBytes(\n  bytes: Uint8Array,\n  protectedValues: readonly string[],\n): void {\n  if (containsProtectedBytes(bytes, protectedValues)) {\n    throw new Error('protected value survived candidate evidence byte redaction')\n  }\n}\n\nfunction redactNode(\n  value: unknown,\n  protectedValues: readonly string[],\n  report: ProtectedRedactionReport,\n): unknown {\n  if (value instanceof Uint8Array) {\n    if (containsProtectedBytes(value, protectedValues)) {\n      recordRedaction(report, 'candidate-access-binary', 1)\n      return Uint8Array.from(Buffer.from('[redacted:candidate-access-binary]', 'utf8'))\n    }\n    return Uint8Array.from(value)\n  }\n  if (typeof value === 'string') {\n    if (decodedBase64ContainsProtectedValue(value, protectedValues)) {\n      recordRedaction(report, 'candidate-access-binary', 1)\n      return '[redacted:candidate-access-binary]'\n    }\n    const core = emptyRedactionReport()\n    const redacted = redactText(value, { knownSecrets: protectedValues, report: core })\n    for (const [detector, count] of Object.entries(core.byDetector)) {\n      recordRedaction(report, detector, count)\n    }\n    return redacted\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => redactNode(entry, protectedValues, report))\n  }\n  if (value && typeof value === 'object') {\n    const entries: Array<[string, unknown]> = []\n    const seenKeys = new Set<string>()\n    for (const [key, entry] of Object.entries(value)) {\n      const redactedKey = redactNode(key, protectedValues, report)\n      if (typeof redactedKey !== 'string' || seenKeys.has(redactedKey)) {\n        throw new Error('protected evidence redaction produced an ambiguous object key')\n      }\n      seenKeys.add(redactedKey)\n      entries.push([redactedKey, redactNode(entry, protectedValues, report)])\n    }\n    return Object.fromEntries(entries)\n  }\n  return value\n}\n\nfunction transformProtectedRecord(\n  value: unknown,\n  fieldName: string | undefined,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): unknown {\n  if (value instanceof Uint8Array) return redactScalar(value, record)\n  if (typeof value === 'string') {\n    return fieldName && isIdentifierFieldName(fieldName)\n      ? redactIdentifier(value, record)\n      : redactScalar(value, record)\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) =>\n      transformProtectedRecord(entry, fieldName, record, redactScalar, redactIdentifier),\n    )\n  }\n  if (!value || typeof value !== 'object') return value\n\n  if (fieldName === 'tags') {\n    return transformTagMap(value, record, redactScalar, redactIdentifier)\n  }\n  if (fieldName === 'tag') {\n    return transformTagFilter(value, record, redactScalar, redactIdentifier)\n  }\n\n  const entries: Array<[string, unknown]> = []\n  const seenKeys = new Set<string>()\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactScalar(key, record)\n    if (seenKeys.has(redactedKey)) {\n      throw new Error('protected evidence redaction produced an ambiguous object key')\n    }\n    seenKeys.add(redactedKey)\n    entries.push([\n      redactedKey,\n      transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier),\n    ])\n  }\n  return Object.fromEntries(entries)\n}\n\nfunction transformTagMap(\n  value: object,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): Record<string, unknown> {\n  const entries: Array<[string, unknown]> = []\n  const seenKeys = new Set<string>()\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactIdentifier(key, record)\n    if (seenKeys.has(redactedKey)) {\n      throw new Error('protected evidence redaction produced an ambiguous trace tag')\n    }\n    seenKeys.add(redactedKey)\n    entries.push([\n      redactedKey,\n      typeof entry === 'string'\n        ? redactIdentifier(entry, record)\n        : transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier),\n    ])\n  }\n  return Object.fromEntries(entries)\n}\n\nfunction transformTagFilter(\n  value: object,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): Record<string, unknown> {\n  const output: Record<string, unknown> = {}\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactScalar(key, record)\n    output[redactedKey] =\n      (key === 'key' || key === 'value') && typeof entry === 'string'\n        ? redactIdentifier(entry, record)\n        : transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier)\n  }\n  return output\n}\n\nfunction isIdentifierFieldName(name: string): boolean {\n  return /ids?$/i.test(name)\n}\n\nfunction recordRedaction(report: ProtectedRedactionReport, rule: string, count: number): void {\n  if (count <= 0) return\n  report.redactionCount += count\n  report.byRule[rule] = (report.byRule[rule] ?? 0) + count\n}\n\nfunction containsProtectedBytes(bytes: Uint8Array, protectedValues: readonly string[]): boolean {\n  const source = Buffer.from(bytes)\n  return protectedValueVariants(protectedValues).some((value) =>\n    source.includes(Buffer.from(value, 'utf8')),\n  )\n}\n\nfunction decodedBase64ContainsProtectedValue(\n  value: string,\n  protectedValues: readonly string[],\n): boolean {\n  if (value.length < 4 || value.length % 4 !== 0 || !/^[A-Za-z0-9+/]*={0,2}$/.test(value)) {\n    return false\n  }\n  try {\n    return containsProtectedBytes(Buffer.from(value, 'base64'), protectedValues)\n  } catch {\n    return false\n  }\n}\n\nfunction protectedValueVariants(protectedValues: readonly string[]): string[] {\n  const variants = new Set<string>()\n  for (const value of normalizedProtectedValues(protectedValues)) {\n    variants.add(value)\n    variants.add(Buffer.from(value, 'utf8').toString('base64'))\n    variants.add(Buffer.from(value, 'utf8').toString('base64url'))\n    variants.add(encodeURIComponent(value))\n  }\n  return [...variants]\n}\n\nfunction normalizedProtectedValues(values: readonly string[]): string[] {\n  return [...new Set(values.filter((value) => value.length > 0))]\n}\n"],"mappings":";;;;AAqCA,SAAgB,8BACd,iBACyB;CACzB,MAAM,cAAc,YAAY,EAAE;CAClC,MAAM,YAAsC;EAC1C,SAAS;EACT,gBAAgB;EAChB,QAAQ,CAAC;CACX;CAEA,MAAM,eAAe,WAA2C;EAC9D,UAAU,UAAU,OAAO;EAC3B,UAAU,kBAAkB,OAAO;EACnC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,MAAM,GACtD,UAAU,OAAO,SAAS,UAAU,OAAO,SAAS,KAAK;CAE7D;CAEA,MAAM,gBAAmB,OAAU,WAAuB;EACxD,MAAM,WAAW,qBAAqB,OAAO,eAAe;EAC5D,IAAI,QAAQ,YAAY,SAAS,MAAM;EACvC,OAAO,SAAS;CAClB;CAEA,MAAM,cAAc,OAAe,WAA4B;EAC7D,MAAM,WAAW,aAAa,OAAO,MAAM;EAC3C,IAAI,aAAa,OAAO,OAAO;EAE/B,OAAO,GAAG,SAAS,eADJ,WAAW,UAAU,WAAW,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAC/B;CACzC;CAEA,MAAM,aAAgB,OAAU,WAAuB;EACrD,MAAM,cAAc,yBAClB,OACA,KAAA,GACA,QACA,cACA,UACF;EACA,0BAA0B,aAAa,eAAe;EACtD,OAAO;CACT;CAEA,OAAO,OAAO,OAAO;EACnB,SAAY,UAAgB,UAAU,OAAO,IAAI;EACjD,QAAW,UAAgB,UAAU,OAAO,KAAK;EACjD,aAAa,UAA0B,WAAW,OAAO,KAAK;EAC9D,gBAAgB,UACd,UAAU,OAAO,KAAK;EACxB,eAAyC;GACvC,SAAS,UAAU;GACnB,gBAAgB,UAAU;GAC1B,QAAQ,EAAE,GAAG,UAAU,OAAO;EAChC;CACF,CAAC;AACH;;AAGA,SAAgB,qBACd,OACA,iBACgD;CAChD,MAAM,SAAmC;EACvC,SAAS;EACT,gBAAgB;EAChB,QAAQ,CAAC;CACX;CACA,MAAM,WAAW,WAAW,OAAO,iBAAiB,MAAM;CAC1D,0BAA0B,UAAU,eAAe;CACnD,OAAO;EAAE,OAAO;EAAU;CAAO;AACnC;AAEA,SAAgB,sBAAsB,QAAgB,iBAA4C;CAChG,IAAI;EACF,OAAO,qBAAqB,QAAQ,eAAe,CAAC,CAAC;CACvD,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,0BAA0B,OAAgB,iBAA0C;CAC3F,IAAI,iBAAiB,YAAY;EAC/B,uBAAuB,OAAO,eAAe;EAC7C;CACF;CACA,IAAI,OAAO,UAAU,UAAU;EAC7B,KAAK,MAAM,kBAAkB,uBAAuB,eAAe,GACjE,IAAI,MAAM,SAAS,cAAc,GAC/B,MAAM,IAAI,MAAM,uDAAuD;EAG3E,IAAI,oCAAoC,OAAO,eAAe,GAC5D,MAAM,IAAI,MAAM,8DAA8D;EAEhF;CACF;CACA,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,KAAK,MAAM,SAAS,OAAO,0BAA0B,OAAO,eAAe;EAC3E;CACF;CACA,IAAI,SAAS,OAAO,UAAU,UAC5B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,0BAA0B,KAAK,eAAe;EAC9C,0BAA0B,OAAO,eAAe;CAClD;AAEJ;AAEA,SAAgB,uBACd,OACA,iBACM;CACN,IAAI,uBAAuB,OAAO,eAAe,GAC/C,MAAM,IAAI,MAAM,4DAA4D;AAEhF;AAEA,SAAS,WACP,OACA,iBACA,QACS;CACT,IAAI,iBAAiB,YAAY;EAC/B,IAAI,uBAAuB,OAAO,eAAe,GAAG;GAClD,gBAAgB,QAAQ,2BAA2B,CAAC;GACpD,OAAO,WAAW,KAAK,OAAO,KAAK,sCAAsC,MAAM,CAAC;EAClF;EACA,OAAO,WAAW,KAAK,KAAK;CAC9B;CACA,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,oCAAoC,OAAO,eAAe,GAAG;GAC/D,gBAAgB,QAAQ,2BAA2B,CAAC;GACpD,OAAO;EACT;EACA,MAAM,OAAO,qBAAqB;EAClC,MAAM,WAAW,WAAW,OAAO;GAAE,cAAc;GAAiB,QAAQ;EAAK,CAAC;EAClF,KAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,KAAK,UAAU,GAC5D,gBAAgB,QAAQ,UAAU,KAAK;EAEzC,OAAO;CACT;CACA,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,UAAU,WAAW,OAAO,iBAAiB,MAAM,CAAC;CAExE,IAAI,SAAS,OAAO,UAAU,UAAU;EACtC,MAAM,UAAoC,CAAC;EAC3C,MAAM,2BAAW,IAAI,IAAY;EACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;GAChD,MAAM,cAAc,WAAW,KAAK,iBAAiB,MAAM;GAC3D,IAAI,OAAO,gBAAgB,YAAY,SAAS,IAAI,WAAW,GAC7D,MAAM,IAAI,MAAM,+DAA+D;GAEjF,SAAS,IAAI,WAAW;GACxB,QAAQ,KAAK,CAAC,aAAa,WAAW,OAAO,iBAAiB,MAAM,CAAC,CAAC;EACxE;EACA,OAAO,OAAO,YAAY,OAAO;CACnC;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,WACA,QACA,cACA,kBACS;CACT,IAAI,iBAAiB,YAAY,OAAO,aAAa,OAAO,MAAM;CAClE,IAAI,OAAO,UAAU,UACnB,OAAO,aAAa,sBAAsB,SAAS,IAC/C,iBAAiB,OAAO,MAAM,IAC9B,aAAa,OAAO,MAAM;CAEhC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,UAChB,yBAAyB,OAAO,WAAW,QAAQ,cAAc,gBAAgB,CACnF;CAEF,IAAI,CAAC,SAAS,OAAO,UAAU,UAAU,OAAO;CAEhD,IAAI,cAAc,QAChB,OAAO,gBAAgB,OAAO,QAAQ,cAAc,gBAAgB;CAEtE,IAAI,cAAc,OAChB,OAAO,mBAAmB,OAAO,QAAQ,cAAc,gBAAgB;CAGzE,MAAM,UAAoC,CAAC;CAC3C,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,aAAa,KAAK,MAAM;EAC5C,IAAI,SAAS,IAAI,WAAW,GAC1B,MAAM,IAAI,MAAM,+DAA+D;EAEjF,SAAS,IAAI,WAAW;EACxB,QAAQ,KAAK,CACX,aACA,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB,CAC7E,CAAC;CACH;CACA,OAAO,OAAO,YAAY,OAAO;AACnC;AAEA,SAAS,gBACP,OACA,QACA,cACA,kBACyB;CACzB,MAAM,UAAoC,CAAC;CAC3C,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,iBAAiB,KAAK,MAAM;EAChD,IAAI,SAAS,IAAI,WAAW,GAC1B,MAAM,IAAI,MAAM,8DAA8D;EAEhF,SAAS,IAAI,WAAW;EACxB,QAAQ,KAAK,CACX,aACA,OAAO,UAAU,WACb,iBAAiB,OAAO,MAAM,IAC9B,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB,CACjF,CAAC;CACH;CACA,OAAO,OAAO,YAAY,OAAO;AACnC;AAEA,SAAS,mBACP,OACA,QACA,cACA,kBACyB;CACzB,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,aAAa,KAAK,MAAM;EAC5C,OAAO,gBACJ,QAAQ,SAAS,QAAQ,YAAY,OAAO,UAAU,WACnD,iBAAiB,OAAO,MAAM,IAC9B,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB;CACnF;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,MAAuB;CACpD,OAAO,SAAS,KAAK,IAAI;AAC3B;AAEA,SAAS,gBAAgB,QAAkC,MAAc,OAAqB;CAC5F,IAAI,SAAS,GAAG;CAChB,OAAO,kBAAkB;CACzB,OAAO,OAAO,SAAS,OAAO,OAAO,SAAS,KAAK;AACrD;AAEA,SAAS,uBAAuB,OAAmB,iBAA6C;CAC9F,MAAM,SAAS,OAAO,KAAK,KAAK;CAChC,OAAO,uBAAuB,eAAe,CAAC,CAAC,MAAM,UACnD,OAAO,SAAS,OAAO,KAAK,OAAO,MAAM,CAAC,CAC5C;AACF;AAEA,SAAS,oCACP,OACA,iBACS;CACT,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM,KAAK,CAAC,yBAAyB,KAAK,KAAK,GACpF,OAAO;CAET,IAAI;EACF,OAAO,uBAAuB,OAAO,KAAK,OAAO,QAAQ,GAAG,eAAe;CAC7E,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,uBAAuB,iBAA8C;CAC5E,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,0BAA0B,eAAe,GAAG;EAC9D,SAAS,IAAI,KAAK;EAClB,SAAS,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC;EAC1D,SAAS,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,SAAS,WAAW,CAAC;EAC7D,SAAS,IAAI,mBAAmB,KAAK,CAAC;CACxC;CACA,OAAO,CAAC,GAAG,QAAQ;AACrB;AAEA,SAAS,0BAA0B,QAAqC;CACtE,OAAO,CAAC,GAAG,IAAI,IAAI,OAAO,QAAQ,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAChE"}
+{"version":3,"file":"protected-redaction-DilFZch5.js","names":[],"sources":["../src/candidate-execution/protected-redaction.ts"],"sourcesContent":["import { createHmac, randomBytes } from 'node:crypto'\n\nimport {\n  emptyRedactionReport,\n  REDACTION_VERSION,\n  redactText,\n} from '@tangle-network/agent-eval/traces'\n\n/**\n * Candidate evidence redaction: agent-eval's redaction core with the\n * execution's protected values as known secrets, applied string by string so\n * the record's structure (keys, arrays, byte fields) is kept. Identifier fields\n * that change get an execution-local HMAC suffix so relationships stay\n * queryable, and every result is checked for surviving protected values in\n * plain, base64, base64url and URL-encoded form.\n */\n\nexport interface ProtectedRedactionReport {\n  version: string\n  redactionCount: number\n  byRule: Record<string, number>\n}\n\nexport interface ProtectedTraceIdentity {\n  readonly runId: string\n  readonly tags: Readonly<Record<string, string>>\n}\n\ninterface ProtectedRecordRedactor {\n  record<T>(value: T): T\n  query<T>(value: T): T\n  identifier(value: string): string\n  traceIdentity(trace: ProtectedTraceIdentity): ProtectedTraceIdentity\n  report(): ProtectedRedactionReport\n}\n\n/** Create one execution-local namespace for identifiers changed by redaction. */\nexport function createProtectedRecordRedactor(\n  protectedValues: readonly string[],\n): ProtectedRecordRedactor {\n  const identityKey = randomBytes(32)\n  const aggregate: ProtectedRedactionReport = {\n    version: REDACTION_VERSION,\n    redactionCount: 0,\n    byRule: {},\n  }\n\n  const mergeReport = (report: ProtectedRedactionReport): void => {\n    aggregate.version = report.version\n    aggregate.redactionCount += report.redactionCount\n    for (const [rule, count] of Object.entries(report.byRule)) {\n      aggregate.byRule[rule] = (aggregate.byRule[rule] ?? 0) + count\n    }\n  }\n\n  const redactScalar = <T>(value: T, record: boolean): T => {\n    const redacted = redactProtectedValue(value, protectedValues)\n    if (record) mergeReport(redacted.report)\n    return redacted.value\n  }\n\n  const identifier = (value: string, record: boolean): string => {\n    const redacted = redactScalar(value, record)\n    if (redacted === value) return value\n    const digest = createHmac('sha256', identityKey).update(value).digest('hex')\n    return `${redacted}:hmac-sha256:${digest}`\n  }\n\n  const transform = <T>(value: T, record: boolean): T => {\n    const transformed = transformProtectedRecord(\n      value,\n      undefined,\n      record,\n      redactScalar,\n      identifier,\n    ) as T\n    assertNoProtectedEvidence(transformed, protectedValues)\n    return transformed\n  }\n\n  return Object.freeze({\n    record: <T>(value: T): T => transform(value, true),\n    query: <T>(value: T): T => transform(value, false),\n    identifier: (value: string): string => identifier(value, false),\n    traceIdentity: (trace: ProtectedTraceIdentity): ProtectedTraceIdentity =>\n      transform(trace, false),\n    report: (): ProtectedRedactionReport => ({\n      version: aggregate.version,\n      redactionCount: aggregate.redactionCount,\n      byRule: { ...aggregate.byRule },\n    }),\n  })\n}\n\n/** Redact protected values at the first persistence boundary, including object keys and bytes. */\nexport function redactProtectedValue<T>(\n  value: T,\n  protectedValues: readonly string[],\n): { value: T; report: ProtectedRedactionReport } {\n  const report: ProtectedRedactionReport = {\n    version: REDACTION_VERSION,\n    redactionCount: 0,\n    byRule: {},\n  }\n  const redacted = redactNode(value, protectedValues, report) as T\n  assertNoProtectedEvidence(redacted, protectedValues)\n  return { value: redacted, report }\n}\n\nexport function redactProtectedReason(reason: string, protectedValues: readonly string[]): string {\n  try {\n    return redactProtectedValue(reason, protectedValues).value\n  } catch {\n    return 'candidate execution failed with a protected error'\n  }\n}\n\nfunction assertNoProtectedEvidence(value: unknown, protectedValues: readonly string[]): void {\n  if (value instanceof Uint8Array) {\n    assertNoProtectedBytes(value, protectedValues)\n    return\n  }\n  if (typeof value === 'string') {\n    for (const protectedValue of protectedValueVariants(protectedValues)) {\n      if (value.includes(protectedValue)) {\n        throw new Error('protected value survived candidate evidence redaction')\n      }\n    }\n    if (decodedBase64ContainsProtectedValue(value, protectedValues)) {\n      throw new Error('base64 protected value survived candidate evidence redaction')\n    }\n    return\n  }\n  if (Array.isArray(value)) {\n    for (const entry of value) assertNoProtectedEvidence(entry, protectedValues)\n    return\n  }\n  if (value && typeof value === 'object') {\n    for (const [key, entry] of Object.entries(value)) {\n      assertNoProtectedEvidence(key, protectedValues)\n      assertNoProtectedEvidence(entry, protectedValues)\n    }\n  }\n}\n\nexport function assertNoProtectedBytes(\n  bytes: Uint8Array,\n  protectedValues: readonly string[],\n): void {\n  if (containsProtectedBytes(bytes, protectedValues)) {\n    throw new Error('protected value survived candidate evidence byte redaction')\n  }\n}\n\nfunction redactNode(\n  value: unknown,\n  protectedValues: readonly string[],\n  report: ProtectedRedactionReport,\n): unknown {\n  if (value instanceof Uint8Array) {\n    if (containsProtectedBytes(value, protectedValues)) {\n      recordRedaction(report, 'candidate-access-binary', 1)\n      return Uint8Array.from(Buffer.from('[redacted:candidate-access-binary]', 'utf8'))\n    }\n    return Uint8Array.from(value)\n  }\n  if (typeof value === 'string') {\n    if (decodedBase64ContainsProtectedValue(value, protectedValues)) {\n      recordRedaction(report, 'candidate-access-binary', 1)\n      return '[redacted:candidate-access-binary]'\n    }\n    const core = emptyRedactionReport()\n    const redacted = redactText(value, { knownSecrets: protectedValues, report: core })\n    for (const [detector, count] of Object.entries(core.byDetector)) {\n      recordRedaction(report, detector, count)\n    }\n    return redacted\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) => redactNode(entry, protectedValues, report))\n  }\n  if (value && typeof value === 'object') {\n    const entries: Array<[string, unknown]> = []\n    const seenKeys = new Set<string>()\n    for (const [key, entry] of Object.entries(value)) {\n      const redactedKey = redactNode(key, protectedValues, report)\n      if (typeof redactedKey !== 'string' || seenKeys.has(redactedKey)) {\n        throw new Error('protected evidence redaction produced an ambiguous object key')\n      }\n      seenKeys.add(redactedKey)\n      entries.push([redactedKey, redactNode(entry, protectedValues, report)])\n    }\n    return Object.fromEntries(entries)\n  }\n  return value\n}\n\nfunction transformProtectedRecord(\n  value: unknown,\n  fieldName: string | undefined,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): unknown {\n  if (value instanceof Uint8Array) return redactScalar(value, record)\n  if (typeof value === 'string') {\n    return fieldName && isIdentifierFieldName(fieldName)\n      ? redactIdentifier(value, record)\n      : redactScalar(value, record)\n  }\n  if (Array.isArray(value)) {\n    return value.map((entry) =>\n      transformProtectedRecord(entry, fieldName, record, redactScalar, redactIdentifier),\n    )\n  }\n  if (!value || typeof value !== 'object') return value\n\n  if (fieldName === 'tags') {\n    return transformTagMap(value, record, redactScalar, redactIdentifier)\n  }\n  if (fieldName === 'tag') {\n    return transformTagFilter(value, record, redactScalar, redactIdentifier)\n  }\n\n  const entries: Array<[string, unknown]> = []\n  const seenKeys = new Set<string>()\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactScalar(key, record)\n    if (seenKeys.has(redactedKey)) {\n      throw new Error('protected evidence redaction produced an ambiguous object key')\n    }\n    seenKeys.add(redactedKey)\n    entries.push([\n      redactedKey,\n      transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier),\n    ])\n  }\n  return Object.fromEntries(entries)\n}\n\nfunction transformTagMap(\n  value: object,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): Record<string, unknown> {\n  const entries: Array<[string, unknown]> = []\n  const seenKeys = new Set<string>()\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactIdentifier(key, record)\n    if (seenKeys.has(redactedKey)) {\n      throw new Error('protected evidence redaction produced an ambiguous trace tag')\n    }\n    seenKeys.add(redactedKey)\n    entries.push([\n      redactedKey,\n      typeof entry === 'string'\n        ? redactIdentifier(entry, record)\n        : transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier),\n    ])\n  }\n  return Object.fromEntries(entries)\n}\n\nfunction transformTagFilter(\n  value: object,\n  record: boolean,\n  redactScalar: <T>(value: T, record: boolean) => T,\n  redactIdentifier: (value: string, record: boolean) => string,\n): Record<string, unknown> {\n  const output: Record<string, unknown> = {}\n  for (const [key, entry] of Object.entries(value)) {\n    const redactedKey = redactScalar(key, record)\n    output[redactedKey] =\n      (key === 'key' || key === 'value') && typeof entry === 'string'\n        ? redactIdentifier(entry, record)\n        : transformProtectedRecord(entry, key, record, redactScalar, redactIdentifier)\n  }\n  return output\n}\n\nfunction isIdentifierFieldName(name: string): boolean {\n  return /ids?$/i.test(name)\n}\n\nfunction recordRedaction(report: ProtectedRedactionReport, rule: string, count: number): void {\n  if (count <= 0) return\n  report.redactionCount += count\n  report.byRule[rule] = (report.byRule[rule] ?? 0) + count\n}\n\nfunction containsProtectedBytes(bytes: Uint8Array, protectedValues: readonly string[]): boolean {\n  const source = Buffer.from(bytes)\n  return protectedValueVariants(protectedValues).some((value) =>\n    source.includes(Buffer.from(value, 'utf8')),\n  )\n}\n\nfunction decodedBase64ContainsProtectedValue(\n  value: string,\n  protectedValues: readonly string[],\n): boolean {\n  if (value.length < 4 || value.length % 4 !== 0 || !/^[A-Za-z0-9+/]*={0,2}$/.test(value)) {\n    return false\n  }\n  try {\n    return containsProtectedBytes(Buffer.from(value, 'base64'), protectedValues)\n  } catch {\n    return false\n  }\n}\n\nfunction protectedValueVariants(protectedValues: readonly string[]): string[] {\n  const variants = new Set<string>()\n  for (const value of normalizedProtectedValues(protectedValues)) {\n    variants.add(value)\n    variants.add(Buffer.from(value, 'utf8').toString('base64'))\n    variants.add(Buffer.from(value, 'utf8').toString('base64url'))\n    variants.add(encodeURIComponent(value))\n  }\n  return [...variants]\n}\n\nfunction normalizedProtectedValues(values: readonly string[]): string[] {\n  return [...new Set(values.filter((value) => value.length > 0))]\n}\n"],"mappings":";;;;AAqCA,SAAgB,8BACd,iBACyB;CACzB,MAAM,cAAc,YAAY,EAAE;CAClC,MAAM,YAAsC;EAC1C,SAAS;EACT,gBAAgB;EAChB,QAAQ,CAAC;CACX;CAEA,MAAM,eAAe,WAA2C;EAC9D,UAAU,UAAU,OAAO;EAC3B,UAAU,kBAAkB,OAAO;EACnC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,MAAM,GACtD,UAAU,OAAO,SAAS,UAAU,OAAO,SAAS,KAAK;CAE7D;CAEA,MAAM,gBAAmB,OAAU,WAAuB;EACxD,MAAM,WAAW,qBAAqB,OAAO,eAAe;EAC5D,IAAI,QAAQ,YAAY,SAAS,MAAM;EACvC,OAAO,SAAS;CAClB;CAEA,MAAM,cAAc,OAAe,WAA4B;EAC7D,MAAM,WAAW,aAAa,OAAO,MAAM;EAC3C,IAAI,aAAa,OAAO,OAAO;EAE/B,OAAO,GAAG,SAAS,eADJ,WAAW,UAAU,WAAW,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAC/B;CACzC;CAEA,MAAM,aAAgB,OAAU,WAAuB;EACrD,MAAM,cAAc,yBAClB,OACA,KAAA,GACA,QACA,cACA,UACF;EACA,0BAA0B,aAAa,eAAe;EACtD,OAAO;CACT;CAEA,OAAO,OAAO,OAAO;EACnB,SAAY,UAAgB,UAAU,OAAO,IAAI;EACjD,QAAW,UAAgB,UAAU,OAAO,KAAK;EACjD,aAAa,UAA0B,WAAW,OAAO,KAAK;EAC9D,gBAAgB,UACd,UAAU,OAAO,KAAK;EACxB,eAAyC;GACvC,SAAS,UAAU;GACnB,gBAAgB,UAAU;GAC1B,QAAQ,EAAE,GAAG,UAAU,OAAO;EAChC;CACF,CAAC;AACH;;AAGA,SAAgB,qBACd,OACA,iBACgD;CAChD,MAAM,SAAmC;EACvC,SAAS;EACT,gBAAgB;EAChB,QAAQ,CAAC;CACX;CACA,MAAM,WAAW,WAAW,OAAO,iBAAiB,MAAM;CAC1D,0BAA0B,UAAU,eAAe;CACnD,OAAO;EAAE,OAAO;EAAU;CAAO;AACnC;AAEA,SAAgB,sBAAsB,QAAgB,iBAA4C;CAChG,IAAI;EACF,OAAO,qBAAqB,QAAQ,eAAe,CAAC,CAAC;CACvD,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,0BAA0B,OAAgB,iBAA0C;CAC3F,IAAI,iBAAiB,YAAY;EAC/B,uBAAuB,OAAO,eAAe;EAC7C;CACF;CACA,IAAI,OAAO,UAAU,UAAU;EAC7B,KAAK,MAAM,kBAAkB,uBAAuB,eAAe,GACjE,IAAI,MAAM,SAAS,cAAc,GAC/B,MAAM,IAAI,MAAM,uDAAuD;EAG3E,IAAI,oCAAoC,OAAO,eAAe,GAC5D,MAAM,IAAI,MAAM,8DAA8D;EAEhF;CACF;CACA,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,KAAK,MAAM,SAAS,OAAO,0BAA0B,OAAO,eAAe;EAC3E;CACF;CACA,IAAI,SAAS,OAAO,UAAU,UAC5B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,0BAA0B,KAAK,eAAe;EAC9C,0BAA0B,OAAO,eAAe;CAClD;AAEJ;AAEA,SAAgB,uBACd,OACA,iBACM;CACN,IAAI,uBAAuB,OAAO,eAAe,GAC/C,MAAM,IAAI,MAAM,4DAA4D;AAEhF;AAEA,SAAS,WACP,OACA,iBACA,QACS;CACT,IAAI,iBAAiB,YAAY;EAC/B,IAAI,uBAAuB,OAAO,eAAe,GAAG;GAClD,gBAAgB,QAAQ,2BAA2B,CAAC;GACpD,OAAO,WAAW,KAAK,OAAO,KAAK,sCAAsC,MAAM,CAAC;EAClF;EACA,OAAO,WAAW,KAAK,KAAK;CAC9B;CACA,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,oCAAoC,OAAO,eAAe,GAAG;GAC/D,gBAAgB,QAAQ,2BAA2B,CAAC;GACpD,OAAO;EACT;EACA,MAAM,OAAO,qBAAqB;EAClC,MAAM,WAAW,WAAW,OAAO;GAAE,cAAc;GAAiB,QAAQ;EAAK,CAAC;EAClF,KAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,KAAK,UAAU,GAC5D,gBAAgB,QAAQ,UAAU,KAAK;EAEzC,OAAO;CACT;CACA,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,UAAU,WAAW,OAAO,iBAAiB,MAAM,CAAC;CAExE,IAAI,SAAS,OAAO,UAAU,UAAU;EACtC,MAAM,UAAoC,CAAC;EAC3C,MAAM,2BAAW,IAAI,IAAY;EACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;GAChD,MAAM,cAAc,WAAW,KAAK,iBAAiB,MAAM;GAC3D,IAAI,OAAO,gBAAgB,YAAY,SAAS,IAAI,WAAW,GAC7D,MAAM,IAAI,MAAM,+DAA+D;GAEjF,SAAS,IAAI,WAAW;GACxB,QAAQ,KAAK,CAAC,aAAa,WAAW,OAAO,iBAAiB,MAAM,CAAC,CAAC;EACxE;EACA,OAAO,OAAO,YAAY,OAAO;CACnC;CACA,OAAO;AACT;AAEA,SAAS,yBACP,OACA,WACA,QACA,cACA,kBACS;CACT,IAAI,iBAAiB,YAAY,OAAO,aAAa,OAAO,MAAM;CAClE,IAAI,OAAO,UAAU,UACnB,OAAO,aAAa,sBAAsB,SAAS,IAC/C,iBAAiB,OAAO,MAAM,IAC9B,aAAa,OAAO,MAAM;CAEhC,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,UAChB,yBAAyB,OAAO,WAAW,QAAQ,cAAc,gBAAgB,CACnF;CAEF,IAAI,CAAC,SAAS,OAAO,UAAU,UAAU,OAAO;CAEhD,IAAI,cAAc,QAChB,OAAO,gBAAgB,OAAO,QAAQ,cAAc,gBAAgB;CAEtE,IAAI,cAAc,OAChB,OAAO,mBAAmB,OAAO,QAAQ,cAAc,gBAAgB;CAGzE,MAAM,UAAoC,CAAC;CAC3C,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,aAAa,KAAK,MAAM;EAC5C,IAAI,SAAS,IAAI,WAAW,GAC1B,MAAM,IAAI,MAAM,+DAA+D;EAEjF,SAAS,IAAI,WAAW;EACxB,QAAQ,KAAK,CACX,aACA,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB,CAC7E,CAAC;CACH;CACA,OAAO,OAAO,YAAY,OAAO;AACnC;AAEA,SAAS,gBACP,OACA,QACA,cACA,kBACyB;CACzB,MAAM,UAAoC,CAAC;CAC3C,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,iBAAiB,KAAK,MAAM;EAChD,IAAI,SAAS,IAAI,WAAW,GAC1B,MAAM,IAAI,MAAM,8DAA8D;EAEhF,SAAS,IAAI,WAAW;EACxB,QAAQ,KAAK,CACX,aACA,OAAO,UAAU,WACb,iBAAiB,OAAO,MAAM,IAC9B,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB,CACjF,CAAC;CACH;CACA,OAAO,OAAO,YAAY,OAAO;AACnC;AAEA,SAAS,mBACP,OACA,QACA,cACA,kBACyB;CACzB,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;EAChD,MAAM,cAAc,aAAa,KAAK,MAAM;EAC5C,OAAO,gBACJ,QAAQ,SAAS,QAAQ,YAAY,OAAO,UAAU,WACnD,iBAAiB,OAAO,MAAM,IAC9B,yBAAyB,OAAO,KAAK,QAAQ,cAAc,gBAAgB;CACnF;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,MAAuB;CACpD,OAAO,SAAS,KAAK,IAAI;AAC3B;AAEA,SAAS,gBAAgB,QAAkC,MAAc,OAAqB;CAC5F,IAAI,SAAS,GAAG;CAChB,OAAO,kBAAkB;CACzB,OAAO,OAAO,SAAS,OAAO,OAAO,SAAS,KAAK;AACrD;AAEA,SAAS,uBAAuB,OAAmB,iBAA6C;CAC9F,MAAM,SAAS,OAAO,KAAK,KAAK;CAChC,OAAO,uBAAuB,eAAe,CAAC,CAAC,MAAM,UACnD,OAAO,SAAS,OAAO,KAAK,OAAO,MAAM,CAAC,CAC5C;AACF;AAEA,SAAS,oCACP,OACA,iBACS;CACT,IAAI,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM,KAAK,CAAC,yBAAyB,KAAK,KAAK,GACpF,OAAO;CAET,IAAI;EACF,OAAO,uBAAuB,OAAO,KAAK,OAAO,QAAQ,GAAG,eAAe;CAC7E,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,uBAAuB,iBAA8C;CAC5E,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,0BAA0B,eAAe,GAAG;EAC9D,SAAS,IAAI,KAAK;EAClB,SAAS,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,SAAS,QAAQ,CAAC;EAC1D,SAAS,IAAI,OAAO,KAAK,OAAO,MAAM,CAAC,CAAC,SAAS,WAAW,CAAC;EAC7D,SAAS,IAAI,mBAAmB,KAAK,CAAC;CACxC;CACA,OAAO,CAAC,GAAG,QAAQ;AACrB;AAEA,SAAS,0BAA0B,QAAqC;CACtE,OAAO,CAAC,GAAG,IAAI,IAAI,OAAO,QAAQ,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAChE"}

package/dist/{provision-supervisor-C4v2vqDo.js → provision-supervisor-D9pO-iPl.js}

@@ -1,15 +1,15 @@
-import { s as writeAtomicDurableFile } from "./record-events-D93DkpAx.js";
-import { C as interactiveAdmissionSeamKey, Fr as signalAbortError, In as createInbox, Kn as taskToPrompt, Ln as failPendingAfter, Nr as linkAbort, O as startRetainedInteractiveRun, Ri as detachedSnapshot, T as readWorkerInteractiveBinding, an as destroyInteractiveEnvironment, in as retainedCreateMaterial, n as createSupervisor, ni as attestRuntimeOwnedPendingExecutor, oi as finalizeRuntimeOwnedPendingExecutor, on as environmentGone, p as createRootHandle, ui as newExecutionAttemptId, xi as executableAgentProfileSnapshot, zi as contentAddress } from "./supervisor-wS9Ehz_x.js";
-import { Ct as armDeadlineTimer, U as abortError, ot as sleep } from "./sandbox-profile-compat-DtuJWFrM.js";
-import { a as concreteProfileModel } from "./model-policy-CyCUwHed.js";
-import { f as createFileRunContext, o as createCancelAcknowledger, s as createSteerAcknowledger, t as createCoordinationTools } from "./coordination-manager-B2Z_MmL9.js";
-import { v as supervisorRunDir } from "./run-cancellation-CzFhQGMa.js";
+import { rt as contentAddress, tt as detachedSnapshot, y as writeAtomicDurableFile } from "./journal-store-BJPMUydp.js";
+import { C as interactiveAdmissionSeamKey, Dn as createInbox, Er as signalAbortError, Jr as attestRuntimeOwnedPendingExecutor, Ln as taskToPrompt, O as startRetainedInteractiveRun, On as failPendingAfter, Qr as finalizeRuntimeOwnedPendingExecutor, T as readWorkerInteractiveBinding, Xt as destroyInteractiveEnvironment, Yt as retainedCreateMaterial, Zt as environmentGone, n as createSupervisor, ni as newExecutionAttemptId, p as createRootHandle, pi as executableAgentProfileSnapshot, wr as linkAbort } from "./supervisor-rK5Y8en6.js";
+import { F as armDeadlineTimer, t as abortError, v as sleep } from "./util-ebWMWzY0.js";
+import { a as concreteProfileModel } from "./model-policy-C-RGAUW4.js";
+import { c as createCancelAcknowledger, l as createSteerAcknowledger, m as createFileRunContext, t as createCoordinationTools } from "./coordination-manager-B7QadgrI.js";
+import { v as supervisorRunDir } from "./run-cancellation-CoJRKvih.js";
 import { agentInteractiveSessionControlClaimRequestDigest, agentInteractiveSessionPromptRequestDigest, agentInteractiveSessionStopRequestDigest, agentProfileSchema, canonicalAgentProfileDigest, canonicalCandidateDigest } from "@tangle-network/agent-interface";
 import { randomUUID } from "node:crypto";
 import { mkdirSync } from "node:fs";
 import { dirname, join, resolve } from "node:path";
 import { tmpdir } from "node:os";
-//#region src/runtime/retained-interactive-control.ts
+// src/runtime/retained-interactive-control.ts
 const MAX_GENERATION_CONFLICTS = 8;
 /**
 * Acquire provider-issued write authority without reading authority from status.
@@ -57,8 +57,7 @@ function controlClaimOperationId(handle, holderId, expectedGeneration) {
 		expectedGeneration
 	}).slice(7, 47)}`;
 }
-//#endregion
-//#region src/runtime/supervise/interactive-executor.ts
+// src/runtime/supervise/interactive-executor.ts
 /**
 * The executor behind one interactive worker: starts the provider's retained interactive process,
 * polls it to exit, relays steers as prompts, and stops and releases it exactly once.
@@ -495,8 +494,7 @@ async function safeStatus(handle) {
 		if (timer !== void 0) clearTimeout(timer);
 	}
 }
-//#endregion
-//#region src/runtime/supervise/interactive-worker.ts
+// src/runtime/supervise/interactive-worker.ts
 /**
 * Runtime-owned worker seam for a provider's native interactive coding-agent process. It composes
 * the retained-interactive lifecycle, adding no second stream, replay buffer, session id or
@@ -606,8 +604,7 @@ function stableKey(value, label) {
 	if (key.length > 256) throw new Error(`${label} must not exceed 256 bytes`);
 	return key;
 }
-//#endregion
-//#region src/runtime/supervise/provision-supervisor.ts
+// src/runtime/supervise/provision-supervisor.ts
 /**
 * Public one-call composition for a durable Runtime supervisor proof run.
 *
@@ -1024,7 +1021,6 @@ function writeState(path, state) {
 	mkdirSync(dirname(path), { recursive: true });
 	writeAtomicDurableFile(path, `${JSON.stringify(state)}\n`, { mode: 384 });
 }
-//#endregion
 export { workerFromInteractiveProvider as n, claimRetainedInteractiveControl as r, provisionSupervisor as t };
 
-//# sourceMappingURL=provision-supervisor-C4v2vqDo.js.map
+//# sourceMappingURL=provision-supervisor-D9pO-iPl.js.map