hippo-memory 1.44.0 → 1.46.0

package/dist/src/extract.js

@@ -1,117 +0,0 @@
-import { Layer, createMemory } from './memory.js';
-import { writeEntry } from './store.js';
-import { RejectedValueError } from './rejection.js';
-function isJsonString(value) {
-    return typeof value === 'string';
-}
-const EXTRACTION_PROMPT = `You are extracting factual statements from a conversation or memory entry. Extract 1-8 standalone factual statements that would be useful to remember later.
-
-Rules:
-- Each fact must be a complete, standalone sentence
-- Include the speaker's name in every fact (e.g. "Alice prefers..." not "She prefers...")
-- Preserve specific details: names, numbers, dates, paths, IDs
-- Return a JSON array of objects with: content (string), tags (array of "speaker:X" and "topic:Y" strings), valence ("neutral", "positive", "negative", or "critical")
-- Return an empty array [] for small talk with no extractable facts
-- Output ONLY the JSON array, no preamble or explanation
-
-Input text:
-`;
-export async function extractFacts(text, opts) {
-    const model = opts.model ?? 'claude-sonnet-4-6';
-    const fetchFn = opts.fetcher ?? fetch;
-    let res;
-    try {
-        res = await fetchFn('https://api.anthropic.com/v1/messages', {
-            method: 'POST',
-            headers: {
-                'content-type': 'application/json',
-                'x-api-key': opts.apiKey,
-                'anthropic-version': '2023-06-01',
-            },
-            body: JSON.stringify({
-                model,
-                max_tokens: 1200,
-                messages: [{ role: 'user', content: EXTRACTION_PROMPT + text }],
-            }),
-        });
-    }
-    catch {
-        return [];
-    }
-    if (!res.ok)
-        return [];
-    try {
-        const data = await res.json();
-        const raw = data.content?.[0]?.text?.trim() ?? '';
-        if (!raw)
-            return [];
-        const parsed = JSON.parse(raw);
-        if (!Array.isArray(parsed))
-            return [];
-        const validValences = new Set(['neutral', 'positive', 'negative', 'critical']);
-        const facts = [];
-        for (const item of parsed) {
-            if (facts.length >= 8)
-                break;
-            if (!item ||
-                !isJsonString(item.content) ||
-                item.content.length < 3)
-                continue;
-            const itemTags = item.tags;
-            const tags = Array.isArray(itemTags)
-                ? itemTags.filter((t) => isJsonString(t))
-                : [];
-            // SAFETY: validValences.has(item.valence) above confirms item.valence is one of the four literal strings of EmotionalValence.
-            const valence = validValences.has(item.valence)
-                ? item.valence
-                : 'neutral';
-            facts.push({ content: item.content, tags, valence });
-        }
-        return facts;
-    }
-    catch {
-        return [];
-    }
-}
-const INHERITABLE_PREFIXES = ['conv:', 'session:', 'scope:', 'path:'];
-export function storeExtractedFacts(hippoRoot, source, facts) {
-    const inheritedTags = source.tags.filter((t) => INHERITABLE_PREFIXES.some((p) => t.startsWith(p)));
-    const entries = [];
-    let rejected = 0;
-    for (const fact of facts) {
-        const tags = ['extracted', ...inheritedTags, ...fact.tags];
-        const entry = createMemory(fact.content, {
-            layer: Layer.Semantic,
-            tags,
-            emotional_valence: fact.valence,
-            confidence: 'inferred',
-            source: source.source,
-            extracted_from: source.id,
-            // T1 executor check (2026-08-15 hardening pass): same defect as the
-            // consolidate.ts merge/trace passes — createMemory with no tenantId
-            // option stamps 'default' (memory.ts:535) regardless of the source
-            // entry's own tenant. Thread it through so extracted facts land in
-            // the same tenant as the episodic memory they were extracted from.
-            tenantId: source.tenantId,
-        });
-        // AT1 containment: a refusal is per-VALUE — one rejected fact must not
-        // drop the rest of this batch. writeEntry has already audited the
-        // refusal (reject_refusal) before rethrowing, so skip-and-count here.
-        try {
-            writeEntry(hippoRoot, entry);
-        }
-        catch (err) {
-            if (err instanceof RejectedValueError) {
-                rejected++;
-                continue;
-            }
-            throw err;
-        }
-        entries.push(entry);
-    }
-    if (rejected > 0) {
-        console.error(`storeExtractedFacts: skipped ${rejected} rejected value(s)`);
-    }
-    return entries;
-}
-//# sourceMappingURL=extract.js.map

