nodebench-mcp 2.70.0 → 3.0.1

package/dist/subconscious/classifier.js

@@ -0,0 +1,118 @@
+/**
+ * Prompt Classifier — classifies user prompts into task types
+ * to determine which memory blocks are relevant for whisper injection.
+ *
+ * Port of Parselyfi's entity_context_extraction_agent pattern,
+ * but lightweight (keyword-based, no LLM call for classification).
+ */
+// ── Block Mapping ──────────────────────────────────────────────────────────
+const BLOCK_MAP = {
+    code: ["agent_preferences", "current_wedge", "validated_workflows"],
+    strategy: [
+        "founder_identity", "company_identity", "current_wedge",
+        "top_priorities", "open_contradictions",
+    ],
+    research: ["entity_watchlist", "recent_important_changes"],
+    delegation: ["validated_workflows", "packet_lineage", "agent_preferences"],
+    diligence: ["readiness_gaps", "company_identity", "packet_lineage"],
+    unknown: ["current_wedge"],
+};
+// ── Keyword Patterns ───────────────────────────────────────────────────────
+const PATTERNS = [
+    {
+        classification: "code",
+        keywords: /\b(implement|build|code|fix|bug|refactor|test|debug|compile|deploy|typescript|function|component|endpoint|route|api|import|export|npm|git|commit|push|pr|pull request|merge|lint|type[- ]?check)\b/i,
+    },
+    {
+        classification: "diligence",
+        keywords: /\b(investor|diligence|due diligence|banking|bank|fundraise|series [a-d]|pitch|deck|readiness|compliance|audit|soc2|legal|term sheet|valuation|cap table|runway)\b/i,
+    },
+    {
+        classification: "strategy",
+        keywords: /\b(strategy|wedge|positioning|roadmap|priorities|direction|pivot|moat|differentiat|competitive advantage|mission|vision|market fit|icp|buyer|distribution|pricing|go.?to.?market|gtm)\b/i,
+    },
+    {
+        classification: "delegation",
+        keywords: /\b(delegate|dispatch|agent|task|packet|assign|orchestrat|automat|background|worker|swarm|teammate|pipeline|workflow)\b/i,
+    },
+    {
+        classification: "research",
+        keywords: /\b(research|search|look up|find|competitor|market|entity|company|investigate|analyze|compare|benchmark|signal|trend|news|watchlist)\b/i,
+    },
+];
+// ── Lightweight NER ────────────────────────────────────────────────────────
+// Matches capitalized multi-word names that look like entities
+const ENTITY_PATTERN = /\b([A-Z][a-z]+(?:\s+[A-Z][a-z]+)*(?:\s+(?:Inc|LLC|Corp|Ltd|AI|Labs|Co)\.?)?)\b/g;
+// Common false positives to filter
+const ENTITY_STOPWORDS = new Set([
+    "The", "This", "That", "These", "Those", "What", "When", "Where", "Why",
+    "How", "Which", "Please", "Can", "Could", "Would", "Should", "Let",
+    "Make", "Build", "Create", "Update", "Delete", "Add", "Remove", "Fix",
+    "Run", "Start", "Stop", "Check", "Test", "Help", "Show", "Tell",
+    "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday",
+    "January", "February", "March", "April", "May", "June", "July",
+    "August", "September", "October", "November", "December",
+]);
+// ── Classifier ────────────────────────────────────────────────────��────────
+export function classifyPrompt(prompt) {
+    const scores = {
+        code: 0, strategy: 0, research: 0, delegation: 0, diligence: 0, unknown: 0,
+    };
+    for (const pattern of PATTERNS) {
+        const matches = prompt.match(pattern.keywords);
+        if (matches) {
+            scores[pattern.classification] += matches.length;
+        }
+    }
+    // Find the winning classification
+    let best = "unknown";
+    let bestScore = 0;
+    for (const [cls, score] of Object.entries(scores)) {
+        if (cls !== "unknown" && score > bestScore) {
+            best = cls;
+            bestScore = score;
+        }
+    }
+    // Confidence: normalized by total keyword matches
+    const totalMatches = Object.values(scores).reduce((a, b) => a + b, 0);
+    const confidence = totalMatches > 0 ? bestScore / totalMatches : 0;
+    // Extract entities
+    const entities = extractEntities(prompt);
+    return {
+        classification: best,
+        confidence: Math.min(1, confidence),
+        relevantBlocks: BLOCK_MAP[best],
+        entities,
+    };
+}
+export function extractEntities(text) {
+    const matches = text.matchAll(ENTITY_PATTERN);
+    const seen = new Set();
+    const entities = [];
+    for (const match of matches) {
+        const name = match[1].trim();
+        if (name.length < 3)
+            continue;
+        if (ENTITY_STOPWORDS.has(name))
+            continue;
+        if (seen.has(name.toLowerCase()))
+            continue;
+        seen.add(name.toLowerCase());
+        entities.push(name);
+    }
+    return entities;
+}
+/**
+ * Quick check: is this prompt trivial enough to skip whispering?
+ * Typo fixes, git operations, simple one-liners.
+ */
+export function isTrivialPrompt(prompt) {
+    if (prompt.length < 30)
+        return true;
+    if (/^(git |npm |npx |ls |cd |cat |pwd)/i.test(prompt.trim()))
+        return true;
+    if (/^fix (typo|spelling|whitespace|indent)/i.test(prompt.trim()))
+        return true;
+    return false;
+}
+//# sourceMappingURL=classifier.js.map

