@tangle-network/agent-runtime 0.199.0 → 0.201.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (72) hide show
  1. package/dist/{activation-c3um4SY1.d.ts → activation-BPxs-Iu2.d.ts} +2 -2
  2. package/dist/{activation-zQWmiiPg.js → activation-C_FN2aqK.js} +2 -2
  3. package/dist/{activation-zQWmiiPg.js.map → activation-C_FN2aqK.js.map} +1 -1
  4. package/dist/agent.d.ts +1 -1
  5. package/dist/agent.js +2 -3
  6. package/dist/agent.js.map +1 -1
  7. package/dist/analyst-loop-DZw5QWT9.js +176 -0
  8. package/dist/analyst-loop-DZw5QWT9.js.map +1 -0
  9. package/dist/analyst-loop.d.ts +1 -11
  10. package/dist/analyst-loop.js +2 -2
  11. package/dist/candidate-execution/index.d.ts +2 -2
  12. package/dist/candidate-execution/index.js +3 -3
  13. package/dist/{coordination-driver-vWb7kViA.js → coordination-driver-qdAwriPV.js} +8 -5
  14. package/dist/{coordination-driver-vWb7kViA.js.map → coordination-driver-qdAwriPV.js.map} +1 -1
  15. package/dist/{delegate-Ch93bpH5.js → delegate-BWHG-zZW.js} +2 -2
  16. package/dist/{delegate-Ch93bpH5.js.map → delegate-BWHG-zZW.js.map} +1 -1
  17. package/dist/durable.d.ts +2 -2
  18. package/dist/durable.js +2 -2
  19. package/dist/{graph-C6pT08K-.js → graph-cCqKhLqz.js} +3 -3
  20. package/dist/{graph-C6pT08K-.js.map → graph-cCqKhLqz.js.map} +1 -1
  21. package/dist/{improvement-cycle-CxZKIbLD.js → improvement-cycle-VH_ZGcIj.js} +5 -5
  22. package/dist/{improvement-cycle-CxZKIbLD.js.map → improvement-cycle-VH_ZGcIj.js.map} +1 -1
  23. package/dist/{index-CMTUgh-T.d.ts → index-Br191WbE.d.ts} +190 -142
  24. package/dist/index.d.ts +6 -5
  25. package/dist/index.js +28 -49
  26. package/dist/index.js.map +1 -1
  27. package/dist/intelligence.d.ts +15 -106
  28. package/dist/intelligence.js +9 -408
  29. package/dist/intelligence.js.map +1 -1
  30. package/dist/kernel.d.ts +3 -3
  31. package/dist/kernel.js +8 -9
  32. package/dist/{loop-runner-bin-CAf1OQot.d.ts → loop-runner-bin-BNRdsDOn.d.ts} +3 -3
  33. package/dist/{loop-runner-bin-SNrh585k.js → loop-runner-bin-jQ8hXO9J.js} +4 -4
  34. package/dist/{loop-runner-bin-SNrh585k.js.map → loop-runner-bin-jQ8hXO9J.js.map} +1 -1
  35. package/dist/loop-runner-bin.d.ts +1 -1
  36. package/dist/loop-runner-bin.js +1 -1
  37. package/dist/mcp/bin.js +3 -3
  38. package/dist/mcp/index.d.ts +2 -2
  39. package/dist/mcp/index.js +4 -4
  40. package/dist/{prepare-CAO1yXov.js → prepare-Dc30WRB0.js} +6 -3
  41. package/dist/prepare-Dc30WRB0.js.map +1 -0
  42. package/dist/{protected-model-port-BtXp2dUY.d.ts → protected-model-port-BlLP8ja6.d.ts} +2 -2
  43. package/dist/{protected-model-port-B5avcRiQ.js → protected-model-port-D5gDcnrH.js} +2 -2
  44. package/dist/{protected-model-port-B5avcRiQ.js.map → protected-model-port-D5gDcnrH.js.map} +1 -1
  45. package/dist/{provision-supervisor-D5YSCDVD.js → provision-supervisor-BA2-GPth.js} +3 -3
  46. package/dist/{provision-supervisor-D5YSCDVD.js.map → provision-supervisor-BA2-GPth.js.map} +1 -1
  47. package/dist/{redact-Dv8WcCKy.js → redact-h-oaw11Q.js} +13093 -11221
  48. package/dist/redact-h-oaw11Q.js.map +1 -0
  49. package/dist/{runtime-BN16GbTA.js → runtime-DeqdBVeC.js} +8 -9
  50. package/dist/{runtime-BN16GbTA.js.map → runtime-DeqdBVeC.js.map} +1 -1
  51. package/dist/{server-CbNb_N1x.js → server-U_k9NUbk.js} +3 -3
  52. package/dist/{server-CbNb_N1x.js.map → server-U_k9NUbk.js.map} +1 -1
  53. package/dist/{stream-agent-turn-CLOQr497.d.ts → stream-agent-turn-CJWthifS.d.ts} +42 -13
  54. package/dist/{structural-rollout-DANCelu6.js → structural-rollout-BcMmrpv4.js} +2 -3
  55. package/dist/{structural-rollout-DANCelu6.js.map → structural-rollout-BcMmrpv4.js.map} +1 -1
  56. package/dist/{supervise-BGNXB8No.js → supervise-DmFO50N6.js} +497 -90
  57. package/dist/supervise-DmFO50N6.js.map +1 -0
  58. package/dist/testing.d.ts +2 -2
  59. package/dist/testing.js +13 -13
  60. package/dist/tui/index.d.ts +1 -1
  61. package/dist/tui/index.js +1 -1
  62. package/dist/{types-1s_29INY.d.ts → types-CuXu5zuS.d.ts} +3 -2
  63. package/dist/{workspace-archive-BMOnloFf.js → workspace-archive-CBX0hwL_.js} +2 -2
  64. package/dist/{workspace-archive-BMOnloFf.js.map → workspace-archive-CBX0hwL_.js.map} +1 -1
  65. package/package.json +6 -6
  66. package/dist/analyst-loop-BknOQUW5.js +0 -546
  67. package/dist/analyst-loop-BknOQUW5.js.map +0 -1
  68. package/dist/prepare-CAO1yXov.js.map +0 -1
  69. package/dist/redact-Dv8WcCKy.js.map +0 -1
  70. package/dist/sandbox-events-DbC2WKKS.js +0 -929
  71. package/dist/sandbox-events-DbC2WKKS.js.map +0 -1
  72. package/dist/supervise-BGNXB8No.js.map +0 -1
