bikky 0.1.0

package/dist/daemon/relations.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Relationship Inference
+ *
+ * Periodic task that infers typed relationships between entities by analysing
+ * their shared facts.  Runs inside the consolidation tick cadence.
+ *
+ * Flow:
+ *   1. Scroll all non-superseded facts → build entity co-occurrence map
+ *   2. Filter out pairs that already have a `kind: "relation"` fact
+ *   3. For the top N pairs by shared-fact count, fetch the actual shared facts
+ *   4. Send to a cheap LLM for a 2-4 word relationship label
+ *   5. Store via storeFact with kind: "relation", source: "daemon"
+ */
+import type { BikkyConfig } from "../config.js";
+import type { LogFn } from "./qdrant.js";
+declare const setLogger: (fn: LogFn) => void;
+/** Canonical pair key — alphabetical so (a,b) === (b,a) */
+declare const pairKey: (a: string, b: string) => string;
+interface CoOccurrence {
+    entityA: string;
+    entityB: string;
+    count: number;
+    factIds: string[];
+}
+/**
+ * Scroll ALL non-superseded facts in batches and build a co-occurrence map.
+ * Returns pairs sorted by count descending.
+ */
+declare const buildCoOccurrenceMap: () => Promise<CoOccurrence[]>;
+/**
+ * Get the set of entity pairs that already have a daemon-inferred relation.
+ * Returns a Set of pairKeys.
+ */
+declare const getExistingRelations: () => Promise<Set<string>>;
+/**
+ * Use LLM to infer a relationship label from shared facts.
+ * Returns null if the LLM can't determine a meaningful relationship.
+ */
+declare const inferRelation: (entityA: string, entityB: string, sharedFacts: Array<{
+    content: string;
+    category: string;
+}>) => Promise<{
+    type: string;
+    content: string;
+} | null>;
+/**
+ * Store an inferred relation as a memory fact.
+ */
+declare const storeRelation: (entityA: string, entityB: string, relationType: string, content: string, sharedFactIds: string[]) => Promise<string>;
+declare const tick: (config: BikkyConfig) => Promise<void>;
+/** Reset state (for testing). */
+declare const _reset: () => void;
+export { tick, setLogger, _reset, buildCoOccurrenceMap, getExistingRelations, inferRelation, storeRelation, pairKey, };
+//# sourceMappingURL=relations.d.ts.map

package/dist/daemon/relations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relations.d.ts","sourceRoot":"","sources":["../../src/daemon/relations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAiB,MAAM,aAAa,CAAC;AAOxD,QAAA,MAAM,SAAS,GAAI,IAAI,KAAK,KAAG,IAAuB,CAAC;AAcvD,2DAA2D;AAC3D,QAAA,MAAM,OAAO,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,MAGvC,CAAC;AAEF,UAAU,YAAY;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;GAGG;AACH,QAAA,MAAM,oBAAoB,QAAa,OAAO,CAAC,YAAY,EAAE,CA2E5D,CAAC;AAEF;;;GAGG;AACH,QAAA,MAAM,oBAAoB,QAAa,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CA8CzD,CAAC;AAqBF;;;GAGG;AACH,QAAA,MAAM,aAAa,GACjB,SAAS,MAAM,EACf,SAAS,MAAM,EACf,aAAa,KAAK,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,KACxD,OAAO,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAwClD,CAAC;AAEF;;GAEG;AACH,QAAA,MAAM,aAAa,GACjB,SAAS,MAAM,EACf,SAAS,MAAM,EACf,cAAc,MAAM,EACpB,SAAS,MAAM,EACf,eAAe,MAAM,EAAE,KACtB,OAAO,CAAC,MAAM,CA4BhB,CAAC;AAIF,QAAA,MAAM,IAAI,GAAU,QAAQ,WAAW,KAAG,OAAO,CAAC,IAAI,CA+DrD,CAAC;AAEF,iCAAiC;AACjC,QAAA,MAAM,MAAM,QAAO,IAElB,CAAC;AAEF,OAAO,EACL,IAAI,EACJ,SAAS,EACT,MAAM,EAEN,oBAAoB,EACpB,oBAAoB,EACpB,aAAa,EACb,aAAa,EACb,OAAO,GACR,CAAC"}

package/dist/daemon/relations.js

