@memloom/mcp 0.1.0

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/dist/bin.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/bin.js

@@ -0,0 +1,18 @@
+#!/usr/bin/env node
+import {
+  buildServer
+} from "./chunk-KMKBEXJI.js";
+
+// src/bin.ts
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { connect } from "memloom";
+async function main() {
+  const engine = await connect();
+  const server = buildServer(engine);
+  await server.connect(new StdioServerTransport());
+}
+main().catch((err) => {
+  console.error(err instanceof Error ? err.message : String(err));
+  process.exit(1);
+});
+//# sourceMappingURL=bin.js.map

package/dist/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/bin.ts"],"sourcesContent":["import { StdioServerTransport } from \"@modelcontextprotocol/sdk/server/stdio.js\";\nimport { connect } from \"memloom\";\nimport { buildServer } from \"./server.js\";\n\n// memloom MCP server over stdio. Routes through the `memloom serve` daemon (auto-started by\n// connect() if needed), so it never opens the store directly: no lock conflicts with the CLI\n// or a DB client. Register in Claude Desktop as:\n//   { \"command\": \"node\", \"args\": [\"<path>/dist/bin.js\"], \"env\": { \"OPENROUTER_API_KEY\": \"...\" } }\n\nasync function main() {\n  const engine = await connect();\n  const server = buildServer(engine);\n  await server.connect(new StdioServerTransport());\n}\n\nmain().catch((err) => {\n  console.error(err instanceof Error ? err.message : String(err));\n  process.exit(1);\n});\n"],"mappings":";;;;;;AAAA,SAAS,4BAA4B;AACrC,SAAS,eAAe;AAQxB,eAAe,OAAO;AACpB,QAAM,SAAS,MAAM,QAAQ;AAC7B,QAAM,SAAS,YAAY,MAAM;AACjC,QAAM,OAAO,QAAQ,IAAI,qBAAqB,CAAC;AACjD;AAEA,KAAK,EAAE,MAAM,CAAC,QAAQ;AACpB,UAAQ,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAC9D,UAAQ,KAAK,CAAC;AAChB,CAAC;","names":[]}

package/dist/chunk-KMKBEXJI.js

