@tangle-network/agent-runtime 0.105.0 → 0.106.0

package/dist/researcher-CoVqNhfI.js

@@ -0,0 +1,433 @@
+//#region src/profiles/researcher.ts
+const DEFAULT_HARNESS = "opencode/zai-coding-plan/glm-5.1";
+const DEFAULT_CITATION_DENSITY_MIN = .7;
+/** Build a source-grounded researcher profile with output parsing and validation. @experimental */
+function researcherProfile(options = {}) {
+	const harness = options.harness ?? DEFAULT_HARNESS;
+	const name = options.name ?? `researcher-${harness}`;
+	const systemPrompt = options.systemPrompt ?? DEFAULT_RESEARCHER_SYSTEM_PROMPT;
+	const citationDensityMin = options.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN;
+	const profile = {
+		name,
+		description: "Source-grounded research agent. Propose-don't-apply.",
+		prompt: { systemPrompt },
+		model: options.model ? { default: options.model } : void 0,
+		tools: {
+			web_search: true,
+			fs: true,
+			shell: true
+		},
+		metadata: {
+			backendType: harness,
+			role: "researcher"
+		}
+	};
+	return {
+		profile,
+		taskToPrompt: formatResearcherPrompt,
+		output: { parse: parseResearcherEvents },
+		validator: options.task ? createResearcherValidator(options.task, { citationDensityMin }) : createResearcherValidator({
+			question: "",
+			knowledgeNamespace: ""
+		}, {
+			citationDensityMin,
+			namespaceCheck: false
+		}),
+		agentRunSpec: {
+			name,
+			profile,
+			taskToPrompt: formatResearcherPrompt
+		}
+	};
+}
+/**
+* Build a fanout topology over multiple harnesses. The kernel round-robins
+* `agentRuns` across the N parallel iterations and the `FanoutVote` driver
+* picks the highest-scoring valid output.
+*
+* @experimental
+*/
+function multiHarnessResearcherFanout(options = {}) {
+	const harnesses = options.harnesses && options.harnesses.length > 0 ? options.harnesses : [
+		"opencode/zai-coding-plan/glm-5.1",
+		"claude-code",
+		"codex"
+	];
+	const models = options.models ?? [];
+	const agentRuns = harnesses.map((harness, i) => {
+		const { agentRunSpec } = researcherProfile({
+			harness,
+			model: models[i]
+		});
+		return agentRunSpec;
+	});
+	const { output, validator } = researcherProfile({
+		citationDensityMin: options.citationDensityMin,
+		task: options.task
+	});
+	return {
+		agentRuns,
+		output,
+		validator,
+		driver: {
+			name: "researcher-fanout",
+			async plan(task, history) {
+				return history.length === 0 ? Array.from({ length: harnesses.length }, () => task) : [];
+			},
+			decide() {
+				return "done";
+			},
+			describePlan() {
+				return { kind: "fanout" };
+			}
+		}
+	};
+}
+/**
+* Build a validator that closes over a specific `ResearchTask`'s constraints.
+*
+* Checks in order:
+*   1. Items must be non-empty.
+*   2. Every item carries `evidence.length >= 1`.
+*   3. Every item + proposedWrite is scoped to `task.knowledgeNamespace`
+*      (hard-fail on any namespace mismatch — defence in depth for the
+*      multi-tenant invariant).
+*   4. Citation density (citations with quote / items) >= floor.
+*
+* Aggregate score:
+*   0.4 · citation_density
+* + 0.2 · source_diversity (distinct sources / max(items, 1))
+* + 0.2 · recency_match (mean fraction within `recencyWindow`)
+* + 0.2 · (1 − gaps/maxGaps), maxGaps = max(items, 1)
+*
+* @experimental
+*/
+function createResearcherValidator(task, config = {}) {
+	const citationDensityMin = config.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN;
+	const namespaceCheck = config.namespaceCheck ?? true;
+	return { async validate(output) {
+		const notes = [];
+		const scores = {};
+		let pass = true;
+		if (!Array.isArray(output.items) || output.items.length === 0) {
+			pass = false;
+			notes.push("no items");
+			scores.items = 0;
+		} else scores.items = 1;
+		const missingEvidence = (output.items ?? []).filter((item) => !Array.isArray(item.evidence) || item.evidence.length === 0);
+		if (missingEvidence.length > 0) {
+			pass = false;
+			notes.push(`${missingEvidence.length} item(s) without evidence`);
+			scores.provenance = 0;
+		} else scores.provenance = 1;
+		if (namespaceCheck) {
+			const foreignItems = (output.items ?? []).filter((item) => item.namespace !== task.knowledgeNamespace);
+			const foreignWrites = (output.proposedWrites ?? []).filter((write) => write.namespace !== task.knowledgeNamespace);
+			if (foreignItems.length > 0 || foreignWrites.length > 0) {
+				pass = false;
+				notes.push(`namespace violation: ${foreignItems.length} item(s) + ${foreignWrites.length} write(s) outside ${task.knowledgeNamespace}`);
+				scores.namespace = 0;
+			} else scores.namespace = 1;
+		}
+		const itemCount = Math.max(output.items?.length ?? 0, 1);
+		const citationsWithQuote = (output.citations ?? []).filter((citation) => typeof citation.quote === "string" && citation.quote.length > 0).length;
+		const citationDensity = Math.min(1, citationsWithQuote / itemCount);
+		if (citationDensity < citationDensityMin) {
+			pass = false;
+			notes.push(`citation density ${citationDensity.toFixed(2)} below floor ${citationDensityMin.toFixed(2)}`);
+		}
+		scores.citation_density = citationDensity;
+		const sourceSet = /* @__PURE__ */ new Set();
+		for (const item of output.items ?? []) for (const evidence of item.evidence ?? []) if (evidence.source) sourceSet.add(evidence.source);
+		scores.source_diversity = Math.min(1, sourceSet.size / itemCount);
+		scores.recency_match = recencyMatchScore(output.items ?? [], task.recencyWindow);
+		const maxGaps = itemCount;
+		const gapCount = output.gaps?.length ?? 0;
+		scores.gap_coverage = Math.max(0, 1 - gapCount / maxGaps);
+		const score = .4 * scores.citation_density + .2 * scores.source_diversity + .2 * scores.recency_match + .2 * scores.gap_coverage;
+		const verdict = {
+			valid: pass,
+			score: Number.isFinite(score) ? score : 0,
+			scores
+		};
+		if (notes.length > 0) verdict.notes = notes.join("; ");
+		return verdict;
+	} };
+}
+function recencyMatchScore(items, window) {
+	if (!window || window.since === void 0 && window.until === void 0) return 1;
+	if (items.length === 0) return 0;
+	const sinceMs = window.since?.getTime() ?? Number.NEGATIVE_INFINITY;
+	const untilMs = window.until?.getTime() ?? Number.POSITIVE_INFINITY;
+	let hits = 0;
+	let total = 0;
+	for (const item of items) for (const evidence of item.evidence ?? []) {
+		if (typeof evidence.capturedAt !== "number") continue;
+		total += 1;
+		if (evidence.capturedAt >= sinceMs && evidence.capturedAt <= untilMs) hits += 1;
+	}
+	return total === 0 ? 0 : hits / total;
+}
+const DEFAULT_RESEARCHER_SYSTEM_PROMPT = [
+	"You are a research agent. Your job is to answer a research question with",
+	"source-grounded knowledge items that the caller will choose whether to",
+	"persist to a multi-tenant knowledge base.",
+	"",
+	"Hard rules:",
+	"  1. Every item you emit MUST carry the task's knowledgeNamespace exactly.",
+	"     Never write to a different namespace.",
+	"  2. Every item MUST carry at least one evidence entry with a source.",
+	"     A quote + url is strongly preferred; capturedAt is unix ms.",
+	"  3. You propose writes — you do NOT apply them. The caller decides.",
+	"  4. Self-report confidence honestly in [0, 1]. Do not inflate.",
+	"  5. List what you could not answer in `gaps`. Better to admit a gap",
+	"     than fabricate.",
+	"",
+	"When you finish, emit a single final structured message of the shape:",
+	"  ```json",
+	"  { \"items\": [{ \"id\": \"...\", \"namespace\": \"...\", \"claim\": \"...\",",
+	"                \"evidence\": [{ \"source\": \"...\", \"quote\": \"...\",",
+	"                               \"url\": \"...\", \"capturedAt\": 0 }],",
+	"                \"confidence\": 0.0,",
+	"                \"authoredBy\": { \"kind\": \"agent\", \"id\": \"...\" } }],",
+	"    \"citations\": [{ \"url\": \"...\", \"quote\": \"...\", \"confidence\": 0.0 }],",
+	"    \"proposedWrites\": [{ \"kind\": \"insert\", \"namespace\": \"...\",",
+	"                         \"item\": { /* same shape as items[] */ } }],",
+	"    \"gaps\": [\"...\"],",
+	"    \"notes\": \"free-form commentary\" }",
+	"  ```"
+].join("\n");
+function formatResearcherPrompt(task) {
+	const sources = task.sources?.length ? task.sources.join(", ") : "(no preference)";
+	const window = formatRecencyWindow(task.recencyWindow);
+	return [
+		`Question: ${task.question}`,
+		`Knowledge namespace (DO NOT cross): ${task.knowledgeNamespace}`,
+		`Scope: ${task.scope ?? "(unspecified)"}`,
+		`Preferred sources: ${sources}`,
+		`Recency window: ${window}`,
+		`Max items: ${task.maxItems ?? "(no cap)"}`,
+		`Per-item minimum confidence: ${task.minConfidence ?? "(no floor)"}`,
+		"",
+		"Produce knowledge items with provenance + citations + proposed writes.",
+		"List gaps for anything you could not answer. Emit the final JSON",
+		"result block exactly as instructed."
+	].join("\n");
+}
+function formatRecencyWindow(window) {
+	if (!window) return "(none)";
+	return `${window.since ? window.since.toISOString() : "-∞"} .. ${window.until ? window.until.toISOString() : "now"}`;
+}
+/**
+* Walk the event stream and return the last structured `research.result`
+* payload. Falls back to scanning text deltas for a fenced JSON block.
+*/
+function parseResearcherEvents(events) {
+	for (let i = events.length - 1; i >= 0; i -= 1) {
+		const event = events[i];
+		if (!event) continue;
+		const type = String(event.type ?? "");
+		const data = isRecord(event.data) ? event.data : {};
+		if (type === "result" || type === "final" || type === "research.result") {
+			const direct = coerceResearchOutput(data.result ?? data.output ?? data);
+			const finalText = pickString(data.finalText);
+			const fenced = finalText ? extractFencedJson(finalText) : void 0;
+			const fromFinalText = fenced ? coerceResearchOutput(fenced) : void 0;
+			if (direct && !isEmptyOutput(direct)) return direct;
+			if (fromFinalText) return fromFinalText;
+			if (direct) return direct;
+		}
+	}
+	for (let i = events.length - 1; i >= 0; i -= 1) {
+		const event = events[i];
+		if (!event) continue;
+		const data = isRecord(event.data) ? event.data : {};
+		const text = pickString(data.text) ?? pickString(data.delta) ?? pickString(data.finalText);
+		if (!text) continue;
+		const fenced = extractFencedJson(text);
+		if (!fenced) continue;
+		const coerced = coerceResearchOutput(fenced);
+		if (coerced) return coerced;
+	}
+	return {
+		items: [],
+		citations: [],
+		proposedWrites: []
+	};
+}
+function isRecord(value) {
+	return value !== null && typeof value === "object" && !Array.isArray(value);
+}
+/** A coerced output that carries no items, citations, or proposed writes. */
+function isEmptyOutput(o) {
+	return o.items.length === 0 && o.citations.length === 0 && o.proposedWrites.length === 0;
+}
+function pickString(value) {
+	return typeof value === "string" && value.length > 0 ? value : void 0;
+}
+function extractFencedJson(text) {
+	const match = text.match(/```(?:json)?\s*([\s\S]*?)```/i);
+	if (!match) return void 0;
+	const body = (match[1] ?? "").trim();
+	if (!body) return void 0;
+	try {
+		return JSON.parse(body);
+	} catch {
+		return;
+	}
+}
+function coerceResearchOutput(value) {
+	if (!isRecord(value)) return void 0;
+	const items = coerceItems(value.items);
+	const citations = coerceCitations(value.citations);
+	const proposedWrites = coerceProposedWrites(value.proposedWrites);
+	if (items === void 0 && citations === void 0 && proposedWrites === void 0) return;
+	const output = {
+		items: items ?? [],
+		citations: citations ?? [],
+		proposedWrites: proposedWrites ?? []
+	};
+	if (Array.isArray(value.gaps)) output.gaps = value.gaps.filter((entry) => typeof entry === "string");
+	const notes = pickString(value.notes);
+	if (notes) output.notes = notes;
+	const known = /* @__PURE__ */ new Set([
+		"items",
+		"citations",
+		"proposedWrites",
+		"gaps",
+		"notes"
+	]);
+	const extras = {};
+	let extrasCount = 0;
+	for (const [key, val] of Object.entries(value)) {
+		if (known.has(key)) continue;
+		extras[key] = val;
+		extrasCount += 1;
+	}
+	if (extrasCount > 0) output.raw = extras;
+	return output;
+}
+function coerceItems(value) {
+	if (!Array.isArray(value)) return void 0;
+	const out = [];
+	for (const entry of value) {
+		if (!isRecord(entry)) continue;
+		const id = pickString(entry.id);
+		const namespace = pickString(entry.namespace);
+		const claim = pickString(entry.claim);
+		const evidence = coerceEvidence(entry.evidence);
+		const confidence = toFiniteNumber(entry.confidence);
+		const authoredBy = coerceAuthoredBy(entry.authoredBy);
+		if (!id || !namespace || !claim || !authoredBy) continue;
+		const item = {
+			id,
+			namespace,
+			claim,
+			evidence,
+			confidence: clamp01(confidence),
+			authoredBy
+		};
+		if (Array.isArray(entry.supersedes)) item.supersedes = entry.supersedes.filter((s) => typeof s === "string");
+		const retractedAt = toFiniteNumber(entry.retractedAt);
+		if (retractedAt > 0) item.retractedAt = retractedAt;
+		out.push(item);
+	}
+	return out;
+}
+function coerceEvidence(value) {
+	if (!Array.isArray(value)) return [];
+	const out = [];
+	for (const entry of value) {
+		if (!isRecord(entry)) continue;
+		const source = pickString(entry.source);
+		if (!source) continue;
+		const item = {
+			source,
+			capturedAt: toFiniteNumber(entry.capturedAt)
+		};
+		const quote = pickString(entry.quote);
+		if (quote) item.quote = quote;
+		const url = pickString(entry.url);
+		if (url) item.url = url;
+		out.push(item);
+	}
+	return out;
+}
+function coerceAuthoredBy(value) {
+	if (!isRecord(value)) return void 0;
+	const kind = value.kind === "human" || value.kind === "agent" ? value.kind : void 0;
+	const id = pickString(value.id);
+	if (!kind || !id) return void 0;
+	return {
+		kind,
+		id
+	};
+}
+function coerceCitations(value) {
+	if (!Array.isArray(value)) return void 0;
+	const out = [];
+	for (const entry of value) {
+		if (!isRecord(entry)) continue;
+		const url = pickString(entry.url);
+		const quote = pickString(entry.quote);
+		if (!url || !quote) continue;
+		out.push({
+			url,
+			quote,
+			confidence: clamp01(toFiniteNumber(entry.confidence))
+		});
+	}
+	return out;
+}
+function coerceProposedWrites(value) {
+	if (!Array.isArray(value)) return void 0;
+	const out = [];
+	for (const entry of value) {
+		if (!isRecord(entry)) continue;
+		const namespace = pickString(entry.namespace);
+		if (!namespace) continue;
+		if (entry.kind === "insert") {
+			const item = coerceItems([entry.item])?.[0];
+			if (!item) continue;
+			out.push({
+				kind: "insert",
+				namespace,
+				item
+			});
+		} else if (entry.kind === "supersede") {
+			const previousId = pickString(entry.previousId);
+			const item = coerceItems([entry.item])?.[0];
+			if (!previousId || !item) continue;
+			out.push({
+				kind: "supersede",
+				namespace,
+				previousId,
+				item
+			});
+		} else if (entry.kind === "retract") {
+			const itemId = pickString(entry.itemId);
+			const reason = pickString(entry.reason);
+			if (!itemId || !reason) continue;
+			out.push({
+				kind: "retract",
+				namespace,
+				itemId,
+				reason
+			});
+		}
+	}
+	return out;
+}
+function toFiniteNumber(value) {
+	return typeof value === "number" && Number.isFinite(value) ? value : 0;
+}
+function clamp01(value) {
+	if (!Number.isFinite(value)) return 0;
+	if (value < 0) return 0;
+	if (value > 1) return 1;
+	return value;
+}
+//#endregion
+export { multiHarnessResearcherFanout as n, researcherProfile as r, createResearcherValidator as t };
+
+//# sourceMappingURL=researcher-CoVqNhfI.js.map