@@ -1,546 +0,0 @@
1
- import { n as AnalystError } from "./errors-DodWX-cb.js";
2
- import { a as extractLlmCallEvent } from "./sandbox-events-DbC2WKKS.js";
3
- import { DEFAULT_TRACE_ANALYST_BUDGETS, TRACE_ANALYST_TRUNCATION_MARKER_PREFIX, diffFindings } from "@tangle-network/agent-eval";
4
- //#region src/analyst-loop/iterations-to-trace-store.ts
5
- /**
6
- *
7
- * The read seam that closes the autonomous loop: project a round's `Iteration[]`
8
- * (each carrying its raw `SandboxEvent[]`) into an in-memory `TraceAnalysisStore`, the
9
- * read interface the trace analysts query. `runAnalystLoop` has had zero consumers
10
- * because nothing turned a loop's iterations into a store — this is that bridge.
11
- *
12
- * One iteration → one trace. The iteration is the root AGENT span; each `SandboxEvent`
13
- * becomes a child span (LLM for llm_call events, TOOL for tool events, else SPAN), so an
14
- * analyst can walk a shot's trace, cluster its errors, and emit findings the driver
15
- * steers on. Projection is best-effort over the FLAT SandboxEvent shape (no per-event
16
- * lineage yet — that's the richer-trace gap); it never fabricates — an errored iteration
17
- * surfaces a real ERROR span carrying the real message.
18
- *
19
- * @experimental
20
- */
21
- const bytesOf = (v) => Buffer.byteLength(JSON.stringify(v) ?? "", "utf8");
22
- const iso = (ms) => new Date(ms).toISOString();
23
- /** Normalize volatile tokens out of a status message so semantically identical failures
24
- * collapse to one signature (digits, hex/uuids, paths, durations → placeholders). */
25
- function normalizeSignature(message) {
26
- 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);
27
- }
28
- function spanKindFor(event, agentRunName) {
29
- const llm = extractLlmCallEvent(event, agentRunName);
30
- if (llm) return {
31
- kind: "LLM",
32
- model: llm.model ?? null,
33
- tool: null
34
- };
35
- const type = String(event?.type ?? "");
36
- if (/tool/i.test(type)) {
37
- const d = event?.data;
38
- return {
39
- kind: "TOOL",
40
- model: null,
41
- tool: typeof d?.name === "string" ? d.name : typeof d?.tool === "string" ? d.tool : type
42
- };
43
- }
44
- return {
45
- kind: "SPAN",
46
- model: null,
47
- tool: null
48
- };
49
- }
50
- function errorMessageOf(event) {
51
- const type = String(event?.type ?? "");
52
- const d = event?.data;
53
- if (/error|fail/i.test(type) || d?.error) {
54
- const m = d?.error ?? d?.message;
55
- return typeof m === "string" ? m : `${type} error`;
56
- }
57
- }
58
- /** Project one iteration → one trace: root AGENT span + a child span per event. */
59
- function projectIteration(iter) {
60
- const traceId = (iter.events.find((e) => (e?.data)?.sandboxId)?.data)?.sandboxId ?? `iter-${iter.index}`;
61
- const start = iso(iter.startedAt);
62
- const end = iso(iter.endedAt || iter.startedAt);
63
- const durationMs = Math.max(0, (iter.endedAt || iter.startedAt) - iter.startedAt);
64
- const rootId = `${traceId}:root`;
65
- const iterErrored = Boolean(iter.error) || iter.verdict?.valid === false;
66
- const spans = [{
67
- trace_id: traceId,
68
- span_id: rootId,
69
- parent_span_id: null,
70
- name: iter.agentRunName,
71
- kind: "AGENT",
72
- start_time: start,
73
- end_time: end,
74
- duration_ms: durationMs,
75
- status: iter.error ? "ERROR" : "OK",
76
- status_message: iter.error?.message,
77
- service_name: "agent-runtime",
78
- agent_name: iter.agentRunName,
79
- model_name: null,
80
- tool_name: null,
81
- attributes: {
82
- "iteration.index": iter.index,
83
- "verdict.valid": iter.verdict?.valid,
84
- "verdict.score": iter.verdict?.score,
85
- "output.preview": iter.output === void 0 ? void 0 : String(iter.output).slice(0, 2e3)
86
- }
87
- }];
88
- const models = /* @__PURE__ */ new Set();
89
- const tools = /* @__PURE__ */ new Set();
90
- iter.events.forEach((event, i) => {
91
- const { kind, model, tool } = spanKindFor(event, iter.agentRunName);
92
- if (model) models.add(model);
93
- if (tool) tools.add(tool);
94
- const errMsg = errorMessageOf(event);
95
- spans.push({
96
- trace_id: traceId,
97
- span_id: `${traceId}:e${i}`,
98
- parent_span_id: rootId,
99
- name: String(event?.type ?? "event"),
100
- kind,
101
- start_time: start,
102
- end_time: end,
103
- duration_ms: 0,
104
- status: errMsg ? "ERROR" : "OK",
105
- status_message: errMsg,
106
- service_name: "agent-runtime",
107
- agent_name: iter.agentRunName,
108
- model_name: model,
109
- tool_name: tool,
110
- attributes: event?.data ?? {}
111
- });
112
- });
113
- const hasErrors = spans.some((s) => s.status === "ERROR") || iterErrored;
114
- const summary = {
115
- trace_id: traceId,
116
- service_name: "agent-runtime",
117
- agent_name: iter.agentRunName,
118
- span_count: spans.length,
119
- has_errors: hasErrors,
120
- start_time: start,
121
- end_time: end,
122
- duration_ms: durationMs,
123
- raw_jsonl_bytes: bytesOf(spans),
124
- models: [...models],
125
- tools: [...tools]
126
- };
127
- return {
128
- summary,
129
- spans,
130
- rawBytes: summary.raw_jsonl_bytes
131
- };
132
- }
133
- function matchesFilters(t, f) {
134
- if (!f) return true;
135
- if (f.has_errors !== void 0 && t.summary.has_errors !== f.has_errors) return false;
136
- if (f.service_names?.length && !f.service_names.includes(t.summary.service_name ?? "")) return false;
137
- if (f.agent_names?.length && !f.agent_names.includes(t.summary.agent_name ?? "")) return false;
138
- if (f.model_names?.length && !f.model_names.some((m) => t.summary.models.includes(m))) return false;
139
- if (f.tool_names?.length && !f.tool_names.some((tn) => t.summary.tools.includes(tn))) return false;
140
- if (f.start_time_after && t.summary.start_time < f.start_time_after) return false;
141
- if (f.start_time_before && t.summary.start_time > f.start_time_before) return false;
142
- if (f.regex_pattern && !new RegExp(f.regex_pattern).test(JSON.stringify(t.spans))) return false;
143
- return true;
144
- }
145
- function capAttributes(attributes, perAttrCap) {
146
- let truncated = 0;
147
- const capped = {};
148
- for (const [k, v] of Object.entries(attributes)) {
149
- const s = typeof v === "string" ? v : JSON.stringify(v);
150
- if (typeof s === "string" && s.length > perAttrCap) {
151
- truncated += 1;
152
- capped[k] = `${TRACE_ANALYST_TRUNCATION_MARKER_PREFIX} ${s.length}b]${s.slice(0, perAttrCap)}`;
153
- } else capped[k] = v;
154
- }
155
- return {
156
- capped,
157
- truncated
158
- };
159
- }
160
- /**
161
- * Build an in-memory `TraceAnalysisStore` over a loop round's iterations. Fail-loud on an
162
- * empty round — there is nothing for an analyst to read, and a silent empty store would
163
- * mask a broken capture path.
164
- */
165
- function iterationsToTraceStore(iterations, budgets = DEFAULT_TRACE_ANALYST_BUDGETS) {
166
- if (iterations.length === 0) throw new AnalystError("iterationsToTraceStore: no iterations to analyze (empty round)");
167
- const traces = iterations.map((it) => projectIteration(it));
168
- const byId = new Map(traces.map((t) => [t.summary.trace_id, t]));
169
- const buildClusters = (set) => {
170
- const map = /* @__PURE__ */ new Map();
171
- for (const t of set) for (const s of t.spans) {
172
- if (s.status !== "ERROR" || !s.status_message) continue;
173
- const sig = normalizeSignature(s.status_message);
174
- const c = map.get(sig) ?? {
175
- signature: sig,
176
- status_message_sample: s.status_message,
177
- span_name: s.name,
178
- tool_name: s.tool_name,
179
- trace_count: 0,
180
- span_count: 0,
181
- prevalence: 0,
182
- exemplar_trace_ids: [],
183
- exemplar_span_ids: []
184
- };
185
- c.span_count += 1;
186
- if (!c.exemplar_trace_ids.includes(t.summary.trace_id) && c.exemplar_trace_ids.length < 10) {
187
- c.exemplar_trace_ids.push(t.summary.trace_id);
188
- c.trace_count += 1;
189
- }
190
- if (c.exemplar_span_ids.length < 10) c.exemplar_span_ids.push(s.span_id);
191
- map.set(sig, c);
192
- }
193
- const errorTraces = set.filter((t) => t.summary.has_errors).length || 1;
194
- return [...map.values()].map((c) => ({
195
- ...c,
196
- prevalence: c.trace_count / errorTraces
197
- })).sort((a, b) => b.trace_count - a.trace_count);
198
- };
199
- return {
200
- async hasTrace(trace_id) {
201
- return byId.has(trace_id);
202
- },
203
- async hasSpans(opts) {
204
- const t = byId.get(opts.trace_id);
205
- if (!t) return [];
206
- const present = new Set(t.spans.map((s) => s.span_id));
207
- return opts.span_ids.filter((id) => present.has(id));
208
- },
209
- async getOverview(filters) {
210
- const set = traces.filter((t) => matchesFilters(t, filters));
211
- const services = /* @__PURE__ */ new Set();
212
- const agents = /* @__PURE__ */ new Set();
213
- const models = /* @__PURE__ */ new Set();
214
- const tools = /* @__PURE__ */ new Set();
215
- let errorSpans = 0;
216
- for (const t of set) {
217
- if (t.summary.service_name) services.add(t.summary.service_name);
218
- if (t.summary.agent_name) agents.add(t.summary.agent_name);
219
- for (const m of t.summary.models) models.add(m);
220
- for (const tn of t.summary.tools) tools.add(tn);
221
- errorSpans += t.spans.filter((s) => s.status === "ERROR").length;
222
- }
223
- const times = set.map((t) => t.summary.start_time).sort();
224
- return {
225
- total_traces: set.length,
226
- raw_jsonl_bytes: set.reduce((n, t) => n + t.rawBytes, 0),
227
- services: [...services],
228
- agents: [...agents],
229
- models: [...models],
230
- tool_names: [...tools],
231
- sample_trace_ids: set.slice(0, 20).map((t) => t.summary.trace_id),
232
- errors: {
233
- trace_count: set.filter((t) => t.summary.has_errors).length,
234
- span_count: errorSpans
235
- },
236
- error_clusters: buildClusters(set),
237
- time_range: times.length ? {
238
- earliest: times[0],
239
- latest: times[times.length - 1]
240
- } : null
241
- };
242
- },
243
- async queryTraces(opts) {
244
- const set = traces.filter((t) => matchesFilters(t, opts.filters));
245
- const offset = opts.offset ?? 0;
246
- return {
247
- traces: set.slice(offset, offset + opts.limit).map((t) => t.summary),
248
- total: set.length,
249
- has_more: offset + opts.limit < set.length
250
- };
251
- },
252
- async countTraces(filters) {
253
- return traces.filter((t) => matchesFilters(t, filters)).length;
254
- },
255
- async viewTrace(opts) {
256
- const t = byId.get(opts.trace_id);
257
- if (!t) return {
258
- trace_id: opts.trace_id,
259
- spans: []
260
- };
261
- const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeViewBudget;
262
- const projected = t.spans.map((s) => ({
263
- ...s,
264
- attributes: capAttributes(s.attributes, cap).capped
265
- }));
266
- if (bytesOf(projected) > budgets.perCallByteCeiling) {
267
- const names = /* @__PURE__ */ new Map();
268
- for (const s of t.spans) names.set(s.name, (names.get(s.name) ?? 0) + 1);
269
- return {
270
- trace_id: opts.trace_id,
271
- oversized: {
272
- span_count: t.spans.length,
273
- top_span_names: [...names.entries()].sort((a, b) => b[1] - a[1]).slice(0, 20),
274
- span_response_bytes_max: Math.max(...t.spans.map((s) => bytesOf(s))),
275
- error_span_count: t.spans.filter((s) => s.status === "ERROR").length
276
- }
277
- };
278
- }
279
- return {
280
- trace_id: opts.trace_id,
281
- spans: projected
282
- };
283
- },
284
- async viewSpans(opts) {
285
- const t = byId.get(opts.trace_id);
286
- const cap = opts.per_attribute_byte_cap ?? budgets.perAttributeSpanBudget;
287
- const want = new Set(opts.span_ids);
288
- const found = (t?.spans ?? []).filter((s) => want.has(s.span_id));
289
- let truncated = 0;
290
- let bytes = 0;
291
- const spans = [];
292
- const omitted = [];
293
- for (const s of found) {
294
- const { capped, truncated: n } = capAttributes(s.attributes, cap);
295
- const projected = {
296
- ...s,
297
- attributes: capped
298
- };
299
- const size = bytesOf(projected);
300
- if (spans.length > 0 && bytes + size > budgets.perCallByteCeiling) {
301
- omitted.push(s.span_id);
302
- continue;
303
- }
304
- truncated += n;
305
- bytes += size;
306
- spans.push(projected);
307
- }
308
- const foundIds = new Set(found.map((s) => s.span_id));
309
- return {
310
- trace_id: opts.trace_id,
311
- spans,
312
- missing_span_ids: opts.span_ids.filter((id) => !foundIds.has(id)),
313
- omitted_span_ids: omitted,
314
- has_more: omitted.length > 0,
315
- truncated_attribute_count: truncated
316
- };
317
- },
318
- async searchTrace(opts) {
319
- const t = byId.get(opts.trace_id);
320
- const max = opts.max_matches ?? 50;
321
- const hits = [];
322
- for (const s of t?.spans ?? []) for (const hit of searchSpanAttrs(s, opts.regex_pattern, budgets.perMatchTextBudget)) {
323
- if (hits.length >= max) break;
324
- hits.push(hit);
325
- }
326
- return {
327
- trace_id: opts.trace_id,
328
- hits,
329
- has_more: hits.length >= max
330
- };
331
- },
332
- async searchSpan(opts) {
333
- const t = byId.get(opts.trace_id);
334
- const max = opts.max_matches ?? 50;
335
- const span = (t?.spans ?? []).find((s) => s.span_id === opts.span_id);
336
- const all = span ? searchSpanAttrs(span, opts.regex_pattern, budgets.perMatchTextBudget) : [];
337
- const hits = all.slice(0, max);
338
- return {
339
- trace_id: opts.trace_id,
340
- span_id: opts.span_id,
341
- hits,
342
- has_more: all.length > hits.length
343
- };
344
- }
345
- };
346
- }
347
- function searchSpanAttrs(span, pattern, textCap) {
348
- const re = new RegExp(pattern, "g");
349
- const hits = [];
350
- for (const [k, v] of Object.entries(span.attributes)) {
351
- const text = typeof v === "string" ? v : JSON.stringify(v);
352
- if (typeof text !== "string") continue;
353
- re.lastIndex = 0;
354
- const m = re.exec(text);
355
- if (!m) continue;
356
- const at = m.index;
357
- hits.push({
358
- trace_id: span.trace_id,
359
- span_id: span.span_id,
360
- span_name: span.name,
361
- span_kind: span.kind,
362
- attribute_path: `attributes.${k}`,
363
- matched_text: m[0].slice(0, textCap),
364
- context_before: text.slice(Math.max(0, at - textCap / 2), at),
365
- context_after: text.slice(at + m[0].length, at + m[0].length + textCap / 2),
366
- match_offset: at
367
- });
368
- }
369
- return hits;
370
- }
371
- //#endregion
372
- //#region src/analyst-loop/run-analyst-loop.ts
373
- /** Analyze a run and apply accepted knowledge and agent-surface proposals. */
374
- async function runAnalystLoop(opts) {
375
- const log = opts.log ?? defaultLog;
376
- const strategy = opts.priorFindingsStrategy ?? "per-kind";
377
- const emit = makeEmitter(opts.onEvent);
378
- const startedAt = Date.now();
379
- const baselineRunId = resolveBaselineRunId(opts);
380
- const priorAll = baselineRunId ? opts.findingsStore?.loadRun(baselineRunId) ?? [] : [];
381
- log("baseline resolved", {
382
- baselineRunId,
383
- prior_findings: priorAll.length
384
- });
385
- await emit({
386
- type: "baseline-resolved",
387
- runId: opts.runId,
388
- baselineRunId,
389
- priorFindingCount: priorAll.length
390
- });
391
- const analystResult = await runRegistry(opts, buildPriorFindingsInput(priorAll, strategy, opts.registry.list()), emit);
392
- log("analyst run complete", {
393
- findings: analystResult.findings.length,
394
- cost_usd: analystResult.total_cost_usd,
395
- per_analyst: analystResult.per_analyst.map((s) => ({
396
- id: s.analyst_id,
397
- status: s.status,
398
- n: s.findings_count
399
- }))
400
- });
401
- if (opts.findingsStore && analystResult.findings.length > 0) {
402
- await opts.findingsStore.append(opts.runId, analystResult.findings);
403
- await emit({
404
- type: "findings-persisted",
405
- runId: opts.runId,
406
- count: analystResult.findings.length
407
- });
408
- }
409
- let diff = null;
410
- if (baselineRunId && analystResult.findings.length > 0) {
411
- diff = diffFindings(priorAll.map((f) => ({ ...f })), analystResult.findings.map((f) => ({
412
- ...f,
413
- run_id: opts.runId
414
- })));
415
- log("diff vs baseline", {
416
- appeared: diff.appeared.length,
417
- disappeared: diff.disappeared.length,
418
- persisted: diff.persisted.length,
419
- changed: diff.changed.length
420
- });
421
- await emit({
422
- type: "diff-computed",
423
- runId: opts.runId,
424
- baselineRunId,
425
- appeared: diff.appeared.length,
426
- disappeared: diff.disappeared.length,
427
- persisted: diff.persisted.length,
428
- changed: diff.changed.length
429
- });
430
- }
431
- let knowledge = null;
432
- if (opts.knowledgeProposalSource) knowledge = await runKnowledgeProposalSource(opts, analystResult.findings, log, emit);
433
- let improvement = null;
434
- if (opts.improvementProposalSource) improvement = await runImprovementProposalSource(opts, analystResult.findings, log, emit);
435
- const durationMs = Math.max(0, Date.now() - startedAt);
436
- await emit({
437
- type: "loop-completed",
438
- runId: opts.runId,
439
- durationMs
440
- });
441
- return {
442
- runId: opts.runId,
443
- baselineRunId,
444
- durationMs,
445
- analystResult,
446
- diff,
447
- knowledge,
448
- improvement
449
- };
450
- }
451
- function makeEmitter(onEvent) {
452
- if (!onEvent) return async () => {};
453
- return async (event) => {
454
- await onEvent(event);
455
- };
456
- }
457
- async function runRegistry(opts, priorFindings, emit) {
458
- const reg = opts.registry;
459
- const registryOptions = {
460
- ...priorFindings ? { priorFindings } : {},
461
- ...opts.chainFindings !== void 0 ? { chainFindings: opts.chainFindings } : {},
462
- ...opts.costLedger ? { costLedger: opts.costLedger } : {},
463
- ...opts.costPhase ? { costPhase: opts.costPhase } : {},
464
- ...opts.signal ? { signal: opts.signal } : {}
465
- };
466
- if (typeof reg.runStream === "function" && opts.onEvent) {
467
- let final = null;
468
- for await (const ev of reg.runStream(opts.runId, opts.inputs, registryOptions)) {
469
- await emit({
470
- type: "analyst",
471
- runId: opts.runId,
472
- event: ev
473
- });
474
- if (ev.type === "run-completed") final = ev.result;
475
- }
476
- if (!final) throw new Error("runAnalystLoop: registry.runStream ended without run-completed event");
477
- return final;
478
- }
479
- return opts.registry.run(opts.runId, opts.inputs, registryOptions);
480
- }
481
- function resolveBaselineRunId(opts) {
482
- if (opts.baselineRunId === null) return null;
483
- if (typeof opts.baselineRunId === "string") return opts.baselineRunId;
484
- if (!opts.findingsStore) return null;
485
- const all = opts.findingsStore.loadAll();
486
- let last = null;
487
- for (const row of all) {
488
- if (row.run_id === opts.runId) continue;
489
- last = row.run_id;
490
- }
491
- return last;
492
- }
493
- function buildPriorFindingsInput(prior, strategy, registry) {
494
- if (strategy === "none" || prior.length === 0) return void 0;
495
- const stripped = prior.map(({ run_id: _run_id, ...rest }) => rest);
496
- if (strategy === "wildcard") return { "*": stripped };
497
- return stripped;
498
- }
499
- async function runKnowledgeProposalSource(opts, findings, log, emit) {
500
- const batch = await opts.knowledgeProposalSource.proposeFromFindings(findings);
501
- log("knowledge.proposeFromFindings", {
502
- proposals: batch.proposals.length,
503
- skipped: batch.skipped,
504
- errors: batch.errors.length
505
- });
506
- await emit({
507
- type: "knowledge-proposed",
508
- runId: opts.runId,
509
- proposalCount: batch.proposals.length,
510
- skipped: batch.skipped,
511
- errors: batch.errors.length
512
- });
513
- return {
514
- proposals: batch.proposals,
515
- skipped: batch.skipped,
516
- errors: batch.errors
517
- };
518
- }
519
- async function runImprovementProposalSource(opts, findings, log, emit) {
520
- const batch = await opts.improvementProposalSource.proposeFromFindings(findings);
521
- log("improvement.proposeFromFindings", {
522
- edits: batch.edits.length,
523
- skipped: batch.skipped,
524
- errors: batch.errors.length
525
- });
526
- await emit({
527
- type: "improvement-proposed",
528
- runId: opts.runId,
529
- editCount: batch.edits.length,
530
- skipped: batch.skipped,
531
- errors: batch.errors.length
532
- });
533
- return {
534
- edits: batch.edits,
535
- skipped: batch.skipped,
536
- errors: batch.errors
537
- };
538
- }
539
- function defaultLog(msg, fields) {
540
- if (fields) console.log(`[analyst-loop] ${msg}`, fields);
541
- else console.log(`[analyst-loop] ${msg}`);
542
- }
543
- //#endregion
544
- export { iterationsToTraceStore as n, runAnalystLoop as t };
545
-
546
- //# sourceMappingURL=analyst-loop-BknOQUW5.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"analyst-loop-BknOQUW5.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 hasTrace(trace_id: string): Promise<boolean> {\n return byId.has(trace_id)\n },\n\n async hasSpans(opts): Promise<string[]> {\n const t = byId.get(opts.trace_id)\n if (!t) return []\n const present = new Set(t.spans.map((s) => s.span_id))\n return opts.span_ids.filter((id) => present.has(id))\n },\n\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 // Fill the response up to the per-call byte ceiling; requested spans that\n // exist but do not fit become `omitted_span_ids` continuation work. The\n // first span is always included even when it alone exceeds the ceiling —\n // otherwise a caller could never make progress on an oversized span.\n let truncated = 0\n let bytes = 0\n const spans: TraceAnalystSpan[] = []\n const omitted: string[] = []\n for (const s of found) {\n const { capped, truncated: n } = capAttributes(s.attributes, cap)\n const projected = { ...s, attributes: capped }\n const size = bytesOf(projected)\n if (spans.length > 0 && bytes + size > budgets.perCallByteCeiling) {\n omitted.push(s.span_id)\n continue\n }\n truncated += n\n bytes += size\n spans.push(projected)\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 omitted_span_ids: omitted,\n has_more: omitted.length > 0,\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 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 all = span ? searchSpanAttrs(span, opts.regex_pattern, budgets.perMatchTextBudget) : []\n const hits = all.slice(0, max)\n return {\n trace_id: opts.trace_id,\n span_id: opts.span_id,\n hits,\n has_more: all.length > hits.length,\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 const durationMs = Math.max(0, Date.now() - startedAt)\n await emit({\n type: 'loop-completed',\n runId: opts.runId,\n durationMs,\n })\n\n return {\n runId: opts.runId,\n baselineRunId,\n durationMs,\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 const registryOptions = {\n ...(priorFindings ? { priorFindings } : {}),\n ...(opts.chainFindings !== undefined ? { chainFindings: opts.chainFindings } : {}),\n ...(opts.costLedger ? { costLedger: opts.costLedger } : {}),\n ...(opts.costPhase ? { costPhase: opts.costPhase } : {}),\n ...(opts.signal ? { signal: opts.signal } : {}),\n }\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, registryOptions)) {\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, registryOptions)\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,SAAS,UAAoC;GACjD,OAAO,KAAK,IAAI,QAAQ;EAC1B;EAEA,MAAM,SAAS,MAAyB;GACtC,MAAM,IAAI,KAAK,IAAI,KAAK,QAAQ;GAChC,IAAI,CAAC,GAAG,OAAO,CAAC;GAChB,MAAM,UAAU,IAAI,IAAI,EAAE,MAAM,KAAK,MAAM,EAAE,OAAO,CAAC;GACrD,OAAO,KAAK,SAAS,QAAQ,OAAO,QAAQ,IAAI,EAAE,CAAC;EACrD;EAEA,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;GAKhE,IAAI,YAAY;GAChB,IAAI,QAAQ;GACZ,MAAM,QAA4B,CAAC;GACnC,MAAM,UAAoB,CAAC;GAC3B,KAAK,MAAM,KAAK,OAAO;IACrB,MAAM,EAAE,QAAQ,WAAW,MAAM,cAAc,EAAE,YAAY,GAAG;IAChE,MAAM,YAAY;KAAE,GAAG;KAAG,YAAY;IAAO;IAC7C,MAAM,OAAO,QAAQ,SAAS;IAC9B,IAAI,MAAM,SAAS,KAAK,QAAQ,OAAO,QAAQ,oBAAoB;KACjE,QAAQ,KAAK,EAAE,OAAO;KACtB;IACF;IACA,aAAa;IACb,SAAS;IACT,MAAM,KAAK,SAAS;GACtB;GACA,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,kBAAkB;IAClB,UAAU,QAAQ,SAAS;IAC3B,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,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,MAAM,OAAO,gBAAgB,MAAM,KAAK,eAAe,QAAQ,kBAAkB,IAAI,CAAC;GAC5F,MAAM,OAAO,IAAI,MAAM,GAAG,GAAG;GAC7B,OAAO;IACL,UAAU,KAAK;IACf,SAAS,KAAK;IACd;IACA,UAAU,IAAI,SAAS,KAAK;GAC9B;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;;;;AC1ZA,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,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,SAAS;CACrD,MAAM,KAAK;EACT,MAAM;EACN,OAAO,KAAK;EACZ;CACF,CAAC;CAED,OAAO;EACL,OAAO,KAAK;EACZ;EACA;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,MAAM,kBAAkB;EACtB,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;EACzC,GAAI,KAAK,kBAAkB,KAAA,IAAY,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;EAChF,GAAI,KAAK,aAAa,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;EACzD,GAAI,KAAK,YAAY,EAAE,WAAW,KAAK,UAAU,IAAI,CAAC;EACtD,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;CAC/C;CACA,IAAI,OAAO,IAAI,cAAc,cAAc,KAAK,SAAS;EACvD,IAAI,QAAiC;EACrC,WAAW,MAAM,MAAM,IAAI,UAAU,KAAK,OAAO,KAAK,QAAQ,eAAe,GAAG;GAC9E,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;AACnE;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"}