acp-kernel 0.0.13 → 0.0.15

package/dist/protected.d.ts

@@ -16,9 +16,12 @@ export declare const ALWAYS_PROTECTED_TOOLS: readonly ["compress"];
  *  preserveRecent is about not compressing the active working set, not about
  *  which tool results are in scope).
  *
+ *  `search_context` returns large result lists (10 ranked hits with previews).
+ *  Same reasoning: excluding it from the protected zone keeps it compressible.
+ *
  *  Note: this only affects the recent-zone computation. Such messages remain
  *  fully visible and compressible like any ordinary message. */
-export declare const NEVER_PRESERVE_RECENT_TOOLS: readonly ["decompress"];
+export declare const NEVER_PRESERVE_RECENT_TOOLS: readonly ["decompress", "search_context"];
 /** True for tool-call / tool-result messages whose toolName is in the
  *  NEVER_PRESERVE_RECENT_TOOLS list — i.e. tool results (like decompress)
  *  that should be excluded from the soft-protected recent zone. */

package/dist/protected.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"protected.d.ts","sourceRoot":"","sources":["../src/protected.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;kFAIkF;AAClF,eAAO,MAAM,sBAAsB,uBAAwB,CAAC;AAE5D;;;;;;;;;;;;gEAYgE;AAChE,eAAO,MAAM,2BAA2B,yBAA0B,CAAC;AAEnE;;mEAEmE;AACnE,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAM/D;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAK3E;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,OAAO,CAsBT;AAED;;;8DAG8D;AAC9D,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,GAAG,CAAC,MAAM,CAAC,CAQb;AAED;iFACiF;AACjF,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,EAC1D,gBAAgB,EAAE,GAAG,CAAC,MAAM,CAAC,GAC5B,OAAO,CAUT"}
+{"version":3,"file":"protected.d.ts","sourceRoot":"","sources":["../src/protected.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;kFAIkF;AAClF,eAAO,MAAM,sBAAsB,uBAAwB,CAAC;AAE5D;;;;;;;;;;;;;;;gEAegE;AAChE,eAAO,MAAM,2BAA2B,2CAA4C,CAAC;AAErF;;mEAEmE;AACnE,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAM/D;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAK3E;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,OAAO,CAsBT;AAED;;;8DAG8D;AAC9D,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,GAAG,CAAC,MAAM,CAAC,CAQb;AAED;iFACiF;AACjF,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,EAC1D,gBAAgB,EAAE,GAAG,CAAC,MAAM,CAAC,GAC5B,OAAO,CAUT"}

package/dist/search/algorithms/bm25.d.ts

@@ -0,0 +1,15 @@
+import type { SearchAlgorithm } from "../types.js";
+/**
+ * BM25 with stemming + CJK bigram tokenization.
+ *
+ * k1=1.2, b=0.75 (standard IR). IDF down-weights terms common across the
+ * corpus; length normalization prevents long summaries from dominating by
+ * raw term count. Stemming collapses English morphology
+ * (compress/compressed/compression → ~compress).
+ *
+ * On a 30-block mixed EN/CJK benchmark: MRR 0.812 vs 0.821 for substring
+ * alone — not better in isolation, but a strong precision component when
+ * combined with fuzzy recall (see hybrid.ts).
+ */
+export declare const bm25Algorithm: SearchAlgorithm;
+//# sourceMappingURL=bm25.d.ts.map

package/dist/search/algorithms/bm25.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bm25.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/bm25.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAG3E;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,aAAa,EAAE,eAqC3B,CAAC"}

package/dist/search/algorithms/fuzzy.d.ts

@@ -0,0 +1,14 @@
+import type { SearchAlgorithm } from "../types.js";
+/**
+ * Fuzzy character-bigram matching (Jaccard-style).
+ *
+ * Decomposes the query into character bigrams and measures overlap with
+ * each doc. Robust to typos (tokan≈token), partial words, and works
+ * uniformly across all scripts (CJK benefits most). Only considers query
+ * tokens of length >= 4 to avoid noise from short common-character pairs.
+ *
+ * On benchmark: highest recall@3 (0.913) of any single algorithm — it is
+ * the recall boost in the hybrid default.
+ */
+export declare const fuzzyAlgorithm: SearchAlgorithm;
+//# sourceMappingURL=fuzzy.d.ts.map

package/dist/search/algorithms/fuzzy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fuzzy.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/fuzzy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAG3E;;;;;;;;;;GAUG;AACH,eAAO,MAAM,cAAc,EAAE,eAmB5B,CAAC"}

package/dist/search/algorithms/hybrid.d.ts

@@ -0,0 +1,3 @@
+import type { SearchAlgorithm } from "../types.js";
+export declare const hybridAlgorithm: SearchAlgorithm;
+//# sourceMappingURL=hybrid.d.ts.map

package/dist/search/algorithms/hybrid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/hybrid.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAwB3E,eAAO,MAAM,eAAe,EAAE,eAe7B,CAAC"}

package/dist/search/algorithms/semantic.d.ts

@@ -0,0 +1,37 @@
+/**
+ * OPTIONAL semantic search algorithm (embedding-based).
+ *
+ * NOT registered by default — acp-kernel stays zero-runtime-deps. This is a
+ * reference implementation showing how a host plugs in a heavyweight
+ * semantic retriever. It catches the queries lexical algorithms cannot:
+ * synonyms (login↔登录), cross-language (cache↔缓存), and paraphrase.
+ *
+ * score() returns a Promise, so use it via searchBlocksAsync():
+ *
+ *   import { registerSearchAlgorithm, searchBlocksAsync } from "acp-kernel";
+ *   import { createSemanticAlgorithm } from "acp-kernel/search/algorithms/semantic";
+ *
+ *   registerSearchAlgorithm(createSemanticAlgorithm({
+ *     embed: async (texts) => embeddingApi.embed(texts),  // → number[][]
+ *   }));
+ *
+ *   const results = await searchBlocksAsync(state, "credentials", { algorithm: "semantic" });
+ *
+ * The `embed` function is host-supplied — pick any backend:
+ *   - @huggingface/transformers (local, ~25MB model, offline, ~25ms/query)
+ *   - OpenAI / Voyage / Cohere embeddings API (remote, needs key)
+ *   - a local inference server
+ *
+ * Embeddings are memoized by content hash: docs only re-embed when their
+ * summary changes. The query embeds fresh each call.
+ */
+import type { AsyncSearchAlgorithm } from "../types.js";
+export interface EmbedFn {
+    (texts: string[]): Promise<number[][]>;
+}
+export interface SemanticOptions {
+    embed: EmbedFn;
+    name?: string;
+}
+export declare function createSemanticAlgorithm(opts: SemanticOptions): AsyncSearchAlgorithm;
+//# sourceMappingURL=semantic.d.ts.map

package/dist/search/algorithms/semantic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/semantic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAA0B,MAAM,aAAa,CAAC;AAEhF,MAAM,WAAW,OAAO;IACpB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;CAC1C;AAED,MAAM,WAAW,eAAe;IAC5B,KAAK,EAAE,OAAO,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AA6BD,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,eAAe,GAAG,oBAAoB,CAuCnF"}

package/dist/search/algorithms/substring.d.ts

@@ -0,0 +1,9 @@
+import type { SearchAlgorithm } from "../types.js";
+/**
+ * Substring counting — the original baseline algorithm.
+ * Exact, lowercased substring occurrence counts. Predictable but blind to
+ * morphology, typos, and CJK word boundaries. Kept for backward compat and
+ * as a deterministic reference.
+ */
+export declare const substringAlgorithm: SearchAlgorithm;
+//# sourceMappingURL=substring.d.ts.map

package/dist/search/algorithms/substring.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"substring.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/substring.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAE3E;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,eAahC,CAAC"}

