@jmtrin/opencode-kevin 0.6.0 → 0.7.0

package/dist/migrations/008_v07_truth.sql

@@ -0,0 +1,124 @@
+-- ============================================================
+-- Kevin 0.7.0 — Migration 008: Project Truth (additive)
+-- ============================================================
+-- Backward-compatible, additive only. Two new tables, two new
+-- nullable/defaulted columns on `memories`, one index, five
+-- metric seeds, four setting seeds. NO table rebuild: nothing
+-- here widens a CHECK constraint on an existing table.
+--
+-- Section 1: repo_facts — the ground-truth store.
+-- Section 2: memory_conflicts — surfaced, never auto-resolved.
+-- Section 3: memories truth columns.
+-- Section 4: metric seeds.
+-- Section 5: setting seeds.
+-- Section 6: schema_version.
+-- ============================================================
+
+-- ------------------------------------------------------------
+-- 1. repo_facts — facts extracted from package.json and
+--    tsconfig.json. Both are JSON, parsed with JSON.parse; this
+--    release adds NO parser and NO runtime dependency.
+--
+--    The UNIQUE index INCLUDES project_id and that is load-
+--    bearing (D7-02). Kevin's DB is global
+--    (~/.opencode-kevin/kevin.db, projectId =
+--    fingerprint(process.cwd())). Without project_id, project A's
+--    packageManager=npm would overwrite project B's
+--    packageManager=pnpm and contradictions() would then flag A's
+--    memories against B's repository.
+--
+--    source_mtime lets scan() skip re-parsing an unchanged file.
+-- ------------------------------------------------------------
+CREATE TABLE IF NOT EXISTS repo_facts (
+  id           TEXT PRIMARY KEY,
+  project_id   TEXT NOT NULL,
+  file         TEXT NOT NULL,
+  key_path     TEXT NOT NULL,
+  value        TEXT NOT NULL,
+  fingerprint  TEXT NOT NULL,
+  source_mtime TEXT,
+  scanned_at   TEXT NOT NULL DEFAULT (datetime('now'))
+);
+CREATE UNIQUE INDEX IF NOT EXISTS uq_repo_facts    ON repo_facts(project_id, file, key_path);
+CREATE INDEX        IF NOT EXISTS idx_repo_facts_fp ON repo_facts(fingerprint);
+
+-- ------------------------------------------------------------
+-- 2. memory_conflicts — detection only. status moves
+--    open → acknowledged → resolved, and ONLY the kevin_conflicts
+--    tool may move it to 'resolved' (D7-06). No session.idle path
+--    writes 'resolved'.
+--
+--    memory_a / memory_b / fact_id carry NO REFERENCES clause on
+--    purpose: Store sets PRAGMA foreign_keys = ON, and a hard FK
+--    would block deleting a memory that participates in a
+--    conflict.
+-- ------------------------------------------------------------
+CREATE TABLE IF NOT EXISTS memory_conflicts (
+  id          TEXT PRIMARY KEY,
+  project_id  TEXT NOT NULL,
+  memory_a    TEXT NOT NULL,
+  memory_b    TEXT,
+  fact_id     TEXT,
+  kind        TEXT NOT NULL CHECK (kind IN ('repo_truth','decision_pair','temporal')),
+  detail      TEXT,
+  status      TEXT NOT NULL DEFAULT 'open' CHECK (status IN ('open','acknowledged','resolved')),
+  detected_at TEXT NOT NULL DEFAULT (datetime('now')),
+  resolved_at TEXT
+);
+
+CREATE INDEX IF NOT EXISTS idx_conflicts_status ON memory_conflicts(status);
+CREATE INDEX IF NOT EXISTS idx_conflicts_memory ON memory_conflicts(memory_a);
+
+-- ------------------------------------------------------------
+-- 3. memories: the de-ranking column and its timestamp.
+--
+--    truth_penalty is clamped by application code to [0, 0.5] and
+--    multiplies rankScore as (1 - truth_penalty), AFTER the
+--    existing BM25 × origin_boost × recency_decay chain. At 0.0
+--    the v0.6.0 ranking is reproduced exactly (D7-04).
+--
+--    There is deliberately no status transition here. Contra-
+--    diction de-ranks; it never deletes (Principle 24, D7-03).
+-- ------------------------------------------------------------
+ALTER TABLE memories ADD COLUMN truth_penalty   REAL NOT NULL DEFAULT 0.0;
+ALTER TABLE memories ADD COLUMN contradicted_at TEXT;
+
+CREATE INDEX IF NOT EXISTS idx_memories_truth_penalty ON memories(truth_penalty);
+
+-- ------------------------------------------------------------
+-- 4. Metric seeds. Order matches the additions to METRIC_KEYS
+--    in metrics.ts (28 → 33).
+-- ------------------------------------------------------------
+INSERT OR IGNORE INTO kevin_metrics (key, value) VALUES
+  ('repo_facts_scanned',       0),
+  ('memories_contradicted',    0),
+  ('conventions_mined',        0),
+  ('conflicts_detected',       0),
+  ('error_lessons_suppressed', 0);
+
+-- ------------------------------------------------------------
+-- 5. Setting seeds. Values are TEXT, always. Read them with an
+--    explicit string comparison or an explicit Number() parse —
+--    never `=== 1`, and never for truthiness.
+--
+--    error_lesson_mode is a TEXT ENUM ('all' | 'triage_only').
+--    `if (mode)` is true for BOTH values and would put every
+--    installation into triage mode on upgrade. Compare with
+--    === "triage_only" (D7-12). Defaults to 'all', preserving
+--    v0.6.0 behaviour exactly.
+--
+--    The three feature flags default to '0' (off): a release that
+--    changes nothing until asked must not silently start scanning
+--    the repository or mining conventions on upgrade. They are
+--    opted into explicitly. (Task K7-001 / plan §5 & §12.)
+-- ------------------------------------------------------------
+INSERT OR IGNORE INTO kevin_settings (key, value) VALUES
+  ('repo_truth_enabled',         '0'),
+  ('convention_mining_enabled',  '0'),
+  ('conflict_detection_enabled', '0'),
+  ('error_lesson_mode',          'all');
+
+-- ------------------------------------------------------------
+-- 6. Version marker.
+-- ------------------------------------------------------------
+INSERT OR IGNORE INTO schema_version (version) VALUES ('008');