package/dist/src/extract.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"extract.js","sourceRoot":"","sources":["../../src/extract.ts"],"names":[],"mappings":"AAAA,OAAO,EAAe,KAAK,EAAoB,YAAY,EAAE,MAAM,aAAa,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAkBpD,SAAS,YAAY,CAAC,KAAgB;IACpC,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC;AACnC,CAAC;AAED,MAAM,iBAAiB,GAAG;;;;;;;;;;;CAWzB,CAAC;AAEF,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,IAAY,EACZ,IAAoB;IAEpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,mBAAmB,CAAC;IAChD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;IAEtC,IAAI,GAAa,CAAC;IAClB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,OAAO,CAAC,uCAAuC,EAAE;YAC3D,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,WAAW,EAAE,IAAI,CAAC,MAAM;gBACxB,mBAAmB,EAAE,YAAY;aAClC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK;gBACL,UAAU,EAAE,IAAI;gBAChB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,GAAG,IAAI,EAAE,CAAC;aAChE,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,EAAE,CAAC;IAEvB,IAAI,CAAC;QACH,MAAM,IAAI,GAA2C,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;QACtE,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,CAAC;QAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;QACvF,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAM;YAC7B,IACE,CAAC,IAAI;gBACL,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC3B,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;gBAEvB,SAAS;YAEX,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;gBAClC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC,CAAC,EAAE,CAAC;YACP,8HAA8H;YAC9H,MAAM,OAAO,GAAqB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC/D,CAAC,CAAE,IAAI,CAAC,OAA4B;gBACpC,CAAC,CAAC,SAAS,CAAC;YAEd,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACvD,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,MAAM,oBAAoB,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAEtE,MAAM,UAAU,mBAAmB,CACjC,SAAiB,EACjB,MAAmB,EACnB,KAAsB;IAEtB,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAClD,CAAC;IAEF,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,WAAW,EAAE,GAAG,aAAa,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE;YACvC,KAAK,EAAE,KAAK,CAAC,QAAQ;YACrB,IAAI;YACJ,iBAAiB,EAAE,IAAI,CAAC,OAAO;YAC/B,UAAU,EAAE,UAAU;YACtB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,cAAc,EAAE,MAAM,CAAC,EAAE;YACzB,oEAAoE;YACpE,oEAAoE;YACpE,mEAAmE;YACnE,mEAAmE;YACnE,mEAAmE;YACnE,QAAQ,EAAE,MAAM,CAAC,QAAQ;SAC1B,CAAC,CAAC;QAEH,uEAAuE;QACvE,kEAAkE;QAClE,sEAAsE;QACtE,IAAI,CAAC;YACH,UAAU,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,kBAAkB,EAAE,CAAC;gBACtC,QAAQ,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;YACD,MAAM,GAAG,CAAC;QACZ,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,KAAK,CAAC,gCAAgC,QAAQ,oBAAoB,CAAC,CAAC;IAC9E,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/src/forward-claim-detector.js

