agents 0.10.0 → 0.10.1

package/dist/client.d.ts

@@ -1,4 +1,4 @@
-import { r as Agent } from "./index-BPkkIqMn.js";
+import { r as Agent } from "./index-D2lfljd3.js";
 import {
   i as SerializableValue,
   n as RPCMethod,

package/dist/compaction-helpers-BPE1_ziA.js.map

@@ -1 +1 @@
-{"version":3,"file":"compaction-helpers-BPE1_ziA.js","names":[],"sources":["../src/experimental/memory/utils/tokens.ts","../src/experimental/memory/utils/compaction-helpers.ts"],"sourcesContent":["/**\n * Token Estimation Utilities\n *\n * IMPORTANT: These are heuristic estimates, not actual tokenizer counts.\n *\n * We intentionally avoid real tokenizers (e.g. tiktoken, sentencepiece) because:\n * - A single tiktoken instance costs ~80-120MB of heap\n * - Cloudflare Workers have tight memory limits (128MB)\n * - For compaction thresholds, a conservative estimate is sufficient\n *\n * The hybrid approach (max of character-based and word-based estimates) handles\n * both dense token content (JSON, code) and natural language reasonably well.\n *\n * Calibration notes:\n * - Character-based: ~4 chars per token (conservative, from OpenAI guidance)\n * - Word-based: ~1.3 tokens per word (empirical, from Mastra's memory system)\n * - Per-message overhead: ~4 tokens for role/framing (empirical)\n *\n * These ratios are tuned for English. CJK, emoji-heavy, or highly technical\n * content may have different ratios. The conservative estimates help ensure\n * compaction triggers before context windows are actually exceeded.\n */\n\nimport type { UIMessage } from \"ai\";\n\n/** Approximate characters per token for English text */\nexport const CHARS_PER_TOKEN = 4;\n\n/** Approximate token multiplier per whitespace-separated word */\nexport const WORDS_TOKEN_MULTIPLIER = 1.3;\n\n/** Approximate overhead tokens per message (role, framing) */\nexport const TOKENS_PER_MESSAGE = 4;\n\n/**\n * Estimate token count for a string using a hybrid heuristic.\n *\n * Takes the max of two estimates:\n * - Character-based: `length / 4` — better for dense content (JSON, code, URLs)\n * - Word-based: `words * 1.3` — better for natural language prose\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateStringTokens(text: string): number {\n  if (!text) return 0;\n  const charEstimate = text.length / CHARS_PER_TOKEN;\n  const wordEstimate =\n    text.split(/\\s+/).filter(Boolean).length * WORDS_TOKEN_MULTIPLIER;\n  return Math.ceil(Math.max(charEstimate, wordEstimate));\n}\n\n/**\n * Estimate total token count for an array of UIMessages.\n *\n * Walks each message's parts (text, tool invocations, tool results)\n * and applies per-message overhead.\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateMessageTokens(messages: UIMessage[]): number {\n  let tokens = 0;\n  for (const msg of messages) {\n    tokens += TOKENS_PER_MESSAGE;\n    for (const part of msg.parts) {\n      if (part.type === \"text\") {\n        tokens += estimateStringTokens(\n          (part as { type: \"text\"; text: string }).text\n        );\n      } else if (\n        part.type.startsWith(\"tool-\") ||\n        part.type === \"dynamic-tool\"\n      ) {\n        const toolPart = part as { input?: unknown; output?: unknown };\n        if (toolPart.input) {\n          tokens += estimateStringTokens(JSON.stringify(toolPart.input));\n        }\n        if (toolPart.output) {\n          tokens += estimateStringTokens(JSON.stringify(toolPart.output));\n        }\n      }\n    }\n  }\n  return tokens;\n}\n","/**\n * Compaction Helpers\n *\n * Utilities for full compaction (LLM-based summarization).\n * Used by the reference compaction implementation and available\n * for custom CompactFunction implementations.\n */\n\nimport type { UIMessage } from \"ai\";\nimport { estimateMessageTokens } from \"./tokens\";\n\n// ── Compaction ID constants ─────────────────────────────────────────\n\n/** Prefix for all compaction messages (overlays and summaries) */\nexport const COMPACTION_PREFIX = \"compaction_\";\n\n/** Check if a message is a compaction message */\nexport function isCompactionMessage(msg: UIMessage): boolean {\n  return msg.id.startsWith(COMPACTION_PREFIX);\n}\n\n// ── Tool Pair Alignment ──────────────────────────────────────────────\n\n/**\n * Check if a message contains tool invocations.\n */\nfunction hasToolCalls(msg: UIMessage): boolean {\n  return msg.parts.some(\n    (p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\"\n  );\n}\n\n/**\n * Get tool call IDs from a message's parts.\n */\nfunction getToolCallIds(msg: UIMessage): Set<string> {\n  const ids = new Set<string>();\n  for (const part of msg.parts) {\n    if (\n      (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n      \"toolCallId\" in part\n    ) {\n      ids.add((part as { toolCallId: string }).toolCallId);\n    }\n  }\n  return ids;\n}\n\n/**\n * Check if a message is a tool result referencing a specific call ID.\n */\nfunction isToolResultFor(msg: UIMessage, callIds: Set<string>): boolean {\n  return msg.parts.some(\n    (p) =>\n      (p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\") &&\n      \"toolCallId\" in p &&\n      callIds.has((p as { toolCallId: string }).toolCallId)\n  );\n}\n\n/**\n * Align a boundary index forward to avoid splitting tool call/result groups.\n * If the boundary falls between an assistant message with tool calls and its\n * tool results, move it forward past the results.\n */\nexport function alignBoundaryForward(\n  messages: UIMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // Check if the message before the boundary has tool calls\n  const prev = messages[idx - 1];\n  if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n    const callIds = getToolCallIds(prev);\n    // Skip forward past any tool results for these calls\n    while (idx < messages.length && isToolResultFor(messages[idx], callIds)) {\n      idx++;\n    }\n  }\n\n  return idx;\n}\n\n/**\n * Align a boundary index backward to avoid splitting tool call/result groups.\n * If the boundary falls in the middle of tool results, move it backward to\n * include the assistant message that made the calls.\n */\nexport function alignBoundaryBackward(\n  messages: UIMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // If the message at idx is a tool result, walk backward to find the call\n  while (idx > 0) {\n    const msg = messages[idx];\n    if (msg.role === \"assistant\" && hasToolCalls(msg)) {\n      break; // This is a tool call message — include it\n    }\n    // Check if this looks like a tool result (assistant message following another)\n    const prev = messages[idx - 1];\n    if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n      const callIds = getToolCallIds(prev);\n      if (isToolResultFor(msg, callIds)) {\n        idx--; // Move back to include the call\n        continue;\n      }\n    }\n    break;\n  }\n\n  return idx;\n}\n\n// ── Token-Budget Tail Protection ─────────────────────────────────────\n\n/**\n * Find the compression end boundary using a token budget for the tail.\n * Walks backward from the end, accumulating tokens until budget is reached.\n * Returns the index where compression should stop (everything from this\n * index onward is protected).\n *\n * @param messages All messages\n * @param headEnd Index where the protected head ends (compression starts here)\n * @param tailTokenBudget Maximum tokens to keep in the tail\n * @param minTailMessages Minimum messages to protect in the tail (fallback)\n */\nexport function findTailCutByTokens(\n  messages: UIMessage[],\n  headEnd: number,\n  tailTokenBudget = 20000,\n  minTailMessages = 2\n): number {\n  const n = messages.length;\n  let accumulated = 0;\n  let tokenCut = n;\n\n  for (let i = n - 1; i >= headEnd; i--) {\n    const msgTokens = estimateMessageTokens([messages[i]]);\n\n    if (accumulated + msgTokens > tailTokenBudget && tokenCut < n) {\n      // Budget exceeded and we already have at least one tail message\n      break;\n    }\n    accumulated += msgTokens;\n    tokenCut = i;\n  }\n\n  // Protect whichever is larger: token-based tail or minTailMessages\n  const minCut = n - minTailMessages;\n  const cutIdx = minCut >= headEnd ? Math.min(tokenCut, minCut) : tokenCut;\n\n  // Align to avoid splitting tool groups\n  return alignBoundaryBackward(messages, cutIdx);\n}\n\n// ── Tool Pair Sanitization ───────────────────────────────────────────\n\n/**\n * Fix orphaned tool call/result pairs after compaction.\n *\n * Two failure modes:\n * 1. Tool result references a call_id whose assistant tool_call was removed\n *    → Remove the orphaned result\n * 2. Assistant has tool_calls whose results were dropped\n *    → Add stub results so the API doesn't error\n *\n * @param messages Messages after compaction\n * @returns Sanitized messages with no orphaned pairs\n */\nexport function sanitizeToolPairs(messages: UIMessage[]): UIMessage[] {\n  // Build set of surviving tool call IDs (from assistant messages)\n  const survivingCallIds = new Set<string>();\n  for (const msg of messages) {\n    if (msg.role === \"assistant\") {\n      for (const id of getToolCallIds(msg)) {\n        survivingCallIds.add(id);\n      }\n    }\n  }\n\n  // Build set of tool result IDs\n  const resultCallIds = new Set<string>();\n  for (const msg of messages) {\n    for (const part of msg.parts) {\n      if (\n        (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n        \"toolCallId\" in part &&\n        \"output\" in part\n      ) {\n        resultCallIds.add((part as { toolCallId: string }).toolCallId);\n      }\n    }\n  }\n\n  // Remove orphaned results (results whose calls were dropped)\n  const orphanedResults = new Set<string>();\n  for (const id of resultCallIds) {\n    if (!survivingCallIds.has(id)) {\n      orphanedResults.add(id);\n    }\n  }\n\n  let result = messages;\n  if (orphanedResults.size > 0) {\n    result = result.map((msg) => {\n      const filteredParts = msg.parts.filter((part) => {\n        if (\n          (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n          \"toolCallId\" in part &&\n          \"output\" in part\n        ) {\n          return !orphanedResults.has(\n            (part as { toolCallId: string }).toolCallId\n          );\n        }\n        return true;\n      });\n      if (filteredParts.length !== msg.parts.length) {\n        return { ...msg, parts: filteredParts } as UIMessage;\n      }\n      return msg;\n    });\n  }\n\n  // Add stub results for calls whose results were dropped\n  const missingResults = new Set<string>();\n  for (const id of survivingCallIds) {\n    if (!resultCallIds.has(id) && !orphanedResults.has(id)) {\n      missingResults.add(id);\n    }\n  }\n\n  if (missingResults.size > 0) {\n    const patched: UIMessage[] = [];\n    for (const msg of result) {\n      patched.push(msg);\n      if (msg.role === \"assistant\") {\n        for (const id of getToolCallIds(msg)) {\n          if (missingResults.has(id)) {\n            // Find the tool name from the call\n            const callPart = msg.parts.find(\n              (p) =>\n                \"toolCallId\" in p &&\n                (p as { toolCallId: string }).toolCallId === id\n            ) as { toolName?: string } | undefined;\n\n            patched.push({\n              id: `stub-${id}`,\n              role: \"assistant\",\n              parts: [\n                {\n                  type: \"tool-result\" as const,\n                  toolCallId: id,\n                  toolName: callPart?.toolName ?? \"unknown\",\n                  result:\n                    \"[Result from earlier conversation — see context summary above]\"\n                } as unknown as UIMessage[\"parts\"][number]\n              ],\n              createdAt: new Date()\n            } as UIMessage);\n          }\n        }\n      }\n    }\n    result = patched;\n  }\n\n  // Remove empty messages (all parts filtered out)\n  return result.filter((msg) => msg.parts.length > 0);\n}\n\n// ── Summary Budget ───────────────────────────────────────────────────\n\n/**\n * Compute a summary token budget based on the content being compressed.\n * 20% of the compressed content, clamped to 2K-8K tokens.\n */\nexport function computeSummaryBudget(messages: UIMessage[]): number {\n  const contentTokens = estimateMessageTokens(messages);\n  // Summary is ~20% of the content being compressed.\n  // The summary replaces the compressed middle, so it's sized relative\n  // to what it's replacing — not the tail budget (they occupy different\n  // slots in the context window).\n  const budget = Math.floor(contentTokens * 0.2);\n  return Math.max(100, budget);\n}\n\n// ── Structured Summary Prompt ────────────────────────────────────────\n\n/**\n * Build a prompt for LLM summarization of compressed messages.\n *\n * @param messages Messages to summarize\n * @param previousSummary Previous summary for iterative updates (or null for first compaction)\n * @param budget Target token count for the summary\n */\nexport function buildSummaryPrompt(\n  messages: UIMessage[],\n  previousSummary: string | null,\n  budget: number\n): string {\n  const content = messages\n    .map((msg) => {\n      const textParts = msg.parts\n        .filter((p) => p.type === \"text\")\n        .map((p) => (p as { text: string }).text)\n        .join(\"\\n\");\n\n      const toolParts = msg.parts\n        .filter((p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\")\n        .map((p) => {\n          const tp = p as {\n            toolName?: string;\n            input?: unknown;\n            output?: unknown;\n          };\n          const parts = [`[Tool: ${tp.toolName ?? \"unknown\"}]`];\n          if (tp.input)\n            parts.push(`Input: ${JSON.stringify(tp.input).slice(0, 500)}`);\n          if (tp.output)\n            parts.push(`Output: ${String(tp.output).slice(0, 500)}`);\n          return parts.join(\"\\n\");\n        })\n        .join(\"\\n\");\n\n      return `[${msg.role}]\\n${textParts}${toolParts ? \"\\n\" + toolParts : \"\"}`;\n    })\n    .join(\"\\n\\n---\\n\\n\");\n\n  if (previousSummary) {\n    return `You are updating a conversation summary. A previous summary exists below. New conversation turns have occurred since then and need to be incorporated.\n\nPREVIOUS SUMMARY:\n${previousSummary}\n\nNEW TURNS TO INCORPORATE:\n${content}\n\nUpdate the summary. PRESERVE existing information that is still relevant. ADD new information. Remove information only if it is clearly obsolete.\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n  }\n\n  return `Create a concise summary of this conversation that preserves the important information for future context.\n\nCONVERSATION TO SUMMARIZE:\n${content}\n\nUse this structure:\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n}\n\n// ── Reference Compaction Implementation ──────────────────────────────\n\n/**\n * Result of a compaction function — describes the overlay to store.\n */\nexport interface CompactResult {\n  /** First message ID in the compacted range */\n  fromMessageId: string;\n  /** Last message ID in the compacted range */\n  toMessageId: string;\n  /** Summary text to store as the overlay */\n  summary: string;\n}\n\nexport interface CompactOptions {\n  /**\n   * Function to call the LLM for summarization.\n   * Takes a user prompt string, returns the LLM's text response.\n   */\n  summarize: (prompt: string) => Promise<string>;\n\n  /** Number of head messages to protect (default: 2) */\n  protectHead?: number;\n\n  /** Token budget for tail protection (default: 20000) */\n  tailTokenBudget?: number;\n\n  /** Minimum tail messages to protect (default: 2) */\n  minTailMessages?: number;\n}\n\n/**\n * Reference compaction implementation.\n *\n * Implements the full hermes-style compaction algorithm:\n * 1. Protect head messages (first N)\n * 2. Protect tail by token budget (walk backward)\n * 3. Align boundaries to tool call groups\n * 4. Summarize middle section with LLM (structured format)\n * 5. Sanitize orphaned tool pairs\n * 6. Iterative summary updates on subsequent compactions\n *\n * @example\n * ```typescript\n * import { createCompactFunction } from \"agents/experimental/memory/utils\";\n *\n * const session = new Session(provider, {\n *   compaction: {\n *     tokenThreshold: 100000,\n *     fn: createCompactFunction({\n *       summarize: (prompt) => generateText({ model, prompt }).then(r => r.text)\n *     })\n *   }\n * });\n * ```\n */\nexport function createCompactFunction(opts: CompactOptions) {\n  const protectHead = opts.protectHead ?? 3;\n  const tailTokenBudget = opts.tailTokenBudget ?? 20000;\n  const minTailMessages = opts.minTailMessages ?? 2;\n\n  return async (messages: UIMessage[]): Promise<CompactResult | null> => {\n    if (messages.length <= protectHead + minTailMessages) {\n      return null;\n    }\n\n    // 1. Find compression boundaries\n    let compressStart = protectHead;\n    compressStart = alignBoundaryForward(messages, compressStart);\n\n    let compressEnd = findTailCutByTokens(\n      messages,\n      compressStart,\n      tailTokenBudget,\n      minTailMessages\n    );\n\n    if (compressEnd <= compressStart) {\n      return null;\n    }\n\n    // Filter out compaction overlay messages — they have virtual IDs\n    // and should not be included in the summary prompt or used as range IDs\n    const middleMessages = messages\n      .slice(compressStart, compressEnd)\n      .filter((m) => !isCompactionMessage(m));\n\n    if (middleMessages.length === 0) return null;\n\n    // 2. Generate summary — extract previous summary from compaction overlays\n    const existingCompaction = messages.find(isCompactionMessage);\n    const previousSummary = existingCompaction\n      ? existingCompaction.parts\n          .filter((p) => p.type === \"text\")\n          .map((p) => (p as { text: string }).text)\n          .join(\"\\n\")\n      : null;\n\n    const budget = computeSummaryBudget(middleMessages);\n    const prompt = buildSummaryPrompt(middleMessages, previousSummary, budget);\n    const summary = await opts.summarize(prompt);\n\n    if (!summary.trim()) return null;\n\n    return {\n      fromMessageId: middleMessages[0].id,\n      toMessageId: middleMessages[middleMessages.length - 1].id,\n      summary\n    };\n  };\n}\n"],"mappings":";;AA0BA,MAAa,kBAAkB;;AAG/B,MAAa,yBAAyB;;AAGtC,MAAa,qBAAqB;;;;;;;;;;AAWlC,SAAgB,qBAAqB,MAAsB;AACzD,KAAI,CAAC,KAAM,QAAO;CAClB,MAAM,eAAe,KAAK,SAAA;CAC1B,MAAM,eACJ,KAAK,MAAM,MAAM,CAAC,OAAO,QAAQ,CAAC,SAAS;AAC7C,QAAO,KAAK,KAAK,KAAK,IAAI,cAAc,aAAa,CAAC;;;;;;;;;;AAWxD,SAAgB,sBAAsB,UAA+B;CACnE,IAAI,SAAS;AACb,MAAK,MAAM,OAAO,UAAU;AAC1B,YAAA;AACA,OAAK,MAAM,QAAQ,IAAI,MACrB,KAAI,KAAK,SAAS,OAChB,WAAU,qBACP,KAAwC,KAC1C;WAED,KAAK,KAAK,WAAW,QAAQ,IAC7B,KAAK,SAAS,gBACd;GACA,MAAM,WAAW;AACjB,OAAI,SAAS,MACX,WAAU,qBAAqB,KAAK,UAAU,SAAS,MAAM,CAAC;AAEhE,OAAI,SAAS,OACX,WAAU,qBAAqB,KAAK,UAAU,SAAS,OAAO,CAAC;;;AAKvE,QAAO;;;;;ACpET,MAAa,oBAAoB;;AAGjC,SAAgB,oBAAoB,KAAyB;AAC3D,QAAO,IAAI,GAAG,WAAW,kBAAkB;;;;;AAQ7C,SAAS,aAAa,KAAyB;AAC7C,QAAO,IAAI,MAAM,MACd,MAAM,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,eACjD;;;;;AAMH,SAAS,eAAe,KAA6B;CACnD,MAAM,sBAAM,IAAI,KAAa;AAC7B,MAAK,MAAM,QAAQ,IAAI,MACrB,MACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,KAEhB,KAAI,IAAK,KAAgC,WAAW;AAGxD,QAAO;;;;;AAMT,SAAS,gBAAgB,KAAgB,SAA+B;AACtE,QAAO,IAAI,MAAM,MACd,OACE,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,mBAC1C,gBAAgB,KAChB,QAAQ,IAAK,EAA6B,WAAW,CACxD;;;;;;;AAQH,SAAgB,qBACd,UACA,KACQ;AACR,KAAI,OAAO,KAAK,OAAO,SAAS,OAAQ,QAAO;CAG/C,MAAM,OAAO,SAAS,MAAM;AAC5B,KAAI,KAAK,SAAS,eAAe,aAAa,KAAK,EAAE;EACnD,MAAM,UAAU,eAAe,KAAK;AAEpC,SAAO,MAAM,SAAS,UAAU,gBAAgB,SAAS,MAAM,QAAQ,CACrE;;AAIJ,QAAO;;;;;;;AAQT,SAAgB,sBACd,UACA,KACQ;AACR,KAAI,OAAO,KAAK,OAAO,SAAS,OAAQ,QAAO;AAG/C,QAAO,MAAM,GAAG;EACd,MAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,eAAe,aAAa,IAAI,CAC/C;EAGF,MAAM,OAAO,SAAS,MAAM;AAC5B,MAAI,KAAK,SAAS,eAAe,aAAa,KAAK;OAE7C,gBAAgB,KADJ,eAAe,KAAK,CACH,EAAE;AACjC;AACA;;;AAGJ;;AAGF,QAAO;;;;;;;;;;;;;AAgBT,SAAgB,oBACd,UACA,SACA,kBAAkB,KAClB,kBAAkB,GACV;CACR,MAAM,IAAI,SAAS;CACnB,IAAI,cAAc;CAClB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;EACrC,MAAM,YAAY,sBAAsB,CAAC,SAAS,GAAG,CAAC;AAEtD,MAAI,cAAc,YAAY,mBAAmB,WAAW,EAE1D;AAEF,iBAAe;AACf,aAAW;;CAIb,MAAM,SAAS,IAAI;AAInB,QAAO,sBAAsB,UAHd,UAAU,UAAU,KAAK,IAAI,UAAU,OAAO,GAAG,SAGlB;;;;;;;;;;;;;;AAiBhD,SAAgB,kBAAkB,UAAoC;CAEpE,MAAM,mCAAmB,IAAI,KAAa;AAC1C,MAAK,MAAM,OAAO,SAChB,KAAI,IAAI,SAAS,YACf,MAAK,MAAM,MAAM,eAAe,IAAI,CAClC,kBAAiB,IAAI,GAAG;CAM9B,MAAM,gCAAgB,IAAI,KAAa;AACvC,MAAK,MAAM,OAAO,SAChB,MAAK,MAAM,QAAQ,IAAI,MACrB,MACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,KAEZ,eAAc,IAAK,KAAgC,WAAW;CAMpE,MAAM,kCAAkB,IAAI,KAAa;AACzC,MAAK,MAAM,MAAM,cACf,KAAI,CAAC,iBAAiB,IAAI,GAAG,CAC3B,iBAAgB,IAAI,GAAG;CAI3B,IAAI,SAAS;AACb,KAAI,gBAAgB,OAAO,EACzB,UAAS,OAAO,KAAK,QAAQ;EAC3B,MAAM,gBAAgB,IAAI,MAAM,QAAQ,SAAS;AAC/C,QACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,KAEZ,QAAO,CAAC,gBAAgB,IACrB,KAAgC,WAClC;AAEH,UAAO;IACP;AACF,MAAI,cAAc,WAAW,IAAI,MAAM,OACrC,QAAO;GAAE,GAAG;GAAK,OAAO;GAAe;AAEzC,SAAO;GACP;CAIJ,MAAM,iCAAiB,IAAI,KAAa;AACxC,MAAK,MAAM,MAAM,iBACf,KAAI,CAAC,cAAc,IAAI,GAAG,IAAI,CAAC,gBAAgB,IAAI,GAAG,CACpD,gBAAe,IAAI,GAAG;AAI1B,KAAI,eAAe,OAAO,GAAG;EAC3B,MAAM,UAAuB,EAAE;AAC/B,OAAK,MAAM,OAAO,QAAQ;AACxB,WAAQ,KAAK,IAAI;AACjB,OAAI,IAAI,SAAS;SACV,MAAM,MAAM,eAAe,IAAI,CAClC,KAAI,eAAe,IAAI,GAAG,EAAE;KAE1B,MAAM,WAAW,IAAI,MAAM,MACxB,MACC,gBAAgB,KACf,EAA6B,eAAe,GAChD;AAED,aAAQ,KAAK;MACX,IAAI,QAAQ;MACZ,MAAM;MACN,OAAO,CACL;OACE,MAAM;OACN,YAAY;OACZ,UAAU,UAAU,YAAY;OAChC,QACE;OACH,CACF;MACD,2BAAW,IAAI,MAAM;MACtB,CAAc;;;;AAKvB,WAAS;;AAIX,QAAO,OAAO,QAAQ,QAAQ,IAAI,MAAM,SAAS,EAAE;;;;;;AASrD,SAAgB,qBAAqB,UAA+B;CAClE,MAAM,gBAAgB,sBAAsB,SAAS;CAKrD,MAAM,SAAS,KAAK,MAAM,gBAAgB,GAAI;AAC9C,QAAO,KAAK,IAAI,KAAK,OAAO;;;;;;;;;AAY9B,SAAgB,mBACd,UACA,iBACA,QACQ;CACR,MAAM,UAAU,SACb,KAAK,QAAQ;EACZ,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,SAAS,OAAO,CAChC,KAAK,MAAO,EAAuB,KAAK,CACxC,KAAK,KAAK;EAEb,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,eAAe,CACtE,KAAK,MAAM;GACV,MAAM,KAAK;GAKX,MAAM,QAAQ,CAAC,UAAU,GAAG,YAAY,UAAU,GAAG;AACrD,OAAI,GAAG,MACL,OAAM,KAAK,UAAU,KAAK,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,GAAG;AAChE,OAAI,GAAG,OACL,OAAM,KAAK,WAAW,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,GAAG;AAC1D,UAAO,MAAM,KAAK,KAAK;IACvB,CACD,KAAK,KAAK;AAEb,SAAO,IAAI,IAAI,KAAK,KAAK,YAAY,YAAY,OAAO,YAAY;GACpE,CACD,KAAK,cAAc;AAEtB,KAAI,gBACF,QAAO;;;EAGT,gBAAgB;;;EAGhB,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;AAGf,QAAO;;;EAGP,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DjB,SAAgB,sBAAsB,MAAsB;CAC1D,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,kBAAkB,KAAK,mBAAmB;CAChD,MAAM,kBAAkB,KAAK,mBAAmB;AAEhD,QAAO,OAAO,aAAyD;AACrE,MAAI,SAAS,UAAU,cAAc,gBACnC,QAAO;EAIT,IAAI,gBAAgB;AACpB,kBAAgB,qBAAqB,UAAU,cAAc;EAE7D,IAAI,cAAc,oBAChB,UACA,eACA,iBACA,gBACD;AAED,MAAI,eAAe,cACjB,QAAO;EAKT,MAAM,iBAAiB,SACpB,MAAM,eAAe,YAAY,CACjC,QAAQ,MAAM,CAAC,oBAAoB,EAAE,CAAC;AAEzC,MAAI,eAAe,WAAW,EAAG,QAAO;EAGxC,MAAM,qBAAqB,SAAS,KAAK,oBAAoB;EAS7D,MAAM,SAAS,mBAAmB,gBARV,qBACpB,mBAAmB,MAChB,QAAQ,MAAM,EAAE,SAAS,OAAO,CAChC,KAAK,MAAO,EAAuB,KAAK,CACxC,KAAK,KAAK,GACb,MAEW,qBAAqB,eAAe,CACuB;EAC1E,MAAM,UAAU,MAAM,KAAK,UAAU,OAAO;AAE5C,MAAI,CAAC,QAAQ,MAAM,CAAE,QAAO;AAE5B,SAAO;GACL,eAAe,eAAe,GAAG;GACjC,aAAa,eAAe,eAAe,SAAS,GAAG;GACvD;GACD"}
+{"version":3,"file":"compaction-helpers-BPE1_ziA.js","names":[],"sources":["../src/experimental/memory/utils/tokens.ts","../src/experimental/memory/utils/compaction-helpers.ts"],"sourcesContent":["/**\n * Token Estimation Utilities\n *\n * IMPORTANT: These are heuristic estimates, not actual tokenizer counts.\n *\n * We intentionally avoid real tokenizers (e.g. tiktoken, sentencepiece) because:\n * - A single tiktoken instance costs ~80-120MB of heap\n * - Cloudflare Workers have tight memory limits (128MB)\n * - For compaction thresholds, a conservative estimate is sufficient\n *\n * The hybrid approach (max of character-based and word-based estimates) handles\n * both dense token content (JSON, code) and natural language reasonably well.\n *\n * Calibration notes:\n * - Character-based: ~4 chars per token (conservative, from OpenAI guidance)\n * - Word-based: ~1.3 tokens per word (empirical, from Mastra's memory system)\n * - Per-message overhead: ~4 tokens for role/framing (empirical)\n *\n * These ratios are tuned for English. CJK, emoji-heavy, or highly technical\n * content may have different ratios. The conservative estimates help ensure\n * compaction triggers before context windows are actually exceeded.\n */\n\nimport type { SessionMessage } from \"../session/types\";\n\n/** Approximate characters per token for English text */\nexport const CHARS_PER_TOKEN = 4;\n\n/** Approximate token multiplier per whitespace-separated word */\nexport const WORDS_TOKEN_MULTIPLIER = 1.3;\n\n/** Approximate overhead tokens per message (role, framing) */\nexport const TOKENS_PER_MESSAGE = 4;\n\n/**\n * Estimate token count for a string using a hybrid heuristic.\n *\n * Takes the max of two estimates:\n * - Character-based: `length / 4` — better for dense content (JSON, code, URLs)\n * - Word-based: `words * 1.3` — better for natural language prose\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateStringTokens(text: string): number {\n  if (!text) return 0;\n  const charEstimate = text.length / CHARS_PER_TOKEN;\n  const wordEstimate =\n    text.split(/\\s+/).filter(Boolean).length * WORDS_TOKEN_MULTIPLIER;\n  return Math.ceil(Math.max(charEstimate, wordEstimate));\n}\n\n/**\n * Estimate total token count for an array of UIMessages.\n *\n * Walks each message's parts (text, tool invocations, tool results)\n * and applies per-message overhead.\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateMessageTokens(messages: SessionMessage[]): number {\n  let tokens = 0;\n  for (const msg of messages) {\n    tokens += TOKENS_PER_MESSAGE;\n    for (const part of msg.parts) {\n      if (part.type === \"text\") {\n        tokens += estimateStringTokens(\n          (part as { type: \"text\"; text: string }).text\n        );\n      } else if (\n        part.type.startsWith(\"tool-\") ||\n        part.type === \"dynamic-tool\"\n      ) {\n        const toolPart = part as { input?: unknown; output?: unknown };\n        if (toolPart.input) {\n          tokens += estimateStringTokens(JSON.stringify(toolPart.input));\n        }\n        if (toolPart.output) {\n          tokens += estimateStringTokens(JSON.stringify(toolPart.output));\n        }\n      }\n    }\n  }\n  return tokens;\n}\n","/**\n * Compaction Helpers\n *\n * Utilities for full compaction (LLM-based summarization).\n * Used by the reference compaction implementation and available\n * for custom CompactFunction implementations.\n */\n\nimport type { SessionMessage } from \"../session/types\";\nimport { estimateMessageTokens } from \"./tokens\";\n\n// ── Compaction ID constants ─────────────────────────────────────────\n\n/** Prefix for all compaction messages (overlays and summaries) */\nexport const COMPACTION_PREFIX = \"compaction_\";\n\n/** Check if a message is a compaction message */\nexport function isCompactionMessage(msg: SessionMessage): boolean {\n  return msg.id.startsWith(COMPACTION_PREFIX);\n}\n\n// ── Tool Pair Alignment ──────────────────────────────────────────────\n\n/**\n * Check if a message contains tool invocations.\n */\nfunction hasToolCalls(msg: SessionMessage): boolean {\n  return msg.parts.some(\n    (p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\"\n  );\n}\n\n/**\n * Get tool call IDs from a message's parts.\n */\nfunction getToolCallIds(msg: SessionMessage): Set<string> {\n  const ids = new Set<string>();\n  for (const part of msg.parts) {\n    if (\n      (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n      \"toolCallId\" in part\n    ) {\n      ids.add((part as { toolCallId: string }).toolCallId);\n    }\n  }\n  return ids;\n}\n\n/**\n * Check if a message is a tool result referencing a specific call ID.\n */\nfunction isToolResultFor(msg: SessionMessage, callIds: Set<string>): boolean {\n  return msg.parts.some(\n    (p) =>\n      (p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\") &&\n      \"toolCallId\" in p &&\n      callIds.has((p as { toolCallId: string }).toolCallId)\n  );\n}\n\n/**\n * Align a boundary index forward to avoid splitting tool call/result groups.\n * If the boundary falls between an assistant message with tool calls and its\n * tool results, move it forward past the results.\n */\nexport function alignBoundaryForward(\n  messages: SessionMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // Check if the message before the boundary has tool calls\n  const prev = messages[idx - 1];\n  if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n    const callIds = getToolCallIds(prev);\n    // Skip forward past any tool results for these calls\n    while (idx < messages.length && isToolResultFor(messages[idx], callIds)) {\n      idx++;\n    }\n  }\n\n  return idx;\n}\n\n/**\n * Align a boundary index backward to avoid splitting tool call/result groups.\n * If the boundary falls in the middle of tool results, move it backward to\n * include the assistant message that made the calls.\n */\nexport function alignBoundaryBackward(\n  messages: SessionMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // If the message at idx is a tool result, walk backward to find the call\n  while (idx > 0) {\n    const msg = messages[idx];\n    if (msg.role === \"assistant\" && hasToolCalls(msg)) {\n      break; // This is a tool call message — include it\n    }\n    // Check if this looks like a tool result (assistant message following another)\n    const prev = messages[idx - 1];\n    if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n      const callIds = getToolCallIds(prev);\n      if (isToolResultFor(msg, callIds)) {\n        idx--; // Move back to include the call\n        continue;\n      }\n    }\n    break;\n  }\n\n  return idx;\n}\n\n// ── Token-Budget Tail Protection ─────────────────────────────────────\n\n/**\n * Find the compression end boundary using a token budget for the tail.\n * Walks backward from the end, accumulating tokens until budget is reached.\n * Returns the index where compression should stop (everything from this\n * index onward is protected).\n *\n * @param messages All messages\n * @param headEnd Index where the protected head ends (compression starts here)\n * @param tailTokenBudget Maximum tokens to keep in the tail\n * @param minTailMessages Minimum messages to protect in the tail (fallback)\n */\nexport function findTailCutByTokens(\n  messages: SessionMessage[],\n  headEnd: number,\n  tailTokenBudget = 20000,\n  minTailMessages = 2\n): number {\n  const n = messages.length;\n  let accumulated = 0;\n  let tokenCut = n;\n\n  for (let i = n - 1; i >= headEnd; i--) {\n    const msgTokens = estimateMessageTokens([messages[i]]);\n\n    if (accumulated + msgTokens > tailTokenBudget && tokenCut < n) {\n      // Budget exceeded and we already have at least one tail message\n      break;\n    }\n    accumulated += msgTokens;\n    tokenCut = i;\n  }\n\n  // Protect whichever is larger: token-based tail or minTailMessages\n  const minCut = n - minTailMessages;\n  const cutIdx = minCut >= headEnd ? Math.min(tokenCut, minCut) : tokenCut;\n\n  // Align to avoid splitting tool groups\n  return alignBoundaryBackward(messages, cutIdx);\n}\n\n// ── Tool Pair Sanitization ───────────────────────────────────────────\n\n/**\n * Fix orphaned tool call/result pairs after compaction.\n *\n * Two failure modes:\n * 1. Tool result references a call_id whose assistant tool_call was removed\n *    → Remove the orphaned result\n * 2. Assistant has tool_calls whose results were dropped\n *    → Add stub results so the API doesn't error\n *\n * @param messages Messages after compaction\n * @returns Sanitized messages with no orphaned pairs\n */\nexport function sanitizeToolPairs(\n  messages: SessionMessage[]\n): SessionMessage[] {\n  // Build set of surviving tool call IDs (from assistant messages)\n  const survivingCallIds = new Set<string>();\n  for (const msg of messages) {\n    if (msg.role === \"assistant\") {\n      for (const id of getToolCallIds(msg)) {\n        survivingCallIds.add(id);\n      }\n    }\n  }\n\n  // Build set of tool result IDs\n  const resultCallIds = new Set<string>();\n  for (const msg of messages) {\n    for (const part of msg.parts) {\n      if (\n        (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n        \"toolCallId\" in part &&\n        \"output\" in part\n      ) {\n        resultCallIds.add((part as { toolCallId: string }).toolCallId);\n      }\n    }\n  }\n\n  // Remove orphaned results (results whose calls were dropped)\n  const orphanedResults = new Set<string>();\n  for (const id of resultCallIds) {\n    if (!survivingCallIds.has(id)) {\n      orphanedResults.add(id);\n    }\n  }\n\n  let result = messages;\n  if (orphanedResults.size > 0) {\n    result = result.map((msg) => {\n      const filteredParts = msg.parts.filter((part) => {\n        if (\n          (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n          \"toolCallId\" in part &&\n          \"output\" in part\n        ) {\n          return !orphanedResults.has(\n            (part as { toolCallId: string }).toolCallId\n          );\n        }\n        return true;\n      });\n      if (filteredParts.length !== msg.parts.length) {\n        return { ...msg, parts: filteredParts } as SessionMessage;\n      }\n      return msg;\n    });\n  }\n\n  // Add stub results for calls whose results were dropped\n  const missingResults = new Set<string>();\n  for (const id of survivingCallIds) {\n    if (!resultCallIds.has(id) && !orphanedResults.has(id)) {\n      missingResults.add(id);\n    }\n  }\n\n  if (missingResults.size > 0) {\n    const patched: SessionMessage[] = [];\n    for (const msg of result) {\n      patched.push(msg);\n      if (msg.role === \"assistant\") {\n        for (const id of getToolCallIds(msg)) {\n          if (missingResults.has(id)) {\n            // Find the tool name from the call\n            const callPart = msg.parts.find(\n              (p) =>\n                \"toolCallId\" in p &&\n                (p as { toolCallId: string }).toolCallId === id\n            ) as { toolName?: string } | undefined;\n\n            patched.push({\n              id: `stub-${id}`,\n              role: \"assistant\",\n              parts: [\n                {\n                  type: \"tool-result\" as const,\n                  toolCallId: id,\n                  toolName: callPart?.toolName ?? \"unknown\",\n                  result:\n                    \"[Result from earlier conversation — see context summary above]\"\n                } as unknown as SessionMessage[\"parts\"][number]\n              ],\n              createdAt: new Date()\n            } as SessionMessage);\n          }\n        }\n      }\n    }\n    result = patched;\n  }\n\n  // Remove empty messages (all parts filtered out)\n  return result.filter((msg) => msg.parts.length > 0);\n}\n\n// ── Summary Budget ───────────────────────────────────────────────────\n\n/**\n * Compute a summary token budget based on the content being compressed.\n * 20% of the compressed content, clamped to 2K-8K tokens.\n */\nexport function computeSummaryBudget(messages: SessionMessage[]): number {\n  const contentTokens = estimateMessageTokens(messages);\n  // Summary is ~20% of the content being compressed.\n  // The summary replaces the compressed middle, so it's sized relative\n  // to what it's replacing — not the tail budget (they occupy different\n  // slots in the context window).\n  const budget = Math.floor(contentTokens * 0.2);\n  return Math.max(100, budget);\n}\n\n// ── Structured Summary Prompt ────────────────────────────────────────\n\n/**\n * Build a prompt for LLM summarization of compressed messages.\n *\n * @param messages Messages to summarize\n * @param previousSummary Previous summary for iterative updates (or null for first compaction)\n * @param budget Target token count for the summary\n */\nexport function buildSummaryPrompt(\n  messages: SessionMessage[],\n  previousSummary: string | null,\n  budget: number\n): string {\n  const content = messages\n    .map((msg) => {\n      const textParts = msg.parts\n        .filter((p) => p.type === \"text\")\n        .map((p) => (p as { text: string }).text)\n        .join(\"\\n\");\n\n      const toolParts = msg.parts\n        .filter((p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\")\n        .map((p) => {\n          const tp = p as {\n            toolName?: string;\n            input?: unknown;\n            output?: unknown;\n          };\n          const parts = [`[Tool: ${tp.toolName ?? \"unknown\"}]`];\n          if (tp.input)\n            parts.push(`Input: ${JSON.stringify(tp.input).slice(0, 500)}`);\n          if (tp.output)\n            parts.push(`Output: ${String(tp.output).slice(0, 500)}`);\n          return parts.join(\"\\n\");\n        })\n        .join(\"\\n\");\n\n      return `[${msg.role}]\\n${textParts}${toolParts ? \"\\n\" + toolParts : \"\"}`;\n    })\n    .join(\"\\n\\n---\\n\\n\");\n\n  if (previousSummary) {\n    return `You are updating a conversation summary. A previous summary exists below. New conversation turns have occurred since then and need to be incorporated.\n\nPREVIOUS SUMMARY:\n${previousSummary}\n\nNEW TURNS TO INCORPORATE:\n${content}\n\nUpdate the summary. PRESERVE existing information that is still relevant. ADD new information. Remove information only if it is clearly obsolete.\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n  }\n\n  return `Create a concise summary of this conversation that preserves the important information for future context.\n\nCONVERSATION TO SUMMARIZE:\n${content}\n\nUse this structure:\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n}\n\n// ── Reference Compaction Implementation ──────────────────────────────\n\n/**\n * Result of a compaction function — describes the overlay to store.\n */\nexport interface CompactResult {\n  /** First message ID in the compacted range */\n  fromMessageId: string;\n  /** Last message ID in the compacted range */\n  toMessageId: string;\n  /** Summary text to store as the overlay */\n  summary: string;\n}\n\nexport interface CompactOptions {\n  /**\n   * Function to call the LLM for summarization.\n   * Takes a user prompt string, returns the LLM's text response.\n   */\n  summarize: (prompt: string) => Promise<string>;\n\n  /** Number of head messages to protect (default: 2) */\n  protectHead?: number;\n\n  /** Token budget for tail protection (default: 20000) */\n  tailTokenBudget?: number;\n\n  /** Minimum tail messages to protect (default: 2) */\n  minTailMessages?: number;\n}\n\n/**\n * Reference compaction implementation.\n *\n * Implements the full hermes-style compaction algorithm:\n * 1. Protect head messages (first N)\n * 2. Protect tail by token budget (walk backward)\n * 3. Align boundaries to tool call groups\n * 4. Summarize middle section with LLM (structured format)\n * 5. Sanitize orphaned tool pairs\n * 6. Iterative summary updates on subsequent compactions\n *\n * @example\n * ```typescript\n * import { createCompactFunction } from \"agents/experimental/memory/utils\";\n *\n * const session = new Session(provider, {\n *   compaction: {\n *     tokenThreshold: 100000,\n *     fn: createCompactFunction({\n *       summarize: (prompt) => generateText({ model, prompt }).then(r => r.text)\n *     })\n *   }\n * });\n * ```\n */\nexport function createCompactFunction(opts: CompactOptions) {\n  const protectHead = opts.protectHead ?? 3;\n  const tailTokenBudget = opts.tailTokenBudget ?? 20000;\n  const minTailMessages = opts.minTailMessages ?? 2;\n\n  return async (messages: SessionMessage[]): Promise<CompactResult | null> => {\n    if (messages.length <= protectHead + minTailMessages) {\n      return null;\n    }\n\n    // 1. Find compression boundaries\n    let compressStart = protectHead;\n    compressStart = alignBoundaryForward(messages, compressStart);\n\n    let compressEnd = findTailCutByTokens(\n      messages,\n      compressStart,\n      tailTokenBudget,\n      minTailMessages\n    );\n\n    if (compressEnd <= compressStart) {\n      return null;\n    }\n\n    // Filter out compaction overlay messages — they have virtual IDs\n    // and should not be included in the summary prompt or used as range IDs\n    const middleMessages = messages\n      .slice(compressStart, compressEnd)\n      .filter((m) => !isCompactionMessage(m));\n\n    if (middleMessages.length === 0) return null;\n\n    // 2. Generate summary — extract previous summary from compaction overlays\n    const existingCompaction = messages.find(isCompactionMessage);\n    const previousSummary = existingCompaction\n      ? existingCompaction.parts\n          .filter((p) => p.type === \"text\")\n          .map((p) => (p as { text: string }).text)\n          .join(\"\\n\")\n      : null;\n\n    const budget = computeSummaryBudget(middleMessages);\n    const prompt = buildSummaryPrompt(middleMessages, previousSummary, budget);\n    const summary = await opts.summarize(prompt);\n\n    if (!summary.trim()) return null;\n\n    return {\n      fromMessageId: middleMessages[0].id,\n      toMessageId: middleMessages[middleMessages.length - 1].id,\n      summary\n    };\n  };\n}\n"],"mappings":";;AA0BA,MAAa,kBAAkB;;AAG/B,MAAa,yBAAyB;;AAGtC,MAAa,qBAAqB;;;;;;;;;;AAWlC,SAAgB,qBAAqB,MAAsB;AACzD,KAAI,CAAC,KAAM,QAAO;CAClB,MAAM,eAAe,KAAK,SAAA;CAC1B,MAAM,eACJ,KAAK,MAAM,MAAM,CAAC,OAAO,QAAQ,CAAC,SAAS;AAC7C,QAAO,KAAK,KAAK,KAAK,IAAI,cAAc,aAAa,CAAC;;;;;;;;;;AAWxD,SAAgB,sBAAsB,UAAoC;CACxE,IAAI,SAAS;AACb,MAAK,MAAM,OAAO,UAAU;AAC1B,YAAA;AACA,OAAK,MAAM,QAAQ,IAAI,MACrB,KAAI,KAAK,SAAS,OAChB,WAAU,qBACP,KAAwC,KAC1C;WAED,KAAK,KAAK,WAAW,QAAQ,IAC7B,KAAK,SAAS,gBACd;GACA,MAAM,WAAW;AACjB,OAAI,SAAS,MACX,WAAU,qBAAqB,KAAK,UAAU,SAAS,MAAM,CAAC;AAEhE,OAAI,SAAS,OACX,WAAU,qBAAqB,KAAK,UAAU,SAAS,OAAO,CAAC;;;AAKvE,QAAO;;;;;ACpET,MAAa,oBAAoB;;AAGjC,SAAgB,oBAAoB,KAA8B;AAChE,QAAO,IAAI,GAAG,WAAW,kBAAkB;;;;;AAQ7C,SAAS,aAAa,KAA8B;AAClD,QAAO,IAAI,MAAM,MACd,MAAM,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,eACjD;;;;;AAMH,SAAS,eAAe,KAAkC;CACxD,MAAM,sBAAM,IAAI,KAAa;AAC7B,MAAK,MAAM,QAAQ,IAAI,MACrB,MACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,KAEhB,KAAI,IAAK,KAAgC,WAAW;AAGxD,QAAO;;;;;AAMT,SAAS,gBAAgB,KAAqB,SAA+B;AAC3E,QAAO,IAAI,MAAM,MACd,OACE,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,mBAC1C,gBAAgB,KAChB,QAAQ,IAAK,EAA6B,WAAW,CACxD;;;;;;;AAQH,SAAgB,qBACd,UACA,KACQ;AACR,KAAI,OAAO,KAAK,OAAO,SAAS,OAAQ,QAAO;CAG/C,MAAM,OAAO,SAAS,MAAM;AAC5B,KAAI,KAAK,SAAS,eAAe,aAAa,KAAK,EAAE;EACnD,MAAM,UAAU,eAAe,KAAK;AAEpC,SAAO,MAAM,SAAS,UAAU,gBAAgB,SAAS,MAAM,QAAQ,CACrE;;AAIJ,QAAO;;;;;;;AAQT,SAAgB,sBACd,UACA,KACQ;AACR,KAAI,OAAO,KAAK,OAAO,SAAS,OAAQ,QAAO;AAG/C,QAAO,MAAM,GAAG;EACd,MAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,eAAe,aAAa,IAAI,CAC/C;EAGF,MAAM,OAAO,SAAS,MAAM;AAC5B,MAAI,KAAK,SAAS,eAAe,aAAa,KAAK;OAE7C,gBAAgB,KADJ,eAAe,KAAK,CACH,EAAE;AACjC;AACA;;;AAGJ;;AAGF,QAAO;;;;;;;;;;;;;AAgBT,SAAgB,oBACd,UACA,SACA,kBAAkB,KAClB,kBAAkB,GACV;CACR,MAAM,IAAI,SAAS;CACnB,IAAI,cAAc;CAClB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;EACrC,MAAM,YAAY,sBAAsB,CAAC,SAAS,GAAG,CAAC;AAEtD,MAAI,cAAc,YAAY,mBAAmB,WAAW,EAE1D;AAEF,iBAAe;AACf,aAAW;;CAIb,MAAM,SAAS,IAAI;AAInB,QAAO,sBAAsB,UAHd,UAAU,UAAU,KAAK,IAAI,UAAU,OAAO,GAAG,SAGlB;;;;;;;;;;;;;;AAiBhD,SAAgB,kBACd,UACkB;CAElB,MAAM,mCAAmB,IAAI,KAAa;AAC1C,MAAK,MAAM,OAAO,SAChB,KAAI,IAAI,SAAS,YACf,MAAK,MAAM,MAAM,eAAe,IAAI,CAClC,kBAAiB,IAAI,GAAG;CAM9B,MAAM,gCAAgB,IAAI,KAAa;AACvC,MAAK,MAAM,OAAO,SAChB,MAAK,MAAM,QAAQ,IAAI,MACrB,MACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,KAEZ,eAAc,IAAK,KAAgC,WAAW;CAMpE,MAAM,kCAAkB,IAAI,KAAa;AACzC,MAAK,MAAM,MAAM,cACf,KAAI,CAAC,iBAAiB,IAAI,GAAG,CAC3B,iBAAgB,IAAI,GAAG;CAI3B,IAAI,SAAS;AACb,KAAI,gBAAgB,OAAO,EACzB,UAAS,OAAO,KAAK,QAAQ;EAC3B,MAAM,gBAAgB,IAAI,MAAM,QAAQ,SAAS;AAC/C,QACG,KAAK,KAAK,WAAW,QAAQ,IAAI,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,KAEZ,QAAO,CAAC,gBAAgB,IACrB,KAAgC,WAClC;AAEH,UAAO;IACP;AACF,MAAI,cAAc,WAAW,IAAI,MAAM,OACrC,QAAO;GAAE,GAAG;GAAK,OAAO;GAAe;AAEzC,SAAO;GACP;CAIJ,MAAM,iCAAiB,IAAI,KAAa;AACxC,MAAK,MAAM,MAAM,iBACf,KAAI,CAAC,cAAc,IAAI,GAAG,IAAI,CAAC,gBAAgB,IAAI,GAAG,CACpD,gBAAe,IAAI,GAAG;AAI1B,KAAI,eAAe,OAAO,GAAG;EAC3B,MAAM,UAA4B,EAAE;AACpC,OAAK,MAAM,OAAO,QAAQ;AACxB,WAAQ,KAAK,IAAI;AACjB,OAAI,IAAI,SAAS;SACV,MAAM,MAAM,eAAe,IAAI,CAClC,KAAI,eAAe,IAAI,GAAG,EAAE;KAE1B,MAAM,WAAW,IAAI,MAAM,MACxB,MACC,gBAAgB,KACf,EAA6B,eAAe,GAChD;AAED,aAAQ,KAAK;MACX,IAAI,QAAQ;MACZ,MAAM;MACN,OAAO,CACL;OACE,MAAM;OACN,YAAY;OACZ,UAAU,UAAU,YAAY;OAChC,QACE;OACH,CACF;MACD,2BAAW,IAAI,MAAM;MACtB,CAAmB;;;;AAK5B,WAAS;;AAIX,QAAO,OAAO,QAAQ,QAAQ,IAAI,MAAM,SAAS,EAAE;;;;;;AASrD,SAAgB,qBAAqB,UAAoC;CACvE,MAAM,gBAAgB,sBAAsB,SAAS;CAKrD,MAAM,SAAS,KAAK,MAAM,gBAAgB,GAAI;AAC9C,QAAO,KAAK,IAAI,KAAK,OAAO;;;;;;;;;AAY9B,SAAgB,mBACd,UACA,iBACA,QACQ;CACR,MAAM,UAAU,SACb,KAAK,QAAQ;EACZ,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,SAAS,OAAO,CAChC,KAAK,MAAO,EAAuB,KAAK,CACxC,KAAK,KAAK;EAEb,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,KAAK,WAAW,QAAQ,IAAI,EAAE,SAAS,eAAe,CACtE,KAAK,MAAM;GACV,MAAM,KAAK;GAKX,MAAM,QAAQ,CAAC,UAAU,GAAG,YAAY,UAAU,GAAG;AACrD,OAAI,GAAG,MACL,OAAM,KAAK,UAAU,KAAK,UAAU,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,GAAG;AAChE,OAAI,GAAG,OACL,OAAM,KAAK,WAAW,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,GAAG;AAC1D,UAAO,MAAM,KAAK,KAAK;IACvB,CACD,KAAK,KAAK;AAEb,SAAO,IAAI,IAAI,KAAK,KAAK,YAAY,YAAY,OAAO,YAAY;GACpE,CACD,KAAK,cAAc;AAEtB,KAAI,gBACF,QAAO;;;EAGT,gBAAgB;;;EAGhB,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;AAGf,QAAO;;;EAGP,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DjB,SAAgB,sBAAsB,MAAsB;CAC1D,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,kBAAkB,KAAK,mBAAmB;CAChD,MAAM,kBAAkB,KAAK,mBAAmB;AAEhD,QAAO,OAAO,aAA8D;AAC1E,MAAI,SAAS,UAAU,cAAc,gBACnC,QAAO;EAIT,IAAI,gBAAgB;AACpB,kBAAgB,qBAAqB,UAAU,cAAc;EAE7D,IAAI,cAAc,oBAChB,UACA,eACA,iBACA,gBACD;AAED,MAAI,eAAe,cACjB,QAAO;EAKT,MAAM,iBAAiB,SACpB,MAAM,eAAe,YAAY,CACjC,QAAQ,MAAM,CAAC,oBAAoB,EAAE,CAAC;AAEzC,MAAI,eAAe,WAAW,EAAG,QAAO;EAGxC,MAAM,qBAAqB,SAAS,KAAK,oBAAoB;EAS7D,MAAM,SAAS,mBAAmB,gBARV,qBACpB,mBAAmB,MAChB,QAAQ,MAAM,EAAE,SAAS,OAAO,CAChC,KAAK,MAAO,EAAuB,KAAK,CACxC,KAAK,KAAK,GACb,MAEW,qBAAqB,eAAe,CACuB;EAC1E,MAAM,UAAU,MAAM,KAAK,UAAU,OAAO;AAE5C,MAAI,CAAC,QAAQ,MAAM,CAAE,QAAO;AAE5B,SAAO;GACL,eAAe,eAAe,GAAG;GACjC,aAAa,eAAe,eAAe,SAAS,GAAG;GACvD;GACD"}

package/dist/compaction-helpers-BdQbZiML.d.ts

@@ -0,0 +1,441 @@
+import { ToolSet } from "ai";
+
+//#region src/experimental/memory/session/types.d.ts
+/**
+ * Minimal message part shape used by Session internals.
+ * Vercel AI SDK's `UIMessagePart` is structurally compatible.
+ */
+interface SessionMessagePart {
+  type: string;
+  text?: string;
+  toolCallId?: string;
+  toolName?: string;
+  input?: unknown;
+  output?: unknown;
+  state?: string;
+  result?: unknown;
+}
+/**
+ * Minimal message shape used by Session internals.
+ * Vercel AI SDK's `UIMessage` is structurally compatible — you can pass
+ * `UIMessage` objects directly without conversion.
+ */
+interface SessionMessage {
+  id: string;
+  role: string;
+  parts: SessionMessagePart[];
+  createdAt?: Date;
+}
+/**
+ * Options for creating a Session.
+ */
+interface SessionOptions {
+  /** Context blocks for the system prompt. */
+  context?: ContextConfig[];
+  /** Provider for persisting the frozen system prompt. */
+  promptStore?: WritableContextProvider;
+}
+//#endregion
+//#region src/experimental/memory/session/provider.d.ts
+interface SearchResult {
+  id: string;
+  role: string;
+  content: string;
+  createdAt?: string;
+  sessionId?: string;
+}
+interface StoredCompaction {
+  id: string;
+  summary: string;
+  fromMessageId: string;
+  toMessageId: string;
+  createdAt: string;
+}
+/**
+ * Session storage provider.
+ * Messages are tree-structured via parentId for branching.
+ */
+interface SessionProvider {
+  getMessage(id: string): SessionMessage | null;
+  /**
+   * Get conversation as a path from root to leaf.
+   * Applies compaction overlays. If leafId is null, uses the latest leaf.
+   */
+  getHistory(leafId?: string | null): SessionMessage[];
+  getLatestLeaf(): SessionMessage | null;
+  getBranches(messageId: string): SessionMessage[];
+  getPathLength(leafId?: string | null): number;
+  /**
+   * Append a message. Parented to the latest leaf unless parentId is provided.
+   * Idempotent — same message.id twice is a no-op.
+   */
+  appendMessage(message: SessionMessage, parentId?: string | null): void;
+  updateMessage(message: SessionMessage): void;
+  deleteMessages(messageIds: string[]): void;
+  clearMessages(): void;
+  addCompaction(
+    summary: string,
+    fromMessageId: string,
+    toMessageId: string
+  ): StoredCompaction;
+  getCompactions(): StoredCompaction[];
+  searchMessages?(query: string, limit?: number): SearchResult[];
+}
+//#endregion
+//#region src/experimental/memory/session/providers/agent.d.ts
+interface SqlProvider {
+  sql<T = Record<string, string | number | boolean | null>>(
+    strings: TemplateStringsArray,
+    ...values: (string | number | boolean | null)[]
+  ): T[];
+}
+declare class AgentSessionProvider implements SessionProvider {
+  private agent;
+  private initialized;
+  private sessionId;
+  /**
+   * @param agent - Agent or any object with a `sql` tagged template method
+   * @param sessionId - Optional session ID to isolate multiple sessions in the same DO.
+   *                    Messages are filtered by session_id within shared tables.
+   */
+  constructor(agent: SqlProvider, sessionId?: string);
+  private ensureTable;
+  getMessage(id: string): SessionMessage | null;
+  getHistory(leafId?: string | null): SessionMessage[];
+  getLatestLeaf(): SessionMessage | null;
+  getBranches(messageId: string): SessionMessage[];
+  getPathLength(leafId?: string | null): number;
+  appendMessage(message: SessionMessage, parentId?: string | null): void;
+  updateMessage(message: SessionMessage): void;
+  deleteMessages(messageIds: string[]): void;
+  clearMessages(): void;
+  addCompaction(
+    summary: string,
+    fromMessageId: string,
+    toMessageId: string
+  ): StoredCompaction;
+  getCompactions(): StoredCompaction[];
+  searchMessages(query: string, limit?: number): SearchResult[];
+  private latestLeafRow;
+  private indexFTS;
+  private deleteFTS;
+  private applyCompactions;
+  private parse;
+  private parseRows;
+}
+//#endregion
+//#region src/experimental/memory/session/search.d.ts
+/**
+ * Storage interface for searchable context.
+ *
+ * - `get()` returns a summary of indexed content (rendered into system prompt)
+ * - `search(query)` full-text search (via search_context tool)
+ * - `set(key, content)` indexes content under a key (via set_context tool)
+ */
+interface SearchProvider extends ContextProvider {
+  search(query: string): Promise<string | null>;
+  set?(key: string, content: string): Promise<void>;
+}
+/**
+ * Check if a provider is a SearchProvider (has a `search` method).
+ */
+declare function isSearchProvider(
+  provider: unknown
+): provider is SearchProvider;
+/**
+ * SearchProvider backed by Durable Object SQLite with FTS5.
+ *
+ * - `get()` returns a count of indexed entries
+ * - `search(query)` full-text search using FTS5
+ * - `set(key, content)` indexes or replaces content under a key
+ *
+ * Each instance uses a namespaced FTS5 table to avoid collisions
+ * with the session message search.
+ *
+ * @example
+ * ```ts
+ * Session.create(this)
+ *   .withContext("knowledge", {
+ *     provider: new AgentSearchProvider(this)
+ *   })
+ * ```
+ */
+declare class AgentSearchProvider implements SearchProvider {
+  private agent;
+  private label;
+  private initialized;
+  constructor(agent: SqlProvider);
+  init(label: string): void;
+  private ensureTable;
+  get(): Promise<string | null>;
+  search(query: string): Promise<string | null>;
+  set(key: string, content: string): Promise<void>;
+  private deleteFTS;
+}
+//#endregion
+//#region src/experimental/memory/session/skills.d.ts
+/**
+ * Storage interface for skill collections.
+ *
+ * - `get()` returns metadata listing (rendered into system prompt)
+ * - `load(key)` fetches full content (via load_context tool)
+ * - `set(key, content, description?)` writes an entry (via set_context tool)
+ */
+interface SkillProvider extends ContextProvider {
+  load(key: string): Promise<string | null>;
+  set?(key: string, content: string, description?: string): Promise<void>;
+}
+/**
+ * Check if a provider is a SkillProvider (has a `load` method).
+ */
+declare function isSkillProvider(provider: unknown): provider is SkillProvider;
+/**
+ * SkillProvider backed by an R2 bucket.
+ *
+ * - `get()` returns a metadata listing of all skills (key + description)
+ * - `load(key)` fetches a skill's full content
+ * - `set(key, content, description?)` writes a skill
+ *
+ * Descriptions are pulled from R2 custom metadata (`description` key).
+ * If a prefix is provided, it is prepended on storage operations and
+ * stripped from keys in metadata.
+ *
+ * @example
+ * ```ts
+ * const skills = new R2SkillProvider(env.SKILLS_BUCKET, { prefix: "skills/" });
+ * ```
+ */
+declare class R2SkillProvider implements SkillProvider {
+  private bucket;
+  private prefix;
+  constructor(
+    bucket: R2Bucket,
+    options?: {
+      prefix?: string;
+    }
+  );
+  get(): Promise<string | null>;
+  load(key: string): Promise<string | null>;
+  set(key: string, content: string, description?: string): Promise<void>;
+}
+//#endregion
+//#region src/experimental/memory/session/context.d.ts
+/**
+ * Base storage interface for a context block.
+ * A provider with only `get()` is readonly.
+ */
+interface ContextProvider {
+  get(): Promise<string | null>;
+  /** Called by the context system to provide the block label before first use. */
+  init?(label: string): void;
+}
+/**
+ * Writable context provider — extends ContextProvider with `set()`.
+ * Blocks backed by this provider are writable via the `set_context` tool.
+ */
+interface WritableContextProvider extends ContextProvider {
+  set(content: string): Promise<void>;
+}
+/**
+ * Check if a provider is writable (has a `set` method).
+ */
+declare function isWritableProvider(
+  provider: unknown
+): provider is WritableContextProvider;
+/**
+ * Configuration for a context block.
+ */
+interface ContextConfig {
+  /** Block label — used as key and in tool descriptions */
+  label: string;
+  /** Human-readable description (shown to AI in tool) */
+  description?: string;
+  /** Maximum tokens allowed. Enforced on set. */
+  maxTokens?: number;
+  /** Storage provider. Determines block behavior:
+   *  - ContextProvider (get only) → readonly
+   *  - WritableContextProvider (get+set) → writable via set_context
+   *  - SkillProvider (get+load+set?) → on-demand via load_context
+   *  - SearchProvider (get+search+set?) → searchable via search_context
+   *  If omitted, auto-wired to writable SQLite when using builder. */
+  provider?:
+    | ContextProvider
+    | WritableContextProvider
+    | SkillProvider
+    | SearchProvider;
+}
+/**
+ * A loaded context block with computed token count.
+ */
+interface ContextBlock {
+  label: string;
+  description?: string;
+  content: string;
+  tokens: number;
+  maxTokens?: number;
+  /** True if provider is writable (has set) */
+  writable: boolean;
+  /** True if backed by a SkillProvider */
+  isSkill: boolean;
+  /** True if backed by a SearchProvider */
+  isSearchable: boolean;
+}
+//#endregion
+//#region src/experimental/memory/utils/compaction-helpers.d.ts
+/** Prefix for all compaction messages (overlays and summaries) */
+declare const COMPACTION_PREFIX = "compaction_";
+/** Check if a message is a compaction message */
+declare function isCompactionMessage(msg: SessionMessage): boolean;
+/**
+ * Align a boundary index forward to avoid splitting tool call/result groups.
+ * If the boundary falls between an assistant message with tool calls and its
+ * tool results, move it forward past the results.
+ */
+declare function alignBoundaryForward(
+  messages: SessionMessage[],
+  idx: number
+): number;
+/**
+ * Align a boundary index backward to avoid splitting tool call/result groups.
+ * If the boundary falls in the middle of tool results, move it backward to
+ * include the assistant message that made the calls.
+ */
+declare function alignBoundaryBackward(
+  messages: SessionMessage[],
+  idx: number
+): number;
+/**
+ * Find the compression end boundary using a token budget for the tail.
+ * Walks backward from the end, accumulating tokens until budget is reached.
+ * Returns the index where compression should stop (everything from this
+ * index onward is protected).
+ *
+ * @param messages All messages
+ * @param headEnd Index where the protected head ends (compression starts here)
+ * @param tailTokenBudget Maximum tokens to keep in the tail
+ * @param minTailMessages Minimum messages to protect in the tail (fallback)
+ */
+declare function findTailCutByTokens(
+  messages: SessionMessage[],
+  headEnd: number,
+  tailTokenBudget?: number,
+  minTailMessages?: number
+): number;
+/**
+ * Fix orphaned tool call/result pairs after compaction.
+ *
+ * Two failure modes:
+ * 1. Tool result references a call_id whose assistant tool_call was removed
+ *    → Remove the orphaned result
+ * 2. Assistant has tool_calls whose results were dropped
+ *    → Add stub results so the API doesn't error
+ *
+ * @param messages Messages after compaction
+ * @returns Sanitized messages with no orphaned pairs
+ */
+declare function sanitizeToolPairs(
+  messages: SessionMessage[]
+): SessionMessage[];
+/**
+ * Compute a summary token budget based on the content being compressed.
+ * 20% of the compressed content, clamped to 2K-8K tokens.
+ */
+declare function computeSummaryBudget(messages: SessionMessage[]): number;
+/**
+ * Build a prompt for LLM summarization of compressed messages.
+ *
+ * @param messages Messages to summarize
+ * @param previousSummary Previous summary for iterative updates (or null for first compaction)
+ * @param budget Target token count for the summary
+ */
+declare function buildSummaryPrompt(
+  messages: SessionMessage[],
+  previousSummary: string | null,
+  budget: number
+): string;
+/**
+ * Result of a compaction function — describes the overlay to store.
+ */
+interface CompactResult {
+  /** First message ID in the compacted range */
+  fromMessageId: string;
+  /** Last message ID in the compacted range */
+  toMessageId: string;
+  /** Summary text to store as the overlay */
+  summary: string;
+}
+interface CompactOptions {
+  /**
+   * Function to call the LLM for summarization.
+   * Takes a user prompt string, returns the LLM's text response.
+   */
+  summarize: (prompt: string) => Promise<string>;
+  /** Number of head messages to protect (default: 2) */
+  protectHead?: number;
+  /** Token budget for tail protection (default: 20000) */
+  tailTokenBudget?: number;
+  /** Minimum tail messages to protect (default: 2) */
+  minTailMessages?: number;
+}
+/**
+ * Reference compaction implementation.
+ *
+ * Implements the full hermes-style compaction algorithm:
+ * 1. Protect head messages (first N)
+ * 2. Protect tail by token budget (walk backward)
+ * 3. Align boundaries to tool call groups
+ * 4. Summarize middle section with LLM (structured format)
+ * 5. Sanitize orphaned tool pairs
+ * 6. Iterative summary updates on subsequent compactions
+ *
+ * @example
+ * ```typescript
+ * import { createCompactFunction } from "agents/experimental/memory/utils";
+ *
+ * const session = new Session(provider, {
+ *   compaction: {
+ *     tokenThreshold: 100000,
+ *     fn: createCompactFunction({
+ *       summarize: (prompt) => generateText({ model, prompt }).then(r => r.text)
+ *     })
+ *   }
+ * });
+ * ```
+ */
+declare function createCompactFunction(
+  opts: CompactOptions
+): (messages: SessionMessage[]) => Promise<CompactResult | null>;
+//#endregion
+export {
+  SessionOptions as A,
+  AgentSessionProvider as C,
+  StoredCompaction as D,
+  SessionProvider as E,
+  SessionMessage as O,
+  isSearchProvider as S,
+  SearchResult as T,
+  R2SkillProvider as _,
+  alignBoundaryForward as a,
+  AgentSearchProvider as b,
+  createCompactFunction as c,
+  sanitizeToolPairs as d,
+  ContextBlock as f,
+  isWritableProvider as g,
+  WritableContextProvider as h,
+  alignBoundaryBackward as i,
+  SessionMessagePart as k,
+  findTailCutByTokens as l,
+  ContextProvider as m,
+  CompactOptions as n,
+  buildSummaryPrompt as o,
+  ContextConfig as p,
+  CompactResult as r,
+  computeSummaryBudget as s,
+  COMPACTION_PREFIX as t,
+  isCompactionMessage as u,
+  SkillProvider as v,
+  SqlProvider as w,
+  SearchProvider as x,
+  isSkillProvider as y
+};
+//# sourceMappingURL=compaction-helpers-BdQbZiML.d.ts.map