package/dist/plugin/ConflictDetector.d.ts

@@ -0,0 +1,35 @@
+import type { MemoryService } from "./MemoryService.js";
+import type { RepoTruth } from "./RepoTruth.js";
+import type { Store } from "./Store.js";
+import type { Metrics } from "./metrics.js";
+export type ConflictKind = "repo_truth" | "decision_pair" | "temporal";
+export interface Conflict {
+    readonly id: string;
+    readonly kind: ConflictKind;
+    readonly memoryA: string;
+    readonly memoryB?: string;
+    readonly factId?: string;
+    readonly detail: string;
+}
+export interface RepoTruthConflictInput {
+    readonly memoryId: string;
+    readonly factId?: string | null;
+    readonly reasons: readonly string[];
+}
+export declare class ConflictDetector {
+    private readonly store;
+    private readonly projectId;
+    private readonly repoTruth?;
+    private readonly memoryService?;
+    private readonly metrics;
+    constructor(store: Store, projectId: string, metrics?: Metrics | null, repoTruth?: RepoTruth | undefined, memoryService?: MemoryService | undefined);
+    detect(repoTruthInput?: readonly RepoTruthConflictInput[]): Conflict[];
+    acknowledge(id: string): void;
+    /** Human-only operation. It resolves the conflict row, never a memory. */
+    resolve(id: string, keepMemoryId: string): void;
+    private detectRepoTruth;
+    private repoTruthInputs;
+    private detectDecisionPairs;
+    private detectTemporal;
+    private insertIfNew;
+}

package/dist/plugin/ConflictDetector.js