@@ -1,117 +0,0 @@
-/**
- * J3.2 forward-claim detector — pure-function regex set + token extraction.
- *
- * No DB. No state. No dependencies beyond stdlib regex + String.
- *
- * The detector's job is to decide whether a recall query carries a
- * forward-prediction phrase ("will take ~3 days", "ship by Friday",
- * "ETA in 2 weeks"). Calibration is intentionally HIGH-PRECISION /
- * LOW-RECALL: better to fire on 20% of real forward-claims than 80% with
- * 40% noise. Cry-wolf failure dominates planning-fallacy hint UX (Lovallo-
- * Kahneman 2003 inside-vs-outside view).
- *
- * Iteration signal: the `recall_autodebias_hint_no_class_match` audit op
- * (emitted by computePlanningFallacyHint when a phrase matches but no class
- * resolves) is the telemetry channel for deciding whether to add an
- * embedding-based detector in J3.3.
- *
- * Plan: docs/plans/2026-05-26-j32-auto-injection.md (Task 1).
- */
-/**
- * Patterns ship-locked at v1.13.x. Each pattern is intentionally narrow —
- * adding a pattern should require evidence from the
- * `recall_autodebias_hint_no_class_match` audit channel that real forward-
- * claims are slipping through, NOT speculative "this might match more".
- *
- * Word boundaries (`\b`) are mandatory: prevent `~5 days` inside
- * `~5 days_ago` from matching, and prevent `ETA` substring matches inside
- * a longer token (e.g. `BETAtesting`).
- */
-// Reused fragment for ALL duration-suffix patterns. Requires a digit + unit
-// so 'will take ownership' / 'ship in Docker' (no time component) don't
-// match. Codex round 2 P2: patterns that allowed verb-only matches fired
-// on every-day non-estimate queries that happened to share a class-token.
-// Accepts `<N> unit` (3 days), `a/an unit` (a week — implicit 1), and
-// `one unit` so natural English forward-claims aren't lost.
-const DURATION_TAIL = String.raw `(?:about|around|~|≈)?\s*(?:\d+|a|an|one)\s*(?:day|week|month|hour|hr|min(?:ute)?|sec(?:ond)?)s?\b`;
-const FORWARD_CLAIM_PATTERNS = [
-    // Verb + duration tail. Old pattern `/\b(?:will|should...) take\b/i`
-    // matched `who will take ownership of auth?` because there was no
-    // quantifier requirement. Now requires `<verb> take <N> <unit>`.
-    new RegExp(String.raw `\b(?:will|should|gonna|going\s+to)\s+take\s+${DURATION_TAIL}`, 'i'),
-    // Ship + by/in + duration-or-day. Old pattern `/\bship(?:ping)?\s+(?:by|in)\b/i`
-    // matched `how does this ship in Docker?`. Now requires either a
-    // duration tail OR a literal day-of-week reference.
-    new RegExp(String.raw `\bship(?:ping|s)?\s+(?:by|in)\s+(?:(?:about|around)\s+)?(?:next\s+)?(?:${DURATION_TAIL}|(?:monday|tuesday|wednesday|thursday|friday|saturday|sunday))\b`, 'i'),
-    /\bestimate(?:d)?\s+(?:at\s+)?(?:~|≈|about|around)?\s*\d+/i,
-    /\b(?:by|in|within)\s+(?:about|around|~)?\s*\d+\s*(?:day|week|month|hour)s?\b/i,
-    /\bETA\s*(?:is|:)?\s*\d+/i,
-    /\b(?:by|before)\s+next\s+(?:week|month|sprint|monday|tuesday|wednesday|thursday|friday|saturday|sunday)\b/i,
-    // Standalone tilde duration: '~3 days for migration', 'estimate ~3 days'.
-    // Lookbehind asserts start-of-string OR whitespace before the tilde
-    // because \b before ~ requires a word char immediately preceding (~ is
-    // not a word character), so /\b~/ would only match in 'foo~3 days'
-    // (malformed) and silently miss the legitimate cases. Codex review
-    // round 1 catch.
-    /(?<=^|\s)~\s*\d+\s*(?:day|week|month|hour)s?\b/i,
-    // Should + verb + duration tail. Same tightening as the leading 'will
-    // take' rule: 'should ship by EOD' must include a quantifier.
-    new RegExp(String.raw `\bshould\s+(?:be|ship|finish|complete|land)\s+(?:by|in|within)\s+(?:(?:about|around)\s+)?(?:next\s+)?(?:${DURATION_TAIL}|(?:monday|tuesday|wednesday|thursday|friday|saturday|sunday))\b`, 'i'),
-];
-/**
- * Pronouns + function words + modal verbs the regex set already gates on.
- * Dropped before class-resolution so the overlap signal comes from
- * domain tokens ("migration", "auth", "refactor") rather than connectives.
- */
-const STOP_WORDS = new Set([
-    'the', 'a', 'an', 'and', 'or', 'but', 'for', 'to', 'in', 'on', 'at', 'of',
-    'by', 'with', 'my', 'your', 'our', 'their', 'its', 'it', 'this', 'that',
-    'these', 'those', 'will', 'should', 'can', 'i', 'we', 'they', 'he', 'she',
-    'is', 'be', 'was', 'are', 'were', 'has', 'have', 'had', 'do', 'does', 'did',
-    'from', 'as', 'so', 'than', 'then',
-    // Verbs that appear inside FORWARD_CLAIM_PATTERNS themselves — they're
-    // signal for the regex gate but NOT signal for class resolution (you
-    // wouldn't name a prediction class "take" or "ship"). Listing here so
-    // they don't pollute the classQueryTokens overlap score.
-    'take', 'taken', 'takes', 'ship', 'ships', 'finish', 'complete', 'land',
-    'eta', 'estimate', 'estimated', 'next', 'about', 'around',
-    // Duration units appear in every forward-claim phrase by design (the
-    // regex set REQUIRES a `<N> <unit>` quantifier after the verb). Letting
-    // them through to class resolution lets a class tag containing 'days'
-    // win or tie on the unit token instead of the domain token. Codex round
-    // 2 P3 catch.
-    'day', 'days', 'week', 'weeks', 'month', 'months',
-    'hour', 'hours', 'hr', 'hrs',
-    'min', 'mins', 'minute', 'minutes', 'sec', 'secs', 'second', 'seconds',
-]);
-/**
- * Detect whether a recall query carries a forward-prediction phrase.
- *
- * @returns first-match phrase + extracted class-resolution tokens when
- *   any pattern matches; null otherwise. Token extraction runs only on a
- *   match — non-forward queries pay zero work beyond the regex gate.
- */
-export function detectForwardClaim(queryText) {
-    if (!queryText)
-        return null;
-    for (const pat of FORWARD_CLAIM_PATTERNS) {
-        const m = queryText.match(pat);
-        if (m) {
-            const tokens = extractClassQueryTokens(queryText);
-            return { phrase: m[0], classQueryTokens: tokens };
-        }
-    }
-    return null;
-}
-function extractClassQueryTokens(queryText) {
-    return queryText
-        .toLowerCase()
-        // Strip everything that's not alphanum or whitespace or hyphen / underscore.
-        .replace(/[^a-z0-9\s_-]/g, ' ')
-        // Split on whitespace AND hyphen AND underscore so `migration-effort`
-        // produces ['migration', 'effort'] — matching the class-tag split
-        // pattern in resolveClassFromTokens (split on /[-_\s]+/).
-        .split(/[\s_-]+/)
-        .filter((t) => t.length >= 3 && !STOP_WORDS.has(t) && !/^\d+$/.test(t));
-}
-//# sourceMappingURL=forward-claim-detector.js.map

