acp-kernel 0.0.1 → 0.0.2

package/dist/index.js

@@ -0,0 +1,2303 @@
+// src/refs.ts
+var REF_WIDTH = 5;
+var MIN_INDEX = 1;
+var MAX_INDEX = 99999;
+var REF_PATTERN = /^m0*(\d{1,5})$/;
+var BLOCKED_REF = "BLOCKED";
+function emptyRefMap() {
+  return { byRaw: {}, byRef: {} };
+}
+function indexToRef(index) {
+  if (!Number.isInteger(index) || index < MIN_INDEX || index > MAX_INDEX) {
+    throw new RangeError(
+      `ref index out of bounds: ${index} (allowed ${MIN_INDEX}-${MAX_INDEX})`
+    );
+  }
+  return `m${String(index).padStart(REF_WIDTH, "0")}`;
+}
+function refToIndex(ref) {
+  const match = REF_PATTERN.exec(ref.trim().toLowerCase());
+  if (!match) return null;
+  const index = Number(match[1]);
+  if (index < MIN_INDEX || index > MAX_INDEX) return null;
+  return index;
+}
+function refForRaw(map, rawId) {
+  return map.byRaw[rawId] ?? null;
+}
+function rawForRef(map, ref) {
+  return map.byRef[ref] ?? null;
+}
+function assignRefs(messages, options) {
+  const map = {
+    byRaw: { ...options.existing.byRaw },
+    byRef: { ...options.existing.byRef }
+  };
+  let cursor = Number.isInteger(options.nextIndex) && options.nextIndex >= MIN_INDEX ? options.nextIndex : MIN_INDEX;
+  let newlyAssigned = 0;
+  for (const message of messages) {
+    if (!message.id || options.shouldSkip?.(message)) continue;
+    if (map.byRaw[message.id]) continue;
+    if (options.isProtected?.(message)) {
+      map.byRaw[message.id] = BLOCKED_REF;
+      continue;
+    }
+    const ref = allocateFreeRef(map, cursor);
+    cursor = ref.index + 1;
+    map.byRaw[message.id] = ref.text;
+    map.byRef[ref.text] = message.id;
+    newlyAssigned++;
+  }
+  return { map, nextIndex: cursor, newlyAssigned };
+}
+function allocateFreeRef(map, start) {
+  let candidate = Math.max(start, MIN_INDEX);
+  while (candidate <= MAX_INDEX) {
+    const text = indexToRef(candidate);
+    if (!map.byRef[text]) {
+      return { text, index: candidate };
+    }
+    candidate++;
+  }
+  throw new Error(
+    `ref capacity exhausted: cannot allocate beyond ${indexToRef(MAX_INDEX)}`
+  );
+}
+function highestUsedIndex(map) {
+  let highest = 0;
+  for (const ref of Object.values(map.byRaw)) {
+    const index = ref === BLOCKED_REF ? null : refToIndex(ref);
+    if (index !== null && index > highest) highest = index;
+  }
+  return highest;
+}
+
+// src/state.ts
+function createInitialState() {
+  return {
+    blocks: [],
+    messageRefs: { byRaw: {}, byRef: {} },
+    nudge: {
+      lastPerMessageNudgeTokens: 0,
+      lastNudgeShownTokens: 0,
+      baselineTokens: 0,
+      anchors: {}
+    },
+    stats: { tokensCompressed: 0, compressionCount: 0 },
+    nextBlockId: 1,
+    nextRunId: 1
+  };
+}
+function allocateBlockId(state) {
+  const id = state.nextBlockId;
+  state.nextBlockId = Math.max(1, id) + 1;
+  return `b${id}`;
+}
+function allocateRunId(state) {
+  const id = state.nextRunId;
+  state.nextRunId = Math.max(1, id) + 1;
+  return `r${id}`;
+}
+function blockById(state, blockId) {
+  return state.blocks.find((block) => block.blockId === blockId);
+}
+function activeBlocks(state) {
+  return state.blocks.filter((block) => block.active);
+}
+function coveredMessageIds(state) {
+  const covered = /* @__PURE__ */ new Set();
+  for (const block of state.blocks) {
+    if (!block.active) continue;
+    for (const id of block.effectiveMessageIds) covered.add(id);
+  }
+  return covered;
+}
+function highestActiveTier(state) {
+  let highest = 0;
+  for (const block of state.blocks) {
+    if (block.active && block.tier > highest) highest = block.tier;
+  }
+  return highest;
+}
+function advanceSurvival(state, promotionThreshold) {
+  for (const block of state.blocks) {
+    if (!block.active) continue;
+    block.survivedCount += 1;
+    if (block.survivedCount >= promotionThreshold) {
+      block.generation = "old";
+    }
+  }
+}
+
+// src/prune.ts
+var SUMMARY_HEADER = "[Compressed conversation section]";
+function prune(messages, state, options = {}) {
+  const covered = coveredMessageIds(state);
+  if (covered.size === 0) return [...messages];
+  const inject = options.injectSummaries ?? true;
+  const firstUserIndex = messages.findIndex(
+    (message) => message.role === "user"
+  );
+  const indexById = /* @__PURE__ */ new Map();
+  messages.forEach((message, index) => indexById.set(message.id, index));
+  const anchors = inject ? collectSummaryAnchors(state, indexById) : [];
+  return stripOrphanedToolResults(
+    rebuildMessages(messages, covered, firstUserIndex, anchors)
+  );
+}
+function collectSummaryAnchors(state, indexById) {
+  const anchors = [];
+  for (const block of activeBlocks(state)) {
+    let earliest = null;
+    for (const id of block.effectiveMessageIds) {
+      const index = indexById.get(id);
+      if (index !== void 0 && (earliest === null || index < earliest)) {
+        earliest = index;
+      }
+    }
+    anchors.push({
+      blockId: block.blockId,
+      summary: block.summary,
+      topic: block.topic,
+      insertAt: earliest ?? 0
+    });
+  }
+  anchors.sort((left, right) => left.insertAt - right.insertAt);
+  return anchors;
+}
+function rebuildMessages(messages, covered, firstUserIndex, anchors) {
+  const result = [];
+  const pending = [...anchors];
+  for (let index = 0; index < messages.length; index++) {
+    while (pending.length > 0 && pending[0].insertAt === index) {
+      result.push(renderSummary(pending.shift()));
+    }
+    if (index === firstUserIndex && firstUserIndex >= 0) {
+      result.push(messages[index]);
+      continue;
+    }
+    if (covered.has(messages[index].id)) continue;
+    result.push(messages[index]);
+  }
+  while (pending.length > 0) {
+    result.push(renderSummary(pending.shift()));
+  }
+  return result;
+}
+function renderSummary(anchor) {
+  const body = anchor.summary.trim();
+  const topicLine = anchor.topic ? `${SUMMARY_HEADER} \u2014 ${anchor.topic}` : SUMMARY_HEADER;
+  const text = body.length === 0 ? topicLine : `${topicLine}
+${body}`;
+  return {
+    id: `acp_summary_${anchor.blockId}`,
+    role: "system",
+    contentType: "text",
+    text
+  };
+}
+function stripOrphanedToolResults(messages) {
+  const knownCallIds = /* @__PURE__ */ new Set();
+  for (const m of messages) {
+    if (m.contentType === "tool-call" && m.toolCallId) {
+      knownCallIds.add(m.toolCallId);
+    }
+  }
+  return messages.filter(
+    (m) => m.contentType !== "tool-result" || !m.toolCallId || knownCallIds.has(m.toolCallId)
+  );
+}
+
+// src/sync.ts
+function syncBlocks(messages, state) {
+  const presentIds = new Set(messages.map((message) => message.id));
+  const deactivated = [];
+  const result = {
+    blocks: state.blocks.map((block) => ({
+      ...block,
+      directMessageIds: [...block.directMessageIds],
+      effectiveMessageIds: [...block.effectiveMessageIds],
+      directBlockIds: [...block.directBlockIds]
+    })),
+    messageRefs: {
+      byRaw: { ...state.messageRefs.byRaw },
+      byRef: { ...state.messageRefs.byRef }
+    },
+    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },
+    stats: { ...state.stats },
+    nextBlockId: state.nextBlockId,
+    nextRunId: state.nextRunId
+  };
+  const consumedBlockIds = /* @__PURE__ */ new Set();
+  for (const block of result.blocks) {
+    for (const consumedId of block.directBlockIds) {
+      consumedBlockIds.add(consumedId);
+    }
+  }
+  for (const block of result.blocks) {
+    if (consumedBlockIds.has(block.blockId)) {
+      block.active = false;
+      continue;
+    }
+    block.active = true;
+    const stillPresent = block.effectiveMessageIds.some(
+      (id) => presentIds.has(id)
+    );
+    if (!stillPresent) {
+      block.active = false;
+      deactivated.push(block.blockId);
+    }
+  }
+  return { state: result, deactivated };
+}
+
+// src/tokenize.ts
+import { createRequire } from "module";
+var require2 = createRequire(import.meta.url);
+function defaultCountTokens(text) {
+  if (!text) return 0;
+  const ascii = text.match(/[a-zA-Z][a-zA-Z0-9_'-]*/g);
+  const cjk = text.match(/[\u4e00-\u9fff\u3040-\u30ff\uac00-\ud7af]/g);
+  return (ascii?.length ?? 0) + (cjk?.length ?? 0);
+}
+function estimateTokensFast(text) {
+  if (!text) return 0;
+  return Math.ceil(text.length / 4);
+}
+function createBpeTokenizer() {
+  try {
+    const mod = require2("@anthropic-ai/tokenizer");
+    const bpeCount = mod.countTokens ?? mod.default?.countTokens;
+    if (typeof bpeCount !== "function") return defaultCountTokens;
+    return (text) => {
+      try {
+        return bpeCount(text);
+      } catch {
+        return defaultCountTokens(text);
+      }
+    };
+  } catch {
+    return defaultCountTokens;
+  }
+}
+
+// src/config.ts
+function defaultConfig(modelContextLimit, overrides = {}) {
+  const base = {
+    tiers: { enabled: true, tier2Trigger: 5, tier3Trigger: 10 },
+    nudge: {
+      maxContextLimitPct: 0.55,
+      minContextLimitPct: 0.45,
+      frequency: 5,
+      iterationThreshold: 15,
+      force: "soft",
+      growthRatio: 0.05,
+      growthFloor: Math.max(2e4, Math.round(modelContextLimit * 0.05)),
+      growthCap: 5e4,
+      minGrowthFloor: 2e4,
+      minGrowthRatio: 0.45,
+      emergencyThresholdPct: 0.8
+    },
+    promotionThreshold: 5,
+    truncate: { threshold: 1 },
+    merge: { maxSummaryLength: 3e3, minOldGenBlocks: 3 },
+    compress: {
+      minCompressRange: 5e3,
+      maxSummaryLength: 2e4,
+      minSummaryLength: 50
+    },
+    protectedTools: [],
+    preserveRecentMessages: 5,
+    preserveRecentTokens: 5e3,
+    modelContextLimit
+  };
+  return {
+    ...base,
+    ...overrides,
+    tiers: { ...base.tiers, ...overrides.tiers },
+    nudge: { ...base.nudge, ...overrides.nudge },
+    truncate: { ...base.truncate, ...overrides.truncate },
+    merge: { ...base.merge, ...overrides.merge },
+    compress: { ...base.compress, ...overrides.compress }
+  };
+}
+function validateConfig(config) {
+  const errors = [];
+  if (!Number.isFinite(config.modelContextLimit) || config.modelContextLimit <= 0) {
+    errors.push("modelContextLimit must be a positive number");
+  }
+  if (config.nudge.minContextLimitPct > config.nudge.maxContextLimitPct) {
+    errors.push(
+      "nudge.minContextLimitPct must not exceed nudge.maxContextLimitPct"
+    );
+  }
+  if (config.promotionThreshold < 1) {
+    errors.push("promotionThreshold must be >= 1");
+  }
+  if (config.truncate.threshold <= 0 || config.truncate.threshold > 1) {
+    errors.push("truncate.threshold must be in (0, 1]");
+  }
+  if (config.merge.maxSummaryLength < 1) {
+    errors.push("merge.maxSummaryLength must be >= 1");
+  }
+  if (config.merge.minOldGenBlocks < 1) {
+    errors.push("merge.minOldGenBlocks must be >= 1");
+  }
+  for (const tier of [config.tiers.tier2Trigger, config.tiers.tier3Trigger]) {
+    if (tier < 1) errors.push("tier triggers must be >= 1");
+  }
+  if (config.tiers.tier3Trigger <= config.tiers.tier2Trigger) {
+    errors.push("tiers.tier3Trigger must be greater than tiers.tier2Trigger");
+  }
+  return errors;
+}
+
+// src/boundaries.ts
+var MESSAGE_REF_PATTERN = /^m0*(\d{1,5})$/;
+var BLOCK_REF_PATTERN = /^b(\d{1,9})$/;
+function parseBoundary(ref) {
+  const normalized = ref.trim().toLowerCase();
+  const messageMatch = MESSAGE_REF_PATTERN.exec(normalized);
+  if (messageMatch) {
+    const numericId = Number(messageMatch[1]);
+    if (numericId >= 1 && numericId <= 99999) {
+      return { kind: "message", numericId, raw: normalized };
+    }
+  }
+  const blockMatch = BLOCK_REF_PATTERN.exec(normalized);
+  if (blockMatch) {
+    const numericId = Number(blockMatch[1]);
+    if (numericId >= 1) return { kind: "block", numericId, raw: normalized };
+  }
+  return null;
+}
+function resolveBoundaries(input) {
+  const start = parseBoundary(input.startRef);
+  const end = parseBoundary(input.endRef);
+  if (!start || !end) {
+    throw new Error(
+      `Invalid boundary ref(s): startId="${input.startRef}", endId="${input.endRef}". Use mNNNNN or bN.`
+    );
+  }
+  const indexByRawId = /* @__PURE__ */ new Map();
+  input.messages.forEach(
+    (message, index) => indexByRawId.set(message.id, index)
+  );
+  let startIndex = resolveAnchorIndex(start, input.state, indexByRawId);
+  let endIndex = resolveAnchorIndex(end, input.state, indexByRawId);
+  if (startIndex === null || endIndex === null) {
+    throw new Error(
+      `Boundary not found in visible context (likely consumed by an existing block). startId="${input.startRef}", endId="${input.endRef}".`
+    );
+  }
+  if (startIndex > endIndex) {
+    [startIndex, endIndex] = [endIndex, startIndex];
+  }
+  const messageIds = [];
+  for (let index = startIndex; index <= endIndex; index++) {
+    const message = input.messages[index];
+    if (message) messageIds.push(message.id);
+  }
+  const boundaryKind = start.kind === "block" || end.kind === "block" ? "block" : "message";
+  const nestedBlockIds = [];
+  const nestedSeen = /* @__PURE__ */ new Set();
+  for (const block of activeBlocks(input.state)) {
+    const anchor = earliestIndexOfIds(block.effectiveMessageIds, indexByRawId);
+    if (anchor !== null && anchor >= startIndex && anchor <= endIndex) {
+      if (!nestedSeen.has(block.blockId)) {
+        nestedSeen.add(block.blockId);
+        nestedBlockIds.push(block.blockId);
+      }
+    }
+  }
+  const protectedGaps = [];
+  return {
+    startIndex,
+    endIndex,
+    messageIds,
+    nestedBlockIds,
+    boundaryKind,
+    protectedGaps
+  };
+}
+function resolveAnchorIndex(boundary, state, indexByRawId) {
+  if (boundary.kind === "message") {
+    const rawId = state.messageRefs.byRef[boundary.raw] ?? state.messageRefs.byRef[formatPaddedRef(boundary.numericId)];
+    if (!rawId) return null;
+    const index = indexByRawId.get(rawId);
+    return index === void 0 ? null : index;
+  }
+  const block = blockById(state, `b${boundary.numericId}`);
+  if (!block || !block.active) return null;
+  return earliestIndexOfIds(block.effectiveMessageIds, indexByRawId);
+}
+function formatPaddedRef(index) {
+  return `m${String(index).padStart(5, "0")}`;
+}
+function earliestIndexOfIds(ids, indexByRawId) {
+  let earliest = null;
+  for (const id of ids) {
+    const index = indexByRawId.get(id);
+    if (index !== void 0 && (earliest === null || index < earliest)) {
+      earliest = index;
+    }
+  }
+  return earliest;
+}
+
+// src/truncate-tools.ts
+var TRUNCATION_MARKER = "[truncated for context space]";
+var DEFAULTS = {
+  minOutputTokens: 1e3,
+  keepPrefixChars: 2e3,
+  keepSuffixChars: 2e3,
+  protectRecentMessages: 3
+};
+function truncateLargeToolOutputs(messages, tokenCount, config, countTokens, options = {}) {
+  const opts = { ...DEFAULTS, ...options };
+  if (config.modelContextLimit <= 0) return { messages, truncatedCount: 0, savedTokens: 0 };
+  const threshold = config.truncate.threshold * config.modelContextLimit;
+  if (tokenCount < threshold) return { messages, truncatedCount: 0, savedTokens: 0 };
+  const protectedIndex = messages.length - opts.protectRecentMessages;
+  const candidates = [];
+  for (let index = 0; index < messages.length; index++) {
+    if (index >= protectedIndex) break;
+    const message = messages[index];
+    if (message.contentType !== "tool-result") continue;
+    const text = message.text ?? "";
+    if (text.length === 0 || text.includes(TRUNCATION_MARKER)) continue;
+    const tokens = countTokens(text);
+    if (tokens < opts.minOutputTokens) continue;
+    candidates.push({ index, tokens });
+  }
+  if (candidates.length === 0) return { messages, truncatedCount: 0, savedTokens: 0 };
+  candidates.sort((left, right) => right.tokens - left.tokens);
+  const targetTokens = threshold * 0.9;
+  let savedTokens = 0;
+  const edits = /* @__PURE__ */ new Map();
+  let truncatedCount = 0;
+  for (const candidate of candidates) {
+    if (tokenCount - savedTokens <= targetTokens) break;
+    const original = messages[candidate.index].text ?? "";
+    if (original.length <= opts.keepPrefixChars + opts.keepSuffixChars) continue;
+    const prefix = original.slice(0, opts.keepPrefixChars);
+    const suffix = original.slice(-opts.keepSuffixChars);
+    const replacement = prefix + `
+
+...${TRUNCATION_MARKER} \u2014 original ~${candidate.tokens} tokens]...
+
+` + suffix;
+    edits.set(candidate.index, replacement);
+    savedTokens += candidate.tokens - countTokens(replacement);
+    truncatedCount++;
+  }
+  if (truncatedCount === 0) return { messages, truncatedCount: 0, savedTokens: 0 };
+  const updated = messages.map(
+    (message, index) => edits.has(index) ? { ...message, text: edits.get(index) } : message
+  );
+  return { messages: updated, truncatedCount, savedTokens };
+}
+
+// src/hide-consumed.ts
+var KEEP_LAST_ORPHANED = 2;
+function hideConsumedCompressCalls(state, messages) {
+  const activeCallIds = /* @__PURE__ */ new Set();
+  const allBlockCallIds = /* @__PURE__ */ new Set();
+  for (const block of state.blocks) {
+    if (block.compressCallId) {
+      allBlockCallIds.add(block.compressCallId);
+      if (block.active) activeCallIds.add(block.compressCallId);
+    }
+  }
+  const lastOrphanedCallIds = [];
+  for (let i = messages.length - 1; i >= 0 && lastOrphanedCallIds.length < KEEP_LAST_ORPHANED; i--) {
+    const message = messages[i];
+    if (message.toolName !== "compress" || message.contentType !== "tool-call") continue;
+    const callId = message.toolCallId;
+    if (callId && !allBlockCallIds.has(callId)) {
+      lastOrphanedCallIds.push(callId);
+    }
+  }
+  const keepCallIds = /* @__PURE__ */ new Set([...activeCallIds, ...lastOrphanedCallIds]);
+  const hiddenCallIds = /* @__PURE__ */ new Set();
+  for (const message of messages) {
+    if (message.toolName === "compress" && message.contentType === "tool-call" && (!message.toolCallId || !keepCallIds.has(message.toolCallId))) {
+      if (message.toolCallId) hiddenCallIds.add(message.toolCallId);
+    }
+  }
+  let hidden = 0;
+  const result = [];
+  for (const message of messages) {
+    if (message.toolName === "compress" && message.contentType === "tool-call" && (!message.toolCallId || !keepCallIds.has(message.toolCallId))) {
+      hidden++;
+      continue;
+    }
+    if (message.contentType === "tool-result" && message.toolCallId && hiddenCallIds.has(message.toolCallId)) {
+      hidden++;
+      continue;
+    }
+    result.push(message);
+  }
+  return { messages: result, hidden };
+}
+
+// src/merge.ts
+function numericPart(blockId) {
+  const match = /^b(\d+)$/.exec(blockId);
+  return match && match[1] !== void 0 ? Number(match[1]) : 0;
+}
+function truncateMergedSummary(merged, maxLength) {
+  if (merged.length <= maxLength) return merged;
+  const blocks = merged.split("\n---\n");
+  const headers = blocks.map((b) => b.split("\n")[0] ?? "").filter((h) => h.trim().length > 0);
+  const marker = "\n...\n[merged and truncated by batch cleanup]";
+  const budget = Math.max(0, maxLength - marker.length);
+  const headerJoin = headers.join("\n");
+  return headerJoin.length <= budget ? headerJoin + marker : headerJoin.slice(0, budget) + marker;
+}
+function mergeMarkedBlocks(state, markedIds, maxMergedLength, countTokens) {
+  const sortedIds = [...new Set(markedIds)].sort((a, b) => numericPart(a) - numericPart(b));
+  const sourceBlocks = sortedIds.map((id) => state.blocks.find((b) => b.blockId === id && b.active)).filter((b) => b !== void 0);
+  if (sourceBlocks.length < 2) {
+    return { state, mergedCount: 0, savedTokens: 0 };
+  }
+  const next = {
+    ...state,
+    blocks: state.blocks.map((b) => ({ ...b }))
+  };
+  const newBlockId = allocateBlockId(next);
+  const newRunId = allocateRunId(next);
+  const bodies = sourceBlocks.map((block) => block.summary.trim());
+  const mergedSummary = truncateMergedSummary(bodies.join("\n---\n"), maxMergedLength);
+  const newSummaryTokens = countTokens(mergedSummary);
+  const effectiveMessageIds = /* @__PURE__ */ new Set();
+  const directMessageIds = /* @__PURE__ */ new Set();
+  for (const block of sourceBlocks) {
+    for (const id of block.effectiveMessageIds) effectiveMessageIds.add(id);
+    for (const id of block.directMessageIds) directMessageIds.add(id);
+  }
+  const sourceIds = sourceBlocks.map((b) => b.blockId);
+  const mergedBlock = {
+    blockId: newBlockId,
+    runId: newRunId,
+    tier: sourceBlocks.reduce((min, b) => b.tier < min ? b.tier : min, 3),
+    topic: "Batch merge cleanup",
+    summary: mergedSummary,
+    directMessageIds: [...directMessageIds],
+    effectiveMessageIds: [...effectiveMessageIds],
+    directBlockIds: [...sourceIds],
+    compressedTokens: sourceBlocks.reduce((sum, b) => sum + b.compressedTokens, 0),
+    createdAt: Date.now(),
+    survivedCount: 0,
+    generation: "old",
+    active: true
+  };
+  for (const block of next.blocks) {
+    if (sourceIds.includes(block.blockId)) block.active = false;
+  }
+  next.blocks.push(mergedBlock);
+  const sourceTokens = sourceBlocks.reduce(
+    (sum, block) => sum + countTokens(block.summary),
+    0
+  );
+  const savedTokens = Math.max(0, sourceTokens - newSummaryTokens);
+  return { state: next, mergedCount: sourceBlocks.length, savedTokens };
+}
+function collectOldGenBlocks(state, maxOldGenSummaryLength) {
+  return state.blocks.filter(
+    (b) => b.active && (b.generation === "old" || b.summary.length > maxOldGenSummaryLength)
+  ).sort((a, b) => numericPart(a.blockId) - numericPart(b.blockId));
+}
+
+// src/filter/registry.ts
+var registry = /* @__PURE__ */ new Map();
+function registerMessageFilter(filter) {
+  const existing = registry.get(filter.name);
+  if (existing && existing.version !== filter.version) {
+    throw new Error(
+      `Message filter "${filter.name}" already registered with version ${existing.version}, cannot register version ${filter.version}.`
+    );
+  }
+  registry.set(filter.name, filter);
+}
+function getMessageFilter(name) {
+  return registry.get(name);
+}
+function listMessageFilters() {
+  return [...registry.values()];
+}
+function clearMessageFilters() {
+  registry.clear();
+}
+
+// src/filter/apply.ts
+function applyMessageFilters(messages, config) {
+  if (!config?.enabled) {
+    return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };
+  }
+  const active = listMessageFilters().filter(
+    (filter) => config.filters?.[filter.name]?.enabled !== false
+  );
+  if (active.length === 0) {
+    return { messages, partsFiltered: 0, partsDropped: 0, partsModified: 0 };
+  }
+  let working = messages.map((message) => ({ ...message }));
+  const tally = { partsFiltered: 0, partsDropped: 0, partsModified: 0 };
+  const total = working.length;
+  const immediate = active.filter((filter) => !filter.keepLastOnly);
+  for (let index = 0; index < working.length; index++) {
+    const message = working[index];
+    const text = message.text ?? "";
+    if (text.length === 0) continue;
+    let current = text;
+    const baseCtx = {
+      text: current,
+      role: message.role,
+      messageIndex: index,
+      totalMessages: total,
+      toolName: message.toolName
+    };
+    for (const filter of immediate) {
+      let decision;
+      try {
+        decision = filter.filter(baseCtx);
+      } catch {
+        continue;
+      }
+      if (decision.action === "keep") continue;
+      tally.partsFiltered++;
+      if (decision.action === "drop") {
+        current = "";
+        tally.partsDropped++;
+      } else if (decision.action === "modify" && decision.text !== void 0) {
+        current = decision.text;
+        tally.partsModified++;
+      }
+      baseCtx.text = current;
+    }
+    if (current !== text) working[index] = { ...message, text: current };
+  }
+  const keepLast = active.filter((filter) => filter.keepLastOnly);
+  for (const filter of keepLast) {
+    let foundLast = false;
+    for (let index = working.length - 1; index >= 0; index--) {
+      const message = working[index];
+      const text = message.text ?? "";
+      if (text.length === 0) continue;
+      const ctx = {
+        text,
+        role: message.role,
+        messageIndex: index,
+        totalMessages: total,
+        toolName: message.toolName
+      };
+      let decision;
+      try {
+        decision = filter.filter(ctx);
+      } catch {
+        continue;
+      }
+      if (decision.action !== "drop" && decision.action !== "modify") continue;
+      if (foundLast) {
+        tally.partsFiltered++;
+        tally.partsDropped++;
+        working[index] = { ...message, text: "" };
+      } else {
+        foundLast = true;
+        if (decision.action === "modify" && decision.text !== void 0) {
+          tally.partsFiltered++;
+          tally.partsModified++;
+          working[index] = { ...message, text: decision.text };
+        }
+      }
+    }
+  }
+  return { messages: working, ...tally };
+}
+
+// src/render-refs.ts
+function refTag(ref) {
+  return `[${ref}] `;
+}
+function renderMessage(message, map) {
+  const ref = refForRaw(map, message.id);
+  if (!ref || ref === BLOCKED_REF) return message;
+  const tag = refTag(ref);
+  if (!message.text) return { ...message, text: tag };
+  let text = message.text;
+  while (text.startsWith(tag)) text = text.slice(tag.length);
+  return { ...message, text: tag + text };
+}
+function renderVisibleRefs(messages, state) {
+  const map = state.messageRefs;
+  return messages.map((message) => renderMessage(message, map));
+}
+var renderRefsNode = {
+  name: "render-refs",
+  run(io, _ctx) {
+    return {
+      ...io,
+      messages: renderVisibleRefs(io.messages, io.state)
+    };
+  }
+};
+
+// src/protected.ts
+function matchToolPattern(toolName, pattern) {
+  if (pattern.endsWith("*")) {
+    return toolName.startsWith(pattern.slice(0, -1));
+  }
+  return toolName === pattern;
+}
+function isMessageProtected(msg, config) {
+  if (msg.contentType !== "tool-call" || !msg.toolName) return false;
+  for (const pattern of config.protectedTools) {
+    if (matchToolPattern(msg.toolName, pattern)) return true;
+  }
+  if (config.isToolProtected?.(msg.toolName, msg.text)) return true;
+  return false;
+}
+
+// src/recommend.ts
+function refNum(ref) {
+  const n = parseInt(ref.slice(1), 10);
+  return Number.isNaN(n) ? -1 : n;
+}
+function estimateMessageTokens(message) {
+  return Math.ceil((message.text ?? "").length / 4);
+}
+function isToolMessage(message) {
+  return message.contentType === "tool-call" || message.contentType === "tool-result";
+}
+function isSyntheticOrPruned(message, state) {
+  if (message.text?.startsWith("[Compressed conversation section]")) return true;
+  for (const block of state.blocks) {
+    if (block.active && block.effectiveMessageIds.includes(message.id)) return true;
+  }
+  return false;
+}
+function computeProtectedRefs(messages, state, config) {
+  const preserveN = config.preserveRecentMessages;
+  const preserveTokens = config.preserveRecentTokens;
+  const result = /* @__PURE__ */ new Set();
+  const visible = [];
+  for (const msg of messages) {
+    if (isSyntheticOrPruned(msg, state)) continue;
+    const ref = state.messageRefs.byRaw[msg.id];
+    if (!ref || ref === "BLOCKED") continue;
+    visible.push({ ref, tokens: estimateMessageTokens(msg) });
+  }
+  if (preserveN > 0) {
+    for (const m of visible.slice(-preserveN)) {
+      result.add(m.ref);
+    }
+  }
+  if (preserveTokens > 0) {
+    let tokenAccum = 0;
+    for (let i = visible.length - 1; i >= 0 && tokenAccum < preserveTokens; i--) {
+      result.add(visible[i].ref);
+      tokenAccum += visible[i].tokens;
+    }
+  }
+  for (let i = messages.length - 1; i >= 0; i--) {
+    const msg = messages[i];
+    if (msg.role !== "user" || isSyntheticOrPruned(msg, state)) continue;
+    const ref = state.messageRefs.byRaw[msg.id];
+    if (ref && ref !== "BLOCKED") result.add(ref);
+    break;
+  }
+  return result;
+}
+function buildCompressibleRanges(messages, state, config, protectedZoneRefs) {
+  const compressibleMsgs = [];
+  const protectedMsgs = [];
+  for (const msg of messages) {
+    if (isSyntheticOrPruned(msg, state)) continue;
+    const ref = state.messageRefs.byRaw[msg.id];
+    if (!ref || ref === "BLOCKED") continue;
+    const rn = refNum(ref);
+    if (isMessageProtected(msg, config)) {
+      protectedMsgs.push({
+        ref,
+        refNum: rn,
+        tokens: estimateMessageTokens(msg),
+        tools: msg.toolName ? [msg.toolName] : []
+      });
+      continue;
+    }
+    if (protectedZoneRefs?.has(ref)) {
+      continue;
+    }
+    compressibleMsgs.push({
+      ref,
+      refNum: rn,
+      tokens: estimateMessageTokens(msg),
+      isTool: isToolMessage(msg)
+    });
+  }
+  const compressible = [];
+  let cur = null;
+  let prevRefNum = -2;
+  for (const info of compressibleMsgs) {
+    const hasGap = info.refNum > prevRefNum + 1;
+    if (cur && hasGap) {
+      compressible.push(cur);
+      cur = null;
+    }
+    prevRefNum = info.refNum;
+    if (!cur) {
+      cur = {
+        startRef: info.ref,
+        endRef: info.ref,
+        count: 1,
+        tokens: info.tokens,
+        toolPct: info.isTool ? 100 : 0,
+        textPct: info.isTool ? 0 : 100
+      };
+    } else {
+      cur.endRef = info.ref;
+      cur.count++;
+      cur.tokens += info.tokens;
+      if (info.isTool) {
+        cur.toolPct = Math.round((cur.toolPct * (cur.count - 1) + 100) / cur.count);
+      } else {
+        cur.toolPct = Math.round(cur.toolPct * (cur.count - 1) / cur.count);
+      }
+      cur.textPct = 100 - cur.toolPct;
+    }
+  }
+  if (cur) compressible.push(cur);
+  const protectedRanges = [];
+  let pcur = null;
+  let pPrevRefNum = -2;
+  for (const info of protectedMsgs) {
+    const hasGap = info.refNum > pPrevRefNum + 1;
+    if (pcur && hasGap) {
+      protectedRanges.push(pcur);
+      pcur = null;
+    }
+    pPrevRefNum = info.refNum;
+    if (!pcur) {
+      pcur = {
+        startRef: info.ref,
+        endRef: info.ref,
+        count: 1,
+        tokens: info.tokens,
+        tools: [...info.tools]
+      };
+    } else {
+      pcur.endRef = info.ref;
+      pcur.count++;
+      pcur.tokens += info.tokens;
+      for (const t of info.tools) {
+        if (!pcur.tools.includes(t)) pcur.tools.push(t);
+      }
+    }
+  }
+  if (pcur) protectedRanges.push(pcur);
+  return {
+    compressible: compressible.filter((g) => g.tokens > 0),
+    protected: protectedRanges
+  };
+}
+
+// src/pipeline.ts
+function makeIO(messages, state, effects = {}) {
+  return { messages, state, effects };
+}
+function runPipeline(nodes, initial, ctx) {
+  let io = initial;
+  for (const node of nodes) {
+    if (node.enabled && !node.enabled(io, ctx)) continue;
+    io = node.run(io, ctx);
+  }
+  return io;
+}
+
+// src/compress.ts
+function createCore(ports = {}) {
+  const countTokens = ports.countTokens ?? defaultCountTokens;
+  function applyCompression(input) {
+    const state = cloneState(input.state);
+    const runId = allocateRunId(state);
+    let blocksCreated = 0;
+    let tokensCompressed = 0;
+    const errors = [];
+    const preExistingCoverage = collectCoverage(state);
+    const rangeIndexSets = [];
+    for (const spec of input.ranges) {
+      let resolved;
+      try {
+        resolved = resolveBoundaries({
+          startRef: spec.startRef,
+          endRef: spec.endRef,
+          messages: input.messages,
+          state
+        });
+      } catch {
+        continue;
+      }
+      const indices = resolved.messageIds.map(
+        (id) => input.messages.findIndex((m) => m.id === id)
+      ).filter((i) => i >= 0);
+      rangeIndexSets.push({ spec, indices });
+    }
+    const sortedRanges = [...rangeIndexSets].sort((a, b) => {
+      const aMin = a.indices.length > 0 ? Math.min(...a.indices) : Infinity;
+      const bMin = b.indices.length > 0 ? Math.min(...b.indices) : Infinity;
+      return aMin - bMin;
+    });
+    for (let i = 1; i < sortedRanges.length; i++) {
+      const prev = sortedRanges[i - 1];
+      const curr = sortedRanges[i];
+      const prevMax = prev.indices.length > 0 ? Math.max(...prev.indices) : -1;
+      const currMin = curr.indices.length > 0 ? Math.min(...curr.indices) : -1;
+      if (prevMax >= currMin && prevMax >= 0) {
+        return {
+          state: input.state,
+          result: {
+            blocksCreated: 0,
+            tokensCompressed: 0,
+            errors: [
+              `content: range (${prev.spec.startRef}..${prev.spec.endRef}) overlaps (${curr.spec.startRef}..${curr.spec.endRef}). Overlapping ranges cannot be compressed in the same batch.`
+            ]
+          }
+        };
+      }
+    }
+    if (input.config.compress.minCompressRange > 0 && input.ranges.length > 0) {
+      let totalRangeChars = 0;
+      let hasBlockBoundaryRange = false;
+      for (const spec of input.ranges) {
+        let resolved;
+        try {
+          resolved = resolveBoundaries({
+            startRef: spec.startRef,
+            endRef: spec.endRef,
+            messages: input.messages,
+            state
+          });
+        } catch {
+          continue;
+        }
+        if (resolved.boundaryKind === "block") {
+          hasBlockBoundaryRange = true;
+          continue;
+        }
+        for (const id of resolved.messageIds) {
+          const msg = input.messages.find((m) => m.id === id);
+          totalRangeChars += msg?.text?.length ?? 0;
+        }
+      }
+      if (!hasBlockBoundaryRange && totalRangeChars < input.config.compress.minCompressRange) {
+        return {
+          state: input.state,
+          result: {
+            blocksCreated: 0,
+            tokensCompressed: 0,
+            errors: [
+              `Total compressible content too small (${totalRangeChars} chars across ${input.ranges.length} range(s), min ${input.config.compress.minCompressRange}). Combine more messages into your range(s) to meet the threshold.`
+            ]
+          }
+        };
+      }
+    }
+    for (const spec of input.ranges) {
+      try {
+        const compressed = applySingleRange({
+          spec,
+          messages: input.messages,
+          state,
+          runId,
+          config: input.config,
+          protectedMessageIds: input.protectedMessageIds,
+          countTokens,
+          preExistingCoverage
+        });
+        blocksCreated++;
+        tokensCompressed += compressed;
+      } catch (error) {
+        errors.push(error instanceof Error ? error.message : String(error));
+      }
+    }
+    state.stats.compressionCount += blocksCreated;
+    state.stats.tokensCompressed += tokensCompressed;
+    if (blocksCreated > 0) {
+      state.nudge.lastPerMessageNudgeTokens = 0;
+      state.nudge.lastNudgeShownTokens = 0;
+    }
+    return { state, result: { blocksCreated, tokensCompressed, errors } };
+  }
+  function processTurn(input) {
+    const configErrors = validateConfig(input.config);
+    if (configErrors.length > 0) {
+      console.warn(`[acp-kernel] Config validation warnings: ${configErrors.join("; ")}. Thresholds may not fire correctly.`);
+    }
+    const ctx = {
+      config: input.config,
+      tokenCount: input.tokenCount,
+      countTokens
+    };
+    const initial = {
+      messages: input.messages,
+      state: input.state,
+      effects: {}
+    };
+    const result = runPipeline(defaultNodes(), initial, ctx);
+    return {
+      messages: result.messages,
+      state: result.state,
+      nudge: result.effects.nudge
+    };
+  }
+  function decompress(blockId, state) {
+    return blockById(state, blockId);
+  }
+  function search(query, state) {
+    const terms = query.toLowerCase().split(/\s+/).filter((term) => term.length > 0);
+    if (terms.length === 0) return [];
+    const scored = activeBlocks(state).map((block) => ({ block, score: scoreRelevance(block, terms) })).filter((entry) => entry.score > 0.1).sort((left, right) => right.score - left.score);
+    return scored.map((entry) => entry.block);
+  }
+  function status(state, tokenCount, config) {
+    const active = activeBlocks(state);
+    const usage = config.modelContextLimit > 0 ? tokenCount / config.modelContextLimit : 0;
+    return {
+      contextUsage: usage,
+      tokenCount,
+      modelContextLimit: config.modelContextLimit,
+      activeBlocks: active.length,
+      totalBlocks: state.blocks.length,
+      tokensCompressed: state.stats.tokensCompressed,
+      breakdown: { active: active.length, total: state.blocks.length }
+    };
+  }
+  function defaultNodes() {
+    return [
+      assignRefsNode,
+      syncBlocksNode,
+      mergeBlocksNode,
+      pruneNode,
+      filterNode,
+      hideCompressCallsNode,
+      recommendNode,
+      nudgeNode,
+      emergencyTruncateNode,
+      renderRefsNode
+    ];
+  }
+  return { processTurn, applyCompression, defaultNodes, decompress, search, status };
+}
+var assignRefsNode = {
+  name: "assign-refs",
+  run(io, ctx) {
+    const hasProtection = ctx.config.protectedTools.length > 0 || !!ctx.config.isToolProtected;
+    const protectedFn = hasProtection ? (m) => isMessageProtected(m, ctx.config) : void 0;
+    const refResult = assignRefs(io.messages, {
+      existing: io.state.messageRefs,
+      nextIndex: highestUsedIndex(io.state.messageRefs) + 1,
+      isProtected: protectedFn
+    });
+    return { ...io, state: { ...io.state, messageRefs: refResult.map } };
+  }
+};
+var syncBlocksNode = {
+  name: "sync-blocks",
+  run(io, ctx) {
+    const synced = syncBlocks(io.messages, io.state);
+    advanceSurvival(synced.state, ctx.config.promotionThreshold);
+    return { ...io, state: synced.state };
+  }
+};
+var mergeBlocksNode = {
+  name: "merge-blocks",
+  run(io, ctx) {
+    const oldGen = collectOldGenBlocks(
+      io.state,
+      ctx.config.merge.maxSummaryLength
+    );
+    if (oldGen.length < ctx.config.merge.minOldGenBlocks) return io;
+    const ids = oldGen.map((b) => b.blockId);
+    const merged = mergeMarkedBlocks(
+      io.state,
+      ids,
+      ctx.config.merge.maxSummaryLength,
+      ctx.countTokens
+    );
+    if (merged.mergedCount === 0) return io;
+    return {
+      ...io,
+      state: merged.state,
+      effects: { ...io.effects, mergedCount: merged.mergedCount }
+    };
+  }
+};
+var pruneNode = {
+  name: "prune",
+  run(io) {
+    return { ...io, messages: prune(io.messages, io.state) };
+  }
+};
+var filterNode = {
+  name: "filter",
+  enabled: (_io, ctx) => !!ctx.config.messageFilters?.enabled && listMessageFilters().length > 0,
+  run(io, ctx) {
+    const applied = applyMessageFilters(io.messages, ctx.config.messageFilters);
+    return { ...io, messages: applied.messages };
+  }
+};
+var hideCompressCallsNode = {
+  name: "hide-compress-calls",
+  run(io) {
+    const hidden = hideConsumedCompressCalls(io.state, io.messages);
+    return { ...io, messages: hidden.messages };
+  }
+};
+var recommendNode = {
+  name: "recommend",
+  run(io, ctx) {
+    const protectedRefs = computeProtectedRefs(
+      io.messages,
+      io.state,
+      ctx.config
+    );
+    const contextRanges = buildCompressibleRanges(
+      io.messages,
+      io.state,
+      ctx.config,
+      protectedRefs
+    );
+    const nothingToCompress = contextRanges.compressible.length === 0;
+    const recommendation = {
+      contextRanges,
+      recommendedRanges: contextRanges.compressible,
+      nothingToCompress
+    };
+    return { ...io, effects: { ...io.effects, recommendation } };
+  }
+};
+var nudgeNode = {
+  name: "nudge-inject",
+  run(io, ctx) {
+    const nudge = decideNudge({
+      tokenCount: ctx.tokenCount,
+      config: ctx.config,
+      state: io.state,
+      messages: io.messages,
+      recommendation: io.effects.recommendation
+    });
+    const baseline = io.state.nudge.lastPerMessageNudgeTokens;
+    const nudgeGrowthTokens = resolveAdaptiveGrowth(
+      ctx.config.modelContextLimit,
+      ctx.config.nudge
+    );
+    let stamped = { ...io.state.nudge };
+    if (baseline > 0 && ctx.tokenCount < baseline - nudgeGrowthTokens) {
+      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;
+      stamped.lastNudgeShownTokens = 0;
+    }
+    if (stamped.lastPerMessageNudgeTokens === 0) {
+      stamped.lastPerMessageNudgeTokens = ctx.tokenCount;
+    }
+    if (nudge.shouldInject) {
+      stamped.lastNudgeShownTokens = ctx.tokenCount;
+    }
+    return {
+      ...io,
+      state: { ...io.state, nudge: stamped },
+      effects: { ...io.effects, nudge }
+    };
+  }
+};
+var emergencyTruncateNode = {
+  name: "emergency-truncate",
+  run(io, ctx) {
+    const usage = ctx.config.modelContextLimit > 0 ? ctx.tokenCount / ctx.config.modelContextLimit : 0;
+    if (usage < ctx.config.truncate.threshold) return io;
+    const trunc = truncateLargeToolOutputs(
+      io.messages,
+      ctx.tokenCount,
+      ctx.config,
+      ctx.countTokens,
+      { protectRecentMessages: ctx.config.preserveRecentMessages }
+    );
+    return {
+      ...io,
+      messages: trunc.messages,
+      effects: { ...io.effects, truncatedCount: trunc.truncatedCount }
+    };
+  }
+};
+function applySingleRange(input) {
+  const resolved = resolveBoundaries({
+    startRef: input.spec.startRef,
+    endRef: input.spec.endRef,
+    messages: input.messages,
+    state: input.state
+  });
+  const isBlockBoundary = resolved.boundaryKind === "block";
+  const targetTier = resolveTargetTier(
+    input.state,
+    resolved.nestedBlockIds,
+    isBlockBoundary
+  );
+  const outputTier = isBlockBoundary ? Math.min(3, targetTier + 1) : 1;
+  const consumedBlockIds = resolved.nestedBlockIds.filter((id) => {
+    const block2 = blockById(input.state, id);
+    return block2?.active && block2.tier === targetTier;
+  });
+  const effectiveMessageIds = new Set(resolved.messageIds);
+  for (const consumedId of consumedBlockIds) {
+    const consumed = blockById(input.state, consumedId);
+    if (consumed) {
+      for (const id of consumed.effectiveMessageIds)
+        effectiveMessageIds.add(id);
+    }
+  }
+  const directMessageIds = [...effectiveMessageIds].filter(
+    (id) => !input.preExistingCoverage.has(id)
+  );
+  const { filteredIds, appendedProtectedText } = filterProtectedToolMessages(
+    directMessageIds,
+    input.messages,
+    input.config
+  );
+  validateCompressionRange(input, filteredIds, consumedBlockIds.length);
+  let compressedTokens = 0;
+  for (const id of filteredIds) {
+    const message = input.messages.find((entry) => entry.id === id);
+    compressedTokens += input.countTokens(message?.text ?? "");
+  }
+  for (const consumedId of consumedBlockIds) {
+    const consumed = blockById(input.state, consumedId);
+    if (consumed) {
+      compressedTokens += input.countTokens(consumed.summary);
+    }
+  }
+  const blockId = allocateBlockId(input.state);
+  const finalSummary = appendedProtectedText.length > 0 ? `${input.spec.summary}
+
+The following protected tool calls were used in this conversation as well:
+${appendedProtectedText.join("")}` : input.spec.summary;
+  const maxLen = input.spec.summaryMaxChars ?? input.config.compress.maxSummaryLength;
+  if (maxLen > 0 && finalSummary.length > maxLen) {
+    throw new Error(
+      `Summary too long after appending protected content (${finalSummary.length} chars, max ${maxLen}). Reduce the summary or remove protected tools from the range.`
+    );
+  }
+  const block = {
+    blockId,
+    runId: input.runId,
+    tier: outputTier,
+    topic: input.spec.topic,
+    summary: finalSummary,
+    directMessageIds: filteredIds,
+    effectiveMessageIds: [...effectiveMessageIds],
+    directBlockIds: [...consumedBlockIds],
+    compressedTokens,
+    createdAt: Date.now(),
+    survivedCount: 0,
+    generation: "young",
+    active: true,
+    compressCallId: input.spec.compressCallId
+  };
+  input.state.blocks.push(block);
+  for (const consumedId of consumedBlockIds) {
+    const consumed = blockById(input.state, consumedId);
+    if (consumed) consumed.active = false;
+  }
+  return compressedTokens;
+}
+function validateCompressionRange(input, directMessageIds, consumedBlockCount) {
+  const cfg = input.config.compress;
+  const summary = input.spec.summary?.trim() ?? "";
+  if (summary.length === 0) {
+    throw new Error(
+      "Summary is empty \u2014 provide a meaningful summary of the compressed range."
+    );
+  }
+  if (cfg.minSummaryLength > 0 && summary.length < cfg.minSummaryLength) {
+    throw new Error(
+      `Summary too short (${summary.length} chars, min ${cfg.minSummaryLength}). The summary must capture the compressed range's key information.`
+    );
+  }
+  const effectiveMax = input.spec.summaryMaxChars ?? cfg.maxSummaryLength;
+  if (effectiveMax > 0 && summary.length > effectiveMax) {
+    throw new Error(
+      `Summary too long (${summary.length} chars, max ${effectiveMax}). Strip noise \u2014 keep critical paths, decisions, errors, and code references. Or pass summaryMaxChars to increase the limit \u2014 don't lose critical info just to fit.`
+    );
+  }
+  if (directMessageIds.length === 0 && consumedBlockCount === 0) {
+    throw new Error(
+      "Range contains no compressible messages \u2014 all are already covered by active blocks or protected."
+    );
+  }
+}
+function filterProtectedToolMessages(directMessageIds, messages, config) {
+  const removedToolCallIds = /* @__PURE__ */ new Set();
+  const allProtectedCallIds = /* @__PURE__ */ new Set();
+  const removedIds = /* @__PURE__ */ new Set();
+  const appendedProtectedText = [];
+  for (const msg of messages) {
+    if (isMessageProtected(msg, config) && msg.toolCallId) {
+      allProtectedCallIds.add(msg.toolCallId);
+    }
+  }
+  for (const id of directMessageIds) {
+    const msg = messages.find((m) => m.id === id);
+    if (!msg) continue;
+    if (!isMessageProtected(msg, config)) continue;
+    removedIds.add(id);
+    if (msg.toolCallId) removedToolCallIds.add(msg.toolCallId);
+    if (msg.text) {
+      appendedProtectedText.push(
+        `
+### Protected: ${msg.toolName ?? "tool"}
+${msg.text}`
+      );
+    }
+  }
+  for (const id of directMessageIds) {
+    if (removedIds.has(id)) continue;
+    const msg = messages.find((m) => m.id === id);
+    if (!msg) continue;
+    if (msg.contentType === "tool-result" && msg.toolCallId && (removedToolCallIds.has(msg.toolCallId) || allProtectedCallIds.has(msg.toolCallId))) {
+      removedIds.add(id);
+    }
+  }
+  return {
+    filteredIds: directMessageIds.filter((id) => !removedIds.has(id)),
+    appendedProtectedText
+  };
+}
+function resolveTargetTier(state, nestedBlockIds, isBlockBoundary) {
+  if (!isBlockBoundary) return 1;
+  if (nestedBlockIds.length === 0) return 1;
+  let minTier = 3;
+  for (const id of nestedBlockIds) {
+    const block = blockById(state, id);
+    if (block && block.tier < minTier) minTier = block.tier;
+  }
+  return minTier;
+}
+function collectCoverage(state) {
+  const coverage = /* @__PURE__ */ new Set();
+  for (const block of activeBlocks(state)) {
+    for (const id of block.effectiveMessageIds) coverage.add(id);
+  }
+  return coverage;
+}
+function resolveAdaptiveGrowth(modelContextLimit, nudge) {
+  if (!modelContextLimit || modelContextLimit <= 0) return nudge.growthFloor;
+  return Math.min(
+    nudge.growthCap,
+    Math.max(
+      nudge.growthFloor,
+      Math.round(modelContextLimit * nudge.growthRatio)
+    )
+  );
+}
+function decideNudge(input) {
+  const { config, state, tokenCount, recommendation } = input;
+  const limit = config.modelContextLimit;
+  const usage = limit > 0 ? tokenCount / limit : 0;
+  const nudgeGrowthTokens = resolveAdaptiveGrowth(limit, config.nudge);
+  const emergencyOverride = usage >= config.nudge.emergencyThresholdPct;
+  const baseline = state.nudge.lastPerMessageNudgeTokens;
+  const hadPendingNudge = state.nudge.lastNudgeShownTokens > 0;
+  const hasPendingNudge = hadPendingNudge;
+  const effectiveThreshold = hasPendingNudge ? Math.floor(nudgeGrowthTokens / 2) : nudgeGrowthTokens;
+  const growthReference = state.nudge.lastNudgeShownTokens > 0 ? state.nudge.lastNudgeShownTokens : baseline > 0 ? baseline : tokenCount;
+  const growthFloor = Math.max(
+    config.nudge.minGrowthFloor,
+    config.nudge.minGrowthRatio * nudgeGrowthTokens
+  );
+  const growthSinceReference = tokenCount - growthReference;
+  const growthTriggered = growthSinceReference >= effectiveThreshold;
+  let shouldContextNudge = emergencyOverride || growthTriggered;
+  if (shouldContextNudge && !emergencyOverride) {
+    shouldContextNudge = growthSinceReference >= growthFloor;
+  }
+  let tier = null;
+  if (config.tiers.enabled) {
+    const active = activeBlocks(state);
+    const activeT1 = active.filter((b) => b.tier === 1);
+    const activeT2 = active.filter((b) => b.tier === 2);
+    if (activeT2.length >= config.tiers.tier3Trigger) tier = 3;
+    else if (activeT1.length >= config.tiers.tier2Trigger) tier = 2;
+  }
+  const rec = recommendation;
+  const nothingToCompress = rec ? rec.contextRanges.compressible.length === 0 : false;
+  const shouldInject = shouldContextNudge || tier !== null;
+  let reason;
+  if (!shouldInject) {
+    reason = `growth ${growthSinceReference} < threshold ${effectiveThreshold}${hasPendingNudge ? " (halved)" : ""} (floor ${growthFloor})`;
+  } else if (emergencyOverride) {
+    reason = `EMERGENCY: usage ${Math.round(usage * 100)}% >= ${Math.round(config.nudge.emergencyThresholdPct * 100)}%`;
+  } else if (tier !== null) {
+    reason = `tier-${tier} distillation trigger`;
+  } else if (nothingToCompress) {
+    reason = `growth ${growthSinceReference} >= ${effectiveThreshold} but no specific ranges worth compressing`;
+  } else {
+    reason = `growth ${growthSinceReference} >= ${effectiveThreshold}${hasPendingNudge ? " (halved)" : ""}, usage ${Math.round(usage * 100)}%`;
+  }
+  const ctxBreakdown = computeContextBreakdown(input.messages, tokenCount, growthSinceReference);
+  return {
+    shouldInject,
+    reason,
+    compressibleRanges: rec?.recommendedRanges ?? [],
+    protectedRanges: rec?.contextRanges.protected ?? [],
+    contextUsage: usage,
+    tier,
+    breakdown: {
+      usage,
+      growth: growthSinceReference,
+      growthReference,
+      effectiveThreshold,
+      nudgeGrowthTokens,
+      growthFloor,
+      hasPendingNudge: hasPendingNudge ? 1 : 0,
+      emergencyOverride: emergencyOverride ? 1 : 0
+    },
+    contextBreakdown: ctxBreakdown
+  };
+}
+function computeContextBreakdown(messages, total, growth) {
+  let system = 0, tool = 0, summaries = 0, code = 0, text = 0;
+  for (const msg of messages) {
+    const tokens = Math.ceil((msg.text ?? "").length / 4);
+    if (msg.text?.startsWith("[Compressed conversation section]")) {
+      summaries += tokens;
+    } else if (msg.contentType === "tool-call" || msg.contentType === "tool-result") {
+      tool += tokens;
+    } else if (msg.role === "system") {
+      system += tokens;
+    } else if (msg.text?.includes("```")) {
+      code += tokens;
+    } else {
+      text += tokens;
+    }
+  }
+  return { system, tool, summaries, code, text, total, growth };
+}
+function cloneState(state) {
+  return {
+    blocks: state.blocks.map((block) => ({
+      ...block,
+      directMessageIds: [...block.directMessageIds],
+      effectiveMessageIds: [...block.effectiveMessageIds],
+      directBlockIds: [...block.directBlockIds]
+    })),
+    messageRefs: {
+      byRaw: { ...state.messageRefs.byRaw },
+      byRef: { ...state.messageRefs.byRef }
+    },
+    nudge: { ...state.nudge, anchors: { ...state.nudge.anchors } },
+    stats: { ...state.stats },
+    nextBlockId: state.nextBlockId,
+    nextRunId: state.nextRunId
+  };
+}
+function scoreRelevance(block, terms) {
+  const topic = (block.topic ?? "").toLowerCase();
+  const summary = block.summary.toLowerCase();
+  let score = 0;
+  for (const term of terms) {
+    const topicHits = countOccurrences(topic, term);
+    if (topicHits > 0) score += Math.min(topicHits * 0.15, 0.45);
+    const summaryHits = countOccurrences(summary, term);
+    if (summaryHits > 0) score += Math.min(summaryHits * 0.04, 0.2);
+  }
+  return Math.min(score, 1);
+}
+function countOccurrences(haystack, needle) {
+  if (!haystack || !needle) return 0;
+  let count = 0;
+  let position = 0;
+  while ((position = haystack.indexOf(needle, position)) !== -1) {
+    count++;
+    position += needle.length;
+  }
+  return count;
+}
+
+// src/compression-rules.ts
+var COMPRESS_PHILOSOPHY = `Compression Philosophy:
+- All compression serves the primary task, but be frugal.
+- Context capacity is precious. Save context by compressing consumed outputs, not by avoiding tools.
+- Compress by need, not by percentage.
+- Work from summaries, not raw tool outputs. All listed ranges (user prompts, tool outputs, code, logs, exploration, intermediate steps) should be compressed to summary format \u2014 the ONLY exceptions are protected content, content the current step is actively using, or critical content you cannot reconstruct.
+- Curate summaries like a well-structured document. User prompts, compressed tool outputs, code, logs, or skill-call intermediate results that are critically important should be preserved \u2014 not by exempting them from compression, but by embedding them in the summary via [[KEEP:mNNNNN]] (auto-expanded verbatim) and [[REF:mNNNNN|description]] (compact link).`;
+var HOW_TO_COMPRESS_RULES = `HOW TO COMPRESS
+
+When you call \`compress\`, the summary you write becomes the only record of the replaced conversation. Make it self-contained and complete: every user request, experiment purpose, and work task in the range must be accurately captured. A later reader (or you, after decompressing) should be able to continue the task WITHOUT needing the original.
+
+KEEP VERBATIM \u2014 never paraphrase or abbreviate these:
+- Full file paths with line numbers, directory prefix on every mention (\`lib/hooks.ts:347\`, \`src/index.ts:12-18\`, \`gatenet_v3/model.py:45\`). Never abbreviate to a bare filename (\`hooks.ts\`, \`model.py\`) \u2014 they are ambiguous and cannot be grepped or decompressed-to later.
+- Function, class, and type signatures (exact names, params, return types) AND critical code lines that encode logic \u2014 the line that IS the finding, not just the function name (e.g. \`kv_keys += define_gate * a_key[i](emb)\` is more useful than "see model_kvnet.py").
+- Error messages and stack traces (exact text \u2014 you need the literal string to grep for it later).
+- Key details from reports and analyses \u2014 not just the conclusion. Keep the comparison numbers and the mechanism, not "X is worse" alone (write "1.76\xD7 PPL gap because KV store is static", not "KVNet underperforms").
+- Decisions and their rationale ("chose X over Y because Z" \u2014 the "because" is load-bearing; without it the decision looks arbitrary).
+- Constraints discovered ("must support Node 22", "no new dependencies", "AGENTS.md forbids \`as any\`").
+- Exact values: versions, config keys, thresholds, magic numbers.
+- User intent \u2014 quote short user messages verbatim. When the message is too long to quote, preserve intent with extra care: do not change scope, constraints, priorities, acceptance criteria, or requested outcomes. Mark them clearly as past quotes (e.g., "User said: ..."), not as current directives. Losing these changes the task itself.
+- The user's overall goal and any changes to it \u2014 the big-picture objective plus how it evolved during the compressed range. Each summary must reflect the goal as it stood at the end of the range, including pivots (e.g., "initially: fix bug X \u2192 pivoted to: refactor module Y after discovering root cause"). Losing the goal or its evolution makes all subsequent work appear unmotivated.
+- Purpose behind each significant action \u2014 preserve not just what was done but why: the hypothesis behind each experiment, the question behind each exploration, the task goal behind each work action. Without purpose, the summary reads as disconnected technical steps with no through-line.
+- Open questions and unresolved TODOs \u2014 losing these changes what work appears to remain.
+- Message refs of key anchors (\`m00420\`, \`m00510\u2013m00520\`) \u2014 they let you or a later reader jump back via decompress to the exact original.
+
+DROP \u2014 extract the signal, discard the vessel:
+- Verbose logs (build/test/\`npm\` output) once you have captured the error line or the result.
+- Duplicate file reads once the needed content is recorded.
+- Consumed exploration \u2014 search hits, agent return values, successful tool outputs \u2014 once you have extracted the facts you need (same rule as dead-ends, but nothing went wrong; the content is simply spent).
+- Dead-end exploration \u2014 but PRESERVE the lesson in one line: "tried X, failed because Y".
+- Back-and-forth discussion and self-corrections once the final position is captured (keep the outcome, drop the journey to it).
+- Repeated status checks (\`git status\`, \`ls\`) once state is known.
+
+For each significant item you DROP (scripts, reports, large analyses, long tool outputs), add a one-line CONTENT description of what it covers \u2014 not where it lives. Bad: "probe script at /path/probe_kvnet.py". Good: "probe_kvnet.py: tests n-gram baseline, generation quality, long-range dependency, position sensitivity, op pipeline, QUERY attention." This lets a later decompress target the right block by relevance, not by guessing locations.
+
+KEEP MARKERS: \`[[KEEP:mNNNNN]]\` expands original message content into the summary (truncated to a max length). Do NOT use KEEP for verbose command output, diagnostic scripts, log dumps, or any content whose value is in the conclusion rather than the raw output \u2014 summarize these or use \`[[REF:mNNNNN|desc]\` instead.
+
+PRIORITY \u2014 when the summary must be compact, preserve in this order:
+1. User's overall goal, goal evolution, intent, and hard constraints (losing these changes the task).
+2. Decisions and rationale.
+3. Exact technical artifacts: paths, signatures, errors, values.
+4. Conclusions and key findings.
+5. Lessons learned: what failed and why.
+
+Write dense, scannable bullets \u2014 not narrative prose. If the range spans distinct concerns (request \u2192 findings \u2192 decision), group bullets under short thematic headers so a reader can scan to the part they need. Every line must earn its place. Do not mimic the style of existing summaries in context; follow these rules.`;
+var TIER2_DISTILL_RULES = `TIER 2 COMPRESSION \u2014 DISTILLATION
+
+You are compressing historical summaries (not raw conversation). These summaries have already captured the details. Your job is to DISTILL them: extract only what matters for future work, discard the process.
+
+KEEP \u2014 these are the only things that survive distillation:
+- Decisions and their rationale ("chose X over Y because Z" \u2014 the "because" is load-bearing).
+- Final outcomes: version numbers shipped, PR numbers merged/closed, bugs fixed or deferred.
+- Key lessons: what failed and why ("tried X, failed because Y"). These prevent repeating mistakes.
+- Critical constraints discovered ("must support Node 22", "AGENTS.md forbids as any").
+- Design decisions with architectural impact ("chose compress-as-anchor over synthetic messages because prefix cache").
+- Whether content is OBSOLETE or SUPERSEDED \u2014 mark with one line: "[SUPERSEDED by PR #NNN]" or "[OBSOLETE: deleted in vX.Y.Z]". Do NOT keep the obsolete content's details \u2014 just the marker and reason.
+- Function/class/type names and module paths that are the SUBJECT of the work \u2014 e.g., "fixed filterCompressedRanges in prune.ts", "added SessionStateRegistry in state.ts". Not exact line numbers or full signatures \u2014 just enough to LOCATE the code without searching.
+- Exploration findings: if a block was exploratory with no decision, keep the CONCLUSION in one line ("explored X, not viable because Y"). Do not keep the exploration process.
+
+DROP \u2014 these were useful during the work but are no longer needed:
+- Exact line numbers, diffs, verbose function signatures, full code listings.
+- Build/deploy process details, test execution steps.
+- Review process details (who reviewed, what rounds, test counts).
+- Verbose logs, command output, intermediate debugging steps.
+
+FORMAT:
+- Start each distilled block with a source header line:
+  \`Source: bN+bM+... (XK\u2192YK tok, Zx). [original topic]\`
+  Example: \`Source: b5+b7 (56K+44K\u2192268 tok, 375x). [Tool-result recap + publish]\`
+- 3-5 bullet points per source block, each a self-contained fact.
+- Dense, scannable \u2014 no narrative prose.
+- Start with the outcome, not the process: "v1.13.0 shipped (7 PRs bundled)" not "implemented 7 PRs then reviewed then merged".
+- Cross-block synthesis: if multiple source blocks cover the same topic (same PR, same feature, same bug), MERGE them into a single group of bullets. Do not repeat the same fact from different blocks \u2014 keep it once under the most relevant source header.
+
+SIZE TARGET: 50-150 tokens per source block (excluding the header). If you can't fit it in 150 tokens, you're keeping too much process. If a block has nothing worth keeping (pure noise), output just the header followed by "[no actionable content]."`;
+var TIER3_CONDENSE_RULES = `TIER 3 COMPRESSION \u2014 ULTRA-CONDENSATION
+
+You are compressing distilled summaries (Tier 2) into ultra-condensed facts (Tier 3). The distilled summaries already contain only decisions and outcomes. Your job is to reduce them to bare factual references.
+
+PRIORITY \u2014 when a source block has more facts than the size target allows, keep in this order:
+1. Shipped outcomes (versions released, PRs merged) \u2014 these are permanent record.
+2. Open work (PRs/issues still pending) \u2014 these may need follow-up.
+3. Key decisions with architectural impact ("chose X over Y because Z").
+4. Critical constraints ("must support Node 22").
+Drop everything else. Tier 3 is a lookup index, not a knowledge base.
+
+FORMAT:
+- Start with a source header line:
+  \`Source: bN+bM+... (XK\u2192YK tok, Zx). [original topic]\`
+- Output 1-3 facts per source block. Each fact is a single line: subject + outcome.
+- No explanations, no rationale, no process \u2014 just the fact.
+- Format: "[PR/Issue/Version] \u2014 [outcome in \u22648 words]"
+- Merge related facts from different source blocks if they concern the same topic.
+
+EXAMPLES:
+- "v1.13.0 shipped \u2014 quality gate + GC fix (7 PRs)"
+- "PR #196 merged \u2014 preserve-first-user (supersedes #169)"
+- "Bug 1214 fixed \u2014 compress consumed all user messages"
+- "Chose compress-as-anchor \u2014 prefix cache benefit over synthetic injection"
+- "Constraint: AGENTS.md forbids as any \u2014 never suppress types"
+
+DROP:
+- Multi-sentence context. If a fact needs >1 sentence, it's too detailed for Tier 3.
+- Lessons learned ("tried X, failed because Y") \u2014 drop UNLESS the failure is likely to recur and the block is <30 days old.
+- Design rationale details \u2014 keep the decision, drop the "because" unless it's a critical constraint.
+- Anything marked [OBSOLETE] or [SUPERSEDED] \u2014 drop entirely, note "[N blocks obsolete]" in the summary.
+
+SIZE TARGET: 30-60 tokens per source block (including header). For a batch of N source blocks, total output \u2248 N \xD7 40 tokens. If a source block has only one trivial fact, output just the header + one line.`;
+
+// src/nudge-text.ts
+var EFFICIENCY_NOTE = `This is an efficiency nudge to compress early and keep context lean \u2014 not an overflow warning. A separate, stronger alert will appear if the context is actually full.
+
+${COMPRESS_PHILOSOPHY}`;
+var EMERGENCY_HEADER = `\u26A0\uFE0F Context limit reached \u2014 compress now. Prioritize consumed tool outputs.
+
+${COMPRESS_PHILOSOPHY}`;
+function formatK(n) {
+  if (n >= 1e3) return `${(n / 1e3).toFixed(1)}K`;
+  return `${n}`;
+}
+function formatBreakdown(bd) {
+  if (!bd) return "";
+  const parts = [];
+  if (bd.system > 0) parts.push(`${formatK(bd.system)} system`);
+  if (bd.tool > 0) parts.push(`${formatK(bd.tool)} tool`);
+  if (bd.summaries > 0) parts.push(`${formatK(bd.summaries)} summaries`);
+  if (bd.code > 0) parts.push(`${formatK(bd.code)} code`);
+  if (bd.text > 0) parts.push(`${formatK(bd.text)} text`);
+  const growth = bd.growth > 0 ? `
++${formatK(bd.growth)} since last nudge` : "";
+  return `Context breakdown: ${parts.join(" | ")}${growth}`;
+}
+function refToNum(ref) {
+  if (!ref) return 0;
+  const m = ref.match(/^m0*(\d+)$/);
+  return m && m[1] ? parseInt(m[1], 10) : 0;
+}
+function mergeRanges(compressible, protected_) {
+  const entries = [];
+  for (const r of compressible) {
+    const sNum = refToNum(r.startRef);
+    const eNum = refToNum(r.endRef);
+    entries.push({
+      startRef: r.startRef,
+      endRef: r.endRef,
+      startNum: sNum,
+      endNum: eNum,
+      count: r.count,
+      tokens: r.tokens,
+      compressibleTokens: r.tokens,
+      compressibleCount: r.count,
+      protectedTokens: 0,
+      protectedCount: 0,
+      protectedTools: [],
+      toolPct: r.toolPct,
+      textPct: r.textPct,
+      dangerous: r.dangerous ?? false
+    });
+  }
+  for (const r of protected_) {
+    const sNum = refToNum(r.startRef);
+    const eNum = refToNum(r.endRef);
+    entries.push({
+      startRef: r.startRef,
+      endRef: r.endRef,
+      startNum: sNum,
+      endNum: eNum,
+      count: r.count,
+      tokens: r.tokens,
+      compressibleTokens: 0,
+      compressibleCount: 0,
+      protectedTokens: r.tokens,
+      protectedCount: r.count,
+      protectedTools: [...r.tools],
+      toolPct: 0,
+      textPct: 0,
+      dangerous: false
+    });
+  }
+  entries.sort((a, b) => a.startNum - b.startNum);
+  const merged = [];
+  for (const e of entries) {
+    const last = merged[merged.length - 1];
+    if (last && last.endNum + 1 >= e.startNum) {
+      last.endRef = e.endRef;
+      last.endNum = Math.max(last.endNum, e.endNum);
+      last.count += e.count;
+      last.tokens += e.tokens;
+      last.compressibleTokens += e.compressibleTokens;
+      last.compressibleCount += e.compressibleCount;
+      last.protectedTokens += e.protectedTokens;
+      last.protectedCount += e.protectedCount;
+      if (e.dangerous) last.dangerous = true;
+      for (const t of e.protectedTools) {
+        if (!last.protectedTools.includes(t)) last.protectedTools.push(t);
+      }
+    } else {
+      merged.push({ ...e });
+    }
+  }
+  return merged;
+}
+function formatRanges(compressible, protected_) {
+  const merged = mergeRanges(compressible, protected_);
+  if (merged.length === 0) {
+    return "[No specific ranges detected \u2014 compress any consumed content.]";
+  }
+  const lines = merged.slice(0, 10).map((e) => {
+    const suffix = e.dangerous && e.compressibleTokens > 0 ? "  \u26A0\uFE0F NOT recommended unless you are certain." : "";
+    if (e.protectedTokens > 0 && e.compressibleTokens === 0) {
+      return `  ${e.startRef}\u2013${e.endRef}  ${e.count} msgs  ${formatK(e.tokens)} [PROTECTED: ${e.protectedTools.join(", ")} \u2014 not compressible]${suffix}`;
+    }
+    if (e.protectedTokens > 0 && e.compressibleTokens > 0) {
+      return `  ${e.startRef}\u2013${e.endRef}  ${e.count} msgs  ${formatK(e.tokens)} [${formatK(e.compressibleTokens)} compressible | ${formatK(e.protectedTokens)} protected: ${e.protectedTools.join(", ")}]${suffix}`;
+    }
+    return `  ${e.startRef}\u2013${e.endRef}  ${e.count} msgs  ${formatK(e.tokens)} [tool ${e.toolPct}% | text ${e.textPct}%]${suffix}`;
+  });
+  return `Compressible ranges (oldest first):
+${lines.join("\n")}`;
+}
+function renderNudgeText(decision) {
+  const breakdownStr = formatBreakdown(decision.contextBreakdown);
+  const rangesStr = formatRanges(decision.compressibleRanges, decision.protectedRanges ?? []);
+  if (decision.tier !== null && decision.tier >= 2) {
+    const isT2 = decision.tier === 2;
+    return {
+      voice: "gentle",
+      text: [
+        EFFICIENCY_NOTE,
+        "",
+        breakdownStr,
+        "",
+        `[TIER ${decision.tier} ${isT2 ? "DISTILLATION" : "CONDENSATION"} TRIGGER]`,
+        isT2 ? "Your tier-1 compression summaries have accumulated. Distill them into a single denser tier-2 summary. Use block IDs as boundaries." : "Your tier-2 compression summaries have accumulated. Condense them further into a tier-3 ultra-condensed summary. Use block IDs as boundaries.",
+        `Example: compress({ content: [{ startId: "b1", endId: "b5", summary: "..." }] })`,
+        "",
+        HOW_TO_COMPRESS_RULES,
+        "",
+        isT2 ? TIER2_DISTILL_RULES : TIER3_CONDENSE_RULES
+      ].join("\n")
+    };
+  }
+  const isEmergency = !!decision.breakdown?.emergencyOverride;
+  if (isEmergency) {
+    return {
+      voice: "emergency",
+      text: [
+        EMERGENCY_HEADER,
+        "",
+        breakdownStr,
+        "",
+        HOW_TO_COMPRESS_RULES,
+        "",
+        `{ "topic": "...", "content": [{ "startId": "<ID>", "endId": "<ID>", "summary": "..." }] }`,
+        "Only use IDs from visible messages above. Compress older work first.",
+        "",
+        rangesStr
+      ].join("\n")
+    };
+  }
+  return {
+    voice: "gentle",
+    text: [
+      EFFICIENCY_NOTE,
+      "",
+      breakdownStr,
+      "",
+      HOW_TO_COMPRESS_RULES,
+      "",
+      rangesStr,
+      "",
+      `\u{1F4A1} Compress all ranges in one call (pass multiple content entries: \`content: [{...}, {...}]\`).`
+    ].join("\n")
+  };
+}
+
+// src/keep-markers.ts
+var KEEP_REGEX = /\[\[KEEP:(m\d+)\]\]/g;
+var REF_REGEX = /\[\[REF:(m\d+)\|([^\]]+)\]\]/g;
+function resolveKeepMarkers(summary, messages, state, maxChars = 2e3) {
+  const messageByRef = /* @__PURE__ */ new Map();
+  for (const message of messages) {
+    const ref = refForRaw(state.messageRefs, message.id);
+    if (ref) messageByRef.set(ref, message);
+  }
+  let expandedCount = 0;
+  let refCount = 0;
+  const unresolvedRefs = [];
+  const expanded = summary.replace(KEEP_REGEX, (match, ref) => {
+    const normalized = normalizeRef(ref);
+    const message = normalized ? messageByRef.get(normalized) : void 0;
+    if (!message) {
+      unresolvedRefs.push(ref);
+      return match;
+    }
+    expandedCount++;
+    return formatKeptMessage(message, normalized, maxChars);
+  }).replace(REF_REGEX, (_match, ref, desc) => {
+    const normalized = normalizeRef(ref);
+    const message = normalized ? messageByRef.get(normalized) : void 0;
+    if (!message) {
+      unresolvedRefs.push(ref);
+      return _match;
+    }
+    refCount++;
+    return `[\u2192 ${normalized}: ${desc.trim()}]`;
+  });
+  return { summary: expanded, expandedCount, refCount, unresolvedRefs };
+}
+function normalizeRef(ref) {
+  const match = /^m0*(\d{1,5})$/.exec(ref.trim().toLowerCase());
+  if (!match || match[1] === void 0) return null;
+  return `m${match[1].padStart(5, "0")}`;
+}
+function formatKeptMessage(message, ref, maxChars) {
+  const label = labelFor(message);
+  const body = truncate(message.text ?? "[empty message]", maxChars);
+  return `
+--- [${ref}: ${label}] ---
+${body}
+--- end ---
+`;
+}
+function labelFor(message) {
+  if (message.contentType === "tool-call" || message.contentType === "tool-result") {
+    return message.toolName ?? "tool";
+  }
+  return message.role;
+}
+function truncate(text, maxChars) {
+  if (text.length <= maxChars) return text;
+  return text.slice(0, maxChars) + `
+... [truncated, ${text.length} chars total]`;
+}
+
+// src/decompress.ts
+function parseBlockIdArg(arg) {
+  const normalized = arg.trim().toLowerCase();
+  const refMatch = /^b0*(\d+)$/.exec(normalized);
+  if (refMatch && refMatch[1] !== void 0) return `b${refMatch[1]}`;
+  const numMatch = /^(\d+)$/.exec(normalized);
+  if (numMatch && numMatch[1] !== void 0) return `b${numMatch[1]}`;
+  return null;
+}
+function findBlocksOverlappingMessages(state, messageIds) {
+  if (messageIds.size === 0) return [];
+  const matched = [];
+  for (const block of state.blocks) {
+    if (!block.active) continue;
+    if (block.effectiveMessageIds.some((id) => messageIds.has(id))) {
+      matched.push(block);
+    }
+  }
+  return matched.sort((a, b) => numericPart2(a.blockId) - numericPart2(b.blockId));
+}
+function findActiveAncestor(state, blockId) {
+  const start = state.blocks.find((b) => b.blockId === blockId);
+  if (!start) return null;
+  const queue = [...start.directBlockIds];
+  const visited = /* @__PURE__ */ new Set();
+  while (queue.length > 0) {
+    const currentId = queue.shift();
+    if (visited.has(currentId)) continue;
+    visited.add(currentId);
+    const current = state.blocks.find((b) => b.blockId === currentId);
+    if (!current) continue;
+    if (current.active) return current.blockId;
+    for (const ancestorId of current.directBlockIds) {
+      if (!visited.has(ancestorId)) queue.push(ancestorId);
+    }
+  }
+  return null;
+}
+function deactivateBlock(state, blockIds, options = {}) {
+  const targets = new Set(blockIds);
+  const updated = state.blocks.map((block) => {
+    if (!targets.has(block.blockId) || !block.active) return block;
+    return {
+      ...block,
+      active: false,
+      durationMs: block.durationMs,
+      createdAt: block.createdAt
+    };
+  });
+  let final = updated;
+  if (options.deep) {
+    const visited = /* @__PURE__ */ new Set();
+    const queue = [];
+    for (const id of blockIds) {
+      const block = updated.find((b) => b.blockId === id);
+      if (block) queue.push(...block.directBlockIds);
+    }
+    while (queue.length > 0) {
+      const id = queue.shift();
+      if (visited.has(id)) continue;
+      visited.add(id);
+      final = final.map((block) => {
+        if (block.blockId !== id) return block;
+        queue.push(...block.directBlockIds);
+        return block.active ? { ...block, active: false } : block;
+      });
+    }
+  }
+  return { ...state, blocks: final };
+}
+function buildRestoredContentPreview(messages, beforeActiveMessageIds, state) {
+  const restored = [];
+  for (const message of messages) {
+    if (!beforeActiveMessageIds.has(message.id)) continue;
+    const stillCovered = state.blocks.some(
+      (b) => b.active && b.effectiveMessageIds.includes(message.id)
+    );
+    if (!stillCovered) restored.push(message);
+  }
+  if (restored.length === 0) return { preview: "", restoredCount: 0 };
+  const lines = [];
+  let totalLength = 0;
+  const MAX_PREVIEW = 2e3;
+  const MAX_PER_MESSAGE = 200;
+  for (const message of restored) {
+    if (totalLength >= MAX_PREVIEW) break;
+    const text = message.text ?? "";
+    const truncated = text.length > MAX_PER_MESSAGE ? text.slice(0, MAX_PER_MESSAGE) + "..." : text;
+    const label = message.toolName && message.contentType !== "text" ? `${message.toolName}: ${truncated}` : `[${message.role}] ${truncated}`;
+    lines.push(label);
+    totalLength += label.length + 1;
+  }
+  return { preview: lines.join("\n"), restoredCount: restored.length };
+}
+function numericPart2(blockId) {
+  const match = /^b(\d+)$/.exec(blockId);
+  return match && match[1] !== void 0 ? Number(match[1]) : 0;
+}
+
+// src/report.ts
+function formatTokens(n) {
+  if (!Number.isFinite(n) || n <= 0) return "0";
+  return n >= 1e3 ? `${(n / 1e3).toFixed(1)}K` : String(n);
+}
+function pct(n, total) {
+  if (n <= 0 || total <= 0) return 0;
+  return Math.max(1, Math.round(n / total * 100));
+}
+function numericPart3(blockId) {
+  const match = /^b(\d+)$/.exec(blockId);
+  return match && match[1] !== void 0 ? Number(match[1]) : 0;
+}
+function summaryTokensOf(block, countTokens) {
+  return countTokens(block.summary);
+}
+function effectiveCompressedTokens(block, state, countTokens, visited = /* @__PURE__ */ new Set()) {
+  if (visited.has(block.blockId)) return 0;
+  visited.add(block.blockId);
+  let total = block.compressedTokens;
+  for (const nestedId of block.directBlockIds) {
+    const nested = state.blocks.find((b) => b.blockId === nestedId);
+    if (nested) total += effectiveCompressedTokens(nested, state, countTokens, visited);
+  }
+  return total;
+}
+function tierLabel(block) {
+  return `T${block.tier}`;
+}
+function tierBreakdown(blocks, countTokens) {
+  const tierTokens = {};
+  for (const block of blocks) {
+    tierTokens[block.tier] = (tierTokens[block.tier] ?? 0) + summaryTokensOf(block, countTokens);
+  }
+  const tiers = Object.keys(tierTokens).map(Number);
+  if (tiers.length <= 1) return null;
+  const parts = [];
+  for (const tier of [1, 2, 3]) {
+    if (tierTokens[tier]) parts.push(`T${tier}: ${formatTokens(tierTokens[tier])}`);
+  }
+  return parts.join(" | ");
+}
+function collectVisible(messages, state, countTokens) {
+  const coveredIds = /* @__PURE__ */ new Set();
+  for (const block of state.blocks) {
+    if (!block.active) continue;
+    for (const id of block.effectiveMessageIds) coveredIds.add(id);
+  }
+  let summaryTokens = 0;
+  for (const block of state.blocks) {
+    if (block.active) summaryTokens += summaryTokensOf(block, countTokens);
+  }
+  const visible = [];
+  messages.forEach((message, index) => {
+    if (coveredIds.has(message.id)) return;
+    const ref = refForRaw(state.messageRefs, message.id);
+    if (!ref) return;
+    const tokens = countTokens(message.text ?? "");
+    const tool = message.toolName ?? "text";
+    if (tokens > 0) visible.push({ ref, tokens, tool, index });
+  });
+  return { visible, summaryTokens };
+}
+function buildStatusReport(state, messages, countTokens, options = {}) {
+  const scope = options.scope;
+  const view = options.view ?? "ranges";
+  const toolFilter = options.tool;
+  const sort = options.sort ?? "size";
+  const limit = options.limit ?? 30;
+  const activeBlocks2 = state.blocks.filter((b) => b.active).sort((a, b) => numericPart3(a.blockId) - numericPart3(b.blockId));
+  if (scope === "compressed") {
+    return renderCompressedDrilldown(activeBlocks2, state, sort, limit, countTokens);
+  }
+  const { visible, summaryTokens } = collectVisible(messages, state, countTokens);
+  if (scope === "uncompressed") {
+    if (view === "messages") {
+      return renderMessageDrilldown(visible, toolFilter, sort, limit);
+    }
+    return renderUncompressedRanges(visible);
+  }
+  return renderOverview(visible, summaryTokens, activeBlocks2, state, countTokens, limit);
+}
+function renderOverview(visible, summaryTokens, blocks, state, countTokens, limit) {
+  const lines = [];
+  const toolTypeMap = /* @__PURE__ */ new Map();
+  for (const message of visible) {
+    toolTypeMap.set(message.tool, (toolTypeMap.get(message.tool) ?? 0) + message.tokens);
+  }
+  const topTool = [...toolTypeMap.entries()].sort((a, b) => b[1] - a[1])[0]?.[0];
+  const totalTool = visible.filter((m) => m.tool !== "text").reduce((sum, m) => sum + m.tokens, 0);
+  const totalText = visible.filter((m) => m.tool === "text").reduce((sum, m) => sum + m.tokens, 0);
+  const total = summaryTokens + totalTool + totalText;
+  lines.push("CONTEXT BREAKDOWN");
+  lines.push(
+    `  ${formatTokens(totalTool)} tool (${pct(totalTool, total)}%) | ${formatTokens(totalText)} text (${pct(totalText, total)}%) | ${formatTokens(summaryTokens)} summaries (${pct(summaryTokens, total)}%)`
+  );
+  const topTypes = [...toolTypeMap.entries()].sort((a, b) => b[1] - a[1]).slice(0, 3);
+  if (topTypes.length > 0) {
+    lines.push(`  Top tools: ${topTypes.map(([t, n]) => `${t} (${pct(n, total)}%)`).join(", ")}`);
+  }
+  lines.push("");
+  if (blocks.length === 0) {
+    lines.push("COMPRESSED BLOCKS");
+    lines.push("  No compressed blocks.");
+  } else {
+    const totalSummary = blocks.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);
+    const totalEffective = blocks.reduce(
+      (s, b) => s + effectiveCompressedTokens(b, state, countTokens),
+      0
+    );
+    lines.push(
+      `COMPRESSED BLOCKS \u2014 ${blocks.length} active (${formatTokens(totalSummary)} summary, ${formatTokens(totalEffective)} original)`
+    );
+    const breakdown = tierBreakdown(blocks, countTokens);
+    if (breakdown) lines.push(`  Tier usage: ${breakdown}`);
+    lines.push("");
+    const sorted = [...blocks].sort(
+      (a, b) => effectiveCompressedTokens(b, state, countTokens) - effectiveCompressedTokens(a, state, countTokens) || b.createdAt - a.createdAt
+    );
+    for (const block of sorted.slice(0, limit)) {
+      const topic = block.topic ?? "(no topic)";
+      const eff = effectiveCompressedTokens(block, state, countTokens);
+      lines.push(
+        `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}\u2192${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  "${topic}"`
+      );
+    }
+  }
+  lines.push("");
+  lines.push(
+    `Tip: buildStatusReport({scope:"uncompressed", view:"messages", tool:"${topTool ?? "bash"}"}) for per-message listing`
+  );
+  return lines.join("\n");
+}
+function renderUncompressedRanges(visible) {
+  const lines = [];
+  const totalTokens = visible.reduce((s, m) => s + m.tokens, 0);
+  lines.push(`UNCOMPRESSED \u2014 ${formatTokens(totalTokens)} | ${visible.length} visible messages`);
+  lines.push("");
+  if (visible.length === 0) {
+    lines.push("  (no uncompressed messages)");
+  } else {
+    for (const message of visible.slice(0, 30)) {
+      lines.push(`  ${message.ref} (${formatTokens(message.tokens)}) ${message.tool}`);
+    }
+  }
+  return lines.join("\n");
+}
+function renderMessageDrilldown(visible, toolFilter, sort, limit) {
+  let filtered = visible;
+  if (toolFilter) filtered = filtered.filter((m) => m.tool === toolFilter);
+  if (sort === "time") filtered.sort((a, b) => a.index - b.index);
+  else if (sort === "tool") filtered.sort((a, b) => a.tool.localeCompare(b.tool) || b.tokens - a.tokens);
+  else filtered.sort((a, b) => b.tokens - a.tokens);
+  const totalTokens = filtered.reduce((s, m) => s + m.tokens, 0);
+  const allTokens = visible.reduce((s, m) => s + m.tokens, 0);
+  const header = toolFilter ? `UNCOMPRESSED \u2014 ${toolFilter}: ${formatTokens(totalTokens)} | ${filtered.length} msgs | ${pct(totalTokens, allTokens)}% of visible` : `UNCOMPRESSED \u2014 ${formatTokens(totalTokens)} | ${filtered.length} msgs`;
+  const lines = [header, `Sorted by ${sort}`, ""];
+  const shown = filtered.slice(0, limit);
+  for (const message of shown) {
+    lines.push(`  ${message.ref} (${formatTokens(message.tokens)}) ${message.tool}`);
+  }
+  if (filtered.length > shown.length) {
+    lines.push("");
+    lines.push(`${shown.length} of ${filtered.length} shown.`);
+  }
+  return lines.join("\n");
+}
+function renderCompressedDrilldown(blocks, state, sort, limit, countTokens) {
+  let sorted = [...blocks];
+  if (sort === "time") sorted.sort((a, b) => a.createdAt - b.createdAt);
+  else if (sort === "age") sorted.sort((a, b) => b.survivedCount - a.survivedCount);
+  else
+    sorted.sort(
+      (a, b) => effectiveCompressedTokens(b, state, countTokens) - effectiveCompressedTokens(a, state, countTokens) || b.createdAt - a.createdAt
+    );
+  const totalSummary = sorted.reduce((s, b) => s + summaryTokensOf(b, countTokens), 0);
+  const totalEffective = sorted.reduce(
+    (s, b) => s + effectiveCompressedTokens(b, state, countTokens),
+    0
+  );
+  const lines = [
+    `COMPRESSED \u2014 ${sorted.length} blocks | ${formatTokens(totalEffective)} original \u2192 ${formatTokens(totalSummary)} summary`
+  ];
+  const breakdown = tierBreakdown(sorted, countTokens);
+  if (breakdown) lines.push(`Tier usage: ${breakdown}`);
+  lines.push("");
+  const shown = sorted.slice(0, limit);
+  for (const block of shown) {
+    const nested = block.directBlockIds.length > 0 ? ` nested=[${block.directBlockIds.join(",")}]` : "";
+    const topic = block.topic ?? "(no topic)";
+    const eff = effectiveCompressedTokens(block, state, countTokens);
+    lines.push(
+      `  ${block.blockId} (${tierLabel(block)})  ${formatTokens(eff)}\u2192${formatTokens(summaryTokensOf(block, countTokens))}  ${block.effectiveMessageIds.length} msgs  age=${block.survivedCount} ${block.generation}${nested}`
+    );
+    lines.push(`    "${topic}"`);
+  }
+  if (sorted.length > shown.length) {
+    lines.push("");
+    lines.push(`${shown.length} of ${sorted.length} shown.`);
+  }
+  return lines.join("\n");
+}
+function buildRecap(state, blockId) {
+  const activeBlocks2 = state.blocks.filter((b) => b.active).sort((a, b) => numericPart3(a.blockId) - numericPart3(b.blockId));
+  if (blockId !== void 0) {
+    const block = state.blocks.find((b) => b.blockId === blockId);
+    if (!block) {
+      const activeList = activeBlocks2.map((b) => b.blockId).join(", ");
+      return `Block ${blockId} not found. Active blocks: ${activeList}`;
+    }
+    if (!block.active) {
+      return `Block ${blockId} is inactive (deactivated by nested compression).`;
+    }
+    const range = `${block.effectiveMessageIds.length} messages`;
+    return `[Compressed conversation section]
+${block.summary}
+
+[${blockId} | ${range} | topic: "${block.topic ?? "(none)"}"]`;
+  }
+  if (activeBlocks2.length === 0) return "No active compression blocks.";
+  const lines = [`Active compression blocks (${activeBlocks2.length}):`];
+  for (const block of activeBlocks2) {
+    const range = `${block.effectiveMessageIds.length} messages`;
+    const preview = block.summary.slice(0, 200);
+    lines.push(`
+${block.blockId} | ${range} | "${block.topic ?? "(none)"}"`);
+    lines.push(`  ${preview}${block.summary.length > 200 ? "..." : ""}`);
+  }
+  lines.push(`
+Call with blockId to get the full summary.`);
+  return lines.join("\n");
+}
+
+// src/rebuild.ts
+function rebuildCompressionState(state, messages, config, ports = {}) {
+  const core = createCore({ countTokens: ports.countTokens ?? defaultCountTokens });
+  const refResult = assignRefs(messages, {
+    existing: state.messageRefs,
+    nextIndex: highestUsedIndex(state.messageRefs) + 1
+  });
+  let working = { ...state, messageRefs: refResult.map };
+  const invocations = collectCompressInvocations(messages);
+  let blocksRebuilt = 0;
+  for (const invocation of invocations) {
+    const ranges = extractRanges(invocation.input, invocation.callId);
+    if (ranges.length === 0) continue;
+    const result = core.applyCompression({ ranges, messages, state: working, config });
+    working = result.state;
+    blocksRebuilt += result.result.blocksCreated;
+  }
+  return { state: working, blocksRebuilt };
+}
+function collectCompressInvocations(messages) {
+  const invocations = [];
+  for (const message of messages) {
+    if (message.toolName !== "compress" || message.contentType !== "tool-call") continue;
+    let input;
+    try {
+      input = JSON.parse(message.text ?? "");
+    } catch {
+      continue;
+    }
+    invocations.push({ callId: message.toolCallId, input });
+  }
+  return invocations;
+}
+function extractRanges(input, callId) {
+  const content = input?.content;
+  if (!Array.isArray(content)) return [];
+  const ranges = [];
+  for (const entry of content) {
+    if (!entry || typeof entry !== "object") continue;
+    const e = entry;
+    if (typeof e.summary !== "string") continue;
+    const start = e.startId ?? e.messageId;
+    const end = e.endId ?? e.messageId;
+    if (typeof start !== "string" || typeof end !== "string") continue;
+    ranges.push({
+      startRef: start,
+      endRef: end,
+      summary: e.summary,
+      topic: typeof e.topic === "string" ? e.topic : void 0,
+      compressCallId: callId
+    });
+  }
+  return ranges;
+}
+export {
+  BLOCKED_REF,
+  COMPRESS_PHILOSOPHY,
+  HOW_TO_COMPRESS_RULES,
+  SUMMARY_HEADER,
+  TIER2_DISTILL_RULES,
+  TIER3_CONDENSE_RULES,
+  activeBlocks,
+  advanceSurvival,
+  allocateBlockId,
+  allocateRunId,
+  applyMessageFilters,
+  assignRefs,
+  blockById,
+  buildRecap,
+  buildRestoredContentPreview,
+  buildStatusReport,
+  clearMessageFilters,
+  collectOldGenBlocks,
+  coveredMessageIds,
+  createBpeTokenizer,
+  createCore,
+  createInitialState,
+  deactivateBlock,
+  defaultConfig,
+  defaultCountTokens,
+  emptyRefMap,
+  estimateTokensFast,
+  findActiveAncestor,
+  findBlocksOverlappingMessages,
+  getMessageFilter,
+  hideConsumedCompressCalls,
+  highestActiveTier,
+  highestUsedIndex,
+  indexToRef,
+  isMessageProtected,
+  listMessageFilters,
+  makeIO,
+  matchToolPattern,
+  mergeMarkedBlocks,
+  parseBlockIdArg,
+  parseBoundary,
+  prune,
+  rawForRef,
+  rebuildCompressionState,
+  refForRaw,
+  refToIndex,
+  registerMessageFilter,
+  renderNudgeText,
+  renderRefsNode,
+  renderVisibleRefs,
+  resolveBoundaries,
+  resolveKeepMarkers,
+  runPipeline,
+  syncBlocks,
+  truncateLargeToolOutputs,
+  validateConfig
+};
+//# sourceMappingURL=index.js.map