@@ -0,0 +1,201 @@
+#!/usr/bin/env node
+
+// src/tools.ts
+import {
+  PASSAGE_CHARS
+} from "@memloom/core";
+async function saveMemory(memloom, args) {
+  const result = await memloom.save({
+    content: args.content,
+    ...args.canonical ? { canonical: args.canonical } : {},
+    ...args.type ? { memoryType: args.type } : {}
+  });
+  if (result.outcome === "conflict") {
+    return `Saved (id ${result.id}), but it CONTRADICTS an existing memory. Both are kept; the user should resolve conflict ${result.conflictId} (keep new / keep existing / keep both / merge).`;
+  }
+  if (result.outcome === "merged") {
+    return `Already known: merged into memory ${result.id}, nothing duplicated.`;
+  }
+  return `Saved memory ${result.id}.`;
+}
+async function recallMemory(memloom, args) {
+  const results = await memloom.recall(args.query, { limit: args.limit ?? 10 });
+  if (results.length === 0) return "No memories found.";
+  return results.map((m) => {
+    const title = m.canonical ?? (m.content.length > 60 ? `${m.content.slice(0, 57)}...` : m.content);
+    const saved = new Date(m.createdAt).toISOString().slice(0, 16).replace("T", " ");
+    const passage = m.content.length > PASSAGE_CHARS ? `${m.content.slice(0, PASSAGE_CHARS)}... [truncated: call read_passage with id ${m.id} for the full text]` : m.content;
+    const lines = [
+      title,
+      `- ${passage}`,
+      `- saved ${saved} UTC`,
+      `- similarity ${(m.similarity ?? 0).toFixed(2)}`
+    ];
+    if (m.source) {
+      const where = [
+        `- from ${m.source.title}`,
+        m.source.headingPath ? `\u203A ${m.source.headingPath}` : "",
+        m.source.page != null ? `(p. ${m.source.page})` : ""
+      ].filter(Boolean).join(" ");
+      lines.push(where);
+    }
+    lines.push(`- id ${m.id}${!m.source && m.version > 1 ? ` (v${m.version})` : ""}`);
+    return lines.join("\n");
+  }).join("\n---\n");
+}
+async function readPassage(memloom, args) {
+  const content = await memloom.passage(args.id);
+  if (content === null) {
+    return `No memory or document passage with id ${args.id}. Use an id from recall_memory results.`;
+  }
+  return content;
+}
+async function memoryHistory(memloom, args) {
+  const versions = await memloom.history(args.memoryId);
+  if (versions.length === 0) return "No such memory.";
+  return versions.map((v) => {
+    const when = new Date(v.assertedAt).toISOString().slice(0, 16).replace("T", " ");
+    const marker = v.status === "active" ? "current" : "superseded";
+    return `v${v.version} (${marker}, since ${when} UTC)
+- ${v.content}`;
+  }).join("\n---\n");
+}
+async function listConflicts(memloom) {
+  const conflicts = await memloom.conflicts();
+  if (conflicts.length === 0) return "No pending conflicts.";
+  return conflicts.map(
+    (c) => `Conflict ${c.id}
+  NEW:      ${c.incoming.content}
+  EXISTING: ${c.candidates.map((x) => x.content).join("; ")}`
+  ).join("\n\n");
+}
+async function resolveConflict(memloom, args) {
+  let decision;
+  switch (args.action) {
+    case "keep_existing":
+      if (!args.candidateId) throw new Error("keep_existing requires candidateId");
+      decision = { action: "keep_existing", candidateId: args.candidateId };
+      break;
+    case "merge":
+      if (!args.content) throw new Error("merge requires the reconciled content");
+      decision = { action: "merge", content: args.content };
+      break;
+    case "keep_new":
+      decision = { action: "keep_new" };
+      break;
+    case "keep_both":
+      decision = { action: "keep_both" };
+      break;
+  }
+  await memloom.resolveConflict(args.conflictId, decision);
+  return `Resolved conflict ${args.conflictId} with "${args.action}" (reversible).`;
+}
+async function setSchemaEntryStatus(memloom, args) {
+  const schema = await memloom.describeSchema();
+  const pool = args.kind === "entity_type" ? schema.entityTypes : schema.predicates;
+  const entry = pool.find((e) => e.name === args.name.toLowerCase());
+  if (!entry) return `No ${args.kind} named "${args.name}" exists.`;
+  if (entry.status === args.status) {
+    return `"${entry.name}" is already ${args.status}.`;
+  }
+  await memloom.setSchemaStatus(entry.id, args.status);
+  return `${args.status === "disabled" ? "Disabled" : "Enabled"} ${args.kind} "${entry.name}".`;
+}
+async function deleteSchemaEntry(memloom, args) {
+  const schema = await memloom.describeSchema();
+  const pool = args.kind === "entity_type" ? schema.entityTypes : schema.predicates;
+  const entry = pool.find((e) => e.name === args.name.toLowerCase());
+  if (!entry) return `No ${args.kind} named "${args.name}" exists.`;
+  if (entry.tier === "system") {
+    return `"${entry.name}" is a built-in ${args.kind}; it can be disabled but never deleted.`;
+  }
+  if (entry.status !== "disabled") {
+    return `"${entry.name}" is still active. Disable it first (set_schema_entry_status), then delete.`;
+  }
+  await memloom.deleteSchemaEntry(entry.id);
+  return `Deleted ${args.kind} "${entry.name}" from the vocabulary. Entities already extracted under it stay in the graph.`;
+}
+
+// src/server.ts
+import { MEMORY_TYPES } from "@memloom/core";
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { z } from "zod";
+function buildServer(memloom) {
+  const server = new McpServer({ name: "memloom", version: "0.1.0" });
+  server.tool(
+    "save_memory",
+    "Save a durable memory the user owns. Set `type` to classify it: fact (a stable truth), preference (how the user likes things), episode (a time-bound event or decision), or procedure (reusable how-to steps); defaults to fact. memloom dedupes automatically and flags contradictions instead of overwriting, so save what is worth remembering; the response says if it created a conflict to resolve.",
+    {
+      content: z.string(),
+      canonical: z.string().optional(),
+      type: z.enum(MEMORY_TYPES).optional()
+    },
+    async (args) => ({ content: [{ type: "text", text: await saveMemory(memloom, args) }] })
+  );
+  server.tool(
+    "recall_memory",
+    "Recall the user's memories AND ingested context documents by meaning, ranked by hybrid retrieval (semantic + exact keyword + entity). Exact identifiers like file paths, config keys, or error codes make excellent queries. Document results say which file and section they came from. Only active (non-superseded) memories are returned. Very long results are truncated with a marker; read_passage fetches the full text by id.",
+    { query: z.string(), limit: z.number().optional() },
+    async (args) => ({ content: [{ type: "text", text: await recallMemory(memloom, args) }] })
+  );
+  server.tool(
+    "read_passage",
+    "The full text of one recall_memory result, by the `id` shown with it. Call ONLY when a result ended with a truncation marker and the answer may be in the cut part.",
+    { id: z.string() },
+    async (args) => ({ content: [{ type: "text", text: await readPassage(memloom, args) }] })
+  );
+  server.tool(
+    "memory_history",
+    "Show how a memory changed over time: its full version chain, newest first, with the current version and every superseded one. Pass the `id` shown by recall_memory. Read-only: editing memories is a human action in the viewer or CLI.",
+    { memoryId: z.string() },
+    async (args) => ({ content: [{ type: "text", text: await memoryHistory(memloom, args) }] })
+  );
+  server.tool(
+    "list_conflicts",
+    "List pending memory conflicts (contradictions the user has not resolved yet).",
+    {},
+    async () => ({ content: [{ type: "text", text: await listConflicts(memloom) }] })
+  );
+  server.tool(
+    "resolve_conflict",
+    "Resolve a memory conflict. Actions: keep_new, keep_existing (needs candidateId), keep_both, or merge (needs reconciled content). Every resolution is reversible.",
+    {
+      conflictId: z.string(),
+      action: z.enum(["keep_new", "keep_existing", "keep_both", "merge"]),
+      candidateId: z.string().optional(),
+      content: z.string().optional()
+    },
+    async (args) => ({ content: [{ type: "text", text: await resolveConflict(memloom, args) }] })
+  );
+  server.tool(
+    "set_schema_entry_status",
+    "Enable or disable a graph schema entry (an entity type or predicate). A disabled entry stops being used by future extraction, but entities already extracted under it stay in the graph. Built-in entries can only be disabled, never deleted; user-defined entries must be disabled before delete_schema_entry will remove them.",
+    {
+      kind: z.enum(["entity_type", "predicate"]),
+      name: z.string(),
+      status: z.enum(["active", "disabled"])
+    },
+    async (args) => ({
+      content: [{ type: "text", text: await setSchemaEntryStatus(memloom, args) }]
+    })
+  );
+  server.tool(
+    "delete_schema_entry",
+    "Permanently remove a DISABLED user-defined vocabulary entry (an entity type or predicate) from the graph schema. Built-in entries can only be disabled, and an active entry must be disabled before deletion; the response explains any refusal. Entities already extracted under the deleted type stay in the graph.",
+    {
+      kind: z.enum(["entity_type", "predicate"]),
+      name: z.string()
+    },
+    async (args) => ({ content: [{ type: "text", text: await deleteSchemaEntry(memloom, args) }] })
+  );
+  return server;
+}
+
+export {
+  saveMemory,
+  recallMemory,
+  listConflicts,
+  resolveConflict,
+  buildServer
+};
+//# sourceMappingURL=chunk-KMKBEXJI.js.map

