@tangle-network/agent-runtime 0.317.0 → 0.319.3

package/dist/graph-registry-BuJbzTzF.js

@@ -0,0 +1,211 @@
+import { m as ValidationError } from "./errors-DodWX-cb.js";
+import { createHash } from "node:crypto";
+import { join } from "node:path";
+import { mkdir, readFile, readdir, writeFile } from "node:fs/promises";
+//#region \0rolldown/runtime.js
+var __defProp = Object.defineProperty;
+var __exportAll = (all, no_symbols) => {
+	let target = {};
+	for (var name in all) __defProp(target, name, {
+		get: all[name],
+		enumerable: true
+	});
+	if (!no_symbols) __defProp(target, Symbol.toStringTag, { value: "Module" });
+	return target;
+};
+//#endregion
+//#region src/runtime/supervise/graph-registry.ts
+/**
+* `graph-registry` — the designer's memory: graphs and their outcomes as files.
+*
+* The AgentGraph algebra makes a graph PLAIN DATA (nodes with pinned profiles,
+* edges with registry-versioned directives, a budget, a deliverable
+* description), which is the property that lets a graph be stored, replayed
+* byte-identical, and mutated like code. This module is the thin durable layer
+* on top: one JSONL record per run, the exact graph content-addressed beside
+* it. The natural home is a SANDBOX WORKSPACE — the platform's snapshot story
+* (Firecracker restore, warm leases, `continuity: 'resume'`) then makes the
+* registry the agent's compounding execution memory across runs: a rerun over
+* the same sandbox finds every graph the designer ever ran, what each cost,
+* and whether it delivered.
+*
+* ORACLES STAY ENVIRONMENT-OWNED. `DeliverableSpec.check` is a function and is
+* deliberately NOT stored: a stored graph keeps the deliverable's `describe`
+* and an optional `checkRef`, and replay re-binds the check from the caller's
+* environment. This is the graph contract's own doctrine — graders are
+* environment, never workers — applied to persistence.
+*
+* Scoring is a documented heuristic, not a learned model: delivered beats
+* failed, then cheaper (tokens, then iterations), then most recent. A designer
+* that needs better selection replaces `pickBest`, not the records.
+*/
+var graph_registry_exports = /* @__PURE__ */ __exportAll({
+	digestOfGraph: () => digestOfGraph,
+	graphDigest: () => graphDigest,
+	graphFromStored: () => graphFromStored,
+	graphRegistry: () => graphRegistry,
+	graphRunsFor: () => graphRunsFor,
+	listGraphRuns: () => listGraphRuns,
+	loadGraph: () => loadGraph,
+	lookupGraph: () => lookupGraph,
+	pickBestGraph: () => pickBestGraph,
+	recordGraphRun: () => recordGraphRun,
+	storedGraphDigests: () => storedGraphDigests,
+	taskShapeDigest: () => taskShapeDigest
+});
+const RECORDS_FILE = "records.jsonl";
+const GRAPHS_DIR = "graphs";
+function sha256(value) {
+	return createHash("sha256").update(value).digest("hex");
+}
+/** Canonical serialization for content-addressing: stable key order, sorted. */
+function canonicalJson(value) {
+	if (Array.isArray(value)) return `[${value.map(canonicalJson).join(",")}]`;
+	if (value && typeof value === "object") return `{${Object.entries(value).filter(([, v]) => v !== void 0).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0).map(([k, v]) => `${JSON.stringify(k)}:${canonicalJson(v)}`).join(",")}}`;
+	return JSON.stringify(value);
+}
+/** Digest of the exact graph (nodes + edges + budget + deliverable describe). */
+function graphDigest(graph) {
+	return sha256(canonicalJson(graph));
+}
+/** Digest of the normalized task shape a designer looks records up by. */
+function taskShapeDigest(taskShape) {
+	return sha256(canonicalJson(taskShape));
+}
+/** Digest of a runnable graph exactly as the registry stores it — the value
+*  `recordGraphRun` demands. Callers recording real runs hash through this,
+*  never hand-rolled, so a record always matches its graph. */
+function digestOfGraph(graph) {
+	return storeGraph(graph).digest;
+}
+function storeGraph(graph) {
+	return {
+		digest: graphDigest({
+			nodes: graph.nodes,
+			edges: graph.edges,
+			budget: graph.budget,
+			deliverable: { ...graph.deliverable.describe ? { describe: graph.deliverable.describe } : {} }
+		}),
+		nodes: graph.nodes,
+		edges: graph.edges,
+		budget: graph.budget,
+		deliverable: { ...graph.deliverable.describe ? { describe: graph.deliverable.describe } : {} }
+	};
+}
+function assertRecord(record) {
+	if (typeof record.graphDigest !== "string" || record.graphDigest.length === 0) throw new ValidationError("graph-registry: record.graphDigest is required");
+	if (typeof record.taskDigest !== "string" || record.taskDigest.length === 0) throw new ValidationError("graph-registry: record.taskDigest is required");
+	if (record.outcome.kind !== "delivered" && record.outcome.kind !== "no-winner") throw new ValidationError("graph-registry: record.outcome.kind must be 'delivered' | 'no-winner'");
+}
+/** Open (or lazily create) a registry rooted at a workspace directory. The
+*  directory is the sandbox workspace; snapshots carry it across runs. */
+function graphRegistry(root) {
+	if (!root || root.trim().length === 0) throw new ValidationError("graphRegistry: root directory is required");
+	return { root };
+}
+async function recordsPath(reg) {
+	await mkdir(join(reg.root, GRAPHS_DIR), { recursive: true });
+	return join(reg.root, RECORDS_FILE);
+}
+/** Append one run record; the exact graph is content-addressed beside it.
+*  Idempotent per (taskDigest, graphDigest, startedAt): a replayed append with
+*  the same key replaces the prior row rather than duplicating it. */
+async function recordGraphRun(reg, graph, record) {
+	assertRecord(record);
+	const stored = storeGraph(graph);
+	if (stored.digest !== record.graphDigest) throw new ValidationError(`graph-registry: record.graphDigest ${record.graphDigest} does not match the supplied graph (${stored.digest}) — record the graph that actually ran`);
+	await recordsPath(reg);
+	await writeFile(join(reg.root, GRAPHS_DIR, `${stored.digest}.json`), JSON.stringify(stored), "utf8");
+	const file = join(reg.root, RECORDS_FILE);
+	let existing = [];
+	try {
+		existing = (await readFile(file, "utf8")).split("\n").filter((line) => line.trim().length > 0).map((line) => JSON.parse(line));
+	} catch {}
+	const keyed = existing.filter((row) => !(row.taskDigest === record.taskDigest && row.graphDigest === record.graphDigest && row.startedAt === record.startedAt));
+	keyed.push(record);
+	await writeFile(file, keyed.map((row) => JSON.stringify(row)).join("\n") + "\n", "utf8");
+	return stored;
+}
+/** All records, newest last. */
+async function listGraphRuns(reg) {
+	try {
+		return (await readFile(join(reg.root, RECORDS_FILE), "utf8")).split("\n").filter((line) => line.trim().length > 0).map((line) => JSON.parse(line));
+	} catch {
+		return [];
+	}
+}
+/** Records for one task shape, newest last. */
+async function graphRunsFor(reg, taskDigest) {
+	return (await listGraphRuns(reg)).filter((row) => row.taskDigest === taskDigest);
+}
+/** The documented heuristic: delivered beats failed; among delivered, cheaper
+*  (tokens, then iterations) wins; ties go to the most recent. */
+function pickBestGraph(records) {
+	const delivered = records.filter((row) => row.outcome.kind === "delivered");
+	if (delivered.length === 0) return void 0;
+	const better = (a, b) => {
+		const aTokens = a.cost.tokens ?? Number.POSITIVE_INFINITY;
+		const bTokens = b.cost.tokens ?? Number.POSITIVE_INFINITY;
+		if (aTokens !== bTokens) return aTokens < bTokens ? a : b;
+		const aIter = a.cost.iterations ?? Number.POSITIVE_INFINITY;
+		const bIter = b.cost.iterations ?? Number.POSITIVE_INFINITY;
+		if (aIter !== bIter) return aIter < bIter ? a : b;
+		return a.finishedAt >= b.finishedAt ? a : b;
+	};
+	return delivered.reduce((best, row) => better(best, row) === best ? best : row);
+}
+/** Load a stored graph by digest. */
+async function loadGraph(reg, digest) {
+	try {
+		return JSON.parse(await readFile(join(reg.root, GRAPHS_DIR, `${digest}.json`), "utf8"));
+	} catch {
+		return;
+	}
+}
+/** The designer's lookup: replay the known-good graph for this task shape, or
+*  author a new one — with the reason stated either way (the decision is data). */
+async function lookupGraph(reg, taskDigest) {
+	const records = await graphRunsFor(reg, taskDigest);
+	const best = pickBestGraph(records);
+	if (best) {
+		const graph = await loadGraph(reg, best.graphDigest);
+		if (graph) return {
+			kind: "replay",
+			graph,
+			record: best
+		};
+		return {
+			kind: "author",
+			reason: `best record's graph ${best.graphDigest.slice(0, 12)} is missing from the registry`
+		};
+	}
+	return {
+		kind: "author",
+		reason: records.length === 0 ? "first run for this task shape" : "no graph delivered for this task shape yet"
+	};
+}
+/** Rehydrate a stored graph into a runnable one. The check comes from the
+*  CALLER's environment (oracles are environment, never stored). */
+function graphFromStored(stored, check) {
+	return {
+		nodes: stored.nodes,
+		edges: stored.edges,
+		budget: stored.budget,
+		deliverable: {
+			check,
+			...stored.deliverable.describe ? { describe: stored.deliverable.describe } : {}
+		}
+	};
+}
+/** Digests present on disk (integrity probe for tests and audits). */
+async function storedGraphDigests(reg) {
+	try {
+		return (await readdir(join(reg.root, GRAPHS_DIR))).filter((name) => name.endsWith(".json")).map((name) => name.slice(0, -5)).sort();
+	} catch {
+		return [];
+	}
+}
+//#endregion
+export { graphRunsFor as a, loadGraph as c, recordGraphRun as d, storedGraphDigests as f, graphRegistry as i, lookupGraph as l, graphDigest as n, graph_registry_exports as o, taskShapeDigest as p, graphFromStored as r, listGraphRuns as s, digestOfGraph as t, pickBestGraph as u };
+
+//# sourceMappingURL=graph-registry-BuJbzTzF.js.map

