effect-agent 0.1.0-beta.85 → 0.1.0-beta.87

package/dist/compaction-C2OTceKw.mjs

@@ -0,0 +1,505 @@
+import { Prompt } from "effect/unstable/ai";
+import { Option, Schema } from "effect";
+//#region src/engine/internal/provider-result-staging.ts
+const MAX_JSON_DEPTH = 128;
+const FailedSnapshot = Symbol("@effect-agent/engine/FailedProviderResultSnapshot");
+/**
+* @internal Normalize one untrusted JSON value into an owned, frozen snapshot while counting the
+* exact UTF-8 bytes of that same snapshot. The traversal never invokes `toJSON` or accessors,
+* rejects non-plain objects and excessive nesting, and stops as soon as the byte budget is spent.
+*/
+const snapshotJson = (root, maxBytes, maxDepth, rejectNonFiniteNumbers) => {
+	if (!Number.isSafeInteger(maxBytes) || maxBytes < 0 || !Number.isSafeInteger(maxDepth) || maxDepth < 0) return;
+	let total = 0;
+	const ancestors = /* @__PURE__ */ new WeakSet();
+	const add = (bytes) => {
+		if (bytes > maxBytes - total) return false;
+		total += bytes;
+		return true;
+	};
+	const addString = (value) => {
+		if (!add(2)) return false;
+		for (let index = 0; index < value.length; index += 1) {
+			const code = value.charCodeAt(index);
+			if (code === 34 || code === 92) {
+				if (!add(2)) return false;
+			} else if (code <= 31) {
+				if (!add(code >= 8 && code <= 13 && code !== 11 ? 2 : 6)) return false;
+			} else if (code <= 127) {
+				if (!add(1)) return false;
+			} else if (code <= 2047) {
+				if (!add(2)) return false;
+			} else if (code >= 55296 && code <= 56319) {
+				const low = value.charCodeAt(index + 1);
+				if (low >= 56320 && low <= 57343) {
+					if (!add(4)) return false;
+					index += 1;
+				} else if (!add(6)) return false;
+			} else if (code >= 56320 && code <= 57343) {
+				if (!add(6)) return false;
+			} else if (!add(3)) return false;
+		}
+		return true;
+	};
+	const visit = (value, depth) => {
+		if (depth > maxDepth) return FailedSnapshot;
+		if (value === null) return add(4) ? null : FailedSnapshot;
+		switch (typeof value) {
+			case "string": return addString(value) ? value : FailedSnapshot;
+			case "boolean": return add(value ? 4 : 5) ? value : FailedSnapshot;
+			case "number": {
+				if (!Number.isFinite(value)) return rejectNonFiniteNumbers ? FailedSnapshot : add(4) ? null : FailedSnapshot;
+				const encoded = JSON.stringify(value);
+				return encoded !== void 0 && add(encoded.length) ? value : FailedSnapshot;
+			}
+			case "object": {
+				if (ancestors.has(value)) return FailedSnapshot;
+				const isArray = Array.isArray(value);
+				const prototype = Object.getPrototypeOf(value);
+				if (prototype !== (isArray ? Array.prototype : Object.prototype) && prototype !== null) return FailedSnapshot;
+				if (Object.getOwnPropertyDescriptor(value, "toJSON") !== void 0 || prototype !== null && Object.getOwnPropertyDescriptor(prototype, "toJSON") !== void 0) return FailedSnapshot;
+				ancestors.add(value);
+				try {
+					if (isArray) {
+						const lengthDescriptor = Object.getOwnPropertyDescriptor(value, "length");
+						if (lengthDescriptor === void 0 || !("value" in lengthDescriptor) || typeof lengthDescriptor.value !== "number" || !Number.isSafeInteger(lengthDescriptor.value) || lengthDescriptor.value < 0) return FailedSnapshot;
+						if (!add(1)) return FailedSnapshot;
+						const snapshot = [];
+						for (let index = 0; index < lengthDescriptor.value; index += 1) {
+							if (index > 0 && !add(1)) return FailedSnapshot;
+							const descriptor = Object.getOwnPropertyDescriptor(value, index);
+							if (descriptor === void 0) {
+								if (!add(4)) return FailedSnapshot;
+								snapshot.push(null);
+								continue;
+							}
+							if (!("value" in descriptor)) return FailedSnapshot;
+							const item = visit(descriptor.value, depth + 1);
+							if (item === FailedSnapshot) return FailedSnapshot;
+							snapshot.push(item);
+						}
+						if (!add(1)) return FailedSnapshot;
+						Object.setPrototypeOf(snapshot, null);
+						return Object.freeze(snapshot);
+					}
+					if (!add(1)) return FailedSnapshot;
+					const entries = [];
+					let first = true;
+					for (const key in value) {
+						const descriptor = Object.getOwnPropertyDescriptor(value, key);
+						if (descriptor === void 0 || !descriptor.enumerable) continue;
+						if (!("value" in descriptor)) return FailedSnapshot;
+						if (!first && !add(1)) return FailedSnapshot;
+						first = false;
+						if (!addString(key) || !add(1)) return FailedSnapshot;
+						const item = visit(descriptor.value, depth + 1);
+						if (item === FailedSnapshot) return FailedSnapshot;
+						entries.push([key, item]);
+					}
+					if (!add(1)) return FailedSnapshot;
+					const snapshot = Object.fromEntries(entries);
+					Object.setPrototypeOf(snapshot, null);
+					return Object.freeze(snapshot);
+				} finally {
+					ancestors.delete(value);
+				}
+			}
+			case "bigint":
+			case "function":
+			case "symbol":
+			case "undefined": return FailedSnapshot;
+		}
+		return FailedSnapshot;
+	};
+	try {
+		const value = visit(root, 0);
+		return value === FailedSnapshot ? void 0 : {
+			value,
+			bytes: total
+		};
+	} catch {
+		return;
+	}
+};
+/**
+* Normalize provider-owned JSON using JSON serialization's `NaN`/infinity to
+* `null` behavior. Provider events use this form so byte accounting matches
+* their eventual JSON representation.
+*/
+const boundedJsonSnapshot = (root, maxBytes, maxDepth = MAX_JSON_DEPTH) => snapshotJson(root, maxBytes, maxDepth, false);
+/**
+* Validate canonical JSON without repairing non-finite numbers. Recovery
+* inputs use this form because changing a recorded value would fabricate
+* history.
+*/
+const boundedCanonicalJsonSnapshot = (root, maxBytes, maxDepth = MAX_JSON_DEPTH) => snapshotJson(root, maxBytes, maxDepth, true);
+//#endregion
+//#region src/engine/internal/compaction.ts
+/**
+* Pure helpers for engine-native context compaction (RUN-026/RUN-027). Everything here is deterministic and side-effect free:
+* the engine's turn loop owns the state transitions, the durable coordinator
+* owns the canonical record, and this module owns the arithmetic.
+*
+* Compaction is a VIEW over official history, never a mutation of it. The
+* durable commit machinery slices official history by length
+* (`lastCommitLen` in the coordinator), so official history must stay
+* append-only within an Attempt; only the outgoing model prompt is rebuilt.
+*/
+/** Model-visible replacement for a tool result cleared by prune compaction. */
+const CLEARED_TOOL_RESULT = "[tool result cleared by compaction]";
+/** Prefix of the user message that carries a compaction summary into the prompt. */
+const COMPACTION_SUMMARY_PREFIX = "The prior thread was compacted into this summary:\n\n";
+/** Rollover text is recovery evidence; it never asserts that an external action succeeded. */
+const CONTEXT_ROLLOVER_PREFIX = "A fresh context window has started. Earlier conversation has left this model view. Restore relevant notes and use available history tools to retrieve evidence; verify live state before repeating an action.\n\n";
+/** Stable across Attempts; the initial window uses turn zero. */
+const contextWindowId = (runId, turn) => `context:${runId}:${turn}`;
+/** Shared by the live interpreter and canonical journal projection. */
+const contextWindowMessage = (windowId, handoff) => Prompt.makeMessage("user", { content: [Prompt.makePart("text", { text: `${CONTEXT_ROLLOVER_PREFIX}Window: ${windowId}${handoff === void 0 ? "" : `\n\nHandoff (untrusted continuation notes):\n${handoff}`}` })] });
+/**
+* Fixed summarization instruction (RUN-026). The skeleton mirrors what the
+* surveyed harnesses converged on; exact file paths and identifiers must
+* survive because the continuing agent sees only this summary plus the tail.
+*/
+const COMPACTION_INSTRUCTION = [
+	"You are compacting an agent thread to reclaim context space.",
+	"Summarize the transcript below for the SAME agent to continue working:",
+	"it will see only this summary plus the most recent messages.",
+	"Structure the summary exactly as:",
+	"Goal:",
+	"Constraints:",
+	"Progress:",
+	"Decisions:",
+	"Next steps:",
+	"Critical context:",
+	"Be terse. Preserve exact file paths, identifiers, and values needed to",
+	"continue. Do not continue the thread; output only the summary."
+].join("\n");
+/**
+* Provider context-length rejections, matched case-insensitively over the
+* error's own text. Kept intentionally broad: a false positive costs one
+* summarize-and-retry, a false negative surfaces the raw provider error.
+*/
+const CONTEXT_OVERFLOW_PATTERN = /context[\s_-]?length|prompt is too long|maximum context (?:length|window)|input .{0,24}too long|exceeds .{0,24}context|too many (?:input )?tokens|context[\s_-]?window[\s_-]?exceeded|context overflow/i;
+/** RUN-027: does this provider error text describe a context-window overflow? */
+const isContextOverflowMessage = (text) => CONTEXT_OVERFLOW_PATTERN.test(text);
+const utf8Length = (text) => {
+	let bytes = text.length;
+	for (let index = 0; index < text.length; index++) {
+		const codeUnit = text.charCodeAt(index);
+		if (codeUnit <= 127) continue;
+		if (codeUnit <= 2047) {
+			bytes++;
+			continue;
+		}
+		if (codeUnit >= 55296 && codeUnit <= 56319 && index + 1 < text.length) {
+			const next = text.charCodeAt(index + 1);
+			if (next >= 56320 && next <= 57343) {
+				bytes += 2;
+				index++;
+				continue;
+			}
+		}
+		bytes += 2;
+	}
+	return bytes;
+};
+/**
+* Deterministic UTF-8 bytes/4 token estimate over one message's structural JSON.
+* Conservative for prose, slightly generous for dense JSON — the estimate
+* only gates WHEN to compact, never what is preserved.
+*/
+const estimateMessageTokens = (message) => {
+	let text;
+	try {
+		text = JSON.stringify(message);
+	} catch {
+		text = void 0;
+	}
+	return text === void 0 ? 0 : Math.ceil(utf8Length(text) / 4);
+};
+/** Sum of `estimateMessageTokens` over a message array. */
+const estimatePromptTokens = (messages, estimate = estimateMessageTokens) => {
+	let total = 0;
+	for (const message of messages) total += estimate(message);
+	return total;
+};
+const isTokenEstimate = Schema.is(Schema.Natural);
+/** Validate each replacement at the Effect caller's boundary without throwing from arithmetic. */
+const evaluateMessageTokenEstimates = (override, operation) => {
+	let valid = true;
+	const value = operation((message) => {
+		const replacement = override?.(message);
+		const estimate = replacement === void 0 ? estimateMessageTokens(message) : replacement;
+		if (!isTokenEstimate(estimate)) valid = false;
+		return estimate;
+	});
+	return valid ? Option.some(value) : Option.none();
+};
+/** Fresh compaction state for a new Run. */
+const initialCompactionState = () => ({
+	protectedStart: -1,
+	protectedEnd: -1,
+	clearedThrough: 0,
+	replacement: void 0,
+	lastCompactionTurn: 0,
+	overflowRetryTurn: 0,
+	lastViewLength: -1
+});
+const isProtected = (state, source, index) => {
+	if (state.protectSystemMessages && source[index]?.role === "system") return true;
+	if (state.protectedStart >= 0) return index >= state.protectedStart && index < state.protectedEnd;
+	return source[index]?.role === "system";
+};
+const clearedToolMessage = (message) => {
+	if (message.role !== "tool" || typeof message.content === "string") return message;
+	return Prompt.makeMessage("tool", { content: message.content.map((part) => part.type === "tool-result" ? Prompt.makePart("tool-result", {
+		id: part.id,
+		name: part.name,
+		result: CLEARED_TOOL_RESULT,
+		isFailure: part.isFailure,
+		providerExecuted: part.providerExecuted
+	}) : part) });
+};
+const renderMessage = (state, message, index) => index < state.clearedThrough && message.role === "tool" ? clearedToolMessage(message) : message;
+const summaryMessage = (summary) => Prompt.makeMessage("user", { content: [Prompt.makePart("text", { text: `${COMPACTION_SUMMARY_PREFIX}${summary}` })] });
+/**
+* Build the model-visible view of the source prompt under the current
+* compaction state: protected block in place, covered span replaced by the
+* summary message, old tool results cleared. Identity when no compaction has
+* happened.
+*/
+const buildCompactedView = (source, state) => {
+	if (state.replacement === void 0 && state.clearedThrough === 0) return source;
+	const view = [];
+	if (state.replacement !== void 0 && state.replacement.through > 0) {
+		const protectedStart = state.protectedStart >= 0 && !state.protectSystemMessages ? state.protectedStart : 0;
+		const protectedEnd = state.protectedStart >= 0 && !state.protectSystemMessages ? state.protectedEnd : state.replacement?.through ?? 0;
+		for (let index = protectedStart; index < Math.min(protectedEnd, state.replacement?.through ?? 0, source.length); index += 1) {
+			const message = source[index];
+			if (message !== void 0 && isProtected(state, source, index)) view.push(renderMessage(state, message, index));
+		}
+		view.push(state.replacement.kind === "summarize" ? summaryMessage(state.replacement.summary) : contextWindowMessage(state.replacement.windowId, state.replacement.handoff));
+		for (let index = state.replacement?.through ?? 0; index < source.length; index += 1) {
+			const message = source[index];
+			if (message !== void 0) view.push(renderMessage(state, message, index));
+		}
+		return view;
+	}
+	for (let index = 0; index < source.length; index += 1) {
+		const message = source[index];
+		if (message !== void 0) view.push(renderMessage(state, message, index));
+	}
+	return view;
+};
+/**
+* Prune selection: the new `clearedThrough` bound. Walks tool messages
+* newest→oldest, always protecting the most recent tool message (the model
+* has not reacted to it yet), then protecting older ones while their
+* estimates fit inside `keepRecentTokens`. If the whole view exceeds `targetTokens`,
+* clear more older results until it fits or only the newest result remains.
+* Replaced messages consume no retention budget. Never decreases the bound.
+*/
+const choosePruneBound = (source, state, keepRecentTokens, targetTokens, estimate = estimateMessageTokens) => {
+	const toolIndices = [];
+	for (let index = 0; index < source.length; index += 1) if (index >= (state.replacement?.through ?? 0) && source[index]?.role === "tool" && !isProtected(state, source, index)) toolIndices.push(index);
+	if (toolIndices.length <= 1) return state.clearedThrough;
+	let budget = keepRecentTokens;
+	let newestCleared = -1;
+	for (let position = toolIndices.length - 1; position >= 0; position -= 1) {
+		const index = toolIndices[position];
+		if (index === void 0) continue;
+		const message = source[index];
+		if (message === void 0) continue;
+		if (position === toolIndices.length - 1) {
+			budget -= estimate(message);
+			continue;
+		}
+		const cost = estimate(message);
+		if (budget - cost >= 0 && index >= state.clearedThrough) {
+			budget -= cost;
+			continue;
+		}
+		newestCleared = index;
+		break;
+	}
+	let through = newestCleared === -1 ? state.clearedThrough : Math.max(state.clearedThrough, newestCleared + 1);
+	if (targetTokens === void 0) return through;
+	let estimated = estimatePromptTokens(buildCompactedView(source, {
+		...state,
+		clearedThrough: through
+	}), estimate);
+	for (let position = 0; position < toolIndices.length - 1 && estimated > targetTokens; position += 1) {
+		const index = toolIndices[position];
+		if (index === void 0 || index < through) continue;
+		const message = source[index];
+		if (message === void 0) continue;
+		through = index + 1;
+		estimated -= estimate(message) - estimate(clearedToolMessage(message));
+	}
+	return through;
+};
+/**
+* Summarize selection: the source cut index `C` — messages `[0, C)` outside
+* the protected block fold into the summary; `[C, …)` is the kept tail.
+* Walks newest→oldest accumulating view estimates until `keepRecentTokens`
+* is retained, then moves the cut down so no tool message is separated from
+* the assistant message that declared its calls.
+*/
+const chooseSummarizeCut = (source, state, keepRecentTokens, estimate = estimateMessageTokens) => {
+	let kept = 0;
+	let cut = 0;
+	for (let index = source.length - 1; index >= 0; index -= 1) {
+		const message = source[index];
+		if (message === void 0) continue;
+		kept += estimate(renderMessage(state, message, index));
+		if (kept >= keepRecentTokens) {
+			cut = index;
+			break;
+		}
+	}
+	while (cut > 0 && source[cut]?.role === "tool") cut -= 1;
+	return Math.max(cut, state.replacement?.through ?? 0);
+};
+/**
+* The messages a cut NEWLY covers — from the prior replacement boundary to the
+* cut, protected block excluded, in order. Starting at the replacement boundary
+* keeps repeated compactions incremental: the previously covered span lives
+* on only through the previous summary, never as resubmitted raw history.
+*/
+const collectCoveredMessages = (source, state, cut) => {
+	const covered = [];
+	for (let index = Math.max(0, state.replacement?.through ?? 0); index < cut && index < source.length; index += 1) {
+		const message = source[index];
+		if (message !== void 0 && !isProtected(state, source, index)) covered.push(message);
+	}
+	return covered;
+};
+const SUMMARY_TOOL_RESULT_CLIP = 2e3;
+const jsonPreview = (value, limit) => {
+	if (typeof value === "string") return JSON.stringify(value.slice(0, limit)).slice(0, limit);
+	const snapshot = boundedCanonicalJsonSnapshot(value, limit);
+	return snapshot === void 0 ? "[omitted oversized or unsupported JSON]" : JSON.stringify(snapshot.value);
+};
+const partText = (part) => {
+	if (typeof part === "string") return part;
+	switch (part.type) {
+		case "text": return part.text;
+		case "reasoning": return "";
+		case "tool-call": return `[tool call ${part.name.slice(0, 500)} ${jsonPreview(part.params, 500)}]`;
+		case "tool-result": return `[tool result ${part.name.slice(0, 500)}: ${jsonPreview(part.result, SUMMARY_TOOL_RESULT_CLIP)}]`;
+		default: return `[${part.type}]`;
+	}
+};
+/**
+* Character budget for the complete default summarizer request, including
+* its instruction, transcript delimiters, previous summary, and elision marker.
+*/
+const SUMMARY_INPUT_BUDGET = 8e4;
+const SUMMARY_MAX_LENGTH = 65536;
+const SUMMARY_REQUEST_PREFIX = `${COMPACTION_INSTRUCTION}\n\n<transcript>\n`;
+const SUMMARY_REQUEST_SUFFIX = "\n</transcript>";
+const SUMMARY_MESSAGE_CLIP = 2e3;
+const SUMMARY_ELISION_RESERVE = 128;
+const summaryBlock = (message) => {
+	let text = "";
+	if (typeof message.content === "string") text = message.content.slice(0, 2001);
+	else for (const part of message.content) {
+		const piece = partText(part);
+		if (piece.length === 0) continue;
+		if (text.length > 0) text += "\n";
+		text += piece.slice(0, 2001 - text.length);
+		if (text.length > SUMMARY_MESSAGE_CLIP) break;
+	}
+	if (text.length === 0) return "";
+	return `[${message.role}]\n${text.length > SUMMARY_MESSAGE_CLIP ? `${text.slice(0, SUMMARY_MESSAGE_CLIP)}…` : text}`;
+};
+/**
+* Deterministic emergency input record, not a progress summary. Keep recent user inputs and
+* the last, as-yet-unconsumed Tool batch. Clip before rendering large payloads, identify Tool
+* calls for archive lookup, and never recursively copy earlier recovery records.
+*/
+const buildRolloverHandoff = (source, state, targetTokens, through = source.length, estimate = estimateMessageTokens) => {
+	const protectedTokens = estimatePromptTokens(source.filter((_, index) => index >= through || isProtected(state, source, index)), estimate);
+	const maxChars = Math.min(5e3, Math.max(0, Math.floor(((targetTokens ?? 1e4) - protectedTokens - 200) * 2)));
+	if (maxChars < 160) return void 0;
+	const blocks = [];
+	let length = 0;
+	const start = state.replacement?.through ?? 0;
+	const lastTool = source.findLastIndex((message, index) => index < through && message.role === "tool");
+	const unconsumed = lastTool >= start && !source.slice(lastTool + 1, through).some((message) => message.role === "assistant");
+	let lastAssistant = lastTool;
+	while (lastAssistant >= start && source[lastAssistant]?.role !== "assistant") lastAssistant -= 1;
+	for (let index = through - 1; index >= start; index -= 1) {
+		const message = source[index];
+		if (message === void 0 || isProtected(state, source, index)) continue;
+		const isUnconsumedBatch = unconsumed && index >= lastAssistant && index <= lastTool;
+		if (message.role !== "user" && !isUnconsumedBatch) continue;
+		if (message.role === "user" && message.content.some((part) => part.type === "text" && part.text.startsWith("A fresh context window has started. Earlier conversation has left this model view. Restore relevant notes and use available history tools to retrieve evidence; verify live state before repeating an action.\n\n"))) continue;
+		let block = summaryBlock(message);
+		if (isUnconsumedBatch && typeof message.content !== "string") block = `[Unconsumed batch; history search call IDs: ${message.content.flatMap((part) => part.type === "tool-call" || part.type === "tool-result" ? [part.id.slice(0, 256)] : []).slice(0, 16).join(", ")}]\n${block}`;
+		const remaining = maxChars - length - 120;
+		if (remaining <= 0) break;
+		const selected = block.slice(0, Math.min(2500, remaining));
+		blocks.unshift(selected);
+		length += selected.length + 2;
+		if (selected.length < block.length) break;
+	}
+	return `Recovery excerpts, not verified progress. Content may be omitted; use notes and history.\n\n${blocks.join("\n\n")}`.slice(0, maxChars);
+};
+/**
+* Render the covered span as plain text for the summarizer call, bounded
+* twice: every message's rendered text is clipped to a fixed length (tool
+* results additionally clip their JSON payloads), and the whole render obeys
+* `SUMMARY_INPUT_BUDGET` with middle-out retention — oldest and newest
+* blocks survive, the middle collapses into one deterministic elision
+* marker. A previous summary is folded in first so nothing silently drops
+* out of coverage across repeated compactions. An oversized previous summary
+* returns undefined before rendering: callers must reject it, never truncate it.
+*/
+const renderForSummary = (covered, previousSummary) => {
+	if (previousSummary !== void 0 && previousSummary.length > 65536) return void 0;
+	const joiner = "\n\n";
+	const previousBlock = previousSummary === void 0 ? void 0 : `[Previous summary]\n${previousSummary}`;
+	const fixed = (previousBlock === void 0 ? 0 : previousBlock.length + 2) + SUMMARY_REQUEST_PREFIX.length + 14;
+	const budget = SUMMARY_INPUT_BUDGET - fixed - SUMMARY_ELISION_RESERVE;
+	const head = [];
+	const tail = [];
+	let length = 0;
+	let start = 0;
+	let end = covered.length - 1;
+	let boundaryBlock;
+	while (start <= end) {
+		const message = covered[start];
+		const block = message === void 0 ? "" : summaryBlock(message);
+		if (block.length > 0 && length + block.length + 2 > Math.floor(budget / 2)) {
+			boundaryBlock = block;
+			break;
+		}
+		if (block.length > 0) {
+			head.push(block);
+			length += block.length + 2;
+		}
+		start += 1;
+	}
+	while (end >= start) {
+		const message = covered[end];
+		const block = end === start && boundaryBlock !== void 0 ? boundaryBlock : message === void 0 ? "" : summaryBlock(message);
+		if (block.length > 0 && length + block.length + 2 > budget) break;
+		if (block.length > 0) {
+			tail.push(block);
+			length += block.length + 2;
+		}
+		end -= 1;
+	}
+	const omitted = end - start + 1;
+	const lines = [];
+	if (previousBlock !== void 0) lines.push(previousBlock);
+	lines.push(...head);
+	if (omitted > 0) lines.push(`[… ${omitted} messages omitted from summary input …]`);
+	lines.push(...tail.reverse());
+	return lines.join(joiner);
+};
+//#endregion
+export { initialCompactionState as _, SUMMARY_REQUEST_PREFIX as a, boundedCanonicalJsonSnapshot as b, buildRolloverHandoff as c, collectCoveredMessages as d, contextWindowId as f, evaluateMessageTokenEstimates as g, estimatePromptTokens as h, SUMMARY_MAX_LENGTH as i, choosePruneBound as l, estimateMessageTokens as m, COMPACTION_SUMMARY_PREFIX as n, SUMMARY_REQUEST_SUFFIX as o, contextWindowMessage as p, CONTEXT_ROLLOVER_PREFIX as r, buildCompactedView as s, CLEARED_TOOL_RESULT as t, chooseSummarizeCut as u, isContextOverflowMessage as v, boundedJsonSnapshot as x, renderForSummary as y };
+
+//# sourceMappingURL=compaction-C2OTceKw.mjs.map