package/dist/chunk-KMKBEXJI.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/tools.ts","../src/server.ts"],"sourcesContent":["import {\n  type MemoryEngine,\n  type MemoryType,\n  PASSAGE_CHARS,\n  type ResolveDecision,\n} from \"@memloom/core\";\n\n// The MCP tool implementations, kept as pure functions over a Memloom so they're testable\n// without an MCP transport. server.ts wires them to the protocol.\n\nexport async function saveMemory(\n  memloom: MemoryEngine,\n  args: { content: string; canonical?: string; type?: MemoryType },\n): Promise<string> {\n  const result = await memloom.save({\n    content: args.content,\n    ...(args.canonical ? { canonical: args.canonical } : {}),\n    ...(args.type ? { memoryType: args.type } : {}),\n  });\n  if (result.outcome === \"conflict\") {\n    return `Saved (id ${result.id}), but it CONTRADICTS an existing memory. Both are kept; the user should resolve conflict ${result.conflictId} (keep new / keep existing / keep both / merge).`;\n  }\n  if (result.outcome === \"merged\") {\n    return `Already known: merged into memory ${result.id}, nothing duplicated.`;\n  }\n  return `Saved memory ${result.id}.`;\n}\n\nexport async function recallMemory(\n  memloom: MemoryEngine,\n  args: { query: string; limit?: number },\n): Promise<string> {\n  const results = await memloom.recall(args.query, { limit: args.limit ?? 10 });\n  if (results.length === 0) return \"No memories found.\";\n  return results\n    .map((m) => {\n      // Title: the canonical form when the memory has one, else the content's first words.\n      const title =\n        m.canonical ?? (m.content.length > 60 ? `${m.content.slice(0, 57)}...` : m.content);\n      const saved = new Date(m.createdAt).toISOString().slice(0, 16).replace(\"T\", \" \");\n      // The same passage budget the viewer assistant uses: a markdown chunk is a whole\n      // heading section (up to 16k chars), so a cut passage names the escape hatch.\n      const passage =\n        m.content.length > PASSAGE_CHARS\n          ? `${m.content.slice(0, PASSAGE_CHARS)}... [truncated: call read_passage with id ${m.id} for the full text]`\n          : m.content;\n      const lines = [\n        title,\n        `- ${passage}`,\n        `- saved ${saved} UTC`,\n        `- similarity ${(m.similarity ?? 0).toFixed(2)}`,\n      ];\n      if (m.source) {\n        // Context chunks carry provenance; always show where the text came from.\n        const where = [\n          `- from ${m.source.title}`,\n          m.source.headingPath ? `› ${m.source.headingPath}` : \"\",\n          m.source.page != null ? `(p. ${m.source.page})` : \"\",\n        ]\n          .filter(Boolean)\n          .join(\" \");\n        lines.push(where);\n      }\n      // Every hit surfaces its id: memory_history looks up how a memory changed, and\n      // read_passage fetches a truncated hit's full text (memories AND chunks).\n      lines.push(`- id ${m.id}${!m.source && m.version > 1 ? ` (v${m.version})` : \"\"}`);\n      return lines.join(\"\\n\");\n    })\n    .join(\"\\n---\\n\");\n}\n\n/** The full text of one recall hit: the follow-up for a passage recall_memory truncated. */\nexport async function readPassage(memloom: MemoryEngine, args: { id: string }): Promise<string> {\n  const content = await memloom.passage(args.id);\n  if (content === null) {\n    return `No memory or document passage with id ${args.id}. Use an id from recall_memory results.`;\n  }\n  return content;\n}\n\nexport async function memoryHistory(\n  memloom: MemoryEngine,\n  args: { memoryId: string },\n): Promise<string> {\n  const versions = await memloom.history(args.memoryId);\n  if (versions.length === 0) return \"No such memory.\";\n  return versions\n    .map((v) => {\n      const when = new Date(v.assertedAt).toISOString().slice(0, 16).replace(\"T\", \" \");\n      const marker = v.status === \"active\" ? \"current\" : \"superseded\";\n      return `v${v.version} (${marker}, since ${when} UTC)\\n- ${v.content}`;\n    })\n    .join(\"\\n---\\n\");\n}\n\nexport async function listConflicts(memloom: MemoryEngine): Promise<string> {\n  const conflicts = await memloom.conflicts();\n  if (conflicts.length === 0) return \"No pending conflicts.\";\n  return conflicts\n    .map(\n      (c) =>\n        `Conflict ${c.id}\\n  NEW:      ${c.incoming.content}\\n  EXISTING: ${c.candidates\n          .map((x) => x.content)\n          .join(\"; \")}`,\n    )\n    .join(\"\\n\\n\");\n}\n\nexport async function resolveConflict(\n  memloom: MemoryEngine,\n  args: {\n    conflictId: string;\n    action: \"keep_new\" | \"keep_existing\" | \"keep_both\" | \"merge\";\n    candidateId?: string;\n    content?: string;\n  },\n): Promise<string> {\n  let decision: ResolveDecision;\n  switch (args.action) {\n    case \"keep_existing\":\n      if (!args.candidateId) throw new Error(\"keep_existing requires candidateId\");\n      decision = { action: \"keep_existing\", candidateId: args.candidateId };\n      break;\n    case \"merge\":\n      if (!args.content) throw new Error(\"merge requires the reconciled content\");\n      decision = { action: \"merge\", content: args.content };\n      break;\n    case \"keep_new\":\n      decision = { action: \"keep_new\" };\n      break;\n    case \"keep_both\":\n      decision = { action: \"keep_both\" };\n      break;\n  }\n  await memloom.resolveConflict(args.conflictId, decision);\n  return `Resolved conflict ${args.conflictId} with \"${args.action}\" (reversible).`;\n}\n\nexport async function setSchemaEntryStatus(\n  memloom: MemoryEngine,\n  args: { kind: \"entity_type\" | \"predicate\"; name: string; status: \"active\" | \"disabled\" },\n): Promise<string> {\n  const schema = await memloom.describeSchema();\n  const pool = args.kind === \"entity_type\" ? schema.entityTypes : schema.predicates;\n  const entry = pool.find((e) => e.name === args.name.toLowerCase());\n  if (!entry) return `No ${args.kind} named \"${args.name}\" exists.`;\n  if (entry.status === args.status) {\n    return `\"${entry.name}\" is already ${args.status}.`;\n  }\n  await memloom.setSchemaStatus(entry.id, args.status);\n  return `${args.status === \"disabled\" ? \"Disabled\" : \"Enabled\"} ${args.kind} \"${entry.name}\".`;\n}\n\nexport async function deleteSchemaEntry(\n  memloom: MemoryEngine,\n  args: { kind: \"entity_type\" | \"predicate\"; name: string },\n): Promise<string> {\n  const schema = await memloom.describeSchema();\n  const pool = args.kind === \"entity_type\" ? schema.entityTypes : schema.predicates;\n  const entry = pool.find((e) => e.name === args.name.toLowerCase());\n  if (!entry) return `No ${args.kind} named \"${args.name}\" exists.`;\n  // Mirror the engine guards with readable answers instead of raw errors: the calling\n  // agent should relay these to the user rather than retry.\n  if (entry.tier === \"system\") {\n    return `\"${entry.name}\" is a built-in ${args.kind}; it can be disabled but never deleted.`;\n  }\n  if (entry.status !== \"disabled\") {\n    return `\"${entry.name}\" is still active. Disable it first (set_schema_entry_status), then delete.`;\n  }\n  await memloom.deleteSchemaEntry(entry.id);\n  return `Deleted ${args.kind} \"${entry.name}\" from the vocabulary. Entities already extracted under it stay in the graph.`;\n}\n","import { MEMORY_TYPES, type MemoryEngine } from \"@memloom/core\";\nimport { McpServer } from \"@modelcontextprotocol/sdk/server/mcp.js\";\nimport { z } from \"zod\";\nimport {\n  deleteSchemaEntry,\n  listConflicts,\n  memoryHistory,\n  readPassage,\n  recallMemory,\n  resolveConflict,\n  saveMemory,\n  setSchemaEntryStatus,\n} from \"./tools.js\";\n\n// Wire the tool functions to the MCP protocol. Descriptions tell the calling agent when to\n// reach for each tool and how memloom behaves (dedup + human-in-the-loop conflicts).\n\nexport function buildServer(memloom: MemoryEngine): McpServer {\n  const server = new McpServer({ name: \"memloom\", version: \"0.1.0\" });\n\n  server.tool(\n    \"save_memory\",\n    \"Save a durable memory the user owns. Set `type` to classify it: fact (a stable truth), \" +\n      \"preference (how the user likes things), episode (a time-bound event or decision), or \" +\n      \"procedure (reusable how-to steps); defaults to fact. memloom dedupes automatically and \" +\n      \"flags contradictions instead of overwriting, so save what is worth remembering; the \" +\n      \"response says if it created a conflict to resolve.\",\n    {\n      content: z.string(),\n      canonical: z.string().optional(),\n      type: z.enum(MEMORY_TYPES).optional(),\n    },\n    async (args) => ({ content: [{ type: \"text\", text: await saveMemory(memloom, args) }] }),\n  );\n\n  server.tool(\n    \"recall_memory\",\n    \"Recall the user's memories AND ingested context documents by meaning, ranked by hybrid \" +\n      \"retrieval (semantic + exact keyword + entity). Exact identifiers like file paths, \" +\n      \"config keys, or error codes make excellent queries. Document results say which file \" +\n      \"and section they came from. Only active (non-superseded) memories are returned. Very \" +\n      \"long results are truncated with a marker; read_passage fetches the full text by id.\",\n    { query: z.string(), limit: z.number().optional() },\n    async (args) => ({ content: [{ type: \"text\", text: await recallMemory(memloom, args) }] }),\n  );\n\n  server.tool(\n    \"read_passage\",\n    \"The full text of one recall_memory result, by the `id` shown with it. Call ONLY when \" +\n      \"a result ended with a truncation marker and the answer may be in the cut part.\",\n    { id: z.string() },\n    async (args) => ({ content: [{ type: \"text\", text: await readPassage(memloom, args) }] }),\n  );\n\n  server.tool(\n    \"memory_history\",\n    \"Show how a memory changed over time: its full version chain, newest first, with the \" +\n      \"current version and every superseded one. Pass the `id` shown by recall_memory. Read-only: \" +\n      \"editing memories is a human action in the viewer or CLI.\",\n    { memoryId: z.string() },\n    async (args) => ({ content: [{ type: \"text\", text: await memoryHistory(memloom, args) }] }),\n  );\n\n  server.tool(\n    \"list_conflicts\",\n    \"List pending memory conflicts (contradictions the user has not resolved yet).\",\n    {},\n    async () => ({ content: [{ type: \"text\", text: await listConflicts(memloom) }] }),\n  );\n\n  server.tool(\n    \"resolve_conflict\",\n    \"Resolve a memory conflict. Actions: keep_new, keep_existing (needs candidateId), \" +\n      \"keep_both, or merge (needs reconciled content). Every resolution is reversible.\",\n    {\n      conflictId: z.string(),\n      action: z.enum([\"keep_new\", \"keep_existing\", \"keep_both\", \"merge\"]),\n      candidateId: z.string().optional(),\n      content: z.string().optional(),\n    },\n    async (args) => ({ content: [{ type: \"text\", text: await resolveConflict(memloom, args) }] }),\n  );\n\n  server.tool(\n    \"set_schema_entry_status\",\n    \"Enable or disable a graph schema entry (an entity type or predicate). A disabled entry \" +\n      \"stops being used by future extraction, but entities already extracted under it stay \" +\n      \"in the graph. Built-in entries can only be disabled, never deleted; user-defined \" +\n      \"entries must be disabled before delete_schema_entry will remove them.\",\n    {\n      kind: z.enum([\"entity_type\", \"predicate\"]),\n      name: z.string(),\n      status: z.enum([\"active\", \"disabled\"]),\n    },\n    async (args) => ({\n      content: [{ type: \"text\", text: await setSchemaEntryStatus(memloom, args) }],\n    }),\n  );\n\n  server.tool(\n    \"delete_schema_entry\",\n    \"Permanently remove a DISABLED user-defined vocabulary entry (an entity type or \" +\n      \"predicate) from the graph schema. Built-in entries can only be disabled, and an \" +\n      \"active entry must be disabled before deletion; the response explains any refusal. \" +\n      \"Entities already extracted under the deleted type stay in the graph.\",\n    {\n      kind: z.enum([\"entity_type\", \"predicate\"]),\n      name: z.string(),\n    },\n    async (args) => ({ content: [{ type: \"text\", text: await deleteSchemaEntry(memloom, args) }] }),\n  );\n\n  return server;\n}\n"],"mappings":";;;AAAA;AAAA,EAGE;AAAA,OAEK;AAKP,eAAsB,WACpB,SACA,MACiB;AACjB,QAAM,SAAS,MAAM,QAAQ,KAAK;AAAA,IAChC,SAAS,KAAK;AAAA,IACd,GAAI,KAAK,YAAY,EAAE,WAAW,KAAK,UAAU,IAAI,CAAC;AAAA,IACtD,GAAI,KAAK,OAAO,EAAE,YAAY,KAAK,KAAK,IAAI,CAAC;AAAA,EAC/C,CAAC;AACD,MAAI,OAAO,YAAY,YAAY;AACjC,WAAO,aAAa,OAAO,EAAE,6FAA6F,OAAO,UAAU;AAAA,EAC7I;AACA,MAAI,OAAO,YAAY,UAAU;AAC/B,WAAO,qCAAqC,OAAO,EAAE;AAAA,EACvD;AACA,SAAO,gBAAgB,OAAO,EAAE;AAClC;AAEA,eAAsB,aACpB,SACA,MACiB;AACjB,QAAM,UAAU,MAAM,QAAQ,OAAO,KAAK,OAAO,EAAE,OAAO,KAAK,SAAS,GAAG,CAAC;AAC5E,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,QACJ,IAAI,CAAC,MAAM;AAEV,UAAM,QACJ,EAAE,cAAc,EAAE,QAAQ,SAAS,KAAK,GAAG,EAAE,QAAQ,MAAM,GAAG,EAAE,CAAC,QAAQ,EAAE;AAC7E,UAAM,QAAQ,IAAI,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,GAAG;AAG/E,UAAM,UACJ,EAAE,QAAQ,SAAS,gBACf,GAAG,EAAE,QAAQ,MAAM,GAAG,aAAa,CAAC,6CAA6C,EAAE,EAAE,wBACrF,EAAE;AACR,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,WAAW,KAAK;AAAA,MAChB,iBAAiB,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC;AAAA,IAChD;AACA,QAAI,EAAE,QAAQ;AAEZ,YAAM,QAAQ;AAAA,QACZ,UAAU,EAAE,OAAO,KAAK;AAAA,QACxB,EAAE,OAAO,cAAc,UAAK,EAAE,OAAO,WAAW,KAAK;AAAA,QACrD,EAAE,OAAO,QAAQ,OAAO,OAAO,EAAE,OAAO,IAAI,MAAM;AAAA,MACpD,EACG,OAAO,OAAO,EACd,KAAK,GAAG;AACX,YAAM,KAAK,KAAK;AAAA,IAClB;AAGA,UAAM,KAAK,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,UAAU,IAAI,MAAM,EAAE,OAAO,MAAM,EAAE,EAAE;AAChF,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB,CAAC,EACA,KAAK,SAAS;AACnB;AAGA,eAAsB,YAAY,SAAuB,MAAuC;AAC9F,QAAM,UAAU,MAAM,QAAQ,QAAQ,KAAK,EAAE;AAC7C,MAAI,YAAY,MAAM;AACpB,WAAO,yCAAyC,KAAK,EAAE;AAAA,EACzD;AACA,SAAO;AACT;AAEA,eAAsB,cACpB,SACA,MACiB;AACjB,QAAM,WAAW,MAAM,QAAQ,QAAQ,KAAK,QAAQ;AACpD,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,SAAO,SACJ,IAAI,CAAC,MAAM;AACV,UAAM,OAAO,IAAI,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,GAAG;AAC/E,UAAM,SAAS,EAAE,WAAW,WAAW,YAAY;AACnD,WAAO,IAAI,EAAE,OAAO,KAAK,MAAM,WAAW,IAAI;AAAA,IAAY,EAAE,OAAO;AAAA,EACrE,CAAC,EACA,KAAK,SAAS;AACnB;AAEA,eAAsB,cAAc,SAAwC;AAC1E,QAAM,YAAY,MAAM,QAAQ,UAAU;AAC1C,MAAI,UAAU,WAAW,EAAG,QAAO;AACnC,SAAO,UACJ;AAAA,IACC,CAAC,MACC,YAAY,EAAE,EAAE;AAAA,cAAiB,EAAE,SAAS,OAAO;AAAA,cAAiB,EAAE,WACnE,IAAI,CAAC,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,CAAC;AAAA,EACjB,EACC,KAAK,MAAM;AAChB;AAEA,eAAsB,gBACpB,SACA,MAMiB;AACjB,MAAI;AACJ,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK;AACH,UAAI,CAAC,KAAK,YAAa,OAAM,IAAI,MAAM,oCAAoC;AAC3E,iBAAW,EAAE,QAAQ,iBAAiB,aAAa,KAAK,YAAY;AACpE;AAAA,IACF,KAAK;AACH,UAAI,CAAC,KAAK,QAAS,OAAM,IAAI,MAAM,uCAAuC;AAC1E,iBAAW,EAAE,QAAQ,SAAS,SAAS,KAAK,QAAQ;AACpD;AAAA,IACF,KAAK;AACH,iBAAW,EAAE,QAAQ,WAAW;AAChC;AAAA,IACF,KAAK;AACH,iBAAW,EAAE,QAAQ,YAAY;AACjC;AAAA,EACJ;AACA,QAAM,QAAQ,gBAAgB,KAAK,YAAY,QAAQ;AACvD,SAAO,qBAAqB,KAAK,UAAU,UAAU,KAAK,MAAM;AAClE;AAEA,eAAsB,qBACpB,SACA,MACiB;AACjB,QAAM,SAAS,MAAM,QAAQ,eAAe;AAC5C,QAAM,OAAO,KAAK,SAAS,gBAAgB,OAAO,cAAc,OAAO;AACvE,QAAM,QAAQ,KAAK,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,KAAK,YAAY,CAAC;AACjE,MAAI,CAAC,MAAO,QAAO,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI;AACtD,MAAI,MAAM,WAAW,KAAK,QAAQ;AAChC,WAAO,IAAI,MAAM,IAAI,gBAAgB,KAAK,MAAM;AAAA,EAClD;AACA,QAAM,QAAQ,gBAAgB,MAAM,IAAI,KAAK,MAAM;AACnD,SAAO,GAAG,KAAK,WAAW,aAAa,aAAa,SAAS,IAAI,KAAK,IAAI,KAAK,MAAM,IAAI;AAC3F;AAEA,eAAsB,kBACpB,SACA,MACiB;AACjB,QAAM,SAAS,MAAM,QAAQ,eAAe;AAC5C,QAAM,OAAO,KAAK,SAAS,gBAAgB,OAAO,cAAc,OAAO;AACvE,QAAM,QAAQ,KAAK,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,KAAK,YAAY,CAAC;AACjE,MAAI,CAAC,MAAO,QAAO,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI;AAGtD,MAAI,MAAM,SAAS,UAAU;AAC3B,WAAO,IAAI,MAAM,IAAI,mBAAmB,KAAK,IAAI;AAAA,EACnD;AACA,MAAI,MAAM,WAAW,YAAY;AAC/B,WAAO,IAAI,MAAM,IAAI;AAAA,EACvB;AACA,QAAM,QAAQ,kBAAkB,MAAM,EAAE;AACxC,SAAO,WAAW,KAAK,IAAI,KAAK,MAAM,IAAI;AAC5C;;;AC3KA,SAAS,oBAAuC;AAChD,SAAS,iBAAiB;AAC1B,SAAS,SAAS;AAeX,SAAS,YAAY,SAAkC;AAC5D,QAAM,SAAS,IAAI,UAAU,EAAE,MAAM,WAAW,SAAS,QAAQ,CAAC;AAElE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAKA;AAAA,MACE,SAAS,EAAE,OAAO;AAAA,MAClB,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,MAC/B,MAAM,EAAE,KAAK,YAAY,EAAE,SAAS;AAAA,IACtC;AAAA,IACA,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,WAAW,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EACxF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAKA,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE;AAAA,IAClD,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,aAAa,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EAC1F;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAEA,EAAE,IAAI,EAAE,OAAO,EAAE;AAAA,IACjB,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,YAAY,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EACzF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAGA,EAAE,UAAU,EAAE,OAAO,EAAE;AAAA,IACvB,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,cAAc,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EAC3F;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,CAAC;AAAA,IACD,aAAa,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,cAAc,OAAO,EAAE,CAAC,EAAE;AAAA,EACjF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAEA;AAAA,MACE,YAAY,EAAE,OAAO;AAAA,MACrB,QAAQ,EAAE,KAAK,CAAC,YAAY,iBAAiB,aAAa,OAAO,CAAC;AAAA,MAClE,aAAa,EAAE,OAAO,EAAE,SAAS;AAAA,MACjC,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B;AAAA,IACA,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,gBAAgB,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EAC7F;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAIA;AAAA,MACE,MAAM,EAAE,KAAK,CAAC,eAAe,WAAW,CAAC;AAAA,MACzC,MAAM,EAAE,OAAO;AAAA,MACf,QAAQ,EAAE,KAAK,CAAC,UAAU,UAAU,CAAC;AAAA,IACvC;AAAA,IACA,OAAO,UAAU;AAAA,MACf,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,qBAAqB,SAAS,IAAI,EAAE,CAAC;AAAA,IAC7E;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAIA;AAAA,MACE,MAAM,EAAE,KAAK,CAAC,eAAe,WAAW,CAAC;AAAA,MACzC,MAAM,EAAE,OAAO;AAAA,IACjB;AAAA,IACA,OAAO,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,MAAM,kBAAkB,SAAS,IAAI,EAAE,CAAC,EAAE;AAAA,EAC/F;AAEA,SAAO;AACT;","names":[]}

