fushiguro-mcp 0.1.0

package/dist/memory.js

@@ -0,0 +1,374 @@
+import { mkdirSync } from "node:fs";
+import { dirname } from "node:path";
+import { DatabaseSync } from "node:sqlite";
+import { containment, ftsQuery, jaccard, sharedTokens, tokenize } from "./text.js";
+/**
+ * Hard rules must outrank soft tastes during recall, so each kind carries a
+ * multiplier applied on top of the text-relevance score.
+ */
+const KIND_WEIGHT = {
+    constraint: 1.6,
+    correction: 1.5,
+    preference: 1.0,
+    style: 0.9,
+    fact: 0.8,
+};
+/** Ranking used to decide whether a new memory supersedes an older one. */
+const KIND_RANK = {
+    fact: 0,
+    style: 1,
+    preference: 2,
+    correction: 3,
+    constraint: 4,
+};
+/**
+ * Whether two memories are restatements of one preference. Jaccard alone misses
+ * a preference restated at greater length, so containment of the smaller set
+ * counts too — but only above a floor of shared distinct tokens, since two short
+ * preferences about different objects ("8pt grid for spacing" / "8pt grid for
+ * icons") otherwise look identical to a purely lexical measure.
+ */
+function saysTheSameThing(a, b) {
+    if (sharedTokens(a, b) < 3)
+        return false;
+    return Math.max(jaccard(a, b), containment(a, b)) >= 0.6;
+}
+function toMemory(row) {
+    return {
+        id: row.id,
+        scope: row.scope,
+        agent: row.agent,
+        kind: row.kind,
+        text: row.text,
+        why: row.why,
+        confidence: row.confidence,
+        source: row.source,
+        createdAt: row.created_at,
+        updatedAt: row.updated_at,
+        hits: row.hits,
+        supersededBy: row.superseded_by,
+    };
+}
+export class MemoryStore {
+    #db;
+    constructor(dbPath) {
+        if (dbPath !== ":memory:")
+            mkdirSync(dirname(dbPath), { recursive: true });
+        this.#db = new DatabaseSync(dbPath);
+        this.#db.exec("PRAGMA journal_mode = WAL");
+        this.#db.exec("PRAGMA foreign_keys = ON");
+        this.#migrate();
+    }
+    #migrate() {
+        this.#db.exec(`
+      CREATE TABLE IF NOT EXISTS memories (
+        id            INTEGER PRIMARY KEY,
+        scope         TEXT NOT NULL DEFAULT 'global',
+        agent         TEXT,
+        kind          TEXT NOT NULL DEFAULT 'preference',
+        text          TEXT NOT NULL,
+        why           TEXT,
+        confidence    REAL NOT NULL DEFAULT 0.6,
+        source        TEXT,
+        created_at    TEXT NOT NULL DEFAULT (datetime('now')),
+        updated_at    TEXT NOT NULL DEFAULT (datetime('now')),
+        hits          INTEGER NOT NULL DEFAULT 0,
+        superseded_by INTEGER REFERENCES memories(id) ON DELETE SET NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_memories_lookup
+        ON memories(scope, agent, superseded_by);
+
+      CREATE VIRTUAL TABLE IF NOT EXISTS memories_fts
+        USING fts5(text, why, tokenize = 'porter unicode61');
+
+      CREATE TABLE IF NOT EXISTS decisions (
+        id         INTEGER PRIMARY KEY,
+        task       TEXT NOT NULL,
+        agent      TEXT NOT NULL,
+        outcome    TEXT NOT NULL,
+        notes      TEXT,
+        created_at TEXT NOT NULL DEFAULT (datetime('now'))
+      );
+
+      -- Learned routing signal: how often a term led to a good outcome for an agent.
+      CREATE TABLE IF NOT EXISTS affinity (
+        agent      TEXT NOT NULL,
+        term       TEXT NOT NULL,
+        weight     REAL NOT NULL DEFAULT 0,
+        updated_at TEXT NOT NULL DEFAULT (datetime('now')),
+        PRIMARY KEY (agent, term)
+      );
+    `);
+    }
+    close() {
+        this.#db.close();
+    }
+    #row(id) {
+        const row = this.#db
+            .prepare("SELECT * FROM memories WHERE id = ?")
+            .get(id);
+        if (!row)
+            throw new Error(`memory ${id} not found`);
+        return toMemory(row);
+    }
+    /**
+     * Writes a preference, folding it into an existing one when it says the same
+     * thing. Restating a preference reinforces it; a constraint or correction that
+     * restates a softer memory retires that memory instead of duplicating it.
+     */
+    remember(input) {
+        const text = input.text.trim();
+        if (!text)
+            throw new Error("memory text is empty");
+        const confidence = Math.min(1, Math.max(0, input.confidence ?? 0.6));
+        const tokens = tokenize(text);
+        for (const candidate of this.#similarCandidates(input, tokens)) {
+            if (!saysTheSameThing(tokens, tokenize(candidate.text)))
+                continue;
+            const sameOrLowerKind = KIND_RANK[input.kind] <= KIND_RANK[candidate.kind];
+            if (sameOrLowerKind) {
+                // A restatement: keep the newer wording and raise confidence.
+                const bumped = Math.min(1, Math.max(candidate.confidence, confidence) + 0.15);
+                this.#db
+                    .prepare(`UPDATE memories
+                SET text = ?, why = COALESCE(?, why), confidence = ?,
+                    kind = ?, updated_at = datetime('now')
+              WHERE id = ?`)
+                    .run(text, input.why ?? null, bumped, input.kind, candidate.id);
+                this.#reindex(candidate.id, text, input.why ?? candidate.why);
+                return { id: candidate.id, action: "reinforced", memory: this.#row(candidate.id) };
+            }
+            // A stronger statement of the same thing: retire the old, keep the trail.
+            const created = this.#insert({ ...input, text, confidence });
+            this.#db
+                .prepare("UPDATE memories SET superseded_by = ?, updated_at = datetime('now') WHERE id = ?")
+                .run(created, candidate.id);
+            return {
+                id: created,
+                action: "superseded",
+                supersededId: candidate.id,
+                memory: this.#row(created),
+            };
+        }
+        const id = this.#insert({ ...input, text, confidence });
+        return { id, action: "created", memory: this.#row(id) };
+    }
+    /** Live memories in the same scope/agent lane that share vocabulary with `tokens`. */
+    #similarCandidates(input, tokens) {
+        const match = ftsQuery(tokens.join(" "));
+        if (!match)
+            return [];
+        const rows = this.#db
+            .prepare(`SELECT m.* FROM memories_fts f
+           JOIN memories m ON m.id = f.rowid
+          WHERE memories_fts MATCH ?
+            AND m.superseded_by IS NULL
+            AND m.scope = ?
+            AND ((m.agent IS NULL AND ? IS NULL) OR m.agent = ?)
+          ORDER BY bm25(memories_fts)
+          LIMIT 10`)
+            .all(match, input.scope, input.agent, input.agent);
+        return rows.map(toMemory);
+    }
+    #insert(input) {
+        const result = this.#db
+            .prepare(`INSERT INTO memories (scope, agent, kind, text, why, confidence, source)
+         VALUES (?, ?, ?, ?, ?, ?, ?)`)
+            .run(input.scope, input.agent, input.kind, input.text, input.why ?? null, input.confidence, input.source ?? null);
+        const id = Number(result.lastInsertRowid);
+        this.#db
+            .prepare("INSERT INTO memories_fts (rowid, text, why) VALUES (?, ?, ?)")
+            .run(id, input.text, input.why ?? "");
+        return id;
+    }
+    #reindex(id, text, why) {
+        this.#db.prepare("DELETE FROM memories_fts WHERE rowid = ?").run(id);
+        this.#db
+            .prepare("INSERT INTO memories_fts (rowid, text, why) VALUES (?, ?, ?)")
+            .run(id, text, why ?? "");
+    }
+    /**
+     * Ranked recall. Relevance comes from BM25 when there is a query, then gets
+     * scaled by kind weight and confidence so a hard constraint beats a passing
+     * remark even when the remark matches the words better.
+     *
+     * Constraints and corrections are also pulled in unconditionally, whether or
+     * not they match the query. A rule like "never use purple" that only surfaces
+     * when the user happens to say "purple" is not a rule — it has to be in front
+     * of the agent on the task where it would otherwise be broken.
+     */
+    recall(options = {}) {
+        const limit = Math.min(100, Math.max(1, options.limit ?? 12));
+        const scopes = options.scopes?.length ? options.scopes : ["global"];
+        const scopePlaceholders = scopes.map(() => "?").join(", ");
+        const agent = options.agent ?? null;
+        const match = options.query ? ftsQuery(options.query) : null;
+        let rows;
+        if (match) {
+            rows = this.#db
+                .prepare(`SELECT m.*, -bm25(memories_fts) AS relevance
+             FROM memories_fts f
+             JOIN memories m ON m.id = f.rowid
+            WHERE memories_fts MATCH ?
+              AND m.superseded_by IS NULL
+              AND m.scope IN (${scopePlaceholders})
+              AND (m.agent IS NULL OR m.agent = ?)
+            ORDER BY relevance DESC
+            LIMIT ?`)
+                .all(match, ...scopes, agent, limit * 4);
+        }
+        else {
+            rows = this.#db
+                .prepare(`SELECT m.* FROM memories m
+            WHERE m.superseded_by IS NULL
+              AND m.scope IN (${scopePlaceholders})
+              AND (m.agent IS NULL OR m.agent = ?)
+            ORDER BY m.updated_at DESC
+            LIMIT ?`)
+                .all(...scopes, agent, limit * 4);
+        }
+        // BM25 magnitudes vary wildly with document length, so normalise relevance
+        // within this result set before weighting. Otherwise a short, soft memory
+        // that matched slightly better buries a hard constraint that also matched.
+        const maxRelevance = match
+            ? Math.max(...rows.map((r) => r.relevance ?? 0), Number.EPSILON)
+            : 1;
+        // Hard rules are always in scope, matched or not.
+        const bindingRows = this.#db
+            .prepare(`SELECT * FROM memories
+          WHERE superseded_by IS NULL
+            AND kind IN ('constraint', 'correction')
+            AND scope IN (${scopePlaceholders})
+            AND (agent IS NULL OR agent = ?)
+          ORDER BY confidence DESC, updated_at DESC
+          LIMIT ?`)
+            .all(...scopes, agent, limit);
+        const seen = new Set(rows.map((r) => r.id));
+        for (const row of bindingRows) {
+            if (!seen.has(row.id))
+                rows.push(row);
+        }
+        const scored = rows.map((row) => {
+            const memory = toMemory(row);
+            const binding = memory.kind === "constraint" || memory.kind === "correction";
+            const normalised = !match || binding
+                ? 1
+                : Math.max(0, row.relevance ?? 0) / maxRelevance;
+            // Floor at 0.4 so relevance ranks within a kind without overpowering kind.
+            const relevance = 0.4 + 0.6 * normalised;
+            return { memory, score: relevance * KIND_WEIGHT[memory.kind] * memory.confidence };
+        });
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, limit).map((s) => s.memory);
+    }
+    /** Marks memories as used, so `memory_stats` can show what actually earns its keep. */
+    markUsed(ids) {
+        if (ids.length === 0)
+            return;
+        const stmt = this.#db.prepare("UPDATE memories SET hits = hits + 1 WHERE id = ?");
+        for (const id of ids)
+            stmt.run(id);
+    }
+    get(id) {
+        const row = this.#db.prepare("SELECT * FROM memories WHERE id = ?").get(id);
+        return row ? toMemory(row) : null;
+    }
+    forget(id) {
+        const changes = this.#db.prepare("DELETE FROM memories WHERE id = ?").run(id).changes;
+        this.#db.prepare("DELETE FROM memories_fts WHERE rowid = ?").run(id);
+        return Number(changes) > 0;
+    }
+    list(options = {}) {
+        const clauses = ["superseded_by IS NULL"];
+        const params = [];
+        if (options.agent !== undefined) {
+            clauses.push("agent IS ?");
+            params.push(options.agent);
+        }
+        if (options.scope) {
+            clauses.push("scope = ?");
+            params.push(options.scope);
+        }
+        params.push(Math.min(200, Math.max(1, options.limit ?? 50)));
+        const rows = this.#db
+            .prepare(`SELECT * FROM memories WHERE ${clauses.join(" AND ")}
+          ORDER BY updated_at DESC LIMIT ?`)
+            .all(...params);
+        return rows.map(toMemory);
+    }
+    /**
+     * Records how a routing decision landed and nudges the term→agent affinity
+     * that the router consults next time. This is the loop that makes routing
+     * improve with use rather than staying frozen at whatever the keywords say.
+     */
+    recordOutcome(input) {
+        const result = this.#db
+            .prepare("INSERT INTO decisions (task, agent, outcome, notes) VALUES (?, ?, ?, ?)")
+            .run(input.task, input.agent, input.outcome, input.notes ?? null);
+        const delta = input.outcome === "accepted" ? 1 : input.outcome === "revised" ? 0.25 : -1;
+        const terms = [...new Set(tokenize(input.task))].slice(0, 24);
+        let adjusted = 0;
+        for (const term of terms) {
+            this.#bumpAffinity(input.agent, term, delta);
+            adjusted += 1;
+            // "wrong agent, should have been X" teaches both sides in one call.
+            if (input.correctAgent && input.correctAgent !== input.agent) {
+                this.#bumpAffinity(input.correctAgent, term, 1);
+            }
+        }
+        return { decisionId: Number(result.lastInsertRowid), adjusted };
+    }
+    #bumpAffinity(agent, term, delta) {
+        this.#db
+            .prepare(`INSERT INTO affinity (agent, term, weight) VALUES (?, ?, ?)
+         ON CONFLICT(agent, term) DO UPDATE
+           SET weight = max(-5, min(5, affinity.weight + excluded.weight)),
+               updated_at = datetime('now')`)
+            .run(agent, term, delta);
+    }
+    /** Learned per-agent weight for the given terms, summed. */
+    affinity(terms) {
+        const unique = [...new Set(terms)];
+        const out = new Map();
+        if (unique.length === 0)
+            return out;
+        const placeholders = unique.map(() => "?").join(", ");
+        const rows = this.#db
+            .prepare(`SELECT agent, SUM(weight) AS total FROM affinity
+          WHERE term IN (${placeholders}) GROUP BY agent`)
+            .all(...unique);
+        for (const row of rows)
+            out.set(row.agent, row.total);
+        return out;
+    }
+    stats() {
+        const count = (sql, ...params) => Number(this.#db.prepare(sql).get(...params).n);
+        const byKind = {};
+        for (const row of this.#db
+            .prepare("SELECT kind, COUNT(*) AS n FROM memories WHERE superseded_by IS NULL GROUP BY kind")
+            .all()) {
+            byKind[row.kind] = Number(row.n);
+        }
+        const byAgent = {};
+        for (const row of this.#db
+            .prepare(`SELECT COALESCE(agent, '(all agents)') AS agent, COUNT(*) AS n
+           FROM memories WHERE superseded_by IS NULL GROUP BY agent`)
+            .all()) {
+            byAgent[row.agent] = Number(row.n);
+        }
+        return {
+            total: count("SELECT COUNT(*) AS n FROM memories WHERE superseded_by IS NULL"),
+            byKind,
+            byAgent,
+            superseded: count("SELECT COUNT(*) AS n FROM memories WHERE superseded_by IS NOT NULL"),
+            decisions: count("SELECT COUNT(*) AS n FROM decisions"),
+            topUsed: this.#db
+                .prepare(`SELECT id, text, hits FROM memories
+            WHERE superseded_by IS NULL AND hits > 0
+            ORDER BY hits DESC LIMIT 5`)
+                .all(),
+        };
+    }
+}
+//# sourceMappingURL=memory.js.map

package/dist/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGnF;;;GAGG;AACH,MAAM,WAAW,GAA+B;IAC9C,UAAU,EAAE,GAAG;IACf,UAAU,EAAE,GAAG;IACf,UAAU,EAAE,GAAG;IACf,KAAK,EAAE,GAAG;IACV,IAAI,EAAE,GAAG;CACV,CAAC;AAEF,2EAA2E;AAC3E,MAAM,SAAS,GAA+B;IAC5C,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;IACR,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;IACb,UAAU,EAAE,CAAC;CACd,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;AAC3D,CAAC;AA4CD,SAAS,QAAQ,CAAC,GAAc;IAC9B,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,IAAI,EAAE,GAAG,CAAC,IAAkB;QAC5B,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,GAAG,EAAE,GAAG,CAAC,GAAG;QACZ,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,YAAY,EAAE,GAAG,CAAC,aAAa;KAChC,CAAC;AACJ,CAAC;AAED,MAAM,OAAO,WAAW;IACtB,GAAG,CAAe;IAElB,YAAY,MAAc;QACxB,IAAI,MAAM,KAAK,UAAU;YAAE,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3E,IAAI,CAAC,GAAG,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAuCb,CAAC,CAAC;IACL,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,EAAU;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG;aACjB,OAAO,CAAC,qCAAqC,CAAC;aAC9C,GAAG,CAAC,EAAE,CAAqC,CAAC;QAC/C,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QACpD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,KAAoB;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC;QACrE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAE9B,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YAElE,MAAM,eAAe,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC3E,IAAI,eAAe,EAAE,CAAC;gBACpB,8DAA8D;gBAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC9E,IAAI,CAAC,GAAG;qBACL,OAAO,CACN;;;2BAGe,CAChB;qBACA,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;gBAClE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC;gBAC9D,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;YACrF,CAAC;YAED,0EAA0E;YAC1E,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAC7D,IAAI,CAAC,GAAG;iBACL,OAAO,CAAC,kFAAkF,CAAC;iBAC3F,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YAC9B,OAAO;gBACL,EAAE,EAAE,OAAO;gBACX,MAAM,EAAE,YAAY;gBACpB,YAAY,EAAE,SAAS,CAAC,EAAE;gBAC1B,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;aAC3B,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QACxD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IAC1D,CAAC;IAED,sFAAsF;IACtF,kBAAkB,CAAC,KAAoB,EAAE,MAAgB;QACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;;;;;;mBAOW,CACZ;aACA,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAA2B,CAAC;QAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,KAA6C;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG;aACpB,OAAO,CACN;sCAC8B,CAC/B;aACA,GAAG,CACF,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,GAAG,IAAI,IAAI,EACjB,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,MAAM,IAAI,IAAI,CACrB,CAAC;QACJ,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG;aACL,OAAO,CAAC,8DAA8D,CAAC;aACvE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;QACxC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,QAAQ,CAAC,EAAU,EAAE,IAAY,EAAE,GAAkB;QACnD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrE,IAAI,CAAC,GAAG;aACL,OAAO,CAAC,8DAA8D,CAAC;aACvE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,UAAyB,EAAE;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACpE,MAAM,iBAAiB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE7D,IAAI,IAA4C,CAAC;QACjD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,CAAC,GAAG;iBACZ,OAAO,CACN;;;;;gCAKsB,iBAAiB;;;oBAG7B,CACX;iBACA,GAAG,CAAC,KAAK,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAqD,CAAC;QACjG,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,IAAI,CAAC,GAAG;iBACZ,OAAO,CACN;;gCAEsB,iBAAiB;;;oBAG7B,CACX;iBACA,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAA2B,CAAC;QAChE,CAAC;QAED,2EAA2E;QAC3E,0EAA0E;QAC1E,2EAA2E;QAC3E,MAAM,YAAY,GAAG,KAAK;YACxB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC;YAChE,CAAC,CAAC,CAAC,CAAC;QACN,kDAAkD;QAClD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG;aACzB,OAAO,CACN;;;4BAGoB,iBAAiB;;;kBAG3B,CACX;aACA,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,CAA2B,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,KAAK,YAAY,IAAI,MAAM,CAAC,IAAI,KAAK,YAAY,CAAC;YAC7E,MAAM,UAAU,GAAG,CAAC,KAAK,IAAI,OAAO;gBAClC,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC;YACnD,2EAA2E;YAC3E,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC;YACzC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACrF,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IAED,uFAAuF;IACvF,QAAQ,CAAC,GAAa;QACpB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAC3B,kDAAkD,CACnD,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAqC,CAAC;QAChH,OAAO,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,EAAU;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC;QACtF,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrE,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,IAAI,CAAC,UAAqE,EAAE;QAC1E,MAAM,OAAO,GAAG,CAAC,uBAAuB,CAAC,CAAC;QAC1C,MAAM,MAAM,GAA+B,EAAE,CAAC;QAC9C,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN,gCAAgC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC;2CAClB,CACpC;aACA,GAAG,CAAC,GAAG,MAAM,CAA2B,CAAC;QAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,KAMb;QACC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG;aACpB,OAAO,CAAC,yEAAyE,CAAC;aAClF,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;QAEpE,MAAM,KAAK,GACT,KAAK,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9D,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7C,QAAQ,IAAI,CAAC,CAAC;YACd,oEAAoE;YACpE,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,KAAK,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC7D,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,EAAE,QAAQ,EAAE,CAAC;IAClE,CAAC;IAED,aAAa,CAAC,KAAa,EAAE,IAAY,EAAE,KAAa;QACtD,IAAI,CAAC,GAAG;aACL,OAAO,CACN;;;4CAGoC,CACrC;aACA,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,4DAA4D;IAC5D,QAAQ,CAAC,KAAe;QACtB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;2BACmB,YAAY,kBAAkB,CAClD;aACA,GAAG,CAAC,GAAG,MAAM,CAAkD,CAAC;QACnE,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACtD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK;QAQH,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,GAAG,MAAiB,EAAE,EAAE,CAClD,MAAM,CAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAI,MAAkB,CAA8B,CAAC,CAAC,CAAC,CAAC;QAE5F,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG;aACvB,OAAO,CAAC,oFAAoF,CAAC;aAC7F,GAAG,EAA8C,EAAE,CAAC;YACrD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG;aACvB,OAAO,CACN;oEAC4D,CAC7D;aACA,GAAG,EAA+C,EAAE,CAAC;YACtD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;QAED,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,gEAAgE,CAAC;YAC9E,MAAM;YACN,OAAO;YACP,UAAU,EAAE,KAAK,CAAC,oEAAoE,CAAC;YACvF,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC;YACvD,OAAO,EAAE,IAAI,CAAC,GAAG;iBACd,OAAO,CACN;;uCAE6B,CAC9B;iBACA,GAAG,EAA6D;SACpE,CAAC;IACJ,CAAC;CACF"}

package/dist/quiet.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/quiet.js

@@ -0,0 +1,21 @@
+/**
+ * Silences the `node:sqlite` experimental warning, which would otherwise land in
+ * the host's error log on every start. Nothing else is silenced.
+ *
+ * The warning fires while `node:sqlite` is being linked, which happens before any
+ * module body in a static graph runs — so this module has no imports of its own
+ * and `index.ts` reaches the rest of the server through a dynamic import.
+ */
+const originalEmit = process.emit.bind(process);
+process.emit = (name, ...args) => {
+    const data = args[0];
+    if (name === "warning" &&
+        data instanceof Error &&
+        data.name === "ExperimentalWarning" &&
+        data.message.includes("SQLite")) {
+        return false;
+    }
+    return originalEmit(name, ...args);
+};
+export {};
+//# sourceMappingURL=quiet.js.map

package/dist/quiet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quiet.js","sourceRoot":"","sources":["../src/quiet.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC/C,OAA8E,CAAC,IAAI,GAAG,CACrF,IAAY,EACZ,GAAG,IAAe,EAClB,EAAE;IACF,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,IACE,IAAI,KAAK,SAAS;QAClB,IAAI,YAAY,KAAK;QACrB,IAAI,CAAC,IAAI,KAAK,qBAAqB;QACnC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAC/B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAQ,YAA6C,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;AACvE,CAAC,CAAC"}

package/dist/registry.d.ts

@@ -0,0 +1,15 @@
+import type { Specialist } from "./types.js";
+/**
+ * Loads the specialist roster from disk and reloads it when a file changes,
+ * so editing an `agents/*.md` takes effect without restarting the server.
+ */
+export declare class Registry {
+    #private;
+    private readonly dir;
+    constructor(dir: string);
+    refresh(): void;
+    all(): Specialist[];
+    get(name: string): Specialist | undefined;
+    /** Parse failures from the last load, surfaced so bad files aren't silent. */
+    errors(): string[];
+}

package/dist/registry.js

@@ -0,0 +1,128 @@
+import { readdirSync, readFileSync, statSync } from "node:fs";
+import { join } from "node:path";
+import { parse as parseYaml } from "yaml";
+const FRONTMATTER = /^---\r?\n([\s\S]*?)\r?\n---\r?\n?/;
+function asStringArray(value) {
+    if (Array.isArray(value))
+        return value.map((v) => String(v).trim()).filter(Boolean);
+    if (typeof value === "string") {
+        return value
+            .split(",")
+            .map((v) => v.trim())
+            .filter(Boolean);
+    }
+    return [];
+}
+function parseSpecialist(file, raw) {
+    const match = FRONTMATTER.exec(raw);
+    if (!match) {
+        throw new Error(`${file}: missing YAML frontmatter (a --- delimited block at the top)`);
+    }
+    const meta = (parseYaml(match[1]) ?? {});
+    const systemPrompt = raw.slice(match[0].length).trim();
+    const name = String(meta.name ?? "").trim();
+    if (!name)
+        throw new Error(`${file}: frontmatter needs a 'name'`);
+    if (!/^[a-z0-9][a-z0-9-]*$/.test(name)) {
+        throw new Error(`${file}: 'name' must be lowercase kebab-case, got '${name}'`);
+    }
+    if (!systemPrompt)
+        throw new Error(`${file}: no system prompt below the frontmatter`);
+    const patterns = [];
+    for (const src of asStringArray(meta.patterns)) {
+        try {
+            patterns.push(new RegExp(src, "i"));
+        }
+        catch (err) {
+            throw new Error(`${file}: invalid regex in 'patterns': ${src} (${err.message})`);
+        }
+    }
+    return {
+        name,
+        title: String(meta.title ?? name),
+        description: String(meta.description ?? ""),
+        model: meta.model ? String(meta.model) : undefined,
+        keywords: asStringArray(meta.keywords).map((k) => k.toLowerCase()),
+        triggers: asStringArray(meta.triggers),
+        patterns,
+        tools: asStringArray(meta.tools),
+        systemPrompt,
+        file,
+    };
+}
+/**
+ * Loads the specialist roster from disk and reloads it when a file changes,
+ * so editing an `agents/*.md` takes effect without restarting the server.
+ */
+export class Registry {
+    dir;
+    #specialists = new Map();
+    #signature = "";
+    #errors = [];
+    constructor(dir) {
+        this.dir = dir;
+        this.refresh();
+    }
+    /** Cheap mtime+size fingerprint of the directory; changes trigger a reload. */
+    #fingerprint() {
+        let files;
+        try {
+            files = readdirSync(this.dir).filter((f) => f.endsWith(".md")).sort();
+        }
+        catch {
+            return "missing";
+        }
+        return files
+            .map((f) => {
+            const s = statSync(join(this.dir, f));
+            return `${f}:${s.mtimeMs}:${s.size}`;
+        })
+            .join("|");
+    }
+    refresh() {
+        const signature = this.#fingerprint();
+        if (signature === this.#signature && this.#specialists.size > 0)
+            return;
+        this.#signature = signature;
+        const next = new Map();
+        const errors = [];
+        let files = [];
+        try {
+            files = readdirSync(this.dir).filter((f) => f.endsWith(".md")).sort();
+        }
+        catch {
+            errors.push(`agents directory not readable: ${this.dir}`);
+        }
+        for (const file of files) {
+            const path = join(this.dir, file);
+            try {
+                const spec = parseSpecialist(path, readFileSync(path, "utf8"));
+                if (next.has(spec.name)) {
+                    errors.push(`duplicate specialist name '${spec.name}' in ${file}; keeping the first`);
+                    continue;
+                }
+                next.set(spec.name, spec);
+            }
+            catch (err) {
+                // One malformed file must not take the whole roster down.
+                errors.push(err.message);
+            }
+        }
+        this.#specialists = next;
+        this.#errors = errors;
+    }
+    all() {
+        this.refresh();
+        return [...this.#specialists.values()];
+    }
+    get(name) {
+        this.refresh();
+        return this.#specialists.get(name);
+    }
+    /** Parse failures from the last load, surfaced so bad files aren't silent. */
+    errors() {
+        this.refresh();
+        return this.#errors;
+    }
+}
+//# sourceMappingURL=registry.js.map

package/dist/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../src/registry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,IAAI,SAAS,EAAE,MAAM,MAAM,CAAC;AAG1C,MAAM,WAAW,GAAG,mCAAmC,CAAC;AAExD,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpF,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,KAAK;aACT,KAAK,CAAC,GAAG,CAAC;aACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,OAAO,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,GAAW;IAChD,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,+DAA+D,CAAC,CAAC;IAC1F,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAA4B,CAAC;IACrE,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAEvD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5C,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,8BAA8B,CAAC,CAAC;IAClE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,+CAA+C,IAAI,GAAG,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,CAAC,YAAY;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,0CAA0C,CAAC,CAAC;IAEtF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,kCAAkC,GAAG,KAAM,GAAa,CAAC,OAAO,GAAG,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI;QACJ,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;QACjC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;QAC3C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;QAClD,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAClE,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC;QACtC,QAAQ;QACR,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC;QAChC,YAAY;QACZ,IAAI;KACL,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,QAAQ;IAKU;IAJ7B,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,UAAU,GAAG,EAAE,CAAC;IAChB,OAAO,GAAa,EAAE,CAAC;IAEvB,YAA6B,GAAW;QAAX,QAAG,GAAH,GAAG,CAAQ;QACtC,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,+EAA+E;IAC/E,YAAY;QACV,IAAI,KAAe,CAAC;QACpB,IAAI,CAAC;YACH,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,KAAK;aACT,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,CAAC,CAAC;aACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,OAAO;QACL,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO;QACxE,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAE5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC3C,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,IAAI,KAAK,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,IAAI,CAAC,kCAAkC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC5D,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC/D,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,8BAA8B,IAAI,CAAC,IAAI,QAAQ,IAAI,qBAAqB,CAAC,CAAC;oBACtF,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5B,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,0DAA0D;gBAC1D,MAAM,CAAC,IAAI,CAAE,GAAa,CAAC,OAAO,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,GAAG;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,GAAG,CAAC,IAAY;QACd,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,8EAA8E;IAC9E,MAAM;QACJ,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF"}

package/dist/router.d.ts

@@ -0,0 +1,55 @@
+import type { Catalog } from "./catalog.js";
+import type { KnowledgeIndex } from "./knowledge.js";
+import type { MemoryStore } from "./memory.js";
+import type { Agent, Briefing, Connector, Memory, RouteResult, Runbook, Skill, ToolDef, Topic } from "./types.js";
+export interface BriefOptions {
+    /** Memory scopes to draw preferences from. */
+    scopes: string[];
+    memoryLimit: number;
+    knowledgeLimit: number;
+    /** Force a specific agent, bypassing the router. */
+    agentName?: string;
+}
+export declare class Router {
+    private readonly catalog;
+    private readonly memory;
+    private readonly knowledge;
+    private readonly options;
+    constructor(catalog: Catalog, memory: MemoryStore, knowledge: KnowledgeIndex, options: {
+        minScore: number;
+        ambiguityRatio: number;
+    });
+    /** Picks the best agent for a task, without assembling the rest of the briefing. */
+    routeAgent(task: string, context?: string): RouteResult;
+    private matchTopics;
+    /**
+     * Assembles everything the host needs to run one task: the agent, the skills
+     * and runbooks that apply, retrieved knowledge, the tools and connectors it may
+     * use, and the user's standing preferences — composed into one system prompt.
+     */
+    brief(task: string, context: string, options: BriefOptions): Briefing | {
+        route: RouteResult;
+    };
+    private selectSkills;
+    private selectRunbooks;
+}
+/**
+ * Builds the system prompt handed to the subagent. Order matters: the agent's own
+ * instructions first, then the procedures it must follow, then reference material,
+ * then the user's standing preferences last so they are freshest in context.
+ */
+export declare function composePrompt(parts: {
+    agent: Agent;
+    skills: Skill[];
+    runbooks: Runbook[];
+    knowledge: {
+        id: string;
+        docName: string;
+        heading: string;
+        text: string;
+    }[];
+    tools: ToolDef[];
+    connectors: Connector[];
+    memories: Memory[];
+    topics: Topic[];
+}): string;