package/dist/src/forward-claim-detector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"forward-claim-detector.js","sourceRoot":"","sources":["../../src/forward-claim-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH;;;;;;;;;GASG;AACH,4EAA4E;AAC5E,wEAAwE;AACxE,yEAAyE;AACzE,0EAA0E;AAC1E,sEAAsE;AACtE,4DAA4D;AAC5D,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAA,mGAAmG,CAAC;AAEpI,MAAM,sBAAsB,GAA0B;IACpD,qEAAqE;IACrE,kEAAkE;IAClE,iEAAiE;IACjE,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAA,+CAA+C,aAAa,EAAE,EAAE,GAAG,CAAC;IACzF,iFAAiF;IACjF,iEAAiE;IACjE,oDAAoD;IACpD,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAA,0EAA0E,aAAa,kEAAkE,EAAE,GAAG,CAAC;IACpL,2DAA2D;IAC3D,+EAA+E;IAC/E,0BAA0B;IAC1B,4GAA4G;IAC5G,0EAA0E;IAC1E,oEAAoE;IACpE,uEAAuE;IACvE,mEAAmE;IACnE,mEAAmE;IACnE,iBAAiB;IACjB,iDAAiD;IACjD,sEAAsE;IACtE,8DAA8D;IAC9D,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAA,2GAA2G,aAAa,kEAAkE,EAAE,GAAG,CAAC;CACtN,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,GAAwB,IAAI,GAAG,CAAC;IAC9C,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IACzE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM;IACvE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;IACzE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK;IAC3E,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM;IAClC,uEAAuE;IACvE,qEAAqE;IACrE,sEAAsE;IACtE,yDAAyD;IACzD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM;IACvE,KAAK,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;IACzD,qEAAqE;IACrE,wEAAwE;IACxE,sEAAsE;IACtE,wEAAwE;IACxE,cAAc;IACd,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ;IACjD,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK;IAC5B,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS;CACvE,CAAC,CAAC;AAaH;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,SAAiB;IAClD,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,sBAAsB,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,EAAE,CAAC;YACN,MAAM,MAAM,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;YAClD,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,MAAM,EAAE,CAAC;QACpD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,uBAAuB,CAAC,SAAiB;IAChD,OAAO,SAAS;SACb,WAAW,EAAE;QACd,6EAA6E;SAC5E,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC;QAC/B,sEAAsE;QACtE,kEAAkE;QAClE,0DAA0D;SACzD,KAAK,CAAC,SAAS,CAAC;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5E,CAAC"}

package/dist/src/goals.js