package/dist/subconscious/classifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classifier.js","sourceRoot":"","sources":["../../src/subconscious/classifier.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqBH,8EAA8E;AAE9E,MAAM,SAAS,GAA8C;IAC3D,IAAI,EAAE,CAAC,mBAAmB,EAAE,eAAe,EAAE,qBAAqB,CAAC;IACnE,QAAQ,EAAE;QACR,kBAAkB,EAAE,kBAAkB,EAAE,eAAe;QACvD,gBAAgB,EAAE,qBAAqB;KACxC;IACD,QAAQ,EAAE,CAAC,kBAAkB,EAAE,0BAA0B,CAAC;IAC1D,UAAU,EAAE,CAAC,qBAAqB,EAAE,gBAAgB,EAAE,mBAAmB,CAAC;IAC1E,SAAS,EAAE,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,gBAAgB,CAAC;IACnE,OAAO,EAAE,CAAC,eAAe,CAAC;CAC3B,CAAC;AAEF,8EAA8E;AAE9E,MAAM,QAAQ,GAAsE;IAClF;QACE,cAAc,EAAE,MAAM;QACtB,QAAQ,EAAE,qMAAqM;KAChN;IACD;QACE,cAAc,EAAE,WAAW;QAC3B,QAAQ,EAAE,oKAAoK;KAC/K;IACD;QACE,cAAc,EAAE,UAAU;QAC1B,QAAQ,EAAE,0LAA0L;KACrM;IACD;QACE,cAAc,EAAE,YAAY;QAC5B,QAAQ,EAAE,yHAAyH;KACpI;IACD;QACE,cAAc,EAAE,UAAU;QAC1B,QAAQ,EAAE,wIAAwI;KACnJ;CACF,CAAC;AAEF,8EAA8E;AAE9E,+DAA+D;AAC/D,MAAM,cAAc,GAAG,iFAAiF,CAAC;AAEzG,mCAAmC;AACnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;IACvE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK;IAClE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK;IACrE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAC/D,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ;IAC5E,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAC9D,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU;CACzD,CAAC,CAAC;AAEH,+EAA+E;AAE/E,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,MAAM,MAAM,GAAyC;QACnD,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;KAC3E,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;QACnD,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,IAAI,IAAI,GAAyB,SAAS,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAA0C,EAAE,CAAC;QAC3F,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YAC3C,IAAI,GAAG,GAAG,CAAC;YACX,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnE,mBAAmB;IACnB,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAEzC,OAAO;QACL,cAAc,EAAE,IAAI;QACpB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC;QACnC,cAAc,EAAE,SAAS,CAAC,IAAI,CAAC;QAC/B,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC9B,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACzC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAAE,SAAS;QAC3C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,qCAAqC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3E,IAAI,yCAAyC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/E,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/subconscious/graphEngine.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Graph Engine — knowledge graph operations on existing object_nodes + object_edges tables.
+ *
+ * Reuses the existing schema (no new tables). Adds BFS traversal,
+ * entity resolution, and contradiction detection.
+ *
+ * Entity types follow Parselyfi's LINKUP_COMPANY_SCHEMA pattern:
+ * company, person, initiative, packet, decision, event, concept, requirement.
+ */
+export type EntityType = "company" | "person" | "initiative" | "packet" | "decision" | "event" | "concept" | "requirement";
+export type RelationType = "related_to" | "caused_by" | "supports" | "contradicts" | "follows" | "references" | "part_of" | "derived_from" | "competes_with" | "leads" | "offers" | "announced";
+export interface GraphEntity {
+    id: string;
+    kind: EntityType;
+    label: string;
+    source: string;
+    status: "active" | "archived";
+    properties: Record<string, unknown>;
+    createdAt: string;
+    updatedAt: string;
+}
+export interface GraphEdge {
+    id: string;
+    fromId: string;
+    toId: string;
+    edgeType: RelationType;
+    confidence: number;
+    metadata: Record<string, unknown>;
+    createdAt: string;
+}
+export interface TraversalResult {
+    entity: GraphEntity;
+    hopDistance: number;
+    path: GraphEdge[];
+    reachedVia: RelationType;
+    confidence: number;
+}
+export interface GraphSummary {
+    totalEntities: number;
+    totalEdges: number;
+    entitiesByType: Record<string, number>;
+    edgesByType: Record<string, number>;
+    recentEntities: Array<{
+        label: string;
+        kind: string;
+        updatedAt: string;
+    }>;
+}
+export declare function upsertEntity(label: string, kind: EntityType, source: string, properties?: Record<string, unknown>): GraphEntity;
+export declare function findEntity(label: string, kind?: EntityType): GraphEntity | null;
+export declare function searchEntities(query: string, limit?: number): GraphEntity[];
+export declare function resolveEntity(nameOrId: string): GraphEntity | null;
+export declare function addEdge(fromId: string, toId: string, edgeType: RelationType, confidence?: number, metadata?: Record<string, unknown>): GraphEdge | null;
+export declare function getEdgesFrom(entityId: string, relationFilter?: RelationType[]): GraphEdge[];
+export declare function getEdgesTo(entityId: string, relationFilter?: RelationType[]): GraphEdge[];
+export declare function traverseGraph(startEntityId: string, maxDepth?: number, relationFilter?: RelationType[]): TraversalResult[];
+/**
+ * Find all entities connected by "contradicts" edges within N hops.
+ */
+export declare function findContradictions(entityId: string, maxDepth?: number): TraversalResult[];
+/**
+ * Trace derivation chain: derived_from → part_of → caused_by
+ */
+export declare function traceLineage(entityId: string, maxDepth?: number): TraversalResult[];
+export declare function getGraphSummary(): GraphSummary;