package/dist/compaction-C2OTceKw.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"compaction-C2OTceKw.mjs","names":[],"sources":["../src/engine/internal/provider-result-staging.ts","../src/engine/internal/compaction.ts"],"sourcesContent":["import type { Schema } from \"effect\";\n\nconst MAX_JSON_DEPTH = 128;\n\nexport interface BoundedJsonSnapshot {\n  readonly value: Schema.Json;\n  readonly bytes: number;\n}\n\nconst FailedSnapshot = Symbol(\"@effect-agent/engine/FailedProviderResultSnapshot\");\n\n/**\n * @internal Normalize one untrusted JSON value into an owned, frozen snapshot while counting the\n * exact UTF-8 bytes of that same snapshot. The traversal never invokes `toJSON` or accessors,\n * rejects non-plain objects and excessive nesting, and stops as soon as the byte budget is spent.\n */\nconst snapshotJson = (\n  root: unknown,\n  maxBytes: number,\n  maxDepth: number,\n  rejectNonFiniteNumbers: boolean,\n): BoundedJsonSnapshot | undefined => {\n  if (\n    !Number.isSafeInteger(maxBytes) ||\n    maxBytes < 0 ||\n    !Number.isSafeInteger(maxDepth) ||\n    maxDepth < 0\n  ) {\n    return undefined;\n  }\n  let total = 0;\n  const ancestors = new WeakSet<object>();\n\n  const add = (bytes: number): boolean => {\n    if (bytes > maxBytes - total) return false;\n    total += bytes;\n\n    return true;\n  };\n\n  const addString = (value: string): boolean => {\n    if (!add(2)) return false;\n    for (let index = 0; index < value.length; index += 1) {\n      const code = value.charCodeAt(index);\n\n      if (code === 0x22 || code === 0x5c) {\n        if (!add(2)) return false;\n      } else if (code <= 0x1f) {\n        // Backspace, tab, newline, form-feed, and carriage-return use two-byte escapes; all other\n        // control characters use a six-byte `\\\\u00xx` escape.\n        if (!add(code >= 0x08 && code <= 0x0d && code !== 0x0b ? 2 : 6)) return false;\n      } else if (code <= 0x7f) {\n        if (!add(1)) return false;\n      } else if (code <= 0x7ff) {\n        if (!add(2)) return false;\n      } else if (code >= 0xd800 && code <= 0xdbff) {\n        const low = value.charCodeAt(index + 1);\n\n        if (low >= 0xdc00 && low <= 0xdfff) {\n          if (!add(4)) return false;\n          index += 1;\n        } else if (!add(6)) {\n          return false;\n        }\n      } else if (code >= 0xdc00 && code <= 0xdfff) {\n        if (!add(6)) return false;\n      } else if (!add(3)) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n\n  const visit = (value: unknown, depth: number): Schema.Json | typeof FailedSnapshot => {\n    if (depth > maxDepth) return FailedSnapshot;\n    if (value === null) return add(4) ? null : FailedSnapshot;\n    switch (typeof value) {\n      case \"string\":\n        return addString(value) ? value : FailedSnapshot;\n      case \"boolean\":\n        return add(value ? 4 : 5) ? value : FailedSnapshot;\n      case \"number\": {\n        // JSON's numeric representation is inherently bounded for one IEEE-754 value. Retain the\n        // wire-equivalent null for non-finite values so counting and later serialization agree.\n        if (!Number.isFinite(value)) {\n          return rejectNonFiniteNumbers ? FailedSnapshot : add(4) ? null : FailedSnapshot;\n        }\n        const encoded = JSON.stringify(value);\n\n        return encoded !== undefined && add(encoded.length) ? value : FailedSnapshot;\n      }\n      case \"object\": {\n        if (ancestors.has(value)) return FailedSnapshot;\n        const isArray = Array.isArray(value);\n        const prototype = Object.getPrototypeOf(value);\n\n        if (prototype !== (isArray ? Array.prototype : Object.prototype) && prototype !== null) {\n          return FailedSnapshot;\n        }\n        if (\n          Object.getOwnPropertyDescriptor(value, \"toJSON\") !== undefined ||\n          (prototype !== null && Object.getOwnPropertyDescriptor(prototype, \"toJSON\") !== undefined)\n        ) {\n          return FailedSnapshot;\n        }\n        ancestors.add(value);\n        try {\n          if (isArray) {\n            const lengthDescriptor = Object.getOwnPropertyDescriptor(value, \"length\");\n\n            if (\n              lengthDescriptor === undefined ||\n              !(\"value\" in lengthDescriptor) ||\n              typeof lengthDescriptor.value !== \"number\" ||\n              !Number.isSafeInteger(lengthDescriptor.value) ||\n              lengthDescriptor.value < 0\n            ) {\n              return FailedSnapshot;\n            }\n            if (!add(1)) return FailedSnapshot;\n            const snapshot: Array<Schema.Json> = [];\n\n            for (let index = 0; index < lengthDescriptor.value; index += 1) {\n              if (index > 0 && !add(1)) return FailedSnapshot;\n              const descriptor = Object.getOwnPropertyDescriptor(value, index);\n\n              if (descriptor === undefined) {\n                if (!add(4)) return FailedSnapshot;\n                snapshot.push(null);\n                continue;\n              }\n              if (!(\"value\" in descriptor)) return FailedSnapshot;\n              const item = visit(descriptor.value, depth + 1);\n\n              if (item === FailedSnapshot) return FailedSnapshot;\n              snapshot.push(item);\n            }\n            if (!add(1)) return FailedSnapshot;\n            Object.setPrototypeOf(snapshot, null);\n\n            return Object.freeze(snapshot);\n          }\n          if (!add(1)) return FailedSnapshot;\n          const entries: Array<readonly [string, Schema.Json]> = [];\n          let first = true;\n\n          for (const key in value) {\n            const descriptor = Object.getOwnPropertyDescriptor(value, key);\n\n            if (descriptor === undefined || !descriptor.enumerable) continue;\n            if (!(\"value\" in descriptor)) return FailedSnapshot;\n            if (!first && !add(1)) return FailedSnapshot;\n            first = false;\n            if (!addString(key) || !add(1)) return FailedSnapshot;\n            const item = visit(descriptor.value, depth + 1);\n\n            if (item === FailedSnapshot) return FailedSnapshot;\n            entries.push([key, item]);\n          }\n          if (!add(1)) return FailedSnapshot;\n          const snapshot: Record<string, Schema.Json> = Object.fromEntries(entries);\n\n          Object.setPrototypeOf(snapshot, null);\n\n          return Object.freeze(snapshot);\n        } finally {\n          ancestors.delete(value);\n        }\n      }\n      case \"bigint\":\n      case \"function\":\n      case \"symbol\":\n      case \"undefined\":\n        return FailedSnapshot;\n    }\n\n    return FailedSnapshot;\n  };\n\n  try {\n    const value = visit(root, 0);\n\n    return value === FailedSnapshot ? undefined : { value, bytes: total };\n  } catch {\n    // Revoked or adversarial proxies and reflection failures are protocol-invalid, never trusted.\n    return undefined;\n  }\n};\n\n/**\n * Normalize provider-owned JSON using JSON serialization's `NaN`/infinity to\n * `null` behavior. Provider events use this form so byte accounting matches\n * their eventual JSON representation.\n */\nexport const boundedJsonSnapshot = (\n  root: unknown,\n  maxBytes: number,\n  maxDepth = MAX_JSON_DEPTH,\n): BoundedJsonSnapshot | undefined => snapshotJson(root, maxBytes, maxDepth, false);\n\n/**\n * Validate canonical JSON without repairing non-finite numbers. Recovery\n * inputs use this form because changing a recorded value would fabricate\n * history.\n */\nexport const boundedCanonicalJsonSnapshot = (\n  root: unknown,\n  maxBytes: number,\n  maxDepth = MAX_JSON_DEPTH,\n): BoundedJsonSnapshot | undefined => snapshotJson(root, maxBytes, maxDepth, true);\n","import { Option, Schema } from \"effect\";\nimport { Prompt } from \"effect/unstable/ai\";\n\nimport type { ContextMessageTokenEstimator } from \"../ContextCompactor.ts\";\nimport { boundedCanonicalJsonSnapshot } from \"./provider-result-staging.ts\";\n\n/**\n * Pure helpers for engine-native context compaction (RUN-026/RUN-027). Everything here is deterministic and side-effect free:\n * the engine's turn loop owns the state transitions, the durable coordinator\n * owns the canonical record, and this module owns the arithmetic.\n *\n * Compaction is a VIEW over official history, never a mutation of it. The\n * durable commit machinery slices official history by length\n * (`lastCommitLen` in the coordinator), so official history must stay\n * append-only within an Attempt; only the outgoing model prompt is rebuilt.\n */\n\n/** Model-visible replacement for a tool result cleared by prune compaction. */\nexport const CLEARED_TOOL_RESULT = \"[tool result cleared by compaction]\";\n\n/** Prefix of the user message that carries a compaction summary into the prompt. */\nexport const COMPACTION_SUMMARY_PREFIX = \"The prior thread was compacted into this summary:\\n\\n\";\n\n/** Rollover text is recovery evidence; it never asserts that an external action succeeded. */\nexport const CONTEXT_ROLLOVER_PREFIX =\n  \"A fresh context window has started. Earlier conversation has left this model view. Restore relevant notes and use available history tools to retrieve evidence; verify live state before repeating an action.\\n\\n\";\n\n/** Stable across Attempts; the initial window uses turn zero. */\nexport const contextWindowId = (runId: string, turn: number): string => `context:${runId}:${turn}`;\n\n/** Shared by the live interpreter and canonical journal projection. */\nexport const contextWindowMessage = (windowId: string, handoff?: string): Prompt.Message =>\n  Prompt.makeMessage(\"user\", {\n    content: [\n      Prompt.makePart(\"text\", {\n        text: `${CONTEXT_ROLLOVER_PREFIX}Window: ${windowId}${handoff === undefined ? \"\" : `\\n\\nHandoff (untrusted continuation notes):\\n${handoff}`}`,\n      }),\n    ],\n  });\n\n/**\n * Fixed summarization instruction (RUN-026). The skeleton mirrors what the\n * surveyed harnesses converged on; exact file paths and identifiers must\n * survive because the continuing agent sees only this summary plus the tail.\n */\nexport const COMPACTION_INSTRUCTION = [\n  \"You are compacting an agent thread to reclaim context space.\",\n  \"Summarize the transcript below for the SAME agent to continue working:\",\n  \"it will see only this summary plus the most recent messages.\",\n  \"Structure the summary exactly as:\",\n  \"Goal:\",\n  \"Constraints:\",\n  \"Progress:\",\n  \"Decisions:\",\n  \"Next steps:\",\n  \"Critical context:\",\n  \"Be terse. Preserve exact file paths, identifiers, and values needed to\",\n  \"continue. Do not continue the thread; output only the summary.\",\n].join(\"\\n\");\n\n/**\n * Provider context-length rejections, matched case-insensitively over the\n * error's own text. Kept intentionally broad: a false positive costs one\n * summarize-and-retry, a false negative surfaces the raw provider error.\n */\nconst CONTEXT_OVERFLOW_PATTERN =\n  /context[\\s_-]?length|prompt is too long|maximum context (?:length|window)|input .{0,24}too long|exceeds .{0,24}context|too many (?:input )?tokens|context[\\s_-]?window[\\s_-]?exceeded|context overflow/i;\n\n/** RUN-027: does this provider error text describe a context-window overflow? */\nexport const isContextOverflowMessage = (text: string): boolean =>\n  CONTEXT_OVERFLOW_PATTERN.test(text);\n\nconst utf8Length = (text: string): number => {\n  let bytes = text.length;\n\n  for (let index = 0; index < text.length; index++) {\n    const codeUnit = text.charCodeAt(index);\n\n    if (codeUnit <= 0x7f) continue;\n    if (codeUnit <= 0x7ff) {\n      bytes++;\n      continue;\n    }\n    if (codeUnit >= 0xd800 && codeUnit <= 0xdbff && index + 1 < text.length) {\n      const next = text.charCodeAt(index + 1);\n\n      if (next >= 0xdc00 && next <= 0xdfff) {\n        // The two UTF-16 code units already contributed two of the four UTF-8 bytes.\n        bytes += 2;\n        index++;\n        continue;\n      }\n    }\n    bytes += 2;\n  }\n\n  return bytes;\n};\n\n/**\n * Deterministic UTF-8 bytes/4 token estimate over one message's structural JSON.\n * Conservative for prose, slightly generous for dense JSON — the estimate\n * only gates WHEN to compact, never what is preserved.\n */\nexport const estimateMessageTokens = (message: Prompt.Message): number => {\n  let text: string | undefined;\n\n  try {\n    text = JSON.stringify(message);\n  } catch {\n    text = undefined;\n  }\n\n  return text === undefined ? 0 : Math.ceil(utf8Length(text) / 4);\n};\n\n/** Sum of `estimateMessageTokens` over a message array. */\nexport const estimatePromptTokens = (\n  messages: ReadonlyArray<Prompt.Message>,\n  estimate: (message: Prompt.Message) => number = estimateMessageTokens,\n): number => {\n  let total = 0;\n\n  for (const message of messages) {\n    total += estimate(message);\n  }\n\n  return total;\n};\n\nconst isTokenEstimate = Schema.is(Schema.Natural);\n\n/** Validate each replacement at the Effect caller's boundary without throwing from arithmetic. */\nexport const evaluateMessageTokenEstimates = <A>(\n  override: ContextMessageTokenEstimator | undefined,\n  operation: (estimate: (message: Prompt.Message) => number) => A,\n): Option.Option<A> => {\n  let valid = true;\n\n  const value = operation((message) => {\n    const replacement = override?.(message);\n    const estimate = replacement === undefined ? estimateMessageTokens(message) : replacement;\n\n    if (!isTokenEstimate(estimate)) valid = false;\n\n    return estimate;\n  });\n\n  return valid ? Option.some(value) : Option.none();\n};\n\n/**\n * Mutable per-Run compaction state held on the engine's RunContext. Indices\n * are positions in the SOURCE prompt (the official-history basis handed to\n * each Turn). Ordinary history grows append-only. Prepared history must retain\n * content-equivalent covered prefixes or the engine rejects the next Turn.\n */\nexport interface ContextCompactionState {\n  /**\n   * Source-index bounds `[start, end)` of the protected instruction/input\n   * block, mapped to prepared indices when necessary. `-1` before mapping;\n   * an unmappable protected block fails before any compaction decision.\n   */\n  protectedStart: number;\n  protectedEnd: number;\n  /** Prepared prompts also retain application-added system instructions. */\n  protectSystemMessages?: boolean;\n  /** Tool messages at source index below this bound render as cleared. */\n  clearedThrough: number;\n  /**\n   * Source messages below this bound (outside the protected block) are\n   * replaced by a summary or a fresh-window marker. Absent before the first replacement.\n   */\n  replacement:\n    | { readonly kind: \"summarize\"; readonly through: number; readonly summary: string }\n    | {\n        readonly kind: \"rollover\";\n        readonly through: number;\n        readonly windowId: string;\n        readonly handoff?: string;\n      }\n    | undefined;\n  /** Loop guard: at most one threshold compaction per Turn. */\n  lastCompactionTurn: number;\n  /** RUN-027 guard: at most one overflow compact-and-retry per Turn. */\n  overflowRetryTurn: number;\n  /**\n   * View length at the last model call, the base of the provider-anchored\n   * estimate. `-1` invalidates it (fresh Run or just compacted), forcing a\n   * full-view estimate.\n   */\n  lastViewLength: number;\n}\n\n/** Fresh compaction state for a new Run. */\nexport const initialCompactionState = (): ContextCompactionState => ({\n  protectedStart: -1,\n  protectedEnd: -1,\n  clearedThrough: 0,\n  replacement: undefined,\n  lastCompactionTurn: 0,\n  overflowRetryTurn: 0,\n  lastViewLength: -1,\n});\n\nconst isProtected = (\n  state: ContextCompactionState,\n  source: ReadonlyArray<Prompt.Message>,\n  index: number,\n): boolean => {\n  if (state.protectSystemMessages && source[index]?.role === \"system\") return true;\n  if (state.protectedStart >= 0) {\n    return index >= state.protectedStart && index < state.protectedEnd;\n  }\n\n  return source[index]?.role === \"system\";\n};\n\nconst clearedToolMessage = (message: Prompt.Message): Prompt.Message => {\n  if (message.role !== \"tool\" || typeof message.content === \"string\") {\n    return message;\n  }\n\n  // Structural rebuild keeps the message's pairing identity (same part ids\n  // and names) while replacing only the result payloads the model would see.\n  return Prompt.makeMessage(\"tool\", {\n    content: message.content.map((part) =>\n      part.type === \"tool-result\"\n        ? Prompt.makePart(\"tool-result\", {\n            id: part.id,\n            name: part.name,\n            result: CLEARED_TOOL_RESULT,\n            isFailure: part.isFailure,\n            providerExecuted: part.providerExecuted,\n          })\n        : part,\n    ),\n  });\n};\n\nconst renderMessage = (\n  state: ContextCompactionState,\n  message: Prompt.Message,\n  index: number,\n): Prompt.Message =>\n  index < state.clearedThrough && message.role === \"tool\" ? clearedToolMessage(message) : message;\n\nconst summaryMessage = (summary: string): Prompt.Message =>\n  Prompt.makeMessage(\"user\", {\n    content: [Prompt.makePart(\"text\", { text: `${COMPACTION_SUMMARY_PREFIX}${summary}` })],\n  });\n\n/**\n * Build the model-visible view of the source prompt under the current\n * compaction state: protected block in place, covered span replaced by the\n * summary message, old tool results cleared. Identity when no compaction has\n * happened.\n */\nexport const buildCompactedView = (\n  source: ReadonlyArray<Prompt.Message>,\n  state: ContextCompactionState,\n): ReadonlyArray<Prompt.Message> => {\n  if (state.replacement === undefined && state.clearedThrough === 0) {\n    return source;\n  }\n  const view: Array<Prompt.Message> = [];\n\n  if (state.replacement !== undefined && state.replacement.through > 0) {\n    const protectedStart =\n      state.protectedStart >= 0 && !state.protectSystemMessages ? state.protectedStart : 0;\n\n    const protectedEnd =\n      state.protectedStart >= 0 && !state.protectSystemMessages\n        ? state.protectedEnd\n        : (state.replacement?.through ?? 0);\n\n    for (\n      let index = protectedStart;\n      index < Math.min(protectedEnd, state.replacement?.through ?? 0, source.length);\n      index += 1\n    ) {\n      const message = source[index];\n\n      if (message !== undefined && isProtected(state, source, index)) {\n        view.push(renderMessage(state, message, index));\n      }\n    }\n    view.push(\n      state.replacement.kind === \"summarize\"\n        ? summaryMessage(state.replacement.summary)\n        : contextWindowMessage(state.replacement.windowId, state.replacement.handoff),\n    );\n    for (let index = state.replacement?.through ?? 0; index < source.length; index += 1) {\n      const message = source[index];\n\n      if (message !== undefined) {\n        view.push(renderMessage(state, message, index));\n      }\n    }\n\n    return view;\n  }\n  for (let index = 0; index < source.length; index += 1) {\n    const message = source[index];\n\n    if (message !== undefined) {\n      view.push(renderMessage(state, message, index));\n    }\n  }\n\n  return view;\n};\n\n/**\n * Prune selection: the new `clearedThrough` bound. Walks tool messages\n * newest→oldest, always protecting the most recent tool message (the model\n * has not reacted to it yet), then protecting older ones while their\n * estimates fit inside `keepRecentTokens`. If the whole view exceeds `targetTokens`,\n * clear more older results until it fits or only the newest result remains.\n * Replaced messages consume no retention budget. Never decreases the bound.\n */\nexport const choosePruneBound = (\n  source: ReadonlyArray<Prompt.Message>,\n  state: ContextCompactionState,\n  keepRecentTokens: number,\n  targetTokens?: number,\n  estimate: (message: Prompt.Message) => number = estimateMessageTokens,\n): number => {\n  const toolIndices: Array<number> = [];\n\n  for (let index = 0; index < source.length; index += 1) {\n    if (\n      index >= (state.replacement?.through ?? 0) &&\n      source[index]?.role === \"tool\" &&\n      !isProtected(state, source, index)\n    ) {\n      toolIndices.push(index);\n    }\n  }\n  if (toolIndices.length <= 1) {\n    return state.clearedThrough;\n  }\n  let budget = keepRecentTokens;\n  let newestCleared = -1;\n\n  for (let position = toolIndices.length - 1; position >= 0; position -= 1) {\n    const index = toolIndices[position];\n\n    if (index === undefined) continue;\n    const message = source[index];\n\n    if (message === undefined) continue;\n    if (position === toolIndices.length - 1) {\n      budget -= estimate(message);\n      continue;\n    }\n    const cost = estimate(message);\n\n    if (budget - cost >= 0 && index >= state.clearedThrough) {\n      budget -= cost;\n      continue;\n    }\n    newestCleared = index;\n    break;\n  }\n\n  let through =\n    newestCleared === -1 ? state.clearedThrough : Math.max(state.clearedThrough, newestCleared + 1);\n\n  if (targetTokens === undefined) return through;\n\n  let estimated = estimatePromptTokens(\n    buildCompactedView(source, { ...state, clearedThrough: through }),\n    estimate,\n  );\n\n  for (\n    let position = 0;\n    position < toolIndices.length - 1 && estimated > targetTokens;\n    position += 1\n  ) {\n    const index = toolIndices[position];\n\n    if (index === undefined || index < through) continue;\n    const message = source[index];\n\n    if (message === undefined) continue;\n    through = index + 1;\n    estimated -= estimate(message) - estimate(clearedToolMessage(message));\n  }\n\n  return through;\n};\n\n/**\n * Summarize selection: the source cut index `C` — messages `[0, C)` outside\n * the protected block fold into the summary; `[C, …)` is the kept tail.\n * Walks newest→oldest accumulating view estimates until `keepRecentTokens`\n * is retained, then moves the cut down so no tool message is separated from\n * the assistant message that declared its calls.\n */\nexport const chooseSummarizeCut = (\n  source: ReadonlyArray<Prompt.Message>,\n  state: ContextCompactionState,\n  keepRecentTokens: number,\n  estimate: (message: Prompt.Message) => number = estimateMessageTokens,\n): number => {\n  let kept = 0;\n  let cut = 0;\n\n  for (let index = source.length - 1; index >= 0; index -= 1) {\n    const message = source[index];\n\n    if (message === undefined) continue;\n    kept += estimate(renderMessage(state, message, index));\n    if (kept >= keepRecentTokens) {\n      cut = index;\n      break;\n    }\n  }\n  // A tool message must stay with its declaring assistant message: walk the\n  // cut down across any tool messages so pairing is never split.\n  while (cut > 0 && source[cut]?.role === \"tool\") {\n    cut -= 1;\n  }\n\n  return Math.max(cut, state.replacement?.through ?? 0);\n};\n\n/**\n * The messages a cut NEWLY covers — from the prior replacement boundary to the\n * cut, protected block excluded, in order. Starting at the replacement boundary\n * keeps repeated compactions incremental: the previously covered span lives\n * on only through the previous summary, never as resubmitted raw history.\n */\nexport const collectCoveredMessages = (\n  source: ReadonlyArray<Prompt.Message>,\n  state: ContextCompactionState,\n  cut: number,\n): ReadonlyArray<Prompt.Message> => {\n  const covered: Array<Prompt.Message> = [];\n\n  for (\n    let index = Math.max(0, state.replacement?.through ?? 0);\n    index < cut && index < source.length;\n    index += 1\n  ) {\n    const message = source[index];\n\n    if (message !== undefined && !isProtected(state, source, index)) {\n      covered.push(message);\n    }\n  }\n\n  return covered;\n};\n\nconst SUMMARY_TOOL_RESULT_CLIP = 2_000;\n\nconst jsonPreview = (value: unknown, limit: number): string => {\n  if (typeof value === \"string\") return JSON.stringify(value.slice(0, limit)).slice(0, limit);\n  const snapshot = boundedCanonicalJsonSnapshot(value, limit);\n\n  return snapshot === undefined\n    ? \"[omitted oversized or unsupported JSON]\"\n    : JSON.stringify(snapshot.value);\n};\n\nconst partText = (part: Prompt.Message[\"content\"][number] | string): string => {\n  if (typeof part === \"string\") return part;\n  switch (part.type) {\n    case \"text\": {\n      return part.text;\n    }\n    case \"reasoning\": {\n      return \"\";\n    }\n    case \"tool-call\": {\n      return `[tool call ${part.name.slice(0, 500)} ${jsonPreview(part.params, 500)}]`;\n    }\n    case \"tool-result\": {\n      return `[tool result ${part.name.slice(0, 500)}: ${jsonPreview(part.result, SUMMARY_TOOL_RESULT_CLIP)}]`;\n    }\n    default: {\n      return `[${part.type}]`;\n    }\n  }\n};\n\n/**\n * Character budget for the complete default summarizer request, including\n * its instruction, transcript delimiters, previous summary, and elision marker.\n */\nexport const SUMMARY_INPUT_BUDGET = 80_000;\nexport const SUMMARY_MAX_LENGTH = 65_536;\nexport const SUMMARY_REQUEST_PREFIX = `${COMPACTION_INSTRUCTION}\\n\\n<transcript>\\n`;\nexport const SUMMARY_REQUEST_SUFFIX = \"\\n</transcript>\";\n\nconst SUMMARY_MESSAGE_CLIP = 2_000;\nconst SUMMARY_ELISION_RESERVE = 128;\n\nconst summaryBlock = (message: Prompt.Message): string => {\n  let text = \"\";\n\n  if (typeof message.content === \"string\") {\n    text = message.content.slice(0, SUMMARY_MESSAGE_CLIP + 1);\n  } else {\n    for (const part of message.content) {\n      const piece = partText(part);\n\n      if (piece.length === 0) continue;\n      if (text.length > 0) text += \"\\n\";\n      text += piece.slice(0, SUMMARY_MESSAGE_CLIP + 1 - text.length);\n      if (text.length > SUMMARY_MESSAGE_CLIP) break;\n    }\n  }\n  if (text.length === 0) return \"\";\n\n  return `[${message.role}]\\n${text.length > SUMMARY_MESSAGE_CLIP ? `${text.slice(0, SUMMARY_MESSAGE_CLIP)}…` : text}`;\n};\n\n/**\n * Deterministic emergency input record, not a progress summary. Keep recent user inputs and\n * the last, as-yet-unconsumed Tool batch. Clip before rendering large payloads, identify Tool\n * calls for archive lookup, and never recursively copy earlier recovery records.\n */\nexport const buildRolloverHandoff = (\n  source: ReadonlyArray<Prompt.Message>,\n  state: ContextCompactionState,\n  targetTokens: number | undefined,\n  through = source.length,\n  estimate: (message: Prompt.Message) => number = estimateMessageTokens,\n): string | undefined => {\n  const protectedTokens = estimatePromptTokens(\n    source.filter((_, index) => index >= through || isProtected(state, source, index)),\n    estimate,\n  );\n\n  const maxChars = Math.min(\n    5_000,\n    Math.max(0, Math.floor(((targetTokens ?? 10_000) - protectedTokens - 200) * 2)),\n  );\n\n  if (maxChars < 160) return undefined;\n  const blocks: Array<string> = [];\n  let length = 0;\n  const start = state.replacement?.through ?? 0;\n\n  const lastTool = source.findLastIndex(\n    (message, index) => index < through && message.role === \"tool\",\n  );\n\n  const unconsumed =\n    lastTool >= start &&\n    !source.slice(lastTool + 1, through).some((message) => message.role === \"assistant\");\n\n  let lastAssistant = lastTool;\n\n  while (lastAssistant >= start && source[lastAssistant]?.role !== \"assistant\") lastAssistant -= 1;\n  for (let index = through - 1; index >= start; index -= 1) {\n    const message = source[index];\n\n    if (message === undefined || isProtected(state, source, index)) continue;\n    const isUnconsumedBatch = unconsumed && index >= lastAssistant && index <= lastTool;\n\n    if (message.role !== \"user\" && !isUnconsumedBatch) continue;\n    // A projected boundary from a previous Attempt is already a derived handoff.\n    if (\n      message.role === \"user\" &&\n      message.content.some(\n        (part) => part.type === \"text\" && part.text.startsWith(CONTEXT_ROLLOVER_PREFIX),\n      )\n    )\n      continue;\n    let block = summaryBlock(message);\n\n    if (isUnconsumedBatch && typeof message.content !== \"string\") {\n      const ids = message.content\n        .flatMap((part) =>\n          part.type === \"tool-call\" || part.type === \"tool-result\" ? [part.id.slice(0, 256)] : [],\n        )\n        .slice(0, 16);\n\n      block = `[Unconsumed batch; history search call IDs: ${ids.join(\", \")}]\\n${block}`;\n    }\n    const remaining = maxChars - length - 120;\n\n    if (remaining <= 0) break;\n    const selected = block.slice(0, Math.min(2_500, remaining));\n\n    blocks.unshift(selected);\n    length += selected.length + 2;\n    if (selected.length < block.length) break;\n  }\n\n  return `Recovery excerpts, not verified progress. Content may be omitted; use notes and history.\\n\\n${blocks.join(\"\\n\\n\")}`.slice(\n    0,\n    maxChars,\n  );\n};\n\n/**\n * Render the covered span as plain text for the summarizer call, bounded\n * twice: every message's rendered text is clipped to a fixed length (tool\n * results additionally clip their JSON payloads), and the whole render obeys\n * `SUMMARY_INPUT_BUDGET` with middle-out retention — oldest and newest\n * blocks survive, the middle collapses into one deterministic elision\n * marker. A previous summary is folded in first so nothing silently drops\n * out of coverage across repeated compactions. An oversized previous summary\n * returns undefined before rendering: callers must reject it, never truncate it.\n */\nexport const renderForSummary = (\n  covered: ReadonlyArray<Prompt.Message>,\n  previousSummary: string | undefined,\n): string | undefined => {\n  if (previousSummary !== undefined && previousSummary.length > SUMMARY_MAX_LENGTH)\n    return undefined;\n  const joiner = \"\\n\\n\";\n\n  const previousBlock =\n    previousSummary === undefined ? undefined : `[Previous summary]\\n${previousSummary}`;\n\n  const fixed =\n    (previousBlock === undefined ? 0 : previousBlock.length + joiner.length) +\n    SUMMARY_REQUEST_PREFIX.length +\n    SUMMARY_REQUEST_SUFFIX.length;\n\n  const budget = SUMMARY_INPUT_BUDGET - fixed - SUMMARY_ELISION_RESERVE;\n  const head: Array<string> = [];\n  const tail: Array<string> = [];\n  let length = 0;\n  let start = 0;\n  let end = covered.length - 1;\n  let boundaryBlock: string | undefined;\n\n  while (start <= end) {\n    const message = covered[start];\n    const block = message === undefined ? \"\" : summaryBlock(message);\n\n    if (block.length > 0 && length + block.length + joiner.length > Math.floor(budget / 2)) {\n      boundaryBlock = block;\n      break;\n    }\n    if (block.length > 0) {\n      head.push(block);\n      length += block.length + joiner.length;\n    }\n    start += 1;\n  }\n  while (end >= start) {\n    const message = covered[end];\n\n    const block =\n      end === start && boundaryBlock !== undefined\n        ? boundaryBlock\n        : message === undefined\n          ? \"\"\n          : summaryBlock(message);\n\n    if (block.length > 0 && length + block.length + joiner.length > budget) break;\n    if (block.length > 0) {\n      tail.push(block);\n      length += block.length + joiner.length;\n    }\n    end -= 1;\n  }\n  const omitted = end - start + 1;\n  const lines: Array<string> = [];\n\n  if (previousBlock !== undefined) {\n    lines.push(previousBlock);\n  }\n  lines.push(...head);\n  if (omitted > 0) lines.push(`[… ${omitted} messages omitted from summary input …]`);\n  lines.push(...tail.reverse());\n\n  return lines.join(joiner);\n};\n"],"mappings":";;;AAEA,MAAM,iBAAiB;AAOvB,MAAM,iBAAiB,OAAO,mDAAmD;;;;;;AAOjF,MAAM,gBACJ,MACA,UACA,UACA,2BACoC;CACpC,IACE,CAAC,OAAO,cAAc,QAAQ,KAC9B,WAAW,KACX,CAAC,OAAO,cAAc,QAAQ,KAC9B,WAAW,GAEX;CAEF,IAAI,QAAQ;CACZ,MAAM,4BAAY,IAAI,QAAgB;CAEtC,MAAM,OAAO,UAA2B;EACtC,IAAI,QAAQ,WAAW,OAAO,OAAO;EACrC,SAAS;EAET,OAAO;CACT;CAEA,MAAM,aAAa,UAA2B;EAC5C,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;EACpB,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;GACpD,MAAM,OAAO,MAAM,WAAW,KAAK;GAEnC,IAAI,SAAS,MAAQ,SAAS,IACxB;QAAA,CAAC,IAAI,CAAC,GAAG,OAAO;GAAA,OACf,IAAI,QAAQ,IAGb;QAAA,CAAC,IAAI,QAAQ,KAAQ,QAAQ,MAAQ,SAAS,KAAO,IAAI,CAAC,GAAG,OAAO;GAAA,OACnE,IAAI,QAAQ,KACb;QAAA,CAAC,IAAI,CAAC,GAAG,OAAO;GAAA,OACf,IAAI,QAAQ,MACb;QAAA,CAAC,IAAI,CAAC,GAAG,OAAO;GAAA,OACf,IAAI,QAAQ,SAAU,QAAQ,OAAQ;IAC3C,MAAM,MAAM,MAAM,WAAW,QAAQ,CAAC;IAEtC,IAAI,OAAO,SAAU,OAAO,OAAQ;KAClC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;KACpB,SAAS;IACX,OAAO,IAAI,CAAC,IAAI,CAAC,GACf,OAAO;GAEX,OAAO,IAAI,QAAQ,SAAU,QAAQ,OAC/B;QAAA,CAAC,IAAI,CAAC,GAAG,OAAO;GAAA,OACf,IAAI,CAAC,IAAI,CAAC,GACf,OAAO;EAEX;EAEA,OAAO;CACT;CAEA,MAAM,SAAS,OAAgB,UAAuD;EACpF,IAAI,QAAQ,UAAU,OAAO;EAC7B,IAAI,UAAU,MAAM,OAAO,IAAI,CAAC,IAAI,OAAO;EAC3C,QAAQ,OAAO,OAAf;GACE,KAAK,UACH,OAAO,UAAU,KAAK,IAAI,QAAQ;GACpC,KAAK,WACH,OAAO,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ;GACtC,KAAK,UAAU;IAGb,IAAI,CAAC,OAAO,SAAS,KAAK,GACxB,OAAO,yBAAyB,iBAAiB,IAAI,CAAC,IAAI,OAAO;IAEnE,MAAM,UAAU,KAAK,UAAU,KAAK;IAEpC,OAAO,YAAY,KAAA,KAAa,IAAI,QAAQ,MAAM,IAAI,QAAQ;GAChE;GACA,KAAK,UAAU;IACb,IAAI,UAAU,IAAI,KAAK,GAAG,OAAO;IACjC,MAAM,UAAU,MAAM,QAAQ,KAAK;IACnC,MAAM,YAAY,OAAO,eAAe,KAAK;IAE7C,IAAI,eAAe,UAAU,MAAM,YAAY,OAAO,cAAc,cAAc,MAChF,OAAO;IAET,IACE,OAAO,yBAAyB,OAAO,QAAQ,MAAM,KAAA,KACpD,cAAc,QAAQ,OAAO,yBAAyB,WAAW,QAAQ,MAAM,KAAA,GAEhF,OAAO;IAET,UAAU,IAAI,KAAK;IACnB,IAAI;KACF,IAAI,SAAS;MACX,MAAM,mBAAmB,OAAO,yBAAyB,OAAO,QAAQ;MAExE,IACE,qBAAqB,KAAA,KACrB,EAAE,WAAW,qBACb,OAAO,iBAAiB,UAAU,YAClC,CAAC,OAAO,cAAc,iBAAiB,KAAK,KAC5C,iBAAiB,QAAQ,GAEzB,OAAO;MAET,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;MACpB,MAAM,WAA+B,CAAC;MAEtC,KAAK,IAAI,QAAQ,GAAG,QAAQ,iBAAiB,OAAO,SAAS,GAAG;OAC9D,IAAI,QAAQ,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO;OACjC,MAAM,aAAa,OAAO,yBAAyB,OAAO,KAAK;OAE/D,IAAI,eAAe,KAAA,GAAW;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;QACpB,SAAS,KAAK,IAAI;QAClB;OACF;OACA,IAAI,EAAE,WAAW,aAAa,OAAO;OACrC,MAAM,OAAO,MAAM,WAAW,OAAO,QAAQ,CAAC;OAE9C,IAAI,SAAS,gBAAgB,OAAO;OACpC,SAAS,KAAK,IAAI;MACpB;MACA,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;MACpB,OAAO,eAAe,UAAU,IAAI;MAEpC,OAAO,OAAO,OAAO,QAAQ;KAC/B;KACA,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;KACpB,MAAM,UAAiD,CAAC;KACxD,IAAI,QAAQ;KAEZ,KAAK,MAAM,OAAO,OAAO;MACvB,MAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;MAE7D,IAAI,eAAe,KAAA,KAAa,CAAC,WAAW,YAAY;MACxD,IAAI,EAAE,WAAW,aAAa,OAAO;MACrC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,OAAO;MAC9B,QAAQ;MACR,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO;MACvC,MAAM,OAAO,MAAM,WAAW,OAAO,QAAQ,CAAC;MAE9C,IAAI,SAAS,gBAAgB,OAAO;MACpC,QAAQ,KAAK,CAAC,KAAK,IAAI,CAAC;KAC1B;KACA,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO;KACpB,MAAM,WAAwC,OAAO,YAAY,OAAO;KAExE,OAAO,eAAe,UAAU,IAAI;KAEpC,OAAO,OAAO,OAAO,QAAQ;IAC/B,UAAU;KACR,UAAU,OAAO,KAAK;IACxB;GACF;GACA,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,aACH,OAAO;EACX;EAEA,OAAO;CACT;CAEA,IAAI;EACF,MAAM,QAAQ,MAAM,MAAM,CAAC;EAE3B,OAAO,UAAU,iBAAiB,KAAA,IAAY;GAAE;GAAO,OAAO;EAAM;CACtE,QAAQ;EAEN;CACF;AACF;;;;;;AAOA,MAAa,uBACX,MACA,UACA,WAAW,mBACyB,aAAa,MAAM,UAAU,UAAU,KAAK;;;;;;AAOlF,MAAa,gCACX,MACA,UACA,WAAW,mBACyB,aAAa,MAAM,UAAU,UAAU,IAAI;;;;;;;;;;;;;;AChMjF,MAAa,sBAAsB;;AAGnC,MAAa,4BAA4B;;AAGzC,MAAa,0BACX;;AAGF,MAAa,mBAAmB,OAAe,SAAyB,WAAW,MAAM,GAAG;;AAG5F,MAAa,wBAAwB,UAAkB,YACrD,OAAO,YAAY,QAAQ,EACzB,SAAS,CACP,OAAO,SAAS,QAAQ,EACtB,MAAM,GAAG,wBAAwB,UAAU,WAAW,YAAY,KAAA,IAAY,KAAK,gDAAgD,YACrI,CAAC,CACH,EACF,CAAC;;;;;;AAOH,MAAa,yBAAyB;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,IAAI;;;;;;AAOX,MAAM,2BACJ;;AAGF,MAAa,4BAA4B,SACvC,yBAAyB,KAAK,IAAI;AAEpC,MAAM,cAAc,SAAyB;CAC3C,IAAI,QAAQ,KAAK;CAEjB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAChD,MAAM,WAAW,KAAK,WAAW,KAAK;EAEtC,IAAI,YAAY,KAAM;EACtB,IAAI,YAAY,MAAO;GACrB;GACA;EACF;EACA,IAAI,YAAY,SAAU,YAAY,SAAU,QAAQ,IAAI,KAAK,QAAQ;GACvE,MAAM,OAAO,KAAK,WAAW,QAAQ,CAAC;GAEtC,IAAI,QAAQ,SAAU,QAAQ,OAAQ;IAEpC,SAAS;IACT;IACA;GACF;EACF;EACA,SAAS;CACX;CAEA,OAAO;AACT;;;;;;AAOA,MAAa,yBAAyB,YAAoC;CACxE,IAAI;CAEJ,IAAI;EACF,OAAO,KAAK,UAAU,OAAO;CAC/B,QAAQ;EACN,OAAO,KAAA;CACT;CAEA,OAAO,SAAS,KAAA,IAAY,IAAI,KAAK,KAAK,WAAW,IAAI,IAAI,CAAC;AAChE;;AAGA,MAAa,wBACX,UACA,WAAgD,0BACrC;CACX,IAAI,QAAQ;CAEZ,KAAK,MAAM,WAAW,UACpB,SAAS,SAAS,OAAO;CAG3B,OAAO;AACT;AAEA,MAAM,kBAAkB,OAAO,GAAG,OAAO,OAAO;;AAGhD,MAAa,iCACX,UACA,cACqB;CACrB,IAAI,QAAQ;CAEZ,MAAM,QAAQ,WAAW,YAAY;EACnC,MAAM,cAAc,WAAW,OAAO;EACtC,MAAM,WAAW,gBAAgB,KAAA,IAAY,sBAAsB,OAAO,IAAI;EAE9E,IAAI,CAAC,gBAAgB,QAAQ,GAAG,QAAQ;EAExC,OAAO;CACT,CAAC;CAED,OAAO,QAAQ,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK;AAClD;;AA8CA,MAAa,gCAAwD;CACnE,gBAAgB;CAChB,cAAc;CACd,gBAAgB;CAChB,aAAa,KAAA;CACb,oBAAoB;CACpB,mBAAmB;CACnB,gBAAgB;AAClB;AAEA,MAAM,eACJ,OACA,QACA,UACY;CACZ,IAAI,MAAM,yBAAyB,OAAO,MAAM,EAAE,SAAS,UAAU,OAAO;CAC5E,IAAI,MAAM,kBAAkB,GAC1B,OAAO,SAAS,MAAM,kBAAkB,QAAQ,MAAM;CAGxD,OAAO,OAAO,MAAM,EAAE,SAAS;AACjC;AAEA,MAAM,sBAAsB,YAA4C;CACtE,IAAI,QAAQ,SAAS,UAAU,OAAO,QAAQ,YAAY,UACxD,OAAO;CAKT,OAAO,OAAO,YAAY,QAAQ,EAChC,SAAS,QAAQ,QAAQ,KAAK,SAC5B,KAAK,SAAS,gBACV,OAAO,SAAS,eAAe;EAC7B,IAAI,KAAK;EACT,MAAM,KAAK;EACX,QAAQ;EACR,WAAW,KAAK;EAChB,kBAAkB,KAAK;CACzB,CAAC,IACD,IACN,EACF,CAAC;AACH;AAEA,MAAM,iBACJ,OACA,SACA,UAEA,QAAQ,MAAM,kBAAkB,QAAQ,SAAS,SAAS,mBAAmB,OAAO,IAAI;AAE1F,MAAM,kBAAkB,YACtB,OAAO,YAAY,QAAQ,EACzB,SAAS,CAAC,OAAO,SAAS,QAAQ,EAAE,MAAM,GAAG,4BAA4B,UAAU,CAAC,CAAC,EACvF,CAAC;;;;;;;AAQH,MAAa,sBACX,QACA,UACkC;CAClC,IAAI,MAAM,gBAAgB,KAAA,KAAa,MAAM,mBAAmB,GAC9D,OAAO;CAET,MAAM,OAA8B,CAAC;CAErC,IAAI,MAAM,gBAAgB,KAAA,KAAa,MAAM,YAAY,UAAU,GAAG;EACpE,MAAM,iBACJ,MAAM,kBAAkB,KAAK,CAAC,MAAM,wBAAwB,MAAM,iBAAiB;EAErF,MAAM,eACJ,MAAM,kBAAkB,KAAK,CAAC,MAAM,wBAChC,MAAM,eACL,MAAM,aAAa,WAAW;EAErC,KACE,IAAI,QAAQ,gBACZ,QAAQ,KAAK,IAAI,cAAc,MAAM,aAAa,WAAW,GAAG,OAAO,MAAM,GAC7E,SAAS,GACT;GACA,MAAM,UAAU,OAAO;GAEvB,IAAI,YAAY,KAAA,KAAa,YAAY,OAAO,QAAQ,KAAK,GAC3D,KAAK,KAAK,cAAc,OAAO,SAAS,KAAK,CAAC;EAElD;EACA,KAAK,KACH,MAAM,YAAY,SAAS,cACvB,eAAe,MAAM,YAAY,OAAO,IACxC,qBAAqB,MAAM,YAAY,UAAU,MAAM,YAAY,OAAO,CAChF;EACA,KAAK,IAAI,QAAQ,MAAM,aAAa,WAAW,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;GACnF,MAAM,UAAU,OAAO;GAEvB,IAAI,YAAY,KAAA,GACd,KAAK,KAAK,cAAc,OAAO,SAAS,KAAK,CAAC;EAElD;EAEA,OAAO;CACT;CACA,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;EACrD,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,GACd,KAAK,KAAK,cAAc,OAAO,SAAS,KAAK,CAAC;CAElD;CAEA,OAAO;AACT;;;;;;;;;AAUA,MAAa,oBACX,QACA,OACA,kBACA,cACA,WAAgD,0BACrC;CACX,MAAM,cAA6B,CAAC;CAEpC,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAClD,IACE,UAAU,MAAM,aAAa,WAAW,MACxC,OAAO,MAAM,EAAE,SAAS,UACxB,CAAC,YAAY,OAAO,QAAQ,KAAK,GAEjC,YAAY,KAAK,KAAK;CAG1B,IAAI,YAAY,UAAU,GACxB,OAAO,MAAM;CAEf,IAAI,SAAS;CACb,IAAI,gBAAgB;CAEpB,KAAK,IAAI,WAAW,YAAY,SAAS,GAAG,YAAY,GAAG,YAAY,GAAG;EACxE,MAAM,QAAQ,YAAY;EAE1B,IAAI,UAAU,KAAA,GAAW;EACzB,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,GAAW;EAC3B,IAAI,aAAa,YAAY,SAAS,GAAG;GACvC,UAAU,SAAS,OAAO;GAC1B;EACF;EACA,MAAM,OAAO,SAAS,OAAO;EAE7B,IAAI,SAAS,QAAQ,KAAK,SAAS,MAAM,gBAAgB;GACvD,UAAU;GACV;EACF;EACA,gBAAgB;EAChB;CACF;CAEA,IAAI,UACF,kBAAkB,KAAK,MAAM,iBAAiB,KAAK,IAAI,MAAM,gBAAgB,gBAAgB,CAAC;CAEhG,IAAI,iBAAiB,KAAA,GAAW,OAAO;CAEvC,IAAI,YAAY,qBACd,mBAAmB,QAAQ;EAAE,GAAG;EAAO,gBAAgB;CAAQ,CAAC,GAChE,QACF;CAEA,KACE,IAAI,WAAW,GACf,WAAW,YAAY,SAAS,KAAK,YAAY,cACjD,YAAY,GACZ;EACA,MAAM,QAAQ,YAAY;EAE1B,IAAI,UAAU,KAAA,KAAa,QAAQ,SAAS;EAC5C,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,GAAW;EAC3B,UAAU,QAAQ;EAClB,aAAa,SAAS,OAAO,IAAI,SAAS,mBAAmB,OAAO,CAAC;CACvE;CAEA,OAAO;AACT;;;;;;;;AASA,MAAa,sBACX,QACA,OACA,kBACA,WAAgD,0BACrC;CACX,IAAI,OAAO;CACX,IAAI,MAAM;CAEV,KAAK,IAAI,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EAC1D,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,GAAW;EAC3B,QAAQ,SAAS,cAAc,OAAO,SAAS,KAAK,CAAC;EACrD,IAAI,QAAQ,kBAAkB;GAC5B,MAAM;GACN;EACF;CACF;CAGA,OAAO,MAAM,KAAK,OAAO,IAAI,EAAE,SAAS,QACtC,OAAO;CAGT,OAAO,KAAK,IAAI,KAAK,MAAM,aAAa,WAAW,CAAC;AACtD;;;;;;;AAQA,MAAa,0BACX,QACA,OACA,QACkC;CAClC,MAAM,UAAiC,CAAC;CAExC,KACE,IAAI,QAAQ,KAAK,IAAI,GAAG,MAAM,aAAa,WAAW,CAAC,GACvD,QAAQ,OAAO,QAAQ,OAAO,QAC9B,SAAS,GACT;EACA,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,KAAa,CAAC,YAAY,OAAO,QAAQ,KAAK,GAC5D,QAAQ,KAAK,OAAO;CAExB;CAEA,OAAO;AACT;AAEA,MAAM,2BAA2B;AAEjC,MAAM,eAAe,OAAgB,UAA0B;CAC7D,IAAI,OAAO,UAAU,UAAU,OAAO,KAAK,UAAU,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK;CAC1F,MAAM,WAAW,6BAA6B,OAAO,KAAK;CAE1D,OAAO,aAAa,KAAA,IAChB,4CACA,KAAK,UAAU,SAAS,KAAK;AACnC;AAEA,MAAM,YAAY,SAA6D;CAC7E,IAAI,OAAO,SAAS,UAAU,OAAO;CACrC,QAAQ,KAAK,MAAb;EACE,KAAK,QACH,OAAO,KAAK;EAEd,KAAK,aACH,OAAO;EAET,KAAK,aACH,OAAO,cAAc,KAAK,KAAK,MAAM,GAAG,GAAG,EAAE,GAAG,YAAY,KAAK,QAAQ,GAAG,EAAE;EAEhF,KAAK,eACH,OAAO,gBAAgB,KAAK,KAAK,MAAM,GAAG,GAAG,EAAE,IAAI,YAAY,KAAK,QAAQ,wBAAwB,EAAE;EAExG,SACE,OAAO,IAAI,KAAK,KAAK;CAEzB;AACF;;;;;AAMA,MAAa,uBAAuB;AACpC,MAAa,qBAAqB;AAClC,MAAa,yBAAyB,GAAG,uBAAuB;AAChE,MAAa,yBAAyB;AAEtC,MAAM,uBAAuB;AAC7B,MAAM,0BAA0B;AAEhC,MAAM,gBAAgB,YAAoC;CACxD,IAAI,OAAO;CAEX,IAAI,OAAO,QAAQ,YAAY,UAC7B,OAAO,QAAQ,QAAQ,MAAM,GAAG,IAAwB;MAExD,KAAK,MAAM,QAAQ,QAAQ,SAAS;EAClC,MAAM,QAAQ,SAAS,IAAI;EAE3B,IAAI,MAAM,WAAW,GAAG;EACxB,IAAI,KAAK,SAAS,GAAG,QAAQ;EAC7B,QAAQ,MAAM,MAAM,GAAG,OAA2B,KAAK,MAAM;EAC7D,IAAI,KAAK,SAAS,sBAAsB;CAC1C;CAEF,IAAI,KAAK,WAAW,GAAG,OAAO;CAE9B,OAAO,IAAI,QAAQ,KAAK,KAAK,KAAK,SAAS,uBAAuB,GAAG,KAAK,MAAM,GAAG,oBAAoB,EAAE,KAAK;AAChH;;;;;;AAOA,MAAa,wBACX,QACA,OACA,cACA,UAAU,OAAO,QACjB,WAAgD,0BACzB;CACvB,MAAM,kBAAkB,qBACtB,OAAO,QAAQ,GAAG,UAAU,SAAS,WAAW,YAAY,OAAO,QAAQ,KAAK,CAAC,GACjF,QACF;CAEA,MAAM,WAAW,KAAK,IACpB,KACA,KAAK,IAAI,GAAG,KAAK,QAAQ,gBAAgB,OAAU,kBAAkB,OAAO,CAAC,CAAC,CAChF;CAEA,IAAI,WAAW,KAAK,OAAO,KAAA;CAC3B,MAAM,SAAwB,CAAC;CAC/B,IAAI,SAAS;CACb,MAAM,QAAQ,MAAM,aAAa,WAAW;CAE5C,MAAM,WAAW,OAAO,eACrB,SAAS,UAAU,QAAQ,WAAW,QAAQ,SAAS,MAC1D;CAEA,MAAM,aACJ,YAAY,SACZ,CAAC,OAAO,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,MAAM,YAAY,QAAQ,SAAS,WAAW;CAErF,IAAI,gBAAgB;CAEpB,OAAO,iBAAiB,SAAS,OAAO,cAAc,EAAE,SAAS,aAAa,iBAAiB;CAC/F,KAAK,IAAI,QAAQ,UAAU,GAAG,SAAS,OAAO,SAAS,GAAG;EACxD,MAAM,UAAU,OAAO;EAEvB,IAAI,YAAY,KAAA,KAAa,YAAY,OAAO,QAAQ,KAAK,GAAG;EAChE,MAAM,oBAAoB,cAAc,SAAS,iBAAiB,SAAS;EAE3E,IAAI,QAAQ,SAAS,UAAU,CAAC,mBAAmB;EAEnD,IACE,QAAQ,SAAS,UACjB,QAAQ,QAAQ,MACb,SAAS,KAAK,SAAS,UAAU,KAAK,KAAK,WAAA,mNAAkC,CAChF,GAEA;EACF,IAAI,QAAQ,aAAa,OAAO;EAEhC,IAAI,qBAAqB,OAAO,QAAQ,YAAY,UAOlD,QAAQ,+CANI,QAAQ,QACjB,SAAS,SACR,KAAK,SAAS,eAAe,KAAK,SAAS,gBAAgB,CAAC,KAAK,GAAG,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CACxF,CAAC,CACA,MAAM,GAAG,EAE6C,CAAC,CAAC,KAAK,IAAI,EAAE,KAAK;EAE7E,MAAM,YAAY,WAAW,SAAS;EAEtC,IAAI,aAAa,GAAG;EACpB,MAAM,WAAW,MAAM,MAAM,GAAG,KAAK,IAAI,MAAO,SAAS,CAAC;EAE1D,OAAO,QAAQ,QAAQ;EACvB,UAAU,SAAS,SAAS;EAC5B,IAAI,SAAS,SAAS,MAAM,QAAQ;CACtC;CAEA,OAAO,+FAA+F,OAAO,KAAK,MAAM,IAAI,MAC1H,GACA,QACF;AACF;;;;;;;;;;;AAYA,MAAa,oBACX,SACA,oBACuB;CACvB,IAAI,oBAAoB,KAAA,KAAa,gBAAgB,SAAA,OACnD,OAAO,KAAA;CACT,MAAM,SAAS;CAEf,MAAM,gBACJ,oBAAoB,KAAA,IAAY,KAAA,IAAY,uBAAuB;CAErE,MAAM,SACH,kBAAkB,KAAA,IAAY,IAAI,cAAc,SAAS,KAC1D,uBAAuB,SACvB;CAEF,MAAM,SAAS,uBAAuB,QAAQ;CAC9C,MAAM,OAAsB,CAAC;CAC7B,MAAM,OAAsB,CAAC;CAC7B,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,IAAI,MAAM,QAAQ,SAAS;CAC3B,IAAI;CAEJ,OAAO,SAAS,KAAK;EACnB,MAAM,UAAU,QAAQ;EACxB,MAAM,QAAQ,YAAY,KAAA,IAAY,KAAK,aAAa,OAAO;EAE/D,IAAI,MAAM,SAAS,KAAK,SAAS,MAAM,SAAS,IAAgB,KAAK,MAAM,SAAS,CAAC,GAAG;GACtF,gBAAgB;GAChB;EACF;EACA,IAAI,MAAM,SAAS,GAAG;GACpB,KAAK,KAAK,KAAK;GACf,UAAU,MAAM,SAAS;EAC3B;EACA,SAAS;CACX;CACA,OAAO,OAAO,OAAO;EACnB,MAAM,UAAU,QAAQ;EAExB,MAAM,QACJ,QAAQ,SAAS,kBAAkB,KAAA,IAC/B,gBACA,YAAY,KAAA,IACV,KACA,aAAa,OAAO;EAE5B,IAAI,MAAM,SAAS,KAAK,SAAS,MAAM,SAAS,IAAgB,QAAQ;EACxE,IAAI,MAAM,SAAS,GAAG;GACpB,KAAK,KAAK,KAAK;GACf,UAAU,MAAM,SAAS;EAC3B;EACA,OAAO;CACT;CACA,MAAM,UAAU,MAAM,QAAQ;CAC9B,MAAM,QAAuB,CAAC;CAE9B,IAAI,kBAAkB,KAAA,GACpB,MAAM,KAAK,aAAa;CAE1B,MAAM,KAAK,GAAG,IAAI;CAClB,IAAI,UAAU,GAAG,MAAM,KAAK,MAAM,QAAQ,wCAAwC;CAClF,MAAM,KAAK,GAAG,KAAK,QAAQ,CAAC;CAE5B,OAAO,MAAM,KAAK,MAAM;AAC1B"}