package/dist/index.d.ts

@@ -0,0 +1,23 @@
+import { MemoryEngine, MemoryType } from '@memloom/core';
+import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+
+declare function buildServer(memloom: MemoryEngine): McpServer;
+
+declare function saveMemory(memloom: MemoryEngine, args: {
+    content: string;
+    canonical?: string;
+    type?: MemoryType;
+}): Promise<string>;
+declare function recallMemory(memloom: MemoryEngine, args: {
+    query: string;
+    limit?: number;
+}): Promise<string>;
+declare function listConflicts(memloom: MemoryEngine): Promise<string>;
+declare function resolveConflict(memloom: MemoryEngine, args: {
+    conflictId: string;
+    action: "keep_new" | "keep_existing" | "keep_both" | "merge";
+    candidateId?: string;
+    content?: string;
+}): Promise<string>;
+
+export { buildServer, listConflicts, recallMemory, resolveConflict, saveMemory };

package/dist/index.js

@@ -0,0 +1,16 @@
+#!/usr/bin/env node
+import {
+  buildServer,
+  listConflicts,
+  recallMemory,
+  resolveConflict,
+  saveMemory
+} from "./chunk-KMKBEXJI.js";
+export {
+  buildServer,
+  listConflicts,
+  recallMemory,
+  resolveConflict,
+  saveMemory
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/package.json

@@ -0,0 +1,53 @@
+{
+  "name": "@memloom/mcp",
+  "version": "0.1.0",
+  "type": "module",
+  "description": "memloom MCP server (stdio): save_memory, recall_memory, resolve_conflict.",
+  "license": "Apache-2.0",
+  "author": "Kostek Sytnyk <kostek@versuno.ai>",
+  "homepage": "https://memloom.dev",
+  "keywords": [
+    "memory",
+    "ai",
+    "agents",
+    "local-first",
+    "context",
+    "mcp",
+    "knowledge-graph"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/memloom/memloom.git",
+    "directory": "packages/mcp"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "bin": {
+    "memloom-mcp": "./dist/bin.js"
+  },
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.12.0",
+    "zod": "^3.24.0",
+    "memloom": "0.1.0",
+    "@memloom/core": "0.1.0"
+  },
+  "scripts": {
+    "build": "tsup",
+    "typecheck": "tsc --noEmit"
+  }
+}