sensorium-mcp 3.1.4 → 3.1.5

package/templates/increment-pr-pipeline.default.md

@@ -0,0 +1,79 @@
+---
+name: Increment PR Pipeline
+triggers:
+  - increment pipeline
+  - one increment per pr
+  - worktree per increment
+  - pr per increment
+  - board increment
+  - build increment by increment
+  - increment workflow
+---
+
+## Increment PR Pipeline — one atomic increment, one worktree, one PR, reviewed then merged
+
+### What this is
+The EXECUTION workflow for building a decomposed plan **increment by increment**, where every
+increment is isolated in its own git worktree + branch and lands as a **real GitHub PR into the
+feature branch** (e.g. the board branch), reviewed by a separate agent before the operator merges.
+It complements:
+- **Atomic Build Spec** — how to DECOMPOSE work into tiny, testable increments.
+- **Phased Worker Pipeline** — the fresh-worker-per-step loop (this skill is its PR-based, worktree-
+  isolated form).
+- **Handoff** — how to spawn a worker and wait for its result.
+
+Use this when the operator wants small PRs, isolated worktrees, and per-increment review — NOT one
+big branch with everything hammered in at once.
+
+### The invariants
+- **One increment in flight at a time, strictly serial.** The next increment branches off the
+  **updated** feature branch (after the previous PR merges). Do not parallelise dependent increments.
+- **Own worktree + own branch per increment**, branched off the feature branch (NOT main).
+- **Builder ≠ Reviewer.** A worker never reviews its own code; the reviewer is a fresh, separate
+  agent — ideally a DIFFERENT agent type than the builder, for independent perspective.
+- **A regression is never merged.** Blocking review findings are fixed by the SAME builder in the
+  SAME PR before merge; cosmetic/non-blocking items become explicit fast-follows.
+- **The operator does the final verify and merges the PR himself.** The orchestrator stays thin.
+
+### The loop (orchestrator-driven), per increment
+1. **Create the worktree + branch** off the feature branch:
+   `git worktree add -b <feat>/inc<N>-<slug> C:/src/rcm-inc<N>-<slug> <feature-branch>`.
+2. **Spawn the BUILDER worker** (agentType per the operator's choice for this run), cwd = the
+   worktree. It MUST, as its FIRST action, load the **Clean Code** skill via `get_skill`. Give it:
+   the increment goal, the smallest-honest-slice scope, exact file list, invariants, and what is
+   explicitly OUT of scope (name later increments so it can't scope-creep).
+3. Builder implements ONLY this increment + an automated test, then runs the FULL local gate and
+   **STOPS and reports back** — it does not start the next increment.
+4. **Spawn a separate REVIEWER worker** (a different agentType than the builder, for independence),
+   read-only, adversarial / refute-mode, cwd = the same worktree (deps already installed). It loads
+   Clean Code first, reviews
+   the PR diff vs the feature branch, confirms the tests are REAL (not rubber-stamps) and the gate is
+   green, and returns a clear **GO-to-merge** or **CHANGES-NEEDED** verdict with ranked findings.
+5. **Blocking findings** → hand back to the SAME builder to fix in the same PR; then a focused DELTA
+   re-review confirms the finding is CLOSED. Non-blockers → note as fast-follows.
+6. **Operator verifies** (the builder supplies a ~30s click-checklist) and **merges** the PR.
+7. **Cleanup**: `git worktree remove --force <path>` + `git worktree prune` + delete the local
+   branch. Advance to the next increment off the updated feature branch.
+
+### The gate — ALL must be green before a PR is "ready" (builder runs these IN the worktree)
+- `npm ci` **first** — a fresh worktree has NO `node_modules`; typecheck/tests won't run without it.
+  (Install can be slow on Windows; that's expected.)
+- `npm run typecheck` — clean.
+- `npm run format:check` — clean. **CI fails on format independently of tests**; running only tests
+  is not enough. Auto-fix with `npm run format` / `npx prettier --write` and re-check.
+- `npm test` — all pass, including the new test for this increment.
+
+### The PR
+- **Base = the feature branch (e.g. feature/agent-task-board), NOT main.**
+- Title: `<feat>(inc<N>): <what it does>`.
+- Body: plain and accurate — what the increment does, files touched, gate status. No filler, no
+  AI/tool attribution.
+- Commits use **explicit paths** — never `git add -A/./ -u`, never `commit -a`.
+
+### Anti-patterns
+- ❌ Skipping `npm ci` in a fresh worktree, then reporting "done" when the gate never actually ran.
+- ❌ Running only `npm test` and missing the separate `format:check` → red CI on the PR.
+- ❌ PR based on `main` instead of the feature branch.
+- ❌ The building worker reviewing its own increment.
+- ❌ Merging a PR with an unresolved regression instead of fixing it in the same PR.
+- ❌ Leaving the merged increment's worktree/branch around instead of cleaning up before the next.

package/dist/data/memory/reflection-dedup.d.ts

@@ -1,17 +0,0 @@
-/**
- * Reflection de-duplication — embedding-based checks that prevent saving
- * insights or lessons that semantically duplicate existing reflections.
- */
-import type { Database } from "./schema.js";
-export declare function checkDuplicate(db: Database, content: string, apiKey: string, threadId: number): Promise<{
-    isDuplicate: boolean;
-    embedding: Float32Array | null;
-}>;
-/**
- * Lesson-level dedup: checks if a semantically similar lesson already exists
- * among reflection notes using a lower similarity threshold (0.75).
- * Catches generic lessons like "Always do comprehensive code reviews" that are
- * worded differently but carry the same meaning.
- */
-export declare function checkLessonDuplicate(db: Database, lesson: string, apiKey: string, knowledgeThreadId: number): Promise<boolean>;
-//# sourceMappingURL=reflection-dedup.d.ts.map

package/dist/data/memory/reflection-dedup.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-dedup.d.ts","sourceRoot":"","sources":["../../../src/data/memory/reflection-dedup.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAS5C,wBAAsB,cAAc,CAClC,EAAE,EAAE,QAAQ,EACZ,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC;IAAE,WAAW,EAAE,OAAO,CAAC;IAAC,SAAS,EAAE,YAAY,GAAG,IAAI,CAAA;CAAE,CAAC,CAkBnE;AAED;;;;;GAKG;AACH,wBAAsB,oBAAoB,CACxC,EAAE,EAAE,QAAQ,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,iBAAiB,EAAE,MAAM,GACxB,OAAO,CAAC,OAAO,CAAC,CAsBlB"}

package/dist/data/memory/reflection-dedup.js

@@ -1,55 +0,0 @@
-/**
- * Reflection de-duplication — embedding-based checks that prevent saving
- * insights or lessons that semantically duplicate existing reflections.
- */
-import { searchByEmbedding } from "./note-embeddings.js";
-import { generateEmbedding } from "../../integrations/openai/chat.js";
-import { log } from "../../lib/logger.js";
-import { errorMessage } from "../../lib/utils.js";
-const DEDUP_SIMILARITY_THRESHOLD = 0.86;
-const LESSON_DEDUP_THRESHOLD = 0.75;
-export async function checkDuplicate(db, content, apiKey, threadId) {
-    try {
-        const embedding = await generateEmbedding(content, apiKey, threadId);
-        const matches = searchByEmbedding(db, embedding, {
-            maxResults: 8,
-            minSimilarity: DEDUP_SIMILARITY_THRESHOLD,
-            skipAccessTracking: true,
-            threadId,
-        });
-        const isDuplicate = matches.some((m) => m.similarity >= DEDUP_SIMILARITY_THRESHOLD && m.content.startsWith("[REFLECTION]"));
-        return { isDuplicate, embedding };
-    }
-    catch (err) {
-        log.warn(`[reflection] Dedup embedding lookup failed: ${errorMessage(err)}`);
-        // Embedding lookup failed — allow the insight through to avoid data loss
-        return { isDuplicate: false, embedding: null };
-    }
-}
-/**
- * Lesson-level dedup: checks if a semantically similar lesson already exists
- * among reflection notes using a lower similarity threshold (0.75).
- * Catches generic lessons like "Always do comprehensive code reviews" that are
- * worded differently but carry the same meaning.
- */
-export async function checkLessonDuplicate(db, lesson, apiKey, knowledgeThreadId) {
-    try {
-        const embedding = await generateEmbedding(lesson, apiKey, knowledgeThreadId);
-        const matches = searchByEmbedding(db, embedding, {
-            maxResults: 8,
-            minSimilarity: LESSON_DEDUP_THRESHOLD,
-            skipAccessTracking: true,
-            threadId: knowledgeThreadId,
-        });
-        if (matches.some((m) => m.similarity >= LESSON_DEDUP_THRESHOLD && m.content.startsWith("[REFLECTION]"))) {
-            return true;
-        }
-        return false;
-    }
-    catch (err) {
-        log.warn(`[reflection] Lesson dedup embedding lookup failed: ${errorMessage(err)}`);
-        // Embedding lookup failed — allow through to avoid data loss
-        return false;
-    }
-}
-//# sourceMappingURL=reflection-dedup.js.map

package/dist/data/memory/reflection-dedup.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-dedup.js","sourceRoot":"","sources":["../../../src/data/memory/reflection-dedup.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AACtE,OAAO,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,0BAA0B,GAAG,IAAI,CAAC;AACxC,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAEpC,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,EAAY,EACZ,OAAe,EACf,MAAc,EACd,QAAgB;IAEhB,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,SAAS,EAAE;YAC/C,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,0BAA0B;YACzC,kBAAkB,EAAE,IAAI;YACxB,QAAQ;SACT,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,0BAA0B,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC,CAC1F,CAAC;QACF,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;IACpC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,GAAG,CAAC,IAAI,CAAC,+CAA+C,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7E,yEAAyE;QACzE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IACjD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,EAAY,EACZ,MAAc,EACd,MAAc,EACd,iBAAyB;IAEzB,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;QAC7E,MAAM,OAAO,GAAG,iBAAiB,CAAC,EAAE,EAAE,SAAS,EAAE;YAC/C,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,sBAAsB;YACrC,kBAAkB,EAAE,IAAI;YACxB,QAAQ,EAAE,iBAAiB;SAC5B,CAAC,CAAC;QACH,IACE,OAAO,CAAC,IAAI,CACV,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,sBAAsB,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC,CACtF,EACD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,GAAG,CAAC,IAAI,CAAC,sDAAsD,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpF,6DAA6D;QAC7D,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/data/memory/reflection-gates.d.ts

@@ -1,40 +0,0 @@
-/**
- * Reflection quality gates — pure checks that reject vague, meta, or
- * non-actionable insights, plus the structured-field parser.
- */
-/** Check if an insight passes the quality gate (actionable, specific, non-vague, non-meta). */
-export declare function passesQualityGate(content: string, confidence: number): {
-    pass: boolean;
-    reason?: string;
-};
-/** Parse reflection content into structured fields. Returns null if parsing fails. */
-export declare function parseReflectionFields(content: string): {
-    decision: string;
-    context: string;
-    outcome: string;
-    root_cause: string;
-    lesson: string;
-} | null;
-/** True if the text names something specific rather than being an abstract platitude. */
-export declare function hasConcreteAnchor(text: string): boolean;
-/**
- * Validate structural integrity of parsed insight fields.
- *
- * `requireAnchor` gates the lesson on a concrete anchor (identifier/file/version).
- * It defaults ON for the generation path (reject new platitudes). The existing-notes
- * cleanup sweep passes it OFF so tightening the anchor rule never retroactively
- * expires historical reflections — legacy cleanup is a separate, backed-up step.
- */
-export declare function passesStructuralGate(insight: {
-    decision: string;
-    context: string;
-    outcome: string;
-    root_cause: string;
-    lesson: string;
-}, options?: {
-    requireAnchor?: boolean;
-}): {
-    pass: boolean;
-    reason?: string;
-};
-//# sourceMappingURL=reflection-gates.d.ts.map

package/dist/data/memory/reflection-gates.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-gates.d.ts","sourceRoot":"","sources":["../../../src/data/memory/reflection-gates.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAqCH,+FAA+F;AAC/F,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,GACjB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAkBpC;AAED,sFAAsF;AACtF,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,MAAM,GAAG;IACtD,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,GAAG,IAAI,CAgBP;AAiCD,yFAAyF;AACzF,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAIvD;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE;IACP,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB,EACD,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAA;CAAO,GACxC;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CA4GpC"}

package/dist/data/memory/reflection-gates.js

@@ -1,220 +0,0 @@
-/**
- * Reflection quality gates — pure checks that reject vague, meta, or
- * non-actionable insights, plus the structured-field parser.
- */
-const MIN_INSIGHT_LENGTH = 50;
-const VAGUE_PATTERNS = [
-    /\bthe agent tends to\b/i,
-    /\bI tend to\b/i,
-    /\bthe agent demonstrates\b/i,
-    /\bthe agent frequently\b/i,
-    /\bshould consider\b/i,
-    /\bthis (is|was) (a |an )?(good|important|useful)\b/i,
-    /\bin general\b/i,
-    /\boverall\b.*\b(good|well|effective)\b/i,
-    /\bthe key (insight|takeaway|lesson) is\b/i,
-    /\bit('s| is) important to\b/i,
-    /\bthis (led|leads) to\b(?!\s+\w{4,})/i,
-    /\bgoing forward\b/i,
-    /\bmoving forward\b/i,
-    /\ba? ?valuable (lesson|experience|insight)\b/i,
-    /\bI (learned|realized|recognized|acknowledged) that\b/i,
-    /\bthis (highlights|underscores|demonstrates)\b/i,
-    /\bsignificant (progress|strides|developments?|evolution)\b/i,
-    /\bnotable improvements?\b/i,
-    /\bvarious features\b/i,
-    /\bseveral enhancements\b/i,
-    /\bI regularly (review|conduct|perform|check)\b/i,
-    /\bI frequently (create|manage|handle)\b/i,
-];
-const BANNED_TOPIC_PATTERNS = [
-    /\bmemory (system|audit|cleanup|quality|consolidat)/i,
-    /\bconsolidation (process|pipeline|prompt)\b/i,
-    /\breflection (quality|pipeline|system)\b/i,
-    /\bdeduplication\b/i,
-    /\bnote (archival|cleanup|expir)/i,
-    /\bI (conducted|scheduled|implemented) a (memory|cleanup|audit)\b/i,
-];
-/** Check if an insight passes the quality gate (actionable, specific, non-vague, non-meta). */
-export function passesQualityGate(content, confidence) {
-    if (content.length < MIN_INSIGHT_LENGTH) {
-        return { pass: false, reason: "too short" };
-    }
-    if (confidence < 0.3) {
-        return { pass: false, reason: "confidence too low" };
-    }
-    for (const pattern of VAGUE_PATTERNS) {
-        if (pattern.test(content)) {
-            return { pass: false, reason: `matches vague pattern: ${pattern.source}` };
-        }
-    }
-    for (const pattern of BANNED_TOPIC_PATTERNS) {
-        if (pattern.test(content)) {
-            return { pass: false, reason: `banned topic: ${pattern.source}` };
-        }
-    }
-    return { pass: true };
-}
-/** Parse reflection content into structured fields. Returns null if parsing fails. */
-export function parseReflectionFields(content) {
-    const decisionMatch = content.match(/Decision:\s*(.+?)(?:\s*Context:|$)/s);
-    const contextMatch = content.match(/Context:\s*(.+?)(?:\s*Outcome:|$)/s);
-    const outcomeMatch = content.match(/Outcome:\s*(.+?)(?:\s*Root cause:|$)/s);
-    const rootCauseMatch = content.match(/Root cause:\s*(.+?)(?:\s*Lesson:|$)/s);
-    const lessonMatch = content.match(/Lesson:\s*(.+?)(?:\s*$)/s);
-    if (!decisionMatch || !lessonMatch)
-        return null;
-    return {
-        decision: decisionMatch[1]?.trim() ?? "",
-        context: contextMatch?.[1]?.trim() ?? "",
-        outcome: outcomeMatch?.[1]?.trim() ?? "",
-        root_cause: rootCauseMatch?.[1]?.trim() ?? "",
-        lesson: lessonMatch[1]?.trim() ?? "",
-    };
-}
-// A concrete anchor is a specific, project-referencing token: a code identifier,
-// file/path, version, acronym, or number. Generic prose maxims ("Always
-// communicate clearly", "Break tasks into steps") contain none of these and carry
-// no reusable, project-specific value — they are the dominant reflection noise.
-const ANCHOR_PATTERNS = [
-    /`[^`]+`/, // backticked code
-    /\b\w+\.(ts|js|tsx|jsx|cs|py|json|sql|md|ya?ml|sh|db)\b/i, // filename
-    /[/\\]\w/, // path segment
-    /\b[a-z][a-z0-9]*[A-Z][a-zA-Z0-9]*\b/, // camelCase identifier
-    /\b[A-Z][a-z0-9]+[A-Z][a-zA-Z0-9]*\b/, // PascalCase identifier
-    /\b[a-z0-9]+_[a-z0-9]+\b/, // snake_case identifier
-    /\bv?\d+\.\d+/, // version / decimal (5.2.2, v1.2)
-];
-// All-caps tokens that are filler, not project anchors — excluded from the acronym rule.
-const NON_ANCHOR_ACRONYMS = new Set([
-    "OK",
-    "TODO",
-    "ASAP",
-    "FYI",
-    "AKA",
-    "ETA",
-    "YES",
-    "NO",
-    "AI",
-    "IT",
-    "OKAY",
-    "PM",
-    "IMO",
-]);
-/** True if the text names something specific rather than being an abstract platitude. */
-export function hasConcreteAnchor(text) {
-    if (ANCHOR_PATTERNS.some((p) => p.test(text)))
-        return true;
-    const acronyms = text.match(/\b[A-Z]{2,}\b/g);
-    return Boolean(acronyms && acronyms.some((a) => !NON_ANCHOR_ACRONYMS.has(a)));
-}
-/**
- * Validate structural integrity of parsed insight fields.
- *
- * `requireAnchor` gates the lesson on a concrete anchor (identifier/file/version).
- * It defaults ON for the generation path (reject new platitudes). The existing-notes
- * cleanup sweep passes it OFF so tightening the anchor rule never retroactively
- * expires historical reflections — legacy cleanup is a separate, backed-up step.
- */
-export function passesStructuralGate(insight, options = {}) {
-    const { requireAnchor = true } = options;
-    // Check root_cause is meaningfully different from outcome (skip for very short fields)
-    const outcomeWords = new Set(insight.outcome
-        .toLowerCase()
-        .replace(/[.,:;!?]/g, "")
-        .split(/\s+/)
-        .filter((w) => w.length > 3));
-    const rootWords = new Set(insight.root_cause
-        .toLowerCase()
-        .replace(/[.,:;!?]/g, "")
-        .split(/\s+/)
-        .filter((w) => w.length > 3));
-    if (outcomeWords.size >= 3) {
-        const overlap = [...outcomeWords].filter((w) => rootWords.has(w)).length;
-        const overlapRatio = overlap / outcomeWords.size;
-        if (overlapRatio > 0.6) {
-            return { pass: false, reason: "root_cause restates outcome" };
-        }
-    }
-    // Check lesson starts with a verb (actionable)
-    const lessonStart = insight.lesson.trim().split(/\s/)[0]?.toLowerCase() ?? "";
-    const actionVerbs = [
-        "always",
-        "never",
-        "before",
-        "after",
-        "when",
-        "if",
-        "check",
-        "verify",
-        "ensure",
-        "use",
-        "avoid",
-        "run",
-        "test",
-        "add",
-        "remove",
-        "set",
-        "create",
-        "implement",
-        "review",
-        "validate",
-        "confirm",
-        "monitor",
-        "track",
-        "log",
-        "document",
-        "separate",
-        "isolate",
-        "prefer",
-        "prioritize",
-        "consider",
-        "evaluate",
-        "compare",
-        "measure",
-        "schedule",
-        "watch",
-        "build",
-        "configure",
-        "enable",
-        "define",
-        "wrap",
-        "cache",
-        "query",
-        "disable",
-        "expose",
-        "update",
-        "read",
-        "write",
-        "fetch",
-        "parse",
-        "handle",
-        "keep",
-        "limit",
-        "require",
-        "include",
-        "exclude",
-        "apply",
-        "deploy",
-        "migrate",
-        "start",
-        "stop",
-    ];
-    if (!actionVerbs.some((v) => lessonStart.startsWith(v))) {
-        return { pass: false, reason: "lesson does not start with an action verb" };
-    }
-    // Check minimum field lengths (more strict than the 10-char check elsewhere)
-    if (insight.root_cause.length < 30) {
-        return { pass: false, reason: "root_cause too shallow (< 30 chars)" };
-    }
-    if (insight.lesson.length < 20) {
-        return { pass: false, reason: "lesson too short (< 20 chars)" };
-    }
-    // Lesson must name something concrete. A generic maxim with no file, component,
-    // version, identifier, or number is a platitude, not a project-specific lesson.
-    if (requireAnchor && !hasConcreteAnchor(insight.lesson)) {
-        return { pass: false, reason: "lesson has no concrete anchor (generic platitude)" };
-    }
-    return { pass: true };
-}
-//# sourceMappingURL=reflection-gates.js.map

package/dist/data/memory/reflection-gates.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-gates.js","sourceRoot":"","sources":["../../../src/data/memory/reflection-gates.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,cAAc,GAAG;IACrB,yBAAyB;IACzB,gBAAgB;IAChB,6BAA6B;IAC7B,2BAA2B;IAC3B,sBAAsB;IACtB,qDAAqD;IACrD,iBAAiB;IACjB,yCAAyC;IACzC,2CAA2C;IAC3C,8BAA8B;IAC9B,uCAAuC;IACvC,oBAAoB;IACpB,qBAAqB;IACrB,+CAA+C;IAC/C,wDAAwD;IACxD,iDAAiD;IACjD,6DAA6D;IAC7D,4BAA4B;IAC5B,uBAAuB;IACvB,2BAA2B;IAC3B,iDAAiD;IACjD,0CAA0C;CAC3C,CAAC;AAEF,MAAM,qBAAqB,GAAG;IAC5B,qDAAqD;IACrD,8CAA8C;IAC9C,2CAA2C;IAC3C,oBAAoB;IACpB,kCAAkC;IAClC,mEAAmE;CACpE,CAAC;AAEF,+FAA+F;AAC/F,MAAM,UAAU,iBAAiB,CAC/B,OAAe,EACf,UAAkB;IAElB,IAAI,OAAO,CAAC,MAAM,GAAG,kBAAkB,EAAE,CAAC;QACxC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC9C,CAAC;IACD,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QACrB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC;IACvD,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,0BAA0B,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,qBAAqB,EAAE,CAAC;QAC5C,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,iBAAiB,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACpE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,qBAAqB,CAAC,OAAe;IAOnD,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAC;IAC3E,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACzE,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC5E,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC7E,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAE9D,IAAI,CAAC,aAAa,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAC;IAEhD,OAAO;QACL,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;QACxC,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;QACxC,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;QACxC,UAAU,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;QAC7C,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE;KACrC,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,wEAAwE;AACxE,kFAAkF;AAClF,gFAAgF;AAChF,MAAM,eAAe,GAAG;IACtB,SAAS,EAAE,kBAAkB;IAC7B,yDAAyD,EAAE,WAAW;IACtE,SAAS,EAAE,eAAe;IAC1B,qCAAqC,EAAE,uBAAuB;IAC9D,qCAAqC,EAAE,wBAAwB;IAC/D,yBAAyB,EAAE,wBAAwB;IACnD,cAAc,EAAE,kCAAkC;CACnD,CAAC;AAEF,yFAAyF;AACzF,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,IAAI;IACJ,MAAM;IACN,MAAM;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAEH,yFAAyF;AACzF,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAC9C,OAAO,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAMC,EACD,UAAuC,EAAE;IAEzC,MAAM,EAAE,aAAa,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IACzC,uFAAuF;IACvF,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,OAAO,CAAC,OAAO;SACZ,WAAW,EAAE;SACb,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,OAAO,CAAC,UAAU;SACf,WAAW,EAAE;SACb,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IACF,IAAI,YAAY,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACzE,MAAM,YAAY,GAAG,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;QACjD,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;YACvB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC;QAChE,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;IAC9E,MAAM,WAAW,GAAG;QAClB,QAAQ;QACR,OAAO;QACP,QAAQ;QACR,OAAO;QACP,MAAM;QACN,IAAI;QACJ,OAAO;QACP,QAAQ;QACR,QAAQ;QACR,KAAK;QACL,OAAO;QACP,KAAK;QACL,MAAM;QACN,KAAK;QACL,QAAQ;QACR,KAAK;QACL,QAAQ;QACR,WAAW;QACX,QAAQ;QACR,UAAU;QACV,SAAS;QACT,SAAS;QACT,OAAO;QACP,KAAK;QACL,UAAU;QACV,UAAU;QACV,SAAS;QACT,QAAQ;QACR,YAAY;QACZ,UAAU;QACV,UAAU;QACV,SAAS;QACT,SAAS;QACT,UAAU;QACV,OAAO;QACP,OAAO;QACP,WAAW;QACX,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,OAAO;QACP,OAAO;QACP,SAAS;QACT,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,OAAO;QACP,OAAO;QACP,OAAO;QACP,QAAQ;QACR,MAAM;QACN,OAAO;QACP,SAAS;QACT,SAAS;QACT,SAAS;QACT,OAAO;QACP,QAAQ;QACR,SAAS;QACT,OAAO;QACP,MAAM;KACP,CAAC;IACF,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,2CAA2C,EAAE,CAAC;IAC9E,CAAC;IAED,6EAA6E;IAC7E,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QACnC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,qCAAqC,EAAE,CAAC;IACxE,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;QAC/B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,+BAA+B,EAAE,CAAC;IAClE,CAAC;IAED,gFAAgF;IAChF,gFAAgF;IAChF,IAAI,aAAa,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACxD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,mDAAmD,EAAE,CAAC;IACtF,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC"}

package/dist/data/memory/reflection-sources.d.ts

@@ -1,13 +0,0 @@
-/**
- * Reflection source data — episode gathering, narrative building, and
- * keyword extraction for the reflection pipeline.
- */
-import type { Database } from "./schema.js";
-import { type Episode } from "./episodes.js";
-/** Build a time-ordered narrative from a list of episodes. */
-export declare function buildNarrative(episodes: Episode[]): string;
-/** Gather consolidated episodes: last N recent + random sample of older ones. */
-export declare function gatherEpisodes(db: Database, threadId: number, maxRecent: number, oldSampleSize: number): Episode[];
-/** Extract up to 5 meaningful keywords from free-text content. */
-export declare function extractKeywords(text: string): string[];
-//# sourceMappingURL=reflection-sources.d.ts.map

package/dist/data/memory/reflection-sources.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-sources.d.ts","sourceRoot":"","sources":["../../../src/data/memory/reflection-sources.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,KAAK,OAAO,EAAgB,MAAM,eAAe,CAAC;AAS3D,8DAA8D;AAC9D,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,MAAM,CAO1D;AAED,iFAAiF;AACjF,wBAAgB,cAAc,CAC5B,EAAE,EAAE,QAAQ,EACZ,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,aAAa,EAAE,MAAM,GACpB,OAAO,EAAE,CA+BX;AA2DD,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CActD"}

package/dist/data/memory/reflection-sources.js

@@ -1,115 +0,0 @@
-/**
- * Reflection source data — episode gathering, narrative building, and
- * keyword extraction for the reflection pipeline.
- */
-import { rowToEpisode } from "./episodes.js";
-/** Extract text from an episode's content object. */
-function episodeText(ep) {
-    const c = ep.content;
-    if (typeof c === "string")
-        return c;
-    return c.text ?? c.caption ?? JSON.stringify(c);
-}
-/** Build a time-ordered narrative from a list of episodes. */
-export function buildNarrative(episodes) {
-    return episodes
-        .sort((a, b) => a.timestamp.localeCompare(b.timestamp))
-        .map((ep) => `[${ep.episodeId}] (${ep.type}/${ep.modality}, ${ep.timestamp}) ${episodeText(ep)}`)
-        .join("\n");
-}
-/** Gather consolidated episodes: last N recent + random sample of older ones. */
-export function gatherEpisodes(db, threadId, maxRecent, oldSampleSize) {
-    // Recent consolidated episodes
-    const recentRows = db
-        .prepare(`SELECT * FROM episodes
-       WHERE thread_id = ? AND consolidated = 1
-       ORDER BY timestamp DESC
-       LIMIT ?`)
-        .all(threadId, maxRecent);
-    const recentIds = new Set(recentRows.map((r) => r.episode_id));
-    // Random sample of older consolidated episodes from the past 7 days
-    // (excluding the ones already in the recent set)
-    const olderRows = db
-        .prepare(`SELECT * FROM episodes
-       WHERE thread_id = ? AND consolidated = 1
-         AND timestamp >= datetime('now', '-7 days')
-       ORDER BY RANDOM()
-       LIMIT ?`)
-        .all(threadId, oldSampleSize + recentRows.length);
-    const olderFiltered = olderRows
-        .filter((r) => !recentIds.has(r.episode_id))
-        .slice(0, oldSampleSize);
-    const allRows = [...recentRows, ...olderFiltered];
-    return allRows.map(rowToEpisode);
-}
-// ─── Keyword extraction ──────────────────────────────────────────────────────
-const STOP_WORDS = new Set([
-    "this",
-    "that",
-    "with",
-    "from",
-    "have",
-    "been",
-    "will",
-    "would",
-    "could",
-    "should",
-    "about",
-    "there",
-    "their",
-    "which",
-    "when",
-    "what",
-    "were",
-    "they",
-    "than",
-    "then",
-    "also",
-    "just",
-    "more",
-    "some",
-    "into",
-    "over",
-    "after",
-    "before",
-    "other",
-    "very",
-    "your",
-    "here",
-    "does",
-    "because",
-    "instead",
-    "agent",
-    "operator",
-    "the",
-    "and",
-    "for",
-    "are",
-    "but",
-    "not",
-    "you",
-    "all",
-    "can",
-    "had",
-    "her",
-    "was",
-    "one",
-    "our",
-    "out",
-]);
-/** Extract up to 5 meaningful keywords from free-text content. */
-export function extractKeywords(text) {
-    const words = text
-        .toLowerCase()
-        .replace(/[^a-z0-9\s]/g, " ")
-        .split(/\s+/)
-        .filter((w) => w.length > 3 && !STOP_WORDS.has(w));
-    const freq = new Map();
-    for (const w of words)
-        freq.set(w, (freq.get(w) ?? 0) + 1);
-    return [...freq.entries()]
-        .sort((a, b) => b[1] - a[1])
-        .slice(0, 5)
-        .map(([w]) => w);
-}
-//# sourceMappingURL=reflection-sources.js.map

package/dist/data/memory/reflection-sources.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection-sources.js","sourceRoot":"","sources":["../../../src/data/memory/reflection-sources.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAgB,YAAY,EAAE,MAAM,eAAe,CAAC;AAE3D,qDAAqD;AACrD,SAAS,WAAW,CAAC,EAAW;IAC9B,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC;IACrB,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IACpC,OAAQ,CAAC,CAAC,IAAe,IAAK,CAAC,CAAC,OAAkB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,cAAc,CAAC,QAAmB;IAChD,OAAO,QAAQ;SACZ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;SACtD,GAAG,CACF,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,SAAS,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,QAAQ,KAAK,EAAE,CAAC,SAAS,KAAK,WAAW,CAAC,EAAE,CAAC,EAAE,CAC5F;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,cAAc,CAC5B,EAAY,EACZ,QAAgB,EAChB,SAAiB,EACjB,aAAqB;IAErB,+BAA+B;IAC/B,MAAM,UAAU,GAAG,EAAE;SAClB,OAAO,CACN;;;eAGS,CACV;SACA,GAAG,CAAC,QAAQ,EAAE,SAAS,CAA8B,CAAC;IAEzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAoB,CAAC,CAAC,CAAC;IAEzE,oEAAoE;IACpE,iDAAiD;IACjD,MAAM,SAAS,GAAG,EAAE;SACjB,OAAO,CACN;;;;eAIS,CACV;SACA,GAAG,CAAC,QAAQ,EAAE,aAAa,GAAG,UAAU,CAAC,MAAM,CAA8B,CAAC;IAEjF,MAAM,aAAa,GAAG,SAAS;SAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,UAAoB,CAAC,CAAC;SACrD,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IAE3B,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,aAAa,CAAC,CAAC;IAClD,OAAO,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AACnC,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,OAAO;IACP,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,OAAO;IACP,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT,SAAS;IACT,OAAO;IACP,UAAU;IACV,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;CACN,CAAC,CAAC;AAEH,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,KAAK,GAAG,IAAI;SACf,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAErD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3D,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;SACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACrB,CAAC"}

package/dist/data/memory/reflection.d.ts

@@ -1,43 +0,0 @@
-/**
- * Reflection pipeline — the "dreaming" phase that generates deeper insights
- * from episodic memories after consolidation.
- *
- * Unlike consolidation (which extracts facts and preferences), reflection
- * finds causal chains, recurring patterns, counterfactuals, and
- * self-assessments across episodes.  It runs post-consolidation when
- * enough episodes exist, rate-limited to once per 4 hours.
- *
- * Split into: reflection-gates (quality/structural gates + field parsing),
- * reflection-dedup (embedding-based duplicate checks), reflection-sources
- * (episode gathering, narrative building, keyword extraction). This module
- * keeps the orchestrating pipeline and buffer maintenance.
- */
-import type { Database } from "./schema.js";
-interface ReflectionInsight {
-    type: "causal" | "pattern" | "self_assessment" | "counterfactual";
-    content: string;
-    confidence: number;
-    relatedEpisodeIds: string[];
-}
-interface ReflectionResult {
-    insights: ReflectionInsight[];
-    processedEpisodeCount: number;
-    duration: number;
-}
-/**
- * Run the reflection pipeline on recent consolidated episodes.
- * Generates deeper insights beyond simple fact/preference extraction.
- *
- * Pipeline:
- *   1. Gate check — enough episodes, rate limit, API key present
- *   2. Gather episodes — recent + random sample of older ones
- *   3. Build a narrative from episode content
- *   4. Send to OpenAI with the reflection prompt
- *   5. Parse insights, de-duplicate, and save as semantic notes
- */
-export declare function runReflection(db: Database, threadId: number, options?: {
-    maxEpisodes?: number;
-    includeOldSample?: boolean;
-}): Promise<ReflectionResult>;
-export {};
-//# sourceMappingURL=reflection.d.ts.map

package/dist/data/memory/reflection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reflection.d.ts","sourceRoot":"","sources":["../../../src/data/memory/reflection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAwB5C,UAAU,iBAAiB;IACzB,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;IAClE,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,UAAU,gBAAgB;IACxB,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,QAAQ,EAAE,MAAM,CAAC;CAClB;AAiFD;;;;;;;;;;GAUG;AACH,wBAAsB,aAAa,CACjC,EAAE,EAAE,QAAQ,EACZ,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,gBAAgB,CAAC,EAAE,OAAO,CAAA;CAAE,GAC7D,OAAO,CAAC,gBAAgB,CAAC,CA4B3B"}