@@ -1,399 +0,0 @@
-// src/goals.ts
-import { randomUUID } from 'node:crypto';
-import { openHippoDb, closeHippoDb } from './db.js';
-export const MAX_ACTIVE_GOAL_DEPTH = 3;
-export const MAX_FINAL_MULTIPLIER = 3.0;
-export function rowToGoal(row) {
-    return {
-        id: row.id,
-        sessionId: row.session_id,
-        tenantId: row.tenant_id,
-        goalName: row.goal_name,
-        level: row.level,
-        parentGoalId: row.parent_goal_id ?? undefined,
-        status: row.status,
-        successCondition: row.success_condition ?? undefined,
-        retrievalPolicyId: row.retrieval_policy_id ?? undefined,
-        createdAt: row.created_at,
-        completedAt: row.completed_at ?? undefined,
-        outcomeScore: row.outcome_score ?? undefined,
-    };
-}
-export function pushGoal(hippoRoot, opts) {
-    const db = openHippoDb(hippoRoot);
-    try {
-        return pushGoalWithDb(db, opts);
-    }
-    finally {
-        closeHippoDb(db);
-    }
-}
-/**
- * v1.7.4 — depth-cap enforcer extracted from pushGoalWithDb and resumeGoal.
- * If the (tenant, session) has >= MAX_ACTIVE_GOAL_DEPTH active goals,
- * suspend the oldest `overflow` ones.
- *
- * **Precondition: caller MUST already be inside a `BEGIN IMMEDIATE`
- * transaction.** Helper does not open or commit -- name reflects this so it
- * is impossible to misread the contract at a call site. Both existing call
- * sites (pushGoalWithDb, resumeGoal) wrap in `BEGIN IMMEDIATE` already.
- *
- * @internal v1.7.4 -- internal goal-stack invariant. Subject to change.
- */
-export function enforceDepthCapWithinTx(db, tenantId, sessionId) {
-    // SAFETY: the row comes from the SELECT above, which projects exactly one
-    // column, `c`, as a COUNT(*).
-    const activeCount = db.prepare(`
-    SELECT COUNT(*) AS c
-    FROM goal_stack
-    WHERE tenant_id = ? AND session_id = ? AND status = 'active'
-  `).get(tenantId, sessionId).c;
-    if (activeCount >= MAX_ACTIVE_GOAL_DEPTH) {
-        const overflow = activeCount - MAX_ACTIVE_GOAL_DEPTH + 1;
-        db.prepare(`
-      UPDATE goal_stack
-      SET status = 'suspended'
-      WHERE id IN (
-        SELECT id FROM goal_stack
-        WHERE tenant_id = ? AND session_id = ? AND status = 'active'
-        ORDER BY created_at ASC
-        LIMIT ?
-      )
-    `).run(tenantId, sessionId, overflow);
-    }
-}
-export function pushGoalWithDb(db, opts) {
-    const id = `g_${randomUUID().replace(/-/g, '').slice(0, 16)}`;
-    const createdAt = new Date().toISOString();
-    let policyId = null;
-    db.exec('BEGIN IMMEDIATE');
-    try {
-        // Depth cap: count active for (tenant, session); suspend oldest if at cap.
-        enforceDepthCapWithinTx(db, opts.tenantId, opts.sessionId);
-        if (opts.parentGoalId) {
-            // SAFETY: the row comes from the SELECT above, which projects exactly
-            // the tenant_id and session_id columns of goal_stack.
-            const parent = db.prepare(`SELECT tenant_id, session_id FROM goal_stack WHERE id = ?`).get(opts.parentGoalId);
-            if (!parent) {
-                throw new Error(`parent goal not found: ${opts.parentGoalId}`);
-            }
-            if (parent.tenant_id !== opts.tenantId || parent.session_id !== opts.sessionId) {
-                throw new Error(`parent goal ${opts.parentGoalId} belongs to a different (tenant, session)`);
-            }
-        }
-        // Parent goal_stack row first (FK target).
-        db.prepare(`
-      INSERT INTO goal_stack
-        (id, session_id, tenant_id, goal_name, level, parent_goal_id, status,
-         success_condition, retrieval_policy_id, created_at)
-      VALUES (?, ?, ?, ?, ?, ?, 'active', ?, NULL, ?)
-    `).run(id, opts.sessionId, opts.tenantId, opts.goalName, opts.level ?? 0, opts.parentGoalId ?? null, opts.successCondition ?? null, createdAt);
-        // Optional policy row, then point goal_stack.retrieval_policy_id at it.
-        if (opts.policy) {
-            policyId = `rp_${randomUUID().replace(/-/g, '').slice(0, 16)}`;
-            db.prepare(`
-        INSERT INTO retrieval_policy
-          (id, goal_id, policy_type, weight_schema_fit, weight_recency, weight_outcome, error_priority)
-        VALUES (?, ?, ?, ?, ?, ?, ?)
-      `).run(policyId, id, opts.policy.policyType, opts.policy.weightSchemaFit ?? 1.0, opts.policy.weightRecency ?? 1.0, opts.policy.weightOutcome ?? 1.0, opts.policy.errorPriority ?? 1.0);
-            db.prepare(`UPDATE goal_stack SET retrieval_policy_id = ? WHERE id = ?`).run(policyId, id);
-        }
-        db.exec('COMMIT');
-    }
-    catch (err) {
-        try {
-            db.exec('ROLLBACK');
-        }
-        catch { /* already rolled back; keep the original error */ }
-        throw err;
-    }
-    return {
-        id,
-        sessionId: opts.sessionId,
-        tenantId: opts.tenantId,
-        goalName: opts.goalName,
-        level: opts.level ?? 0,
-        parentGoalId: opts.parentGoalId,
-        status: 'active',
-        successCondition: opts.successCondition,
-        retrievalPolicyId: policyId ?? undefined,
-        createdAt,
-    };
-}
-export function getActiveGoals(hippoRoot, opts) {
-    const db = openHippoDb(hippoRoot);
-    try {
-        return getActiveGoalsWithDb(db, opts);
-    }
-    finally {
-        closeHippoDb(db);
-    }
-}
-export function getActiveGoalsWithDb(db, opts) {
-    // SAFETY: rows come from the SELECT above, which projects exactly
-    // GoalRow's columns (in the same order goal_stack defines them).
-    const rows = db.prepare(`
-    SELECT id, session_id, tenant_id, goal_name, level, parent_goal_id, status,
-           success_condition, retrieval_policy_id, created_at, completed_at, outcome_score
-    FROM goal_stack
-    WHERE tenant_id = ? AND session_id = ? AND status = 'active'
-    ORDER BY created_at ASC
-  `).all(opts.tenantId, opts.sessionId);
-    return rows.map(rowToGoal);
-}
-/**
- * v1.7.4 -- dlPFC goal-stack boost helper. Applies the multi-goal boost to a
- * list of entry-backed scored rows when (tenant, session) has active goals.
- * Pre-v1.7.4 this logic lived inline in cmdRecall (src/cli.ts:988-1140);
- * lifting here lets api.recall (primary band only) AND MCP physics/hybrid
- * call it.
- *
- * Caller responsibilities:
- *   - Do NOT call when an explicit `goalTag` is set (caller's gate)
- *   - Pass entry-backed rows (with `entry.tags`, `entry.id`, optional
- *     `entry.schema_fit`)
- *   - Manage the db handle lifecycle (helper neither opens nor closes)
- *   - Recompute `tokens` after if returned rows are projected to a budgeted
- *     shape
- *
- * Side effects:
- *   - INSERT OR IGNORE into `goal_recall_log` for each (boosted, goal) pair
- *   - Local memory id filter applied before INSERT (skips global-only ids
- *     to preserve FK invariant on goal_recall_log.memory_id)
- *
- * @internal v1.7.4 -- internal recall ranking helper. Subject to change.
- */
-export function applyGoalStackBoost(db, results, opts) {
-    const { sessionId, tenantId, limit, trace } = opts;
-    const active = getActiveGoalsWithDb(db, { sessionId, tenantId });
-    if (active.length === 0)
-        return results;
-    const goalsByTag = new Map(active.map((g) => [g.goalName, g]));
-    // Load retrieval_policy rows for active goals so per-policy multipliers
-    // can compose onto the base goal-tag boost. Composed result is hard-capped
-    // at MAX_FINAL_MULTIPLIER (3.0x) BEFORE applying to score -- even an
-    // `errorPriority: 9.0` policy cannot exceed 3.0x.
-    const policiesByGoalId = new Map();
-    for (const g of active) {
-        if (!g.retrievalPolicyId)
-            continue;
-        // SAFETY: the row comes from the SELECT above, which projects exactly
-        // these seven retrieval_policy columns.
-        const row = db.prepare(`
-      SELECT id, goal_id, policy_type, weight_schema_fit, weight_recency, weight_outcome, error_priority
-      FROM retrieval_policy WHERE id = ?
-    `).get(g.retrievalPolicyId);
-        if (row) {
-            policiesByGoalId.set(g.id, {
-                id: row.id,
-                goalId: row.goal_id,
-                policyType: row.policy_type,
-                weightSchemaFit: row.weight_schema_fit,
-                weightRecency: row.weight_recency,
-                weightOutcome: row.weight_outcome,
-                errorPriority: row.error_priority,
-            });
-        }
-    }
-    // Goal-tag matches per boosted row, keyed by entry id. Kept as a side table
-    // (rather than a spread-on `_goalMatches` marker property) so `boosted`
-    // stays exactly R[] end to end, with no cast-tag-then-strip round trip.
-    const matchesByEntryId = new Map();
-    const boosted = results
-        .map((r) => {
-        const tags = r.entry.tags ?? [];
-        const matches = tags.filter((t) => goalsByTag.has(t));
-        if (matches.length === 0)
-            return r;
-        // Base 2.0x for first match, +0.5x per additional, capped at 3.0x.
-        let multiplier = Math.min(2.0 + 0.5 * (matches.length - 1), MAX_FINAL_MULTIPLIER);
-        // Compose per-policy multipliers per matched tag.
-        for (const tag of matches) {
-            const goal = goalsByTag.get(tag);
-            const policy = policiesByGoalId.get(goal.id);
-            if (!policy)
-                continue;
-            if (policy.policyType === 'error-prioritized' && tags.includes('error')) {
-                multiplier *= policy.errorPriority;
-            }
-            else if (policy.policyType === 'schema-fit-biased') {
-                // Linearly weight schema_fit in [0,1] up to (weightSchemaFit)x.
-                // Default 1.0 is a no-op.
-                multiplier *=
-                    1.0 +
-                        Math.max(0, policy.weightSchemaFit - 1.0) *
-                            (r.entry.schema_fit ?? 0.5);
-            }
-            else if (policy.policyType === 'recency-first') {
-                multiplier *= policy.weightRecency;
-            }
-            else if (policy.policyType === 'hybrid') {
-                multiplier *= policy.weightOutcome;
-            }
-        }
-        // Hard cap AFTER all composition.
-        multiplier = Math.min(multiplier, MAX_FINAL_MULTIPLIER);
-        // A7 recall-trace side-channel: record the goal-boost step BEFORE the
-        // score is mutated, keyed by entry id. Pure read of r.score here; the
-        // mutation below is byte-identical to pre-A7.
-        if (trace) {
-            trace.set(r.entry.id, {
-                stage: 'goal-boost',
-                multiplier,
-                scoreBefore: r.score,
-                scoreAfter: r.score * multiplier,
-                note: matches.join(', '),
-            });
-        }
-        matchesByEntryId.set(r.entry.id, matches);
-        // SAFETY: spreading a generic-constrained `r: R` widens the result to
-        // the spread's plain object type; only `score` changes, so the value
-        // still satisfies R's shape exactly.
-        return { ...r, score: r.score * multiplier };
-    })
-        // T2 note: deliberately a PLAIN stable score sort, no compareEntryIdentity
-        // tail -- a re-sort of an already deterministically-ordered ranking
-        // inherits its determinism via sort stability, and ties preserve the
-        // prior (meaningful) rank instead of reordering by content.
-        .sort((a, b) => b.score - a.score);
-    // Filter to local memories only -- global memory IDs aren't in this DB's
-    // memories table, so the FK on goal_recall_log.memory_id would fail.
-    // dlPFC depth's outcome propagation is session-scoped to local; boost on
-    // ranking still applies to global results, just no log row -> no
-    // propagation.
-    const topKIds = boosted.slice(0, limit).map((r) => r.entry.id);
-    const localIds = new Set();
-    if (topKIds.length > 0) {
-        const placeholders = topKIds.map(() => '?').join(',');
-        // SAFETY: rows come from the SELECT above, which projects exactly one
-        // column, `id`, from memories.
-        const localRows = db.prepare(`SELECT id FROM memories WHERE id IN (${placeholders})`).all(...topKIds);
-        for (const row of localRows)
-            localIds.add(row.id);
-    }
-    // Log top-K boosted recalls. INSERT OR IGNORE because
-    // UNIQUE(memory_id, goal_id) means a re-recall during the same goal life
-    // is a no-op for outcome attribution.
-    const recalledAt = new Date().toISOString();
-    const insertLog = db.prepare(`
-    INSERT OR IGNORE INTO goal_recall_log
-      (goal_id, memory_id, tenant_id, session_id, recalled_at, score)
-    VALUES (?, ?, ?, ?, ?, ?)
-  `);
-    for (const r of boosted.slice(0, limit)) {
-        if (!localIds.has(r.entry.id))
-            continue; // global -> skip log insert
-        const matches = matchesByEntryId.get(r.entry.id);
-        if (!matches || matches.length === 0)
-            continue;
-        for (const tag of matches) {
-            const goal = goalsByTag.get(tag);
-            if (!goal)
-                continue;
-            insertLog.run(goal.id, r.entry.id, tenantId, sessionId, recalledAt, r.score);
-        }
-    }
-    return boosted;
-}
-const POSITIVE_OUTCOME_THRESHOLD = 0.7;
-const NEGATIVE_OUTCOME_THRESHOLD = 0.3;
-const STRENGTH_BOOST = 1.10;
-const STRENGTH_DECAY = 0.85;
-export function completeGoal(hippoRoot, goalId, opts) {
-    const db = openHippoDb(hippoRoot);
-    try {
-        const completedAt = new Date().toISOString();
-        const score = opts.outcomeScore ?? null;
-        db.exec('BEGIN IMMEDIATE');
-        try {
-            // SAFETY: the row comes from the SELECT above, which projects exactly
-            // the created_at and status columns of goal_stack.
-            const goalRow = db.prepare(`SELECT created_at, status FROM goal_stack WHERE id = ?`).get(goalId);
-            if (!goalRow) {
-                db.exec('COMMIT');
-                return;
-            }
-            if (goalRow.status === 'completed') {
-                // Already completed -- second call is a no-op for idempotency.
-                db.exec('COMMIT');
-                return;
-            }
-            db.prepare(`
-        UPDATE goal_stack
-        SET status = 'completed', completed_at = ?, outcome_score = ?
-        WHERE id = ?
-      `).run(completedAt, score, goalId);
-            if (score !== null && !opts.noPropagate) {
-                let multiplier = 1;
-                if (score >= POSITIVE_OUTCOME_THRESHOLD)
-                    multiplier = STRENGTH_BOOST;
-                else if (score < NEGATIVE_OUTCOME_THRESHOLD)
-                    multiplier = STRENGTH_DECAY;
-                if (multiplier !== 1) {
-                    // Lifespan window: only memories whose recall happened during this
-                    // goal's active life. UNIQUE(memory_id, goal_id) guarantees one
-                    // adjustment per (memory, goal) pair.
-                    db.prepare(`
-            UPDATE memories
-            SET strength = MIN(1.0, MAX(0.0, strength * ?))
-            WHERE id IN (
-              SELECT memory_id FROM goal_recall_log
-              WHERE goal_id = ?
-                AND recalled_at >= ?
-                AND recalled_at <= ?
-            )
-          `).run(multiplier, goalId, goalRow.created_at, completedAt);
-                }
-            }
-            db.exec('COMMIT');
-        }
-        catch (err) {
-            try {
-                db.exec('ROLLBACK');
-            }
-            catch { /* already rolled back; keep the original error */ }
-            throw err;
-        }
-    }
-    finally {
-        closeHippoDb(db);
-    }
-}
-export function suspendGoal(hippoRoot, goalId) {
-    const db = openHippoDb(hippoRoot);
-    try {
-        db.prepare(`UPDATE goal_stack SET status = 'suspended' WHERE id = ? AND status = 'active'`).run(goalId);
-    }
-    finally {
-        closeHippoDb(db);
-    }
-}
-export function resumeGoal(hippoRoot, goalId) {
-    const db = openHippoDb(hippoRoot);
-    try {
-        db.exec('BEGIN IMMEDIATE');
-        try {
-            // SAFETY: the row comes from the SELECT above, which projects exactly
-            // the session_id, tenant_id, and status columns of goal_stack.
-            const row = db.prepare(`SELECT session_id, tenant_id, status FROM goal_stack WHERE id = ?`).get(goalId);
-            if (!row || row.status !== 'suspended') {
-                db.exec('COMMIT');
-                return;
-            }
-            enforceDepthCapWithinTx(db, row.tenant_id, row.session_id);
-            db.prepare(`UPDATE goal_stack SET status = 'active' WHERE id = ?`).run(goalId);
-            db.exec('COMMIT');
-        }
-        catch (err) {
-            try {
-                db.exec('ROLLBACK');
-            }
-            catch { /* already rolled back; keep the original error */ }
-            throw err;
-        }
-    }
-    finally {
-        closeHippoDb(db);
-    }
-}
-//# sourceMappingURL=goals.js.map