package/dist/core/Agent.d.mts

@@ -0,0 +1,2 @@
+import { A as Tools, C as Requirements, D as RunDispositionSchema, E as RunDispositionFailure, F as withModel, M as UpdatesSchema, N as inspectTools, O as ToolInspection, P as make, S as OutputSchema, T as RunDispositionDeclaration, _ as InstructionSource, a as CompletionFromToolDeclaration, b as NativeModel, c as Definition, d as EncodedInput, f as Failure, g as InstructionResult, h as InputSchema, i as Binding, j as Update, k as ToolUnion, l as DefinitionOptions, m as InputPromptSource, n as Any, o as CompletionProjectionInput, p as Input, r as AnyDefinition, s as CompletionToolDeclaration, u as DefinitionRequirements, v as ModelServices, w as RunDisposition, x as Output, y as Name } from "../Agent-CN0EWRsR.mjs";
+export { Any, AnyDefinition, Binding, CompletionFromToolDeclaration, CompletionProjectionInput, CompletionToolDeclaration, Definition, DefinitionOptions, DefinitionRequirements, EncodedInput, Failure, Input, InputPromptSource, InputSchema, InstructionResult, InstructionSource, ModelServices, Name, NativeModel, Output, OutputSchema, Requirements, RunDisposition, RunDispositionDeclaration, RunDispositionFailure, RunDispositionSchema, ToolInspection, ToolUnion, Tools, Update, UpdatesSchema, inspectTools, make, withModel };

package/dist/core/Agent.mjs

@@ -0,0 +1,2 @@
+import { a as withModel, i as make, n as ToolInspection, r as inspectTools } from "../Agent-RklVROrm.mjs";
+export { ToolInspection, inspectTools, make, withModel };

package/dist/core/AgentError.d.mts

@@ -0,0 +1,2 @@
+import { a as AgentInputError, c as AgentPolicyError, d as ContextBudgetError, f as ContextOverflowError, l as AgentRunDispositionError, m as PolicyLimit, n as AgentApprovalPending, o as AgentInterrupted, p as ModelProtocolError, r as AgentError, s as AgentOutputError, t as AgentApprovalDenied, u as AgentToolAuthorizationDenied } from "../AgentError-CggcAQ7V.mjs";
+export { AgentApprovalDenied, AgentApprovalPending, AgentError, AgentInputError, AgentInterrupted, AgentOutputError, AgentPolicyError, AgentRunDispositionError, AgentToolAuthorizationDenied, ContextBudgetError, ContextOverflowError, ModelProtocolError, PolicyLimit };