@fingerskier/augment 0.4.0 → 0.5.1

package/dist/db.js

@@ -31,51 +31,51 @@ export class AugmentDatabase {
         await this.execute(`PRAGMA busy_timeout = 5000`);
         await this.execute(`PRAGMA foreign_keys = ON`);
         await this.batch([
-            `CREATE TABLE IF NOT EXISTS projects (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        name TEXT NOT NULL UNIQUE,
-        org TEXT NOT NULL,
-        repo TEXT NOT NULL,
-        source TEXT NOT NULL,
-        created_at TEXT NOT NULL,
-        updated_at TEXT NOT NULL
+            `CREATE TABLE IF NOT EXISTS projects (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        name TEXT NOT NULL UNIQUE,
+        org TEXT NOT NULL,
+        repo TEXT NOT NULL,
+        source TEXT NOT NULL,
+        created_at TEXT NOT NULL,
+        updated_at TEXT NOT NULL
       )`,
-            `CREATE TABLE IF NOT EXISTS memories (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        project_id INTEGER NOT NULL REFERENCES projects(id) ON DELETE CASCADE,
-        kind TEXT NOT NULL,
-        name TEXT NOT NULL,
-        relative_path TEXT NOT NULL UNIQUE,
-        content_hash TEXT NOT NULL,
-        frontmatter_hash TEXT NOT NULL,
-        size INTEGER NOT NULL,
-        density REAL NOT NULL,
-        mtime REAL NOT NULL,
-        tags_json TEXT NOT NULL,
-        links_json TEXT NOT NULL,
-        body TEXT NOT NULL,
-        created_at TEXT NOT NULL,
-        updated_at TEXT NOT NULL,
-        archived INTEGER NOT NULL DEFAULT 0,
-        consolidated_into TEXT,
-        derived_from_json TEXT
+            `CREATE TABLE IF NOT EXISTS memories (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        project_id INTEGER NOT NULL REFERENCES projects(id) ON DELETE CASCADE,
+        kind TEXT NOT NULL,
+        name TEXT NOT NULL,
+        relative_path TEXT NOT NULL UNIQUE,
+        content_hash TEXT NOT NULL,
+        frontmatter_hash TEXT NOT NULL,
+        size INTEGER NOT NULL,
+        density REAL NOT NULL,
+        mtime REAL NOT NULL,
+        tags_json TEXT NOT NULL,
+        links_json TEXT NOT NULL,
+        body TEXT NOT NULL,
+        created_at TEXT NOT NULL,
+        updated_at TEXT NOT NULL,
+        archived INTEGER NOT NULL DEFAULT 0,
+        consolidated_into TEXT,
+        derived_from_json TEXT
       )`,
-            `CREATE TABLE IF NOT EXISTS memory_embeddings (
-        memory_id INTEGER PRIMARY KEY REFERENCES memories(id) ON DELETE CASCADE,
-        model_id TEXT NOT NULL,
-        model_version TEXT NOT NULL,
-        dimensions INTEGER NOT NULL,
-        vector_json TEXT NOT NULL,
-        embedded_hash TEXT NOT NULL,
-        embedded_at TEXT NOT NULL
+            `CREATE TABLE IF NOT EXISTS memory_embeddings (
+        memory_id INTEGER PRIMARY KEY REFERENCES memories(id) ON DELETE CASCADE,
+        model_id TEXT NOT NULL,
+        model_version TEXT NOT NULL,
+        dimensions INTEGER NOT NULL,
+        vector_json TEXT NOT NULL,
+        embedded_hash TEXT NOT NULL,
+        embedded_at TEXT NOT NULL
       )`,
-            `CREATE TABLE IF NOT EXISTS links (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        from_memory_id INTEGER NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
-        to_memory_id INTEGER NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
-        type TEXT NOT NULL,
-        created_at TEXT NOT NULL,
-        UNIQUE(from_memory_id, to_memory_id, type)
+            `CREATE TABLE IF NOT EXISTS links (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        from_memory_id INTEGER NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
+        to_memory_id INTEGER NOT NULL REFERENCES memories(id) ON DELETE CASCADE,
+        type TEXT NOT NULL,
+        created_at TEXT NOT NULL,
+        UNIQUE(from_memory_id, to_memory_id, type)
       )`,
             `CREATE INDEX IF NOT EXISTS idx_memories_project_id ON memories(project_id)`,
             `CREATE INDEX IF NOT EXISTS idx_memories_kind ON memories(kind)`,
@@ -118,12 +118,12 @@ export class AugmentDatabase {
     async upsertProject(name, source = "git") {
         const parts = projectParts(name);
         const now = new Date().toISOString();
-        await this.execute(`INSERT INTO projects (name, org, repo, source, created_at, updated_at)
-       VALUES (?, ?, ?, ?, ?, ?)
-       ON CONFLICT(name) DO UPDATE SET
-         org = excluded.org,
-         repo = excluded.repo,
-         source = excluded.source,
+        await this.execute(`INSERT INTO projects (name, org, repo, source, created_at, updated_at)
+       VALUES (?, ?, ?, ?, ?, ?)
+       ON CONFLICT(name) DO UPDATE SET
+         org = excluded.org,
+         repo = excluded.repo,
+         source = excluded.source,
          updated_at = excluded.updated_at`, [name, parts.org, parts.repo, source, now, now]);
         const project = await this.getProjectByName(name);
         if (!project) {
@@ -148,27 +148,27 @@ export class AugmentDatabase {
     async upsertMemory(memory) {
         const project = await this.upsertProject(memory.frontmatter.project);
         const now = new Date().toISOString();
-        await this.execute(`INSERT INTO memories (
-        project_id, kind, name, relative_path, content_hash, frontmatter_hash,
-        size, density, mtime, tags_json, links_json, body, created_at, updated_at,
-        archived, consolidated_into, derived_from_json
-      )
-       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
-       ON CONFLICT(relative_path) DO UPDATE SET
-        project_id = excluded.project_id,
-        kind = excluded.kind,
-        name = excluded.name,
-        content_hash = excluded.content_hash,
-        frontmatter_hash = excluded.frontmatter_hash,
-        size = excluded.size,
-        density = excluded.density,
-        mtime = excluded.mtime,
-        tags_json = excluded.tags_json,
-        links_json = excluded.links_json,
-        body = excluded.body,
-        updated_at = excluded.updated_at,
-        archived = excluded.archived,
-        consolidated_into = excluded.consolidated_into,
+        await this.execute(`INSERT INTO memories (
+        project_id, kind, name, relative_path, content_hash, frontmatter_hash,
+        size, density, mtime, tags_json, links_json, body, created_at, updated_at,
+        archived, consolidated_into, derived_from_json
+      )
+       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+       ON CONFLICT(relative_path) DO UPDATE SET
+        project_id = excluded.project_id,
+        kind = excluded.kind,
+        name = excluded.name,
+        content_hash = excluded.content_hash,
+        frontmatter_hash = excluded.frontmatter_hash,
+        size = excluded.size,
+        density = excluded.density,
+        mtime = excluded.mtime,
+        tags_json = excluded.tags_json,
+        links_json = excluded.links_json,
+        body = excluded.body,
+        updated_at = excluded.updated_at,
+        archived = excluded.archived,
+        consolidated_into = excluded.consolidated_into,
         derived_from_json = excluded.derived_from_json`, [
             project.id,
             memory.frontmatter.kind,
@@ -230,7 +230,7 @@ export class AugmentDatabase {
                     continue;
                 }
                 statements.push({
-                    sql: `INSERT OR IGNORE INTO links (from_memory_id, to_memory_id, type, created_at)
+                    sql: `INSERT OR IGNORE INTO links (from_memory_id, to_memory_id, type, created_at)
            VALUES (?, ?, ?, ?)`,
                     args: [memory.id, target.id, link.type, now],
                 });
@@ -257,36 +257,36 @@ export class AugmentDatabase {
         return result.rows.map((row) => memoryFromRow(row));
     }
     async listLinks(memoryId) {
-        const result = await this.execute(`SELECT
-        links.*,
-        from_memory.relative_path AS from_relative_path,
-        to_memory.relative_path AS to_relative_path
-       FROM links
-       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
-       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
-       WHERE links.from_memory_id = ? OR links.to_memory_id = ?
+        const result = await this.execute(`SELECT
+        links.*,
+        from_memory.relative_path AS from_relative_path,
+        to_memory.relative_path AS to_relative_path
+       FROM links
+       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
+       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
+       WHERE links.from_memory_id = ? OR links.to_memory_id = ?
        ORDER BY links.id`, [memoryId, memoryId]);
         return result.rows.map((row) => linkFromRow(row));
     }
     async getLinkById(id) {
-        const result = await this.execute(`SELECT
-        links.*,
-        from_memory.relative_path AS from_relative_path,
-        to_memory.relative_path AS to_relative_path
-       FROM links
-       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
-       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
+        const result = await this.execute(`SELECT
+        links.*,
+        from_memory.relative_path AS from_relative_path,
+        to_memory.relative_path AS to_relative_path
+       FROM links
+       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
+       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
        WHERE links.id = ?`, [id]);
         return result.rows[0] ? linkFromRow(result.rows[0]) : undefined;
     }
     async getAllLinks() {
-        const result = await this.execute(`SELECT
-        links.*,
-        from_memory.relative_path AS from_relative_path,
-        to_memory.relative_path AS to_relative_path
-       FROM links
-       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
-       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
+        const result = await this.execute(`SELECT
+        links.*,
+        from_memory.relative_path AS from_relative_path,
+        to_memory.relative_path AS to_relative_path
+       FROM links
+       JOIN memories AS from_memory ON from_memory.id = links.from_memory_id
+       JOIN memories AS to_memory ON to_memory.id = links.to_memory_id
        ORDER BY links.id`);
         return result.rows.map((row) => linkFromRow(row));
     }
@@ -312,16 +312,16 @@ export class AugmentDatabase {
         if (!record) {
             throw new Error(`Cannot store embedding for missing memory`);
         }
-        await this.execute(`INSERT INTO memory_embeddings (
-        memory_id, model_id, model_version, dimensions, vector_json, embedded_hash, embedded_at
-      )
-       VALUES (?, ?, ?, ?, ?, ?, ?)
-       ON CONFLICT(memory_id) DO UPDATE SET
-        model_id = excluded.model_id,
-        model_version = excluded.model_version,
-        dimensions = excluded.dimensions,
-        vector_json = excluded.vector_json,
-        embedded_hash = excluded.embedded_hash,
+        await this.execute(`INSERT INTO memory_embeddings (
+        memory_id, model_id, model_version, dimensions, vector_json, embedded_hash, embedded_at
+      )
+       VALUES (?, ?, ?, ?, ?, ?, ?)
+       ON CONFLICT(memory_id) DO UPDATE SET
+        model_id = excluded.model_id,
+        model_version = excluded.model_version,
+        dimensions = excluded.dimensions,
+        vector_json = excluded.vector_json,
+        embedded_hash = excluded.embedded_hash,
         embedded_at = excluded.embedded_at`, [
             record.id,
             provider.modelId,
@@ -405,11 +405,11 @@ export class AugmentDatabase {
     }
 }
 function memorySelectSql(suffix) {
-    return `SELECT
-    memories.*,
-    projects.name AS project_name
-   FROM memories
-   JOIN projects ON projects.id = memories.project_id
+    return `SELECT
+    memories.*,
+    projects.name AS project_name
+   FROM memories
+   JOIN projects ON projects.id = memories.project_id
    ${suffix}`;
 }
 function projectFromRow(row) {

package/dist/decoction.d.ts

@@ -0,0 +1,51 @@
+import type { MemoryKind } from "./constants.js";
+import type { MemoryRecord } from "./types.js";
+export declare const DECOCTION_DEFAULT_MIN_COSINE = 0.75;
+export declare const DECOCTION_MIN_PROJECTS = 4;
+export declare const DECOCTION_DEFAULT_SNIPPET_CHARS = 280;
+/** The corpus fields needed by read-only decoction discovery. */
+export type DecoctionDiscoveryMemory = Pick<MemoryRecord, "id" | "project_name" | "kind" | "relative_path" | "content_hash" | "frontmatter_hash" | "tags" | "body" | "archived">;
+/** Matches the memories + embeddings portion of AugmentService's corpus snapshot. */
+export interface DecoctionDiscoveryInput {
+    memories: readonly DecoctionDiscoveryMemory[];
+    embeddings: ReadonlyMap<number, number[]>;
+    /** Raw cosine floor used for every pair in a cluster. */
+    minCosine?: number;
+    /** Maximum normalized body characters returned per source. */
+    snippetChars?: number;
+}
+export interface DecoctionDiscoverySource {
+    id: number;
+    /** Durable identity; numeric ids can churn during an index rebuild. */
+    relative_path: string;
+    project_name: string;
+    kind: MemoryKind;
+    content_hash: string;
+    frontmatter_hash: string;
+    snippet: string;
+}
+export interface DecoctionDiscoveryCluster {
+    sources: DecoctionDiscoverySource[];
+    distinct_projects: number;
+    project_names: string[];
+    /** Lowest raw cosine among every pair of sources in this complete-link cluster. */
+    min_pairwise_cosine: number;
+}
+export interface DecoctionDiscoveryOutput {
+    /** Policy-eligible memories, including any that currently lack an embedding. */
+    eligible: number;
+    /** Eligible memories that have an embedding and therefore entered clustering. */
+    embedded: number;
+    min_cosine: number;
+    min_projects: typeof DECOCTION_MIN_PROJECTS;
+    clusters: DecoctionDiscoveryCluster[];
+}
+/**
+ * Find cross-project evidence groups without mutating the corpus.
+ *
+ * This is agglomerative complete-link clustering: two groups can merge only
+ * when every cross-group source pair meets the raw cosine floor. In contrast
+ * to connected components, a chain of individually similar neighbors cannot
+ * pull dissimilar endpoints into the same generic-memory candidate.
+ */
+export declare function discoverDecoctionCandidates(input: DecoctionDiscoveryInput): DecoctionDiscoveryOutput;

package/dist/decoction.js

@@ -0,0 +1,184 @@
+import { cosineSimilarity } from "./util/text.js";
+export const DECOCTION_DEFAULT_MIN_COSINE = 0.75;
+export const DECOCTION_MIN_PROJECTS = 4;
+export const DECOCTION_DEFAULT_SNIPPET_CHARS = 280;
+const EVIDENCE_KINDS = new Set(["WORK", "ISSUE", "SPEC", "ARCH"]);
+const EXCLUDED_TAGS = new Set(["private", "no-generalize"]);
+/**
+ * Find cross-project evidence groups without mutating the corpus.
+ *
+ * This is agglomerative complete-link clustering: two groups can merge only
+ * when every cross-group source pair meets the raw cosine floor. In contrast
+ * to connected components, a chain of individually similar neighbors cannot
+ * pull dissimilar endpoints into the same generic-memory candidate.
+ */
+export function discoverDecoctionCandidates(input) {
+    const minCosine = input.minCosine ?? DECOCTION_DEFAULT_MIN_COSINE;
+    const snippetChars = input.snippetChars ?? DECOCTION_DEFAULT_SNIPPET_CHARS;
+    validateOptions(minCosine, snippetChars);
+    const eligible = input.memories.filter(isEligibleEvidence).sort(compareMemories);
+    const candidates = eligible.filter((memory) => input.embeddings.has(memory.id));
+    const similarities = similarityMatrix(candidates, input.embeddings);
+    const working = completeLinkClusters(candidates, similarities, minCosine);
+    const clusters = working
+        .map((cluster) => toDiscoveryCluster(cluster, candidates, similarities, snippetChars))
+        .filter((cluster) => cluster.distinct_projects >= DECOCTION_MIN_PROJECTS)
+        .sort(compareDiscoveryClusters);
+    return {
+        eligible: eligible.length,
+        embedded: candidates.length,
+        min_cosine: minCosine,
+        min_projects: DECOCTION_MIN_PROJECTS,
+        clusters,
+    };
+}
+function isEligibleEvidence(memory) {
+    if (!EVIDENCE_KINDS.has(memory.kind) || memory.archived || isGeneric(memory)) {
+        return false;
+    }
+    return !memory.tags.some((tag) => EXCLUDED_TAGS.has(tag.trim().toLowerCase()));
+}
+function isGeneric(memory) {
+    if (memory.project_name === ".generic") {
+        return true;
+    }
+    const normalizedPath = memory.relative_path.replaceAll("\\", "/").replace(/^\.\//, "");
+    return normalizedPath.startsWith(".generic/");
+}
+function similarityMatrix(candidates, embeddings) {
+    const matrix = candidates.map(() => new Array(candidates.length).fill(1));
+    for (let left = 0; left < candidates.length; left += 1) {
+        const leftVector = embeddings.get(candidates[left].id);
+        for (let right = left + 1; right < candidates.length; right += 1) {
+            const rightVector = embeddings.get(candidates[right].id);
+            const similarity = leftVector && rightVector ? boundedCosine(leftVector, rightVector) : 0;
+            matrix[left][right] = similarity;
+            matrix[right][left] = similarity;
+        }
+    }
+    return matrix;
+}
+function completeLinkClusters(candidates, similarities, minCosine) {
+    let clusters = candidates.map((memory, index) => ({
+        members: [index],
+        key: memoryKey(memory),
+    }));
+    for (;;) {
+        let best;
+        for (let left = 0; left < clusters.length; left += 1) {
+            for (let right = left + 1; right < clusters.length; right += 1) {
+                const similarity = completeLinkSimilarity(clusters[left], clusters[right], similarities, minCosine);
+                if (similarity < minCosine) {
+                    continue;
+                }
+                const key = mergeKey(clusters[left], clusters[right]);
+                if (!best ||
+                    similarity > best.similarity ||
+                    (similarity === best.similarity && compareText(key, best.key) < 0)) {
+                    best = { left, right, similarity, key };
+                }
+            }
+        }
+        if (!best) {
+            return clusters;
+        }
+        const members = [...clusters[best.left].members, ...clusters[best.right].members].sort((a, b) => a - b);
+        const merged = { members, key: best.key };
+        clusters = clusters
+            .filter((_, index) => index !== best.left && index !== best.right)
+            .concat(merged)
+            .sort((a, b) => compareText(a.key, b.key));
+    }
+}
+function completeLinkSimilarity(left, right, similarities, floor) {
+    let minimum = 1;
+    for (const leftIndex of left.members) {
+        for (const rightIndex of right.members) {
+            minimum = Math.min(minimum, similarities[leftIndex][rightIndex]);
+            // This pair can never merge. Avoid scanning the remaining cross pairs.
+            if (minimum < floor) {
+                return minimum;
+            }
+        }
+    }
+    return minimum;
+}
+function toDiscoveryCluster(cluster, candidates, similarities, snippetChars) {
+    const members = cluster.members.map((index) => candidates[index]);
+    const projectNames = [...new Set(members.map((memory) => memory.project_name))].sort(compareText);
+    const sources = members
+        .map((memory) => ({
+        id: memory.id,
+        relative_path: memory.relative_path,
+        project_name: memory.project_name,
+        kind: memory.kind,
+        content_hash: memory.content_hash,
+        frontmatter_hash: memory.frontmatter_hash,
+        snippet: snippet(memory.body, snippetChars),
+    }))
+        .sort((a, b) => compareText(a.relative_path, b.relative_path) || a.id - b.id);
+    return {
+        sources,
+        distinct_projects: projectNames.length,
+        project_names: projectNames,
+        min_pairwise_cosine: minimumPairwise(cluster.members, similarities),
+    };
+}
+function minimumPairwise(members, similarities) {
+    if (members.length < 2) {
+        return 1;
+    }
+    let minimum = 1;
+    for (let left = 0; left < members.length; left += 1) {
+        for (let right = left + 1; right < members.length; right += 1) {
+            minimum = Math.min(minimum, similarities[members[left]][members[right]]);
+        }
+    }
+    return minimum;
+}
+function compareDiscoveryClusters(left, right) {
+    return (right.distinct_projects - left.distinct_projects ||
+        right.sources.length - left.sources.length ||
+        right.min_pairwise_cosine - left.min_pairwise_cosine ||
+        compareText(clusterPathKey(left), clusterPathKey(right)));
+}
+function snippet(body, maxChars) {
+    const normalized = body.replace(/\s+/g, " ").trim();
+    if (normalized.length <= maxChars) {
+        return normalized;
+    }
+    if (maxChars === 0) {
+        return "";
+    }
+    if (maxChars === 1) {
+        return "…";
+    }
+    return `${normalized.slice(0, maxChars - 1).trimEnd()}…`;
+}
+function boundedCosine(left, right) {
+    return Math.max(-1, Math.min(1, cosineSimilarity(left, right)));
+}
+function compareMemories(left, right) {
+    return compareText(left.relative_path, right.relative_path) || left.id - right.id;
+}
+function memoryKey(memory) {
+    return `${memory.relative_path}\u0000${memory.id}`;
+}
+function mergeKey(left, right) {
+    return compareText(left.key, right.key) <= 0 ? `${left.key}\u0001${right.key}` : `${right.key}\u0001${left.key}`;
+}
+function clusterPathKey(cluster) {
+    return cluster.sources.map((source) => `${source.relative_path}\u0000${source.id}`).join("\u0001");
+}
+function compareText(left, right) {
+    return left < right ? -1 : left > right ? 1 : 0;
+}
+function validateOptions(minCosine, snippetChars) {
+    if (!Number.isFinite(minCosine) || minCosine < 0 || minCosine > 1) {
+        throw new RangeError("minCosine must be a finite number between 0 and 1");
+    }
+    if (!Number.isInteger(snippetChars) || snippetChars < 0) {
+        throw new RangeError("snippetChars must be a non-negative integer");
+    }
+}
+//# sourceMappingURL=decoction.js.map

package/dist/decoction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decoction.js","sourceRoot":"","sources":["../src/decoction.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAElD,MAAM,CAAC,MAAM,4BAA4B,GAAG,IAAI,CAAC;AACjD,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACxC,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC;AAEnD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAa,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AAC9E,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC;AA4D5D;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CAAC,KAA8B;IACxE,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,4BAA4B,CAAC;IAClE,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,IAAI,+BAA+B,CAAC;IAC3E,eAAe,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAEzC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACjF,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAChF,MAAM,YAAY,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,oBAAoB,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IAE1E,MAAM,QAAQ,GAAG,OAAO;SACrB,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,kBAAkB,CAAC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;SACrF,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,iBAAiB,IAAI,sBAAsB,CAAC;SACxE,IAAI,CAAC,wBAAwB,CAAC,CAAC;IAElC,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,MAAM;QACzB,QAAQ,EAAE,UAAU,CAAC,MAAM;QAC3B,UAAU,EAAE,SAAS;QACrB,YAAY,EAAE,sBAAsB;QACpC,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAgC;IAC1D,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7E,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,SAAS,CAAC,MAAgC;IACjD,IAAI,MAAM,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvF,OAAO,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,gBAAgB,CACvB,UAA+C,EAC/C,UAAyC;IAEzC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACvD,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QACvD,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACjE,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACzD,MAAM,UAAU,GAAG,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAC3B,UAA+C,EAC/C,YAAiC,EACjC,SAAiB;IAEjB,IAAI,QAAQ,GAAqB,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAClE,OAAO,EAAE,CAAC,KAAK,CAAC;QAChB,GAAG,EAAE,SAAS,CAAC,MAAM,CAAC;KACvB,CAAC,CAAC,CAAC;IAEJ,SAAS,CAAC;QACR,IAAI,IAAkF,CAAC;QACvF,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;YACrD,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC/D,MAAM,UAAU,GAAG,sBAAsB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;gBACpG,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;oBAC3B,SAAS;gBACX,CAAC;gBACD,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtD,IACE,CAAC,IAAI;oBACL,UAAU,GAAG,IAAI,CAAC,UAAU;oBAC5B,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU,IAAI,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAClE,CAAC;oBACD,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxG,MAAM,MAAM,GAAmB,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1D,QAAQ,GAAG,QAAQ;aAChB,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC;aACjE,MAAM,CAAC,MAAM,CAAC;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAC7B,IAAoB,EACpB,KAAqB,EACrB,YAAiC,EACjC,KAAa;IAEb,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACvC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YACjE,uEAAuE;YACvE,IAAI,OAAO,GAAG,KAAK,EAAE,CAAC;gBACpB,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,kBAAkB,CACzB,OAAuB,EACvB,UAA+C,EAC/C,YAAiC,EACjC,YAAoB;IAEpB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAClG,MAAM,OAAO,GAAG,OAAO;SACpB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChB,EAAE,EAAE,MAAM,CAAC,EAAE;QACb,aAAa,EAAE,MAAM,CAAC,aAAa;QACnC,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;QACzC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC;KAC5C,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAEhF,OAAO;QACL,OAAO;QACP,iBAAiB,EAAE,YAAY,CAAC,MAAM;QACtC,aAAa,EAAE,YAAY;QAC3B,mBAAmB,EAAE,eAAe,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC;KACpE,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,OAA0B,EAAE,YAAiC;IACpF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACpD,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC9D,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,wBAAwB,CAAC,IAA+B,EAAE,KAAgC;IACjG,OAAO,CACL,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB;QAChD,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;QAC1C,KAAK,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB;QACpD,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,CACzD,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,IAAY,EAAE,QAAgB;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACpD,IAAI,UAAU,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;QAClC,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC;AAC3D,CAAC;AAED,SAAS,aAAa,CAAC,IAAc,EAAE,KAAe;IACpD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,eAAe,CAAC,IAA8B,EAAE,KAA+B;IACtF,OAAO,WAAW,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;AACpF,CAAC;AAED,SAAS,SAAS,CAAC,MAAgC;IACjD,OAAO,GAAG,MAAM,CAAC,aAAa,SAAS,MAAM,CAAC,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,SAAS,QAAQ,CAAC,IAAoB,EAAE,KAAqB;IAC3D,OAAO,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,SAAS,IAAI,CAAC,GAAG,EAAE,CAAC;AACnH,CAAC;AAED,SAAS,cAAc,CAAC,OAAkC;IACxD,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,SAAS,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACrG,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,KAAa;IAC9C,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,eAAe,CAAC,SAAiB,EAAE,YAAoB;IAC9D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClE,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,UAAU,CAAC,6CAA6C,CAAC,CAAC;IACtE,CAAC;AACH,CAAC"}

package/dist/hooks.d.ts

@@ -1,10 +1,13 @@
 import { type RecallOptions } from "./recall.js";
 /**
- * Host-agnostic hook handlers. Claude Code and Codex CLI share the same
- * lifecycle-hook stdin/stdout JSON contract (Codex copied the event names and
- * envelopes), so one set of handlers serves both. The only host difference this
- * file cares about is the field naming the prompt: Claude sends `user_input`,
- * Codex sends `prompt` — `readPrompt` accepts either.
+ * Host-agnostic hook handlers. Claude Code, Codex CLI, and Grok Build share the
+ * same lifecycle-hook event names; Codex and Grok largely copied Claude's
+ * envelopes. Field-name differences are normalized below:
+ * - prompt: Claude `user_input`, Codex `prompt` (Grok may send either)
+ * - tool fields: Claude/Codex snake_case (`tool_name`, `tool_input`, `session_id`);
+ *   Grok camelCase (`toolName`, `toolInput`, `sessionId`, `workspaceRoot`)
+ * - tool names: Grok's real names (`run_terminal_command`, `search_replace`, …)
+ *   plus Claude aliases already accepted by Grok matchers
  *
  * Every handler is **fail-open**: a hook runs on every prompt and every turn
  * boundary, so any failure must degrade to "do nothing" (empty stdout, exit 0)