@@ -0,0 +1,290 @@
+/**
+ * Relationship Inference
+ *
+ * Periodic task that infers typed relationships between entities by analysing
+ * their shared facts.  Runs inside the consolidation tick cadence.
+ *
+ * Flow:
+ *   1. Scroll all non-superseded facts → build entity co-occurrence map
+ *   2. Filter out pairs that already have a `kind: "relation"` fact
+ *   3. For the top N pairs by shared-fact count, fetch the actual shared facts
+ *   4. Send to a cheap LLM for a 2-4 word relationship label
+ *   5. Store via storeFact with kind: "relation", source: "daemon"
+ */
+import { createHash } from "node:crypto";
+import * as qdrant from "./qdrant.js";
+import { chatCompletion } from "../llm/index.js";
+// ─── State ───────────────────────────────────────────────────────────────────
+let logFn = () => { };
+let internalTickCount = 0;
+const setLogger = (fn) => { logFn = fn; };
+// Run every 300 internal ticks.  consolidation.tick calls us every 5 daemon
+// ticks (≈25 s each), so effective period ≈ 300 × 25 s ≈ 2 hours.
+const TICK_INTERVAL = 300;
+// Max relations to infer per cycle (keeps LLM cost bounded)
+const MAX_INFER_PER_CYCLE = 3;
+// Minimum shared facts before we consider inferring a relation
+const MIN_SHARED_FACTS = 2;
+// ─── Helpers ─────────────────────────────────────────────────────────────────
+/** Canonical pair key — alphabetical so (a,b) === (b,a) */
+const pairKey = (a, b) => {
+    const sorted = [a, b].sort();
+    return `${sorted[0]}::${sorted[1]}`;
+};
+/**
+ * Scroll ALL non-superseded facts in batches and build a co-occurrence map.
+ * Returns pairs sorted by count descending.
+ */
+const buildCoOccurrenceMap = async () => {
+    const pairMap = new Map();
+    let offset = null;
+    const BATCH = 100;
+    let totalScrolled = 0;
+    // Scroll through all non-superseded, non-relation facts
+    for (;;) {
+        const body = {
+            filter: {
+                must: [
+                    { is_null: { key: "superseded_by" } },
+                ],
+                must_not: [
+                    { key: "kind", match: { value: "relation" } },
+                ],
+            },
+            limit: BATCH,
+            with_payload: { include: ["entities"] },
+        };
+        if (offset)
+            body.offset = offset;
+        const result = await qdrant.qdrantRequest("POST", `/collections/${qdrant.collection}/points/scroll`, body);
+        const points = result.result?.points || [];
+        if (points.length === 0)
+            break;
+        for (const pt of points) {
+            const entities = pt.payload?.entities || [];
+            if (entities.length < 2)
+                continue;
+            // Generate all pairs from this fact's entities
+            for (let i = 0; i < entities.length; i++) {
+                for (let j = i + 1; j < entities.length; j++) {
+                    const eA = entities[i];
+                    const eB = entities[j];
+                    const key = pairKey(eA, eB);
+                    const existing = pairMap.get(key);
+                    if (existing) {
+                        existing.count++;
+                        if (existing.factIds.length < 10)
+                            existing.factIds.push(pt.id);
+                    }
+                    else {
+                        const sorted = [eA, eB].sort();
+                        pairMap.set(key, {
+                            entityA: sorted[0],
+                            entityB: sorted[1],
+                            count: 1,
+                            factIds: [pt.id],
+                        });
+                    }
+                }
+            }
+        }
+        totalScrolled += points.length;
+        offset = result.result?.next_page_offset ?? null;
+        if (!offset)
+            break;
+    }
+    logFn("DEBUG", `Relations: scrolled ${totalScrolled} facts, found ${pairMap.size} co-occurrence pairs`);
+    // Sort by count descending
+    return Array.from(pairMap.values())
+        .filter(p => p.count >= MIN_SHARED_FACTS)
+        .sort((a, b) => b.count - a.count);
+};
+/**
+ * Get the set of entity pairs that already have a daemon-inferred relation.
+ * Returns a Set of pairKeys.
+ */
+const getExistingRelations = async () => {
+    const existing = new Set();
+    let offset = null;
+    for (;;) {
+        const body = {
+            filter: {
+                must: [
+                    { key: "kind", match: { value: "relation" } },
+                    { key: "source", match: { value: "daemon" } },
+                    { is_null: { key: "superseded_by" } },
+                ],
+            },
+            limit: 100,
+            with_payload: { include: ["from_entity", "to_entity"] },
+        };
+        if (offset)
+            body.offset = offset;
+        const result = await qdrant.qdrantRequest("POST", `/collections/${qdrant.collection}/points/scroll`, body);
+        const points = result.result?.points || [];
+        if (points.length === 0)
+            break;
+        for (const pt of points) {
+            const from = pt.payload?.from_entity;
+            const to = pt.payload?.to_entity;
+            if (from && to) {
+                existing.add(pairKey(from, to));
+            }
+        }
+        offset = result.result?.next_page_offset ?? null;
+        if (!offset)
+            break;
+    }
+    logFn("DEBUG", `Relations: ${existing.size} existing daemon-inferred relations`);
+    return existing;
+};
+/**
+ * Fetch the full content of specific fact IDs for the LLM prompt.
+ */
+const fetchFactContents = async (factIds) => {
+    const result = await qdrant.qdrantRequest("POST", `/collections/${qdrant.collection}/points`, { ids: factIds, with_payload: { include: ["content", "category"] } });
+    return (result.result || []).map(pt => ({
+        id: pt.id,
+        content: pt.payload?.content ?? "",
+        category: pt.payload?.category ?? "",
+    }));
+};
+/**
+ * Use LLM to infer a relationship label from shared facts.
+ * Returns null if the LLM can't determine a meaningful relationship.
+ */
+const inferRelation = async (entityA, entityB, sharedFacts) => {
+    const factsText = sharedFacts
+        .map((f, i) => `${i + 1}. [${f.category}] ${f.content}`)
+        .join("\n");
+    const raw = await chatCompletion({
+        messages: [
+            {
+                role: "system",
+                content: `You infer relationships between entities based on shared facts.
+Output ONLY valid JSON: { "type": "verb-phrase", "content": "one sentence description" }
+The "type" should be a 1-3 word verb phrase (e.g. "owns", "uses", "works-on", "manages", "depends-on").
+The "content" should be a single sentence describing the relationship.
+If the facts don't suggest a clear relationship, output: { "type": null }`,
+            },
+            {
+                role: "user",
+                content: `Entity A: "${entityA}"
+Entity B: "${entityB}"
+Shared facts (${sharedFacts.length}):
+${factsText}
+
+Infer the primary relationship between these two entities.`,
+            },
+        ],
+        temperature: 0.1,
+        max_tokens: 150,
+    });
+    if (!raw)
+        return null;
+    try {
+        const jsonStr = raw.replace(/^```json?\n?/, "").replace(/\n?```$/, "").trim();
+        const parsed = JSON.parse(jsonStr);
+        if (!parsed.type)
+            return null;
+        return { type: parsed.type, content: parsed.content || `${entityA} ${parsed.type} ${entityB}` };
+    }
+    catch {
+        logFn("WARN", `Relations: failed to parse LLM response for ${entityA}↔${entityB}: ${raw.slice(0, 100)}`);
+        return null;
+    }
+};
+/**
+ * Store an inferred relation as a memory fact.
+ */
+const storeRelation = async (entityA, entityB, relationType, content, sharedFactIds) => {
+    const hash = createHash("sha256")
+        .update(`daemon-relation:${pairKey(entityA, entityB)}:${relationType}`)
+        .digest("hex");
+    const id = await qdrant.storeFact({
+        content,
+        category: "team", // relations are about entity structure
+        domain: "work",
+        kind: "relation",
+        entities: [entityA, entityB],
+        source: "daemon",
+        confidence: 0.7,
+        importance: 0.6,
+        content_hash: hash,
+        metadata: {
+            inferred_from: sharedFactIds.slice(0, 5).join(","),
+            shared_fact_count: String(sharedFactIds.length),
+        },
+        relation: {
+            from: entityA,
+            type: relationType,
+            to: entityB,
+        },
+    });
+    logFn("INFO", `Relations: inferred ${entityA} —[${relationType}]→ ${entityB} (id: ${id})`);
+    return id;
+};
+// ─── Main Tick ───────────────────────────────────────────────────────────────
+const tick = async (config) => {
+    if (!qdrant.isReady())
+        return;
+    if (config.daemon.relation_inference_enabled === false)
+        return;
+    internalTickCount++;
+    if (internalTickCount % TICK_INTERVAL !== 0)
+        return;
+    logFn("DEBUG", "Relations: starting inference cycle");
+    try {
+        // 1. Build co-occurrence map
+        const pairs = await buildCoOccurrenceMap();
+        if (pairs.length === 0) {
+            logFn("DEBUG", "Relations: no co-occurrence pairs above threshold");
+            return;
+        }
+        // 2. Get existing relations to avoid duplicates
+        const existing = await getExistingRelations();
+        // 3. Find candidate pairs (not yet inferred)
+        const candidates = pairs.filter(p => !existing.has(pairKey(p.entityA, p.entityB)));
+        logFn("DEBUG", `Relations: ${candidates.length} candidate pairs (${pairs.length} total above threshold)`);
+        if (candidates.length === 0)
+            return;
+        // 4. Infer relations for top N candidates
+        let inferred = 0;
+        for (const candidate of candidates.slice(0, MAX_INFER_PER_CYCLE)) {
+            try {
+                const facts = await fetchFactContents(candidate.factIds);
+                if (facts.length < MIN_SHARED_FACTS)
+                    continue;
+                const result = await inferRelation(candidate.entityA, candidate.entityB, facts);
+                if (!result)
+                    continue;
+                // Dedup check before storing
+                const hash = createHash("sha256")
+                    .update(`daemon-relation:${pairKey(candidate.entityA, candidate.entityB)}:${result.type}`)
+                    .digest("hex");
+                const dedup = await qdrant.dedupCheck(result.content, hash);
+                if (dedup.action === "skip") {
+                    logFn("DEBUG", `Relations: skipping duplicate ${candidate.entityA}↔${candidate.entityB}`);
+                    continue;
+                }
+                await storeRelation(candidate.entityA, candidate.entityB, result.type, result.content, candidate.factIds);
+                inferred++;
+            }
+            catch (e) {
+                logFn("WARN", `Relations: failed to infer ${candidate.entityA}↔${candidate.entityB}: ${e.message}`);
+            }
+        }
+        logFn("INFO", `Relations: inference cycle complete — ${inferred} new relations from ${candidates.length} candidates`);
+    }
+    catch (e) {
+        logFn("ERROR", `Relations: inference cycle failed: ${e.message}`);
+    }
+};
+/** Reset state (for testing). */
+const _reset = () => {
+    internalTickCount = 0;
+};
+export { tick, setLogger, _reset, 
+// Exported for testing
+buildCoOccurrenceMap, getExistingRelations, inferRelation, storeRelation, pairKey, };
+//# sourceMappingURL=relations.js.map