package/dist/subconscious/graphEngine.js

@@ -0,0 +1,234 @@
+/**
+ * Graph Engine — knowledge graph operations on existing object_nodes + object_edges tables.
+ *
+ * Reuses the existing schema (no new tables). Adds BFS traversal,
+ * entity resolution, and contradiction detection.
+ *
+ * Entity types follow Parselyfi's LINKUP_COMPANY_SCHEMA pattern:
+ * company, person, initiative, packet, decision, event, concept, requirement.
+ */
+import { getDb, genId } from "../db.js";
+// ── Entity CRUD ────────────────────────────────────────────────────────────
+export function upsertEntity(label, kind, source, properties = {}) {
+    const db = getDb();
+    const id = genId("ent");
+    // Check if entity with same label + kind exists
+    const existing = db
+        .prepare("SELECT * FROM object_nodes WHERE label = ? AND kind = ?")
+        .get(label, kind);
+    if (existing) {
+        // Merge properties
+        const existingProps = JSON.parse(existing.metadata_json || "{}");
+        const mergedProps = { ...existingProps, ...properties };
+        const mentionCount = (existingProps._mentionCount || 0) + 1;
+        mergedProps._mentionCount = mentionCount;
+        db.prepare(`UPDATE object_nodes SET metadata_json = ?, updated_at = datetime('now') WHERE id = ?`).run(JSON.stringify(mergedProps), existing.id);
+        return rowToEntity(db.prepare("SELECT * FROM object_nodes WHERE id = ?").get(existing.id));
+    }
+    // Create new
+    properties._mentionCount = 1;
+    db.prepare(`INSERT INTO object_nodes (id, kind, label, source, status, metadata_json)
+     VALUES (?, ?, ?, ?, 'active', ?)`).run(id, kind, label, source, JSON.stringify(properties));
+    return rowToEntity(db.prepare("SELECT * FROM object_nodes WHERE id = ?").get(id));
+}
+export function findEntity(label, kind) {
+    const db = getDb();
+    let row;
+    if (kind) {
+        row = db
+            .prepare("SELECT * FROM object_nodes WHERE label = ? AND kind = ?")
+            .get(label, kind);
+    }
+    else {
+        row = db
+            .prepare("SELECT * FROM object_nodes WHERE label = ? ORDER BY updated_at DESC LIMIT 1")
+            .get(label);
+    }
+    return row ? rowToEntity(row) : null;
+}
+export function searchEntities(query, limit = 10) {
+    const db = getDb();
+    // Try FTS5 first
+    try {
+        const rows = db
+            .prepare(`SELECT n.* FROM object_nodes_fts fts
+         JOIN object_nodes n ON n.rowid = fts.rowid
+         WHERE object_nodes_fts MATCH ?
+         ORDER BY rank
+         LIMIT ?`)
+            .all(query, limit);
+        return rows.map(rowToEntity);
+    }
+    catch {
+        // Fallback to LIKE
+        const rows = db
+            .prepare(`SELECT * FROM object_nodes
+         WHERE label LIKE ? OR metadata_json LIKE ?
+         ORDER BY updated_at DESC
+         LIMIT ?`)
+            .all(`%${query}%`, `%${query}%`, limit);
+        return rows.map(rowToEntity);
+    }
+}
+export function resolveEntity(nameOrId) {
+    const db = getDb();
+    // Try by ID
+    let row = db.prepare("SELECT * FROM object_nodes WHERE id = ?").get(nameOrId);
+    if (row)
+        return rowToEntity(row);
+    // Try by exact label
+    row = db
+        .prepare("SELECT * FROM object_nodes WHERE label = ? ORDER BY updated_at DESC LIMIT 1")
+        .get(nameOrId);
+    if (row)
+        return rowToEntity(row);
+    // Try fuzzy
+    const results = searchEntities(nameOrId, 1);
+    return results.length > 0 ? results[0] : null;
+}
+// ── Edge CRUD ──────────────────────────────────────────────────────────────
+export function addEdge(fromId, toId, edgeType, confidence = 0.8, metadata = {}) {
+    const db = getDb();
+    const id = genId("edge");
+    try {
+        db.prepare(`INSERT OR IGNORE INTO object_edges (id, from_id, to_id, edge_type, confidence, metadata_json)
+       VALUES (?, ?, ?, ?, ?, ?)`).run(id, fromId, toId, edgeType, confidence, JSON.stringify(metadata));
+        const row = db.prepare("SELECT * FROM object_edges WHERE id = ?").get(id);
+        return row ? rowToEdge(row) : null;
+    }
+    catch {
+        return null;
+    }
+}
+export function getEdgesFrom(entityId, relationFilter) {
+    const db = getDb();
+    if (relationFilter && relationFilter.length > 0) {
+        const placeholders = relationFilter.map(() => "?").join(",");
+        return db
+            .prepare(`SELECT * FROM object_edges WHERE from_id = ? AND edge_type IN (${placeholders})`)
+            .all(entityId, ...relationFilter).map(rowToEdge);
+    }
+    return db.prepare("SELECT * FROM object_edges WHERE from_id = ?").all(entityId).map(rowToEdge);
+}
+export function getEdgesTo(entityId, relationFilter) {
+    const db = getDb();
+    if (relationFilter && relationFilter.length > 0) {
+        const placeholders = relationFilter.map(() => "?").join(",");
+        return db
+            .prepare(`SELECT * FROM object_edges WHERE to_id = ? AND edge_type IN (${placeholders})`)
+            .all(entityId, ...relationFilter).map(rowToEdge);
+    }
+    return db.prepare("SELECT * FROM object_edges WHERE to_id = ?").all(entityId).map(rowToEdge);
+}
+// ── BFS Graph Traversal ────────────────────────────────────────────────────
+export function traverseGraph(startEntityId, maxDepth = 2, relationFilter) {
+    const visited = new Set();
+    const queue = [
+        { entityId: startEntityId, depth: 0, path: [] },
+    ];
+    const results = [];
+    const db = getDb();
+    while (queue.length > 0) {
+        const { entityId, depth, path } = queue.shift();
+        if (depth > maxDepth || visited.has(entityId))
+            continue;
+        visited.add(entityId);
+        // Get both outgoing and incoming edges
+        const outEdges = getEdgesFrom(entityId, relationFilter);
+        const inEdges = getEdgesTo(entityId, relationFilter);
+        const allEdges = [
+            ...outEdges.map((e) => ({ edge: e, neighborId: e.toId })),
+            ...inEdges.map((e) => ({ edge: e, neighborId: e.fromId })),
+        ];
+        for (const { edge, neighborId } of allEdges) {
+            if (visited.has(neighborId))
+                continue;
+            const newPath = [...path, edge];
+            const entityRow = db
+                .prepare("SELECT * FROM object_nodes WHERE id = ?")
+                .get(neighborId);
+            if (!entityRow)
+                continue;
+            results.push({
+                entity: rowToEntity(entityRow),
+                hopDistance: depth + 1,
+                path: newPath,
+                reachedVia: edge.edgeType,
+                confidence: newPath.reduce((acc, e) => acc * e.confidence, 1),
+            });
+            if (depth + 1 < maxDepth) {
+                queue.push({ entityId: neighborId, depth: depth + 1, path: newPath });
+            }
+        }
+    }
+    return results.sort((a, b) => b.confidence - a.confidence);
+}
+/**
+ * Find all entities connected by "contradicts" edges within N hops.
+ */
+export function findContradictions(entityId, maxDepth = 2) {
+    return traverseGraph(entityId, maxDepth, ["contradicts"]);
+}
+/**
+ * Trace derivation chain: derived_from → part_of → caused_by
+ */
+export function traceLineage(entityId, maxDepth = 5) {
+    return traverseGraph(entityId, maxDepth, ["derived_from", "part_of", "caused_by"]);
+}
+// ── Summary ────────────────────────────────────────────────────────────────
+export function getGraphSummary() {
+    const db = getDb();
+    const totalEntities = db.prepare("SELECT COUNT(*) as c FROM object_nodes").get().c;
+    const totalEdges = db.prepare("SELECT COUNT(*) as c FROM object_edges").get().c;
+    const kindCounts = db
+        .prepare("SELECT kind, COUNT(*) as c FROM object_nodes GROUP BY kind")
+        .all();
+    const entitiesByType = {};
+    for (const row of kindCounts)
+        entitiesByType[row.kind] = row.c;
+    const edgeTypeCounts = db
+        .prepare("SELECT edge_type, COUNT(*) as c FROM object_edges GROUP BY edge_type")
+        .all();
+    const edgesByType = {};
+    for (const row of edgeTypeCounts)
+        edgesByType[row.edge_type] = row.c;
+    const recent = db
+        .prepare("SELECT label, kind, updated_at FROM object_nodes ORDER BY updated_at DESC LIMIT 10")
+        .all();
+    return {
+        totalEntities,
+        totalEdges,
+        entitiesByType,
+        edgesByType,
+        recentEntities: recent.map((r) => ({
+            label: r.label,
+            kind: r.kind,
+            updatedAt: r.updated_at,
+        })),
+    };
+}
+// ── Helpers ────────────────────────────────────────────────────────────────
+function rowToEntity(row) {
+    return {
+        id: row.id,
+        kind: row.kind,
+        label: row.label,
+        source: row.source,
+        status: row.status,
+        properties: JSON.parse(row.metadata_json || "{}"),
+        createdAt: row.created_at,
+        updatedAt: row.updated_at,
+    };
+}
+function rowToEdge(row) {
+    return {
+        id: row.id,
+        fromId: row.from_id,
+        toId: row.to_id,
+        edgeType: row.edge_type,
+        confidence: row.confidence,
+        metadata: JSON.parse(row.metadata_json || "{}"),
+        createdAt: row.created_at,
+    };
+}
+//# sourceMappingURL=graphEngine.js.map

