@melra/memory 0.3.0-alpha.10

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,56 @@
+# @melra/memory
+
+Scoped, redacted local memory for [MELRA](https://github.com/XAGI-Lab/melra):
+put, search, list, delete, and clear, backed by the same SQLite database as
+tasks and workflows.
+
+```bash
+npm install @melra/memory
+```
+
+```ts
+import { MemoryOperationSchema } from "@melra/protocol";
+import { LocalMemory, rankMemories } from "@melra/memory";
+
+const memory = new LocalMemory(store);
+memory.execute(
+  MemoryOperationSchema.parse({
+    kind: "memory",
+    action: "put",
+    key: "deploy-owner",
+    value: "platform team",
+  }),
+);
+```
+
+`MemoryOperation` is the post-defaults shape, so parse the operation through the
+schema rather than hand-filling `scope`, `confidence`, `tags`, `limit`, and
+`includeSuperseded`.
+
+Search is lexical, not embedded — tokenised, ranked by term overlap with exact
+phrase matches promoted. That is a deliberate ceiling: it is deterministic,
+needs no model call, and never sends anything anywhere. `rankMemories` and
+`tokenize` are exported if you want the ranking without the store.
+
+Every value passes through `redactMemoryValue` before it is written, so a token
+pasted into a memory entry is not preserved in the database.
+
+Reads and deletes are scope-aware: a scope only sees its own entries, so one
+task cannot read what another stored by guessing a key.
+
+Expired and superseded records are already invisible to every read path;
+`LocalMemory` reclaims them on the next write to that scope, after
+`MemoryRetention.maxAgeDays` (default 30). Pass `maxPerScope` to also cap live
+memories — that one deletes records you can still read, so it defaults to `0`
+(no ceiling).
+
+```ts
+import { LocalMemory } from "@melra/memory";
+
+const bounded = new LocalMemory(store, { maxAgeDays: 7, maxPerScope: 5_000 });
+```
+
+Requires Node.js 22 or newer. Full documentation:
+[github.com/XAGI-Lab/melra](https://github.com/XAGI-Lab/melra)
+
+Apache-2.0

package/dist/index.d.ts

@@ -0,0 +1,50 @@
+import type { MemoryOperation } from "@melra/protocol";
+import { SqliteStore, type MemoryRecord } from "@melra/storage-sqlite";
+/**
+ * How long an unreachable memory row survives before compaction reclaims it,
+ * and an optional ceiling on live memories per scope.
+ *
+ * Expired and superseded rows are already filtered out of every read path, so
+ * removing them changes nothing a caller can observe — it only stops the file
+ * growing forever. `maxPerScope` is the opposite: it deletes memories that can
+ * still be read, so `0` (no ceiling) is the default and an operator opts in.
+ */
+export interface MemoryRetention {
+    maxAgeDays: number;
+    maxPerScope: number;
+}
+export declare const DEFAULT_MEMORY_RETENTION: MemoryRetention;
+export declare function redactMemoryValue(value: string): {
+    value: string;
+    redactions: string[];
+};
+export interface RankedMemory extends MemoryRecord {
+    score: number;
+    scoreBreakdown: {
+        lexical: number;
+        phrase: number;
+        confidence: number;
+        freshness: number;
+        context: number;
+        speaker: number;
+        diversityPenalty: number;
+    };
+}
+export declare function tokenize(value: string): string[];
+/**
+ * Deterministic local retrieval with inspectable scoring and no model call.
+ *
+ * The first pass combines BM25-style term evidence, exact phrase matching,
+ * provenance confidence, and freshness. The second pass applies a bounded
+ * maximal-marginal-relevance penalty so repeated records do not crowd out
+ * distinct evidence. A final bounded pass uses explicit episode order and
+ * speaker metadata when the caller supplies them.
+ */
+export declare function rankMemories(records: MemoryRecord[], query: string, limit: number, nowMs?: number): RankedMemory[];
+export declare class LocalMemory {
+    private readonly store;
+    private readonly retention;
+    constructor(store: SqliteStore, retention?: MemoryRetention);
+    execute(operation: MemoryOperation): Record<string, unknown>;
+}
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EACL,WAAW,EACX,KAAK,YAAY,EAClB,MAAM,uBAAuB,CAAC;AAS/B;;;;;;;;GAQG;AACH,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,eAAO,MAAM,wBAAwB,EAAE,eAGtC,CAAC;AAGF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB,CASA;AAED,MAAM,WAAW,YAAa,SAAQ,YAAY;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE;QACd,OAAO,EAAE,MAAM,CAAC;QAChB,MAAM,EAAE,MAAM,CAAC;QACf,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,gBAAgB,EAAE,MAAM,CAAC;KAC1B,CAAC;CACH;AAUD,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAEhD;AAoBD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,SAAa,GACjB,YAAY,EAAE,CAqNhB;AAED,qBAAa,WAAW;IAEpB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS;gBADT,KAAK,EAAE,WAAW,EAClB,SAAS,GAAE,eAA0C;IAGxE,OAAO,CAAC,SAAS,EAAE,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAqJ7D"}

package/dist/index.js

@@ -0,0 +1,368 @@
+// Copyright 2026 XAGI Labs Private Limited
+// SPDX-License-Identifier: Apache-2.0
+import { randomUUID } from "node:crypto";
+const SECRET_PATTERNS = [
+    [/\b(?:sk|pk|api)[-_][a-z0-9_-]{16,}\b/gi, "[REDACTED_API_KEY]"],
+    [/\bBearer\s+[A-Za-z0-9._~+/-]+=*\b/gi, "Bearer [REDACTED_TOKEN]"],
+    [/\b(password|passwd|secret)\s*[:=]\s*\S+/gi, "$1=[REDACTED]"],
+    [/\bgh[opurs]_[A-Za-z0-9]{20,}\b/g, "[REDACTED_GITHUB_TOKEN]"],
+];
+export const DEFAULT_MEMORY_RETENTION = {
+    maxAgeDays: 30,
+    maxPerScope: 0,
+};
+export function redactMemoryValue(value) {
+    let redacted = value;
+    const redactions = [];
+    for (const [pattern, replacement] of SECRET_PATTERNS) {
+        const before = redacted;
+        redacted = redacted.replace(pattern, replacement);
+        if (redacted !== before)
+            redactions.push(replacement);
+    }
+    return { value: redacted, redactions };
+}
+const DAY_MS = 86_400_000;
+const DEFAULT_HALF_LIFE_DAYS = 30;
+const MAX_CANDIDATES = 5_000;
+const CONTEXT_ANCHORS = 20;
+const CONTEXT_DEPTH = 2;
+const CONTEXT_DECAY = 0.9;
+const SPEAKER_BOOST = 0.1;
+export function tokenize(value) {
+    return value.toLocaleLowerCase().match(/[\p{L}\p{N}]+/gu) ?? [];
+}
+function termFrequency(tokens, term) {
+    return tokens.reduce((count, token) => count + Number(token === term), 0);
+}
+function jaccard(left, right) {
+    if (left.size === 0 && right.size === 0)
+        return 1;
+    let intersection = 0;
+    for (const value of left) {
+        if (right.has(value))
+            intersection += 1;
+    }
+    return intersection / (left.size + right.size - intersection);
+}
+function freshness(updatedAt, nowMs) {
+    const ageDays = Math.max(0, nowMs - Date.parse(updatedAt)) / DAY_MS;
+    return Math.exp((-Math.LN2 * ageDays) / DEFAULT_HALF_LIFE_DAYS);
+}
+/**
+ * Deterministic local retrieval with inspectable scoring and no model call.
+ *
+ * The first pass combines BM25-style term evidence, exact phrase matching,
+ * provenance confidence, and freshness. The second pass applies a bounded
+ * maximal-marginal-relevance penalty so repeated records do not crowd out
+ * distinct evidence. A final bounded pass uses explicit episode order and
+ * speaker metadata when the caller supplies them.
+ */
+export function rankMemories(records, query, limit, nowMs = Date.now()) {
+    const queryTokens = [...new Set(tokenize(query))];
+    if (queryTokens.length === 0)
+        return [];
+    const queryTokenSet = new Set(queryTokens);
+    const documents = records.map((record) => ({
+        record,
+        tokens: tokenize(`${record.key} ${record.value} ${record.tags.join(" ")}`),
+    }));
+    const documentFrequency = new Map();
+    for (const document of documents) {
+        for (const token of new Set(document.tokens)) {
+            documentFrequency.set(token, (documentFrequency.get(token) ?? 0) + 1);
+        }
+    }
+    const averageLength = documents.reduce((total, document) => total + document.tokens.length, 0) /
+        Math.max(1, documents.length);
+    const normalizedQuery = query.trim().toLocaleLowerCase();
+    const scored = documents
+        .map(({ record, tokens }) => {
+        let lexical = 0;
+        for (const term of queryTokens) {
+            const containing = documentFrequency.get(term) ?? 0;
+            const idf = Math.log(1 + (documents.length - containing + 0.5) / (containing + 0.5));
+            const frequency = termFrequency(tokens, term);
+            const denominator = frequency +
+                1.2 *
+                    (1 - 0.75 + 0.75 * (tokens.length / Math.max(1, averageLength)));
+            lexical +=
+                frequency === 0 ? 0 : idf * ((frequency * 2.2) / denominator);
+        }
+        const normalizedLexical = lexical / Math.max(1, queryTokens.length);
+        const phrase = `${record.key} ${record.value}`
+            .toLocaleLowerCase()
+            .includes(normalizedQuery)
+            ? 1
+            : 0;
+        const fresh = freshness(record.updatedAt, nowMs);
+        const base = normalizedLexical * 0.62 +
+            phrase * 0.16 +
+            record.confidence * 0.14 +
+            fresh * 0.08;
+        return {
+            record,
+            tokenSet: new Set(tokens),
+            base,
+            normalizedLexical,
+            phrase,
+            fresh,
+        };
+    })
+        .filter((candidate) => candidate.normalizedLexical > 0 || candidate.phrase > 0)
+        .sort((left, right) => right.base - left.base ||
+        right.record.updatedAt.localeCompare(left.record.updatedAt));
+    const selected = [];
+    const remaining = scored.map((candidate) => ({
+        candidate,
+        maxSimilarity: 0,
+    }));
+    const diversityDepth = Math.min(limit, 20);
+    while (remaining.length > 0 && selected.length < diversityDepth) {
+        let bestIndex = 0;
+        let bestAdjusted = Number.NEGATIVE_INFINITY;
+        let bestPenalty = 0;
+        for (let index = 0; index < remaining.length; index += 1) {
+            const entry = remaining[index];
+            const candidate = entry.candidate;
+            const penalty = entry.maxSimilarity;
+            const adjusted = candidate.base * 0.88 - penalty * 0.12;
+            if (adjusted > bestAdjusted ||
+                (adjusted === bestAdjusted &&
+                    candidate.record.updatedAt >
+                        remaining[bestIndex].candidate.record.updatedAt)) {
+                bestIndex = index;
+                bestAdjusted = adjusted;
+                bestPenalty = penalty;
+            }
+        }
+        const [entry] = remaining.splice(bestIndex, 1);
+        if (entry === undefined)
+            break;
+        const candidate = entry.candidate;
+        selected.push({
+            candidate,
+            ranked: {
+                ...candidate.record,
+                score: Number(bestAdjusted.toFixed(6)),
+                scoreBreakdown: {
+                    lexical: Number(candidate.normalizedLexical.toFixed(6)),
+                    phrase: candidate.phrase,
+                    confidence: candidate.record.confidence,
+                    freshness: Number(candidate.fresh.toFixed(6)),
+                    context: 0,
+                    speaker: 0,
+                    diversityPenalty: Number(bestPenalty.toFixed(6)),
+                },
+            },
+        });
+        for (const remainingEntry of remaining) {
+            remainingEntry.maxSimilarity = Math.max(remainingEntry.maxSimilarity, jaccard(remainingEntry.candidate.tokenSet, candidate.tokenSet));
+        }
+    }
+    for (let index = 0; index < remaining.length && selected.length < limit; index += 1) {
+        const candidate = remaining[index].candidate;
+        selected.push({
+            candidate,
+            ranked: {
+                ...candidate.record,
+                score: Number((candidate.base * 0.88).toFixed(6)),
+                scoreBreakdown: {
+                    lexical: Number(candidate.normalizedLexical.toFixed(6)),
+                    phrase: candidate.phrase,
+                    confidence: candidate.record.confidence,
+                    freshness: Number(candidate.fresh.toFixed(6)),
+                    context: 0,
+                    speaker: 0,
+                    diversityPenalty: 0,
+                },
+            },
+        });
+    }
+    const rankedById = new Map(selected.map(({ ranked }) => [ranked.id, ranked]));
+    const episodeSequence = new Map();
+    for (const record of records) {
+        if (record.episodeId === undefined || record.sequence === undefined) {
+            continue;
+        }
+        const key = `${record.episodeId}\u0000${record.sequence}`;
+        const entries = episodeSequence.get(key) ?? [];
+        entries.push(record);
+        episodeSequence.set(key, entries);
+    }
+    for (const { ranked: anchor } of selected.slice(0, CONTEXT_ANCHORS)) {
+        if (anchor.episodeId === undefined || anchor.sequence === undefined) {
+            continue;
+        }
+        for (let distance = 1; distance <= CONTEXT_DEPTH; distance += 1) {
+            for (const direction of [-1, 1]) {
+                const key = `${anchor.episodeId}\u0000${anchor.sequence + direction * distance}`;
+                for (const neighbor of episodeSequence.get(key) ?? []) {
+                    const context = anchor.score * CONTEXT_DECAY ** distance;
+                    const existing = rankedById.get(neighbor.id);
+                    if (existing === undefined) {
+                        rankedById.set(neighbor.id, {
+                            ...neighbor,
+                            score: Number(context.toFixed(6)),
+                            scoreBreakdown: {
+                                lexical: 0,
+                                phrase: 0,
+                                confidence: neighbor.confidence,
+                                freshness: Number(freshness(neighbor.updatedAt, nowMs).toFixed(6)),
+                                context: Number(context.toFixed(6)),
+                                speaker: 0,
+                                diversityPenalty: 0,
+                            },
+                        });
+                    }
+                    else if (context > existing.scoreBreakdown.context) {
+                        existing.score = Number(Math.max(existing.score, context).toFixed(6));
+                        existing.scoreBreakdown.context = Number(context.toFixed(6));
+                    }
+                }
+            }
+        }
+    }
+    for (const ranked of rankedById.values()) {
+        if (ranked.speaker !== undefined &&
+            tokenize(ranked.speaker).some((token) => queryTokenSet.has(token))) {
+            ranked.score = Number((ranked.score + SPEAKER_BOOST).toFixed(6));
+            ranked.scoreBreakdown.speaker = SPEAKER_BOOST;
+        }
+    }
+    return [...rankedById.values()]
+        .sort((left, right) => right.score - left.score ||
+        right.updatedAt.localeCompare(left.updatedAt))
+        .slice(0, limit);
+}
+export class LocalMemory {
+    store;
+    retention;
+    constructor(store, retention = DEFAULT_MEMORY_RETENTION) {
+        this.store = store;
+        this.retention = retention;
+    }
+    execute(operation) {
+        switch (operation.action) {
+            case "put": {
+                if (operation.key === undefined || operation.value === undefined) {
+                    throw new Error("memory_put_requires_key_and_value");
+                }
+                const now = new Date().toISOString();
+                const redacted = redactMemoryValue(operation.value);
+                const redactedSpeaker = operation.speaker === undefined
+                    ? undefined
+                    : redactMemoryValue(operation.speaker);
+                const redactedEpisodeId = operation.episodeId === undefined
+                    ? undefined
+                    : redactMemoryValue(operation.episodeId);
+                const existing = operation.id === undefined
+                    ? undefined
+                    : this.store.getMemory(operation.id);
+                if (existing !== undefined && existing.scope !== operation.scope) {
+                    throw new Error("memory_scope_mismatch");
+                }
+                if (existing?.supersededBy !== undefined) {
+                    throw new Error("memory_superseded_record_immutable");
+                }
+                const superseded = operation.supersedesId === undefined
+                    ? undefined
+                    : this.store.getMemory(operation.supersedesId);
+                if (operation.supersedesId !== undefined &&
+                    (superseded === undefined ||
+                        superseded.scope !== operation.scope ||
+                        operation.supersedesId === operation.id)) {
+                    throw new Error("memory_supersedes_target_invalid");
+                }
+                const memory = {
+                    id: operation.id ?? randomUUID(),
+                    scope: operation.scope,
+                    key: operation.key,
+                    value: redacted.value,
+                    source: operation.source ?? "mcp-client",
+                    confidence: operation.confidence,
+                    tags: operation.tags,
+                    ...(redactedSpeaker === undefined
+                        ? {}
+                        : { speaker: redactedSpeaker.value }),
+                    ...(redactedEpisodeId === undefined
+                        ? {}
+                        : { episodeId: redactedEpisodeId.value }),
+                    ...(operation.sequence === undefined
+                        ? {}
+                        : { sequence: operation.sequence }),
+                    ...(operation.expiresAt === undefined
+                        ? {}
+                        : { expiresAt: operation.expiresAt }),
+                    ...(operation.supersedesId === undefined
+                        ? {}
+                        : { supersedesId: operation.supersedesId }),
+                    createdAt: existing?.createdAt ?? now,
+                    updatedAt: now,
+                };
+                this.store.putMemory(memory);
+                if (operation.supersedesId !== undefined &&
+                    !this.store.supersedeMemory(operation.supersedesId, operation.scope, memory.id)) {
+                    this.store.deleteMemory(memory.id, memory.scope);
+                    throw new Error("memory_supersedes_target_invalid");
+                }
+                // Compact on the write path rather than on a timer: a scope only grows
+                // when something is put into it, so this is the one moment reclaiming
+                // is worth doing, and a local store is small enough that the cost is a
+                // few deletes against an indexed column.
+                const compacted = this.store.compactMemories(memory.scope, this.retention);
+                return {
+                    stored: true,
+                    id: memory.id,
+                    scope: memory.scope,
+                    key: memory.key,
+                    tags: memory.tags,
+                    speaker: memory.speaker ?? null,
+                    episodeId: memory.episodeId ?? null,
+                    sequence: memory.sequence ?? null,
+                    expiresAt: memory.expiresAt ?? null,
+                    supersedesId: memory.supersedesId ?? null,
+                    redactions: [
+                        ...new Set([
+                            ...redacted.redactions,
+                            ...(redactedSpeaker?.redactions ?? []),
+                            ...(redactedEpisodeId?.redactions ?? []),
+                        ]),
+                    ],
+                    compacted,
+                };
+            }
+            case "search": {
+                if (operation.query === undefined) {
+                    throw new Error("memory_search_requires_query");
+                }
+                const candidates = this.store.memoryCandidates(operation.scope, MAX_CANDIDATES, operation.includeSuperseded);
+                return {
+                    memories: rankMemories(candidates, operation.query, operation.limit),
+                    candidateCount: candidates.length,
+                    ranking: "melra-hybrid-v2",
+                };
+            }
+            case "list":
+                return {
+                    memories: this.store.listMemories(operation.scope, operation.limit, operation.includeSuperseded),
+                };
+            case "delete": {
+                if (operation.id === undefined) {
+                    throw new Error("memory_delete_requires_id");
+                }
+                return {
+                    deleted: this.store.deleteMemory(operation.id, operation.scope),
+                    id: operation.id,
+                    scope: operation.scope,
+                };
+            }
+            case "clear":
+                return {
+                    cleared: this.store.clearMemories(operation.scope),
+                    scope: operation.scope,
+                };
+        }
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,2CAA2C;AAC3C,sCAAsC;AAEtC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAOzC,MAAM,eAAe,GAA4B;IAC/C,CAAC,wCAAwC,EAAE,oBAAoB,CAAC;IAChE,CAAC,qCAAqC,EAAE,yBAAyB,CAAC;IAClE,CAAC,2CAA2C,EAAE,eAAe,CAAC;IAC9D,CAAC,iCAAiC,EAAE,yBAAyB,CAAC;CAC/D,CAAC;AAgBF,MAAM,CAAC,MAAM,wBAAwB,GAAoB;IACvD,UAAU,EAAE,EAAE;IACd,WAAW,EAAE,CAAC;CACf,CAAC;AAGF,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAI7C,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,IAAI,eAAe,EAAE,CAAC;QACrD,MAAM,MAAM,GAAG,QAAQ,CAAC;QACxB,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAeD,MAAM,MAAM,GAAG,UAAU,CAAC;AAC1B,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAClC,MAAM,cAAc,GAAG,KAAK,CAAC;AAC7B,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,aAAa,GAAG,GAAG,CAAC;AAC1B,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,OAAO,KAAK,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC;AAClE,CAAC;AAED,SAAS,aAAa,CAAC,MAAgB,EAAE,IAAY;IACnD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,OAAO,CAAC,IAAiB,EAAE,KAAkB;IACpD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,YAAY,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,SAAS,CAAC,SAAiB,EAAE,KAAa;IACjD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC;IACpE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,sBAAsB,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAuB,EACvB,KAAa,EACb,KAAa,EACb,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE;IAElB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACzC,MAAM;QACN,MAAM,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;KAC3E,CAAC,CAAC,CAAC;IACJ,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,iBAAiB,CAAC,GAAG,CACnB,KAAK,EACL,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CACxC,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,aAAa,GACjB,SAAS,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,iBAAiB,EAAE,CAAC;IACzD,MAAM,MAAM,GAAG,SAAS;SACrB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE;QAC1B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAClB,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAC/D,CAAC;YACF,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC9C,MAAM,WAAW,GACf,SAAS;gBACT,GAAG;oBACD,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;YACrE,OAAO;gBACL,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,iBAAiB,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE;aAC3C,iBAAiB,EAAE;aACnB,QAAQ,CAAC,eAAe,CAAC;YAC1B,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,CAAC,CAAC;QACN,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACjD,MAAM,IAAI,GACR,iBAAiB,GAAG,IAAI;YACxB,MAAM,GAAG,IAAI;YACb,MAAM,CAAC,UAAU,GAAG,IAAI;YACxB,KAAK,GAAG,IAAI,CAAC;QACf,OAAO;YACL,MAAM;YACN,QAAQ,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC;YACzB,IAAI;YACJ,iBAAiB;YACjB,MAAM;YACN,KAAK;SACN,CAAC;IACJ,CAAC,CAAC;SACD,MAAM,CACL,CAAC,SAAS,EAAE,EAAE,CACZ,SAAS,CAAC,iBAAiB,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAC1D;SACA,IAAI,CACH,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;QACtB,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAC9D,CAAC;IAEJ,MAAM,QAAQ,GAGT,EAAE,CAAC;IACR,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC3C,SAAS;QACT,aAAa,EAAE,CAAC;KACjB,CAAC,CAAC,CAAC;IACJ,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC3C,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;QAChE,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAC5C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAE,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;YAClC,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,CAAC;YACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC;YACxD,IACE,QAAQ,GAAG,YAAY;gBACvB,CAAC,QAAQ,KAAK,YAAY;oBACxB,SAAS,CAAC,MAAM,CAAC,SAAS;wBACxB,SAAS,CAAC,SAAS,CAAE,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,EACrD,CAAC;gBACD,SAAS,GAAG,KAAK,CAAC;gBAClB,YAAY,GAAG,QAAQ,CAAC;gBACxB,WAAW,GAAG,OAAO,CAAC;YACxB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;QAClC,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS;YACT,MAAM,EAAE;gBACN,GAAG,SAAS,CAAC,MAAM;gBACnB,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACtC,cAAc,EAAE;oBACd,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,EAAE,SAAS,CAAC,MAAM;oBACxB,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,UAAU;oBACvC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAC7C,OAAO,EAAE,CAAC;oBACV,OAAO,EAAE,CAAC;oBACV,gBAAgB,EAAE,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBACjD;aACF;SACF,CAAC,CAAC;QACH,KAAK,MAAM,cAAc,IAAI,SAAS,EAAE,CAAC;YACvC,cAAc,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CACrC,cAAc,CAAC,aAAa,EAC5B,OAAO,CAAC,cAAc,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,CAC/D,CAAC;QACJ,CAAC;IACH,CAAC;IACD,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,SAAS,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,EACnD,KAAK,IAAI,CAAC,EACV,CAAC;QACD,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAE,CAAC,SAAS,CAAC;QAC9C,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS;YACT,MAAM,EAAE;gBACN,GAAG,SAAS,CAAC,MAAM;gBACnB,KAAK,EAAE,MAAM,CAAC,CAAC,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACjD,cAAc,EAAE;oBACd,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,EAAE,SAAS,CAAC,MAAM;oBACxB,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,UAAU;oBACvC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAC7C,OAAO,EAAE,CAAC;oBACV,OAAO,EAAE,CAAC;oBACV,gBAAgB,EAAE,CAAC;iBACpB;aACF;SACF,CAAC,CAAC;IACL,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,CACxB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAClD,CAAC;IACF,MAAM,eAAe,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC1D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,SAAS,SAAS,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC/C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IACD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,CAAC;QACpE,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpE,SAAS;QACX,CAAC;QACD,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,aAAa,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;YAChE,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,SAAS,SAC7B,MAAM,CAAC,QAAQ,GAAG,SAAS,GAAG,QAChC,EAAE,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;oBACtD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,GAAG,aAAa,IAAI,QAAQ,CAAC;oBACzD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC7C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;wBAC3B,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE;4BAC1B,GAAG,QAAQ;4BACX,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;4BACjC,cAAc,EAAE;gCACd,OAAO,EAAE,CAAC;gCACV,MAAM,EAAE,CAAC;gCACT,UAAU,EAAE,QAAQ,CAAC,UAAU;gCAC/B,SAAS,EAAE,MAAM,CACf,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAChD;gCACD,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gCACnC,OAAO,EAAE,CAAC;gCACV,gBAAgB,EAAE,CAAC;6BACpB;yBACF,CAAC,CAAC;oBACL,CAAC;yBAAM,IAAI,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;wBACrD,QAAQ,CAAC,KAAK,GAAG,MAAM,CACrB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAC7C,CAAC;wBACF,QAAQ,CAAC,cAAc,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,IACE,MAAM,CAAC,OAAO,KAAK,SAAS;YAC5B,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAClE,CAAC;YACD,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,cAAc,CAAC,OAAO,GAAG,aAAa,CAAC;QAChD,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;SAC5B,IAAI,CACH,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;QACxB,KAAK,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAChD;SACA,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,OAAO,WAAW;IAEH;IACA;IAFnB,YACmB,KAAkB,EAClB,YAA6B,wBAAwB;QADrD,UAAK,GAAL,KAAK,CAAa;QAClB,cAAS,GAAT,SAAS,CAA4C;IACrE,CAAC;IAEJ,OAAO,CAAC,SAA0B;QAChC,QAAQ,SAAS,CAAC,MAAM,EAAE,CAAC;YACzB,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,IAAI,SAAS,CAAC,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBACjE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;gBACvD,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACpD,MAAM,eAAe,GACnB,SAAS,CAAC,OAAO,KAAK,SAAS;oBAC7B,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,iBAAiB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAC3C,MAAM,iBAAiB,GACrB,SAAS,CAAC,SAAS,KAAK,SAAS;oBAC/B,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,iBAAiB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBAC7C,MAAM,QAAQ,GACZ,SAAS,CAAC,EAAE,KAAK,SAAS;oBACxB,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACzC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC;oBACjE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;gBAC3C,CAAC;gBACD,IAAI,QAAQ,EAAE,YAAY,KAAK,SAAS,EAAE,CAAC;oBACzC,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBACxD,CAAC;gBACD,MAAM,UAAU,GACd,SAAS,CAAC,YAAY,KAAK,SAAS;oBAClC,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;gBACnD,IACE,SAAS,CAAC,YAAY,KAAK,SAAS;oBACpC,CAAC,UAAU,KAAK,SAAS;wBACvB,UAAU,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK;wBACpC,SAAS,CAAC,YAAY,KAAK,SAAS,CAAC,EAAE,CAAC,EAC1C,CAAC;oBACD,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;gBACtD,CAAC;gBACD,MAAM,MAAM,GAAiB;oBAC3B,EAAE,EAAE,SAAS,CAAC,EAAE,IAAI,UAAU,EAAE;oBAChC,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,GAAG,EAAE,SAAS,CAAC,GAAG;oBAClB,KAAK,EAAE,QAAQ,CAAC,KAAK;oBACrB,MAAM,EAAE,SAAS,CAAC,MAAM,IAAI,YAAY;oBACxC,UAAU,EAAE,SAAS,CAAC,UAAU;oBAChC,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,GAAG,CAAC,eAAe,KAAK,SAAS;wBAC/B,CAAC,CAAC,EAAE;wBACJ,CAAC,CAAC,EAAE,OAAO,EAAE,eAAe,CAAC,KAAK,EAAE,CAAC;oBACvC,GAAG,CAAC,iBAAiB,KAAK,SAAS;wBACjC,CAAC,CAAC,EAAE;wBACJ,CAAC,CAAC,EAAE,SAAS,EAAE,iBAAiB,CAAC,KAAK,EAAE,CAAC;oBAC3C,GAAG,CAAC,SAAS,CAAC,QAAQ,KAAK,SAAS;wBAClC,CAAC,CAAC,EAAE;wBACJ,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,QAAQ,EAAE,CAAC;oBACrC,GAAG,CAAC,SAAS,CAAC,SAAS,KAAK,SAAS;wBACnC,CAAC,CAAC,EAAE;wBACJ,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC;oBACvC,GAAG,CAAC,SAAS,CAAC,YAAY,KAAK,SAAS;wBACtC,CAAC,CAAC,EAAE;wBACJ,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,YAAY,EAAE,CAAC;oBAC7C,SAAS,EAAE,QAAQ,EAAE,SAAS,IAAI,GAAG;oBACrC,SAAS,EAAE,GAAG;iBACf,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7B,IACE,SAAS,CAAC,YAAY,KAAK,SAAS;oBACpC,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CACzB,SAAS,CAAC,YAAY,EACtB,SAAS,CAAC,KAAK,EACf,MAAM,CAAC,EAAE,CACV,EACD,CAAC;oBACD,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;oBACjD,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;gBACtD,CAAC;gBACD,uEAAuE;gBACvE,sEAAsE;gBACtE,uEAAuE;gBACvE,yCAAyC;gBACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAC1C,MAAM,CAAC,KAAK,EACZ,IAAI,CAAC,SAAS,CACf,CAAC;gBACF,OAAO;oBACL,MAAM,EAAE,IAAI;oBACZ,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,KAAK,EAAE,MAAM,CAAC,KAAK;oBACnB,GAAG,EAAE,MAAM,CAAC,GAAG;oBACf,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,IAAI;oBAC/B,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;oBACnC,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI;oBACjC,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;oBACnC,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,IAAI;oBACzC,UAAU,EAAE;wBACV,GAAG,IAAI,GAAG,CAAC;4BACT,GAAG,QAAQ,CAAC,UAAU;4BACtB,GAAG,CAAC,eAAe,EAAE,UAAU,IAAI,EAAE,CAAC;4BACtC,GAAG,CAAC,iBAAiB,EAAE,UAAU,IAAI,EAAE,CAAC;yBACzC,CAAC;qBACH;oBACD,SAAS;iBACV,CAAC;YACJ,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBAClC,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;gBAClD,CAAC;gBACD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAC5C,SAAS,CAAC,KAAK,EACf,cAAc,EACd,SAAS,CAAC,iBAAiB,CAC5B,CAAC;gBACF,OAAO;oBACL,QAAQ,EAAE,YAAY,CACpB,UAAU,EACV,SAAS,CAAC,KAAK,EACf,SAAS,CAAC,KAAK,CAChB;oBACD,cAAc,EAAE,UAAU,CAAC,MAAM;oBACjC,OAAO,EAAE,iBAAiB;iBAC3B,CAAC;YACJ,CAAC;YACD,KAAK,MAAM;gBACT,OAAO;oBACL,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAC/B,SAAS,CAAC,KAAK,EACf,SAAS,CAAC,KAAK,EACf,SAAS,CAAC,iBAAiB,CAC5B;iBACF,CAAC;YACJ,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,SAAS,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC/B,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBAC/C,CAAC;gBACD,OAAO;oBACL,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,KAAK,CAAC;oBAC/D,EAAE,EAAE,SAAS,CAAC,EAAE;oBAChB,KAAK,EAAE,SAAS,CAAC,KAAK;iBACvB,CAAC;YACJ,CAAC;YACD,KAAK,OAAO;gBACV,OAAO;oBACL,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC;oBAClD,KAAK,EAAE,SAAS,CAAC,KAAK;iBACvB,CAAC;QACN,CAAC;IACH,CAAC;CACF"}

package/dist/index.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=index.test.d.ts.map

package/dist/index.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.d.ts","sourceRoot":"","sources":["../src/index.test.ts"],"names":[],"mappings":""}

package/dist/index.test.js

@@ -0,0 +1,322 @@
+// Copyright 2026 XAGI Labs Private Limited
+// SPDX-License-Identifier: Apache-2.0
+import { afterEach, describe, expect, it } from "vitest";
+import { MemoryOperationSchema } from "@melra/protocol";
+import { SqliteStore } from "@melra/storage-sqlite";
+import { LocalMemory, rankMemories, redactMemoryValue, } from "./index.js";
+let store;
+afterEach(() => {
+    store?.close();
+    store = undefined;
+});
+describe("LocalMemory", () => {
+    it("redacts common secret formats before persistence", () => {
+        const fakeGithubToken = ["ghp", "123456789012345678901234"].join("_");
+        const result = redactMemoryValue(`token ${fakeGithubToken} and password=hunter2`);
+        expect(result.value).not.toContain("hunter2");
+        expect(result.value).not.toContain("ghp_123");
+        expect(result.redactions.length).toBeGreaterThan(0);
+    });
+    it("redacts speaker and episode metadata before persistence", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store);
+        const fakeGithubToken = ["ghp", "123456789012345678901234"].join("_");
+        const result = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            id: "00000000-0000-4000-8000-000000000041",
+            scope: "workspace",
+            key: "turn",
+            value: "Safe value",
+            speaker: "Alex password=hunter2",
+            episodeId: fakeGithubToken,
+            sequence: 1,
+        }));
+        const persisted = store.getMemory("00000000-0000-4000-8000-000000000041");
+        expect(persisted?.speaker).not.toContain("hunter2");
+        expect(persisted?.episodeId).not.toContain("ghp_123");
+        expect(result.redactions.length).toBeGreaterThanOrEqual(2);
+    });
+    it("keeps memory isolated by scope", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store);
+        memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "product",
+            value: "MELRA",
+        }));
+        const workspace = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "search",
+            scope: "workspace",
+            query: "melra",
+        }));
+        const user = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "search",
+            scope: "user",
+            query: "melra",
+        }));
+        expect(workspace.memories).toHaveLength(1);
+        expect(user.memories).toHaveLength(0);
+    });
+    it("uses persisted episode and speaker metadata during search", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store);
+        memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            id: "00000000-0000-4000-8000-000000000031",
+            scope: "workspace",
+            key: "prompt",
+            value: "What topic did you research?",
+            speaker: "Jordan",
+            episodeId: "conversation-a",
+            sequence: 10,
+        }));
+        memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            id: "00000000-0000-4000-8000-000000000032",
+            scope: "workspace",
+            key: "answer",
+            value: "Adoption agencies.",
+            speaker: "Alex",
+            episodeId: "conversation-a",
+            sequence: 11,
+        }));
+        const result = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "search",
+            scope: "workspace",
+            query: "What did Alex research?",
+        }));
+        expect(result.memories.map((entry) => entry.id)).toContain("00000000-0000-4000-8000-000000000032");
+        expect(result.memories.find((entry) => entry.id === "00000000-0000-4000-8000-000000000032")?.scoreBreakdown.speaker).toBeGreaterThan(0);
+    });
+    it("ranks rare exact evidence ahead of generic duplicates", () => {
+        const now = "2026-07-28T00:00:00.000Z";
+        const ranked = rankMemories([
+            {
+                id: "00000000-0000-4000-8000-000000000001",
+                scope: "workspace",
+                key: "release",
+                value: "The launch codename is aurora.",
+                source: "test",
+                confidence: 0.95,
+                tags: ["launch"],
+                createdAt: now,
+                updatedAt: now,
+            },
+            {
+                id: "00000000-0000-4000-8000-000000000002",
+                scope: "workspace",
+                key: "generic",
+                value: "The release process has a launch checklist.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                createdAt: now,
+                updatedAt: now,
+            },
+            {
+                id: "00000000-0000-4000-8000-000000000003",
+                scope: "workspace",
+                key: "duplicate",
+                value: "The release process has a launch checklist.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                createdAt: now,
+                updatedAt: now,
+            },
+        ], "launch codename aurora", 3, Date.parse(now));
+        expect(ranked[0]?.id).toBe("00000000-0000-4000-8000-000000000001");
+        expect(ranked[0]?.scoreBreakdown.lexical).toBeGreaterThan(0);
+        expect(ranked[2]?.scoreBreakdown.diversityPenalty).toBeGreaterThan(0);
+    });
+    it("propagates relevance only to adjacent records in the same episode", () => {
+        const now = "2026-07-28T00:00:00.000Z";
+        const ranked = rankMemories([
+            {
+                id: "00000000-0000-4000-8000-000000000011",
+                scope: "workspace",
+                key: "prompt",
+                value: "What topic did you research?",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                episodeId: "conversation-a",
+                sequence: 10,
+                createdAt: now,
+                updatedAt: now,
+            },
+            {
+                id: "00000000-0000-4000-8000-000000000012",
+                scope: "workspace",
+                key: "answer",
+                value: "Adoption agencies.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                episodeId: "conversation-a",
+                sequence: 11,
+                createdAt: now,
+                updatedAt: now,
+            },
+            {
+                id: "00000000-0000-4000-8000-000000000013",
+                scope: "workspace",
+                key: "unrelated",
+                value: "Private banking.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                episodeId: "conversation-b",
+                sequence: 11,
+                createdAt: now,
+                updatedAt: now,
+            },
+        ], "What did Alex research?", 3, Date.parse(now));
+        expect(ranked.map((memory) => memory.id)).toContain("00000000-0000-4000-8000-000000000012");
+        expect(ranked.map((memory) => memory.id)).not.toContain("00000000-0000-4000-8000-000000000013");
+    });
+    it("boosts a record spoken by the entity named in the query", () => {
+        const now = "2026-07-28T00:00:00.000Z";
+        const ranked = rankMemories([
+            {
+                id: "00000000-0000-4000-8000-000000000021",
+                scope: "workspace",
+                key: "turn-one",
+                value: "I enjoy hiking and painting.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                speaker: "Jordan",
+                createdAt: now,
+                updatedAt: now,
+            },
+            {
+                id: "00000000-0000-4000-8000-000000000022",
+                scope: "workspace",
+                key: "turn-two",
+                value: "I enjoy hiking and painting.",
+                source: "test",
+                confidence: 1,
+                tags: [],
+                speaker: "Alex",
+                createdAt: now,
+                updatedAt: now,
+            },
+        ], "What does Alex enjoy?", 2, Date.parse(now));
+        expect(ranked[0]?.id).toBe("00000000-0000-4000-8000-000000000022");
+    });
+    it("supports expiry and scoped supersession", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store);
+        const first = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "runtime",
+            value: "Use version one",
+        }));
+        memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "runtime",
+            value: "Use version two",
+            supersedesId: first.id,
+        }));
+        memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "expired",
+            value: "Do not retrieve this",
+            expiresAt: "2020-01-01T00:00:00.000Z",
+        }));
+        const current = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "search",
+            scope: "workspace",
+            query: "runtime version",
+        }));
+        expect(current.memories).toHaveLength(1);
+        expect(JSON.stringify(current)).toContain("version two");
+        expect(JSON.stringify(current)).not.toContain("version one");
+        expect(JSON.stringify(current)).not.toContain("Do not retrieve");
+        expect(() => memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            id: first.id,
+            key: "runtime",
+            value: "Try to revive version one",
+        }))).toThrow("memory_superseded_record_immutable");
+    });
+    it("cannot delete or overwrite a record through a different scope", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store);
+        const inserted = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "isolated",
+            value: "workspace only",
+        }));
+        const wrongScopeDelete = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "delete",
+            scope: "user",
+            id: inserted.id,
+        }));
+        expect(wrongScopeDelete.deleted).toBe(false);
+        expect(store.getMemory(inserted.id)?.value).toBe("workspace only");
+        expect(() => memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "user",
+            id: inserted.id,
+            key: "isolated",
+            value: "cross-scope overwrite",
+        }))).toThrow("memory_scope_mismatch");
+    });
+    it("reclaims unreachable records on the next write", () => {
+        store = new SqliteStore(":memory:");
+        const memory = new LocalMemory(store, { maxAgeDays: 0, maxPerScope: 0 });
+        store.putMemory({
+            id: "00000000-0000-4000-8000-0000000000e1",
+            scope: "workspace",
+            key: "stale",
+            value: "already expired",
+            source: "test",
+            confidence: 0.5,
+            tags: [],
+            expiresAt: "2000-01-01T00:00:00.000Z",
+            createdAt: "2000-01-01T00:00:00.000Z",
+            updatedAt: "2000-01-01T00:00:00.000Z",
+        });
+        // Nothing reads it, but until a write happens nothing removes it either.
+        expect(store.listMemories("workspace", 10)).toHaveLength(0);
+        expect(store.getMemory("00000000-0000-4000-8000-0000000000e1")).toBeDefined();
+        const result = memory.execute(MemoryOperationSchema.parse({
+            kind: "memory",
+            action: "put",
+            scope: "workspace",
+            key: "fresh",
+            value: "still here",
+        }));
+        expect(result.compacted).toEqual({
+            expired: 1,
+            superseded: 0,
+            evicted: 0,
+        });
+        expect(store.getMemory("00000000-0000-4000-8000-0000000000e1")).toBeUndefined();
+        expect(store.listMemories("workspace", 10)).toHaveLength(1);
+    });
+});
+//# sourceMappingURL=index.test.js.map

