@tangle-network/agent-runtime 0.105.0 → 0.106.0

package/dist/analyst-loop-DGdtVENg.js

@@ -0,0 +1,517 @@
+import { n as AnalystError } from "./errors-DEAvWQPy.js";
+import { n as extractLlmCallEvent } from "./sandbox-events-DeI5xX8P.js";
+import { DEFAULT_TRACE_ANALYST_BUDGETS, TRACE_ANALYST_TRUNCATION_MARKER_PREFIX, diffFindings } from "@tangle-network/agent-eval";
+//#region src/analyst-loop/iterations-to-trace-store.ts
+/**
+*
+* The read seam that closes the autonomous loop: project a round's `Iteration[]`
+* (each carrying its raw `SandboxEvent[]`) into an in-memory `TraceAnalysisStore`, the
+* read interface the trace analysts query. `runAnalystLoop` has had zero consumers
+* because nothing turned a loop's iterations into a store — this is that bridge.
+*
+* One iteration → one trace. The iteration is the root AGENT span; each `SandboxEvent`
+* becomes a child span (LLM for llm_call events, TOOL for tool events, else SPAN), so an
+* analyst can walk a shot's trace, cluster its errors, and emit findings the driver
+* steers on. Projection is best-effort over the FLAT SandboxEvent shape (no per-event
+* lineage yet — that's the richer-trace gap); it never fabricates — an errored iteration
+* surfaces a real ERROR span carrying the real message.
+*
+* @experimental
+*/
+const bytesOf = (v) => Buffer.byteLength(JSON.stringify(v) ?? "", "utf8");
+const iso = (ms) => new Date(ms).toISOString();
+/** Normalize volatile tokens out of a status message so semantically identical failures
+*  collapse to one signature (digits, hex/uuids, paths, durations → placeholders). */
+function normalizeSignature(message) {
+	return message.replace(/0x[0-9a-fA-F]+/g, "HEX").replace(/[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}/g, "UUID").replace(/(\/[\w.-]+){2,}/g, "PATH").replace(/\b\d+(\.\d+)?(ms|s|m|h)\b/g, "DUR").replace(/\b\d+\b/g, "#").replace(/\s+/g, " ").trim().slice(0, 200);
+}
+function spanKindFor(event, agentRunName) {
+	const llm = extractLlmCallEvent(event, agentRunName);
+	if (llm) return {
+		kind: "LLM",
+		model: llm.model ?? null,
+		tool: null
+	};
+	const type = String(event?.type ?? "");
+	if (/tool/i.test(type)) {
+		const d = event?.data;
+		return {
+			kind: "TOOL",
+			model: null,
+			tool: typeof d?.name === "string" ? d.name : typeof d?.tool === "string" ? d.tool : type
+		};
+	}
+	return {
+		kind: "SPAN",
+		model: null,
+		tool: null
+	};
+}
+function errorMessageOf(event) {
+	const type = String(event?.type ?? "");
+	const d = event?.data;
+	if (/error|fail/i.test(type) || d?.error) {
+		const m = d?.error ?? d?.message;
+		return typeof m === "string" ? m : `${type} error`;
+	}
+}
+/** Project one iteration → one trace: root AGENT span + a child span per event. */
+function projectIteration(iter) {
+	const traceId = (iter.events.find((e) => (e?.data)?.sandboxId)?.data)?.sandboxId ?? `iter-${iter.index}`;
+	const start = iso(iter.startedAt);
+	const end = iso(iter.endedAt || iter.startedAt);
+	const durationMs = Math.max(0, (iter.endedAt || iter.startedAt) - iter.startedAt);
+	const rootId = `${traceId}:root`;
+	const iterErrored = Boolean(iter.error) || iter.verdict?.valid === false;
+	const spans = [{
+		trace_id: traceId,
+		span_id: rootId,
+		parent_span_id: null,
+		name: iter.agentRunName,
+		kind: "AGENT",
+		start_time: start,
+		end_time: end,
+		duration_ms: durationMs,
+		status: iter.error ? "ERROR" : "OK",
+		status_message: iter.error?.message,
+		service_name: "agent-runtime",
+		agent_name: iter.agentRunName,
+		model_name: null,
+		tool_name: null,
+		attributes: {
+			"iteration.index": iter.index,
+			"verdict.valid": iter.verdict?.valid,
+			"verdict.score": iter.verdict?.score,
+			"output.preview": iter.output === void 0 ? void 0 : String(iter.output).slice(0, 2e3)
+		}
+	}];
+	const models = /* @__PURE__ */ new Set();
+	const tools = /* @__PURE__ */ new Set();
+	iter.events.forEach((event, i) => {
+		const { kind, model, tool } = spanKindFor(event, iter.agentRunName);
+		if (model) models.add(model);
+		if (tool) tools.add(tool);
+		const errMsg = errorMessageOf(event);
+		spans.push({
+			trace_id: traceId,
+			span_id: `${traceId}:e${i}`,
+			parent_span_id: rootId,
+			name: String(event?.type ?? "event"),
+			kind,
+			start_time: start,
+			end_time: end,
+			duration_ms: 0,
+			status: errMsg ? "ERROR" : "OK",
+			status_message: errMsg,
+			service_name: "agent-runtime",
+			agent_name: iter.agentRunName,
+			model_name: model,
+			tool_name: tool,
+			attributes: event?.data ?? {}
+		});
+	});
+	const hasErrors = spans.some((s) => s.status === "ERROR") || iterErrored;
+	const summary = {
+		trace_id: traceId,
+		service_name: "agent-runtime",
+		agent_name: iter.agentRunName,
+		span_count: spans.length,
+		has_errors: hasErrors,
+		start_time: start,
+		end_time: end,
+		duration_ms: durationMs,
+		raw_jsonl_bytes: bytesOf(spans),
+		models: [...models],
+		tools: [...tools]
+	};
+	return {
+		summary,
+		spans,
+		rawBytes: summary.raw_jsonl_bytes
+	};
+}
+function matchesFilters(t, f) {
+	if (!f) return true;
+	if (f.has_errors !== void 0 && t.summary.has_errors !== f.has_errors) return false;
+	if (f.service_names?.length && !f.service_names.includes(t.summary.service_name ?? "")) return false;
+	if (f.agent_names?.length && !f.agent_names.includes(t.summary.agent_name ?? "")) return false;
+	if (f.model_names?.length && !f.model_names.some((m) => t.summary.models.includes(m))) return false;
+	if (f.tool_names?.length && !f.tool_names.some((tn) => t.summary.tools.includes(tn))) return false;
+	if (f.start_time_after && t.summary.start_time < f.start_time_after) return false;
+	if (f.start_time_before && t.summary.start_time > f.start_time_before) return false;
+	if (f.regex_pattern && !new RegExp(f.regex_pattern).test(JSON.stringify(t.spans))) return false;
+	return true;
+}
+function capAttributes(attributes, perAttrCap) {
+	let truncated = 0;
+	const capped = {};
+	for (const [k, v] of Object.entries(attributes)) {
+		const s = typeof v === "string" ? v : JSON.stringify(v);
+		if (typeof s === "string" && s.length > perAttrCap) {
+			truncated += 1;
+			capped[k] = `${TRACE_ANALYST_TRUNCATION_MARKER_PREFIX} ${s.length}b]${s.slice(0, perAttrCap)}`;
+		} else capped[k] = v;
+	}
+	return {
+		capped,
+		truncated
+	};
+}
+/**
+* Build an in-memory `TraceAnalysisStore` over a loop round's iterations. Fail-loud on an
+* empty round — there is nothing for an analyst to read, and a silent empty store would
+* mask a broken capture path.
+*/
+function iterationsToTraceStore(iterations, budgets = DEFAULT_TRACE_ANALYST_BUDGETS) {
+	if (iterations.length === 0) throw new AnalystError("iterationsToTraceStore: no iterations to analyze (empty round)");
+	const traces = iterations.map((it) => projectIteration(it));
+	const byId = new Map(traces.map((t) => [t.summary.trace_id, t]));
+	const buildClusters = (set) => {
+		const map = /* @__PURE__ */ new Map();
+		for (const t of set) for (const s of t.spans) {
+			if (s.status !== "ERROR" || !s.status_message) continue;
+			const sig = normalizeSignature(s.status_message);
+			const c = map.get(sig) ?? {
+				signature: sig,
+				status_message_sample: s.status_message,
+				span_name: s.name,
+				tool_name: s.tool_name,
+				trace_count: 0,
+				span_count: 0,
+				prevalence: 0,
+				exemplar_trace_ids: [],
+				exemplar_span_ids: []
+			};
+			c.span_count += 1;
+			if (!c.exemplar_trace_ids.includes(t.summary.trace_id) && c.exemplar_trace_ids.length < 10) {
+				c.exemplar_trace_ids.push(t.summary.trace_id);
+				c.trace_count += 1;
+			}
+			if (c.exemplar_span_ids.length < 10) c.exemplar_span_ids.push(s.span_id);
+			map.set(sig, c);
+		}
+		const errorTraces = set.filter((t) => t.summary.has_errors).length || 1;
+		return [...map.values()].map((c) => ({
+			...c,
+			prevalence: c.trace_count / errorTraces
+		})).sort((a, b) => b.trace_count - a.trace_count);
+	};
+	return {
+		async getOverview(filters) {
+			const set = traces.filter((t) => matchesFilters(t, filters));
+			const services = /* @__PURE__ */ new Set();
+			const agents = /* @__PURE__ */ new Set();
+			const models = /* @__PURE__ */ new Set();
+			const tools = /* @__PURE__ */ new Set();
+			let errorSpans = 0;
+			for (const t of set) {
+				if (t.summary.service_name) services.add(t.summary.service_name);
+				if (t.summary.agent_name) agents.add(t.summary.agent_name);
+				for (const m of t.summary.models) models.add(m);
+				for (const tn of t.summary.tools) tools.add(tn);
+				errorSpans += t.spans.filter((s) => s.status === "ERROR").length;
+			}
+			const times = set.map((t) => t.summary.start_time).sort();
+			return {
+				total_traces: set.length,
+				raw_jsonl_bytes: set.reduce((n, t) => n + t.rawBytes, 0),
+				services: [...services],
+				agents: [...agents],
+				models: [...models],
+				tool_names: [...tools],
+				sample_trace_ids: set.slice(0, 20).map((t) => t.summary.trace_id),
+				errors: {
+					trace_count: set.filter((t) => t.summary.has_errors).length,
+					span_count: errorSpans
+				},
+				error_clusters: buildClusters(set),
+				time_range: times.length ? {
+					earliest: times[0],
+					latest: times[times.length - 1]
+				} : null
+			};
+		},
+		async queryTraces(opts) {
+			const set = traces.filter((t) => matchesFilters(t, opts.filters));
+			const offset = opts.offset ?? 0;
+			return {
+				traces: set.slice(offset, offset + opts.limit).map((t) => t.summary),
+				total: set.length,
+				has_more: offset + opts.limit < set.length
+			};
+		},
+		async countTraces(filters) {
+			return traces.filter((t) => matchesFilters(t, filters)).length;
+		},
+		async viewTrace(opts) {
+			const t = byId.get(opts.trace_id);
+			if (!t) return {
+				trace_id: opts.trace_id,
+				spans: []
+			};
+			const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeViewBudget;
+			const projected = t.spans.map((s) => ({
+				...s,
+				attributes: capAttributes(s.attributes, cap).capped
+			}));
+			if (bytesOf(projected) > budgets.perCallByteCeiling) {
+				const names = /* @__PURE__ */ new Map();
+				for (const s of t.spans) names.set(s.name, (names.get(s.name) ?? 0) + 1);
+				return {
+					trace_id: opts.trace_id,
+					oversized: {
+						span_count: t.spans.length,
+						top_span_names: [...names.entries()].sort((a, b) => b[1] - a[1]).slice(0, 20),
+						span_response_bytes_max: Math.max(...t.spans.map((s) => bytesOf(s))),
+						error_span_count: t.spans.filter((s) => s.status === "ERROR").length
+					}
+				};
+			}
+			return {
+				trace_id: opts.trace_id,
+				spans: projected
+			};
+		},
+		async viewSpans(opts) {
+			const t = byId.get(opts.trace_id);
+			const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeSpanBudget;
+			const want = new Set(opts.span_ids);
+			const found = (t?.spans ?? []).filter((s) => want.has(s.span_id));
+			let truncated = 0;
+			const spans = found.map((s) => {
+				const { capped, truncated: n } = capAttributes(s.attributes, cap);
+				truncated += n;
+				return {
+					...s,
+					attributes: capped
+				};
+			});
+			const foundIds = new Set(found.map((s) => s.span_id));
+			return {
+				trace_id: opts.trace_id,
+				spans,
+				missing_span_ids: opts.span_ids.filter((id) => !foundIds.has(id)),
+				truncated_attribute_count: truncated
+			};
+		},
+		async searchTrace(opts) {
+			const t = byId.get(opts.trace_id);
+			const max = opts.max_matches ?? 50;
+			const hits = [];
+			for (const s of t?.spans ?? []) for (const hit of searchSpanAttrs(s, opts.regex_pattern, budgets.perMatchTextBudget)) {
+				if (hits.length >= max) break;
+				hits.push(hit);
+			}
+			return {
+				trace_id: opts.trace_id,
+				hits,
+				total_matches: hits.length,
+				has_more: hits.length >= max
+			};
+		},
+		async searchSpan(opts) {
+			const t = byId.get(opts.trace_id);
+			const max = opts.max_matches ?? 50;
+			const span = (t?.spans ?? []).find((s) => s.span_id === opts.span_id);
+			const hits = span ? searchSpanAttrs(span, opts.regex_pattern, budgets.perMatchTextBudget).slice(0, max) : [];
+			return {
+				trace_id: opts.trace_id,
+				span_id: opts.span_id,
+				hits,
+				total_matches: hits.length,
+				has_more: false
+			};
+		}
+	};
+}
+function searchSpanAttrs(span, pattern, textCap) {
+	const re = new RegExp(pattern, "g");
+	const hits = [];
+	for (const [k, v] of Object.entries(span.attributes)) {
+		const text = typeof v === "string" ? v : JSON.stringify(v);
+		if (typeof text !== "string") continue;
+		re.lastIndex = 0;
+		const m = re.exec(text);
+		if (!m) continue;
+		const at = m.index;
+		hits.push({
+			trace_id: span.trace_id,
+			span_id: span.span_id,
+			span_name: span.name,
+			span_kind: span.kind,
+			attribute_path: `attributes.${k}`,
+			matched_text: m[0].slice(0, textCap),
+			context_before: text.slice(Math.max(0, at - textCap / 2), at),
+			context_after: text.slice(at + m[0].length, at + m[0].length + textCap / 2),
+			match_offset: at
+		});
+	}
+	return hits;
+}
+//#endregion
+//#region src/analyst-loop/run-analyst-loop.ts
+/** Analyze a run and apply accepted knowledge and agent-surface proposals. */
+async function runAnalystLoop(opts) {
+	const log = opts.log ?? defaultLog;
+	const strategy = opts.priorFindingsStrategy ?? "per-kind";
+	const emit = makeEmitter(opts.onEvent);
+	const startedAt = Date.now();
+	const baselineRunId = resolveBaselineRunId(opts);
+	const priorAll = baselineRunId ? opts.findingsStore?.loadRun(baselineRunId) ?? [] : [];
+	log("baseline resolved", {
+		baselineRunId,
+		prior_findings: priorAll.length
+	});
+	await emit({
+		type: "baseline-resolved",
+		runId: opts.runId,
+		baselineRunId,
+		priorFindingCount: priorAll.length
+	});
+	const analystResult = await runRegistry(opts, buildPriorFindingsInput(priorAll, strategy, opts.registry.list()), emit);
+	log("analyst run complete", {
+		findings: analystResult.findings.length,
+		cost_usd: analystResult.total_cost_usd,
+		per_analyst: analystResult.per_analyst.map((s) => ({
+			id: s.analyst_id,
+			status: s.status,
+			n: s.findings_count
+		}))
+	});
+	if (opts.findingsStore && analystResult.findings.length > 0) {
+		await opts.findingsStore.append(opts.runId, analystResult.findings);
+		await emit({
+			type: "findings-persisted",
+			runId: opts.runId,
+			count: analystResult.findings.length
+		});
+	}
+	let diff = null;
+	if (baselineRunId && analystResult.findings.length > 0) {
+		diff = diffFindings(priorAll.map((f) => ({ ...f })), analystResult.findings.map((f) => ({
+			...f,
+			run_id: opts.runId
+		})));
+		log("diff vs baseline", {
+			appeared: diff.appeared.length,
+			disappeared: diff.disappeared.length,
+			persisted: diff.persisted.length,
+			changed: diff.changed.length
+		});
+		await emit({
+			type: "diff-computed",
+			runId: opts.runId,
+			baselineRunId,
+			appeared: diff.appeared.length,
+			disappeared: diff.disappeared.length,
+			persisted: diff.persisted.length,
+			changed: diff.changed.length
+		});
+	}
+	let knowledge = null;
+	if (opts.knowledgeProposalSource) knowledge = await runKnowledgeProposalSource(opts, analystResult.findings, log, emit);
+	let improvement = null;
+	if (opts.improvementProposalSource) improvement = await runImprovementProposalSource(opts, analystResult.findings, log, emit);
+	await emit({
+		type: "loop-completed",
+		runId: opts.runId,
+		durationMs: Date.now() - startedAt
+	});
+	return {
+		runId: opts.runId,
+		baselineRunId,
+		analystResult,
+		diff,
+		knowledge,
+		improvement
+	};
+}
+function makeEmitter(onEvent) {
+	if (!onEvent) return async () => {};
+	return async (event) => {
+		await onEvent(event);
+	};
+}
+async function runRegistry(opts, priorFindings, emit) {
+	const reg = opts.registry;
+	if (typeof reg.runStream === "function" && opts.onEvent) {
+		let final = null;
+		for await (const ev of reg.runStream(opts.runId, opts.inputs, { priorFindings })) {
+			await emit({
+				type: "analyst",
+				runId: opts.runId,
+				event: ev
+			});
+			if (ev.type === "run-completed") final = ev.result;
+		}
+		if (!final) throw new Error("runAnalystLoop: registry.runStream ended without run-completed event");
+		return final;
+	}
+	return opts.registry.run(opts.runId, opts.inputs, { priorFindings });
+}
+function resolveBaselineRunId(opts) {
+	if (opts.baselineRunId === null) return null;
+	if (typeof opts.baselineRunId === "string") return opts.baselineRunId;
+	if (!opts.findingsStore) return null;
+	const all = opts.findingsStore.loadAll();
+	let last = null;
+	for (const row of all) {
+		if (row.run_id === opts.runId) continue;
+		last = row.run_id;
+	}
+	return last;
+}
+function buildPriorFindingsInput(prior, strategy, registry) {
+	if (strategy === "none" || prior.length === 0) return void 0;
+	const stripped = prior.map(({ run_id: _run_id, ...rest }) => rest);
+	if (strategy === "wildcard") return { "*": stripped };
+	return stripped;
+}
+async function runKnowledgeProposalSource(opts, findings, log, emit) {
+	const batch = await opts.knowledgeProposalSource.proposeFromFindings(findings);
+	log("knowledge.proposeFromFindings", {
+		proposals: batch.proposals.length,
+		skipped: batch.skipped,
+		errors: batch.errors.length
+	});
+	await emit({
+		type: "knowledge-proposed",
+		runId: opts.runId,
+		proposalCount: batch.proposals.length,
+		skipped: batch.skipped,
+		errors: batch.errors.length
+	});
+	return {
+		proposals: batch.proposals,
+		skipped: batch.skipped,
+		errors: batch.errors
+	};
+}
+async function runImprovementProposalSource(opts, findings, log, emit) {
+	const batch = await opts.improvementProposalSource.proposeFromFindings(findings);
+	log("improvement.proposeFromFindings", {
+		edits: batch.edits.length,
+		skipped: batch.skipped,
+		errors: batch.errors.length
+	});
+	await emit({
+		type: "improvement-proposed",
+		runId: opts.runId,
+		editCount: batch.edits.length,
+		skipped: batch.skipped,
+		errors: batch.errors.length
+	});
+	return {
+		edits: batch.edits,
+		skipped: batch.skipped,
+		errors: batch.errors
+	};
+}
+function defaultLog(msg, fields) {
+	if (fields) console.log(`[analyst-loop] ${msg}`, fields);
+	else console.log(`[analyst-loop] ${msg}`);
+}
+//#endregion
+export { iterationsToTraceStore as n, runAnalystLoop as t };
+
+//# sourceMappingURL=analyst-loop-DGdtVENg.js.map