package/dist/search/index.d.ts

@@ -0,0 +1,31 @@
+/**
+ * searchBlocks — public search entry point.
+ *
+ * Scores a unified document set (block summaries + historical messages)
+ * and returns ranked results. The model uses search to cheaply locate
+ * detail that compression folded into summaries, then decompresses the
+ * owning block for the full content.
+ *
+ * Two entry points:
+ *  - searchBlocks()      — sync. Works for all lexical algorithms.
+ *  - searchBlocksAsync() — async. Also supports embedding-based semantic
+ *                          algorithms whose score() returns a Promise.
+ */
+import type { CompressionState } from "../types.js";
+import type { SearchDoc, MessageInput } from "./types.js";
+import type { SearchResult, SearchOptions } from "./types.js";
+/** Build SearchDoc[] from all blocks (active AND inactive) of the state. */
+export declare function blockDocs(state: CompressionState): SearchDoc[];
+/**
+ * Build SearchDoc[] from historical messages supplied by the host. The host
+ * (pai-acp) reads these from the append-only session log — they include the
+ * original text of messages that compression later folded into block summaries.
+ *
+ * `ownerOf(ref)` maps a message ref to the block id that compressed it, so a
+ * message hit tells the model exactly which block to decompress for detail.
+ */
+export declare function messageDocs(msgs: MessageInput[]): SearchDoc[];
+/** Sync entry — throws for async algorithms. Pass docs from blockDocs() + messageDocs(). */
+export declare function searchBlocks(docs: SearchDoc[], query: string, options?: SearchOptions): SearchResult[];
+export declare function searchBlocksAsync(docs: SearchDoc[], query: string, options?: SearchOptions): Promise<SearchResult[]>;
+//# sourceMappingURL=index.d.ts.map

