@obsidicore/cascade-engine 0.2.0

package/dist/db/schema.sql

@@ -0,0 +1,282 @@
+-- Research Cascade Knowledge Database Schema
+-- Version: 1.0
+-- Requires: SQLite >= 3.51.3 (WAL-reset corruption fix)
+
+-- ============================================================
+-- TIER 1: CASCADE STATE
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS cascades (
+  id TEXT PRIMARY KEY,
+  question TEXT NOT NULL,
+  status TEXT NOT NULL DEFAULT 'planning'
+    CHECK(status IN('planning','investigating','validating','synthesizing','complete','stalled')),
+  plan_json TEXT CHECK(plan_json IS NULL OR json_valid(plan_json)),
+  pid_state_json TEXT,
+  max_rounds INTEGER DEFAULT 5,
+  current_round INTEGER DEFAULT 0,
+  token_budget INTEGER DEFAULT 500000,
+  tokens_used INTEGER DEFAULT 0,
+  exploration_budget REAL DEFAULT 0.8,
+  created_at TEXT DEFAULT(datetime('now')),
+  updated_at TEXT DEFAULT(datetime('now'))
+);
+
+CREATE TABLE IF NOT EXISTS threads (
+  id TEXT PRIMARY KEY,
+  cascade_id TEXT NOT NULL REFERENCES cascades(id) ON DELETE CASCADE,
+  question TEXT NOT NULL,
+  type TEXT NOT NULL CHECK(type IN('technical','discovery','classification','validation')),
+  status TEXT DEFAULT 'pending' CHECK(status IN('pending','active','done','failed')),
+  agent_name TEXT,
+  model_used TEXT,
+  ucb_value REAL DEFAULT 0.0,
+  ucb_visits INTEGER DEFAULT 0,
+  ucb_reward REAL DEFAULT 0.0,
+  started_at TEXT,
+  completed_at TEXT
+);
+CREATE INDEX IF NOT EXISTS idx_threads_cascade ON threads(cascade_id);
+
+CREATE TABLE IF NOT EXISTS findings (
+  id TEXT PRIMARY KEY,
+  thread_id TEXT REFERENCES threads(id) ON DELETE CASCADE,
+  cascade_id TEXT REFERENCES cascades(id) ON DELETE CASCADE,
+  claim TEXT NOT NULL,
+  evidence TEXT,
+  source_url TEXT,
+  source_type TEXT CHECK(source_type IN('primary','secondary','tertiary')),
+  confidence REAL DEFAULT 0.5,
+  confidence_uncertainty REAL DEFAULT 1.0,
+  trust_composite REAL DEFAULT 0.5,
+  trust_signals_json TEXT,
+  grade_level TEXT CHECK(grade_level IS NULL OR grade_level IN('high','moderate','low','very_low')),
+  quarantined INTEGER DEFAULT 0,
+  human_reviewed INTEGER DEFAULT 0,
+  retrieval_weight REAL DEFAULT 1.0,
+  cd47_protected INTEGER DEFAULT 0,
+  cascade_round INTEGER NOT NULL,
+  ncd_cluster_id TEXT,
+  created_at TEXT DEFAULT(datetime('now'))
+);
+CREATE INDEX IF NOT EXISTS idx_findings_cascade ON findings(cascade_id);
+CREATE INDEX IF NOT EXISTS idx_findings_quarantined ON findings(quarantined) WHERE quarantined = 1;
+
+CREATE VIRTUAL TABLE IF NOT EXISTS findings_fts USING fts5(
+  claim, evidence, source_url, content=findings, content_rowid=rowid
+);
+
+-- Triggers to keep FTS in sync
+CREATE TRIGGER IF NOT EXISTS findings_ai AFTER INSERT ON findings BEGIN
+  INSERT INTO findings_fts(rowid, claim, evidence, source_url)
+  VALUES (new.rowid, new.claim, new.evidence, new.source_url);
+END;
+
+CREATE TRIGGER IF NOT EXISTS findings_ad AFTER DELETE ON findings BEGIN
+  INSERT INTO findings_fts(findings_fts, rowid, claim, evidence, source_url)
+  VALUES ('delete', old.rowid, old.claim, old.evidence, old.source_url);
+END;
+
+CREATE TRIGGER IF NOT EXISTS findings_au AFTER UPDATE ON findings BEGIN
+  INSERT INTO findings_fts(findings_fts, rowid, claim, evidence, source_url)
+  VALUES ('delete', old.rowid, old.claim, old.evidence, old.source_url);
+  INSERT INTO findings_fts(rowid, claim, evidence, source_url)
+  VALUES (new.rowid, new.claim, new.evidence, new.source_url);
+END;
+
+CREATE TABLE IF NOT EXISTS cascade_checkpoints (
+  task_id TEXT NOT NULL,
+  round_index INTEGER NOT NULL,
+  step_index INTEGER NOT NULL,
+  step_name TEXT NOT NULL,
+  status TEXT NOT NULL DEFAULT 'pending'
+    CHECK(status IN('pending','running','done','failed','skipped')),
+  state_snapshot TEXT,
+  idempotency_key TEXT UNIQUE,
+  error_message TEXT,
+  created_at TEXT DEFAULT(datetime('now')),
+  completed_at TEXT,
+  PRIMARY KEY (task_id, round_index, step_index)
+);
+
+CREATE TABLE IF NOT EXISTS idempotency_cache (
+  key TEXT PRIMARY KEY,
+  result_json TEXT NOT NULL,
+  created_at TEXT DEFAULT(datetime('now')),
+  expires_at TEXT
+);
+
+-- ============================================================
+-- TIER 2: KNOWLEDGE GRAPH
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS kg_entities (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  name TEXT NOT NULL,
+  entity_type TEXT NOT NULL,
+  properties TEXT DEFAULT '{}',
+  community_id INTEGER,
+  betweenness REAL DEFAULT 0.0,
+  tier TEXT DEFAULT 'working' CHECK(tier IN('peripheral','working','core')),
+  access_count INTEGER DEFAULT 0,
+  importance REAL DEFAULT 0.5,
+  last_accessed TEXT DEFAULT(datetime('now')),
+  created_at TEXT DEFAULT(datetime('now')),
+  UNIQUE(name, entity_type)
+);
+CREATE INDEX IF NOT EXISTS idx_entities_tier ON kg_entities(tier);
+CREATE INDEX IF NOT EXISTS idx_entities_community ON kg_entities(community_id);
+
+CREATE TABLE IF NOT EXISTS kg_edges (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  source_id INTEGER NOT NULL REFERENCES kg_entities(id) ON DELETE CASCADE,
+  target_id INTEGER NOT NULL REFERENCES kg_entities(id) ON DELETE CASCADE,
+  relation_type TEXT NOT NULL,
+  weight REAL DEFAULT 1.0,
+  properties TEXT DEFAULT '{}',
+  activation_count INTEGER DEFAULT 0,
+  last_activated TEXT DEFAULT(datetime('now')),
+  created_at TEXT DEFAULT(datetime('now')),
+  UNIQUE(source_id, target_id, relation_type)
+);
+CREATE INDEX IF NOT EXISTS idx_edges_source ON kg_edges(source_id);
+CREATE INDEX IF NOT EXISTS idx_edges_target ON kg_edges(target_id);
+
+CREATE TABLE IF NOT EXISTS kg_entity_chunks (
+  entity_id INTEGER REFERENCES kg_entities(id) ON DELETE CASCADE,
+  chunk_id TEXT NOT NULL,
+  relevance REAL DEFAULT 1.0,
+  PRIMARY KEY (entity_id, chunk_id)
+);
+
+CREATE TABLE IF NOT EXISTS hypotheses (
+  id TEXT PRIMARY KEY,
+  cascade_id TEXT REFERENCES cascades(id) ON DELETE CASCADE,
+  statement TEXT NOT NULL,
+  parent_id TEXT,
+  affinity REAL DEFAULT 0.5,
+  generation INTEGER DEFAULT 0,
+  status TEXT DEFAULT 'proposed'
+    CHECK(status IN('proposed','testing','supported','refuted','uncertain','archived')),
+  supporting TEXT DEFAULT '[]',
+  contradicting TEXT DEFAULT '[]',
+  mutation_history TEXT DEFAULT '[]',
+  cd47_protected INTEGER DEFAULT 0,
+  created_at TEXT DEFAULT(datetime('now')),
+  updated_at TEXT DEFAULT(datetime('now'))
+);
+CREATE INDEX IF NOT EXISTS idx_hypotheses_cascade ON hypotheses(cascade_id);
+CREATE INDEX IF NOT EXISTS idx_hypotheses_status ON hypotheses(status);
+
+-- ============================================================
+-- TIER 2b: A-MEM ZETTELKASTEN LAYER
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS atomic_notes (
+  id TEXT PRIMARY KEY,
+  content TEXT NOT NULL,
+  note_type TEXT NOT NULL DEFAULT 'insight'
+    CHECK(note_type IN('insight','connection','question','contradiction','synthesis')),
+  source_finding_id TEXT REFERENCES findings(id),
+  source_entity_id INTEGER REFERENCES kg_entities(id),
+  cascade_id TEXT REFERENCES cascades(id) ON DELETE CASCADE,
+  cascade_round INTEGER,
+  keywords TEXT DEFAULT '[]',
+  maturity TEXT DEFAULT 'isolated_fact'
+    CHECK(maturity IN('isolated_fact','connected_fact','principle','mental_model')),
+  access_count INTEGER DEFAULT 0,
+  last_accessed TEXT DEFAULT(datetime('now')),
+  created_at TEXT DEFAULT(datetime('now'))
+);
+
+CREATE TABLE IF NOT EXISTS note_links (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  source_note_id TEXT NOT NULL REFERENCES atomic_notes(id) ON DELETE CASCADE,
+  target_note_id TEXT NOT NULL REFERENCES atomic_notes(id) ON DELETE CASCADE,
+  link_type TEXT NOT NULL DEFAULT 'relates_to'
+    CHECK(link_type IN('relates_to','supports','contradicts','refines','generalizes','exemplifies')),
+  strength REAL DEFAULT 1.0,
+  bidirectional INTEGER DEFAULT 1,
+  created_at TEXT DEFAULT(datetime('now')),
+  UNIQUE(source_note_id, target_note_id, link_type)
+);
+CREATE INDEX IF NOT EXISTS idx_note_links_source ON note_links(source_note_id);
+CREATE INDEX IF NOT EXISTS idx_note_links_target ON note_links(target_note_id);
+
+-- ============================================================
+-- TIER 3: TRUST & ANALYTICS
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS source_reputation (
+  domain TEXT PRIMARY KEY,
+  reputation_score REAL DEFAULT 0.5,
+  total_entries INTEGER DEFAULT 0,
+  admitted_entries INTEGER DEFAULT 0,
+  flagged_entries INTEGER DEFAULT 0,
+  rejected_entries INTEGER DEFAULT 0,
+  last_updated TEXT DEFAULT(datetime('now'))
+);
+
+CREATE TABLE IF NOT EXISTS ingestion_audit_log (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  finding_id TEXT,
+  action TEXT CHECK(action IN('admitted','quarantined','rejected')),
+  trust_composite REAL,
+  signals_json TEXT,
+  reason TEXT,
+  decided_at TEXT DEFAULT(datetime('now')),
+  human_override INTEGER DEFAULT 0
+);
+
+CREATE TABLE IF NOT EXISTS metrics (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  cascade_id TEXT REFERENCES cascades(id) ON DELETE CASCADE,
+  round_index INTEGER,
+  metric_name TEXT NOT NULL,
+  metric_value REAL NOT NULL,
+  recorded_at TEXT DEFAULT(datetime('now'))
+);
+CREATE INDEX IF NOT EXISTS idx_metrics_cascade ON metrics(cascade_id, metric_name);
+
+-- ============================================================
+-- TIER 4: MEMORY MANAGEMENT (SM-2 + CONSOLIDATION)
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS sm2_schedule (
+  item_id TEXT PRIMARY KEY,
+  item_type TEXT NOT NULL CHECK(item_type IN('finding','entity','hypothesis')),
+  ease_factor REAL DEFAULT 2.5,
+  interval_days REAL DEFAULT 1.0,
+  repetitions INTEGER DEFAULT 0,
+  next_review TEXT DEFAULT(datetime('now')),
+  last_reviewed TEXT,
+  retrieval_success_rate REAL DEFAULT 0.0
+);
+
+CREATE TABLE IF NOT EXISTS consolidation_log (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  cascade_id TEXT,
+  trigger_type TEXT CHECK(trigger_type IN('round_boundary','context_saturation','manual')),
+  items_processed INTEGER DEFAULT 0,
+  items_promoted INTEGER DEFAULT 0,
+  items_demoted INTEGER DEFAULT 0,
+  items_pruned INTEGER DEFAULT 0,
+  duration_ms INTEGER,
+  created_at TEXT DEFAULT(datetime('now'))
+);
+
+-- ============================================================
+-- TIER 5: STEER EVENTS & HITL
+-- ============================================================
+
+CREATE TABLE IF NOT EXISTS steer_events (
+  id INTEGER PRIMARY KEY AUTOINCREMENT,
+  cascade_id TEXT NOT NULL REFERENCES cascades(id) ON DELETE CASCADE,
+  event_type TEXT NOT NULL
+    CHECK(event_type IN('redirect','narrow','broaden','add_question','drop_hypothesis','approve','reject')),
+  instruction TEXT NOT NULL,
+  target_id TEXT,
+  applied INTEGER DEFAULT 0,
+  created_at TEXT DEFAULT(datetime('now'))
+);
+CREATE INDEX IF NOT EXISTS idx_steer_cascade ON steer_events(cascade_id, applied);

