hippo-memory 1.16.0 → 1.18.0

package/dist/graph-extract.js

@@ -3,19 +3,22 @@
  * (docs/plans/2026-06-01-e3-deterministic-extraction.md).
  *
  * Populates the E3 graph from the already-structured consolidated E2-object tables -
- * NO NLP, no precision gate. The graph is a pure derived function of the current E2
- * state, so `extractGraph` is an idempotent REBUILD: clear the tenant's graph, then
- * re-derive entities + `supersedes` relations from decisions / policies /
- * customer_notes / project_briefs (the four E2 types whose kind maps to the
- * `entity_type` enum). All writes go through the src/graph.ts consolidated-source
- * guard (insertEntity / insertRelation / clearGraph); this module issues no raw SQL.
+ * NO NLP, no precision gate for entities + supersedes. The graph is a pure derived
+ * function of the current E2 state, so `extractGraph` is an idempotent REBUILD: clear
+ * the tenant's graph, then re-derive entities + `supersedes` relations from decisions /
+ * policies / customer_notes / project_briefs (the four E2 types whose kind maps to the
+ * `entity_type` enum). All writes go through the src/graph.ts consolidated-source guard
+ * (insertEntity / insertRelation / clearGraph); this module issues no raw SQL.
  *
- * Deferred (follow-ups): NLP prose-extraction from raw/distilled memories (the
- * 80%-precision gold-set part); skill/incident/process entities (not in the
- * entity_type enum); cross-object relations beyond supersedes; the `hippo sleep`
- * enqueue-hook; E3.2 multi-hop recall. When a SECOND producer (NLP) lands, extraction
- * will need a `source` marker so the rebuild scopes to only the deterministically-
- * extracted rows.
+ * Pass 3 (E3 cross-object, docs/plans/2026-06-02-e3-cross-object-references.md) adds the
+ * first CROSS-OBJECT relations: a deterministic NAME-MATCH heuristic that emits a
+ * `references` edge when one consolidated object's text contains another entity's name.
+ * It is conservative (word-boundary, length-bounded, ambiguity-guarded, per-source
+ * capped); its precision is measured + reported, not assumed.
+ *
+ * Deferred (follow-ups): NLP prose-extraction (semantic depends-on / blocked-by / owns);
+ * skill/incident/process entities (not in the entity_type enum - needs a migration); the
+ * `hippo sleep` enqueue-hook.
  */
 import { clearGraph, insertEntity, insertRelation, MAX_ENTITY_NAME_LEN } from './graph.js';
 import { loadDecisions } from './decisions.js';
@@ -27,10 +30,29 @@ import { assertTenantId } from './store.js';
  *  set exceeds this is truncated; `ExtractResult.truncated` records it so the
  *  incompleteness is observable rather than silent. */
 export const MAX_EXTRACT_PER_TYPE = 10000;
+// --- Pass 3 (cross-object references) tunables ------------------------------------
+/** A target entity name must be in [MIN, MAX] chars to be matched: MIN skips short /
+ *  generic words; MAX skips prose (a decision's prose name is never a target, only a
+ *  source). */
+export const MIN_REF_NAME_LEN = 4;
+export const MAX_REF_NAME_LEN = 80;
+/** Per-source cap so one object cannot explode the graph with references edges. */
+export const MAX_REFERENCES_PER_OBJECT = 25;
+/** Regex-size bound: at most this many distinct target names enter the combined
+ *  alternation, keeping the scan regex sane on a huge store. */
+export const MAX_TARGET_NAMES = 5000;
 /** Stable map key: entity types share an id space across tables, so key by both. */
 function keyOf(entityType, e2Id) {
     return `${entityType}:${e2Id}`;
 }