package/dist/daemon/relations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relations.js","sourceRoot":"","sources":["../../src/daemon/relations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAIjD,gFAAgF;AAEhF,IAAI,KAAK,GAAU,GAAG,EAAE,GAAE,CAAC,CAAC;AAC5B,IAAI,iBAAiB,GAAG,CAAC,CAAC;AAE1B,MAAM,SAAS,GAAG,CAAC,EAAS,EAAQ,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAEvD,4EAA4E;AAC5E,kEAAkE;AAClE,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,4DAA4D;AAC5D,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,+DAA+D;AAC/D,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B,gFAAgF;AAEhF,2DAA2D;AAC3D,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7B,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AACtC,CAAC,CAAC;AASF;;;GAGG;AACH,MAAM,oBAAoB,GAAG,KAAK,IAA6B,EAAE;IAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkF,CAAC;IAE1G,IAAI,MAAM,GAAkB,IAAI,CAAC;IACjC,MAAM,KAAK,GAAG,GAAG,CAAC;IAClB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,wDAAwD;IACxD,SAAS,CAAC;QACR,MAAM,IAAI,GAA4B;YACpC,MAAM,EAAE;gBACN,IAAI,EAAE;oBACJ,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,eAAe,EAAE,EAAE;iBACtC;gBACD,QAAQ,EAAE;oBACR,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE;iBAC9C;aACF;YACD,KAAK,EAAE,KAAK;YACZ,YAAY,EAAE,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE;SACxC,CAAC;QACF,IAAI,MAAM;YAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAEjC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,aAAa,CACvC,MAAM,EACN,gBAAgB,MAAM,CAAC,UAAU,gBAAgB,EACjD,IAAI,CAML,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,EAAE,CAAC;QAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAE/B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAC;YAC5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAElC,+CAA+C;YAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;oBACxB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;oBACxB,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBAC5B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAClC,IAAI,QAAQ,EAAE,CAAC;wBACb,QAAQ,CAAC,KAAK,EAAE,CAAC;wBACjB,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE;4BAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;oBACjE,CAAC;yBAAM,CAAC;wBACN,MAAM,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;wBAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;4BACf,OAAO,EAAE,MAAM,CAAC,CAAC,CAAE;4BACnB,OAAO,EAAE,MAAM,CAAC,CAAC,CAAE;4BACnB,KAAK,EAAE,CAAC;4BACR,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;yBACjB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,aAAa,IAAI,MAAM,CAAC,MAAM,CAAC;QAC/B,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,IAAI,IAAI,CAAC;QACjD,IAAI,CAAC,MAAM;YAAE,MAAM;IACrB,CAAC;IAED,KAAK,CAAC,OAAO,EAAE,uBAAuB,aAAa,iBAAiB,OAAO,CAAC,IAAI,sBAAsB,CAAC,CAAC;IAExG,2BAA2B;IAC3B,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,gBAAgB,CAAC;SACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACvC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,oBAAoB,GAAG,KAAK,IAA0B,EAAE;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,IAAI,MAAM,GAAkB,IAAI,CAAC;IACjC,SAAS,CAAC;QACR,MAAM,IAAI,GAA4B;YACpC,MAAM,EAAE;gBACN,IAAI,EAAE;oBACJ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE;oBAC7C,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;oBAC7C,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,eAAe,EAAE,EAAE;iBACtC;aACF;YACD,KAAK,EAAE,GAAG;YACV,YAAY,EAAE,EAAE,OAAO,EAAE,CAAC,aAAa,EAAE,WAAW,CAAC,EAAE;SACxD,CAAC;QACF,IAAI,MAAM;YAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAEjC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,aAAa,CACvC,MAAM,EACN,gBAAgB,MAAM,CAAC,UAAU,gBAAgB,EACjD,IAAI,CAML,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,EAAE,CAAC;QAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAE/B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,WAAW,CAAC;YACrC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,SAAS,CAAC;YACjC,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,IAAI,IAAI,CAAC;QACjD,IAAI,CAAC,MAAM;YAAE,MAAM;IACrB,CAAC;IAED,KAAK,CAAC,OAAO,EAAE,cAAc,QAAQ,CAAC,IAAI,qCAAqC,CAAC,CAAC;IACjF,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,iBAAiB,GAAG,KAAK,EAC7B,OAAiB,EACkD,EAAE;IACrE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,aAAa,CACvC,MAAM,EACN,gBAAgB,MAAM,CAAC,UAAU,SAAS,EAC1C,EAAE,GAAG,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,OAAO,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE,CACoB,CAAC;IAE3F,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACtC,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,IAAI,EAAE;QAClC,QAAQ,EAAE,EAAE,CAAC,OAAO,EAAE,QAAQ,IAAI,EAAE;KACrC,CAAC,CAAC,CAAC;AACN,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,aAAa,GAAG,KAAK,EACzB,OAAe,EACf,OAAe,EACf,WAAyD,EACN,EAAE;IACrD,MAAM,SAAS,GAAG,WAAW;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;SACvD,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,GAAG,GAAG,MAAM,cAAc,CAAC;QAC/B,QAAQ,EAAE;YACR;gBACE,IAAI,EAAE,QAAQ;gBACd,OAAO,EAAE;;;;0EAIyD;aACnE;YACD;gBACE,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,cAAc,OAAO;aACzB,OAAO;gBACJ,WAAW,CAAC,MAAM;EAChC,SAAS;;2DAEgD;aACpD;SACF;QACD,WAAW,EAAE,GAAG;QAChB,UAAU,EAAE,GAAG;KAChB,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAEtB,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAA+C,CAAC;QACjF,IAAI,CAAC,MAAM,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,GAAG,OAAO,IAAI,MAAM,CAAC,IAAI,IAAI,OAAO,EAAE,EAAE,CAAC;IAClG,CAAC;IAAC,MAAM,CAAC;QACP,KAAK,CAAC,MAAM,EAAE,+CAA+C,OAAO,IAAI,OAAO,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACzG,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAG,KAAK,EACzB,OAAe,EACf,OAAe,EACf,YAAoB,EACpB,OAAe,EACf,aAAuB,EACN,EAAE;IACnB,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;SAC9B,MAAM,CAAC,mBAAmB,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,YAAY,EAAE,CAAC;SACtE,MAAM,CAAC,KAAK,CAAC,CAAC;IAEjB,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC;QAChC,OAAO;QACP,QAAQ,EAAE,MAAM,EAAK,uCAAuC;QAC5D,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,UAAU;QAChB,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;QAC5B,MAAM,EAAE,QAAQ;QAChB,UAAU,EAAE,GAAG;QACf,UAAU,EAAE,GAAG;QACf,YAAY,EAAE,IAAI;QAClB,QAAQ,EAAE;YACR,aAAa,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAClD,iBAAiB,EAAE,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC;SAChD;QACD,QAAQ,EAAE;YACR,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,YAAY;YAClB,EAAE,EAAE,OAAO;SACZ;KACF,CAAC,CAAC;IAEH,KAAK,CAAC,MAAM,EAAE,uBAAuB,OAAO,MAAM,YAAY,MAAM,OAAO,SAAS,EAAE,GAAG,CAAC,CAAC;IAC3F,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAEF,gFAAgF;AAEhF,MAAM,IAAI,GAAG,KAAK,EAAE,MAAmB,EAAiB,EAAE;IACxD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE;QAAE,OAAO;IAC9B,IAAI,MAAM,CAAC,MAAM,CAAC,0BAA0B,KAAK,KAAK;QAAE,OAAO;IAE/D,iBAAiB,EAAE,CAAC;IACpB,IAAI,iBAAiB,GAAG,aAAa,KAAK,CAAC;QAAE,OAAO;IAEpD,KAAK,CAAC,OAAO,EAAE,qCAAqC,CAAC,CAAC;IAEtD,IAAI,CAAC;QACH,6BAA6B;QAC7B,MAAM,KAAK,GAAG,MAAM,oBAAoB,EAAE,CAAC;QAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,CAAC,OAAO,EAAE,mDAAmD,CAAC,CAAC;YACpE,OAAO;QACT,CAAC;QAED,gDAAgD;QAChD,MAAM,QAAQ,GAAG,MAAM,oBAAoB,EAAE,CAAC;QAE9C,6CAA6C;QAC7C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnF,KAAK,CAAC,OAAO,EAAE,cAAc,UAAU,CAAC,MAAM,qBAAqB,KAAK,CAAC,MAAM,yBAAyB,CAAC,CAAC;QAE1G,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEpC,0CAA0C;QAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACjE,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,iBAAiB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBACzD,IAAI,KAAK,CAAC,MAAM,GAAG,gBAAgB;oBAAE,SAAS;gBAE9C,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBAChF,IAAI,CAAC,MAAM;oBAAE,SAAS;gBAEtB,6BAA6B;gBAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;qBAC9B,MAAM,CAAC,mBAAmB,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;qBACzF,MAAM,CAAC,KAAK,CAAC,CAAC;gBACjB,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC5D,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;oBAC5B,KAAK,CAAC,OAAO,EAAE,iCAAiC,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;oBAC1F,SAAS;gBACX,CAAC;gBAED,MAAM,aAAa,CACjB,SAAS,CAAC,OAAO,EACjB,SAAS,CAAC,OAAO,EACjB,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,OAAO,EACd,SAAS,CAAC,OAAO,CAClB,CAAC;gBACF,QAAQ,EAAE,CAAC;YACb,CAAC;YAAC,OAAO,CAAU,EAAE,CAAC;gBACpB,KAAK,CAAC,MAAM,EAAE,8BAA8B,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,KAAM,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;YACjH,CAAC;QACH,CAAC;QAED,KAAK,CAAC,MAAM,EAAE,yCAAyC,QAAQ,uBAAuB,UAAU,CAAC,MAAM,aAAa,CAAC,CAAC;IACxH,CAAC;IAAC,OAAO,CAAU,EAAE,CAAC;QACpB,KAAK,CAAC,OAAO,EAAE,sCAAuC,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;IAC/E,CAAC;AACH,CAAC,CAAC;AAEF,iCAAiC;AACjC,MAAM,MAAM,GAAG,GAAS,EAAE;IACxB,iBAAiB,GAAG,CAAC,CAAC;AACxB,CAAC,CAAC;AAEF,OAAO,EACL,IAAI,EACJ,SAAS,EACT,MAAM;AACN,uBAAuB;AACvB,oBAAoB,EACpB,oBAAoB,EACpB,aAAa,EACb,aAAa,EACb,OAAO,GACR,CAAC"}

