acp-kernel 0.0.13 → 0.0.14

package/dist/index.d.ts

@@ -25,8 +25,9 @@ export type { HideConsumedResult } from "./hide-consumed.js";
 export { rebuildCompressionState } from "./rebuild.js";
 export type { RebuildResult, RebuildPorts } from "./rebuild.js";
 export { renderVisibleRefs, renderRefsNode } from "./render-refs.js";
-export { searchBlocks } from "./search.js";
-export type { SearchResult, SearchOptions } from "./search.js";
+export { searchBlocks, searchBlocksAsync, blockDocs, messageDocs } from "./search.js";
+export type { SearchResult, SearchOptions, SearchAlgorithm, AsyncSearchAlgorithm, AnySearchAlgorithm, SearchDoc, SearchDocKind, ScoredBlock, MessageRole, RoleWeights, MessageInput } from "./search.js";
+export { DEFAULT_ALGORITHM, DEFAULT_ROLE_WEIGHTS, registerSearchAlgorithm, getSearchAlgorithm, listSearchAlgorithms } from "./search.js";
 export { isMessageProtected, matchToolPattern } from "./protected.js";
 export { runPipeline, makeIO, type PipelineNode, type PipelineContext, type NodeIO, type NodeEffects, } from "./pipeline.js";
 export * from "./filter/index.js";

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,YAAY,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAC3F,YAAY,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAChE,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC/H,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EACH,eAAe,EACf,6BAA6B,EAC7B,kBAAkB,EAClB,eAAe,EACf,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,iBAAiB,CAAC;AACzB,YAAY,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxG,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC5D,YAAY,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EACL,WAAW,EACX,MAAM,EACN,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,WAAW,GACjB,MAAM,eAAe,CAAC;AACvB,cAAc,mBAAmB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,YAAY,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAC3F,YAAY,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAChE,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACjE,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC/H,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EACH,eAAe,EACf,6BAA6B,EAC7B,kBAAkB,EAClB,eAAe,EACf,2BAA2B,EAC3B,mBAAmB,GACtB,MAAM,iBAAiB,CAAC;AACzB,YAAY,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxG,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC5D,YAAY,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACtF,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AACzM,OAAO,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACzI,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACtE,OAAO,EACL,WAAW,EACX,MAAM,EACN,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,WAAW,GACjB,MAAM,eAAe,CAAC;AACvB,cAAc,mBAAmB,CAAC"}

package/dist/index.js