+/** Escape a string for safe use as a literal inside a RegExp alternation. */
+function escapeRegex(s) {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+}
+/** Unordered entity-id pair key, so a relation between a,b is found in either direction. */
+function pairKey(a, b) {
+    return a < b ? `${a}:${b}` : `${b}:${a}`;
+}
 /**
  * Load a type's ACTIVE + SUPERSEDED rows (excluding `closed` = retired), normalised.
  * Calls the loader once per status so MAX_EXTRACT_PER_TYPE is a per-status budget
@@ -40,7 +62,9 @@ function loadType(hippoRoot, tenantId, entityType,
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 loadFn, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-nameOf) {
+nameOf, 
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+textOf) {
     const rows = [];
     let hitCap = false;
     for (const status of ['active', 'superseded']) {
@@ -52,6 +76,7 @@ nameOf) {
                 entityType,
                 e2Id: r.id,
                 name: nameOf(r),
+                searchText: textOf(r),
                 memoryId: (r.memoryId ?? null),
                 supersededBy: (r.supersededBy ?? null),
             });
@@ -67,10 +92,10 @@ nameOf) {
 export function extractGraph(hippoRoot, tenantId) {
     assertTenantId('extractGraph', tenantId);
     const sources = [
-        { entityType: 'decision', loadFn: loadDecisions, nameOf: (r) => r.decisionText },
-        { entityType: 'policy', loadFn: loadPolicies, nameOf: (r) => r.policyName },
-        { entityType: 'customer', loadFn: loadCustomerNotes, nameOf: (r) => r.customer },
-        { entityType: 'project', loadFn: loadProjectBriefs, nameOf: (r) => r.repo },
+        { entityType: 'decision', loadFn: loadDecisions, nameOf: (r) => r.decisionText, textOf: (r) => [r.decisionText, r.context].filter(Boolean).join(' ') },
+        { entityType: 'policy', loadFn: loadPolicies, nameOf: (r) => r.policyName, textOf: (r) => [r.policyName, r.policyText].filter(Boolean).join(' ') },
+        { entityType: 'customer', loadFn: loadCustomerNotes, nameOf: (r) => r.customer, textOf: (r) => [r.customer, r.note].filter(Boolean).join(' ') },
+        { entityType: 'project', loadFn: loadProjectBriefs, nameOf: (r) => r.repo, textOf: (r) => [r.repo, r.summary].filter(Boolean).join(' ') },
     ];
     // Rebuild from scratch: the graph is derived, so clear then re-derive.
     clearGraph(hippoRoot, tenantId);
@@ -79,10 +104,12 @@ export function extractGraph(hippoRoot, tenantId) {
     const allRows = [];
     const entityIdByKey = new Map();
     const memoryIdByKey = new Map();
+    // Created entities ONLY (drives Pass 3 sources + targets), in stable insertion order.
+    const created = [];
     // Pass 1: entities. Skip rows whose source memory was forgotten (NULL memory_id) -
     // an entity must reference a consolidated memory (entities.memory_id is NOT NULL).
     for (const src of sources) {
-        const { rows, hitCap } = loadType(hippoRoot, tenantId, src.entityType, src.loadFn, src.nameOf);
+        const { rows, hitCap } = loadType(hippoRoot, tenantId, src.entityType, src.loadFn, src.nameOf, src.textOf);
         if (hitCap)
             truncated.push(src.entityType);
         byType[src.entityType] = 0;
@@ -110,6 +137,7 @@ export function extractGraph(hippoRoot, tenantId) {
             const k = keyOf(row.entityType, row.e2Id);
             entityIdByKey.set(k, entity.id);
             memoryIdByKey.set(k, row.memoryId);
+            created.push({ entityId: entity.id, entityType: row.entityType, memoryId: row.memoryId, name, searchText: row.searchText ?? '', superseded: row.supersededBy !== null });
             byType[src.entityType] += 1;
         }
     }
@@ -117,6 +145,11 @@ export function extractGraph(hippoRoot, tenantId) {
     // "Y supersedes X" - but only when BOTH X and Y were extracted (e.g. Y may be closed
     // and absent). The relation is sourced from Y's consolidated memory.
     let relations = 0;
+    // Entity-id pairs already related by supersedes (unordered). Pass 3 skips a references
+    // edge for such a pair: a version-extends-its-predecessor's-name containment (e.g.
+    // "Adopt X (managed)" contains "Adopt X") is a name artifact, not a cross-reference,
+    // and supersedes already captures their relationship.
+    const supersededPairs = new Set();
     for (const row of allRows) {
         if (row.supersededBy === null)
             continue;
@@ -133,9 +166,94 @@ export function extractGraph(hippoRoot, tenantId) {
             relType: 'supersedes',
             memoryId: yMemoryId,
         });
+        supersededPairs.add(pairKey(fromId, toId));
         relations += 1;
     }
-    const entities = Array.from(entityIdByKey.keys()).length;
-    return { entities, relations, byType, truncated };
+    // Pass 3: cross-object `references` edges via conservative name matching. A source's
+    // text containing a target entity's name -> "source references target". Sources +
+    // targets are CREATED entities only, so insertRelation never sees a null source memory.
+    const references = extractReferences(hippoRoot, tenantId, created, supersededPairs, truncated);
+    relations += references;
+    const entities = created.length;
+    return { entities, relations, references, byType, truncated };
+}
+/**
+ * Pass 3. Build a target-name index from the created entities (names within the length
+ * bounds, ambiguous names dropped), scan each created entity's text once with one
+ * combined word-boundary regex, and emit `references` edges (self-skipped, deduped,
+ * per-source capped). Returns the number of references edges written.
+ */
+function extractReferences(hippoRoot, tenantId, created, supersededPairs, truncated) {
+    // Build the target index: normalised name -> single entity id. A name is a target only
+    // if its length is in bounds; a name shared by >1 entity is AMBIGUOUS and dropped.
+    const nameToId = new Map();
+    const ambiguous = new Set();
+    for (const e of created) {
+        // References are among ACTIVE entities only: a superseded (outdated) row is not a
+        // current cross-reference target (codex).
+        if (e.superseded)
+            continue;
+        // Decisions are SOURCE-only: their name is decision prose, referenced by supersedes,
+        // not by name-mention. Excluding them as targets also prevents a decision's own name
+        // (== its searchText) from whole-string self-matching and shadowing embedded targets.
+        if (e.entityType === 'decision')
+            continue;
+        const norm = e.name.trim().toLowerCase();
+        if (norm.length < MIN_REF_NAME_LEN || norm.length > MAX_REF_NAME_LEN)
+            continue;
+        if (ambiguous.has(norm))
+            continue;
+        if (nameToId.has(norm)) {
+            // Second distinct entity with this name (and not its own id repeated) -> ambiguous.
+            if (nameToId.get(norm) !== e.entityId) {
+                nameToId.delete(norm);
+                ambiguous.add(norm);
+            }
+            continue;
+        }
+        nameToId.set(norm, e.entityId);
+    }
+    if (nameToId.size === 0)
+        return 0;
+    // Record the truncation (observability, mirroring MAX_EXTRACT_PER_TYPE) so a >cap
+    // store's under-matched references are not silent.
+    if (nameToId.size > MAX_TARGET_NAMES)
+        truncated.push('references-targets');
+    // LONGEST name first, then alphabetical: JS regex alternation is leftmost-first, so
+    // ordering longer names before their prefixes makes the match longest-at-position
+    // (`postgres pro` wins over `postgres`; codex). Deterministic, so truncation is stable.
+    const targetNames = [...nameToId.keys()]
+        .sort((a, b) => b.length - a.length || (a < b ? -1 : a > b ? 1 : 0))
+        .slice(0, MAX_TARGET_NAMES);
+    const pattern = `\\b(?:${targetNames.map(escapeRegex).join('|')})\\b`;
+    const re = new RegExp(pattern, 'gi');
+    let references = 0;
+    for (const src of created) {
+        if (src.superseded)
+            continue; // superseded sources hold only stale references (codex)
+        if (!src.searchText)
+            continue;
+        const targets = new Set();
+        for (const m of src.searchText.matchAll(re)) {
+            const targetId = nameToId.get(m[0].toLowerCase());
+            if (targetId === undefined || targetId === src.entityId)
+                continue; // miss / self
+            if (supersededPairs.has(pairKey(src.entityId, targetId)))
+                continue; // already version-related
+            targets.add(targetId);
+            if (targets.size >= MAX_REFERENCES_PER_OBJECT)
+                break; // per-source cap
+        }
+        for (const targetId of targets) {
+            insertRelation(hippoRoot, tenantId, {
+                fromEntityId: src.entityId,
+                toEntityId: targetId,
+                relType: 'references',
+                memoryId: src.memoryId, // the source object's consolidated memory
+            });
+            references += 1;
+        }
+    }
+    return references;
 }
 //# sourceMappingURL=graph-extract.js.map