package/dist/graph/amem.d.ts

@@ -0,0 +1,80 @@
+/**
+ * A-MEM — Zettelkasten Atomic Notes Layer
+ *
+ * Each insight becomes an atomic note. Notes are bidirectionally linked
+ * based on content relationships. Notes mature over time:
+ *   isolated_fact → connected_fact → principle → mental_model
+ *
+ * Built on top of the entity/edge KG — notes reference entities and findings
+ * but form their own link structure optimized for emergent understanding.
+ */
+export interface AtomicNote {
+    id: string;
+    content: string;
+    noteType: 'insight' | 'connection' | 'question' | 'contradiction' | 'synthesis';
+    sourceFindingId: string | null;
+    sourceEntityId: number | null;
+    cascadeId: string | null;
+    cascadeRound: number | null;
+    keywords: string[];
+    maturity: 'isolated_fact' | 'connected_fact' | 'principle' | 'mental_model';
+    accessCount: number;
+    lastAccessed: string;
+    createdAt: string;
+}
+export interface NoteLink {
+    id: number;
+    sourceNoteId: string;
+    targetNoteId: string;
+    linkType: 'relates_to' | 'supports' | 'contradicts' | 'refines' | 'generalizes' | 'exemplifies';
+    strength: number;
+    bidirectional: boolean;
+    createdAt: string;
+}
+/**
+ * Create an atomic note from an insight.
+ * Content-addressable: same content = same note (idempotent).
+ */
+export declare function createNote(content: string, noteType?: AtomicNote['noteType'], keywords?: string[], sourceFindingId?: string, sourceEntityId?: number, cascadeId?: string, cascadeRound?: number): string;
+/**
+ * Link two notes bidirectionally.
+ */
+export declare function linkNotes(sourceId: string, targetId: string, linkType?: NoteLink['linkType'], strength?: number, bidirectional?: boolean): void;
+/**
+ * Get a note and its connections.
+ */
+export declare function getNote(noteId: string): {
+    note: AtomicNote;
+    links: any[];
+} | null;
+/**
+ * Find notes by keyword.
+ */
+export declare function searchNotes(keyword: string, limit?: number): AtomicNote[];
+/**
+ * Auto-extract notes from a finding.
+ * Creates an atomic note from the claim and links it to related entities.
+ */
+export declare function extractNotesFromFinding(findingId: string, cascadeId: string, cascadeRound: number): string[];
+/**
+ * Update note maturity based on connection count.
+ * Dreyfus progression: isolated_fact → connected_fact → principle → mental_model
+ */
+export declare function updateMaturity(): {
+    promoted: number;
+};
+/**
+ * Find orphan notes (no links) — candidates for linking or pruning.
+ */
+export declare function findOrphanNotes(): AtomicNote[];
+/**
+ * Get note graph statistics.
+ */
+export declare function getNoteStats(): {
+    totalNotes: number;
+    maturityCounts: Record<string, number>;
+    typeCounts: Record<string, number>;
+    totalLinks: number;
+    orphanCount: number;
+};
+//# sourceMappingURL=amem.d.ts.map