package/dist/index.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.test.js","sourceRoot":"","sources":["../src/index.test.ts"],"names":[],"mappings":"AAAA,2CAA2C;AAC3C,sCAAsC;AAEtC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EACL,WAAW,EACX,YAAY,EACZ,iBAAiB,GAElB,MAAM,YAAY,CAAC;AAEpB,IAAI,KAA8B,CAAC;AAEnC,SAAS,CAAC,GAAG,EAAE;IACb,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,KAAK,GAAG,SAAS,CAAC;AACpB,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,MAAM,GAAG,iBAAiB,CAC9B,SAAS,eAAe,uBAAuB,CAChD,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAC3B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,EAAE,EAAE,sCAAsC;YAC1C,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,MAAM;YACX,KAAK,EAAE,YAAY;YACnB,OAAO,EAAE,uBAAuB;YAChC,SAAS,EAAE,eAAe;YAC1B,QAAQ,EAAE,CAAC;SACZ,CAAC,CACyB,CAAC;QAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAC/B,sCAAsC,CACvC,CAAC;QAEF,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,OAAO;SACf,CAAC,CACH,CAAC;QACF,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAC9B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,WAAW;YAClB,KAAK,EAAE,OAAO;SACf,CAAC,CACwB,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CACzB,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,MAAM;YACb,KAAK,EAAE,OAAO;SACf,CAAC,CACwB,CAAC;QAC7B,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,EAAE,EAAE,sCAAsC;YAC1C,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,QAAQ;YACb,KAAK,EAAE,8BAA8B;YACrC,OAAO,EAAE,QAAQ;YACjB,SAAS,EAAE,gBAAgB;YAC3B,QAAQ,EAAE,EAAE;SACb,CAAC,CACH,CAAC;QACF,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,EAAE,EAAE,sCAAsC;YAC1C,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,QAAQ;YACb,KAAK,EAAE,oBAAoB;YAC3B,OAAO,EAAE,MAAM;YACf,SAAS,EAAE,gBAAgB;YAC3B,QAAQ,EAAE,EAAE;SACb,CAAC,CACH,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAC3B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,WAAW;YAClB,KAAK,EAAE,yBAAyB;SACjC,CAAC,CAC6B,CAAC;QAElC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CACxD,sCAAsC,CACvC,CAAC;QACF,MAAM,CACJ,MAAM,CAAC,QAAQ,CAAC,IAAI,CAClB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,sCAAsC,CAC/D,EAAE,cAAc,CAAC,OAAO,CAC1B,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,0BAA0B,CAAC;QACvC,MAAM,MAAM,GAAG,YAAY,CACzB;YACE;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,SAAS;gBACd,KAAK,EAAE,gCAAgC;gBACvC,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,IAAI;gBAChB,IAAI,EAAE,CAAC,QAAQ,CAAC;gBAChB,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;YACD;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,SAAS;gBACd,KAAK,EAAE,6CAA6C;gBACpD,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;YACD;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,WAAW;gBAChB,KAAK,EAAE,6CAA6C;gBACpD,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;SACF,EACD,wBAAwB,EACxB,CAAC,EACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAChB,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;QACnE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,gBAAgB,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,GAAG,GAAG,0BAA0B,CAAC;QACvC,MAAM,MAAM,GAAG,YAAY,CACzB;YACE;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,QAAQ;gBACb,KAAK,EAAE,8BAA8B;gBACrC,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,gBAAgB;gBAC3B,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;YACD;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,QAAQ;gBACb,KAAK,EAAE,oBAAoB;gBAC3B,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,gBAAgB;gBAC3B,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;YACD;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,WAAW;gBAChB,KAAK,EAAE,kBAAkB;gBACzB,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,gBAAgB;gBAC3B,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;SACF,EACD,yBAAyB,EACzB,CAAC,EACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAChB,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CACjD,sCAAsC,CACvC,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CACrD,sCAAsC,CACvC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,GAAG,GAAG,0BAA0B,CAAC;QACvC,MAAM,MAAM,GAAG,YAAY,CACzB;YACE;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,UAAU;gBACf,KAAK,EAAE,8BAA8B;gBACrC,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,OAAO,EAAE,QAAQ;gBACjB,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;YACD;gBACE,EAAE,EAAE,sCAAsC;gBAC1C,KAAK,EAAE,WAAW;gBAClB,GAAG,EAAE,UAAU;gBACf,KAAK,EAAE,8BAA8B;gBACrC,MAAM,EAAE,MAAM;gBACd,UAAU,EAAE,CAAC;gBACb,IAAI,EAAE,EAAE;gBACR,OAAO,EAAE,MAAM;gBACf,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf;SACF,EACD,uBAAuB,EACvB,CAAC,EACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAChB,CAAC;QAEF,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAC1B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,iBAAiB;SACzB,CAAC,CACe,CAAC;QACpB,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,iBAAiB;YACxB,YAAY,EAAE,KAAK,CAAC,EAAE;SACvB,CAAC,CACH,CAAC;QACF,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,sBAAsB;YAC7B,SAAS,EAAE,0BAA0B;SACtC,CAAC,CACH,CAAC;QACF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAC5B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,WAAW;YAClB,KAAK,EAAE,iBAAiB;SACzB,CAAC,CACwB,CAAC;QAC7B,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QAC7D,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,EAAE,CACV,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,2BAA2B;SACnC,CAAC,CACH,CACF,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAC7B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,UAAU;YACf,KAAK,EAAE,gBAAgB;SACxB,CAAC,CACe,CAAC;QACpB,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CACrC,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,QAAQ;YAChB,KAAK,EAAE,MAAM;YACb,EAAE,EAAE,QAAQ,CAAC,EAAE;SAChB,CAAC,CACH,CAAC;QACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACnE,MAAM,CAAC,GAAG,EAAE,CACV,MAAM,CAAC,OAAO,CACZ,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,MAAM;YACb,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,GAAG,EAAE,UAAU;YACf,KAAK,EAAE,uBAAuB;SAC/B,CAAC,CACH,CACF,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,KAAK,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACzE,KAAK,CAAC,SAAS,CAAC;YACd,EAAE,EAAE,sCAAsC;YAC1C,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,OAAO;YACZ,KAAK,EAAE,iBAAiB;YACxB,MAAM,EAAE,MAAM;YACd,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,EAAE;YACR,SAAS,EAAE,0BAA0B;YACrC,SAAS,EAAE,0BAA0B;YACrC,SAAS,EAAE,0BAA0B;SACtC,CAAC,CAAC;QACH,yEAAyE;QACzE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CACJ,KAAK,CAAC,SAAS,CAAC,sCAAsC,CAAC,CACxD,CAAC,WAAW,EAAE,CAAC;QAEhB,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAC3B,qBAAqB,CAAC,KAAK,CAAC;YAC1B,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,WAAW;YAClB,GAAG,EAAE,OAAO;YACZ,KAAK,EAAE,YAAY;SACpB,CAAC,CACH,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC;YAC/B,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;SACX,CAAC,CAAC;QACH,MAAM,CACJ,KAAK,CAAC,SAAS,CAAC,sCAAsC,CAAC,CACxD,CAAC,aAAa,EAAE,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/package.json

@@ -0,0 +1,33 @@
+{
+  "name": "@melra/memory",
+  "version": "0.3.0-alpha.10",
+  "description": "Scoped and redacted operational memory for the MELRA kernel.",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/XAGI-Lab/melra.git",
+    "directory": "packages/memory"
+  },
+  "homepage": "https://github.com/XAGI-Lab/melra#readme",
+  "bugs": "https://github.com/XAGI-Lab/melra/issues",
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "@melra/protocol": "0.3.0-alpha.10",
+    "@melra/storage-sqlite": "0.3.0-alpha.10"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "clean": "rm -rf dist",
+    "test": "vitest run",
+    "typecheck": "tsc -p tsconfig.json --noEmit"
+  }
+}