package/dist/graph-extract.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-extract.js","sourceRoot":"","sources":["../src/graph-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,mBAAmB,EAAmB,MAAM,YAAY,CAAC;AAC5G,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C;;uDAEuD;AACvD,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC;AAuB1C,oFAAoF;AACpF,SAAS,KAAK,CAAC,UAAsB,EAAE,IAAY;IACjD,OAAO,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC;AACjC,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,SAAiB,EACjB,QAAgB,EAChB,UAAsB;AACtB,8DAA8D;AAC9D,MAA0D;AAC1D,8DAA8D;AAC9D,MAA4B;IAE5B,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,MAAM,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAU,EAAE,CAAC;QACvD,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC,CAAC;QACpF,IAAI,MAAM,CAAC,MAAM,KAAK,oBAAoB;YAAE,MAAM,GAAG,IAAI,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC;gBACR,UAAU;gBACV,IAAI,EAAE,CAAC,CAAC,EAAY;gBACpB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;gBACf,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAkB;gBAC/C,YAAY,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,IAAI,CAAkB;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB,EAAE,QAAgB;IAC9D,cAAc,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IAEzC,MAAM,OAAO,GAMR;QACH,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE;QAChF,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE;QAC3E,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;QAChF,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;KAC5E,CAAC;IAEF,uEAAuE;IACvE,UAAU,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEhD,mFAAmF;IACnF,mFAAmF;IACnF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/F,IAAI,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI;gBAAE,SAAS;YACpC,yEAAyE;YACzE,sEAAsE;YACtE,4EAA4E;YAC5E,gFAAgF;YAChF,6EAA6E;YAC7E,wEAAwE;YACxE,gFAAgF;YAChF,+EAA+E;YAC/E,8DAA8D;YAC9D,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE;gBAC/C,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,IAAI;gBACJ,QAAQ,EAAE,GAAG,CAAC,QAAQ;aACvB,CAAC,CAAC;YACH,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,mFAAmF;IACnF,qFAAqF;IACrF,qEAAqE;IACrE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,YAAY,KAAK,IAAI;YAAE,SAAS;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;QACtD,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe;QACrD,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS;YAAE,SAAS;QACpF,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE;YAClC,YAAY,EAAE,MAAM;YACpB,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,YAAY;YACrB,QAAQ,EAAE,SAAS;SACpB,CAAC,CAAC;QACH,SAAS,IAAI,CAAC,CAAC;IACjB,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IACzD,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AACpD,CAAC"}
+{"version":3,"file":"graph-extract.js","sourceRoot":"","sources":["../src/graph-extract.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,mBAAmB,EAAmB,MAAM,YAAY,CAAC;AAC5G,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C;;uDAEuD;AACvD,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC;AAE1C,qFAAqF;AACrF;;eAEe;AACf,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAClC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AACnC,mFAAmF;AACnF,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAC5C;gEACgE;AAChE,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AA4BrC,oFAAoF;AACpF,SAAS,KAAK,CAAC,UAAsB,EAAE,IAAY;IACjD,OAAO,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC;AACjC,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED,4FAA4F;AAC5F,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,SAAiB,EACjB,QAAgB,EAChB,UAAsB;AACtB,8DAA8D;AAC9D,MAA0D;AAC1D,8DAA8D;AAC9D,MAA4B;AAC5B,8DAA8D;AAC9D,MAA4B;IAE5B,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,MAAM,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAU,EAAE,CAAC;QACvD,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC,CAAC;QACpF,IAAI,MAAM,CAAC,MAAM,KAAK,oBAAoB;YAAE,MAAM,GAAG,IAAI,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC;gBACR,UAAU;gBACV,IAAI,EAAE,CAAC,CAAC,EAAY;gBACpB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;gBACf,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;gBACrB,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAkB;gBAC/C,YAAY,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,IAAI,CAAkB;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC1B,CAAC;AAgBD;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB,EAAE,QAAgB;IAC9D,cAAc,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IAEzC,MAAM,OAAO,GAQR;QACH,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACtJ,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QAClJ,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QAC/I,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;KAC1I,CAAC;IAEF,uEAAuE;IACvE,UAAU,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAEhC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,sFAAsF;IACtF,MAAM,OAAO,GAAoB,EAAE,CAAC;IAEpC,mFAAmF;IACnF,mFAAmF;IACnF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3G,IAAI,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI;gBAAE,SAAS;YACpC,yEAAyE;YACzE,sEAAsE;YACtE,4EAA4E;YAC5E,gFAAgF;YAChF,6EAA6E;YAC7E,wEAAwE;YACxE,gFAAgF;YAChF,+EAA+E;YAC/E,8DAA8D;YAC9D,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAChC,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE;gBAC/C,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,IAAI;gBACJ,QAAQ,EAAE,GAAG,CAAC,QAAQ;aACvB,CAAC,CAAC;YACH,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC,CAAC;YACzK,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,mFAAmF;IACnF,qFAAqF;IACrF,qEAAqE;IACrE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,uFAAuF;IACvF,mFAAmF;IACnF,qFAAqF;IACrF,sDAAsD;IACtD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,YAAY,KAAK,IAAI;YAAE,SAAS;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;QACtD,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe;QACrD,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS;YAAE,SAAS;QACpF,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE;YAClC,YAAY,EAAE,MAAM;YACpB,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,YAAY;YACrB,QAAQ,EAAE,SAAS;SACpB,CAAC,CAAC;QACH,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3C,SAAS,IAAI,CAAC,CAAC;IACjB,CAAC;IAED,qFAAqF;IACrF,kFAAkF;IAClF,wFAAwF;IACxF,MAAM,UAAU,GAAG,iBAAiB,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;IAC/F,SAAS,IAAI,UAAU,CAAC;IAExB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;IAChC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAChE,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CACxB,SAAiB,EACjB,QAAgB,EAChB,OAAwB,EACxB,eAA4B,EAC5B,SAAmB;IAEnB,uFAAuF;IACvF,mFAAmF;IACnF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,kFAAkF;QAClF,0CAA0C;QAC1C,IAAI,CAAC,CAAC,UAAU;YAAE,SAAS;QAC3B,qFAAqF;QACrF,qFAAqF;QACrF,sFAAsF;QACtF,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU;YAAE,SAAS;QAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,GAAG,gBAAgB,IAAI,IAAI,CAAC,MAAM,GAAG,gBAAgB;YAAE,SAAS;QAC/E,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,oFAAoF;YACpF,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACtC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,kFAAkF;IAClF,mDAAmD;IACnD,IAAI,QAAQ,CAAC,IAAI,GAAG,gBAAgB;QAAE,SAAS,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC3E,oFAAoF;IACpF,kFAAkF;IAClF,wFAAwF;IACxF,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnE,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,SAAS,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACtE,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAErC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,UAAU;YAAE,SAAS,CAAC,wDAAwD;QACtF,IAAI,CAAC,GAAG,CAAC,UAAU;YAAE,SAAS;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YAClD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,GAAG,CAAC,QAAQ;gBAAE,SAAS,CAAC,cAAc;YACjF,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAAE,SAAS,CAAC,0BAA0B;YAC9F,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,IAAI,OAAO,CAAC,IAAI,IAAI,yBAAyB;gBAAE,MAAM,CAAC,iBAAiB;QACzE,CAAC;QACD,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE;gBAClC,YAAY,EAAE,GAAG,CAAC,QAAQ;gBAC1B,UAAU,EAAE,QAAQ;gBACpB,OAAO,EAAE,YAAY;gBACrB,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,0CAA0C;aACnE,CAAC,CAAC;YACH,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/hooks.js

@@ -77,30 +77,30 @@ const HIPPO_OPENCODE_PLUGIN_MARKER = 'HIPPO_OPENCODE_PLUGIN_V1';
  *    marker match AND content equality, so a plugin-source revision under
  *    the same V1 marker re-writes the file on next install.
  */
-export const OPENCODE_PLUGIN_SOURCE = `// ${HIPPO_OPENCODE_PLUGIN_MARKER}
-// hippo-memory opencode plugin. DO NOT EDIT — regenerated on every
-// \`hippo hook install opencode\` from src/hooks.ts OPENCODE_PLUGIN_SOURCE
-// in https://github.com/kitfunso/hippo-memory. Local changes will be lost.
-
-export const HippoPlugin = async ({ $ }) => {
-  return {
-    event: async ({ event }) => {
-      // Defense in depth: opencode currently runs in Bun where $ is the shell
-      // template helper. A non-Bun runtime would have $ as undefined; fail
-      // closed instead of crashing the host session.
-      if (typeof $ !== "function") return;
-      try {
-        if (event.type === "session.idle") {
-          await $\`hippo session-end\`.quiet().nothrow();
-        } else if (event.type === "session.created") {
-          await $\`hippo last-sleep\`.quiet().nothrow();
-        }
-      } catch {
-        // hippo CLI not on PATH or other failure — never crash the host session.
-      }
-    },
-  };
-};
+export const OPENCODE_PLUGIN_SOURCE = `// ${HIPPO_OPENCODE_PLUGIN_MARKER}
+// hippo-memory opencode plugin. DO NOT EDIT — regenerated on every
+// \`hippo hook install opencode\` from src/hooks.ts OPENCODE_PLUGIN_SOURCE
+// in https://github.com/kitfunso/hippo-memory. Local changes will be lost.
+
+export const HippoPlugin = async ({ $ }) => {
+  return {
+    event: async ({ event }) => {
+      // Defense in depth: opencode currently runs in Bun where $ is the shell
+      // template helper. A non-Bun runtime would have $ as undefined; fail
+      // closed instead of crashing the host session.
+      if (typeof $ !== "function") return;
+      try {
+        if (event.type === "session.idle") {
+          await $\`hippo session-end\`.quiet().nothrow();
+        } else if (event.type === "session.created") {
+          await $\`hippo last-sleep\`.quiet().nothrow();
+        }
+      } catch {
+        // hippo CLI not on PATH or other failure — never crash the host session.
+      }
+    },
+  };
+};
 `;
 export { HIPPO_OPENCODE_PLUGIN_MARKER };
 function homeDir() {

package/dist/physics-state.js

@@ -29,20 +29,20 @@ export function bufferToFloat32(buf) {
  * Call this from db.ts MIGRATIONS array.
  */
 export function createPhysicsTable(db) {
-    db.exec(`
-    CREATE TABLE IF NOT EXISTS memory_physics (
-      memory_id TEXT PRIMARY KEY REFERENCES memories(id) ON DELETE CASCADE,
-      position_blob BLOB NOT NULL,
-      velocity_blob BLOB NOT NULL,
-      mass REAL NOT NULL,
-      charge REAL NOT NULL,
-      temperature REAL NOT NULL,
-      last_simulation TEXT NOT NULL,
-      updated_at TEXT NOT NULL DEFAULT (datetime('now'))
-    );
-
-    CREATE INDEX IF NOT EXISTS idx_memory_physics_mass
-    ON memory_physics(mass DESC);
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS memory_physics (
+      memory_id TEXT PRIMARY KEY REFERENCES memories(id) ON DELETE CASCADE,
+      position_blob BLOB NOT NULL,
+      velocity_blob BLOB NOT NULL,
+      mass REAL NOT NULL,
+      charge REAL NOT NULL,
+      temperature REAL NOT NULL,
+      last_simulation TEXT NOT NULL,
+      updated_at TEXT NOT NULL DEFAULT (datetime('now'))
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_memory_physics_mass
+    ON memory_physics(mass DESC);
   `);
 }
 /**
@@ -53,11 +53,11 @@ export function loadPhysicsState(db, memoryIds) {
     let rows;
     if (memoryIds && memoryIds.length > 0) {
         const placeholders = memoryIds.map(() => '?').join(',');
-        rows = db.prepare(`SELECT memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation
+        rows = db.prepare(`SELECT memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation
        FROM memory_physics WHERE memory_id IN (${placeholders})`).all(...memoryIds);
     }
     else {
-        rows = db.prepare(`SELECT memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation
+        rows = db.prepare(`SELECT memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation
        FROM memory_physics`).all();
     }
     for (const row of rows) {
@@ -79,17 +79,17 @@ export function loadPhysicsState(db, memoryIds) {
 export function savePhysicsState(db, particles) {
     if (particles.length === 0)
         return;
-    const stmt = db.prepare(`
-    INSERT INTO memory_physics (memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation, updated_at)
-    VALUES (?, ?, ?, ?, ?, ?, ?, datetime('now'))
-    ON CONFLICT(memory_id) DO UPDATE SET
-      position_blob = excluded.position_blob,
-      velocity_blob = excluded.velocity_blob,
-      mass = excluded.mass,
-      charge = excluded.charge,
-      temperature = excluded.temperature,
-      last_simulation = excluded.last_simulation,
-      updated_at = datetime('now')
+    const stmt = db.prepare(`
+    INSERT INTO memory_physics (memory_id, position_blob, velocity_blob, mass, charge, temperature, last_simulation, updated_at)
+    VALUES (?, ?, ?, ?, ?, ?, ?, datetime('now'))
+    ON CONFLICT(memory_id) DO UPDATE SET
+      position_blob = excluded.position_blob,
+      velocity_blob = excluded.velocity_blob,
+      mass = excluded.mass,
+      charge = excluded.charge,
+      temperature = excluded.temperature,
+      last_simulation = excluded.last_simulation,
+      updated_at = datetime('now')
   `);
     db.exec('BEGIN');
     try {

package/dist/predictions.js

@@ -86,20 +86,20 @@ export function savePrediction(hippoRoot, tenantId, opts, actor = 'cli') {
     writeEntry(hippoRoot, mem, {
         actor,
         afterWrite: (db, memoryId) => {
-            const result = db.prepare(`
-        INSERT INTO predictions(
-          memory_id, tenant_id, class_tag, claim_text,
-          estimate_value, estimate_unit, target_date,
-          actual_value, closure_state, closed_at, closure_note, created_at
-        ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, 'open', NULL, NULL, ?)
+            const result = db.prepare(`
+        INSERT INTO predictions(
+          memory_id, tenant_id, class_tag, claim_text,
+          estimate_value, estimate_unit, target_date,
+          actual_value, closure_state, closed_at, closure_note, created_at
+        ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, 'open', NULL, NULL, ?)
       `).run(memoryId, tenantId, opts.classTag, opts.claimText, opts.estimateValue ?? null, opts.estimateUnit ?? null, opts.targetDate ?? null, null, // actual_value — null until close
             now);
             const predictionId = Number(result.lastInsertRowid ?? 0);
-            const row = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions WHERE id = ?
+            const row = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions WHERE id = ?
       `).get(predictionId);
             if (!row) {
                 throw new Error('Failed to reload saved prediction row');
@@ -150,16 +150,16 @@ export function closePrediction(hippoRoot, tenantId, id, opts, actor = 'cli') {
             // predict_close audit row. Zero changed rows → caller decides
             // whether it's a "not found" or "already closed" case based on the
             // load-then-close pattern.
-            const updateResult = db.prepare(`
-        UPDATE predictions
-        SET actual_value = ?, closure_state = ?, closed_at = ?, closure_note = ?
-        WHERE id = ? AND tenant_id = ? AND closure_state = 'open'
+            const updateResult = db.prepare(`
+        UPDATE predictions
+        SET actual_value = ?, closure_state = ?, closed_at = ?, closure_note = ?
+        WHERE id = ? AND tenant_id = ? AND closure_state = 'open'
       `).run(opts.actualValue ?? null, opts.closureState, now, opts.closureNote ?? null, id, tenantId);
             if (updateResult.changes === 0) {
                 // Distinguish "not found" from "already closed" so callers (CLI, HTTP)
                 // can surface the right error to the user.
-                const existing = db.prepare(`
-          SELECT closure_state FROM predictions WHERE id = ? AND tenant_id = ?
+                const existing = db.prepare(`
+          SELECT closure_state FROM predictions WHERE id = ? AND tenant_id = ?
         `).get(id, tenantId);
                 if (!existing) {
                     throw new Error(`closePrediction: prediction ${id} not found for tenant ${tenantId}`);
@@ -167,11 +167,11 @@ export function closePrediction(hippoRoot, tenantId, id, opts, actor = 'cli') {
                 throw new Error(`closePrediction: prediction ${id} is already closed (state='${existing.closure_state}'); ` +
                     `cannot re-close. Open predictions only.`);
             }
-            const row = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions WHERE id = ? AND tenant_id = ?
+            const row = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions WHERE id = ? AND tenant_id = ?
       `).get(id, tenantId);
             if (!row) {
                 throw new Error(`closePrediction: prediction ${id} not found after UPDATE`);
@@ -208,11 +208,11 @@ export function loadPredictionById(hippoRoot, tenantId, id) {
     assertTenantId('loadPredictionById', tenantId);
     const db = openHippoDb(hippoRoot);
     try {
-        const row = db.prepare(`
-      SELECT id, memory_id, tenant_id, class_tag, claim_text,
-             estimate_value, estimate_unit, target_date,
-             actual_value, closure_state, closed_at, closure_note, created_at
-      FROM predictions WHERE id = ? AND tenant_id = ?
+        const row = db.prepare(`
+      SELECT id, memory_id, tenant_id, class_tag, claim_text,
+             estimate_value, estimate_unit, target_date,
+             actual_value, closure_state, closed_at, closure_note, created_at
+      FROM predictions WHERE id = ? AND tenant_id = ?
     `).get(id, tenantId);
         return row ? rowToPrediction(row) : null;
     }
@@ -230,25 +230,25 @@ export function loadPredictionsByClass(hippoRoot, tenantId, classTag, opts = {})
             if (!VALID_CLOSURE_STATES.has(opts.closureState)) {
                 throw new Error(`loadPredictionsByClass: closureState must be one of ${Array.from(VALID_CLOSURE_STATES).join('|')}; got ${opts.closureState}`);
             }
-            rows = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions
-        WHERE tenant_id = ? AND class_tag = ? AND closure_state = ?
-        ORDER BY created_at DESC, id DESC
-        LIMIT ?
+            rows = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions
+        WHERE tenant_id = ? AND class_tag = ? AND closure_state = ?
+        ORDER BY created_at DESC, id DESC
+        LIMIT ?
       `).all(tenantId, classTag, opts.closureState, limit);
         }
         else {
-            rows = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions
-        WHERE tenant_id = ? AND class_tag = ?
-        ORDER BY created_at DESC, id DESC
-        LIMIT ?
+            rows = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions
+        WHERE tenant_id = ? AND class_tag = ?
+        ORDER BY created_at DESC, id DESC
+        LIMIT ?
       `).all(tenantId, classTag, limit);
         }
         return rows.map(rowToPrediction);
@@ -286,14 +286,14 @@ emitAudit = true) {
         throw new Error('computePredictionBaserate: classTag is required');
     const db = openHippoDb(hippoRoot);
     try {
-        const rows = db.prepare(`
-      SELECT estimate_value, actual_value
-      FROM predictions
-      WHERE tenant_id = ?
-        AND class_tag = ?
-        AND closure_state = 'closed'
-        AND estimate_value IS NOT NULL
-        AND actual_value IS NOT NULL
+        const rows = db.prepare(`
+      SELECT estimate_value, actual_value
+      FROM predictions
+      WHERE tenant_id = ?
+        AND class_tag = ?
+        AND closure_state = 'closed'
+        AND estimate_value IS NOT NULL
+        AND actual_value IS NOT NULL
     `).all(tenantId, classTag);
         const nClosed = rows.length;
         if (nClosed === 0) {
@@ -373,25 +373,25 @@ export function loadOpenPredictions(hippoRoot, tenantId, opts = {}) {
     try {
         let rows;
         if (opts.classTag) {
-            rows = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions
-        WHERE tenant_id = ? AND class_tag = ? AND closure_state = 'open'
-        ORDER BY created_at DESC, id DESC
-        LIMIT ?
+            rows = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions
+        WHERE tenant_id = ? AND class_tag = ? AND closure_state = 'open'
+        ORDER BY created_at DESC, id DESC
+        LIMIT ?
       `).all(tenantId, opts.classTag, limit);
         }
         else {
-            rows = db.prepare(`
-        SELECT id, memory_id, tenant_id, class_tag, claim_text,
-               estimate_value, estimate_unit, target_date,
-               actual_value, closure_state, closed_at, closure_note, created_at
-        FROM predictions
-        WHERE tenant_id = ? AND closure_state = 'open'
-        ORDER BY created_at DESC, id DESC
-        LIMIT ?
+            rows = db.prepare(`
+        SELECT id, memory_id, tenant_id, class_tag, claim_text,
+               estimate_value, estimate_unit, target_date,
+               actual_value, closure_state, closed_at, closure_note, created_at
+        FROM predictions
+        WHERE tenant_id = ? AND closure_state = 'open'
+        ORDER BY created_at DESC, id DESC
+        LIMIT ?
       `).all(tenantId, limit);
         }
         return rows.map(rowToPrediction);

package/dist/refine-llm.js

@@ -31,19 +31,19 @@ export async function refineSemanticMemory(merged, sources, opts) {
         .slice(0, 8)
         .map((s, i) => `[source ${i + 1}] ${s.content.slice(0, 400)}`)
         .join('\n\n');
-    const prompt = `You are refining a semantic memory in an agent's memory store. The rule-based consolidator merged several related episodic memories into one, but the output is clumsy. Produce a single coherent semantic memory that captures the underlying principle.
-
-Rules:
-- Output ONLY the refined content — no preamble, no quote marks, no "Here is...".
-- Keep it concise: one paragraph, no headers, no bullet lists unless the sources are inherently a list.
-- Preserve specific facts (names, numbers, paths, IDs) from the sources.
-- Generalize: state the pattern, not each instance.
-- Do NOT include the "[Consolidated from N ...]" marker.
-
-Current merged content:
-${merged}
-
-Source memories (up to 8 shown):
+    const prompt = `You are refining a semantic memory in an agent's memory store. The rule-based consolidator merged several related episodic memories into one, but the output is clumsy. Produce a single coherent semantic memory that captures the underlying principle.
+
+Rules:
+- Output ONLY the refined content — no preamble, no quote marks, no "Here is...".
+- Keep it concise: one paragraph, no headers, no bullet lists unless the sources are inherently a list.
+- Preserve specific facts (names, numbers, paths, IDs) from the sources.
+- Generalize: state the pattern, not each instance.
+- Do NOT include the "[Consolidated from N ...]" marker.
+
+Current merged content:
+${merged}
+
+Source memories (up to 8 shown):
 ${sourceBlock}`;
     let res;
     try {