package/dist/graph/amem.js

@@ -0,0 +1,190 @@
+/**
+ * A-MEM — Zettelkasten Atomic Notes Layer
+ *
+ * Each insight becomes an atomic note. Notes are bidirectionally linked
+ * based on content relationships. Notes mature over time:
+ *   isolated_fact → connected_fact → principle → mental_model
+ *
+ * Built on top of the entity/edge KG — notes reference entities and findings
+ * but form their own link structure optimized for emergent understanding.
+ */
+import { getDb, contentHash } from '../db/index.js';
+// --- Note CRUD ---
+/**
+ * Create an atomic note from an insight.
+ * Content-addressable: same content = same note (idempotent).
+ */
+export function createNote(content, noteType = 'insight', keywords = [], sourceFindingId, sourceEntityId, cascadeId, cascadeRound) {
+    const db = getDb();
+    const id = contentHash(content);
+    db.prepare(`INSERT INTO atomic_notes
+    (id, content, note_type, source_finding_id, source_entity_id, cascade_id, cascade_round, keywords)
+    VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+    ON CONFLICT(id) DO UPDATE SET
+      access_count = access_count + 1,
+      last_accessed = datetime('now'),
+      keywords = json_patch(keywords, excluded.keywords)`)
+        .run(id, content, noteType, sourceFindingId ?? null, sourceEntityId ?? null, cascadeId ?? null, cascadeRound ?? null, JSON.stringify(keywords));
+    return id;
+}
+/**
+ * Link two notes bidirectionally.
+ */
+export function linkNotes(sourceId, targetId, linkType = 'relates_to', strength = 1.0, bidirectional = true) {
+    const db = getDb();
+    db.prepare(`INSERT INTO note_links (source_note_id, target_note_id, link_type, strength, bidirectional)
+    VALUES (?, ?, ?, ?, ?)
+    ON CONFLICT(source_note_id, target_note_id, link_type) DO UPDATE SET
+      strength = MAX(strength, excluded.strength)`)
+        .run(sourceId, targetId, linkType, strength, bidirectional ? 1 : 0);
+    // If bidirectional, create the reverse link too
+    if (bidirectional) {
+        db.prepare(`INSERT INTO note_links (source_note_id, target_note_id, link_type, strength, bidirectional)
+      VALUES (?, ?, ?, ?, ?)
+      ON CONFLICT(source_note_id, target_note_id, link_type) DO UPDATE SET
+        strength = MAX(strength, excluded.strength)`)
+            .run(targetId, sourceId, linkType, strength, 1);
+    }
+}
+/**
+ * Get a note and its connections.
+ */
+export function getNote(noteId) {
+    const db = getDb();
+    const row = db.prepare('SELECT * FROM atomic_notes WHERE id = ?').get(noteId);
+    if (!row)
+        return null;
+    // Touch access count
+    db.prepare('UPDATE atomic_notes SET access_count = access_count + 1, last_accessed = datetime(\'now\') WHERE id = ?')
+        .run(noteId);
+    const links = db.prepare(`SELECT nl.*, an.content as linked_content, an.note_type as linked_type
+    FROM note_links nl
+    JOIN atomic_notes an ON an.id = nl.target_note_id
+    WHERE nl.source_note_id = ?
+    ORDER BY nl.strength DESC`)
+        .all(noteId);
+    return { note: rowToNote(row), links };
+}
+/**
+ * Find notes by keyword.
+ */
+export function searchNotes(keyword, limit = 20) {
+    const db = getDb();
+    // Search in keywords JSON array and content
+    const rows = db.prepare(`SELECT * FROM atomic_notes
+    WHERE keywords LIKE ? OR content LIKE ?
+    ORDER BY access_count DESC, created_at DESC LIMIT ?`)
+        .all(`%${keyword}%`, `%${keyword}%`, limit);
+    return rows.map(rowToNote);
+}
+/**
+ * Auto-extract notes from a finding.
+ * Creates an atomic note from the claim and links it to related entities.
+ */
+export function extractNotesFromFinding(findingId, cascadeId, cascadeRound) {
+    const db = getDb();
+    const finding = db.prepare('SELECT * FROM findings WHERE id = ?').get(findingId);
+    if (!finding)
+        return [];
+    const noteIds = [];
+    // Create a note from the claim
+    const noteId = createNote(finding.claim, 'insight', [], // Keywords could be extracted by LLM
+    findingId, undefined, cascadeId, cascadeRound);
+    noteIds.push(noteId);
+    // Link to any existing notes with overlapping content
+    const existing = db.prepare(`SELECT id, content FROM atomic_notes
+    WHERE id != ? AND cascade_id = ?
+    ORDER BY created_at DESC LIMIT 50`)
+        .all(noteId, cascadeId);
+    for (const other of existing) {
+        // Simple keyword overlap check for auto-linking
+        const words1 = new Set(finding.claim.toLowerCase().split(/\s+/).filter((w) => w.length > 5));
+        const words2 = new Set(other.content.toLowerCase().split(/\s+/).filter((w) => w.length > 5));
+        let overlap = 0;
+        for (const w of words1) {
+            if (words2.has(w))
+                overlap++;
+        }
+        if (overlap >= 2) {
+            linkNotes(noteId, other.id, 'relates_to', Math.min(1.0, overlap * 0.2));
+        }
+    }
+    return noteIds;
+}
+/**
+ * Update note maturity based on connection count.
+ * Dreyfus progression: isolated_fact → connected_fact → principle → mental_model
+ */
+export function updateMaturity() {
+    const db = getDb();
+    let promoted = 0;
+    // Connected fact: ≥2 links
+    const r1 = db.prepare(`UPDATE atomic_notes SET maturity = 'connected_fact'
+    WHERE maturity = 'isolated_fact'
+    AND (SELECT COUNT(*) FROM note_links WHERE source_note_id = id OR target_note_id = id) >= 2`).run();
+    promoted += r1.changes;
+    // Principle: ≥5 links AND accessed ≥3 times
+    const r2 = db.prepare(`UPDATE atomic_notes SET maturity = 'principle'
+    WHERE maturity = 'connected_fact'
+    AND (SELECT COUNT(*) FROM note_links WHERE source_note_id = id OR target_note_id = id) >= 5
+    AND access_count >= 3`).run();
+    promoted += r2.changes;
+    // Mental model: ≥10 links AND accessed ≥10 times AND note_type = 'synthesis'
+    const r3 = db.prepare(`UPDATE atomic_notes SET maturity = 'mental_model'
+    WHERE maturity = 'principle'
+    AND (SELECT COUNT(*) FROM note_links WHERE source_note_id = id OR target_note_id = id) >= 10
+    AND access_count >= 10
+    AND note_type = 'synthesis'`).run();
+    promoted += r3.changes;
+    return { promoted };
+}
+/**
+ * Find orphan notes (no links) — candidates for linking or pruning.
+ */
+export function findOrphanNotes() {
+    const db = getDb();
+    const rows = db.prepare(`SELECT * FROM atomic_notes
+    WHERE id NOT IN (SELECT source_note_id FROM note_links)
+    AND id NOT IN (SELECT target_note_id FROM note_links)
+    ORDER BY created_at DESC`)
+        .all();
+    return rows.map(rowToNote);
+}
+/**
+ * Get note graph statistics.
+ */
+export function getNoteStats() {
+    const db = getDb();
+    const totalNotes = db.prepare('SELECT COUNT(*) as n FROM atomic_notes').get().n;
+    const totalLinks = db.prepare('SELECT COUNT(*) as n FROM note_links').get().n;
+    const orphanCount = db.prepare(`SELECT COUNT(*) as n FROM atomic_notes
+    WHERE id NOT IN (SELECT source_note_id FROM note_links)
+    AND id NOT IN (SELECT target_note_id FROM note_links)`).get().n;
+    const maturityRows = db.prepare('SELECT maturity, COUNT(*) as n FROM atomic_notes GROUP BY maturity').all();
+    const maturityCounts = {};
+    for (const r of maturityRows)
+        maturityCounts[r.maturity] = r.n;
+    const typeRows = db.prepare('SELECT note_type, COUNT(*) as n FROM atomic_notes GROUP BY note_type').all();
+    const typeCounts = {};
+    for (const r of typeRows)
+        typeCounts[r.note_type] = r.n;
+    return { totalNotes, maturityCounts, typeCounts, totalLinks, orphanCount };
+}
+// --- Helpers ---
+function rowToNote(row) {
+    return {
+        id: row.id,
+        content: row.content,
+        noteType: row.note_type,
+        sourceFindingId: row.source_finding_id,
+        sourceEntityId: row.source_entity_id,
+        cascadeId: row.cascade_id,
+        cascadeRound: row.cascade_round,
+        keywords: JSON.parse(row.keywords || '[]'),
+        maturity: row.maturity,
+        accessCount: row.access_count,
+        lastAccessed: row.last_accessed,
+        createdAt: row.created_at,
+    };
+}
+//# sourceMappingURL=amem.js.map