@@ -706,7 +706,7 @@ var renderRefsNode = {
 
 // src/protected.ts
 var ALWAYS_PROTECTED_TOOLS = ["compress"];
-var NEVER_PRESERVE_RECENT_TOOLS = ["decompress"];
+var NEVER_PRESERVE_RECENT_TOOLS = ["decompress", "search_context"];
 function isNeverPreserveRecent(msg) {
   if (msg.contentType !== "tool-call" && msg.contentType !== "tool-result") {
     return false;
@@ -2394,44 +2394,291 @@ function extractRanges(input, callId) {
   return ranges;
 }
 
-// src/search.ts
-function searchBlocks(state, query, options = {}) {
+// src/search/algorithms/substring.ts
+var substringAlgorithm = {
+  name: "substring",
+  description: "Exact substring counting (original baseline). Predictable, no normalization.",
+  score(docs, query) {
+    const terms = query.toLowerCase().trim().split(/\s+/).filter((t) => t.length > 0);
+    if (terms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));
+    return docs.map((d) => {
+      const haystack = d.text.toLowerCase();
+      let score = 0;
+      for (const term of terms) score += countOccurrences2(haystack, term);
+      return { ref: d.ref, score };
+    });
+  }
+};
+function countOccurrences2(haystack, needle) {
+  if (!needle) return 0;
+  return haystack.split(needle).length - 1;
+}
+
+// src/search/stemmer.ts
+function stem(word) {
+  let w = word;
+  if (w.length <= 3) return w;
+  if (w.endsWith("ies")) w = w.slice(0, -3) + "y";
+  else if (w.endsWith("ses") || w.endsWith("xes") || w.endsWith("zes")) w = w.slice(0, -2);
+  else if (w.endsWith("ches") || w.endsWith("shes")) w = w.slice(0, -2);
+  else if (w.endsWith("s") && !w.endsWith("ss")) w = w.slice(0, -1);
+  if (w.endsWith("ing") && w.length > 5) w = w.slice(0, -3);
+  if (w.endsWith("ed") && w.length > 4) w = w.slice(0, -2);
+  if (w.endsWith("ation") && w.length > 6) w = w.slice(0, -3);
+  else if (w.endsWith("tion") && w.length > 5) w = w.slice(0, -4) + "t";
+  else if (w.endsWith("ion") && w.length > 4) w = w.slice(0, -3);
+  if (w.endsWith("ment") && w.length > 6) w = w.slice(0, -4);
+  if (w.endsWith("ness") && w.length > 6) w = w.slice(0, -4);
+  if (w.endsWith("ly") && w.length > 4) w = w.slice(0, -2);
+  return w;
+}
+
+// src/search/tokenizer.ts
+var CJK = /[\u3400-\u9fff\uf900-\ufaff\u3040-\u30ff\uac00-\ud7af]/;
+var CJK_RUN = new RegExp(`${CJK.source}+`, "g");
+var LATIN_WORD = /[a-z][a-z0-9_]*[a-z0-9]|[a-z0-9]/g;
+function tokenize(text, opts = {}) {
+  const lower = text.toLowerCase();
+  const tokens = [];
+  const latin = lower.match(LATIN_WORD) ?? [];
+  for (let w of latin) {
+    if (w.length >= 2) {
+      if (opts.stem) w = stem(w);
+      tokens.push(w);
+    }
+  }
+  const cjkRuns = lower.match(CJK_RUN) ?? [];
+  for (const run of cjkRuns) {
+    if (run.length === 1) {
+      tokens.push(run);
+    } else {
+      for (let i = 0; i < run.length - 1; i++) tokens.push(run.slice(i, i + 2));
+      for (const ch of run) tokens.push(ch);
+    }
+  }
+  return tokens;
+}
+function charBigrams(text) {
+  const grams = [];
+  for (let i = 0; i < text.length - 1; i++) {
+    const pair = text.slice(i, i + 2);
+    if (pair.trim().length === pair.length) grams.push(pair);
+  }
+  return grams;
+}
+function tfMap(text, stem2) {
+  const m = /* @__PURE__ */ new Map();
+  for (const t of tokenize(text, { stem: stem2 })) m.set(t, (m.get(t) ?? 0) + 1);
+  return m;
+}
+
+// src/search/algorithms/bm25.ts
+var bm25Algorithm = {
+  name: "bm25",
+  description: "BM25 with stemming + CJK bigram tokenization. IR-standard relevance ranking.",
+  score(docs, query) {
+    const N = docs.length;
+    const k1 = 1.2;
+    const b = 0.75;
+    const parsed = docs.map((d) => {
+      const text = d.text;
+      const tf = tfMap(text, true);
+      let len = 0;
+      for (const v of tf.values()) len += v;
+      return { id: d.ref, tf, len };
+    });
+    const avgdl = parsed.reduce((s, d) => s + d.len, 0) / (N || 1);
+    const qTerms = tokenize(query, { stem: true });
+    if (qTerms.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));
+    const idf = /* @__PURE__ */ new Map();
+    for (const t of new Set(qTerms)) {
+      let df = 0;
+      for (const d of parsed) if (d.tf.has(t)) df++;
+      idf.set(t, Math.log(1 + (N - df + 0.5) / (df + 0.5)));
+    }
+    return parsed.map((d) => {
+      let score = 0;
+      for (const t of qTerms) {
+        const f = d.tf.get(t) ?? 0;
+        if (f === 0) continue;
+        const idfT = idf.get(t) ?? 0;
+        score += idfT * (f * (k1 + 1)) / (f + k1 * (1 - b + b * d.len / (avgdl || 1)));
+      }
+      return { ref: d.id, score };
+    });
+  }
+};
+
+// src/search/algorithms/fuzzy.ts
+var fuzzyAlgorithm = {
+  name: "fuzzy",
+  description: "Character bigram overlap. Typo-tolerant, script-agnostic, high recall.",
+  score(docs, query) {
+    const qTokens = query.toLowerCase().split(/[\s,]+/).filter((t) => t.length >= 4);
+    if (qTokens.length === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));
+    const qGrams = /* @__PURE__ */ new Set();
+    for (const t of qTokens) for (const g of charBigrams(t)) qGrams.add(g);
+    if (qGrams.size === 0) return docs.map((d) => ({ ref: d.ref, score: 0 }));
+    return docs.map((d) => {
+      const haystack = d.text.toLowerCase();
+      const docGrams = new Set(charBigrams(haystack));
+      let hits = 0;
+      for (const g of qGrams) if (docGrams.has(g)) hits++;
+      return { ref: d.ref, score: hits / qGrams.size };
+    });
+  }
+};
+
+// src/search/algorithms/hybrid.ts
+var W_BM25 = 0.7;
+var W_FUZZY = 0.3;
+var hybridAlgorithm = {
+  name: "hybrid",
+  description: "Weighted BM25(stem) + fuzzy n-gram. Default \u2014 best precision + recall.",
+  score(docs, query) {
+    const bm = bm25Algorithm.score(docs, query);
+    const fz = fuzzyAlgorithm.score(docs, query);
+    const maxBm = Math.max(...bm.map((r) => r.score), 1e-9);
+    const maxFz = Math.max(...fz.map((r) => r.score), 1e-9);
+    const bmMap = new Map(bm.map((r) => [r.ref, r.score / maxBm]));
+    const fzMap = new Map(fz.map((r) => [r.ref, r.score / maxFz]));
+    return docs.map((d) => ({
+      ref: d.ref,
+      score: W_BM25 * (bmMap.get(d.ref) ?? 0) + W_FUZZY * (fzMap.get(d.ref) ?? 0)
+    }));
+  }
+};
+
+// src/search/registry.ts
+var registry2 = /* @__PURE__ */ new Map();
+function registerSearchAlgorithm(algo) {
+  registry2.set(algo.name, algo);
+}
+function getSearchAlgorithm(name) {
+  return registry2.get(name);
+}
+function listSearchAlgorithms() {
+  return [...registry2.values()];
+}
+registerSearchAlgorithm(substringAlgorithm);
+registerSearchAlgorithm(bm25Algorithm);
+registerSearchAlgorithm(fuzzyAlgorithm);
+registerSearchAlgorithm(hybridAlgorithm);
+
+// src/search/types.ts
+var DEFAULT_ROLE_WEIGHTS = {
+  user: 1.5,
+  assistant: 1,
+  tool: 0.6,
+  block: 1
+};
+var DEFAULT_ALGORITHM = "hybrid";
+
+// src/search/index.ts
+function blockDocs(state) {
+  return state.blocks.map((b) => ({
+    kind: "block",
+    ref: b.blockId,
+    text: `${b.topic ?? ""} ${b.summary ?? ""}`,
+    title: b.topic ?? b.blockId,
+    blockId: b.blockId,
+    tier: b.tier ?? 1,
+    tokens: b.compressedTokens
+  }));
+}
+function messageDocs(msgs) {
+  return msgs.map((m) => ({
+    kind: "message",
+    ref: m.ref,
+    text: m.text,
+    title: `${m.role}: ${m.text.slice(0, 60)}`,
+    role: m.role,
+    blockId: m.blockId,
+    tier: m.tier,
+    tokens: m.tokens
+  }));
+}
+function applyRoleWeight(scored, docs, rw) {
+  if (docs.length === 0) return scored;
+  const docByRef = new Map(docs.map((d) => [d.ref, d]));
+  return scored.map((s) => {
+    const doc = docByRef.get(s.ref);
+    if (!doc) return s;
+    const w = doc.kind === "message" ? doc.role === "user" ? rw.user : doc.role === "assistant" ? rw.assistant : rw.tool : rw.block;
+    return { ref: s.ref, score: s.score * w };
+  });
+}
+function runSearch(docs, query, options) {
   const limit = options.limit ?? 10;
   const previewLength = options.previewLength ?? 200;
-  const minScore = options.minScore ?? 1;
-  const terms = query.toLowerCase().trim().split(/\s+/).filter((t) => t.length > 0);
-  if (terms.length === 0) return [];
-  const active = state.blocks.filter((b) => b.active);
-  const scored = [];
-  for (const block of active) {
-    const text = (block.summary || "").toLowerCase();
-    const topic = (block.topic || "").toLowerCase();
-    const haystack = topic + " " + text;
-    let score = 0;
-    for (const term of terms) {
-      score += countOccurrences2(haystack, term);
-    }
-    if (score >= minScore) {
-      scored.push({
-        blockId: block.blockId,
-        tier: block.tier ?? 1,
-        score,
-        topic: block.topic ?? "(no topic)",
-        preview: (block.summary || "").slice(0, previewLength),
-        block
-      });
-    }
+  const minScore = options.minScore ?? 0.01;
+  const algoName = options.algorithm ?? DEFAULT_ALGORITHM;
+  const rw = { ...DEFAULT_ROLE_WEIGHTS, ...options.roleWeights };
+  const algo = getSearchAlgorithm(algoName);
+  if (!algo) return [];
+  if (docs.length === 0) return [];
+  const scoredOrPromise = algo.score(docs, query);
+  const buildResults = (weighted) => {
+    const byRef = new Map(docs.map((d) => [d.ref, d]));
+    return weighted.map((s) => {
+      const doc = byRef.get(s.ref);
+      if (!doc) return null;
+      return {
+        kind: doc.kind,
+        ref: doc.ref,
+        blockId: doc.blockId,
+        tier: doc.tier ?? 1,
+        score: s.score,
+        title: doc.title,
+        preview: makePreview(doc.text, query, previewLength),
+        role: doc.role,
+        tokens: doc.tokens
+      };
+    }).filter((r) => r !== null && r.score >= minScore).sort((a, b) => b.score - a.score).slice(0, limit);
+  };
+  if (scoredOrPromise instanceof Promise) {
+    return scoredOrPromise.then((raw) => buildResults(applyRoleWeight(raw, docs, rw)));
   }
-  scored.sort((a, b) => b.score - a.score);
-  return scored.slice(0, limit);
+  return buildResults(applyRoleWeight(scoredOrPromise, docs, rw));
 }
-function countOccurrences2(haystack, needle) {
-  if (needle.length === 0) return 0;
-  return haystack.split(needle).length - 1;
+function searchBlocks(docs, query, options = {}) {
+  const result = runSearch(docs, query, options);
+  if (result instanceof Promise) {
+    throw new Error(
+      `searchBlocks: algorithm "${options.algorithm ?? DEFAULT_ALGORITHM}" is async (e.g. semantic). Use searchBlocksAsync() instead.`
+    );
+  }
+  return result;
+}
+async function searchBlocksAsync(docs, query, options = {}) {
+  return await runSearch(docs, query, options);
+}
+function makePreview(text, query, len) {
+  if (!text) return "";
+  const terms = query.toLowerCase().trim().split(/\s+/).filter((t) => t.length > 1);
+  if (terms.length === 0) return text.slice(0, len);
+  const lower = text.toLowerCase();
+  let hitIdx = -1;
+  for (const term of terms) {
+    const idx = lower.indexOf(term);
+    if (idx >= 0) {
+      hitIdx = idx;
+      break;
+    }
+  }
+  if (hitIdx < 0) return text.slice(0, len);
+  const half = Math.max(0, Math.floor(len / 2) - 10);
+  const start = Math.max(0, hitIdx - half);
+  const end = Math.min(text.length, start + len);
+  const prefix = start > 0 ? "\u2026" : "";
+  const suffix = end < text.length ? "\u2026" : "";
+  return prefix + text.slice(start, end).trim() + suffix;
 }
 export {
   BLOCKED_REF,
   COMPRESS_PHILOSOPHY,
+  DEFAULT_ALGORITHM,
+  DEFAULT_ROLE_WEIGHTS,
   HOW_TO_COMPRESS_RULES,
   SUMMARY_HEADER,
   TIER2_DISTILL_RULES,
@@ -2443,6 +2690,7 @@ export {
   applyMessageFilters,
   assignRefs,
   blockById,
+  blockDocs,
   buildRecap,
   buildRestoredContentPreview,
   buildStatusReport,
@@ -2461,14 +2709,17 @@ export {
   findBlocksOverlappingMessages,
   formatRanges,
   getMessageFilter,
+  getSearchAlgorithm,
   hideConsumedCompressCalls,
   highestActiveTier,
   highestUsedIndex,
   indexToRef,
   isMessageProtected,
   listMessageFilters,
+  listSearchAlgorithms,
   makeIO,
   matchToolPattern,
+  messageDocs,
   parseBlockIdArg,
   parseBoundary,
   prune,
@@ -2477,6 +2728,7 @@ export {
   refForRaw,
   refToIndex,
   registerMessageFilter,
+  registerSearchAlgorithm,
   renderNudgeText,
   renderRefsNode,
   renderVisibleRefs,
@@ -2484,6 +2736,7 @@ export {
   resolveKeepMarkers,
   runPipeline,
   searchBlocks,
+  searchBlocksAsync,
   syncBlocks,
   truncateLargeToolOutputs,
   validateConfig