package/dist/subconscious/graphEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphEngine.js","sourceRoot":"","sources":["../../src/subconscious/graphEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAkDxC,8EAA8E;AAE9E,MAAM,UAAU,YAAY,CAC1B,KAAa,EACb,IAAgB,EAChB,MAAc,EACd,aAAsC,EAAE;IAExC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAExB,gDAAgD;IAChD,MAAM,QAAQ,GAAG,EAAE;SAChB,OAAO,CAAC,yDAAyD,CAAC;SAClE,GAAG,CAAC,KAAK,EAAE,IAAI,CAAQ,CAAC;IAE3B,IAAI,QAAQ,EAAE,CAAC;QACb,mBAAmB;QACnB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,EAAE,GAAG,aAAa,EAAE,GAAG,UAAU,EAAE,CAAC;QACxD,MAAM,YAAY,GAAG,CAAC,aAAa,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5D,WAAW,CAAC,aAAa,GAAG,YAAY,CAAC;QAEzC,EAAE,CAAC,OAAO,CACR,sFAAsF,CACvF,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QAEhD,OAAO,WAAW,CAChB,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAQ,CAC9E,CAAC;IACJ,CAAC;IAED,aAAa;IACb,UAAU,CAAC,aAAa,GAAG,CAAC,CAAC;IAC7B,EAAE,CAAC,OAAO,CACR;sCACkC,CACnC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;IAE3D,OAAO,WAAW,CAChB,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAQ,CACrE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,IAAiB;IACzD,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,IAAI,GAAQ,CAAC;IACb,IAAI,IAAI,EAAE,CAAC;QACT,GAAG,GAAG,EAAE;aACL,OAAO,CAAC,yDAAyD,CAAC;aAClE,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACtB,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,EAAE;aACL,OAAO,CAAC,6EAA6E,CAAC;aACtF,GAAG,CAAC,KAAK,CAAC,CAAC;IAChB,CAAC;IACD,OAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,QAAgB,EAAE;IAC9D,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,iBAAiB;IACjB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CACN;;;;iBAIS,CACV;aACA,GAAG,CAAC,KAAK,EAAE,KAAK,CAAU,CAAC;QAC9B,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,mBAAmB;QACnB,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CACN;;;iBAGS,CACV;aACA,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,KAAK,CAAU,CAAC;QACnD,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,QAAgB;IAC5C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,YAAY;IACZ,IAAI,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;IACrF,IAAI,GAAG;QAAE,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IACjC,qBAAqB;IACrB,GAAG,GAAG,EAAE;SACL,OAAO,CAAC,6EAA6E,CAAC;SACtF,GAAG,CAAC,QAAQ,CAAQ,CAAC;IACxB,IAAI,GAAG;QAAE,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IACjC,YAAY;IACZ,MAAM,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC5C,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC;AAED,8EAA8E;AAE9E,MAAM,UAAU,OAAO,CACrB,MAAc,EACd,IAAY,EACZ,QAAsB,EACtB,aAAqB,GAAG,EACxB,WAAoC,EAAE;IAEtC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB,IAAI,CAAC;QACH,EAAE,CAAC,OAAO,CACR;iCAC2B,CAC5B,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxE,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;QACjF,OAAO,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,cAA+B;IAC5E,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,IAAI,cAAc,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7D,OACE,EAAE;aACC,OAAO,CACN,kEAAkE,YAAY,GAAG,CAClF;aACA,GAAG,CAAC,QAAQ,EAAE,GAAG,cAAc,CACnC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACnB,CAAC;IACD,OACE,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,CAAC,QAAQ,CACxE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,QAAgB,EAAE,cAA+B;IAC1E,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,IAAI,cAAc,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7D,OACE,EAAE;aACC,OAAO,CACN,gEAAgE,YAAY,GAAG,CAChF;aACA,GAAG,CAAC,QAAQ,EAAE,GAAG,cAAc,CACnC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACnB,CAAC;IACD,OACE,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,QAAQ,CACtE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACnB,CAAC;AAED,8EAA8E;AAE9E,MAAM,UAAU,aAAa,CAC3B,aAAqB,EACrB,WAAmB,CAAC,EACpB,cAA+B;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAkE;QAC3E,EAAE,QAAQ,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE;KAChD,CAAC;IACF,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACjD,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS;QACxD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,uCAAuC;QACvC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG;YACf,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACzD,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;SAC3D,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC5C,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YACtC,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC;YAChC,MAAM,SAAS,GAAG,EAAE;iBACjB,OAAO,CAAC,yCAAyC,CAAC;iBAClD,GAAG,CAAC,UAAU,CAAQ,CAAC;YAC1B,IAAI,CAAC,SAAS;gBAAE,SAAS;YAEzB,OAAO,CAAC,IAAI,CAAC;gBACX,MAAM,EAAE,WAAW,CAAC,SAAS,CAAC;gBAC9B,WAAW,EAAE,KAAK,GAAG,CAAC;gBACtB,IAAI,EAAE,OAAO;gBACb,UAAU,EAAE,IAAI,CAAC,QAAwB;gBACzC,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;aAC9D,CAAC,CAAC;YAEH,IAAI,KAAK,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB,EAAE,WAAmB,CAAC;IACvE,OAAO,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,WAAmB,CAAC;IACjE,OAAO,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,cAAc,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,8EAA8E;AAE9E,MAAM,UAAU,eAAe;IAC7B,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,aAAa,GACjB,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EACzD,CAAC,CAAC,CAAC;IACJ,MAAM,UAAU,GACd,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EACzD,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAG,EAAE;SAClB,OAAO,CAAC,4DAA4D,CAAC;SACrE,GAAG,EAAW,CAAC;IAClB,MAAM,cAAc,GAA2B,EAAE,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,UAAU;QAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAE/D,MAAM,cAAc,GAAG,EAAE;SACtB,OAAO,CAAC,sEAAsE,CAAC;SAC/E,GAAG,EAAW,CAAC;IAClB,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,cAAc;QAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAErE,MAAM,MAAM,GAAG,EAAE;SACd,OAAO,CACN,oFAAoF,CACrF;SACA,GAAG,EAAW,CAAC;IAElB,OAAO;QACL,aAAa;QACb,UAAU;QACV,cAAc;QACd,WAAW;QACX,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;YACtC,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,SAAS,EAAE,CAAC,CAAC,UAAU;SACxB,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED,8EAA8E;AAE9E,SAAS,WAAW,CAAC,GAAQ;IAC3B,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAkB;QAC5B,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,MAAM,EAAE,GAAG,CAAC,MAA+B;QAC3C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC;QACjD,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,GAAQ;IACzB,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,IAAI,EAAE,GAAG,CAAC,KAAK;QACf,QAAQ,EAAE,GAAG,CAAC,SAAyB;QACvC,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC;QAC/C,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC;AACJ,CAAC"}