package/dist/graph/amem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"amem.js","sourceRoot":"","sources":["../../src/graph/amem.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AA2BpD,oBAAoB;AAEpB;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,OAAe,EACf,WAAmC,SAAS,EAC5C,WAAqB,EAAE,EACvB,eAAwB,EACxB,cAAuB,EACvB,SAAkB,EAClB,YAAqB;IAErB,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAEhC,EAAE,CAAC,OAAO,CAAC;;;;;;yDAM4C,CAAC;SACrD,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,eAAe,IAAI,IAAI,EAAE,cAAc,IAAI,IAAI,EACzE,SAAS,IAAI,IAAI,EAAE,YAAY,IAAI,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEvE,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CACvB,QAAgB,EAChB,QAAgB,EAChB,WAAiC,YAAY,EAC7C,WAAmB,GAAG,EACtB,gBAAyB,IAAI;IAE7B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,EAAE,CAAC,OAAO,CAAC;;;kDAGqC,CAAC;SAC9C,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtE,gDAAgD;IAChD,IAAI,aAAa,EAAE,CAAC;QAClB,EAAE,CAAC,OAAO,CAAC;;;oDAGqC,CAAC;aAC9C,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,MAAc;IACpC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAQ,CAAC;IACrF,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAEtB,qBAAqB;IACrB,EAAE,CAAC,OAAO,CAAC,yGAAyG,CAAC;SAClH,GAAG,CAAC,MAAM,CAAC,CAAC;IAEf,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC;;;;8BAIG,CAAC;SAC1B,GAAG,CAAC,MAAM,CAAC,CAAC;IAEf,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAe,EAAE,QAAgB,EAAE;IAC7D,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,4CAA4C;IAC5C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;wDAE8B,CAAC;SACpD,GAAG,CAAC,IAAI,OAAO,GAAG,EAAE,IAAI,OAAO,GAAG,EAAE,KAAK,CAAU,CAAC;IAEvD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,SAAiB,EACjB,SAAiB,EACjB,YAAoB;IAEpB,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAQ,CAAC;IACxF,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,+BAA+B;IAC/B,MAAM,MAAM,GAAG,UAAU,CACvB,OAAO,CAAC,KAAK,EACb,SAAS,EACT,EAAE,EAAE,qCAAqC;IACzC,SAAS,EACT,SAAS,EACT,SAAS,EACT,YAAY,CACb,CAAC;IACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAErB,sDAAsD;IACtD,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;sCAEQ,CAAC;SAClC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAU,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,gDAAgD;QAChD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACrG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACrG,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc;IAC5B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,2BAA2B;IAC3B,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC;;gGAEwE,CAAC,CAAC,GAAG,EAAE,CAAC;IACtG,QAAQ,IAAI,EAAE,CAAC,OAAO,CAAC;IAEvB,4CAA4C;IAC5C,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC;;;0BAGE,CAAC,CAAC,GAAG,EAAE,CAAC;IAChC,QAAQ,IAAI,EAAE,CAAC,OAAO,CAAC;IAEvB,6EAA6E;IAC7E,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC;;;;gCAIQ,CAAC,CAAC,GAAG,EAAE,CAAC;IACtC,QAAQ,IAAI,EAAE,CAAC,OAAO,CAAC;IAEvB,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe;IAC7B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;6BAGG,CAAC;SACzB,GAAG,EAAW,CAAC;IAClB,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY;IAO1B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,MAAM,UAAU,GAAI,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAAU,CAAC,CAAC,CAAC;IACzF,MAAM,UAAU,GAAI,EAAE,CAAC,OAAO,CAAC,sCAAsC,CAAC,CAAC,GAAG,EAAU,CAAC,CAAC,CAAC;IACvF,MAAM,WAAW,GAAI,EAAE,CAAC,OAAO,CAAC;;0DAEwB,CAAC,CAAC,GAAG,EAAU,CAAC,CAAC,CAAC;IAE1E,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,oEAAoE,CAAC,CAAC,GAAG,EAAW,CAAC;IACrH,MAAM,cAAc,GAA2B,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,YAAY;QAAE,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE/D,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sEAAsE,CAAC,CAAC,GAAG,EAAW,CAAC;IACnH,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAExD,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AAC7E,CAAC;AAED,kBAAkB;AAElB,SAAS,SAAS,CAAC,GAAQ;IACzB,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,eAAe,EAAE,GAAG,CAAC,iBAAiB;QACtC,cAAc,EAAE,GAAG,CAAC,gBAAgB;QACpC,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,YAAY,EAAE,GAAG,CAAC,aAAa;QAC/B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;QAC1C,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,WAAW,EAAE,GAAG,CAAC,YAAY;QAC7B,YAAY,EAAE,GAAG,CAAC,aAAa;QAC/B,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC;AACJ,CAAC"}