package/dist/researcher-CoVqNhfI.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"researcher-CoVqNhfI.js","names":[],"sources":["../src/profiles/researcher.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. `harness` selects the\n * sandbox-SDK backend. For heterogeneous fanout, use\n * `multiHarnessResearcherFanout`.\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 type { AgentProfile } from '@tangle-network/agent-interface'\nimport type { SandboxEvent } from '@tangle-network/sandbox'\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. @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  /** Sandbox-SDK backend.type. Default `'opencode/zai-coding-plan/glm-5.1'`. */\n  harness?: string\n  /** Default model id passed in `AgentProfile.model.default`. */\n  model?: string\n  /** Custom system prompt replacement. Default = built-in researcher preset. */\n  systemPrompt?: string\n  /** Stable name for `AgentRunSpec.name`. Default = `researcher-${harness}`. */\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_HARNESS = 'opencode/zai-coding-plan/glm-5.1'\nconst DEFAULT_CITATION_DENSITY_MIN = 0.7\n\n/** Build a source-grounded researcher profile with output parsing and validation. @experimental */\nexport function researcherProfile(\n  options: ResearcherProfileOptions & { task?: ResearchTask } = {},\n): {\n  profile: AgentProfile\n  taskToPrompt: (task: ResearchTask) => string\n  output: OutputAdapter<ResearchOutput>\n  validator: Validator<ResearchOutput>\n  agentRunSpec: AgentRunSpec<ResearchTask>\n} {\n  const harness = options.harness ?? DEFAULT_HARNESS\n  const name = options.name ?? `researcher-${harness}`\n  const systemPrompt = options.systemPrompt ?? DEFAULT_RESEARCHER_SYSTEM_PROMPT\n  const citationDensityMin = options.citationDensityMin ?? DEFAULT_CITATION_DENSITY_MIN\n  const profile: AgentProfile = {\n    name,\n    description: \"Source-grounded research agent. Propose-don't-apply.\",\n    prompt: { systemPrompt },\n    model: options.model ? { default: options.model } : undefined,\n    tools: { web_search: true, fs: true, shell: true },\n    metadata: { backendType: harness, role: '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 */\nexport interface MultiHarnessResearcherFanoutOptions {\n  /** Backend.type identifiers, one per parallel agent. */\n  harnesses?: string[]\n  /** Optional per-harness model override. Indexed parallel to `harnesses`. */\n  models?: (string | undefined)[]\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  const harnesses =\n    options.harnesses && options.harnesses.length > 0\n      ? options.harnesses\n      : ['opencode/zai-coding-plan/glm-5.1', 'claude-code', 'codex']\n  const models = options.models ?? []\n  const agentRuns = harnesses.map((harness, i) => {\n    const { agentRunSpec } = researcherProfile({ harness, model: models[i] })\n    return agentRunSpec\n  })\n  const { output, validator } = researcherProfile({\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: harnesses.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 */\nexport function 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\nconst DEFAULT_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\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return value !== null && typeof value === 'object' && !Array.isArray(value)\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"],"mappings":";AA2HA,MAAM,kBAAkB;AACxB,MAAM,+BAA+B;;AAGrC,SAAgB,kBACd,UAA8D,CAAC,GAO/D;CACA,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,OAAO,QAAQ,QAAQ,cAAc;CAC3C,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,MAAM,qBAAqB,QAAQ,sBAAsB;CACzD,MAAM,UAAwB;EAC5B;EACA,aAAa;EACb,QAAQ,EAAE,aAAa;EACvB,OAAO,QAAQ,QAAQ,EAAE,SAAS,QAAQ,MAAM,IAAI,KAAA;EACpD,OAAO;GAAE,YAAY;GAAM,IAAI;GAAM,OAAO;EAAK;EACjD,UAAU;GAAE,aAAa;GAAS,MAAM;EAAa;CACvD;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;;;;;;;;AAqBA,SAAgB,6BAA6B,UAA+C,CAAC,GAK3F;CACA,MAAM,YACJ,QAAQ,aAAa,QAAQ,UAAU,SAAS,IAC5C,QAAQ,YACR;EAAC;EAAoC;EAAe;CAAO;CACjE,MAAM,SAAS,QAAQ,UAAU,CAAC;CAClC,MAAM,YAAY,UAAU,KAAK,SAAS,MAAM;EAC9C,MAAM,EAAE,iBAAiB,kBAAkB;GAAE;GAAS,OAAO,OAAO;EAAG,CAAC;EACxE,OAAO;CACT,CAAC;CACD,MAAM,EAAE,QAAQ,cAAc,kBAAkB;EAC9C,oBAAoB,QAAQ;EAC5B,MAAM,QAAQ;CAChB,CAAC;CAkBD,OAAO;EAAE;EAAW;EAAQ;EAAW,QAAA;GAbrC,MAAM;GACN,MAAM,KAAK,MAAM,SAAS;IACxB,OAAO,QAAQ,WAAW,IAAI,MAAM,KAAK,EAAE,QAAQ,UAAU,OAAO,SAAS,IAAI,IAAI,CAAC;GACxF;GAGA,SAAS;IACP,OAAO;GACT;GACA,eAAe;IACb,OAAO,EAAE,MAAM,SAAS;GAC1B;EAE0C;CAAE;AAChD;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,0BACd,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;AAEA,MAAM,mCAAmC;CACvC;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;AAEA,SAAS,SAAS,OAAkD;CAClE,OAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC5E;;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"}