hippo-memory 0.36.0 → 0.37.0

package/dist/src/refine-llm.js

@@ -0,0 +1,147 @@
+/**
+ * LLM-powered refinement of consolidated semantic memories.
+ *
+ * The rule-based `mergeContents` in consolidate.ts produces functional but
+ * ugly semantic memories — typically "[Consolidated from N related memories]"
+ * prepended to the longest source, or a bulleted list. `hippo refine` takes
+ * those and asks Claude to synthesize a clean, generalized principle.
+ *
+ * Design choices:
+ * - Separate command (not baked into `hippo sleep`) so API-key users opt in.
+ * - Idempotent via the `llm-refined` tag — re-running skips already-refined.
+ * - Uses fetch directly so no SDK dependency.
+ * - On failure (API error, bad response), the original memory is untouched.
+ */
+import { Layer } from './memory.js';
+import { loadAllEntries, readEntry, writeEntry } from './store.js';
+const REFINED_TAG = 'llm-refined';
+const CONSOLIDATED_MARKERS = [
+    '[Consolidated from',
+    '[Consolidated pattern from',
+];
+/**
+ * Ask Claude to synthesize a clean semantic memory from the merged content
+ * plus the original source memories. Returns the refined content string or
+ * `null` when the API call failed.
+ */
+export async function refineSemanticMemory(merged, sources, opts) {
+    const model = opts.model ?? 'claude-sonnet-4-6';
+    const fetchFn = opts.fetcher ?? fetch;
+    const sourceBlock = sources
+        .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):
+${sourceBlock}`;
+    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: 800,
+                messages: [{ role: 'user', content: prompt }],
+            }),
+        });
+    }
+    catch {
+        return null;
+    }
+    if (!res.ok)
+        return null;
+    try {
+        const data = await res.json();
+        const text = data.content?.[0]?.text?.trim() ?? '';
+        if (text.length < 10)
+            return null;
+        return text;
+    }
+    catch {
+        return null;
+    }
+}
+function isConsolidated(entry) {
+    if (entry.layer !== Layer.Semantic)
+        return false;
+    return CONSOLIDATED_MARKERS.some((m) => entry.content.startsWith(m));
+}
+/**
+ * Scan the store for consolidated semantic memories, refine each with the
+ * LLM, and write the refined content back. Tags with `llm-refined` so
+ * repeated runs are idempotent (unless `all` is set).
+ */
+export async function refineStore(hippoRoot, opts) {
+    const result = {
+        scanned: 0,
+        refined: 0,
+        skipped: 0,
+        failed: 0,
+        details: [],
+    };
+    const entries = loadAllEntries(hippoRoot);
+    let processed = 0;
+    for (const entry of entries) {
+        if (!isConsolidated(entry))
+            continue;
+        result.scanned++;
+        if (!opts.all && entry.tags.includes(REFINED_TAG)) {
+            result.skipped++;
+            result.details.push({ id: entry.id, status: 'skipped', reason: 'already refined' });
+            continue;
+        }
+        if (opts.limit !== undefined && processed >= opts.limit)
+            break;
+        processed++;
+        // Best-effort: walk parents_json (schema v9) to fetch originals. When
+        // parents aren't recorded we still refine using just the merged content.
+        const sources = [];
+        const parentIds = Array.isArray(entry.parents) ? entry.parents : [];
+        for (const pid of parentIds) {
+            const p = readEntry(hippoRoot, pid);
+            if (p)
+                sources.push(p);
+        }
+        const refined = await refineSemanticMemory(entry.content, sources, {
+            apiKey: opts.apiKey,
+            model: opts.model,
+            fetcher: opts.fetcher,
+        });
+        if (refined === null) {
+            result.failed++;
+            result.details.push({ id: entry.id, status: 'failed', reason: 'api error or empty response' });
+            continue;
+        }
+        if (opts.dryRun) {
+            result.refined++;
+            result.details.push({ id: entry.id, status: 'refined', reason: 'dry-run (no write)' });
+            continue;
+        }
+        const updated = {
+            ...entry,
+            content: refined,
+            tags: entry.tags.includes(REFINED_TAG) ? entry.tags : [...entry.tags, REFINED_TAG],
+        };
+        writeEntry(hippoRoot, updated);
+        result.refined++;
+        result.details.push({ id: entry.id, status: 'refined' });
+    }
+    return result;
+}
+//# sourceMappingURL=refine-llm.js.map

package/dist/src/refine-llm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refine-llm.js","sourceRoot":"","sources":["../../src/refine-llm.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAe,KAAK,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEnE,MAAM,WAAW,GAAG,aAAa,CAAC;AAClC,MAAM,oBAAoB,GAAG;IAC3B,oBAAoB;IACpB,4BAA4B;CAC7B,CAAC;AAqBF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,MAAc,EACd,OAAsB,EACtB,IAAgE;IAEhE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,mBAAmB,CAAC;IAChD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;IAEtC,MAAM,WAAW,GAAG,OAAO;SACxB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;SAC7D,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG;;;;;;;;;;EAUf,MAAM;;;EAGN,WAAW,EAAE,CAAC;IAEd,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,GAAG;gBACf,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;aAC9C,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAEzB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAA4C,CAAC;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACnD,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;YAAE,OAAO,IAAI,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,KAAkB;IACxC,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IACjD,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,IAAmB;IAEnB,MAAM,MAAM,GAAiB;QAC3B,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,CAAC;QACT,OAAO,EAAE,EAAE;KACZ,CAAC;IAEF,MAAM,OAAO,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YAAE,SAAS;QACrC,MAAM,CAAC,OAAO,EAAE,CAAC;QAEjB,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC,CAAC;YACpF,SAAS;QACX,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,SAAS,IAAI,IAAI,CAAC,KAAK;YAAE,MAAM;QAC/D,SAAS,EAAE,CAAC;QAEZ,sEAAsE;QACtE,yEAAyE;QACzE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACpE,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,EAAE;YACjE,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,OAAO,EAAE,IAAI,CAAC,OAAO;SACtB,CAAC,CAAC;QAEH,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,6BAA6B,EAAE,CAAC,CAAC;YAC/F,SAAS;QACX,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,oBAAoB,EAAE,CAAC,CAAC;YACvF,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAgB;YAC3B,GAAG,KAAK;YACR,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,WAAW,CAAC;SACnF,CAAC;QACF,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/replay.js

@@ -0,0 +1,117 @@
+/**
+ * Replay — biologically-inspired rehearsal during consolidation.
+ *
+ * Hippocampal replay is internally-driven reactivation of memories during
+ * slow-wave sleep: the brain picks important recent experiences and "plays
+ * them back" without external input, strengthening them before they decay.
+ * In McClelland's complementary-learning-systems framing, replay is also
+ * how episodic memories train the neocortex (interleaved rehearsal); in
+ * reward-modulated STDP, replay is gated by dopamine so rewarded
+ * experiences get preferentially consolidated.
+ *
+ * This module implements a lightweight, deterministic analog. During each
+ * `hippo sleep`, we sample N surviving memories by a priority score that
+ * weighs reward feedback, emotional valence, under-rehearsal, and age —
+ * then apply the same retrieval-strengthening dynamics `markRetrieved`
+ * applies to real queries. The effect is that important memories stay
+ * strong even when the user hasn't explicitly queried them recently.
+ *
+ * Distinct from the other consolidation passes:
+ *   - decay: removes what's too weak
+ *   - physics: moves particles in embedding space
+ *   - merge: collapses near-duplicate episodics into semantics
+ *   - REPLAY: picks winners and rehearses them (this file)
+ */
+const VALENCE_WEIGHT = {
+    neutral: 1.0,
+    positive: 1.3,
+    negative: 1.5,
+    critical: 2.0,
+};
+/**
+ * Priority score used to rank survivors for replay. Higher = more likely
+ * to be sampled. Pure function of the entry and current time.
+ */
+export function replayPriority(entry, now) {
+    const pos = entry.outcome_positive ?? 0;
+    const neg = entry.outcome_negative ?? 0;
+    // Reward signal: neutral memories get 1, strongly-rewarded memories > 1,
+    // negative-dominated memories floor at 0.1 (so they're still eligible, just
+    // much less likely to be sampled than neutral peers). Clamp is required
+    // because sampleForReplay depends on all weights being positive.
+    const rewardSignal = Math.max(0.1, 1 + pos * 0.5 + (pos - neg) * 0.25);
+    const valence = VALENCE_WEIGHT[entry.emotional_valence] ?? 1.0;
+    // Under-rehearsed memories benefit most from replay.
+    const underRehearsed = 1 / (1 + (entry.retrieval_count ?? 0));
+    // Idle-time boost: memories that haven't been touched recently need rehearsal more.
+    const lastRetrieved = new Date(entry.last_retrieved);
+    const deltaMs = now.getTime() - lastRetrieved.getTime();
+    const ageHours = Number.isFinite(deltaMs) ? Math.max(0, deltaMs / 3_600_000) : 0;
+    const idleBoost = 1 + Math.log1p(ageHours) * 0.1;
+    // Weight by current strength so dead-and-decaying memories don't waste replay slots.
+    const rawStrength = Number.isFinite(entry.strength) ? entry.strength : 0;
+    const strengthFloor = Math.max(0.1, rawStrength);
+    return rewardSignal * valence * underRehearsed * idleBoost * strengthFloor;
+}
+/**
+ * Deterministic 32-bit RNG (Mulberry32). Same seed → same sequence.
+ * Keeps replay reproducible for tests and audit runs without bringing
+ * in a random-number dependency.
+ */
+function mulberry32(seed) {
+    let s = seed >>> 0;
+    return () => {
+        let t = (s += 0x6D2B79F5);
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+/**
+ * Pick `count` memories for replay, weighted by `replayPriority`, without
+ * replacement. Deterministic given the same seed.
+ *
+ * The sampler is weighted but not greedy — picking by priority alone would
+ * always pick the top-N, which overfits. Biological replay shows both
+ * preferential-for-reward AND stochastic-exploration characteristics; we
+ * keep the stochastic element so adjacent survivors aren't always ignored.
+ */
+export function sampleForReplay(survivors, count, now, seed = Date.now() >>> 0) {
+    if (count <= 0 || survivors.length === 0)
+        return [];
+    const rng = mulberry32(seed);
+    // Stale memories have been deliberately marked as untrusted; rehearsing
+    // them would defeat the purpose of staleness. Skip them entirely.
+    const eligible = survivors.filter((e) => e.confidence !== 'stale');
+    if (eligible.length === 0)
+        return [];
+    const pool = eligible.map((entry, idx) => ({
+        entry,
+        idx,
+        weight: replayPriority(entry, now),
+    }));
+    const want = Math.min(count, pool.length);
+    const chosen = [];
+    const taken = new Set();
+    for (let k = 0; k < want; k++) {
+        let totalW = 0;
+        for (const p of pool)
+            if (!taken.has(p.idx))
+                totalW += p.weight;
+        if (totalW <= 0)
+            break;
+        let r = rng() * totalW;
+        for (const p of pool) {
+            if (taken.has(p.idx))
+                continue;
+            r -= p.weight;
+            if (r <= 0) {
+                chosen.push(p.entry);
+                taken.add(p.idx);
+                break;
+            }
+        }
+    }
+    return chosen;
+}
+//# sourceMappingURL=replay.js.map

package/dist/src/replay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay.js","sourceRoot":"","sources":["../../src/replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,MAAM,cAAc,GAAqC;IACvD,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;IACb,QAAQ,EAAE,GAAG;CACd,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB,EAAE,GAAS;IAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACxC,yEAAyE;IACzE,4EAA4E;IAC5E,wEAAwE;IACxE,iEAAiE;IACjE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAEvE,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC;IAE/D,qDAAqD;IACrD,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9D,oFAAoF;IACpF,MAAM,aAAa,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;IACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;IAEjD,qFAAqF;IACrF,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAEjD,OAAO,YAAY,GAAG,OAAO,GAAG,cAAc,GAAG,SAAS,GAAG,aAAa,CAAC;AAC7E,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO,GAAG,EAAE;QACV,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC;QAC1B,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAwB,EACxB,KAAa,EACb,GAAS,EACT,OAAe,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC;IAE/B,IAAI,KAAK,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAE7B,wEAAwE;IACxE,kEAAkE;IAClE,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,OAAO,CAAC,CAAC;IACnE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACzC,KAAK;QACL,GAAG;QACH,MAAM,EAAE,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC;KACnC,CAAC,CAAC,CAAC;IAEJ,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC;QAChE,IAAI,MAAM,IAAI,CAAC;YAAE,MAAM;QACvB,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,MAAM,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/salience.js

@@ -0,0 +1,74 @@
+/**
+ * Salience gate — decides at memory creation time whether content is worth
+ * storing at full strength, should start weakened, or should be skipped.
+ *
+ * Inspired by the biological salience network (anterior insula + dACC):
+ * not everything that enters working memory deserves long-term storage.
+ */
+import { textOverlap } from './search.js';
+const DEFAULTS = {
+    recentWindow: 20,
+    overlapThreshold: 0.6,
+    minContentLength: 5,
+    maxRepeatErrors: 4,
+};
+export function computeSalience(content, tags, recentMemories, options = {}) {
+    const opts = { ...DEFAULTS, ...options };
+    const trimmed = content.trim();
+    const isPinned = tags.includes('pinned');
+    if (isPinned) {
+        return { decision: 'store', reason: 'pinned', score: 1.0 };
+    }
+    if (trimmed.length < opts.minContentLength) {
+        return { decision: 'skip', reason: 'content_too_short', score: 0 };
+    }
+    const isError = tags.some(t => t === 'error' || t === 'critical' || t.startsWith('error:'));
+    const window = recentMemories.slice(-opts.recentWindow);
+    const duplicateMatch = findBestOverlap(trimmed, window);
+    if (duplicateMatch.overlap > opts.overlapThreshold) {
+        if (isError) {
+            const recentErrors = countRecentErrors(window);
+            if (recentErrors >= opts.maxRepeatErrors) {
+                return {
+                    decision: 'start_weak',
+                    reason: `repeat_error (${recentErrors} recent errors, overlap ${(duplicateMatch.overlap * 100).toFixed(0)}% with ${duplicateMatch.matchId})`,
+                    score: 0.3,
+                };
+            }
+            return { decision: 'store', reason: 'error_despite_overlap', score: 0.7 };
+        }
+        return {
+            decision: 'skip',
+            reason: `duplicate (${(duplicateMatch.overlap * 100).toFixed(0)}% overlap with ${duplicateMatch.matchId})`,
+            score: 0.1,
+        };
+    }
+    if (isError) {
+        return { decision: 'store', reason: 'error_novel', score: 0.9 };
+    }
+    const hasStructuredTags = tags.some(t => t.startsWith('speaker:') || t.startsWith('topic:') || t.startsWith('scope:'));
+    let score = 0.5;
+    if (hasStructuredTags)
+        score += 0.15;
+    if (trimmed.length > 100)
+        score += 0.1;
+    if (trimmed.length > 300)
+        score += 0.1;
+    return { decision: 'store', reason: 'novel', score: Math.min(score, 1.0) };
+}
+function findBestOverlap(content, memories) {
+    let best = 0;
+    let matchId = null;
+    for (const m of memories) {
+        const overlap = textOverlap(content, m.content);
+        if (overlap > best) {
+            best = overlap;
+            matchId = m.id;
+        }
+    }
+    return { overlap: best, matchId };
+}
+function countRecentErrors(memories) {
+    return memories.filter(m => m.emotional_valence === 'negative' || m.emotional_valence === 'critical').length;
+}
+//# sourceMappingURL=salience.js.map

package/dist/src/salience.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"salience.js","sourceRoot":"","sources":["../../src/salience.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAiB1C,MAAM,QAAQ,GAA8B;IAC1C,YAAY,EAAE,EAAE;IAChB,gBAAgB,EAAE,GAAG;IACrB,gBAAgB,EAAE,CAAC;IACnB,eAAe,EAAE,CAAC;CACnB,CAAC;AAEF,MAAM,UAAU,eAAe,CAC7B,OAAe,EACf,IAAc,EACd,cAA6B,EAC7B,UAA2B,EAAE;IAE7B,MAAM,IAAI,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,OAAO,EAAE,CAAC;IACzC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAEzC,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IAC7D,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,mBAAmB,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACrE,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAC5B,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAC5D,CAAC;IAEF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAExD,MAAM,cAAc,GAAG,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACxD,IAAI,cAAc,CAAC,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACnD,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,YAAY,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC/C,IAAI,YAAY,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBACzC,OAAO;oBACL,QAAQ,EAAE,YAAY;oBACtB,MAAM,EAAE,iBAAiB,YAAY,2BAA2B,CAAC,cAAc,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,cAAc,CAAC,OAAO,GAAG;oBAC5I,KAAK,EAAE,GAAG;iBACX,CAAC;YACJ,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,uBAAuB,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAC5E,CAAC;QACD,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,MAAM,EAAE,cAAc,CAAC,cAAc,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,cAAc,CAAC,OAAO,GAAG;YAC1G,KAAK,EAAE,GAAG;SACX,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IAClE,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACtC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAC7E,CAAC;IAEF,IAAI,KAAK,GAAG,GAAG,CAAC;IAChB,IAAI,iBAAiB;QAAE,KAAK,IAAI,IAAI,CAAC;IACrC,IAAI,OAAO,CAAC,MAAM,GAAG,GAAG;QAAE,KAAK,IAAI,GAAG,CAAC;IACvC,IAAI,OAAO,CAAC,MAAM,GAAG,GAAG;QAAE,KAAK,IAAI,GAAG,CAAC;IAEvC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;AAC7E,CAAC;AAED,SAAS,eAAe,CACtB,OAAe,EACf,QAAuB;IAEvB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,OAAO,GAAG,IAAI,EAAE,CAAC;YACnB,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AACpC,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAuB;IAChD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACzB,CAAC,CAAC,iBAAiB,KAAK,UAAU,IAAI,CAAC,CAAC,iBAAiB,KAAK,UAAU,CACzE,CAAC,MAAM,CAAC;AACX,CAAC"}

package/dist/src/scheduler.js

@@ -0,0 +1,67 @@
+import * as fs from 'fs';
+import * as path from 'path';
+export const DAILY_TASK_NAME = 'hippo-daily-runner';
+function defaultRegistry() {
+    return {
+        version: 1,
+        workspaces: [],
+    };
+}
+export function workspaceRegistryPath(globalRoot) {
+    return path.join(globalRoot, 'workspaces.json');
+}
+function normalizeWorkspace(projectDir) {
+    return path.resolve(projectDir).replace(/\\/g, '/');
+}
+export function loadWorkspaceRegistry(globalRoot) {
+    const registryPath = workspaceRegistryPath(globalRoot);
+    if (!fs.existsSync(registryPath))
+        return defaultRegistry();
+    try {
+        const parsed = JSON.parse(fs.readFileSync(registryPath, 'utf8'));
+        const workspaces = Array.isArray(parsed.workspaces)
+            ? [...new Set(parsed.workspaces.map((entry) => normalizeWorkspace(String(entry))).filter(Boolean))].sort()
+            : [];
+        return {
+            version: 1,
+            workspaces,
+        };
+    }
+    catch {
+        return defaultRegistry();
+    }
+}
+export function saveWorkspaceRegistry(globalRoot, registry) {
+    fs.mkdirSync(globalRoot, { recursive: true });
+    fs.writeFileSync(workspaceRegistryPath(globalRoot), JSON.stringify({
+        version: 1,
+        workspaces: [...new Set(registry.workspaces.map(normalizeWorkspace))].sort(),
+    }, null, 2) + '\n', 'utf8');
+}
+export function registerWorkspace(globalRoot, projectDir) {
+    const registry = loadWorkspaceRegistry(globalRoot);
+    registry.workspaces = [...new Set([...registry.workspaces, normalizeWorkspace(projectDir)])].sort();
+    saveWorkspaceRegistry(globalRoot, registry);
+    return registry;
+}
+export function listRegisteredWorkspaces(globalRoot) {
+    return loadWorkspaceRegistry(globalRoot).workspaces;
+}
+export function buildDailyRunnerCommand(projectDir, platform = process.platform) {
+    if (platform === 'win32') {
+        const resolved = path.win32.resolve(projectDir).replace(/\\/g, '/');
+        return `cd /d "${resolved}" && hippo daily-runner`;
+    }
+    const resolved = path.posix.resolve(projectDir.replace(/\\/g, '/'));
+    return `cd "${resolved}" && hippo daily-runner`;
+}
+export function runDailyMaintenance(workspaces, runCommand) {
+    for (const workspace of workspaces) {
+        const resolved = normalizeWorkspace(workspace);
+        if (!fs.existsSync(path.join(resolved, '.hippo')))
+            continue;
+        runCommand(resolved, ['learn', '--git', '--days', '1']);
+        runCommand(resolved, ['sleep']);
+    }
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/src/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,MAAM,CAAC,MAAM,eAAe,GAAG,oBAAoB,CAAC;AAOpD,SAAS,eAAe;IACtB,OAAO;QACL,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,EAAE;KACf,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,UAAkB;IACtD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,kBAAkB,CAAC,UAAkB;IAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,UAAkB;IACtD,MAAM,YAAY,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IACvD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;QAAE,OAAO,eAAe,EAAE,CAAC;IAE3D,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAA+B,CAAC;QAC/F,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC;YACjD,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;YAC1G,CAAC,CAAC,EAAE,CAAC;QACP,OAAO;YACL,OAAO,EAAE,CAAC;YACV,UAAU;SACX,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,eAAe,EAAE,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,UAAkB,EAAE,QAA2B;IACnF,EAAE,CAAC,SAAS,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC9C,EAAE,CAAC,aAAa,CACd,qBAAqB,CAAC,UAAU,CAAC,EACjC,IAAI,CAAC,SAAS,CACZ;QACE,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;KAC7E,EACD,IAAI,EACJ,CAAC,CACF,GAAG,IAAI,EACR,MAAM,CACP,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,UAAkB,EAAE,UAAkB;IACtE,MAAM,QAAQ,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IACnD,QAAQ,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,UAAU,EAAE,kBAAkB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACpG,qBAAqB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC5C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,UAAkB;IACzD,OAAO,qBAAqB,CAAC,UAAU,CAAC,CAAC,UAAU,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,UAAkB,EAClB,WAA4B,OAAO,CAAC,QAAQ;IAE5C,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpE,OAAO,UAAU,QAAQ,yBAAyB,CAAC;IACrD,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IACpE,OAAO,OAAO,QAAQ,yBAAyB,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,UAA6B,EAC7B,UAAiD;IAEjD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAAE,SAAS;QAC5D,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,UAAU,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAClC,CAAC;AACH,CAAC"}

package/dist/src/scope.js

@@ -0,0 +1,35 @@
+/**
+ * Detect the current operational scope from environment signals.
+ * Returns a scope name string (no prefix), or null if no scope detected.
+ * Priority: HIPPO_SCOPE > GSTACK_SKILL > OPENCLAW_SKILL.
+ *
+ * Pure env var reads: no I/O, safe to call from hot paths (e.g. UserPromptSubmit hook).
+ */
+export function detectScope() {
+    const explicit = process.env['HIPPO_SCOPE'];
+    if (explicit && explicit.trim())
+        return explicit.trim();
+    const gstackSkill = process.env['GSTACK_SKILL'];
+    if (gstackSkill && gstackSkill.trim())
+        return gstackSkill.trim();
+    const openclawSkill = process.env['OPENCLAW_SKILL'];
+    if (openclawSkill && openclawSkill.trim())
+        return openclawSkill.trim();
+    return null;
+}
+/**
+ * Compute scope match between a memory's scope tags and the active scope.
+ * Returns: 1 if matching scope, -1 if mismatching scope, 0 if neutral (no scope on either side).
+ */
+export function scopeMatch(memoryTags, activeScope) {
+    const scopeTags = memoryTags.filter(t => t.startsWith('scope:'));
+    if (scopeTags.length === 0)
+        return 0; // memory has no scope: always neutral
+    if (!activeScope)
+        return 0; // no active scope: everything neutral
+    const scopeKey = `scope:${activeScope}`;
+    if (scopeTags.includes(scopeKey))
+        return 1; // match
+    return -1; // mismatch
+}
+//# sourceMappingURL=scope.js.map

package/dist/src/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/scope.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,WAAW;IACzB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC;IAExD,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAChD,IAAI,WAAW,IAAI,WAAW,CAAC,IAAI,EAAE;QAAE,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC;IAEjE,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IACpD,IAAI,aAAa,IAAI,aAAa,CAAC,IAAI,EAAE;QAAE,OAAO,aAAa,CAAC,IAAI,EAAE,CAAC;IAEvE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,UAAoB,EAAE,WAA0B;IACzE,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAE,sCAAsC;IAC7E,IAAI,CAAC,WAAW;QAAE,OAAO,CAAC,CAAC,CAAY,sCAAsC;IAC7E,MAAM,QAAQ,GAAG,SAAS,WAAW,EAAE,CAAC;IACxC,IAAI,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,CAAC,CAAG,QAAQ;IACtD,OAAO,CAAC,CAAC,CAAC,CAAuC,WAAW;AAC9D,CAAC"}