package/dist/analyst-loop-DGdtVENg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyst-loop-DGdtVENg.js","names":[],"sources":["../src/analyst-loop/iterations-to-trace-store.ts","../src/analyst-loop/run-analyst-loop.ts"],"sourcesContent":["/**\n *\n * The read seam that closes the autonomous loop: project a round's `Iteration[]`\n * (each carrying its raw `SandboxEvent[]`) into an in-memory `TraceAnalysisStore`, the\n * read interface the trace analysts query. `runAnalystLoop` has had zero consumers\n * because nothing turned a loop's iterations into a store — this is that bridge.\n *\n * One iteration → one trace. The iteration is the root AGENT span; each `SandboxEvent`\n * becomes a child span (LLM for llm_call events, TOOL for tool events, else SPAN), so an\n * analyst can walk a shot's trace, cluster its errors, and emit findings the driver\n * steers on. Projection is best-effort over the FLAT SandboxEvent shape (no per-event\n * lineage yet — that's the richer-trace gap); it never fabricates — an errored iteration\n * surfaces a real ERROR span carrying the real message.\n *\n * @experimental\n */\n\nimport {\n  type DatasetOverview,\n  DEFAULT_TRACE_ANALYST_BUDGETS,\n  type QueryTracesPage,\n  type SearchSpanResult,\n  type SearchTraceResult,\n  type SpanMatchRecord,\n  TRACE_ANALYST_TRUNCATION_MARKER_PREFIX,\n  type TraceAnalysisStore,\n  type TraceAnalystByteBudgets,\n  type TraceAnalystFilters,\n  type TraceAnalystSpan,\n  type TraceAnalystSpanKind,\n  type TraceAnalystTraceSummary,\n  type ViewSpansResult,\n  type ViewTraceResult,\n} from '@tangle-network/agent-eval'\nimport type { SandboxEvent } from '@tangle-network/sandbox'\nimport { AnalystError } from '../errors'\nimport { extractLlmCallEvent } from '../runtime/sandbox-events'\nimport type { Iteration } from '../runtime/types'\n\n/** ErrorCluster isn't re-exported from the agent-eval root; derive it from the overview. */\ntype ErrorCluster = DatasetOverview['error_clusters'][number]\n\ninterface ProjectedTrace {\n  summary: TraceAnalystTraceSummary\n  spans: TraceAnalystSpan[]\n  /** raw JSONL bytes of this trace's spans — the byte-budget accounting unit. */\n  rawBytes: number\n}\n\nconst bytesOf = (v: unknown): number => Buffer.byteLength(JSON.stringify(v) ?? '', 'utf8')\nconst iso = (ms: number): string => new Date(ms).toISOString()\n\n/** Normalize volatile tokens out of a status message so semantically identical failures\n *  collapse to one signature (digits, hex/uuids, paths, durations → placeholders). */\nfunction normalizeSignature(message: string): string {\n  return message\n    .replace(/0x[0-9a-fA-F]+/g, 'HEX')\n    .replace(/[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}/g, 'UUID')\n    .replace(/(\\/[\\w.-]+){2,}/g, 'PATH')\n    .replace(/\\b\\d+(\\.\\d+)?(ms|s|m|h)\\b/g, 'DUR')\n    .replace(/\\b\\d+\\b/g, '#')\n    .replace(/\\s+/g, ' ')\n    .trim()\n    .slice(0, 200)\n}\n\nfunction spanKindFor(\n  event: SandboxEvent,\n  agentRunName: string,\n): {\n  kind: TraceAnalystSpanKind\n  model: string | null\n  tool: string | null\n} {\n  const llm = extractLlmCallEvent(event, agentRunName)\n  if (llm) return { kind: 'LLM', model: llm.model ?? null, tool: null }\n  const type = String(event?.type ?? '')\n  if (/tool/i.test(type)) {\n    const d = event?.data as { name?: unknown; tool?: unknown } | undefined\n    const tool = typeof d?.name === 'string' ? d.name : typeof d?.tool === 'string' ? d.tool : type\n    return { kind: 'TOOL', model: null, tool }\n  }\n  return { kind: 'SPAN', model: null, tool: null }\n}\n\nfunction errorMessageOf(event: SandboxEvent): string | undefined {\n  const type = String(event?.type ?? '')\n  const d = event?.data as { error?: unknown; message?: unknown } | undefined\n  if (/error|fail/i.test(type) || d?.error) {\n    const m = d?.error ?? d?.message\n    return typeof m === 'string' ? m : `${type} error`\n  }\n  return undefined\n}\n\n/** Project one iteration → one trace: root AGENT span + a child span per event. */\nfunction projectIteration<Task, Output>(iter: Iteration<Task, Output>): ProjectedTrace {\n  const traceId =\n    (\n      iter.events.find((e) => (e?.data as { sandboxId?: string } | undefined)?.sandboxId)?.data as\n        | { sandboxId?: string }\n        | undefined\n    )?.sandboxId ?? `iter-${iter.index}`\n  const start = iso(iter.startedAt)\n  const end = iso(iter.endedAt || iter.startedAt)\n  const durationMs = Math.max(0, (iter.endedAt || iter.startedAt) - iter.startedAt)\n  const rootId = `${traceId}:root`\n  const iterErrored = Boolean(iter.error) || iter.verdict?.valid === false\n  const spans: TraceAnalystSpan[] = [\n    {\n      trace_id: traceId,\n      span_id: rootId,\n      parent_span_id: null,\n      name: iter.agentRunName,\n      kind: 'AGENT',\n      start_time: start,\n      end_time: end,\n      duration_ms: durationMs,\n      status: iter.error ? 'ERROR' : 'OK',\n      status_message: iter.error?.message,\n      service_name: 'agent-runtime',\n      agent_name: iter.agentRunName,\n      model_name: null,\n      tool_name: null,\n      attributes: {\n        'iteration.index': iter.index,\n        'verdict.valid': iter.verdict?.valid,\n        'verdict.score': iter.verdict?.score,\n        'output.preview':\n          iter.output === undefined ? undefined : String(iter.output).slice(0, 2000),\n      },\n    },\n  ]\n  const models = new Set<string>()\n  const tools = new Set<string>()\n  iter.events.forEach((event, i) => {\n    const { kind, model, tool } = spanKindFor(event, iter.agentRunName)\n    if (model) models.add(model)\n    if (tool) tools.add(tool)\n    const errMsg = errorMessageOf(event)\n    spans.push({\n      trace_id: traceId,\n      span_id: `${traceId}:e${i}`,\n      parent_span_id: rootId,\n      name: String(event?.type ?? 'event'),\n      kind,\n      start_time: start,\n      end_time: end,\n      duration_ms: 0,\n      status: errMsg ? 'ERROR' : 'OK',\n      status_message: errMsg,\n      service_name: 'agent-runtime',\n      agent_name: iter.agentRunName,\n      model_name: model,\n      tool_name: tool,\n      attributes: (event?.data as Record<string, unknown> | undefined) ?? {},\n    })\n  })\n  const hasErrors = spans.some((s) => s.status === 'ERROR') || iterErrored\n  const summary: TraceAnalystTraceSummary = {\n    trace_id: traceId,\n    service_name: 'agent-runtime',\n    agent_name: iter.agentRunName,\n    span_count: spans.length,\n    has_errors: hasErrors,\n    start_time: start,\n    end_time: end,\n    duration_ms: durationMs,\n    raw_jsonl_bytes: bytesOf(spans),\n    models: [...models],\n    tools: [...tools],\n  }\n  return { summary, spans, rawBytes: summary.raw_jsonl_bytes }\n}\n\nfunction matchesFilters(t: ProjectedTrace, f?: TraceAnalystFilters): boolean {\n  if (!f) return true\n  if (f.has_errors !== undefined && t.summary.has_errors !== f.has_errors) return false\n  if (f.service_names?.length && !f.service_names.includes(t.summary.service_name ?? ''))\n    return false\n  if (f.agent_names?.length && !f.agent_names.includes(t.summary.agent_name ?? '')) return false\n  if (f.model_names?.length && !f.model_names.some((m) => t.summary.models.includes(m)))\n    return false\n  if (f.tool_names?.length && !f.tool_names.some((tn) => t.summary.tools.includes(tn))) return false\n  if (f.start_time_after && t.summary.start_time < f.start_time_after) return false\n  if (f.start_time_before && t.summary.start_time > f.start_time_before) return false\n  if (f.regex_pattern && !new RegExp(f.regex_pattern).test(JSON.stringify(t.spans))) return false\n  return true\n}\n\nfunction capAttributes(\n  attributes: Record<string, unknown>,\n  perAttrCap: number,\n): { capped: Record<string, unknown>; truncated: number } {\n  let truncated = 0\n  const capped: Record<string, unknown> = {}\n  for (const [k, v] of Object.entries(attributes)) {\n    const s = typeof v === 'string' ? v : JSON.stringify(v)\n    if (typeof s === 'string' && s.length > perAttrCap) {\n      truncated += 1\n      capped[k] = `${TRACE_ANALYST_TRUNCATION_MARKER_PREFIX} ${s.length}b]${s.slice(0, perAttrCap)}`\n    } else {\n      capped[k] = v\n    }\n  }\n  return { capped, truncated }\n}\n\n/**\n * Build an in-memory `TraceAnalysisStore` over a loop round's iterations. Fail-loud on an\n * empty round — there is nothing for an analyst to read, and a silent empty store would\n * mask a broken capture path.\n */\nexport function iterationsToTraceStore<Task, Output>(\n  iterations: ReadonlyArray<Iteration<Task, Output>>,\n  budgets: TraceAnalystByteBudgets = DEFAULT_TRACE_ANALYST_BUDGETS,\n): TraceAnalysisStore {\n  if (iterations.length === 0) {\n    throw new AnalystError('iterationsToTraceStore: no iterations to analyze (empty round)')\n  }\n  const traces = iterations.map((it) => projectIteration(it))\n  const byId = new Map(traces.map((t) => [t.summary.trace_id, t]))\n\n  const buildClusters = (set: ProjectedTrace[]): ErrorCluster[] => {\n    const map = new Map<string, ErrorCluster>()\n    for (const t of set) {\n      for (const s of t.spans) {\n        if (s.status !== 'ERROR' || !s.status_message) continue\n        const sig = normalizeSignature(s.status_message)\n        const c = map.get(sig) ?? {\n          signature: sig,\n          status_message_sample: s.status_message,\n          span_name: s.name,\n          tool_name: s.tool_name,\n          trace_count: 0,\n          span_count: 0,\n          prevalence: 0,\n          exemplar_trace_ids: [],\n          exemplar_span_ids: [],\n        }\n        c.span_count += 1\n        if (\n          !c.exemplar_trace_ids.includes(t.summary.trace_id) &&\n          c.exemplar_trace_ids.length < 10\n        ) {\n          c.exemplar_trace_ids.push(t.summary.trace_id)\n          c.trace_count += 1\n        }\n        if (c.exemplar_span_ids.length < 10) c.exemplar_span_ids.push(s.span_id)\n        map.set(sig, c)\n      }\n    }\n    const errorTraces = set.filter((t) => t.summary.has_errors).length || 1\n    const clusters = [...map.values()].map((c) => ({\n      ...c,\n      prevalence: c.trace_count / errorTraces,\n    }))\n    return clusters.sort((a, b) => b.trace_count - a.trace_count)\n  }\n\n  return {\n    async getOverview(filters?: TraceAnalystFilters): Promise<DatasetOverview> {\n      const set = traces.filter((t) => matchesFilters(t, filters))\n      const services = new Set<string>()\n      const agents = new Set<string>()\n      const models = new Set<string>()\n      const tools = new Set<string>()\n      let errorSpans = 0\n      for (const t of set) {\n        if (t.summary.service_name) services.add(t.summary.service_name)\n        if (t.summary.agent_name) agents.add(t.summary.agent_name)\n        for (const m of t.summary.models) models.add(m)\n        for (const tn of t.summary.tools) tools.add(tn)\n        errorSpans += t.spans.filter((s) => s.status === 'ERROR').length\n      }\n      const times = set.map((t) => t.summary.start_time).sort()\n      return {\n        total_traces: set.length,\n        raw_jsonl_bytes: set.reduce((n, t) => n + t.rawBytes, 0),\n        services: [...services],\n        agents: [...agents],\n        models: [...models],\n        tool_names: [...tools],\n        sample_trace_ids: set.slice(0, 20).map((t) => t.summary.trace_id),\n        errors: {\n          trace_count: set.filter((t) => t.summary.has_errors).length,\n          span_count: errorSpans,\n        },\n        error_clusters: buildClusters(set),\n        time_range: times.length ? { earliest: times[0]!, latest: times[times.length - 1]! } : null,\n      }\n    },\n\n    async queryTraces(opts): Promise<QueryTracesPage> {\n      const set = traces.filter((t) => matchesFilters(t, opts.filters))\n      const offset = opts.offset ?? 0\n      const page = set.slice(offset, offset + opts.limit)\n      return {\n        traces: page.map((t) => t.summary),\n        total: set.length,\n        has_more: offset + opts.limit < set.length,\n      }\n    },\n\n    async countTraces(filters?: TraceAnalystFilters): Promise<number> {\n      return traces.filter((t) => matchesFilters(t, filters)).length\n    },\n\n    async viewTrace(opts): Promise<ViewTraceResult> {\n      const t = byId.get(opts.trace_id)\n      if (!t) return { trace_id: opts.trace_id, spans: [] }\n      const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeViewBudget\n      const projected = t.spans.map((s) => ({\n        ...s,\n        attributes: capAttributes(s.attributes, cap).capped,\n      }))\n      if (bytesOf(projected) > budgets.perCallByteCeiling) {\n        const names = new Map<string, number>()\n        for (const s of t.spans) names.set(s.name, (names.get(s.name) ?? 0) + 1)\n        return {\n          trace_id: opts.trace_id,\n          oversized: {\n            span_count: t.spans.length,\n            top_span_names: [...names.entries()].sort((a, b) => b[1] - a[1]).slice(0, 20),\n            span_response_bytes_max: Math.max(...t.spans.map((s) => bytesOf(s))),\n            error_span_count: t.spans.filter((s) => s.status === 'ERROR').length,\n          },\n        }\n      }\n      return { trace_id: opts.trace_id, spans: projected }\n    },\n\n    async viewSpans(opts): Promise<ViewSpansResult> {\n      const t = byId.get(opts.trace_id)\n      const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeSpanBudget\n      const want = new Set(opts.span_ids)\n      const found = (t?.spans ?? []).filter((s) => want.has(s.span_id))\n      let truncated = 0\n      const spans = found.map((s) => {\n        const { capped, truncated: n } = capAttributes(s.attributes, cap)\n        truncated += n\n        return { ...s, attributes: capped }\n      })\n      const foundIds = new Set(found.map((s) => s.span_id))\n      return {\n        trace_id: opts.trace_id,\n        spans,\n        missing_span_ids: opts.span_ids.filter((id) => !foundIds.has(id)),\n        truncated_attribute_count: truncated,\n      }\n    },\n\n    async searchTrace(opts): Promise<SearchTraceResult> {\n      const t = byId.get(opts.trace_id)\n      const max = opts.max_matches ?? 50\n      const hits: SpanMatchRecord[] = []\n      for (const s of t?.spans ?? []) {\n        for (const hit of searchSpanAttrs(s, opts.regex_pattern, budgets.perMatchTextBudget)) {\n          if (hits.length >= max) break\n          hits.push(hit)\n        }\n      }\n      return {\n        trace_id: opts.trace_id,\n        hits,\n        total_matches: hits.length,\n        has_more: hits.length >= max,\n      }\n    },\n\n    async searchSpan(opts): Promise<SearchSpanResult> {\n      const t = byId.get(opts.trace_id)\n      const max = opts.max_matches ?? 50\n      const span = (t?.spans ?? []).find((s) => s.span_id === opts.span_id)\n      const hits = span\n        ? searchSpanAttrs(span, opts.regex_pattern, budgets.perMatchTextBudget).slice(0, max)\n        : []\n      return {\n        trace_id: opts.trace_id,\n        span_id: opts.span_id,\n        hits,\n        total_matches: hits.length,\n        has_more: false,\n      }\n    },\n  }\n}\n\nfunction searchSpanAttrs(\n  span: TraceAnalystSpan,\n  pattern: string,\n  textCap: number,\n): SpanMatchRecord[] {\n  const re = new RegExp(pattern, 'g')\n  const hits: SpanMatchRecord[] = []\n  for (const [k, v] of Object.entries(span.attributes)) {\n    const text = typeof v === 'string' ? v : JSON.stringify(v)\n    if (typeof text !== 'string') continue\n    re.lastIndex = 0\n    const m = re.exec(text)\n    if (!m) continue\n    const at = m.index\n    hits.push({\n      trace_id: span.trace_id,\n      span_id: span.span_id,\n      span_name: span.name,\n      span_kind: span.kind,\n      attribute_path: `attributes.${k}`,\n      matched_text: m[0].slice(0, textCap),\n      context_before: text.slice(Math.max(0, at - textCap / 2), at),\n      context_after: text.slice(at + m[0].length, at + m[0].length + textCap / 2),\n      match_offset: at,\n    })\n  }\n  return hits\n}\n","/**\n * `runAnalystLoop` — the one call agent apps reach for to close the\n * recursive-self-improvement loop.\n *\n *   1. Load baseline findings (last run, or the slice the caller specifies)\n *   2. Run the analyst registry with priorFindings injected\n *   3. Persist the new run's findings to the ledger\n *   4. Diff the new run against the baseline\n *   5. Hand the findings to the knowledge proposal source\n *   6. Hand the findings to the agent-surface proposal source\n *   7. Return a single report the consumer renders / persists / acts on.\n *\n * Proposal sources are optional: the loop also works as a plain\n * \"run + diff + report\" primitive.\n */\n\nimport type { AnalystFinding, AnalystRunResult, FindingsDiff } from '@tangle-network/agent-eval'\nimport { diffFindings } from '@tangle-network/agent-eval'\n\nimport type {\n  AnalystLoopEvent,\n  AnalystRegistryStreamingLike,\n  ImprovementReport,\n  KnowledgeReport,\n  RunAnalystLoopOpts,\n  RunAnalystLoopResult,\n} from './types'\n\n/** Analyze a run and apply accepted knowledge and agent-surface proposals. */\nexport async function runAnalystLoop<TProposal = unknown, TEdit = unknown>(\n  opts: RunAnalystLoopOpts,\n): Promise<RunAnalystLoopResult<TProposal, TEdit>> {\n  const log = opts.log ?? defaultLog\n  const strategy = opts.priorFindingsStrategy ?? 'per-kind'\n  const emit = makeEmitter(opts.onEvent)\n  const startedAt = Date.now()\n\n  // 1. Resolve baseline + load prior findings.\n  const baselineRunId = resolveBaselineRunId(opts)\n  const priorAll: ReadonlyArray<AnalystFinding & { run_id: string }> = baselineRunId\n    ? (opts.findingsStore?.loadRun(baselineRunId) ?? [])\n    : []\n  log('baseline resolved', { baselineRunId, prior_findings: priorAll.length })\n  await emit({\n    type: 'baseline-resolved',\n    runId: opts.runId,\n    baselineRunId,\n    priorFindingCount: priorAll.length,\n  })\n\n  // 2. Run the registry. Strategy controls how analysts see priors.\n  //    When the registry exposes runStream, forward each event verbatim\n  //    so subscribers see per-analyst progress in real time.\n  const priorFindings = buildPriorFindingsInput(priorAll, strategy, opts.registry.list())\n  const analystResult = await runRegistry(opts, priorFindings, emit)\n  log('analyst run complete', {\n    findings: analystResult.findings.length,\n    cost_usd: analystResult.total_cost_usd,\n    per_analyst: analystResult.per_analyst.map((s) => ({\n      id: s.analyst_id,\n      status: s.status,\n      n: s.findings_count,\n    })),\n  })\n\n  // 3. Persist the new run before proposal generation so the ledger remains\n  //    the source of truth if a proposal source throws.\n  if (opts.findingsStore && analystResult.findings.length > 0) {\n    await opts.findingsStore.append(opts.runId, analystResult.findings)\n    await emit({\n      type: 'findings-persisted',\n      runId: opts.runId,\n      count: analystResult.findings.length,\n    })\n  }\n\n  // 4. Diff vs baseline.\n  let diff: FindingsDiff | null = null\n  if (baselineRunId && analystResult.findings.length > 0) {\n    diff = diffFindings(\n      priorAll.map((f) => ({ ...f })),\n      analystResult.findings.map((f) => ({ ...f, run_id: opts.runId })),\n    )\n    log('diff vs baseline', {\n      appeared: diff.appeared.length,\n      disappeared: diff.disappeared.length,\n      persisted: diff.persisted.length,\n      changed: diff.changed.length,\n    })\n    await emit({\n      type: 'diff-computed',\n      runId: opts.runId,\n      baselineRunId,\n      appeared: diff.appeared.length,\n      disappeared: diff.disappeared.length,\n      persisted: diff.persisted.length,\n      changed: diff.changed.length,\n    })\n  }\n\n  // 5. Knowledge proposals. This loop never writes live knowledge.\n  let knowledge: KnowledgeReport<TProposal> | null = null\n  if (opts.knowledgeProposalSource) {\n    knowledge = await runKnowledgeProposalSource(opts, analystResult.findings, log, emit)\n  }\n\n  // 6. Agent-surface proposals. This loop never writes live agent state.\n  let improvement: ImprovementReport<TEdit> | null = null\n  if (opts.improvementProposalSource) {\n    improvement = await runImprovementProposalSource(opts, analystResult.findings, log, emit)\n  }\n\n  await emit({\n    type: 'loop-completed',\n    runId: opts.runId,\n    durationMs: Date.now() - startedAt,\n  })\n\n  return {\n    runId: opts.runId,\n    baselineRunId,\n    analystResult,\n    diff,\n    knowledge,\n    improvement,\n  }\n}\n\ntype Emitter = (event: AnalystLoopEvent) => Promise<void>\n\nfunction makeEmitter(onEvent: RunAnalystLoopOpts['onEvent']): Emitter {\n  if (!onEvent) return async () => {}\n  return async (event) => {\n    await onEvent(event)\n  }\n}\n\nasync function runRegistry(\n  opts: RunAnalystLoopOpts,\n  priorFindings: ReturnType<typeof buildPriorFindingsInput>,\n  emit: Emitter,\n): Promise<AnalystRunResult> {\n  const reg = opts.registry as AnalystRegistryStreamingLike\n  if (typeof reg.runStream === 'function' && opts.onEvent) {\n    let final: AnalystRunResult | null = null\n    for await (const ev of reg.runStream(opts.runId, opts.inputs, { priorFindings })) {\n      await emit({ type: 'analyst', runId: opts.runId, event: ev })\n      if (ev.type === 'run-completed') final = ev.result\n    }\n    if (!final) {\n      throw new Error('runAnalystLoop: registry.runStream ended without run-completed event')\n    }\n    return final\n  }\n  return opts.registry.run(opts.runId, opts.inputs, { priorFindings })\n}\n\nfunction resolveBaselineRunId(opts: RunAnalystLoopOpts): string | null {\n  if (opts.baselineRunId === null) return null\n  if (typeof opts.baselineRunId === 'string') return opts.baselineRunId\n  if (!opts.findingsStore) return null\n  const all = opts.findingsStore.loadAll()\n  let last: string | null = null\n  for (const row of all) {\n    if (row.run_id === opts.runId) continue\n    last = row.run_id\n  }\n  return last\n}\n\nfunction buildPriorFindingsInput(\n  prior: ReadonlyArray<AnalystFinding & { run_id: string }>,\n  strategy: 'per-kind' | 'wildcard' | 'none',\n  registry: ReadonlyArray<{ id: string }>,\n): ReadonlyArray<AnalystFinding> | Record<string, ReadonlyArray<AnalystFinding>> | undefined {\n  if (strategy === 'none' || prior.length === 0) return undefined\n  const stripped = prior.map(({ run_id: _run_id, ...rest }) => rest as AnalystFinding)\n  if (strategy === 'wildcard') {\n    return { '*': stripped }\n  }\n  void registry\n  return stripped\n}\n\nasync function runKnowledgeProposalSource<TProposal>(\n  opts: RunAnalystLoopOpts,\n  findings: ReadonlyArray<AnalystFinding>,\n  log: NonNullable<RunAnalystLoopOpts['log']>,\n  emit: Emitter,\n): Promise<KnowledgeReport<TProposal>> {\n  const source = opts.knowledgeProposalSource!\n  const batch = await source.proposeFromFindings(findings)\n  log('knowledge.proposeFromFindings', {\n    proposals: batch.proposals.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n  await emit({\n    type: 'knowledge-proposed',\n    runId: opts.runId,\n    proposalCount: batch.proposals.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n\n  return {\n    proposals: batch.proposals as TProposal[],\n    skipped: batch.skipped,\n    errors: batch.errors,\n  }\n}\n\nasync function runImprovementProposalSource<TEdit>(\n  opts: RunAnalystLoopOpts,\n  findings: ReadonlyArray<AnalystFinding>,\n  log: NonNullable<RunAnalystLoopOpts['log']>,\n  emit: Emitter,\n): Promise<ImprovementReport<TEdit>> {\n  const source = opts.improvementProposalSource!\n  const batch = await source.proposeFromFindings(findings)\n  log('improvement.proposeFromFindings', {\n    edits: batch.edits.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n  await emit({\n    type: 'improvement-proposed',\n    runId: opts.runId,\n    editCount: batch.edits.length,\n    skipped: batch.skipped,\n    errors: batch.errors.length,\n  })\n\n  return {\n    edits: batch.edits as TEdit[],\n    skipped: batch.skipped,\n    errors: batch.errors,\n  }\n}\n\nfunction defaultLog(msg: string, fields?: Record<string, unknown>): void {\n  if (fields) console.log(`[analyst-loop] ${msg}`, fields)\n  else console.log(`[analyst-loop] ${msg}`)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAiDA,MAAM,WAAW,MAAuB,OAAO,WAAW,KAAK,UAAU,CAAC,KAAK,IAAI,MAAM;AACzF,MAAM,OAAO,OAAuB,IAAI,KAAK,EAAE,CAAC,CAAC,YAAY;;;AAI7D,SAAS,mBAAmB,SAAyB;CACnD,OAAO,QACJ,QAAQ,mBAAmB,KAAK,CAAC,CACjC,QAAQ,gFAAgF,MAAM,CAAC,CAC/F,QAAQ,oBAAoB,MAAM,CAAC,CACnC,QAAQ,8BAA8B,KAAK,CAAC,CAC5C,QAAQ,YAAY,GAAG,CAAC,CACxB,QAAQ,QAAQ,GAAG,CAAC,CACpB,KAAK,CAAC,CACN,MAAM,GAAG,GAAG;AACjB;AAEA,SAAS,YACP,OACA,cAKA;CACA,MAAM,MAAM,oBAAoB,OAAO,YAAY;CACnD,IAAI,KAAK,OAAO;EAAE,MAAM;EAAO,OAAO,IAAI,SAAS;EAAM,MAAM;CAAK;CACpE,MAAM,OAAO,OAAO,OAAO,QAAQ,EAAE;CACrC,IAAI,QAAQ,KAAK,IAAI,GAAG;EACtB,MAAM,IAAI,OAAO;EAEjB,OAAO;GAAE,MAAM;GAAQ,OAAO;GAAM,MADvB,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;EAClD;CAC3C;CACA,OAAO;EAAE,MAAM;EAAQ,OAAO;EAAM,MAAM;CAAK;AACjD;AAEA,SAAS,eAAe,OAAyC;CAC/D,MAAM,OAAO,OAAO,OAAO,QAAQ,EAAE;CACrC,MAAM,IAAI,OAAO;CACjB,IAAI,cAAc,KAAK,IAAI,KAAK,GAAG,OAAO;EACxC,MAAM,IAAI,GAAG,SAAS,GAAG;EACzB,OAAO,OAAO,MAAM,WAAW,IAAI,GAAG,KAAK;CAC7C;AAEF;;AAGA,SAAS,iBAA+B,MAA+C;CACrF,MAAM,WAEF,KAAK,OAAO,MAAM,OAAO,GAAG,KAAA,EAA6C,SAAS,CAAC,EAAE,KAAA,EAGpF,aAAa,QAAQ,KAAK;CAC/B,MAAM,QAAQ,IAAI,KAAK,SAAS;CAChC,MAAM,MAAM,IAAI,KAAK,WAAW,KAAK,SAAS;CAC9C,MAAM,aAAa,KAAK,IAAI,IAAI,KAAK,WAAW,KAAK,aAAa,KAAK,SAAS;CAChF,MAAM,SAAS,GAAG,QAAQ;CAC1B,MAAM,cAAc,QAAQ,KAAK,KAAK,KAAK,KAAK,SAAS,UAAU;CACnE,MAAM,QAA4B,CAChC;EACE,UAAU;EACV,SAAS;EACT,gBAAgB;EAChB,MAAM,KAAK;EACX,MAAM;EACN,YAAY;EACZ,UAAU;EACV,aAAa;EACb,QAAQ,KAAK,QAAQ,UAAU;EAC/B,gBAAgB,KAAK,OAAO;EAC5B,cAAc;EACd,YAAY,KAAK;EACjB,YAAY;EACZ,WAAW;EACX,YAAY;GACV,mBAAmB,KAAK;GACxB,iBAAiB,KAAK,SAAS;GAC/B,iBAAiB,KAAK,SAAS;GAC/B,kBACE,KAAK,WAAW,KAAA,IAAY,KAAA,IAAY,OAAO,KAAK,MAAM,CAAC,CAAC,MAAM,GAAG,GAAI;EAC7E;CACF,CACF;CACA,MAAM,yBAAS,IAAI,IAAY;CAC/B,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,OAAO,SAAS,OAAO,MAAM;EAChC,MAAM,EAAE,MAAM,OAAO,SAAS,YAAY,OAAO,KAAK,YAAY;EAClE,IAAI,OAAO,OAAO,IAAI,KAAK;EAC3B,IAAI,MAAM,MAAM,IAAI,IAAI;EACxB,MAAM,SAAS,eAAe,KAAK;EACnC,MAAM,KAAK;GACT,UAAU;GACV,SAAS,GAAG,QAAQ,IAAI;GACxB,gBAAgB;GAChB,MAAM,OAAO,OAAO,QAAQ,OAAO;GACnC;GACA,YAAY;GACZ,UAAU;GACV,aAAa;GACb,QAAQ,SAAS,UAAU;GAC3B,gBAAgB;GAChB,cAAc;GACd,YAAY,KAAK;GACjB,YAAY;GACZ,WAAW;GACX,YAAa,OAAO,QAAgD,CAAC;EACvE,CAAC;CACH,CAAC;CACD,MAAM,YAAY,MAAM,MAAM,MAAM,EAAE,WAAW,OAAO,KAAK;CAC7D,MAAM,UAAoC;EACxC,UAAU;EACV,cAAc;EACd,YAAY,KAAK;EACjB,YAAY,MAAM;EAClB,YAAY;EACZ,YAAY;EACZ,UAAU;EACV,aAAa;EACb,iBAAiB,QAAQ,KAAK;EAC9B,QAAQ,CAAC,GAAG,MAAM;EAClB,OAAO,CAAC,GAAG,KAAK;CAClB;CACA,OAAO;EAAE;EAAS;EAAO,UAAU,QAAQ;CAAgB;AAC7D;AAEA,SAAS,eAAe,GAAmB,GAAkC;CAC3E,IAAI,CAAC,GAAG,OAAO;CACf,IAAI,EAAE,eAAe,KAAA,KAAa,EAAE,QAAQ,eAAe,EAAE,YAAY,OAAO;CAChF,IAAI,EAAE,eAAe,UAAU,CAAC,EAAE,cAAc,SAAS,EAAE,QAAQ,gBAAgB,EAAE,GACnF,OAAO;CACT,IAAI,EAAE,aAAa,UAAU,CAAC,EAAE,YAAY,SAAS,EAAE,QAAQ,cAAc,EAAE,GAAG,OAAO;CACzF,IAAI,EAAE,aAAa,UAAU,CAAC,EAAE,YAAY,MAAM,MAAM,EAAE,QAAQ,OAAO,SAAS,CAAC,CAAC,GAClF,OAAO;CACT,IAAI,EAAE,YAAY,UAAU,CAAC,EAAE,WAAW,MAAM,OAAO,EAAE,QAAQ,MAAM,SAAS,EAAE,CAAC,GAAG,OAAO;CAC7F,IAAI,EAAE,oBAAoB,EAAE,QAAQ,aAAa,EAAE,kBAAkB,OAAO;CAC5E,IAAI,EAAE,qBAAqB,EAAE,QAAQ,aAAa,EAAE,mBAAmB,OAAO;CAC9E,IAAI,EAAE,iBAAiB,CAAC,IAAI,OAAO,EAAE,aAAa,CAAC,CAAC,KAAK,KAAK,UAAU,EAAE,KAAK,CAAC,GAAG,OAAO;CAC1F,OAAO;AACT;AAEA,SAAS,cACP,YACA,YACwD;CACxD,IAAI,YAAY;CAChB,MAAM,SAAkC,CAAC;CACzC,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,UAAU,GAAG;EAC/C,MAAM,IAAI,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC;EACtD,IAAI,OAAO,MAAM,YAAY,EAAE,SAAS,YAAY;GAClD,aAAa;GACb,OAAO,KAAK,GAAG,uCAAuC,GAAG,EAAE,OAAO,IAAI,EAAE,MAAM,GAAG,UAAU;EAC7F,OACE,OAAO,KAAK;CAEhB;CACA,OAAO;EAAE;EAAQ;CAAU;AAC7B;;;;;;AAOA,SAAgB,uBACd,YACA,UAAmC,+BACf;CACpB,IAAI,WAAW,WAAW,GACxB,MAAM,IAAI,aAAa,gEAAgE;CAEzF,MAAM,SAAS,WAAW,KAAK,OAAO,iBAAiB,EAAE,CAAC;CAC1D,MAAM,OAAO,IAAI,IAAI,OAAO,KAAK,MAAM,CAAC,EAAE,QAAQ,UAAU,CAAC,CAAC,CAAC;CAE/D,MAAM,iBAAiB,QAA0C;EAC/D,MAAM,sBAAM,IAAI,IAA0B;EAC1C,KAAK,MAAM,KAAK,KACd,KAAK,MAAM,KAAK,EAAE,OAAO;GACvB,IAAI,EAAE,WAAW,WAAW,CAAC,EAAE,gBAAgB;GAC/C,MAAM,MAAM,mBAAmB,EAAE,cAAc;GAC/C,MAAM,IAAI,IAAI,IAAI,GAAG,KAAK;IACxB,WAAW;IACX,uBAAuB,EAAE;IACzB,WAAW,EAAE;IACb,WAAW,EAAE;IACb,aAAa;IACb,YAAY;IACZ,YAAY;IACZ,oBAAoB,CAAC;IACrB,mBAAmB,CAAC;GACtB;GACA,EAAE,cAAc;GAChB,IACE,CAAC,EAAE,mBAAmB,SAAS,EAAE,QAAQ,QAAQ,KACjD,EAAE,mBAAmB,SAAS,IAC9B;IACA,EAAE,mBAAmB,KAAK,EAAE,QAAQ,QAAQ;IAC5C,EAAE,eAAe;GACnB;GACA,IAAI,EAAE,kBAAkB,SAAS,IAAI,EAAE,kBAAkB,KAAK,EAAE,OAAO;GACvE,IAAI,IAAI,KAAK,CAAC;EAChB;EAEF,MAAM,cAAc,IAAI,QAAQ,MAAM,EAAE,QAAQ,UAAU,CAAC,CAAC,UAAU;EAKtE,OAJiB,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;GAC7C,GAAG;GACH,YAAY,EAAE,cAAc;EAC9B,EACc,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,EAAE,WAAW;CAC9D;CAEA,OAAO;EACL,MAAM,YAAY,SAAyD;GACzE,MAAM,MAAM,OAAO,QAAQ,MAAM,eAAe,GAAG,OAAO,CAAC;GAC3D,MAAM,2BAAW,IAAI,IAAY;GACjC,MAAM,yBAAS,IAAI,IAAY;GAC/B,MAAM,yBAAS,IAAI,IAAY;GAC/B,MAAM,wBAAQ,IAAI,IAAY;GAC9B,IAAI,aAAa;GACjB,KAAK,MAAM,KAAK,KAAK;IACnB,IAAI,EAAE,QAAQ,cAAc,SAAS,IAAI,EAAE,QAAQ,YAAY;IAC/D,IAAI,EAAE,QAAQ,YAAY,OAAO,IAAI,EAAE,QAAQ,UAAU;IACzD,KAAK,MAAM,KAAK,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;IAC9C,KAAK,MAAM,MAAM,EAAE,QAAQ,OAAO,MAAM,IAAI,EAAE;IAC9C,cAAc,EAAE,MAAM,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC,CAAC;GAC5D;GACA,MAAM,QAAQ,IAAI,KAAK,MAAM,EAAE,QAAQ,UAAU,CAAC,CAAC,KAAK;GACxD,OAAO;IACL,cAAc,IAAI;IAClB,iBAAiB,IAAI,QAAQ,GAAG,MAAM,IAAI,EAAE,UAAU,CAAC;IACvD,UAAU,CAAC,GAAG,QAAQ;IACtB,QAAQ,CAAC,GAAG,MAAM;IAClB,QAAQ,CAAC,GAAG,MAAM;IAClB,YAAY,CAAC,GAAG,KAAK;IACrB,kBAAkB,IAAI,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,MAAM,EAAE,QAAQ,QAAQ;IAChE,QAAQ;KACN,aAAa,IAAI,QAAQ,MAAM,EAAE,QAAQ,UAAU,CAAC,CAAC;KACrD,YAAY;IACd;IACA,gBAAgB,cAAc,GAAG;IACjC,YAAY,MAAM,SAAS;KAAE,UAAU,MAAM;KAAK,QAAQ,MAAM,MAAM,SAAS;IAAI,IAAI;GACzF;EACF;EAEA,MAAM,YAAY,MAAgC;GAChD,MAAM,MAAM,OAAO,QAAQ,MAAM,eAAe,GAAG,KAAK,OAAO,CAAC;GAChE,MAAM,SAAS,KAAK,UAAU;GAE9B,OAAO;IACL,QAFW,IAAI,MAAM,QAAQ,SAAS,KAAK,KAEhC,CAAC,CAAC,KAAK,MAAM,EAAE,OAAO;IACjC,OAAO,IAAI;IACX,UAAU,SAAS,KAAK,QAAQ,IAAI;GACtC;EACF;EAEA,MAAM,YAAY,SAAgD;GAChE,OAAO,OAAO,QAAQ,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,CAAC;EAC1D;EAEA,MAAM,UAAU,MAAgC;GAC9C,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;GAChC,IAAI,CAAC,GAAG,OAAO;IAAE,UAAU,KAAK;IAAU,OAAO,CAAC;GAAE;GACpD,MAAM,MAAM,KAAK,0BAA0B,QAAQ;GACnD,MAAM,YAAY,EAAE,MAAM,KAAK,OAAO;IACpC,GAAG;IACH,YAAY,cAAc,EAAE,YAAY,GAAG,CAAC,CAAC;GAC/C,EAAE;GACF,IAAI,QAAQ,SAAS,IAAI,QAAQ,oBAAoB;IACnD,MAAM,wBAAQ,IAAI,IAAoB;IACtC,KAAK,MAAM,KAAK,EAAE,OAAO,MAAM,IAAI,EAAE,OAAO,MAAM,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;IACvE,OAAO;KACL,UAAU,KAAK;KACf,WAAW;MACT,YAAY,EAAE,MAAM;MACpB,gBAAgB,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,MAAM,GAAG,EAAE;MAC5E,yBAAyB,KAAK,IAAI,GAAG,EAAE,MAAM,KAAK,MAAM,QAAQ,CAAC,CAAC,CAAC;MACnE,kBAAkB,EAAE,MAAM,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC,CAAC;KAChE;IACF;GACF;GACA,OAAO;IAAE,UAAU,KAAK;IAAU,OAAO;GAAU;EACrD;EAEA,MAAM,UAAU,MAAgC;GAC9C,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;GAChC,MAAM,MAAM,KAAK,0BAA0B,QAAQ;GACnD,MAAM,OAAO,IAAI,IAAI,KAAK,QAAQ;GAClC,MAAM,SAAS,GAAG,SAAS,CAAC,EAAA,CAAG,QAAQ,MAAM,KAAK,IAAI,EAAE,OAAO,CAAC;GAChE,IAAI,YAAY;GAChB,MAAM,QAAQ,MAAM,KAAK,MAAM;IAC7B,MAAM,EAAE,QAAQ,WAAW,MAAM,cAAc,EAAE,YAAY,GAAG;IAChE,aAAa;IACb,OAAO;KAAE,GAAG;KAAG,YAAY;IAAO;GACpC,CAAC;GACD,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,OAAO,CAAC;GACpD,OAAO;IACL,UAAU,KAAK;IACf;IACA,kBAAkB,KAAK,SAAS,QAAQ,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC;IAChE,2BAA2B;GAC7B;EACF;EAEA,MAAM,YAAY,MAAkC;GAClD,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;GAChC,MAAM,MAAM,KAAK,eAAe;GAChC,MAAM,OAA0B,CAAC;GACjC,KAAK,MAAM,KAAK,GAAG,SAAS,CAAC,GAC3B,KAAK,MAAM,OAAO,gBAAgB,GAAG,KAAK,eAAe,QAAQ,kBAAkB,GAAG;IACpF,IAAI,KAAK,UAAU,KAAK;IACxB,KAAK,KAAK,GAAG;GACf;GAEF,OAAO;IACL,UAAU,KAAK;IACf;IACA,eAAe,KAAK;IACpB,UAAU,KAAK,UAAU;GAC3B;EACF;EAEA,MAAM,WAAW,MAAiC;GAChD,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;GAChC,MAAM,MAAM,KAAK,eAAe;GAChC,MAAM,QAAQ,GAAG,SAAS,CAAC,EAAA,CAAG,MAAM,MAAM,EAAE,YAAY,KAAK,OAAO;GACpE,MAAM,OAAO,OACT,gBAAgB,MAAM,KAAK,eAAe,QAAQ,kBAAkB,CAAC,CAAC,MAAM,GAAG,GAAG,IAClF,CAAC;GACL,OAAO;IACL,UAAU,KAAK;IACf,SAAS,KAAK;IACd;IACA,eAAe,KAAK;IACpB,UAAU;GACZ;EACF;CACF;AACF;AAEA,SAAS,gBACP,MACA,SACA,SACmB;CACnB,MAAM,KAAK,IAAI,OAAO,SAAS,GAAG;CAClC,MAAM,OAA0B,CAAC;CACjC,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,UAAU,GAAG;EACpD,MAAM,OAAO,OAAO,MAAM,WAAW,IAAI,KAAK,UAAU,CAAC;EACzD,IAAI,OAAO,SAAS,UAAU;EAC9B,GAAG,YAAY;EACf,MAAM,IAAI,GAAG,KAAK,IAAI;EACtB,IAAI,CAAC,GAAG;EACR,MAAM,KAAK,EAAE;EACb,KAAK,KAAK;GACR,UAAU,KAAK;GACf,SAAS,KAAK;GACd,WAAW,KAAK;GAChB,WAAW,KAAK;GAChB,gBAAgB,cAAc;GAC9B,cAAc,EAAE,EAAE,CAAC,MAAM,GAAG,OAAO;GACnC,gBAAgB,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC,GAAG,EAAE;GAC5D,eAAe,KAAK,MAAM,KAAK,EAAE,EAAE,CAAC,QAAQ,KAAK,EAAE,EAAE,CAAC,SAAS,UAAU,CAAC;GAC1E,cAAc;EAChB,CAAC;CACH;CACA,OAAO;AACT;;;;AClYA,eAAsB,eACpB,MACiD;CACjD,MAAM,MAAM,KAAK,OAAO;CACxB,MAAM,WAAW,KAAK,yBAAyB;CAC/C,MAAM,OAAO,YAAY,KAAK,OAAO;CACrC,MAAM,YAAY,KAAK,IAAI;CAG3B,MAAM,gBAAgB,qBAAqB,IAAI;CAC/C,MAAM,WAA+D,gBAChE,KAAK,eAAe,QAAQ,aAAa,KAAK,CAAC,IAChD,CAAC;CACL,IAAI,qBAAqB;EAAE;EAAe,gBAAgB,SAAS;CAAO,CAAC;CAC3E,MAAM,KAAK;EACT,MAAM;EACN,OAAO,KAAK;EACZ;EACA,mBAAmB,SAAS;CAC9B,CAAC;CAMD,MAAM,gBAAgB,MAAM,YAAY,MADlB,wBAAwB,UAAU,UAAU,KAAK,SAAS,KAAK,CAC3B,GAAG,IAAI;CACjE,IAAI,wBAAwB;EAC1B,UAAU,cAAc,SAAS;EACjC,UAAU,cAAc;EACxB,aAAa,cAAc,YAAY,KAAK,OAAO;GACjD,IAAI,EAAE;GACN,QAAQ,EAAE;GACV,GAAG,EAAE;EACP,EAAE;CACJ,CAAC;CAID,IAAI,KAAK,iBAAiB,cAAc,SAAS,SAAS,GAAG;EAC3D,MAAM,KAAK,cAAc,OAAO,KAAK,OAAO,cAAc,QAAQ;EAClE,MAAM,KAAK;GACT,MAAM;GACN,OAAO,KAAK;GACZ,OAAO,cAAc,SAAS;EAChC,CAAC;CACH;CAGA,IAAI,OAA4B;CAChC,IAAI,iBAAiB,cAAc,SAAS,SAAS,GAAG;EACtD,OAAO,aACL,SAAS,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE,GAC9B,cAAc,SAAS,KAAK,OAAO;GAAE,GAAG;GAAG,QAAQ,KAAK;EAAM,EAAE,CAClE;EACA,IAAI,oBAAoB;GACtB,UAAU,KAAK,SAAS;GACxB,aAAa,KAAK,YAAY;GAC9B,WAAW,KAAK,UAAU;GAC1B,SAAS,KAAK,QAAQ;EACxB,CAAC;EACD,MAAM,KAAK;GACT,MAAM;GACN,OAAO,KAAK;GACZ;GACA,UAAU,KAAK,SAAS;GACxB,aAAa,KAAK,YAAY;GAC9B,WAAW,KAAK,UAAU;GAC1B,SAAS,KAAK,QAAQ;EACxB,CAAC;CACH;CAGA,IAAI,YAA+C;CACnD,IAAI,KAAK,yBACP,YAAY,MAAM,2BAA2B,MAAM,cAAc,UAAU,KAAK,IAAI;CAItF,IAAI,cAA+C;CACnD,IAAI,KAAK,2BACP,cAAc,MAAM,6BAA6B,MAAM,cAAc,UAAU,KAAK,IAAI;CAG1F,MAAM,KAAK;EACT,MAAM;EACN,OAAO,KAAK;EACZ,YAAY,KAAK,IAAI,IAAI;CAC3B,CAAC;CAED,OAAO;EACL,OAAO,KAAK;EACZ;EACA;EACA;EACA;EACA;CACF;AACF;AAIA,SAAS,YAAY,SAAiD;CACpE,IAAI,CAAC,SAAS,OAAO,YAAY,CAAC;CAClC,OAAO,OAAO,UAAU;EACtB,MAAM,QAAQ,KAAK;CACrB;AACF;AAEA,eAAe,YACb,MACA,eACA,MAC2B;CAC3B,MAAM,MAAM,KAAK;CACjB,IAAI,OAAO,IAAI,cAAc,cAAc,KAAK,SAAS;EACvD,IAAI,QAAiC;EACrC,WAAW,MAAM,MAAM,IAAI,UAAU,KAAK,OAAO,KAAK,QAAQ,EAAE,cAAc,CAAC,GAAG;GAChF,MAAM,KAAK;IAAE,MAAM;IAAW,OAAO,KAAK;IAAO,OAAO;GAAG,CAAC;GAC5D,IAAI,GAAG,SAAS,iBAAiB,QAAQ,GAAG;EAC9C;EACA,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,sEAAsE;EAExF,OAAO;CACT;CACA,OAAO,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,QAAQ,EAAE,cAAc,CAAC;AACrE;AAEA,SAAS,qBAAqB,MAAyC;CACrE,IAAI,KAAK,kBAAkB,MAAM,OAAO;CACxC,IAAI,OAAO,KAAK,kBAAkB,UAAU,OAAO,KAAK;CACxD,IAAI,CAAC,KAAK,eAAe,OAAO;CAChC,MAAM,MAAM,KAAK,cAAc,QAAQ;CACvC,IAAI,OAAsB;CAC1B,KAAK,MAAM,OAAO,KAAK;EACrB,IAAI,IAAI,WAAW,KAAK,OAAO;EAC/B,OAAO,IAAI;CACb;CACA,OAAO;AACT;AAEA,SAAS,wBACP,OACA,UACA,UAC2F;CAC3F,IAAI,aAAa,UAAU,MAAM,WAAW,GAAG,OAAO,KAAA;CACtD,MAAM,WAAW,MAAM,KAAK,EAAE,QAAQ,SAAS,GAAG,WAAW,IAAsB;CACnF,IAAI,aAAa,YACf,OAAO,EAAE,KAAK,SAAS;CAGzB,OAAO;AACT;AAEA,eAAe,2BACb,MACA,UACA,KACA,MACqC;CAErC,MAAM,QAAQ,MADC,KAAK,wBACO,oBAAoB,QAAQ;CACvD,IAAI,iCAAiC;EACnC,WAAW,MAAM,UAAU;EAC3B,SAAS,MAAM;EACf,QAAQ,MAAM,OAAO;CACvB,CAAC;CACD,MAAM,KAAK;EACT,MAAM;EACN,OAAO,KAAK;EACZ,eAAe,MAAM,UAAU;EAC/B,SAAS,MAAM;EACf,QAAQ,MAAM,OAAO;CACvB,CAAC;CAED,OAAO;EACL,WAAW,MAAM;EACjB,SAAS,MAAM;EACf,QAAQ,MAAM;CAChB;AACF;AAEA,eAAe,6BACb,MACA,UACA,KACA,MACmC;CAEnC,MAAM,QAAQ,MADC,KAAK,0BACO,oBAAoB,QAAQ;CACvD,IAAI,mCAAmC;EACrC,OAAO,MAAM,MAAM;EACnB,SAAS,MAAM;EACf,QAAQ,MAAM,OAAO;CACvB,CAAC;CACD,MAAM,KAAK;EACT,MAAM;EACN,OAAO,KAAK;EACZ,WAAW,MAAM,MAAM;EACvB,SAAS,MAAM;EACf,QAAQ,MAAM,OAAO;CACvB,CAAC;CAED,OAAO;EACL,OAAO,MAAM;EACb,SAAS,MAAM;EACf,QAAQ,MAAM;CAChB;AACF;AAEA,SAAS,WAAW,KAAa,QAAwC;CACvE,IAAI,QAAQ,QAAQ,IAAI,kBAAkB,OAAO,MAAM;MAClD,QAAQ,IAAI,kBAAkB,KAAK;AAC1C"}

package/dist/analyst-loop.d.ts

@@ -1,50 +1,17 @@
-import { TraceAnalystByteBudgets, TraceAnalysisStore } from '@tangle-network/agent-eval';
-import { I as Iteration } from './types-BCoemcXU.js';
-import { R as RunAnalystLoopOpts, a as RunAnalystLoopResult } from './types-CmYCMbFT.js';
-export { A as AnalystLoopEvent, b as AnalystRegistryLike, c as AnalystRegistryStreamingLike, F as FindingsStoreLike, d as ImprovementEditBatch, I as ImprovementProposalSource, e as ImprovementReport, K as KnowledgeProposalBatch, f as KnowledgeProposalSource, g as KnowledgeReport } from './types-CmYCMbFT.js';
-import '@tangle-network/sandbox';
-import './types-BwoZWq-i.js';
-
-/**
- *
- * The read seam that closes the autonomous loop: project a round's `Iteration[]`
- * (each carrying its raw `SandboxEvent[]`) into an in-memory `TraceAnalysisStore`, the
- * read interface the trace analysts query. `runAnalystLoop` has had zero consumers
- * because nothing turned a loop's iterations into a store — this is that bridge.
- *
- * One iteration → one trace. The iteration is the root AGENT span; each `SandboxEvent`
- * becomes a child span (LLM for llm_call events, TOOL for tool events, else SPAN), so an
- * analyst can walk a shot's trace, cluster its errors, and emit findings the driver
- * steers on. Projection is best-effort over the FLAT SandboxEvent shape (no per-event
- * lineage yet — that's the richer-trace gap); it never fabricates — an errored iteration
- * surfaces a real ERROR span carrying the real message.
- *
- * @experimental
- */
-
+import { a as ImprovementEditBatch, c as KnowledgeProposalBatch, d as RunAnalystLoopOpts, f as RunAnalystLoopResult, i as FindingsStoreLike, l as KnowledgeProposalSource, n as AnalystRegistryLike, o as ImprovementProposalSource, r as AnalystRegistryStreamingLike, s as ImprovementReport, t as AnalystLoopEvent, u as KnowledgeReport } from "./types-Cja5OTGh.js";
+import { a as Iteration } from "./types-BevOjfTY.js";
+import { TraceAnalysisStore, TraceAnalystByteBudgets } from "@tangle-network/agent-eval";
+//#region src/analyst-loop/iterations-to-trace-store.d.ts
 /**
  * Build an in-memory `TraceAnalysisStore` over a loop round's iterations. Fail-loud on an
  * empty round — there is nothing for an analyst to read, and a silent empty store would
  * mask a broken capture path.
  */
 declare function iterationsToTraceStore<Task, Output>(iterations: ReadonlyArray<Iteration<Task, Output>>, budgets?: TraceAnalystByteBudgets): TraceAnalysisStore;
-
-/**
- * `runAnalystLoop` — the one call agent apps reach for to close the
- * recursive-self-improvement loop.
- *
- *   1. Load baseline findings (last run, or the slice the caller specifies)
- *   2. Run the analyst registry with priorFindings injected
- *   3. Persist the new run's findings to the ledger
- *   4. Diff the new run against the baseline
- *   5. Hand the findings to the knowledge proposal source
- *   6. Hand the findings to the agent-surface proposal source
- *   7. Return a single report the consumer renders / persists / acts on.
- *
- * Proposal sources are optional: the loop also works as a plain
- * "run + diff + report" primitive.
- */
-
+//#endregion
+//#region src/analyst-loop/run-analyst-loop.d.ts
+/** Analyze a run and apply accepted knowledge and agent-surface proposals. */
 declare function runAnalystLoop<TProposal = unknown, TEdit = unknown>(opts: RunAnalystLoopOpts): Promise<RunAnalystLoopResult<TProposal, TEdit>>;
-
-export { RunAnalystLoopOpts, RunAnalystLoopResult, iterationsToTraceStore, runAnalystLoop };
+//#endregion
+export { type AnalystLoopEvent, type AnalystRegistryLike, type AnalystRegistryStreamingLike, type FindingsStoreLike, type ImprovementEditBatch, type ImprovementProposalSource, type ImprovementReport, type KnowledgeProposalBatch, type KnowledgeProposalSource, type KnowledgeReport, type RunAnalystLoopOpts, type RunAnalystLoopResult, iterationsToTraceStore, runAnalystLoop };
+//# sourceMappingURL=analyst-loop.d.ts.map

package/dist/analyst-loop.js

@@ -1,11 +1,2 @@
-import {
-  iterationsToTraceStore,
-  runAnalystLoop
-} from "./chunk-FD2MBMOH.js";
-import "./chunk-M22PL4GH.js";
-import "./chunk-YEJR7IXO.js";
-export {
-  iterationsToTraceStore,
-  runAnalystLoop
-};
-//# sourceMappingURL=analyst-loop.js.map
+import { n as iterationsToTraceStore, t as runAnalystLoop } from "./analyst-loop-DGdtVENg.js";
+export { iterationsToTraceStore, runAnalystLoop };