@batalabs/virlow-memory 3.11.4

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Typelets Secure Notes
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,20 @@
+# @batalabs/virlow-memory
+
+Embedding and similarity primitives behind [Virlow](https://virlow.com)
+memories: a pinned local embedding model, cosine ranking, and the two-tier
+dedupe thresholds.
+
+The embedder is a separate entry point so consumers that only need vector maths
+do not pull in `@huggingface/transformers`:
+
+```ts
+import { cosineSimilarity, findSimilar, DEDUPE_UPDATE_THRESHOLD } from '@batalabs/virlow-memory';
+import { createEmbedder } from '@batalabs/virlow-memory/embedder';
+```
+
+Dedupe is two-tier by design: at or above `DEDUPE_UPDATE_THRESHOLD` (0.9) a
+memory is the same memory and is updated in place; between
+`DEDUPE_REPORT_THRESHOLD` (0.7) and that, it is stored and the caller is told
+what it resembles.
+
+Published from [batalabs/virlow-app](https://github.com/batalabs/virlow-app).

package/dist/constants.d.ts

@@ -0,0 +1,16 @@
+/** Pinned embedding model. Changing ANY of these invalidates stored embeddings;
+ * bump EMBEDDING_MODEL_TAG so clients lazily re-embed (spec: embeddingModel column). */
+export declare const EMBEDDING_MODEL_ID = "Xenova/all-MiniLM-L6-v2";
+/** Pinned HF repo revision. The model repo can re-upload weights under the
+ * same id; without this pin, embeddings would drift while EMBEDDING_MODEL_TAG
+ * stays unchanged. Bump BOTH this and EMBEDDING_MODEL_TAG together. */
+export declare const EMBEDDING_MODEL_REVISION = "751bff37182d3f1213fa05d7196b954e230abad9";
+export declare const EMBEDDING_MODEL_TAG = "minilm-l6-v2@q8";
+export declare const EMBEDDING_DIM = 384;
+/** add_memory treats similarity >= this as "same memory, update it in place". */
+export declare const DEDUPE_UPDATE_THRESHOLD = 0.9;
+/** Similarity in [DEDUPE_REPORT_THRESHOLD, DEDUPE_UPDATE_THRESHOLD) is close
+ * enough to be worth telling the agent about, but not close enough to merge:
+ * add_memory stores the new memory and reports these alongside it. */
+export declare const DEDUPE_REPORT_THRESHOLD = 0.7;
+//# sourceMappingURL=constants.d.ts.map

package/dist/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;wFACwF;AACxF,eAAO,MAAM,kBAAkB,4BAA4B,CAAC;AAC5D;;uEAEuE;AACvE,eAAO,MAAM,wBAAwB,6CAA6C,CAAC;AACnF,eAAO,MAAM,mBAAmB,oBAAoB,CAAC;AACrD,eAAO,MAAM,aAAa,MAAM,CAAC;AAEjC,iFAAiF;AACjF,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAC3C;;sEAEsE;AACtE,eAAO,MAAM,uBAAuB,MAAM,CAAC"}

package/dist/constants.js

@@ -0,0 +1,16 @@
+/** Pinned embedding model. Changing ANY of these invalidates stored embeddings;
+ * bump EMBEDDING_MODEL_TAG so clients lazily re-embed (spec: embeddingModel column). */
+export const EMBEDDING_MODEL_ID = 'Xenova/all-MiniLM-L6-v2';
+/** Pinned HF repo revision. The model repo can re-upload weights under the
+ * same id; without this pin, embeddings would drift while EMBEDDING_MODEL_TAG
+ * stays unchanged. Bump BOTH this and EMBEDDING_MODEL_TAG together. */
+export const EMBEDDING_MODEL_REVISION = '751bff37182d3f1213fa05d7196b954e230abad9';
+export const EMBEDDING_MODEL_TAG = 'minilm-l6-v2@q8';
+export const EMBEDDING_DIM = 384;
+/** add_memory treats similarity >= this as "same memory, update it in place". */
+export const DEDUPE_UPDATE_THRESHOLD = 0.9;
+/** Similarity in [DEDUPE_REPORT_THRESHOLD, DEDUPE_UPDATE_THRESHOLD) is close
+ * enough to be worth telling the agent about, but not close enough to merge:
+ * add_memory stores the new memory and reports these alongside it. */
+export const DEDUPE_REPORT_THRESHOLD = 0.7;
+//# sourceMappingURL=constants.js.map

package/dist/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;wFACwF;AACxF,MAAM,CAAC,MAAM,kBAAkB,GAAG,yBAAyB,CAAC;AAC5D;;uEAEuE;AACvE,MAAM,CAAC,MAAM,wBAAwB,GAAG,0CAA0C,CAAC;AACnF,MAAM,CAAC,MAAM,mBAAmB,GAAG,iBAAiB,CAAC;AACrD,MAAM,CAAC,MAAM,aAAa,GAAG,GAAG,CAAC;AAEjC,iFAAiF;AACjF,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAC3C;;sEAEsE;AACtE,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC"}

package/dist/embedder.d.ts

@@ -0,0 +1,20 @@
+export interface Embedder {
+    embed(text: string): Promise<Float32Array>;
+}
+/**
+ * Load the pinned embedding model. In Node, `cacheDir` controls where the
+ * public ONNX weights are cached (the MCP server passes ~/.virlow-mcp/models);
+ * in the browser, transformers.js uses the Cache API automatically.
+ *
+ * `localModelPath` self-hosts the model instead of fetching it from the
+ * Hugging Face Hub — the web app's production CSP doesn't allow
+ * huggingface.co, and self-hosting is better privacy anyway. Set it to the
+ * public URL prefix (e.g. `/models/`) that serves the files fetched by
+ * `scripts/fetch-embedding-model.mjs`; transformers.js then resolves
+ * `<localModelPath><EMBEDDING_MODEL_ID>/...` instead of hitting the Hub.
+ */
+export declare function createEmbedder(opts?: {
+    cacheDir?: string;
+    localModelPath?: string;
+}): Promise<Embedder>;
+//# sourceMappingURL=embedder.d.ts.map

package/dist/embedder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedder.d.ts","sourceRoot":"","sources":["../src/embedder.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,QAAQ;IACvB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CAC5C;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,cAAc,CAClC,IAAI,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAO,GACxD,OAAO,CAAC,QAAQ,CAAC,CAkBnB"}

package/dist/embedder.js

@@ -0,0 +1,34 @@
+import { env, pipeline } from '@huggingface/transformers';
+import { EMBEDDING_MODEL_ID, EMBEDDING_MODEL_REVISION } from './constants';
+/**
+ * Load the pinned embedding model. In Node, `cacheDir` controls where the
+ * public ONNX weights are cached (the MCP server passes ~/.virlow-mcp/models);
+ * in the browser, transformers.js uses the Cache API automatically.
+ *
+ * `localModelPath` self-hosts the model instead of fetching it from the
+ * Hugging Face Hub — the web app's production CSP doesn't allow
+ * huggingface.co, and self-hosting is better privacy anyway. Set it to the
+ * public URL prefix (e.g. `/models/`) that serves the files fetched by
+ * `scripts/fetch-embedding-model.mjs`; transformers.js then resolves
+ * `<localModelPath><EMBEDDING_MODEL_ID>/...` instead of hitting the Hub.
+ */
+export async function createEmbedder(opts = {}) {
+    if (opts.cacheDir) {
+        env.cacheDir = opts.cacheDir;
+    }
+    if (opts.localModelPath) {
+        env.allowRemoteModels = false;
+        env.localModelPath = opts.localModelPath;
+    }
+    const extractor = await pipeline('feature-extraction', EMBEDDING_MODEL_ID, {
+        dtype: 'q8',
+        revision: EMBEDDING_MODEL_REVISION,
+    });
+    return {
+        async embed(text) {
+            const output = await extractor(text, { pooling: 'mean', normalize: true });
+            return Float32Array.from(output.data);
+        },
+    };
+}
+//# sourceMappingURL=embedder.js.map

package/dist/embedder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedder.js","sourceRoot":"","sources":["../src/embedder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,kBAAkB,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AAM3E;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAuD,EAAE;IAEzD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC/B,CAAC;IACD,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,GAAG,CAAC,iBAAiB,GAAG,KAAK,CAAC;QAC9B,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;IAC3C,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,oBAAoB,EAAE,kBAAkB,EAAE;QACzE,KAAK,EAAE,IAAI;QACX,QAAQ,EAAE,wBAAwB;KACnC,CAAC,CAAC;IACH,OAAO;QACL,KAAK,CAAC,KAAK,CAAC,IAAY;YACtB,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC3E,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAoB,CAAC,CAAC;QACxD,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export { DEDUPE_REPORT_THRESHOLD, DEDUPE_UPDATE_THRESHOLD, EMBEDDING_DIM, EMBEDDING_MODEL_ID, EMBEDDING_MODEL_REVISION, EMBEDDING_MODEL_TAG, } from './constants';
+export { bytesToEmbedding, cosineSimilarity, embeddingToBytes, findDuplicate, findSimilar, rankBySimilarity, } from './vectors';
+export { createEmbedder, type Embedder } from './embedder';
+//# 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":"AAAA,OAAO,EACL,uBAAuB,EACvB,uBAAuB,EACvB,aAAa,EACb,kBAAkB,EAClB,wBAAwB,EACxB,mBAAmB,GACpB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,gBAAgB,GACjB,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,cAAc,EAAE,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,4 @@
+export { DEDUPE_REPORT_THRESHOLD, DEDUPE_UPDATE_THRESHOLD, EMBEDDING_DIM, EMBEDDING_MODEL_ID, EMBEDDING_MODEL_REVISION, EMBEDDING_MODEL_TAG, } from './constants';
+export { bytesToEmbedding, cosineSimilarity, embeddingToBytes, findDuplicate, findSimilar, rankBySimilarity, } from './vectors';
+export { createEmbedder } from './embedder';
+//# 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,OAAO,EACL,uBAAuB,EACvB,uBAAuB,EACvB,aAAa,EACb,kBAAkB,EAClB,wBAAwB,EACxB,mBAAmB,GACpB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,gBAAgB,GACjB,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,cAAc,EAAiB,MAAM,YAAY,CAAC"}

package/dist/vectors.d.ts

@@ -0,0 +1,35 @@
+export declare function cosineSimilarity(a: Float32Array, b: Float32Array): number;
+export declare function rankBySimilarity(query: Float32Array, entries: ReadonlyArray<{
+    id: string;
+    embedding: Float32Array;
+}>, limit: number): Array<{
+    id: string;
+    similarity: number;
+}>;
+export declare function findDuplicate(embedding: Float32Array, entries: ReadonlyArray<{
+    id: string;
+    embedding: Float32Array;
+}>, threshold?: number): {
+    id: string;
+    similarity: number;
+} | null;
+/**
+ * Every entry at or above `threshold`, most similar first. Unlike
+ * `rankBySimilarity` this takes no limit: add_memory reports the full set of
+ * near-misses so the agent can see everything it might be duplicating.
+ */
+export declare function findSimilar(embedding: Float32Array, entries: ReadonlyArray<{
+    id: string;
+    embedding: Float32Array;
+}>, threshold?: number): Array<{
+    id: string;
+    similarity: number;
+}>;
+/**
+ * Float32Array <-> bytes for encryption/transport. Byte order is the
+ * platform's native order — little-endian on every runtime Virlow targets
+ * (x86, ARM); embeddings are device-portable in practice.
+ */
+export declare function embeddingToBytes(vec: Float32Array): Uint8Array;
+export declare function bytesToEmbedding(bytes: Uint8Array): Float32Array;
+//# sourceMappingURL=vectors.d.ts.map

package/dist/vectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.d.ts","sourceRoot":"","sources":["../src/vectors.ts"],"names":[],"mappings":"AAKA,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAgBzE;AAED,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,YAAY,CAAA;CAAE,CAAC,EAC/D,KAAK,EAAE,MAAM,GACZ,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAK3C;AAED,wBAAgB,aAAa,CAC3B,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,YAAY,CAAA;CAAE,CAAC,EAC/D,SAAS,GAAE,MAAgC,GAC1C;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAG3C;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,SAAS,EAAE,YAAY,EACvB,OAAO,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,YAAY,CAAA;CAAE,CAAC,EAC/D,SAAS,GAAE,MAAgC,GAC1C,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAI3C;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,UAAU,CAI9D;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG,YAAY,CAShE"}

package/dist/vectors.js

@@ -0,0 +1,50 @@
+import { DEDUPE_REPORT_THRESHOLD, DEDUPE_UPDATE_THRESHOLD, } from './constants';
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error(`Embedding dimension mismatch: ${a.length} vs ${b.length}`);
+    }
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+export function rankBySimilarity(query, entries, limit) {
+    return entries
+        .map((e) => ({ id: e.id, similarity: cosineSimilarity(query, e.embedding) }))
+        .sort((x, y) => y.similarity - x.similarity)
+        .slice(0, limit);
+}
+export function findDuplicate(embedding, entries, threshold = DEDUPE_UPDATE_THRESHOLD) {
+    const [best] = rankBySimilarity(embedding, entries, 1);
+    return best && best.similarity >= threshold ? best : null;
+}
+/**
+ * Every entry at or above `threshold`, most similar first. Unlike
+ * `rankBySimilarity` this takes no limit: add_memory reports the full set of
+ * near-misses so the agent can see everything it might be duplicating.
+ */
+export function findSimilar(embedding, entries, threshold = DEDUPE_REPORT_THRESHOLD) {
+    return rankBySimilarity(embedding, entries, entries.length).filter((e) => e.similarity >= threshold);
+}
+/**
+ * Float32Array <-> bytes for encryption/transport. Byte order is the
+ * platform's native order — little-endian on every runtime Virlow targets
+ * (x86, ARM); embeddings are device-portable in practice.
+ */
+export function embeddingToBytes(vec) {
+    return new Uint8Array(vec.buffer.slice(vec.byteOffset, vec.byteOffset + vec.byteLength));
+}
+export function bytesToEmbedding(bytes) {
+    if (bytes.byteLength % 4 !== 0) {
+        throw new Error(`Embedding byte length ${bytes.byteLength} is not a multiple of 4`);
+    }
+    return new Float32Array(bytes.buffer.slice(bytes.byteOffset, bytes.byteOffset + bytes.byteLength));
+}
+//# sourceMappingURL=vectors.js.map

package/dist/vectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.js","sourceRoot":"","sources":["../src/vectors.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AAErB,MAAM,UAAU,gBAAgB,CAAC,CAAe,EAAE,CAAe;IAC/D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CACb,iCAAiC,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,MAAM,EAAE,CAC3D,CAAC;IACJ,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,KAAmB,EACnB,OAA+D,EAC/D,KAAa;IAEb,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;SAC5E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,SAAuB,EACvB,OAA+D,EAC/D,YAAoB,uBAAuB;IAE3C,MAAM,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACvD,OAAO,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,SAAuB,EACvB,OAA+D,EAC/D,YAAoB,uBAAuB;IAE3C,OAAO,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAChE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,SAAS,CACjC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAiB;IAChD,OAAO,IAAI,UAAU,CACnB,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC,CAClE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAiB;IAChD,IAAI,KAAK,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,yBAAyB,KAAK,CAAC,UAAU,yBAAyB,CACnE,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,YAAY,CACrB,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAC1E,CAAC;AACJ,CAAC"}

package/package.json

@@ -0,0 +1,47 @@
+{
+  "name": "@batalabs/virlow-memory",
+  "version": "3.11.4",
+  "type": "module",
+  "sideEffects": false,
+  "description": "Virlow Memories shared core: embeddings, similarity ranking, dedupe, and encrypted memory payloads.",
+  "license": "MIT",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    },
+    "./embedder": {
+      "types": "./dist/embedder.d.ts",
+      "import": "./dist/embedder.js"
+    }
+  },
+  "dependencies": {
+    "@huggingface/transformers": "^3.4.0",
+    "@batalabs/virlow-crypto": "3.11.4"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.0",
+    "typescript": "^5.8.0",
+    "vitest": "^3.0.0"
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "LICENSE",
+    "README.md",
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/batalabs/virlow-app.git",
+    "directory": "packages/memory-core"
+  },
+  "scripts": {
+    "test": "vitest run",
+    "type-check": "tsc --noEmit",
+    "build": "tsc -p tsconfig.build.json"
+  }
+}