package/dist/daemon/staleness.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Staleness scanner — queries Qdrant for facts that haven't been verified
+ * within the configured threshold and logs stale facts.
+ *
+ * Deduplication: tracks the last set of stale fact IDs.
+ * If the same set is found again, skips to prevent log flooding.
+ */
+import type { BikkyConfig } from "../config.js";
+import type { LogFn, QdrantScrollFilters, QdrantScrollResult } from "./qdrant.js";
+/** Dependencies injectable for testing. */
+export interface StaleDeps {
+    isReady: () => boolean;
+    scrollFacts: (filters?: QdrantScrollFilters, limit?: number) => Promise<QdrantScrollResult[]>;
+}
+/**
+ * Scan for stale facts via direct Qdrant scroll query.
+ * Finds facts in configured categories whose last_reinforced_at is older than threshold.
+ * Logs stale facts instead of writing to inbox.
+ */
+export declare const scanStaleFacts: (config: BikkyConfig, deps?: StaleDeps) => Promise<void>;
+/** Reset dedup state (for testing). */
+export declare const _resetDedup: () => void;
+export declare const setLogger: (log: LogFn) => void;
+//# sourceMappingURL=staleness.d.ts.map

package/dist/daemon/staleness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"staleness.d.ts","sourceRoot":"","sources":["../../src/daemon/staleness.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAOlF,2CAA2C;AAC3C,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,OAAO,CAAC;IACvB,WAAW,EAAE,CAAC,OAAO,CAAC,EAAE,mBAAmB,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;CAC/F;AAOD;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAU,QAAQ,WAAW,EAAE,OAAM,SAAuB,KAAG,OAAO,CAAC,IAAI,CA0CrG,CAAC;AAEF,uCAAuC;AACvC,eAAO,MAAM,WAAW,QAAO,IAA8B,CAAC;AAE9D,eAAO,MAAM,SAAS,GAAI,KAAK,KAAK,KAAG,IAAwB,CAAC"}