package/dist/search/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAoB,MAAM,aAAa,CAAC;AAEtE,OAAO,KAAK,EAAE,SAAS,EAAe,YAAY,EAAE,MAAM,YAAY,CAAC;AACvE,OAAO,KAAK,EAAE,YAAY,EAAE,aAAa,EAAe,MAAM,YAAY,CAAC;AAG3E,4EAA4E;AAC5E,wBAAgB,SAAS,CAAC,KAAK,EAAE,gBAAgB,GAAG,SAAS,EAAE,CAU9D;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,SAAS,EAAE,CAW7D;AAkED,4FAA4F;AAC5F,wBAAgB,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,YAAY,EAAE,CAQ1G;AAED,wBAAsB,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAE9H"}

package/dist/search/registry.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Algorithm registry. Builtins are pre-registered; hosts may register
+ * additional algorithms (e.g. an embedding-based semantic provider) via
+ * registerSearchAlgorithm and reference them by name in SearchOptions.
+ */
+import type { AnySearchAlgorithm } from "./types.js";
+export declare function registerSearchAlgorithm(algo: AnySearchAlgorithm): void;
+export declare function getSearchAlgorithm(name: string): AnySearchAlgorithm | undefined;
+export declare function listSearchAlgorithms(): AnySearchAlgorithm[];
+//# sourceMappingURL=registry.d.ts.map

package/dist/search/registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/search/registry.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAQrD,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,kBAAkB,GAAG,IAAI,CAEtE;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,kBAAkB,GAAG,SAAS,CAE/E;AAED,wBAAgB,oBAAoB,IAAI,kBAAkB,EAAE,CAE3D"}

package/dist/search/stemmer.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Lightweight English stemmer (suffix stripping, Porter-inspired).
+ * Zero dependencies. Good enough for IR morphology normalization:
+ *   tokens → token, running → runn, compressed → compress,
+ *   authentication → authentic, handling → handl, subagents → subagent
+ *
+ * Not a full Porter stemmer — intentionally simpler and faster. CJK is
+ * untouched (handled by bigram tokenization, not stemming).
+ */
+export declare function stem(word: string): string;
+//# sourceMappingURL=stemmer.d.ts.map

package/dist/search/stemmer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stemmer.d.ts","sourceRoot":"","sources":["../../src/search/stemmer.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAgBzC"}

package/dist/search/tokenizer.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Search tokenizer.
+ *
+ * Handles mixed Latin + CJK content — the single biggest quality lever
+ * over plain substring search. Latin is split on non-word boundaries;
+ * CJK (no spaces) is decomposed into overlapping bigrams so a query like
+ * "身份验证" still scores against doc text "身份验证流程".
+ */
+export interface TokenizeOptions {
+    stem?: boolean;
+}
+export declare function tokenize(text: string, opts?: TokenizeOptions): string[];
+/** Character bigrams over arbitrary text — used by fuzzy matching. */
+export declare function charBigrams(text: string): string[];
+/** Term-frequency map. */
+export declare function tfMap(text: string, stem: boolean): Map<string, number>;
+//# sourceMappingURL=tokenizer.d.ts.map

package/dist/search/tokenizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenizer.d.ts","sourceRoot":"","sources":["../../src/search/tokenizer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAQH,MAAM,WAAW,eAAe;IAC5B,IAAI,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,MAAM,EAAE,CAuB3E;AAED,sEAAsE;AACtE,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAOlD;AAED,0BAA0B;AAC1B,wBAAgB,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAItE"}