package/dist/graph/entities.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Knowledge Graph — Entity CRUD + Recursive CTE Traversal
+ *
+ * Edge-table pattern with SQLite recursive CTEs.
+ * Performance: 10K edges <50ms, 100K 50-500ms.
+ * ALWAYS ≤3 hop depth limit.
+ */
+export interface Entity {
+    id: number;
+    name: string;
+    entityType: string;
+    properties: Record<string, any>;
+    communityId: number | null;
+    betweenness: number;
+    tier: 'peripheral' | 'working' | 'core';
+    accessCount: number;
+    importance: number;
+    lastAccessed: string;
+    createdAt: string;
+}
+export interface Edge {
+    id: number;
+    sourceId: number;
+    targetId: number;
+    relationType: string;
+    weight: number;
+    properties: Record<string, any>;
+    activationCount: number;
+    lastActivated: string;
+    createdAt: string;
+}
+export interface TraversalResult {
+    entity: Entity;
+    depth: number;
+    path: string[];
+    edgeType: string;
+}
+export declare function upsertEntity(name: string, entityType: string, properties?: Record<string, any>, tier?: Entity['tier'], importance?: number): number;
+export declare function getEntity(name: string, entityType: string): Entity | null;
+export declare function getEntityById(id: number): Entity | null;
+export declare function searchEntities(query: string, limit?: number): Entity[];
+export declare function getEntitiesByTier(tier: Entity['tier']): Entity[];
+export declare function upsertEdge(sourceId: number, targetId: number, relationType: string, weight?: number, properties?: Record<string, any>): number;
+export declare function getEdgesFrom(entityId: number): Edge[];
+export declare function getEdgesTo(entityId: number): Edge[];
+/**
+ * Traverse the graph from a starting entity using recursive CTE.
+ * ALWAYS bounded to maxHops ≤ 3.
+ */
+export declare function traverse(startId: number, maxHops?: number, minWeight?: number, relationFilter?: string): TraversalResult[];
+/**
+ * Find orphan entities (no incoming or outgoing edges).
+ */
+export declare function findOrphans(): Entity[];
+/**
+ * Get graph statistics.
+ */
+export declare function getGraphStats(): {
+    entityCount: number;
+    edgeCount: number;
+    avgDegree: number;
+    tierCounts: Record<string, number>;
+    communityCounts: number;
+    orphanCount: number;
+};
+//# sourceMappingURL=entities.d.ts.map