package/dist/daemon/staleness.js

@@ -0,0 +1,63 @@
+/**
+ * Staleness scanner — queries Qdrant for facts that haven't been verified
+ * within the configured threshold and logs stale facts.
+ *
+ * Deduplication: tracks the last set of stale fact IDs.
+ * If the same set is found again, skips to prevent log flooding.
+ */
+import * as qdrantMod from "./qdrant.js";
+let logFn = console.log;
+/** Track the last stale fact IDs to avoid duplicate logging. */
+let lastStaleIds = "";
+const defaultDeps = {
+    isReady: qdrantMod.isReady,
+    scrollFacts: qdrantMod.scrollFacts,
+};
+/**
+ * Scan for stale facts via direct Qdrant scroll query.
+ * Finds facts in configured categories whose last_reinforced_at is older than threshold.
+ * Logs stale facts instead of writing to inbox.
+ */
+export const scanStaleFacts = async (config, deps = defaultDeps) => {
+    const threshold = config.daemon.staleness_threshold_days || 30;
+    const categories = ["infrastructure", "projects", "decisions"];
+    const limit = 3;
+    if (!deps.isReady()) {
+        logFn("DEBUG", "Staleness scan: Qdrant client not ready, skipping");
+        return;
+    }
+    const cutoff = new Date();
+    cutoff.setDate(cutoff.getDate() - threshold);
+    const cutoffISO = cutoff.toISOString();
+    logFn("DEBUG", `Staleness scan: checking ${categories.join(",")} older than ${threshold} days`);
+    try {
+        const staleFacts = await deps.scrollFacts({
+            categories,
+            olderThan: cutoffISO,
+        }, limit);
+        if (staleFacts.length > 0) {
+            // Deduplicate: only log if the set of stale fact IDs has changed
+            const currentIds = staleFacts.map((f) => f.id).sort().join(",");
+            if (currentIds === lastStaleIds) {
+                logFn("DEBUG", `Staleness scan: same ${staleFacts.length} fact(s) still stale, skipping duplicate log`);
+                return;
+            }
+            lastStaleIds = currentIds;
+            for (const f of staleFacts) {
+                logFn("INFO", `Stale fact [${f.category}] (${f.id}): "${f.content.slice(0, 80)}" — last reinforced: ${f.last_reinforced_at}`);
+            }
+            logFn("INFO", `Staleness scan: found ${staleFacts.length} stale fact(s)`);
+        }
+        else {
+            lastStaleIds = "";
+            logFn("DEBUG", "Staleness scan: no stale facts found");
+        }
+    }
+    catch (e) {
+        logFn("WARN", `Staleness scan failed: ${e.message}`);
+    }
+};
+/** Reset dedup state (for testing). */
+export const _resetDedup = () => { lastStaleIds = ""; };
+export const setLogger = (log) => { logFn = log; };
+//# sourceMappingURL=staleness.js.map