package/dist/search/types.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Search type definitions.
+ *
+ * Two data sources are searchable:
+ *  - Compressed blocks (summary text; ref = "b{id}")
+ *  - Historical messages (original text from the append-only session log;
+ *    ref = "m{NNNNN}"). These let the model locate detail that compression
+ *    turned into a short summary — search to pinpoint, then decompress the
+ *    owning block for the full content.
+ *
+ * A SearchAlgorithm is a stateless scorer over a unified SearchDoc[]. Roles
+ * carry a configurable weight (user intent > assistant reasoning > tool noise).
+ */
+/** Where a searchable document came from. */
+export type SearchDocKind = "block" | "message";
+export type MessageRole = "user" | "assistant" | "tool";
+/** A unified searchable document — either a block summary or a message. */
+export interface SearchDoc {
+    kind: SearchDocKind;
+    /** Stable ref for decompress: "b3" for a block, "m00350" for a message. */
+    ref: string;
+    /** Text this doc is scored against (topic+summary for blocks; content for messages). */
+    text: string;
+    /** For preview/title display. */
+    title: string;
+    /** Message role (messages only); undefined for blocks. Drives role weighting. */
+    role?: MessageRole;
+    /** Block owning this doc. For blocks: the block itself. For messages: the block
+     *  that compressed it (so the model knows which block to decompress for detail). */
+    blockId?: string;
+    /** Tier of the owning block (display + grouping). */
+    tier?: number;
+    /** Approx token size (for "how big is this" display). */
+    tokens?: number;
+}
+/** Per-role score multipliers. Defaults favor user intent over tool noise. */
+export interface RoleWeights {
+    user?: number;
+    assistant?: number;
+    tool?: number;
+    block?: number;
+}
+export declare const DEFAULT_ROLE_WEIGHTS: Required<RoleWeights>;
+export interface ScoredBlock {
+    ref: string;
+    score: number;
+}
+export interface SearchAlgorithm {
+    name: string;
+    description: string;
+    score(docs: SearchDoc[], query: string): ScoredBlock[];
+}
+export interface AsyncSearchAlgorithm {
+    name: string;
+    description: string;
+    score(docs: SearchDoc[], query: string): Promise<ScoredBlock[]>;
+}
+export type AnySearchAlgorithm = SearchAlgorithm | AsyncSearchAlgorithm;
+export interface SearchResult {
+    /** "block" or "message". */
+    kind: SearchDocKind;
+    /** Ref to pass to decompress: "b3" or "m00350". */
+    ref: string;
+    /** Owning block id (for messages: the block that compressed it). */
+    blockId?: string;
+    tier: number;
+    score: number;
+    title: string;
+    preview: string;
+    role?: MessageRole;
+    tokens?: number;
+}
+export interface SearchOptions {
+    algorithm?: string;
+    limit?: number;
+    previewLength?: number;
+    minScore?: number;
+    /** Per-role weights (default DEFAULT_ROLE_WEIGHTS). */
+    roleWeights?: RoleWeights;
+}
+/** Host-supplied historical message, turned into a message SearchDoc. */
+export interface MessageInput {
+    ref: string;
+    role: MessageRole;
+    text: string;
+    tokens?: number;
+    /** Block id that compressed this message (undefined if still visible). */
+    blockId?: string;
+    tier?: number;
+}
+export declare const DEFAULT_ALGORITHM = "hybrid";
+//# sourceMappingURL=types.d.ts.map