package/dist/subconscious/index.d.ts

@@ -0,0 +1,19 @@
+/**
+ * NodeBench Subconscious — background intelligence agent.
+ *
+ * Watches founder/coding sessions, maintains company truth memory blocks,
+ * builds a knowledge graph of entities + relationships, and whispers
+ * packet-aware guidance back into Claude Code and NodeBench surfaces.
+ *
+ * Architecture:
+ * - 12 typed memory blocks (blocks.ts)
+ * - Prompt classifier (classifier.ts)
+ * - Knowledge graph on existing object_nodes + object_edges (graphEngine.ts)
+ * - Whisper policy with suppression rules (whisperPolicy.ts)
+ * - 10 MCP tools (tools.ts)
+ */
+export { subconsciousTools } from "./tools.js";
+export { type BlockType, type SubconsciousBlock, ALL_BLOCK_TYPES, getBlock, getAllBlocks, updateBlock, getStaleBlocks, getBlockSummary, ensureBlocksExist, } from "./blocks.js";
+export { type PromptClassification, type ClassificationResult, classifyPrompt, extractEntities, isTrivialPrompt, } from "./classifier.js";
+export { type EntityType, type RelationType, type GraphEntity, type GraphEdge, type TraversalResult, upsertEntity, findEntity, searchEntities, resolveEntity, addEdge, traverseGraph, findContradictions, traceLineage, getGraphSummary, } from "./graphEngine.js";
+export { type SubconsciousMode, type WhisperResult, generateWhisper, } from "./whisperPolicy.js";