package/dist/daemon/staleness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"staleness.js","sourceRoot":"","sources":["../../src/daemon/staleness.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,SAAS,MAAM,aAAa,CAAC;AAIzC,IAAI,KAAK,GAAU,OAAO,CAAC,GAAuB,CAAC;AAEnD,gEAAgE;AAChE,IAAI,YAAY,GAAW,EAAE,CAAC;AAQ9B,MAAM,WAAW,GAAc;IAC7B,OAAO,EAAE,SAAS,CAAC,OAAO;IAC1B,WAAW,EAAE,SAAS,CAAC,WAAW;CACnC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,KAAK,EAAE,MAAmB,EAAE,OAAkB,WAAW,EAAiB,EAAE;IACxG,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,EAAE,CAAC;IAC/D,MAAM,UAAU,GAAG,CAAC,gBAAgB,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,CAAC,CAAC;IAEhB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QACpB,KAAK,CAAC,OAAO,EAAE,mDAAmD,CAAC,CAAC;QACpE,OAAO;IACT,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;IAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IAEvC,KAAK,CAAC,OAAO,EAAE,4BAA4B,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,SAAS,OAAO,CAAC,CAAC;IAEhG,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC;YACxC,UAAU;YACV,SAAS,EAAE,SAAS;SACrB,EAAE,KAAK,CAAC,CAAC;QAEV,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,iEAAiE;YACjE,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChE,IAAI,UAAU,KAAK,YAAY,EAAE,CAAC;gBAChC,KAAK,CAAC,OAAO,EAAE,wBAAwB,UAAU,CAAC,MAAM,8CAA8C,CAAC,CAAC;gBACxG,OAAO;YACT,CAAC;YACD,YAAY,GAAG,UAAU,CAAC;YAE1B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,KAAK,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,wBAAwB,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC;YAChI,CAAC;YACD,KAAK,CAAC,MAAM,EAAE,yBAAyB,UAAU,CAAC,MAAM,gBAAgB,CAAC,CAAC;QAC5E,CAAC;aAAM,CAAC;YACN,YAAY,GAAG,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,EAAE,sCAAsC,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,KAAK,CAAC,MAAM,EAAE,0BAA2B,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;IAClE,CAAC;AACH,CAAC,CAAC;AAEF,uCAAuC;AACvC,MAAM,CAAC,MAAM,WAAW,GAAG,GAAS,EAAE,GAAG,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAE9D,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,GAAU,EAAQ,EAAE,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC"}

