purra-mem0 0.5.0 → 1.0.0

package/MEM0-LICENSE

@@ -0,0 +1,201 @@
+                                 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 [2023] [Taranjeet Singh]
+
+   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

@@ -11,11 +11,7 @@ Follow [source installation](../../README.md#source-installation), selecting
 `integrations/mem0/typescript`. Mem0's local store needs the `better-sqlite3`
 native installation scripts.
 
-For managed LLM/Embedding callbacks, install the optional peer in your application:
-
-```sh
-npm install @langchain/core@1.1.47
-```
+Managed callbacks use the native PurrA adapters included in this package; no LangChain installation is required.
 
 Before importing Mem0, set `MEM0_TELEMETRY=false` and an application-owned
 `MEM0_DIR`. Explicitly configure the LLM, embedder, `vectorStore.config.dbPath`,
@@ -142,3 +138,8 @@ to leave the candidate pending. The policy may be async.
 Before shutdown, call `await memory.drain()` and `memory.close()`, then close SDK
 and provider resources. For paging, withdrawal, evidence validation, and uncertain
 writes, see the [memory lifecycle guide](../README.md).
+
+
+## Native managed providers
+
+`createManagedClient` inject native LLM and Embedding adapters into a version-pinned, package-private Mem0 module. Calls retain the existing PurrA budget, cancellation and result validation. Explicit vector dimensions must agree; the managed path rejects LangChain vector stores. It neither patches the installed SDK nor starts a proxy server. See [third-party notices](THIRD_PARTY_NOTICES.md). Raw SDK clients remain host-owned and do not acquire managed accounting automatically.

package/README.zh-CN.md

@@ -10,11 +10,7 @@
 按照[源码安装说明](../../README.zh-CN.md#从源码安装)操作，选择
 `integrations/mem0/typescript`。Mem0 的本地存储需要执行 `better-sqlite3` 的原生安装脚本。
 
-需要受控的 LLM/Embedding 回调时，在应用中安装可选 peer 依赖：
-
-```sh
-npm install @langchain/core@1.1.47
-```
+原生受控模型和向量回调已包含在本包内，无需安装 LangChain。
 
 导入 Mem0 前，设置 `MEM0_TELEMETRY=false`，并将 `MEM0_DIR` 指向应用管理的数据目录。
 显式配置 LLM、embedder、`vectorStore.config.dbPath` 和 `historyDbPath`。
@@ -131,3 +127,8 @@ async function capture(
 
 关闭前调用 `await memory.drain()` 和 `memory.close()`，再关闭 SDK 与模型服务资源。
 分页、来源撤回、证据校验和不确定写入的处理见[记忆生命周期指南](../README.zh-CN.md)。
+
+
+## 原生受控适配
+
+`createManagedClient` 把 PurrA 的原生模型和向量适配器注入包内、版本固定的 Mem0 私有模块，沿用现有预算、取消与结果校验。向量维度必须一致，受控路径拒绝 LangChain 向量库。不修改宿主安装的官方 SDK，也不启动代理服务。来源、许可证与修改说明见[第三方声明](THIRD_PARTY_NOTICES.md)。直接传入的原始 SDK 客户端仍由宿主管理，不自动获得受控回调的计费。

package/THIRD_PARTY_NOTICES.md

@@ -0,0 +1,9 @@
+# Mem0 attribution and local modifications
+
+This package includes a private module derived from Mem0 (https://github.com/mem0ai/mem0), copyright Mem0 contributors, licensed under Apache-2.0 (MEM0-LICENSE).
+
+Python uses mem0ai 2.0.19 memory/main.py; TypeScript uses mem0ai 3.1.7 dist/oss/index.mjs. PurrA modifies constructor provider injection and, in TypeScript, preserves injected providers across reset. The extension also identifies injected providers and releases SDK-owned local handles on failed initialization; the TypeScript managed factory awaits initialization before returning. These are PurrA-owned private copies, not replacements for or modifications to the installed official mem0ai package. The SDK algorithms remain upstream-owned.
+
+The repository integrations/mem0/sdk/upstream.json records input hashes. Python scripts/sync_sdk.py verifies/regenerates the checked-in private module; TypeScript scripts/build-sdk.mjs generates dist/sdk-memory.js during the package build. No patching or source generation happens when a consumer imports the package.
+
+Generated source is reviewed by verifying the pinned input and the small transformation, then exercising SDK contract and installed-package tests. SDK upgrades require an explicit hash/contract review. Native provider clients are not constructed on the managed path. The private SDK is not part of the public API.

package/dist/direct-providers.d.ts

@@ -0,0 +1,8 @@
+export declare class DirectLlm {
+    generateResponse(messages: unknown, format?: unknown, tools?: unknown, ...extra: unknown[]): Promise<string>;
+    generateChat(): Promise<never>;
+}
+export declare class DirectEmbedder {
+    embed(text: unknown, action?: unknown): Promise<number[]>;
+    embedBatch(texts: unknown, action?: unknown): Promise<number[][]>;
+}

package/dist/direct-providers.js

@@ -0,0 +1,43 @@
+import { currentExecution } from "./providers.js";
+import { MemoryError } from "./journal.js";
+function execution() {
+    const value = currentExecution();
+    if (!value)
+        throw new MemoryError("memory_provider_unbound");
+    value.check();
+    return value;
+}
+function reject(value) {
+    value.stop("memory_provider_contract");
+    throw new MemoryError(value.error);
+}
+export class DirectLlm {
+    async generateResponse(messages, format, tools, ...extra) {
+        const value = execution();
+        if (extra.length || (tools !== undefined && (!Array.isArray(tools) || tools.length))
+            || (format !== undefined && (format === null || typeof format !== "object"
+                || Object.keys(format).length !== 1 || format.type !== "json_object"))
+            || !Array.isArray(messages) || !messages.length)
+            reject(value);
+        const converted = Array.from(messages, (message) => {
+            if (!message || typeof message !== "object" || Object.keys(message).sort().join() !== "content,role")
+                reject(value);
+            const m = message;
+            if (!["system", "user", "assistant"].includes(m.role) || typeof m.content !== "string")
+                reject(value);
+            return { role: m.role, content: m.content };
+        });
+        return value.invoke("llm", converted);
+    }
+    async generateChat() { return reject(execution()); }
+}
+export class DirectEmbedder {
+    async embed(text, action) { return (await this.embedBatch([text], action))[0]; }
+    async embedBatch(texts, action) {
+        const value = execution();
+        if ((action !== undefined && !["add", "search", "update"].includes(action))
+            || !Array.isArray(texts) || Array.from(texts).some(text => typeof text !== "string"))
+            reject(value);
+        return texts.length ? value.invoke("embedding", [...texts]) : [];
+    }
+}

package/dist/providers.js

@@ -28,12 +28,6 @@ export function currentExecution(journal) {
     const value = current.getStore();
     return journal === undefined || value?.journal === journal ? value : undefined;
 }
-function execution() {
-    const value = currentExecution();
-    if (!value)
-        throw new MemoryError("memory_provider_unbound");
-    return value;
-}
 export class ProviderExecution {
     providers;
     journal;
@@ -181,22 +175,16 @@ export async function createManagedClient(options) {
         throw new TypeError("managed config accepts only storage/history/instructions");
     if (!config.vectorStore || typeof config.historyDbPath !== "string" || !config.historyDbPath.trim())
         throw new TypeError("explicit vectorStore and historyDbPath are required");
-    const { Memory } = await import("mem0ai/oss");
+    if (config.vectorStore.provider.toLowerCase() === "langchain")
+        throw new TypeError("native vector store required");
+    const dimension = config.vectorStore.config.dimension;
+    if (dimension !== undefined && dimension !== embeddingDims)
+        throw new TypeError("vector store dimension must match embeddingDims");
+    const { Memory } = await import("./sdk-memory.js");
+    const { DirectLlm, DirectEmbedder } = await import("./direct-providers.js");
     const sdk = new Memory({ ...config,
-        llm: { provider: "langchain", config: { model: { async invoke(messages) {
-                        const roles = { human: "user", ai: "assistant", system: "system" };
-                        const converted = messages.map(message => {
-                            const role = roles[(message.type ?? message.getType?.())];
-                            if (!role || typeof message.content !== "string")
-                                throw new MemoryError("memory_provider_contract");
-                            return { role, content: message.content };
-                        });
-                        return { content: await execution().invoke("llm", converted) };
-                    } } } },
-        embedder: { provider: "langchain", config: { embeddingDims, model: {
-                    async embedQuery(text) { return (await execution().invoke("embedding", [text]))[0]; },
-                    async embedDocuments(texts) { return execution().invoke("embedding", texts); },
-                } } },
-    });
+        vectorStore: { ...config.vectorStore, config: { ...config.vectorStore.config, dimension: embeddingDims } },
+    }, { llm: new DirectLlm(), embedder: new DirectEmbedder() });
+    await sdk.ready();
     return new ManagedMem0Client(sdk, embeddingDims);
 }

package/dist/relations.d.ts

@@ -0,0 +1,28 @@
+import type { Mem0Memory, MemoryRef, MemorySource } from './memory.js';
+export interface MemoryRelationProposal {
+    readonly from: MemoryRef;
+    readonly to: MemoryRef;
+    readonly relation: string;
+    readonly fromQuote: string;
+    readonly toQuote: string;
+    readonly fromSource: MemorySource;
+    readonly toSource: MemorySource;
+}
+export interface MemoryRelationExtractionInput {
+    readonly relations: readonly string[];
+    readonly maxProposals: number;
+    readonly records: readonly {
+        readonly id: string;
+        readonly version: number;
+        readonly text: string;
+    }[];
+}
+export type MemoryRelationExtractor = (input: MemoryRelationExtractionInput, signal?: AbortSignal) => Promise<unknown>;
+/** Returns candidates only. The host owns model budgets, authorization and review. */
+export declare function proposeMemoryRelations(memory: Mem0Memory, refs: readonly MemoryRef[], options: {
+    relations: readonly string[];
+    extract: MemoryRelationExtractor;
+    maxInputChars?: number;
+    maxProposals?: number;
+    signal?: AbortSignal;
+}): Promise<readonly MemoryRelationProposal[]>;

package/dist/relations.js

@@ -0,0 +1,70 @@
+import { MemoryError } from './journal.js';
+/** Returns candidates only. The host owns model budgets, authorization and review. */
+export async function proposeMemoryRelations(memory, refs, options) {
+    const { extract, signal } = options;
+    const maxInputChars = options.maxInputChars ?? 32_000, maxProposals = options.maxProposals ?? 32;
+    if (typeof extract !== 'function')
+        throw new TypeError('extract must be an async function');
+    for (const [value, limit] of [[maxInputChars, 10_000_000], [maxProposals, 256]]) {
+        if (!Number.isSafeInteger(value) || value < 1 || value > limit)
+            throw new TypeError('Invalid relation extraction limit');
+    }
+    if (!Array.isArray(refs) || refs.length < 2 || refs.length > 32 || refs.some(ref => !ref || typeof ref.id !== 'string' || !ref.id.trim() || ref.id.length > 512 ||
+        !Number.isSafeInteger(ref.version) || ref.version < 1 || ref.version > 2 ** 31 - 2))
+        throw new TypeError('Provide 2 to 32 memory references');
+    const selected = refs.map(ref => Object.freeze({ id: ref.id, version: ref.version }));
+    if (new Set(selected.map(ref => ref.id)).size !== selected.length)
+        throw new TypeError('Duplicate memory reference');
+    if (!Array.isArray(options.relations) || options.relations.length < 1 || options.relations.length > 64 || options.relations.some(value => typeof value !== 'string' || !value.trim() || value !== value.trim() || [...value].length > 64))
+        throw new TypeError('Invalid host relation vocabulary');
+    const relations = Object.freeze([...options.relations]);
+    if (new Set(relations).size !== relations.length)
+        throw new TypeError('Duplicate relation');
+    const epoch = memory.epoch;
+    const check = () => {
+        if (signal?.aborted)
+            throw new MemoryError('memory_cancelled');
+        memory.assertEpoch(epoch);
+    };
+    check();
+    const records = new Map();
+    for (const ref of selected) {
+        const record = await memory.get(ref.id, signal === undefined ? {} : { signal });
+        if (!record || record.version !== ref.version)
+            throw new MemoryError('memory_relation_stale');
+        records.set(ref.id, record);
+    }
+    if ([...records.values()].reduce((sum, record) => sum + [...record.text].length, 0) > maxInputChars)
+        throw new TypeError('Relation source text exceeds maxInputChars');
+    check();
+    const raw = await extract(Object.freeze({ relations, maxProposals,
+        records: Object.freeze([...records.values()].map(({ id, version, text }) => Object.freeze({ id, version, text }))),
+    }), signal);
+    check();
+    if (!Array.isArray(raw) || raw.length > maxProposals)
+        throw new MemoryError('memory_invalid_relation_proposal');
+    const result = [], seen = new Set();
+    for (const item of raw) {
+        const keys = ['from', 'to', 'relation', 'fromQuote', 'toQuote'];
+        if (!item || typeof item !== 'object' || Object.keys(item).length !== keys.length ||
+            keys.some(key => !Object.hasOwn(item, key) || typeof item[key] !== 'string'))
+            throw new MemoryError('memory_invalid_relation_proposal');
+        const a = records.get(item.from), b = records.get(item.to);
+        const identity = JSON.stringify([item.from, item.to, item.relation]);
+        if (!a || !b || a.id === b.id || !relations.includes(item.relation) || seen.has(identity) ||
+            !item.fromQuote.trim() || !a.text.includes(item.fromQuote) || !item.toQuote.trim() || !b.text.includes(item.toQuote))
+            throw new MemoryError('memory_invalid_relation_proposal');
+        seen.add(identity);
+        result.push(Object.freeze({ from: Object.freeze({ id: a.id, version: a.version }), to: Object.freeze({ id: b.id, version: b.version }),
+            relation: item.relation, fromQuote: item.fromQuote, toQuote: item.toQuote,
+            fromSource: Object.freeze({ ...a.source }), toSource: Object.freeze({ ...b.source }) }));
+    }
+    for (const ref of selected) {
+        const before = records.get(ref.id), after = await memory.get(ref.id, signal === undefined ? {} : { signal });
+        if (!after || after.version !== before.version || after.text !== before.text || after.state !== before.state ||
+            after.source.id !== before.source.id || after.source.revision !== before.source.revision)
+            throw new MemoryError('memory_relation_stale');
+    }
+    check();
+    return Object.freeze(result);
+}

package/dist/sdk-memory.d.ts

@@ -0,0 +1,14 @@
+/** Private declaration surface for the generated SDK extension. */
+import type { Mem0Client } from "./memory.js";
+import type { DirectLlm, DirectEmbedder } from "./direct-providers.js";
+export class Memory implements Mem0Client {
+  constructor(config: Record<string, unknown>, providers: { llm: DirectLlm; embedder: DirectEmbedder });
+  ready(): Promise<this>;
+  add: Mem0Client["add"];
+  get: Mem0Client["get"];
+  getAll: Mem0Client["getAll"];
+  search: Mem0Client["search"];
+  update: Mem0Client["update"];
+  delete: Mem0Client["delete"];
+  history: Mem0Client["history"];
+}