package/dist/search/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/search/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,6CAA6C;AAC7C,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,SAAS,CAAC;AAEhD,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;AAExD,2EAA2E;AAC3E,MAAM,WAAW,SAAS;IACtB,IAAI,EAAE,aAAa,CAAC;IACpB,2EAA2E;IAC3E,GAAG,EAAE,MAAM,CAAC;IACZ,wFAAwF;IACxF,IAAI,EAAE,MAAM,CAAC;IACb,iCAAiC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,iFAAiF;IACjF,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;wFACoF;IACpF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qDAAqD;IACrD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,yDAAyD;IACzD,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,8EAA8E;AAC9E,MAAM,WAAW,WAAW;IACxB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,eAAO,MAAM,oBAAoB,EAAE,QAAQ,CAAC,WAAW,CAKtD,CAAC;AAEF,MAAM,WAAW,WAAW;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,EAAE,CAAC;CAC1D;AAED,MAAM,WAAW,oBAAoB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;CACnE;AAED,MAAM,MAAM,kBAAkB,GAAG,eAAe,GAAG,oBAAoB,CAAC;AAExE,MAAM,WAAW,YAAY;IACzB,4BAA4B;IAC5B,IAAI,EAAE,aAAa,CAAC;IACpB,mDAAmD;IACnD,GAAG,EAAE,MAAM,CAAC;IACZ,oEAAoE;IACpE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uDAAuD;IACvD,WAAW,CAAC,EAAE,WAAW,CAAC;CAC7B;AAED,yEAAyE;AACzE,MAAM,WAAW,YAAY;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,0EAA0E;IAC1E,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,eAAO,MAAM,iBAAiB,WAAW,CAAC"}

package/dist/search.d.ts

@@ -1,27 +1,8 @@
 /**
- * Block search — find compressed (invisible) content by keyword.
- *
- * This is the core value of ACP: as conversations grow, most history becomes
- * invisible (compressed into summary blocks). Search is the only way to
- * retrieve specific information from that invisible content.
- *
- * Current implementation: substring counting (simple but effective for
- * dozens of blocks). Future: TF-IDF, fuzzy matching, CJK tokenization,
- * semantic search.
+ * Search — re-exports from the modular src/search/ implementation.
  */
-import type { CompressionState, CompressionBlock } from "./types.js";
-export interface SearchResult {
-    blockId: string;
-    tier: number;
-    score: number;
-    topic: string;
-    preview: string;
-    block: CompressionBlock;
-}
-export interface SearchOptions {
-    limit?: number;
-    previewLength?: number;
-    minScore?: number;
-}
-export declare function searchBlocks(state: CompressionState, query: string, options?: SearchOptions): SearchResult[];
+export { searchBlocks, searchBlocksAsync, blockDocs, messageDocs } from "./search/index.js";
+export type { SearchResult, SearchOptions, SearchAlgorithm, AsyncSearchAlgorithm, AnySearchAlgorithm, SearchDoc, SearchDocKind, ScoredBlock, MessageRole, RoleWeights, MessageInput, } from "./search/types.js";
+export { DEFAULT_ALGORITHM, DEFAULT_ROLE_WEIGHTS } from "./search/types.js";
+export { registerSearchAlgorithm, getSearchAlgorithm, listSearchAlgorithms } from "./search/registry.js";
 //# sourceMappingURL=search.d.ts.map

package/dist/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAErE,MAAM,WAAW,YAAY;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,gBAAgB,CAAC;CAC3B;AAED,MAAM,WAAW,aAAa;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,YAAY,CACxB,KAAK,EAAE,gBAAgB,EACvB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC5B,YAAY,EAAE,CAwChB"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC5F,YAAY,EACR,YAAY,EACZ,aAAa,EACb,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,SAAS,EACT,aAAa,EACb,WAAW,EACX,WAAW,EACX,WAAW,EACX,YAAY,GACf,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAC5E,OAAO,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "acp-kernel",
-    "version": "0.0.13",
+    "version": "0.0.15",
     "description": "Framework-agnostic context-compression engine (model-driven, 3-tier LSM). Pure core: no host dependency.",
     "license": "MIT",
     "author": "ranxianglei",

package/dist/keep-markers.d.ts

@@ -1,9 +0,0 @@
-import type { CompressionState, CoreMessage } from "./types.js";
-export interface KeepMarkerResult {
-    summary: string;
-    expandedCount: number;
-    refCount: number;
-    unresolvedRefs: string[];
-}
-export declare function resolveKeepMarkers(summary: string, messages: CoreMessage[], state: CompressionState, maxChars?: number): KeepMarkerResult;
-//# sourceMappingURL=keep-markers.d.ts.map

package/dist/keep-markers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"keep-markers.d.ts","sourceRoot":"","sources":["../src/keep-markers.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAKhE,MAAM,WAAW,gBAAgB;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,wBAAgB,kBAAkB,CAC9B,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,WAAW,EAAE,EACvB,KAAK,EAAE,gBAAgB,EACvB,QAAQ,SAAO,GAChB,gBAAgB,CAkClB"}