package/dist/daemon/watcher.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Copilot session watcher — detects active sessions by scanning
+ * ~/.copilot/session-state/ for directories with events.jsonl files.
+ */
+export interface WatchedSession {
+    uuid: string;
+    eventsPath: string;
+    active: boolean;
+}
+export declare function discoverSessions(): WatchedSession[];
+//# sourceMappingURL=watcher.d.ts.map

package/dist/daemon/watcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"watcher.d.ts","sourceRoot":"","sources":["../../src/daemon/watcher.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,wBAAgB,gBAAgB,IAAI,cAAc,EAAE,CA8BnD"}

package/dist/daemon/watcher.js

@@ -0,0 +1,38 @@
+/**
+ * Copilot session watcher — detects active sessions by scanning
+ * ~/.copilot/session-state/ for directories with events.jsonl files.
+ */
+import fs from "node:fs";
+import path from "node:path";
+import { loadConfig } from "../config.js";
+export function discoverSessions() {
+    const cfg = loadConfig();
+    const baseDir = cfg.watchers.copilot.path;
+    if (!fs.existsSync(baseDir))
+        return [];
+    const sessions = [];
+    for (const entry of fs.readdirSync(baseDir)) {
+        const sessionDir = path.join(baseDir, entry);
+        const eventsPath = path.join(sessionDir, "events.jsonl");
+        let isDir = false;
+        try {
+            isDir = fs.statSync(sessionDir).isDirectory();
+        }
+        catch {
+            continue;
+        }
+        if (!isDir)
+            continue;
+        if (!fs.existsSync(eventsPath))
+            continue;
+        // Check for active lock files
+        const lockFiles = fs.readdirSync(sessionDir).filter((f) => f.startsWith("inuse.") && f.endsWith(".lock"));
+        sessions.push({
+            uuid: entry,
+            eventsPath,
+            active: lockFiles.length > 0,
+        });
+    }
+    return sessions;
+}
+//# sourceMappingURL=watcher.js.map

package/dist/daemon/watcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"watcher.js","sourceRoot":"","sources":["../../src/daemon/watcher.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAQ1C,MAAM,UAAU,gBAAgB;IAC9B,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;IAC1C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QAEzD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,IAAI,CAAC;YACH,KAAK,GAAG,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,CAAC;QAChD,CAAC;QAAC,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;QACrB,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC;YAAE,SAAS;QAEzC,8BAA8B;QAC9B,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,MAAM,CACjD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CACrD,CAAC;QAEF,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,KAAK;YACX,UAAU;YACV,MAAM,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC;SAC7B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/daemon/watcher.test.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Tests for the session watcher.
+ *
+ * Creates a temporary directory structure mimicking ~/.copilot/session-state/
+ * and verifies discoverSessions() behavior.
+ */
+export {};
+//# sourceMappingURL=watcher.test.d.ts.map

package/dist/daemon/watcher.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"watcher.test.d.ts","sourceRoot":"","sources":["../../src/daemon/watcher.test.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}