package/dist/graph-registry-BuJbzTzF.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-registry-BuJbzTzF.js","names":[],"sources":["../src/runtime/supervise/graph-registry.ts"],"sourcesContent":["/**\n * `graph-registry` — the designer's memory: graphs and their outcomes as files.\n *\n * The AgentGraph algebra makes a graph PLAIN DATA (nodes with pinned profiles,\n * edges with registry-versioned directives, a budget, a deliverable\n * description), which is the property that lets a graph be stored, replayed\n * byte-identical, and mutated like code. This module is the thin durable layer\n * on top: one JSONL record per run, the exact graph content-addressed beside\n * it. The natural home is a SANDBOX WORKSPACE — the platform's snapshot story\n * (Firecracker restore, warm leases, `continuity: 'resume'`) then makes the\n * registry the agent's compounding execution memory across runs: a rerun over\n * the same sandbox finds every graph the designer ever ran, what each cost,\n * and whether it delivered.\n *\n * ORACLES STAY ENVIRONMENT-OWNED. `DeliverableSpec.check` is a function and is\n * deliberately NOT stored: a stored graph keeps the deliverable's `describe`\n * and an optional `checkRef`, and replay re-binds the check from the caller's\n * environment. This is the graph contract's own doctrine — graders are\n * environment, never workers — applied to persistence.\n *\n * Scoring is a documented heuristic, not a learned model: delivered beats\n * failed, then cheaper (tokens, then iterations), then most recent. A designer\n * that needs better selection replaces `pickBest`, not the records.\n */\n\nimport { createHash } from 'node:crypto'\nimport { mkdir, readdir, readFile, writeFile } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport { ValidationError } from '../../errors'\nimport type { AgentGraph, GraphEdge } from './graph'\n\n/** A graph as stored: every axis serializable; the check re-bound at replay. */\nexport interface StoredGraph {\n  readonly digest: string\n  readonly nodes: ReadonlyArray<{ readonly id: string; readonly profile: AgentProfile }>\n  readonly edges: ReadonlyArray<GraphEdge>\n  readonly budget: AgentGraph['budget']\n  readonly deliverable: { readonly describe?: string; readonly checkRef?: string }\n}\n\n/** One completed run of one graph, for one task shape. */\nexport interface GraphRunRecord {\n  /** Content-address of the exact graph that ran. */\n  readonly graphDigest: string\n  /** Digest of the normalized task shape the designer computed for lookup. */\n  readonly taskDigest: string\n  readonly startedAt: string\n  readonly finishedAt: string\n  readonly outcome:\n    | { readonly kind: 'delivered'; readonly summary?: string }\n    | { readonly kind: 'no-winner'; readonly reason?: string }\n  /** Cost from the run's terminal accounting. Unknown channels omitted. */\n  readonly cost: {\n    readonly iterations?: number\n    readonly tokens?: number\n    readonly usd?: number\n    readonly ms?: number\n  }\n  /** Ledger size + exhausted edges: the trace's shape, for the designer's read. */\n  readonly traversals: number\n  readonly exhaustedEdges?: ReadonlyArray<string>\n}\n\nexport interface GraphRegistryDir {\n  readonly root: string\n}\n\nconst RECORDS_FILE = 'records.jsonl'\nconst GRAPHS_DIR = 'graphs'\n\nfunction sha256(value: string): string {\n  return createHash('sha256').update(value).digest('hex')\n}\n\n/** Canonical serialization for content-addressing: stable key order, sorted. */\nfunction canonicalJson(value: unknown): string {\n  if (Array.isArray(value)) return `[${value.map(canonicalJson).join(',')}]`\n  if (value && typeof value === 'object') {\n    const entries = Object.entries(value as Record<string, unknown>)\n      .filter(([, v]) => v !== undefined)\n      .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n    return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonicalJson(v)}`).join(',')}}`\n  }\n  return JSON.stringify(value)\n}\n\n/** Digest of the exact graph (nodes + edges + budget + deliverable describe). */\nexport function graphDigest(graph: Omit<StoredGraph, 'digest'>): string {\n  return sha256(canonicalJson(graph))\n}\n\n/** Digest of the normalized task shape a designer looks records up by. */\nexport function taskShapeDigest(taskShape: Record<string, unknown>): string {\n  return sha256(canonicalJson(taskShape))\n}\n\n/** Digest of a runnable graph exactly as the registry stores it — the value\n *  `recordGraphRun` demands. Callers recording real runs hash through this,\n *  never hand-rolled, so a record always matches its graph. */\nexport function digestOfGraph(graph: AgentGraph): string {\n  return storeGraph(graph).digest\n}\n\nfunction storeGraph(graph: AgentGraph): StoredGraph {\n  return {\n    digest: graphDigest({\n      nodes: graph.nodes,\n      edges: graph.edges,\n      budget: graph.budget,\n      deliverable: {\n        ...(graph.deliverable.describe ? { describe: graph.deliverable.describe } : {}),\n      },\n    }),\n    nodes: graph.nodes,\n    edges: graph.edges,\n    budget: graph.budget,\n    deliverable: {\n      ...(graph.deliverable.describe ? { describe: graph.deliverable.describe } : {}),\n    },\n  }\n}\n\nfunction assertRecord(record: GraphRunRecord): void {\n  if (typeof record.graphDigest !== 'string' || record.graphDigest.length === 0)\n    throw new ValidationError('graph-registry: record.graphDigest is required')\n  if (typeof record.taskDigest !== 'string' || record.taskDigest.length === 0)\n    throw new ValidationError('graph-registry: record.taskDigest is required')\n  if (record.outcome.kind !== 'delivered' && record.outcome.kind !== 'no-winner')\n    throw new ValidationError(\n      \"graph-registry: record.outcome.kind must be 'delivered' | 'no-winner'\",\n    )\n}\n\n/** Open (or lazily create) a registry rooted at a workspace directory. The\n *  directory is the sandbox workspace; snapshots carry it across runs. */\nexport function graphRegistry(root: string): GraphRegistryDir {\n  if (!root || root.trim().length === 0)\n    throw new ValidationError('graphRegistry: root directory is required')\n  return { root }\n}\n\nasync function recordsPath(reg: GraphRegistryDir): Promise<string> {\n  await mkdir(join(reg.root, GRAPHS_DIR), { recursive: true })\n  return join(reg.root, RECORDS_FILE)\n}\n\n/** Append one run record; the exact graph is content-addressed beside it.\n *  Idempotent per (taskDigest, graphDigest, startedAt): a replayed append with\n *  the same key replaces the prior row rather than duplicating it. */\nexport async function recordGraphRun(\n  reg: GraphRegistryDir,\n  graph: AgentGraph,\n  record: GraphRunRecord,\n): Promise<StoredGraph> {\n  assertRecord(record)\n  const stored = storeGraph(graph)\n  if (stored.digest !== record.graphDigest) {\n    throw new ValidationError(\n      `graph-registry: record.graphDigest ${record.graphDigest} does not match the supplied graph (${stored.digest}) — record the graph that actually ran`,\n    )\n  }\n  await recordsPath(reg)\n  await writeFile(\n    join(reg.root, GRAPHS_DIR, `${stored.digest}.json`),\n    JSON.stringify(stored),\n    'utf8',\n  )\n  const file = join(reg.root, RECORDS_FILE)\n  let existing: GraphRunRecord[] = []\n  try {\n    existing = (await readFile(file, 'utf8'))\n      .split('\\n')\n      .filter((line) => line.trim().length > 0)\n      .map((line) => JSON.parse(line) as GraphRunRecord)\n  } catch {\n    // First record.\n  }\n  const keyed = existing.filter(\n    (row) =>\n      !(\n        row.taskDigest === record.taskDigest &&\n        row.graphDigest === record.graphDigest &&\n        row.startedAt === record.startedAt\n      ),\n  )\n  keyed.push(record)\n  await writeFile(file, keyed.map((row) => JSON.stringify(row)).join('\\n') + '\\n', 'utf8')\n  return stored\n}\n\n/** All records, newest last. */\nexport async function listGraphRuns(reg: GraphRegistryDir): Promise<GraphRunRecord[]> {\n  try {\n    const text = await readFile(join(reg.root, RECORDS_FILE), 'utf8')\n    return text\n      .split('\\n')\n      .filter((line) => line.trim().length > 0)\n      .map((line) => JSON.parse(line) as GraphRunRecord)\n  } catch {\n    return []\n  }\n}\n\n/** Records for one task shape, newest last. */\nexport async function graphRunsFor(\n  reg: GraphRegistryDir,\n  taskDigest: string,\n): Promise<GraphRunRecord[]> {\n  return (await listGraphRuns(reg)).filter((row) => row.taskDigest === taskDigest)\n}\n\nexport type GraphSelection =\n  | { readonly kind: 'replay'; readonly graph: StoredGraph; readonly record: GraphRunRecord }\n  | { readonly kind: 'author'; readonly reason: string }\n\n/** The documented heuristic: delivered beats failed; among delivered, cheaper\n *  (tokens, then iterations) wins; ties go to the most recent. */\nexport function pickBestGraph(records: ReadonlyArray<GraphRunRecord>): GraphRunRecord | undefined {\n  const delivered = records.filter((row) => row.outcome.kind === 'delivered')\n  if (delivered.length === 0) return undefined\n  const better = (a: GraphRunRecord, b: GraphRunRecord): GraphRunRecord => {\n    const aTokens = a.cost.tokens ?? Number.POSITIVE_INFINITY\n    const bTokens = b.cost.tokens ?? Number.POSITIVE_INFINITY\n    if (aTokens !== bTokens) return aTokens < bTokens ? a : b\n    const aIter = a.cost.iterations ?? Number.POSITIVE_INFINITY\n    const bIter = b.cost.iterations ?? Number.POSITIVE_INFINITY\n    if (aIter !== bIter) return aIter < bIter ? a : b\n    return a.finishedAt >= b.finishedAt ? a : b\n  }\n  return delivered.reduce((best, row) => (better(best, row) === best ? best : row))\n}\n\n/** Load a stored graph by digest. */\nexport async function loadGraph(\n  reg: GraphRegistryDir,\n  digest: string,\n): Promise<StoredGraph | undefined> {\n  try {\n    return JSON.parse(\n      await readFile(join(reg.root, GRAPHS_DIR, `${digest}.json`), 'utf8'),\n    ) as StoredGraph\n  } catch {\n    return undefined\n  }\n}\n\n/** The designer's lookup: replay the known-good graph for this task shape, or\n *  author a new one — with the reason stated either way (the decision is data). */\nexport async function lookupGraph(\n  reg: GraphRegistryDir,\n  taskDigest: string,\n): Promise<GraphSelection> {\n  const records = await graphRunsFor(reg, taskDigest)\n  const best = pickBestGraph(records)\n  if (best) {\n    const graph = await loadGraph(reg, best.graphDigest)\n    if (graph) return { kind: 'replay', graph, record: best }\n    return {\n      kind: 'author',\n      reason: `best record's graph ${best.graphDigest.slice(0, 12)} is missing from the registry`,\n    }\n  }\n  return {\n    kind: 'author',\n    reason:\n      records.length === 0\n        ? 'first run for this task shape'\n        : 'no graph delivered for this task shape yet',\n  }\n}\n\n/** Rehydrate a stored graph into a runnable one. The check comes from the\n *  CALLER's environment (oracles are environment, never stored). */\nexport function graphFromStored(\n  stored: StoredGraph,\n  check: AgentGraph['deliverable']['check'],\n): AgentGraph {\n  return {\n    nodes: stored.nodes,\n    edges: stored.edges,\n    budget: stored.budget,\n    deliverable: {\n      check,\n      ...(stored.deliverable.describe ? { describe: stored.deliverable.describe } : {}),\n    },\n  }\n}\n\n/** Digests present on disk (integrity probe for tests and audits). */\nexport async function storedGraphDigests(reg: GraphRegistryDir): Promise<string[]> {\n  try {\n    return (await readdir(join(reg.root, GRAPHS_DIR)))\n      .filter((name) => name.endsWith('.json'))\n      .map((name) => name.slice(0, -'.json'.length))\n      .sort()\n  } catch {\n    return []\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoEA,MAAM,eAAe;AACrB,MAAM,aAAa;AAEnB,SAAS,OAAO,OAAuB;CACrC,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,KAAK;AACxD;;AAGA,SAAS,cAAc,OAAwB;CAC7C,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,IAAI,MAAM,IAAI,aAAa,CAAC,CAAC,KAAK,GAAG,EAAE;CACxE,IAAI,SAAS,OAAO,UAAU,UAI5B,OAAO,IAHS,OAAO,QAAQ,KAAgC,CAAC,CAC7D,QAAQ,GAAG,OAAO,MAAM,KAAA,CAAS,CAAC,CAClC,MAAM,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAC/B,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,GAAG,KAAK,UAAU,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;CAE3F,OAAO,KAAK,UAAU,KAAK;AAC7B;;AAGA,SAAgB,YAAY,OAA4C;CACtE,OAAO,OAAO,cAAc,KAAK,CAAC;AACpC;;AAGA,SAAgB,gBAAgB,WAA4C;CAC1E,OAAO,OAAO,cAAc,SAAS,CAAC;AACxC;;;;AAKA,SAAgB,cAAc,OAA2B;CACvD,OAAO,WAAW,KAAK,CAAC,CAAC;AAC3B;AAEA,SAAS,WAAW,OAAgC;CAClD,OAAO;EACL,QAAQ,YAAY;GAClB,OAAO,MAAM;GACb,OAAO,MAAM;GACb,QAAQ,MAAM;GACd,aAAa,EACX,GAAI,MAAM,YAAY,WAAW,EAAE,UAAU,MAAM,YAAY,SAAS,IAAI,CAAC,EAC/E;EACF,CAAC;EACD,OAAO,MAAM;EACb,OAAO,MAAM;EACb,QAAQ,MAAM;EACd,aAAa,EACX,GAAI,MAAM,YAAY,WAAW,EAAE,UAAU,MAAM,YAAY,SAAS,IAAI,CAAC,EAC/E;CACF;AACF;AAEA,SAAS,aAAa,QAA8B;CAClD,IAAI,OAAO,OAAO,gBAAgB,YAAY,OAAO,YAAY,WAAW,GAC1E,MAAM,IAAI,gBAAgB,gDAAgD;CAC5E,IAAI,OAAO,OAAO,eAAe,YAAY,OAAO,WAAW,WAAW,GACxE,MAAM,IAAI,gBAAgB,+CAA+C;CAC3E,IAAI,OAAO,QAAQ,SAAS,eAAe,OAAO,QAAQ,SAAS,aACjE,MAAM,IAAI,gBACR,uEACF;AACJ;;;AAIA,SAAgB,cAAc,MAAgC;CAC5D,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,WAAW,GAClC,MAAM,IAAI,gBAAgB,2CAA2C;CACvE,OAAO,EAAE,KAAK;AAChB;AAEA,eAAe,YAAY,KAAwC;CACjE,MAAM,MAAM,KAAK,IAAI,MAAM,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;CAC3D,OAAO,KAAK,IAAI,MAAM,YAAY;AACpC;;;;AAKA,eAAsB,eACpB,KACA,OACA,QACsB;CACtB,aAAa,MAAM;CACnB,MAAM,SAAS,WAAW,KAAK;CAC/B,IAAI,OAAO,WAAW,OAAO,aAC3B,MAAM,IAAI,gBACR,sCAAsC,OAAO,YAAY,sCAAsC,OAAO,OAAO,uCAC/G;CAEF,MAAM,YAAY,GAAG;CACrB,MAAM,UACJ,KAAK,IAAI,MAAM,YAAY,GAAG,OAAO,OAAO,MAAM,GAClD,KAAK,UAAU,MAAM,GACrB,MACF;CACA,MAAM,OAAO,KAAK,IAAI,MAAM,YAAY;CACxC,IAAI,WAA6B,CAAC;CAClC,IAAI;EACF,YAAY,MAAM,SAAS,MAAM,MAAM,EAAA,CACpC,MAAM,IAAI,CAAC,CACX,QAAQ,SAAS,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CACxC,KAAK,SAAS,KAAK,MAAM,IAAI,CAAmB;CACrD,QAAQ,CAER;CACA,MAAM,QAAQ,SAAS,QACpB,QACC,EACE,IAAI,eAAe,OAAO,cAC1B,IAAI,gBAAgB,OAAO,eAC3B,IAAI,cAAc,OAAO,UAE/B;CACA,MAAM,KAAK,MAAM;CACjB,MAAM,UAAU,MAAM,MAAM,KAAK,QAAQ,KAAK,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,MAAM,MAAM;CACvF,OAAO;AACT;;AAGA,eAAsB,cAAc,KAAkD;CACpF,IAAI;EAEF,QAAO,MADY,SAAS,KAAK,IAAI,MAAM,YAAY,GAAG,MAAM,EAAA,CAE7D,MAAM,IAAI,CAAC,CACX,QAAQ,SAAS,KAAK,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CACxC,KAAK,SAAS,KAAK,MAAM,IAAI,CAAmB;CACrD,QAAQ;EACN,OAAO,CAAC;CACV;AACF;;AAGA,eAAsB,aACpB,KACA,YAC2B;CAC3B,QAAQ,MAAM,cAAc,GAAG,EAAA,CAAG,QAAQ,QAAQ,IAAI,eAAe,UAAU;AACjF;;;AAQA,SAAgB,cAAc,SAAoE;CAChG,MAAM,YAAY,QAAQ,QAAQ,QAAQ,IAAI,QAAQ,SAAS,WAAW;CAC1E,IAAI,UAAU,WAAW,GAAG,OAAO,KAAA;CACnC,MAAM,UAAU,GAAmB,MAAsC;EACvE,MAAM,UAAU,EAAE,KAAK,UAAU,OAAO;EACxC,MAAM,UAAU,EAAE,KAAK,UAAU,OAAO;EACxC,IAAI,YAAY,SAAS,OAAO,UAAU,UAAU,IAAI;EACxD,MAAM,QAAQ,EAAE,KAAK,cAAc,OAAO;EAC1C,MAAM,QAAQ,EAAE,KAAK,cAAc,OAAO;EAC1C,IAAI,UAAU,OAAO,OAAO,QAAQ,QAAQ,IAAI;EAChD,OAAO,EAAE,cAAc,EAAE,aAAa,IAAI;CAC5C;CACA,OAAO,UAAU,QAAQ,MAAM,QAAS,OAAO,MAAM,GAAG,MAAM,OAAO,OAAO,GAAI;AAClF;;AAGA,eAAsB,UACpB,KACA,QACkC;CAClC,IAAI;EACF,OAAO,KAAK,MACV,MAAM,SAAS,KAAK,IAAI,MAAM,YAAY,GAAG,OAAO,MAAM,GAAG,MAAM,CACrE;CACF,QAAQ;EACN;CACF;AACF;;;AAIA,eAAsB,YACpB,KACA,YACyB;CACzB,MAAM,UAAU,MAAM,aAAa,KAAK,UAAU;CAClD,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,MAAM;EACR,MAAM,QAAQ,MAAM,UAAU,KAAK,KAAK,WAAW;EACnD,IAAI,OAAO,OAAO;GAAE,MAAM;GAAU;GAAO,QAAQ;EAAK;EACxD,OAAO;GACL,MAAM;GACN,QAAQ,uBAAuB,KAAK,YAAY,MAAM,GAAG,EAAE,EAAE;EAC/D;CACF;CACA,OAAO;EACL,MAAM;EACN,QACE,QAAQ,WAAW,IACf,kCACA;CACR;AACF;;;AAIA,SAAgB,gBACd,QACA,OACY;CACZ,OAAO;EACL,OAAO,OAAO;EACd,OAAO,OAAO;EACd,QAAQ,OAAO;EACf,aAAa;GACX;GACA,GAAI,OAAO,YAAY,WAAW,EAAE,UAAU,OAAO,YAAY,SAAS,IAAI,CAAC;EACjF;CACF;AACF;;AAGA,eAAsB,mBAAmB,KAA0C;CACjF,IAAI;EACF,QAAQ,MAAM,QAAQ,KAAK,IAAI,MAAM,UAAU,CAAC,EAAA,CAC7C,QAAQ,SAAS,KAAK,SAAS,OAAO,CAAC,CAAC,CACxC,KAAK,SAAS,KAAK,MAAM,GAAG,EAAe,CAAC,CAAC,CAC7C,KAAK;CACV,QAAQ;EACN,OAAO,CAAC;CACV;AACF"}

package/dist/{improvement-cycle-D7yR6GC2.js → improvement-cycle-xnQwUaC3.js}

@@ -1,12 +1,12 @@
-import { Nt as createExecutor, Tr as runAbortable, _i as terminateProcessTreeAndConfirm, ai as runSettledCommand, ta as detachedSnapshot, wr as linkAbort } from "./supervisor-CbFyf48U.js";
+import { Nt as createExecutor, Tr as runAbortable, aa as detachedSnapshot, bi as terminateProcessTreeAndConfirm, ci as runSettledCommand, wr as linkAbort } from "./supervisor-Cqhu3xH-.js";
 import { i as ConfigError } from "./errors-DodWX-cb.js";
-import { E as defaultStructuralRolloutPolicy, Q as streamAgentTurn, Y as optimizerMethod, Z as collectAgentTurn, a as reconcileInterruptedSearchCalls, b as improveSearchCost, c as searchExecutor, d as taggedLedger, i as isSearchEnvironmentFault, n as assertSearchLanes, s as searchCallTags, v as decideClosedSearch } from "./search-executor-B5ZVFsDV.js";
-import { I as immutableCandidateValue, L as omitTopLevelDigest, M as canonicalCandidateDigest$1, N as canonicalCandidateDocument, R as sha256Bytes$1, bt as armDeadlineTimer, j as canonicalCandidateBytes$1, z as verifyCanonicalCandidateDocument } from "./workspace-streams-DkijayqX.js";
-import { a as concreteProfileModel, t as assertExecutableAgentProfile } from "./model-policy-DhvyZ8-O.js";
+import { E as defaultStructuralRolloutPolicy, Q as streamAgentTurn, Y as optimizerMethod, Z as collectAgentTurn, a as reconcileInterruptedSearchCalls, b as improveSearchCost, c as searchExecutor, d as taggedLedger, i as isSearchEnvironmentFault, n as assertSearchLanes, s as searchCallTags, v as decideClosedSearch } from "./search-executor-DlaLafvy.js";
+import { B as verifyCanonicalCandidateDocument, L as immutableCandidateValue, M as canonicalCandidateBytes$1, N as canonicalCandidateDigest$1, P as canonicalCandidateDocument, R as omitTopLevelDigest, xt as armDeadlineTimer, z as sha256Bytes$1 } from "./workspace-streams-DFAhW7hF.js";
+import { a as concreteProfileModel, t as assertExecutableAgentProfile } from "./model-policy-CNe257pB.js";
 import { i as syncDurableDirectory, r as publishExclusiveDurableFile } from "./durable-file-DWQA4ooo.js";
 import { t as runAnalystLoop } from "./analyst-loop-DZw5QWT9.js";
-import { c as executePreparedAgentCandidate, o as verifiedResourceTextByDigest, s as verifyAgentCandidateBundle, t as prepareAgentCandidateExecution } from "./prepare-CD9kR0gS.js";
-import { a as assertCandidateProfileBinding, c as createAgentCandidateProfileActivation, d as omitUndefinedObjectFields, f as parseAgentCandidateProfileActivation, i as applyExactAgentProfileDiff, p as parseExactAgentProfile, r as agentCandidateProfileAsAgentProfile, u as materializeAgentCandidateProfilePlan } from "./profile-CHXYmpGd.js";
+import { c as executePreparedAgentCandidate, o as verifiedResourceTextByDigest, s as verifyAgentCandidateBundle, t as prepareAgentCandidateExecution } from "./prepare-DjCLEN-q.js";
+import { a as assertCandidateProfileBinding, c as createAgentCandidateProfileActivation, d as omitUndefinedObjectFields, f as parseAgentCandidateProfileActivation, i as applyExactAgentProfileDiff, p as parseExactAgentProfile, r as agentCandidateProfileAsAgentProfile, u as materializeAgentCandidateProfilePlan } from "./profile-DmVM4Gxb.js";
 import { AGENT_IMPROVEMENT_SOURCE_METADATA_KEY, agentCandidateMaterializationReceiptSchema, agentCandidateRunReceiptSchema, agentImprovementActivationSchema, agentImprovementProposalSchema, agentImprovementReviewSchema, agentImprovementSourceMetadata, agentImprovementSourceSchema, agentProfileDiffSchema, agentProfileEnvironmentSchema, agentProfileImprovementArmSchema, agentProfileImprovementExecutionRefSchema, agentProfileModelHintsSchema, agentProfileSchema, agentProfileTrainingSchema, agentTrainingDatasetIdentitySchema, agentTrainingParametersSchema, agentTrainingReceiptSchema, agentTrainingTaskKey, agentTrainingTaskSchema, applyAgentProfileDiff, candidateExecutionEvidenceSchema, canonicalAgentProfileDigest, canonicalCandidateBytes, changedProfileImprovementSurfaces, defineAgentProfileDiff, diffAgentProfiles, numbersApproximatelyEqual, sha256DigestSchema, snapshotAgentProfile, trainedModelIdForArtifact } from "@tangle-network/agent-interface";
 import { CostLedger, canonicalJson, makeProposalFinding } from "@tangle-network/agent-eval";
 import { createHash, randomUUID } from "node:crypto";
@@ -4221,4 +4221,4 @@ function sameOrderedValues(left, right) {
 //#endregion
 export { commandVerifier as $, agentImprovementTargetInput as A, assertCandidateValidator as B, optimizationActivationReceiptFromMetadata as C, agentImprovementProfileSurfaceDigest as D, agentImprovementProfileDiffs as E, isAgentImprovementProfileSurface as F, rawTraceDistiller as G, parseExecutionRef as H, isAgentProfileMeasuredSurface as I, normalizeRolloutPolicy as J, ROLLOUT_POLICY_EXTENSION as K, improve as L, agentProfileImprovementStateDigest as M, assertProfileImprovementTargetsShareIdentity as N, agentImprovementProfileSurfaceInput as O, buildAgentImprovementActivationTargets as P, agenticGenerator as Q, createCommandProfileTrainer as R, createOptimizationActivationReceipt as S, AGENT_PROFILE_MEASURED_SURFACES as T, privateValuePaths as U, assertProfileTrainingIsHeldOut as V, withMethodRuntimeControls as W, serializeRolloutPolicy as X, parseRolloutPolicy as Y, structuralRolloutPolicyFromProfile as Z, profilePolicyWithBudget as _, executeAgentCandidateExperimentCell as a, profileTaskScenarioIdentity as b, requireSealedCandidateExperiment as c, verifyAgentImprovementActivation as d, defaultBuildPrompt as et, verifyAgentImprovementProposal as f, profileImprovementMetadata as g, createProfileImprovementCostLedger as h, createAgentImprovementProposal as i, agentImprovementTargetProfileDiffs as j, agentImprovementTargetDigest as k, reviewAgentImprovementProposal as l, verifyCandidateExecutionEvidence as m, createAgentImprovementActivation as n, proposeAgentImprovement as o, verifyAgentImprovementReview as p, applyRolloutPolicyToProfile as q, createAgentImprovementMeasuredComparison as r, proposeAgentProfileImprovement as s, AgentCandidateExperimentCellExecutionError as t, runAgentCandidateExperiment as u, profilePreparationAccounting as v, AGENT_IMPROVEMENT_PROFILE_SURFACES as w, sealProfileImprovementBenchmark as x, profileStateDigest as y, searchMethod as z };
 
-//# sourceMappingURL=improvement-cycle-D7yR6GC2.js.map
+//# sourceMappingURL=improvement-cycle-xnQwUaC3.js.map