package/dist/subconscious/index.js

@@ -0,0 +1,20 @@
+/**
+ * NodeBench Subconscious — background intelligence agent.
+ *
+ * Watches founder/coding sessions, maintains company truth memory blocks,
+ * builds a knowledge graph of entities + relationships, and whispers
+ * packet-aware guidance back into Claude Code and NodeBench surfaces.
+ *
+ * Architecture:
+ * - 12 typed memory blocks (blocks.ts)
+ * - Prompt classifier (classifier.ts)
+ * - Knowledge graph on existing object_nodes + object_edges (graphEngine.ts)
+ * - Whisper policy with suppression rules (whisperPolicy.ts)
+ * - 10 MCP tools (tools.ts)
+ */
+export { subconsciousTools } from "./tools.js";
+export { ALL_BLOCK_TYPES, getBlock, getAllBlocks, updateBlock, getStaleBlocks, getBlockSummary, ensureBlocksExist, } from "./blocks.js";
+export { classifyPrompt, extractEntities, isTrivialPrompt, } from "./classifier.js";
+export { upsertEntity, findEntity, searchEntities, resolveEntity, addEdge, traverseGraph, findContradictions, traceLineage, getGraphSummary, } from "./graphEngine.js";
+export { generateWhisper, } from "./whisperPolicy.js";
+//# sourceMappingURL=index.js.map

package/dist/subconscious/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/subconscious/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAE/C,OAAO,EAGL,eAAe,EACf,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,cAAc,EACd,eAAe,EACf,iBAAiB,GAClB,MAAM,aAAa,CAAC;AAErB,OAAO,EAGL,cAAc,EACd,eAAe,EACf,eAAe,GAChB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAML,YAAY,EACZ,UAAU,EACV,cAAc,EACd,aAAa,EACb,OAAO,EACP,aAAa,EACb,kBAAkB,EAClB,YAAY,EACZ,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAGL,eAAe,GAChB,MAAM,oBAAoB,CAAC"}

package/dist/subconscious/tools.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Subconscious MCP Tools — 10 tools for querying subconscious state + graph.
+ */
+import type { McpTool } from "../types.js";
+export declare const subconsciousTools: McpTool[];