@@ -0,0 +1,283 @@
+import { normalize } from "./fingerprint.js";
+import { uuidv7 } from "./uuid.js";
+const POLARITY_RULES = [
+    {
+        positive: ["use"],
+        negative: [
+            ["do", "not", "use"],
+            ["don't", "use"],
+            ["never", "use"],
+        ],
+    },
+    { positive: ["always"], negative: [["never"]] },
+    { positive: ["required"], negative: [["forbidden"], ["not", "required"]] },
+    { positive: ["enable"], negative: [["disable"]] },
+    { positive: ["prefer"], negative: [["avoid"]] },
+];
+const STOP_WORDS = new Set([
+    "a",
+    "an",
+    "and",
+    "are",
+    "as",
+    "at",
+    "be",
+    "by",
+    "for",
+    "from",
+    "in",
+    "is",
+    "it",
+    "of",
+    "on",
+    "or",
+    "that",
+    "the",
+    "this",
+    "to",
+    "with",
+    "we",
+    "when",
+    "where",
+    "you",
+]);
+const POLARITY_WORDS = new Set([
+    "use",
+    "do",
+    "not",
+    // "don't" tokenizes to ["don", "t"] (see tokens()); the lexicon phrase
+    // ["don't","use"] is matched by tokenizing the phrase the same way, so
+    // both fragments must be excluded from subjects() too (K7-014).
+    "don",
+    "t",
+    "never",
+    "always",
+    "required",
+    "forbidden",
+    "enable",
+    "disable",
+    "prefer",
+    "avoid",
+]);
+export class ConflictDetector {
+    store;
+    projectId;
+    repoTruth;
+    memoryService;
+    metrics;
+    constructor(store, projectId, metrics, repoTruth, memoryService) {
+        this.store = store;
+        this.projectId = projectId;
+        this.repoTruth = repoTruth;
+        this.memoryService = memoryService;
+        this.metrics = metrics ?? null;
+    }
+    detect(repoTruthInput) {
+        const detected = [];
+        detected.push(...this.detectRepoTruth(repoTruthInput));
+        detected.push(...this.detectDecisionPairs());
+        detected.push(...this.detectTemporal());
+        return detected;
+    }
+    acknowledge(id) {
+        this.store
+            .prepare("UPDATE memory_conflicts SET status = 'acknowledged' WHERE id = ? AND project_id = ? AND status = 'open'")
+            .run(id, this.projectId);
+    }
+    /** Human-only operation. It resolves the conflict row, never a memory. */
+    resolve(id, keepMemoryId) {
+        const row = this.store
+            .prepare(`SELECT memory_a, memory_b FROM memory_conflicts
+				 WHERE id = ? AND project_id = ? AND status <> 'resolved'`)
+            .get(id, this.projectId);
+        if (!row)
+            throw new Error(`conflict not found: ${id}`);
+        if (keepMemoryId !== row.memory_a && keepMemoryId !== row.memory_b) {
+            throw new Error("keep must identify one of the conflict memories");
+        }
+        this.store
+            .prepare("UPDATE memory_conflicts SET status = 'resolved', resolved_at = datetime('now') WHERE id = ? AND project_id = ?")
+            .run(id, this.projectId);
+    }
+    detectRepoTruth(input) {
+        const items = input ?? this.repoTruthInputs();
+        const out = [];
+        for (const item of items) {
+            for (const reason of item.reasons) {
+                this.memoryService?.applyTruthPenalty(item.memoryId, 0.5, reason);
+                const id = this.insertIfNew({
+                    kind: "repo_truth",
+                    memoryA: item.memoryId,
+                    memoryB: null,
+                    factId: item.factId ?? null,
+                    detail: reason,
+                });
+                if (id)
+                    out.push({
+                        id,
+                        kind: "repo_truth",
+                        memoryA: item.memoryId,
+                        factId: item.factId ?? undefined,
+                        detail: reason,
+                    });
+            }
+        }
+        // v0.7.0 (D7-03) — "recoverable by re-scanning": a memory whose
+        // contradiction has lapsed (the repo no longer contradicts it) is
+        // de-ranked no longer. The conflict row stays open — resolution is
+        // human-initiated only (D7-06) — but the score penalty lifts, so
+        // fixing the repo genuinely recovers the memory. Runs only on the
+        // production path (no explicit input): explicit-input callers control
+        // every write themselves.
+        if (!input && this.repoTruth && this.memoryService) {
+            const penalized = this.store
+                .prepare("SELECT id FROM memories WHERE project_id = ? AND truth_penalty > 0 AND status = 'active'")
+                .all(this.projectId);
+            for (const row of penalized) {
+                const memory = this.memoryService.getById(row.id);
+                if (!memory)
+                    continue;
+                if ((this.repoTruth.contradictions(memory) ?? []).length === 0) {
+                    this.memoryService.applyTruthPenalty(row.id, 0, "");
+                }
+            }
+        }
+        return out;
+    }
+    repoTruthInputs() {
+        if (!this.repoTruth)
+            return [];
+        const rows = this.store
+            .prepare(`SELECT id, type, content, scope, relevance_score, source_tool,
+				 source_session, metadata, created_at, updated_at, expires_at,
+				 project_id, fingerprint, origin, evidence_count, last_verified_at,
+				 status, fix_args, ignored, superseded_by, feedback_positive,
+				 feedback_negative, curated, curated_at, inferable,
+				 truth_penalty, contradicted_at
+				 FROM memories WHERE project_id = ? AND status = 'active'`)
+            .all(this.projectId);
+        return rows.flatMap((row) => {
+            const memory = row;
+            const reasons = this.repoTruth?.contradictions(memory) ?? [];
+            return reasons.length > 0 ? [{ memoryId: row.id, reasons }] : [];
+        });
+    }
+    detectDecisionPairs() {
+        const rows = this.store
+            .prepare(`SELECT id, type, content, fingerprint FROM memories
+				 WHERE project_id = ? AND status = 'active'
+				 AND type IN ('decision', 'rule') ORDER BY id`)
+            .all(this.projectId);
+        const out = [];
+        for (let i = 0; i < rows.length; i++) {
+            for (let j = i + 1; j < rows.length; j++) {
+                const a = rows[i];
+                const b = rows[j];
+                if (!a || !b || a.fingerprint === b.fingerprint)
+                    continue;
+                const pair = oppositePair(a.content, b.content);
+                if (!pair)
+                    continue;
+                const id = this.insertIfNew({
+                    kind: "decision_pair",
+                    memoryA: a.id,
+                    memoryB: b.id,
+                    factId: null,
+                    detail: pair,
+                });
+                if (id)
+                    out.push({
+                        id,
+                        kind: "decision_pair",
+                        memoryA: a.id,
+                        memoryB: b.id,
+                        detail: pair,
+                    });
+            }
+        }
+        return out;
+    }
+    detectTemporal() {
+        const rows = this.store
+            .prepare(`SELECT m.id,
+				 MAX(CASE WHEN i.outcome = 'effective' THEN i.injected_at END) AS effective_at,
+				 MAX(CASE WHEN i.outcome = 'ineffective' THEN i.injected_at END) AS ineffective_at
+				 FROM memories m JOIN kevin_injections i ON i.memory_id = m.id
+				 WHERE m.project_id = ? AND m.status = 'active'
+				 GROUP BY m.id
+				 HAVING effective_at IS NOT NULL AND ineffective_at IS NOT NULL
+				 AND ineffective_at > effective_at`)
+            .all(this.projectId);
+        const out = [];
+        for (const row of rows) {
+            const detail = `memory was effective at ${row.effective_at} and became ineffective at ${row.ineffective_at}`;
+            const id = this.insertIfNew({
+                kind: "temporal",
+                memoryA: row.id,
+                memoryB: null,
+                factId: null,
+                detail,
+            });
+            if (id)
+                out.push({ id, kind: "temporal", memoryA: row.id, detail });
+        }
+        return out;
+    }
+    insertIfNew(input) {
+        const existing = this.store
+            .prepare(`SELECT id FROM memory_conflicts
+				 WHERE project_id = ? AND kind = ? AND memory_a = ?
+				 AND (memory_b IS ? OR (memory_b IS NULL AND ? IS NULL))
+				 AND (fact_id IS ? OR (fact_id IS NULL AND ? IS NULL))
+				 AND status = 'open' LIMIT 1`)
+            .get(this.projectId, input.kind, input.memoryA, input.memoryB, input.memoryB, input.factId, input.factId);
+        if (existing)
+            return null;
+        const id = uuidv7();
+        this.store
+            .prepare(`INSERT INTO memory_conflicts
+				 (id, project_id, memory_a, memory_b, fact_id, kind, detail)
+				 VALUES (?, ?, ?, ?, ?, ?, ?)`)
+            .run(id, this.projectId, input.memoryA, input.memoryB, input.factId, input.kind, input.detail);
+        this.metrics?.incr("conflicts_detected", 1);
+        return id;
+    }
+}
+function tokens(text) {
+    return normalize(text).match(/[a-z0-9@._/-]+/g) ?? [];
+}
+function hasPhrase(words, phrase) {
+    if (phrase.length === 1)
+        return words.includes(phrase[0] ?? "");
+    for (let i = 0; i <= words.length - phrase.length; i++) {
+        if (phrase.every((word, offset) => words[i + offset] === word))
+            return true;
+    }
+    return false;
+}
+function polarity(text, rule) {
+    const words = tokens(text);
+    // Lexicon phrases are run through the same tokenizer as the text: "don't
+    // use" → ["don","t","use"], which is exactly how the text's own apostrophe
+    // is split, so a phrase never becomes unreachable (K7-014).
+    const match = (phrase) => hasPhrase(words, tokens(phrase.join(" ")));
+    const negative = rule.negative.some(match);
+    return { positive: !negative && match(rule.positive), negative };
+}
+function subjects(text) {
+    return new Set(tokens(text).filter((token) => !STOP_WORDS.has(token) && !POLARITY_WORDS.has(token)));
+}
+function oppositePair(a, b) {
+    const shared = [...subjects(a)].some((token) => subjects(b).has(token));
+    if (!shared)
+        return null;
+    for (const rule of POLARITY_RULES) {
+        const pa = polarity(a, rule);
+        const pb = polarity(b, rule);
+        if ((pa.positive && pb.negative) || (pa.negative && pb.positive)) {
+            return `statements carry opposite ${rule.positive.join(" ")} polarity for shared subject ${shared}`;
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=ConflictDetector.js.map

package/dist/plugin/ConflictDetector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConflictDetector.js","sourceRoot":"","sources":["../../plugin/ConflictDetector.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAE7C,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAyCnC,MAAM,cAAc,GAA4B;IAC/C;QACC,QAAQ,EAAE,CAAC,KAAK,CAAC;QACjB,QAAQ,EAAE;YACT,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;YACpB,CAAC,OAAO,EAAE,KAAK,CAAC;YAChB,CAAC,OAAO,EAAE,KAAK,CAAC;SAChB;KACD;IACD,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE;IAC/C,EAAE,QAAQ,EAAE,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE;IAC1E,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE;IACjD,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE;CAC/C,CAAC;AAEF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IAC1B,GAAG;IACH,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,KAAK;CACL,CAAC,CAAC;AAEH,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;IAC9B,KAAK;IACL,IAAI;IACJ,KAAK;IACL,uEAAuE;IACvE,uEAAuE;IACvE,gEAAgE;IAChE,KAAK;IACL,GAAG;IACH,OAAO;IACP,QAAQ;IACR,UAAU;IACV,WAAW;IACX,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,OAAO;CACP,CAAC,CAAC;AAEH,MAAM,OAAO,gBAAgB;IAIV;IACA;IAEA;IACA;IAPD,OAAO,CAAiB;IAEzC,YACkB,KAAY,EACZ,SAAiB,EAClC,OAAwB,EACP,SAAqB,EACrB,aAA6B;QAJ7B,UAAK,GAAL,KAAK,CAAO;QACZ,cAAS,GAAT,SAAS,CAAQ;QAEjB,cAAS,GAAT,SAAS,CAAY;QACrB,kBAAa,GAAb,aAAa,CAAgB;QAE9C,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC;IAChC,CAAC;IAED,MAAM,CAAC,cAAkD;QACxD,MAAM,QAAQ,GAAe,EAAE,CAAC;QAChC,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC;QACvD,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;QACxC,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,WAAW,CAAC,EAAU;QACrB,IAAI,CAAC,KAAK;aACR,OAAO,CACP,yGAAyG,CACzG;aACA,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IAED,0EAA0E;IAC1E,OAAO,CAAC,EAAU,EAAE,YAAoB;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK;aACpB,OAAO,CACP;8DAC0D,CAC1D;aACA,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,CAEZ,CAAC;QACb,IAAI,CAAC,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,EAAE,EAAE,CAAC,CAAC;QACvD,IAAI,YAAY,KAAK,GAAG,CAAC,QAAQ,IAAI,YAAY,KAAK,GAAG,CAAC,QAAQ,EAAE,CAAC;YACpE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,KAAK;aACR,OAAO,CACP,gHAAgH,CAChH;aACA,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IAEO,eAAe,CACtB,KAAyC;QAEzC,MAAM,KAAK,GAAG,KAAK,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,CAAC,aAAa,EAAE,iBAAiB,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;gBAClE,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;oBAC3B,IAAI,EAAE,YAAY;oBAClB,OAAO,EAAE,IAAI,CAAC,QAAQ;oBACtB,OAAO,EAAE,IAAI;oBACb,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI;oBAC3B,MAAM,EAAE,MAAM;iBACd,CAAC,CAAC;gBACH,IAAI,EAAE;oBACL,GAAG,CAAC,IAAI,CAAC;wBACR,EAAE;wBACF,IAAI,EAAE,YAAY;wBAClB,OAAO,EAAE,IAAI,CAAC,QAAQ;wBACtB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,SAAS;wBAChC,MAAM,EAAE,MAAM;qBACd,CAAC,CAAC;YACL,CAAC;QACF,CAAC;QACD,gEAAgE;QAChE,kEAAkE;QAClE,mEAAmE;QACnE,iEAAiE;QACjE,kEAAkE;QAClE,sEAAsE;QACtE,0BAA0B;QAC1B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK;iBAC1B,OAAO,CACP,0FAA0F,CAC1F;iBACA,GAAG,CAAC,IAAI,CAAC,SAAS,CAAqB,CAAC;YAC1C,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClD,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACtB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAChE,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACrD,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAEO,eAAe;QACtB,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;aACrB,OAAO,CACP;;;;;;8DAM0D,CAC1D;aACA,GAAG,CAAC,IAAI,CAAC,SAAS,CAMnB,CAAC;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,GAAwB,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7D,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,CAAC,CAAC,CAAC;IACJ,CAAC;IAEO,mBAAmB;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;aACrB,OAAO,CACP;;kDAE8C,CAC9C;aACA,GAAG,CAAC,IAAI,CAAC,SAAS,CAAgB,CAAC;QACrC,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW;oBAAE,SAAS;gBAC1D,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;gBAChD,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;oBAC3B,IAAI,EAAE,eAAe;oBACrB,OAAO,EAAE,CAAC,CAAC,EAAE;oBACb,OAAO,EAAE,CAAC,CAAC,EAAE;oBACb,MAAM,EAAE,IAAI;oBACZ,MAAM,EAAE,IAAI;iBACZ,CAAC,CAAC;gBACH,IAAI,EAAE;oBACL,GAAG,CAAC,IAAI,CAAC;wBACR,EAAE;wBACF,IAAI,EAAE,eAAe;wBACrB,OAAO,EAAE,CAAC,CAAC,EAAE;wBACb,OAAO,EAAE,CAAC,CAAC,EAAE;wBACb,MAAM,EAAE,IAAI;qBACZ,CAAC,CAAC;YACL,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAEO,cAAc;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;aACrB,OAAO,CACP;;;;;;;uCAOmC,CACnC;aACA,GAAG,CAAC,IAAI,CAAC,SAAS,CAIlB,CAAC;QACH,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,2BAA2B,GAAG,CAAC,YAAY,8BAA8B,GAAG,CAAC,cAAc,EAAE,CAAC;YAC7G,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC3B,IAAI,EAAE,UAAU;gBAChB,OAAO,EAAE,GAAG,CAAC,EAAE;gBACf,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,IAAI;gBACZ,MAAM;aACN,CAAC,CAAC;YACH,IAAI,EAAE;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAEO,WAAW,CAAC,KAMnB;QACA,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK;aACzB,OAAO,CACP;;;;iCAI6B,CAC7B;aACA,GAAG,CACH,IAAI,CAAC,SAAS,EACd,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,MAAM,CACkB,CAAC;QACjC,IAAI,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK;aACR,OAAO,CACP;;kCAE8B,CAC9B;aACA,GAAG,CACH,EAAE,EACF,IAAI,CAAC,SAAS,EACd,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,MAAM,CACZ,CAAC;QACH,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAC5C,OAAO,EAAE,CAAC;IACX,CAAC;CACD;AAED,SAAS,MAAM,CAAC,IAAY;IAC3B,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CACjB,KAAwB,EACxB,MAAyB;IAEzB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IAC7E,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAChB,IAAY,EACZ,IAAkB;IAElB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,yEAAyE;IACzE,2EAA2E;IAC3E,4DAA4D;IAC5D,MAAM,KAAK,GAAG,CAAC,MAAyB,EAAW,EAAE,CACpD,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,EAAE,QAAQ,EAAE,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC;AAClE,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC7B,OAAO,IAAI,GAAG,CACb,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAClB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAC/D,CACD,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACzC,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACxE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClE,OAAO,6BAA6B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,gCAAgC,MAAM,EAAE,CAAC;QACrG,CAAC;IACF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/plugin/ConventionMiner.d.ts

@@ -0,0 +1,35 @@
+import type { MemoryService } from "./MemoryService.js";
+import type { Store } from "./Store.js";
+import type { Metrics } from "./metrics.js";
+export interface MinedConvention {
+    /** Caller-supplied, derived from the normalized statement (D7-11). */
+    readonly fingerprint: string;
+    /** Human-readable rule statement. */
+    readonly statement: string;
+    /** Distinct sessions in which the pattern held. */
+    readonly support: number;
+    readonly kind: "sequence" | "co_edit";
+}
+export declare class ConventionMiner {
+    private readonly store;
+    private readonly memoryService;
+    private readonly projectId;
+    private readonly metrics;
+    constructor(store: Store, memoryService: MemoryService, projectId: string, metrics?: Metrics | null);
+    /** v0.7.0 (K7-010) — the `sequence` miner over successful tool_calls. */
+    mineSequence(minSupport?: number): MinedConvention[];
+    /** v0.7.0 (K7-011) — the `co_edit` miner over same-session file writes. */
+    mineCoEdit(minSupport?: number): MinedConvention[];
+    /** v0.7.0 (K7-012) — mine both kinds in one call. */
+    mine(minSupport?: number): MinedConvention[];
+    /**
+     * v0.7.0 (K7-012 / plan §5.4, D7-11) — emit mined(conventions) as `rule`
+     * memories. Returns the number of memories created or refreshed and
+     * increments `conventions_mined`. Runs on session.idle only, behind
+     * convention_mining_enabled. The fingerprint derives from the statement,
+     * so a re-mine of an unchanged convention collides and supersedes.
+     */
+    emit(conventions: MinedConvention[]): number;
+    private materialize;
+    private fetchToolCalls;
+}