@skillkit/mcp-memory 1.8.0

package/LICENSE

@@ -0,0 +1,190 @@
+                                 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 the 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
+
+   Copyright 2025 Rohit Ghumare
+
+   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,157 @@
+# @skillkit/mcp-memory
+
+MCP (Model Context Protocol) server for SkillKit persistent memory. Enables Claude, Cursor, and other MCP-compatible tools to store, search, and recall memories with semantic embeddings.
+
+## Installation
+
+```bash
+npm install @skillkit/mcp-memory
+# or
+pnpm add @skillkit/mcp-memory
+```
+
+## Usage with Claude Desktop
+
+Add to your `claude_desktop_config.json`:
+
+```json
+{
+  "mcpServers": {
+    "skillkit-memory": {
+      "command": "npx",
+      "args": ["@skillkit/mcp-memory"],
+      "env": {
+        "SKILLKIT_AGENT_ID": "claude-desktop"
+      }
+    }
+  }
+}
+```
+
+## Usage with Cursor
+
+Add to your Cursor MCP settings:
+
+```json
+{
+  "mcpServers": {
+    "skillkit-memory": {
+      "command": "npx",
+      "args": ["@skillkit/mcp-memory"],
+      "env": {
+        "SKILLKIT_AGENT_ID": "cursor"
+      }
+    }
+  }
+}
+```
+
+## Environment Variables
+
+- `SKILLKIT_AGENT_ID` - Agent identifier for memory isolation (default: `mcp-memory-server`)
+- `SKILLKIT_MEMORY_DB_PATH` - Custom database path (default: `~/.skillkit/memory.db`)
+
+## Available Tools
+
+### memory_store
+Store a new memory with semantic embedding.
+
+```js
+memory_store({
+  content: "User prefers TypeScript over JavaScript",
+  category: "preference",
+  tags: ["language", "coding"]
+})
+```
+
+### memory_search
+Semantic search through stored memories.
+
+```js
+memory_search({
+  query: "What programming languages does the user prefer?",
+  limit: 5,
+  threshold: 0.5
+})
+```
+
+### memory_recall
+Recall memories by category, tier, or tags.
+
+```js
+memory_recall({
+  category: "decision",
+  tier: "long",
+  limit: 10
+})
+```
+
+### memory_get
+Get a specific memory by ID.
+
+```js
+memory_get({ id: "memory-uuid" })
+```
+
+### memory_forget
+Delete a memory.
+
+```js
+memory_forget({ id: "memory-uuid" })
+```
+
+### memory_link
+Create relationships between memories.
+
+```js
+memory_link({
+  sourceId: "memory-1",
+  targetId: "memory-2",
+  relationshipType: "supports",
+  strength: 0.8
+})
+```
+
+### memory_reinforce
+Strengthen or weaken a memory. Strong memories get promoted to long-term tier.
+
+```js
+memory_reinforce({
+  id: "memory-uuid",
+  amount: 0.1  // positive to strengthen, negative to weaken
+})
+```
+
+### memory_stats
+Get memory statistics.
+
+```js
+memory_stats({})
+```
+
+## Memory Categories
+
+- `fact` - Factual information
+- `decision` - Decisions made
+- `preference` - User preferences
+- `pattern` - Observed patterns
+- `insight` - Derived insights
+- `reasoning` - Reasoning chains
+
+## Memory Tiers
+
+- `warm` - Recent, frequently accessed memories
+- `long` - Consolidated long-term memories
+
+Memories are automatically promoted from `warm` to `long` based on access count, reinforcement score, and age.
+
+## Resources
+
+The server exposes two resources:
+
+- `memory://stats` - Current memory statistics (JSON)
+- `memory://recent` - 10 most recent memories (JSON)
+
+## License
+
+Apache-2.0

package/dist/index.d.ts

@@ -0,0 +1,38 @@
+import { Server } from '@modelcontextprotocol/sdk/server/index.js';
+
+declare const server: Server<{
+    method: string;
+    params?: {
+        [x: string]: unknown;
+        _meta?: {
+            [x: string]: unknown;
+            progressToken?: string | number | undefined;
+            "io.modelcontextprotocol/related-task"?: {
+                taskId: string;
+            } | undefined;
+        } | undefined;
+    } | undefined;
+}, {
+    method: string;
+    params?: {
+        [x: string]: unknown;
+        _meta?: {
+            [x: string]: unknown;
+            progressToken?: string | number | undefined;
+            "io.modelcontextprotocol/related-task"?: {
+                taskId: string;
+            } | undefined;
+        } | undefined;
+    } | undefined;
+}, {
+    [x: string]: unknown;
+    _meta?: {
+        [x: string]: unknown;
+        progressToken?: string | number | undefined;
+        "io.modelcontextprotocol/related-task"?: {
+            taskId: string;
+        } | undefined;
+    } | undefined;
+}>;
+
+export { server };

package/dist/index.js

@@ -0,0 +1,558 @@
+#!/usr/bin/env node
+
+// src/index.ts
+import { Server } from "@modelcontextprotocol/sdk/server/index.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { fileURLToPath } from "url";
+import {
+  CallToolRequestSchema,
+  ListToolsRequestSchema,
+  ListResourcesRequestSchema,
+  ReadResourceRequestSchema
+} from "@modelcontextprotocol/sdk/types.js";
+import { createMemoryStore } from "@skillkit/memory";
+
+// src/types.ts
+import { z } from "zod";
+var MemoryCategorySchema = z.enum([
+  "fact",
+  "decision",
+  "preference",
+  "pattern",
+  "insight",
+  "reasoning"
+]);
+var MemoryTierSchema = z.enum(["warm", "long"]);
+var RelationshipTypeSchema = z.enum([
+  "related",
+  "derived",
+  "contradicts",
+  "supports"
+]);
+var StoreMemoryInputSchema = z.object({
+  content: z.string().describe("The memory content to store"),
+  category: MemoryCategorySchema.describe("Category of the memory"),
+  tags: z.array(z.string()).optional().describe("Optional tags for organization"),
+  metadata: z.record(z.unknown()).optional().describe("Optional metadata")
+});
+var SearchMemoryInputSchema = z.object({
+  query: z.string().describe("Semantic search query"),
+  category: MemoryCategorySchema.optional().describe("Filter by category"),
+  tier: MemoryTierSchema.optional().describe("Filter by tier (warm or long)"),
+  tags: z.array(z.string()).optional().describe("Filter by tags"),
+  limit: z.number().min(1).max(50).default(10).describe("Maximum results to return"),
+  threshold: z.number().min(0).max(1).default(0.5).describe("Minimum similarity threshold")
+});
+var RecallMemoryInputSchema = z.object({
+  category: MemoryCategorySchema.optional().describe("Filter by category"),
+  tier: MemoryTierSchema.optional().describe("Filter by tier"),
+  tags: z.array(z.string()).optional().describe("Filter by tags"),
+  limit: z.number().min(1).max(100).default(20).describe("Maximum results")
+});
+var ForgetMemoryInputSchema = z.object({
+  id: z.string().describe("Memory ID to delete")
+});
+var LinkMemoriesInputSchema = z.object({
+  sourceId: z.string().describe("Source memory ID"),
+  targetId: z.string().describe("Target memory ID"),
+  relationshipType: RelationshipTypeSchema.describe("Type of relationship"),
+  strength: z.number().min(0).max(1).default(0.5).describe("Relationship strength")
+});
+var GetMemoryInputSchema = z.object({
+  id: z.string().describe("Memory ID to retrieve")
+});
+var ReinforceMemoryInputSchema = z.object({
+  id: z.string().describe("Memory ID to reinforce"),
+  amount: z.number().min(-1).max(1).default(0.1).describe("Reinforcement amount (-1 to 1)")
+});
+
+// src/index.ts
+var AGENT_ID = process.env.SKILLKIT_AGENT_ID || "mcp-memory-server";
+var DB_PATH = process.env.SKILLKIT_MEMORY_DB_PATH;
+var memoryStore = null;
+var memoryStoreInit = null;
+async function getMemoryStore() {
+  if (memoryStore) {
+    return memoryStore;
+  }
+  if (!memoryStoreInit) {
+    memoryStoreInit = createMemoryStore(AGENT_ID, DB_PATH);
+  }
+  try {
+    memoryStore = await memoryStoreInit;
+    return memoryStore;
+  } catch (error) {
+    memoryStoreInit = null;
+    throw error;
+  }
+}
+var server = new Server(
+  {
+    name: "skillkit-memory-server",
+    version: "1.7.11"
+  },
+  {
+    capabilities: {
+      tools: {},
+      resources: {}
+    }
+  }
+);
+server.setRequestHandler(ListToolsRequestSchema, async () => {
+  return {
+    tools: [
+      {
+        name: "memory_store",
+        description: "Store a new memory with semantic embedding for later retrieval. Memories are categorized and can be tagged for organization.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            content: { type: "string", description: "The memory content to store" },
+            category: {
+              type: "string",
+              enum: ["fact", "decision", "preference", "pattern", "insight", "reasoning"],
+              description: "Category of the memory"
+            },
+            tags: {
+              type: "array",
+              items: { type: "string" },
+              description: "Optional tags for organization"
+            },
+            metadata: {
+              type: "object",
+              description: "Optional metadata"
+            }
+          },
+          required: ["content", "category"]
+        }
+      },
+      {
+        name: "memory_search",
+        description: "Semantic search through stored memories. Returns memories most similar to the query.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            query: { type: "string", description: "Semantic search query" },
+            category: {
+              type: "string",
+              enum: ["fact", "decision", "preference", "pattern", "insight", "reasoning"],
+              description: "Filter by category"
+            },
+            tier: {
+              type: "string",
+              enum: ["warm", "long"],
+              description: "Filter by tier"
+            },
+            tags: {
+              type: "array",
+              items: { type: "string" },
+              description: "Filter by tags"
+            },
+            limit: {
+              type: "number",
+              minimum: 1,
+              maximum: 50,
+              default: 10,
+              description: "Maximum results"
+            },
+            threshold: {
+              type: "number",
+              minimum: 0,
+              maximum: 1,
+              default: 0.5,
+              description: "Minimum similarity threshold"
+            }
+          },
+          required: ["query"]
+        }
+      },
+      {
+        name: "memory_recall",
+        description: "Recall memories by category, tier, or tags without semantic search.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            category: {
+              type: "string",
+              enum: ["fact", "decision", "preference", "pattern", "insight", "reasoning"],
+              description: "Filter by category"
+            },
+            tier: {
+              type: "string",
+              enum: ["warm", "long"],
+              description: "Filter by tier"
+            },
+            tags: {
+              type: "array",
+              items: { type: "string" },
+              description: "Filter by tags"
+            },
+            limit: {
+              type: "number",
+              minimum: 1,
+              maximum: 100,
+              default: 20,
+              description: "Maximum results"
+            }
+          }
+        }
+      },
+      {
+        name: "memory_get",
+        description: "Get a specific memory by its ID.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            id: { type: "string", description: "Memory ID" }
+          },
+          required: ["id"]
+        }
+      },
+      {
+        name: "memory_forget",
+        description: "Delete a memory by its ID.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            id: { type: "string", description: "Memory ID to delete" }
+          },
+          required: ["id"]
+        }
+      },
+      {
+        name: "memory_link",
+        description: "Create a relationship link between two memories.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            sourceId: { type: "string", description: "Source memory ID" },
+            targetId: { type: "string", description: "Target memory ID" },
+            relationshipType: {
+              type: "string",
+              enum: ["related", "derived", "contradicts", "supports"],
+              description: "Type of relationship"
+            },
+            strength: {
+              type: "number",
+              minimum: 0,
+              maximum: 1,
+              default: 0.5,
+              description: "Relationship strength"
+            }
+          },
+          required: ["sourceId", "targetId", "relationshipType"]
+        }
+      },
+      {
+        name: "memory_reinforce",
+        description: "Reinforce or weaken a memory. Positive values strengthen, negative weaken. Strong memories get promoted to long-term tier.",
+        inputSchema: {
+          type: "object",
+          properties: {
+            id: { type: "string", description: "Memory ID" },
+            amount: {
+              type: "number",
+              minimum: -1,
+              maximum: 1,
+              default: 0.1,
+              description: "Reinforcement amount"
+            }
+          },
+          required: ["id"]
+        }
+      },
+      {
+        name: "memory_stats",
+        description: "Get statistics about stored memories.",
+        inputSchema: {
+          type: "object",
+          properties: {}
+        }
+      }
+    ]
+  };
+});
+server.setRequestHandler(CallToolRequestSchema, async (request) => {
+  const { name, arguments: args } = request.params;
+  const store = await getMemoryStore();
+  try {
+    switch (name) {
+      case "memory_store": {
+        const input = StoreMemoryInputSchema.parse(args);
+        const memory = await store.create({
+          agentId: AGENT_ID,
+          content: input.content,
+          category: input.category,
+          tags: input.tags,
+          metadata: input.metadata
+        });
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Memory stored successfully.
+
+ID: ${memory.id}
+Category: ${memory.category}
+Tier: ${memory.tier}
+Tags: ${memory.tags.join(", ") || "none"}`
+            }
+          ]
+        };
+      }
+      case "memory_search": {
+        const input = SearchMemoryInputSchema.parse(args);
+        const results = await store.semanticSearch(input.query, {
+          agentId: AGENT_ID,
+          category: input.category,
+          tier: input.tier,
+          tags: input.tags,
+          limit: input.limit,
+          threshold: input.threshold
+        });
+        if (results.length === 0) {
+          return {
+            content: [{ type: "text", text: "No memories found matching your query." }]
+          };
+        }
+        const formatted = results.map(
+          (r, i) => `${i + 1}. [${r.memory.category}] (score: ${r.score.toFixed(3)})
+   ID: ${r.memory.id}
+   ${r.memory.content}
+   Tags: ${r.memory.tags.join(", ") || "none"}`
+        ).join("\n\n");
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Found ${results.length} memories:
+
+${formatted}`
+            }
+          ]
+        };
+      }
+      case "memory_recall": {
+        const input = RecallMemoryInputSchema.parse(args);
+        let memories = await store.list(AGENT_ID, input.limit ?? 20);
+        if (input.category) {
+          memories = memories.filter((m) => m.category === input.category);
+        }
+        if (input.tier) {
+          memories = memories.filter((m) => m.tier === input.tier);
+        }
+        if (input.tags && input.tags.length > 0) {
+          memories = memories.filter(
+            (m) => input.tags.some((tag) => m.tags.includes(tag))
+          );
+        }
+        if (memories.length === 0) {
+          return {
+            content: [{ type: "text", text: "No memories found with the specified filters." }]
+          };
+        }
+        const formatted = memories.map(
+          (m, i) => `${i + 1}. [${m.category}] (${m.tier})
+   ID: ${m.id}
+   ${m.content}
+   Score: ${m.reinforcementScore.toFixed(2)} | Access: ${m.accessCount}`
+        ).join("\n\n");
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Recalled ${memories.length} memories:
+
+${formatted}`
+            }
+          ]
+        };
+      }
+      case "memory_get": {
+        const input = GetMemoryInputSchema.parse(args);
+        const memory = await store.get(input.id);
+        if (!memory) {
+          return {
+            content: [{ type: "text", text: `Memory not found: ${input.id}` }],
+            isError: true
+          };
+        }
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Memory Details:
+
+ID: ${memory.id}
+Category: ${memory.category}
+Tier: ${memory.tier}
+Content: ${memory.content}
+Tags: ${memory.tags.join(", ") || "none"}
+Reinforcement: ${memory.reinforcementScore.toFixed(2)}
+Access Count: ${memory.accessCount}
+Created: ${memory.createdAt}
+Last Accessed: ${memory.lastAccessedAt}`
+            }
+          ]
+        };
+      }
+      case "memory_forget": {
+        const input = ForgetMemoryInputSchema.parse(args);
+        const existing = await store.get(input.id);
+        if (!existing) {
+          return {
+            content: [{ type: "text", text: `Memory not found: ${input.id}` }],
+            isError: true
+          };
+        }
+        await store.delete(input.id);
+        return {
+          content: [{ type: "text", text: `Memory deleted: ${input.id}` }]
+        };
+      }
+      case "memory_link": {
+        const input = LinkMemoriesInputSchema.parse(args);
+        const link = await store.link(
+          input.sourceId,
+          input.targetId,
+          input.relationshipType,
+          input.strength
+        );
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Link created:
+
+ID: ${link.id}
+${input.sourceId} --[${input.relationshipType}]--> ${input.targetId}
+Strength: ${link.strength}`
+            }
+          ]
+        };
+      }
+      case "memory_reinforce": {
+        const input = ReinforceMemoryInputSchema.parse(args);
+        const existing = await store.get(input.id);
+        if (!existing) {
+          return {
+            content: [{ type: "text", text: `Memory not found: ${input.id}` }],
+            isError: true
+          };
+        }
+        const memory = await store.reinforce(input.id, input.amount ?? 0.1);
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Memory reinforced:
+
+ID: ${memory.id}
+New Score: ${memory.reinforcementScore.toFixed(2)}
+Tier: ${memory.tier}`
+            }
+          ]
+        };
+      }
+      case "memory_stats": {
+        const stats = await store.getStats(AGENT_ID);
+        const categoryBreakdown = Object.entries(stats.byCategory).map(([cat, count]) => `  ${cat}: ${count}`).join("\n");
+        const tierBreakdown = Object.entries(stats.byTier).map(([tier, count]) => `  ${tier}: ${count}`).join("\n");
+        return {
+          content: [
+            {
+              type: "text",
+              text: `Memory Statistics:
+
+Total Memories: ${stats.totalMemories}
+Average Reinforcement: ${stats.avgReinforcementScore.toFixed(2)}
+
+By Category:
+${categoryBreakdown}
+
+By Tier:
+${tierBreakdown}
+
+Oldest: ${stats.oldestMemory || "N/A"}
+Newest: ${stats.newestMemory || "N/A"}`
+            }
+          ]
+        };
+      }
+      default:
+        return {
+          content: [{ type: "text", text: `Unknown tool: ${name}` }],
+          isError: true
+        };
+    }
+  } catch (error) {
+    const message = error instanceof Error ? error.message : "Unknown error";
+    return {
+      content: [{ type: "text", text: `Error: ${message}` }],
+      isError: true
+    };
+  }
+});
+server.setRequestHandler(ListResourcesRequestSchema, async () => {
+  return {
+    resources: [
+      {
+        uri: "memory://stats",
+        name: "Memory Statistics",
+        description: "Current memory store statistics",
+        mimeType: "application/json"
+      },
+      {
+        uri: "memory://recent",
+        name: "Recent Memories",
+        description: "Most recently accessed memories",
+        mimeType: "application/json"
+      }
+    ]
+  };
+});
+server.setRequestHandler(ReadResourceRequestSchema, async (request) => {
+  const { uri } = request.params;
+  const store = await getMemoryStore();
+  if (uri === "memory://stats") {
+    const stats = await store.getStats(AGENT_ID);
+    return {
+      contents: [
+        {
+          uri,
+          mimeType: "application/json",
+          text: JSON.stringify(stats, null, 2)
+        }
+      ]
+    };
+  }
+  if (uri === "memory://recent") {
+    const memories = await store.list(AGENT_ID, 10);
+    return {
+      contents: [
+        {
+          uri,
+          mimeType: "application/json",
+          text: JSON.stringify(memories, null, 2)
+        }
+      ]
+    };
+  }
+  throw new Error(`Unknown resource: ${uri}`);
+});
+async function main() {
+  const transport = new StdioServerTransport();
+  await server.connect(transport);
+  console.error("SkillKit Memory MCP Server running on stdio");
+}
+var isMain = process.argv[1] === fileURLToPath(import.meta.url);
+if (isMain) {
+  main().catch((error) => {
+    console.error("Fatal error:", error);
+    process.exit(1);
+  });
+}
+export {
+  server
+};
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/types.ts"],"sourcesContent":["import { Server } from '@modelcontextprotocol/sdk/server/index.js';\nimport { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';\nimport { fileURLToPath } from 'node:url';\nimport {\n  CallToolRequestSchema,\n  ListToolsRequestSchema,\n  ListResourcesRequestSchema,\n  ReadResourceRequestSchema,\n} from '@modelcontextprotocol/sdk/types.js';\nimport { createMemoryStore, type MemoryStore } from '@skillkit/memory';\nimport {\n  StoreMemoryInputSchema,\n  SearchMemoryInputSchema,\n  RecallMemoryInputSchema,\n  ForgetMemoryInputSchema,\n  LinkMemoriesInputSchema,\n  GetMemoryInputSchema,\n  ReinforceMemoryInputSchema,\n} from './types.js';\n\nconst AGENT_ID = process.env.SKILLKIT_AGENT_ID || 'mcp-memory-server';\nconst DB_PATH = process.env.SKILLKIT_MEMORY_DB_PATH;\n\nlet memoryStore: MemoryStore | null = null;\nlet memoryStoreInit: Promise<MemoryStore> | null = null;\n\nasync function getMemoryStore(): Promise<MemoryStore> {\n  if (memoryStore) {\n    return memoryStore;\n  }\n  if (!memoryStoreInit) {\n    memoryStoreInit = createMemoryStore(AGENT_ID, DB_PATH);\n  }\n  try {\n    memoryStore = await memoryStoreInit;\n    return memoryStore;\n  } catch (error) {\n    memoryStoreInit = null;\n    throw error;\n  }\n}\n\nconst server = new Server(\n  {\n    name: 'skillkit-memory-server',\n    version: '1.7.11',\n  },\n  {\n    capabilities: {\n      tools: {},\n      resources: {},\n    },\n  }\n);\n\nserver.setRequestHandler(ListToolsRequestSchema, async () => {\n  return {\n    tools: [\n      {\n        name: 'memory_store',\n        description: 'Store a new memory with semantic embedding for later retrieval. Memories are categorized and can be tagged for organization.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            content: { type: 'string', description: 'The memory content to store' },\n            category: {\n              type: 'string',\n              enum: ['fact', 'decision', 'preference', 'pattern', 'insight', 'reasoning'],\n              description: 'Category of the memory',\n            },\n            tags: {\n              type: 'array',\n              items: { type: 'string' },\n              description: 'Optional tags for organization',\n            },\n            metadata: {\n              type: 'object',\n              description: 'Optional metadata',\n            },\n          },\n          required: ['content', 'category'],\n        },\n      },\n      {\n        name: 'memory_search',\n        description: 'Semantic search through stored memories. Returns memories most similar to the query.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            query: { type: 'string', description: 'Semantic search query' },\n            category: {\n              type: 'string',\n              enum: ['fact', 'decision', 'preference', 'pattern', 'insight', 'reasoning'],\n              description: 'Filter by category',\n            },\n            tier: {\n              type: 'string',\n              enum: ['warm', 'long'],\n              description: 'Filter by tier',\n            },\n            tags: {\n              type: 'array',\n              items: { type: 'string' },\n              description: 'Filter by tags',\n            },\n            limit: {\n              type: 'number',\n              minimum: 1,\n              maximum: 50,\n              default: 10,\n              description: 'Maximum results',\n            },\n            threshold: {\n              type: 'number',\n              minimum: 0,\n              maximum: 1,\n              default: 0.5,\n              description: 'Minimum similarity threshold',\n            },\n          },\n          required: ['query'],\n        },\n      },\n      {\n        name: 'memory_recall',\n        description: 'Recall memories by category, tier, or tags without semantic search.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            category: {\n              type: 'string',\n              enum: ['fact', 'decision', 'preference', 'pattern', 'insight', 'reasoning'],\n              description: 'Filter by category',\n            },\n            tier: {\n              type: 'string',\n              enum: ['warm', 'long'],\n              description: 'Filter by tier',\n            },\n            tags: {\n              type: 'array',\n              items: { type: 'string' },\n              description: 'Filter by tags',\n            },\n            limit: {\n              type: 'number',\n              minimum: 1,\n              maximum: 100,\n              default: 20,\n              description: 'Maximum results',\n            },\n          },\n        },\n      },\n      {\n        name: 'memory_get',\n        description: 'Get a specific memory by its ID.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            id: { type: 'string', description: 'Memory ID' },\n          },\n          required: ['id'],\n        },\n      },\n      {\n        name: 'memory_forget',\n        description: 'Delete a memory by its ID.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            id: { type: 'string', description: 'Memory ID to delete' },\n          },\n          required: ['id'],\n        },\n      },\n      {\n        name: 'memory_link',\n        description: 'Create a relationship link between two memories.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            sourceId: { type: 'string', description: 'Source memory ID' },\n            targetId: { type: 'string', description: 'Target memory ID' },\n            relationshipType: {\n              type: 'string',\n              enum: ['related', 'derived', 'contradicts', 'supports'],\n              description: 'Type of relationship',\n            },\n            strength: {\n              type: 'number',\n              minimum: 0,\n              maximum: 1,\n              default: 0.5,\n              description: 'Relationship strength',\n            },\n          },\n          required: ['sourceId', 'targetId', 'relationshipType'],\n        },\n      },\n      {\n        name: 'memory_reinforce',\n        description: 'Reinforce or weaken a memory. Positive values strengthen, negative weaken. Strong memories get promoted to long-term tier.',\n        inputSchema: {\n          type: 'object',\n          properties: {\n            id: { type: 'string', description: 'Memory ID' },\n            amount: {\n              type: 'number',\n              minimum: -1,\n              maximum: 1,\n              default: 0.1,\n              description: 'Reinforcement amount',\n            },\n          },\n          required: ['id'],\n        },\n      },\n      {\n        name: 'memory_stats',\n        description: 'Get statistics about stored memories.',\n        inputSchema: {\n          type: 'object',\n          properties: {},\n        },\n      },\n    ],\n  };\n});\n\nserver.setRequestHandler(CallToolRequestSchema, async (request) => {\n  const { name, arguments: args } = request.params;\n  const store = await getMemoryStore();\n\n  try {\n    switch (name) {\n      case 'memory_store': {\n        const input = StoreMemoryInputSchema.parse(args);\n        const memory = await store.create({\n          agentId: AGENT_ID,\n          content: input.content,\n          category: input.category,\n          tags: input.tags,\n          metadata: input.metadata,\n        });\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Memory stored successfully.\\n\\nID: ${memory.id}\\nCategory: ${memory.category}\\nTier: ${memory.tier}\\nTags: ${memory.tags.join(', ') || 'none'}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_search': {\n        const input = SearchMemoryInputSchema.parse(args);\n        const results = await store.semanticSearch(input.query, {\n          agentId: AGENT_ID,\n          category: input.category,\n          tier: input.tier,\n          tags: input.tags,\n          limit: input.limit,\n          threshold: input.threshold,\n        });\n\n        if (results.length === 0) {\n          return {\n            content: [{ type: 'text', text: 'No memories found matching your query.' }],\n          };\n        }\n\n        const formatted = results\n          .map(\n            (r, i) =>\n              `${i + 1}. [${r.memory.category}] (score: ${r.score.toFixed(3)})\\n   ID: ${r.memory.id}\\n   ${r.memory.content}\\n   Tags: ${r.memory.tags.join(', ') || 'none'}`\n          )\n          .join('\\n\\n');\n\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Found ${results.length} memories:\\n\\n${formatted}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_recall': {\n        const input = RecallMemoryInputSchema.parse(args);\n        let memories = await store.list(AGENT_ID, input.limit ?? 20);\n\n        if (input.category) {\n          memories = memories.filter(m => m.category === input.category);\n        }\n        if (input.tier) {\n          memories = memories.filter(m => m.tier === input.tier);\n        }\n        if (input.tags && input.tags.length > 0) {\n          memories = memories.filter(m =>\n            input.tags!.some(tag => m.tags.includes(tag))\n          );\n        }\n\n        if (memories.length === 0) {\n          return {\n            content: [{ type: 'text', text: 'No memories found with the specified filters.' }],\n          };\n        }\n\n        const formatted = memories\n          .map(\n            (m, i) =>\n              `${i + 1}. [${m.category}] (${m.tier})\\n   ID: ${m.id}\\n   ${m.content}\\n   Score: ${m.reinforcementScore.toFixed(2)} | Access: ${m.accessCount}`\n          )\n          .join('\\n\\n');\n\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Recalled ${memories.length} memories:\\n\\n${formatted}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_get': {\n        const input = GetMemoryInputSchema.parse(args);\n        const memory = await store.get(input.id);\n\n        if (!memory) {\n          return {\n            content: [{ type: 'text', text: `Memory not found: ${input.id}` }],\n            isError: true,\n          };\n        }\n\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Memory Details:\\n\\nID: ${memory.id}\\nCategory: ${memory.category}\\nTier: ${memory.tier}\\nContent: ${memory.content}\\nTags: ${memory.tags.join(', ') || 'none'}\\nReinforcement: ${memory.reinforcementScore.toFixed(2)}\\nAccess Count: ${memory.accessCount}\\nCreated: ${memory.createdAt}\\nLast Accessed: ${memory.lastAccessedAt}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_forget': {\n        const input = ForgetMemoryInputSchema.parse(args);\n        const existing = await store.get(input.id);\n\n        if (!existing) {\n          return {\n            content: [{ type: 'text', text: `Memory not found: ${input.id}` }],\n            isError: true,\n          };\n        }\n\n        await store.delete(input.id);\n\n        return {\n          content: [{ type: 'text', text: `Memory deleted: ${input.id}` }],\n        };\n      }\n\n      case 'memory_link': {\n        const input = LinkMemoriesInputSchema.parse(args);\n        const link = await store.link(\n          input.sourceId,\n          input.targetId,\n          input.relationshipType,\n          input.strength\n        );\n\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Link created:\\n\\nID: ${link.id}\\n${input.sourceId} --[${input.relationshipType}]--> ${input.targetId}\\nStrength: ${link.strength}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_reinforce': {\n        const input = ReinforceMemoryInputSchema.parse(args);\n        const existing = await store.get(input.id);\n        if (!existing) {\n          return {\n            content: [{ type: 'text', text: `Memory not found: ${input.id}` }],\n            isError: true,\n          };\n        }\n        const memory = await store.reinforce(input.id, input.amount ?? 0.1);\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Memory reinforced:\\n\\nID: ${memory.id}\\nNew Score: ${memory.reinforcementScore.toFixed(2)}\\nTier: ${memory.tier}`,\n            },\n          ],\n        };\n      }\n\n      case 'memory_stats': {\n        const stats = await store.getStats(AGENT_ID);\n\n        const categoryBreakdown = Object.entries(stats.byCategory)\n          .map(([cat, count]) => `  ${cat}: ${count}`)\n          .join('\\n');\n\n        const tierBreakdown = Object.entries(stats.byTier)\n          .map(([tier, count]) => `  ${tier}: ${count}`)\n          .join('\\n');\n\n        return {\n          content: [\n            {\n              type: 'text',\n              text: `Memory Statistics:\\n\\nTotal Memories: ${stats.totalMemories}\\nAverage Reinforcement: ${stats.avgReinforcementScore.toFixed(2)}\\n\\nBy Category:\\n${categoryBreakdown}\\n\\nBy Tier:\\n${tierBreakdown}\\n\\nOldest: ${stats.oldestMemory || 'N/A'}\\nNewest: ${stats.newestMemory || 'N/A'}`,\n            },\n          ],\n        };\n      }\n\n      default:\n        return {\n          content: [{ type: 'text', text: `Unknown tool: ${name}` }],\n          isError: true,\n        };\n    }\n  } catch (error) {\n    const message = error instanceof Error ? error.message : 'Unknown error';\n    return {\n      content: [{ type: 'text', text: `Error: ${message}` }],\n      isError: true,\n    };\n  }\n});\n\nserver.setRequestHandler(ListResourcesRequestSchema, async () => {\n  return {\n    resources: [\n      {\n        uri: 'memory://stats',\n        name: 'Memory Statistics',\n        description: 'Current memory store statistics',\n        mimeType: 'application/json',\n      },\n      {\n        uri: 'memory://recent',\n        name: 'Recent Memories',\n        description: 'Most recently accessed memories',\n        mimeType: 'application/json',\n      },\n    ],\n  };\n});\n\nserver.setRequestHandler(ReadResourceRequestSchema, async (request) => {\n  const { uri } = request.params;\n  const store = await getMemoryStore();\n\n  if (uri === 'memory://stats') {\n    const stats = await store.getStats(AGENT_ID);\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: 'application/json',\n          text: JSON.stringify(stats, null, 2),\n        },\n      ],\n    };\n  }\n\n  if (uri === 'memory://recent') {\n    const memories = await store.list(AGENT_ID, 10);\n    return {\n      contents: [\n        {\n          uri,\n          mimeType: 'application/json',\n          text: JSON.stringify(memories, null, 2),\n        },\n      ],\n    };\n  }\n\n  throw new Error(`Unknown resource: ${uri}`);\n});\n\nasync function main() {\n  const transport = new StdioServerTransport();\n  await server.connect(transport);\n  console.error('SkillKit Memory MCP Server running on stdio');\n}\n\nconst isMain = process.argv[1] === fileURLToPath(import.meta.url);\nif (isMain) {\n  main().catch((error) => {\n    console.error('Fatal error:', error);\n    process.exit(1);\n  });\n}\n\nexport { server };\n","import { z } from 'zod';\n\nexport const MemoryCategorySchema = z.enum([\n  'fact',\n  'decision',\n  'preference',\n  'pattern',\n  'insight',\n  'reasoning',\n]);\n\nexport const MemoryTierSchema = z.enum(['warm', 'long']);\n\nexport const RelationshipTypeSchema = z.enum([\n  'related',\n  'derived',\n  'contradicts',\n  'supports',\n]);\n\nexport const StoreMemoryInputSchema = z.object({\n  content: z.string().describe('The memory content to store'),\n  category: MemoryCategorySchema.describe('Category of the memory'),\n  tags: z.array(z.string()).optional().describe('Optional tags for organization'),\n  metadata: z.record(z.unknown()).optional().describe('Optional metadata'),\n});\n\nexport const SearchMemoryInputSchema = z.object({\n  query: z.string().describe('Semantic search query'),\n  category: MemoryCategorySchema.optional().describe('Filter by category'),\n  tier: MemoryTierSchema.optional().describe('Filter by tier (warm or long)'),\n  tags: z.array(z.string()).optional().describe('Filter by tags'),\n  limit: z.number().min(1).max(50).default(10).describe('Maximum results to return'),\n  threshold: z.number().min(0).max(1).default(0.5).describe('Minimum similarity threshold'),\n});\n\nexport const RecallMemoryInputSchema = z.object({\n  category: MemoryCategorySchema.optional().describe('Filter by category'),\n  tier: MemoryTierSchema.optional().describe('Filter by tier'),\n  tags: z.array(z.string()).optional().describe('Filter by tags'),\n  limit: z.number().min(1).max(100).default(20).describe('Maximum results'),\n});\n\nexport const ForgetMemoryInputSchema = z.object({\n  id: z.string().describe('Memory ID to delete'),\n});\n\nexport const LinkMemoriesInputSchema = z.object({\n  sourceId: z.string().describe('Source memory ID'),\n  targetId: z.string().describe('Target memory ID'),\n  relationshipType: RelationshipTypeSchema.describe('Type of relationship'),\n  strength: z.number().min(0).max(1).default(0.5).describe('Relationship strength'),\n});\n\nexport const GetMemoryInputSchema = z.object({\n  id: z.string().describe('Memory ID to retrieve'),\n});\n\nexport const ReinforceMemoryInputSchema = z.object({\n  id: z.string().describe('Memory ID to reinforce'),\n  amount: z.number().min(-1).max(1).default(0.1).describe('Reinforcement amount (-1 to 1)'),\n});\n\nexport type StoreMemoryInput = z.infer<typeof StoreMemoryInputSchema>;\nexport type SearchMemoryInput = z.infer<typeof SearchMemoryInputSchema>;\nexport type RecallMemoryInput = z.infer<typeof RecallMemoryInputSchema>;\nexport type ForgetMemoryInput = z.infer<typeof ForgetMemoryInputSchema>;\nexport type LinkMemoriesInput = z.infer<typeof LinkMemoriesInputSchema>;\nexport type GetMemoryInput = z.infer<typeof GetMemoryInputSchema>;\nexport type ReinforceMemoryInput = z.infer<typeof ReinforceMemoryInputSchema>;\n"],"mappings":";;;AAAA,SAAS,cAAc;AACvB,SAAS,4BAA4B;AACrC,SAAS,qBAAqB;AAC9B;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,yBAA2C;;;ACTpD,SAAS,SAAS;AAEX,IAAM,uBAAuB,EAAE,KAAK;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,mBAAmB,EAAE,KAAK,CAAC,QAAQ,MAAM,CAAC;AAEhD,IAAM,yBAAyB,EAAE,KAAK;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,yBAAyB,EAAE,OAAO;AAAA,EAC7C,SAAS,EAAE,OAAO,EAAE,SAAS,6BAA6B;AAAA,EAC1D,UAAU,qBAAqB,SAAS,wBAAwB;AAAA,EAChE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS,gCAAgC;AAAA,EAC9E,UAAU,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,SAAS,EAAE,SAAS,mBAAmB;AACzE,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,OAAO,EAAE,OAAO,EAAE,SAAS,uBAAuB;AAAA,EAClD,UAAU,qBAAqB,SAAS,EAAE,SAAS,oBAAoB;AAAA,EACvE,MAAM,iBAAiB,SAAS,EAAE,SAAS,+BAA+B;AAAA,EAC1E,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS,gBAAgB;AAAA,EAC9D,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,EAAE,SAAS,2BAA2B;AAAA,EACjF,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,EAAE,SAAS,8BAA8B;AAC1F,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,UAAU,qBAAqB,SAAS,EAAE,SAAS,oBAAoB;AAAA,EACvE,MAAM,iBAAiB,SAAS,EAAE,SAAS,gBAAgB;AAAA,EAC3D,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS,gBAAgB;AAAA,EAC9D,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,QAAQ,EAAE,EAAE,SAAS,iBAAiB;AAC1E,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,IAAI,EAAE,OAAO,EAAE,SAAS,qBAAqB;AAC/C,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,UAAU,EAAE,OAAO,EAAE,SAAS,kBAAkB;AAAA,EAChD,UAAU,EAAE,OAAO,EAAE,SAAS,kBAAkB;AAAA,EAChD,kBAAkB,uBAAuB,SAAS,sBAAsB;AAAA,EACxE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,EAAE,SAAS,uBAAuB;AAClF,CAAC;AAEM,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,IAAI,EAAE,OAAO,EAAE,SAAS,uBAAuB;AACjD,CAAC;AAEM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,IAAI,EAAE,OAAO,EAAE,SAAS,wBAAwB;AAAA,EAChD,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,EAAE,SAAS,gCAAgC;AAC1F,CAAC;;;ADzCD,IAAM,WAAW,QAAQ,IAAI,qBAAqB;AAClD,IAAM,UAAU,QAAQ,IAAI;AAE5B,IAAI,cAAkC;AACtC,IAAI,kBAA+C;AAEnD,eAAe,iBAAuC;AACpD,MAAI,aAAa;AACf,WAAO;AAAA,EACT;AACA,MAAI,CAAC,iBAAiB;AACpB,sBAAkB,kBAAkB,UAAU,OAAO;AAAA,EACvD;AACA,MAAI;AACF,kBAAc,MAAM;AACpB,WAAO;AAAA,EACT,SAAS,OAAO;AACd,sBAAkB;AAClB,UAAM;AAAA,EACR;AACF;AAEA,IAAM,SAAS,IAAI;AAAA,EACjB;AAAA,IACE,MAAM;AAAA,IACN,SAAS;AAAA,EACX;AAAA,EACA;AAAA,IACE,cAAc;AAAA,MACZ,OAAO,CAAC;AAAA,MACR,WAAW,CAAC;AAAA,IACd;AAAA,EACF;AACF;AAEA,OAAO,kBAAkB,wBAAwB,YAAY;AAC3D,SAAO;AAAA,IACL,OAAO;AAAA,MACL;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,SAAS,EAAE,MAAM,UAAU,aAAa,8BAA8B;AAAA,YACtE,UAAU;AAAA,cACR,MAAM;AAAA,cACN,MAAM,CAAC,QAAQ,YAAY,cAAc,WAAW,WAAW,WAAW;AAAA,cAC1E,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,OAAO,EAAE,MAAM,SAAS;AAAA,cACxB,aAAa;AAAA,YACf;AAAA,YACA,UAAU;AAAA,cACR,MAAM;AAAA,cACN,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,WAAW,UAAU;AAAA,QAClC;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,OAAO,EAAE,MAAM,UAAU,aAAa,wBAAwB;AAAA,YAC9D,UAAU;AAAA,cACR,MAAM;AAAA,cACN,MAAM,CAAC,QAAQ,YAAY,cAAc,WAAW,WAAW,WAAW;AAAA,cAC1E,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,MAAM,CAAC,QAAQ,MAAM;AAAA,cACrB,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,OAAO,EAAE,MAAM,SAAS;AAAA,cACxB,aAAa;AAAA,YACf;AAAA,YACA,OAAO;AAAA,cACL,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,cACT,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,YACA,WAAW;AAAA,cACT,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,cACT,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,OAAO;AAAA,QACpB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,UAAU;AAAA,cACR,MAAM;AAAA,cACN,MAAM,CAAC,QAAQ,YAAY,cAAc,WAAW,WAAW,WAAW;AAAA,cAC1E,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,MAAM,CAAC,QAAQ,MAAM;AAAA,cACrB,aAAa;AAAA,YACf;AAAA,YACA,MAAM;AAAA,cACJ,MAAM;AAAA,cACN,OAAO,EAAE,MAAM,SAAS;AAAA,cACxB,aAAa;AAAA,YACf;AAAA,YACA,OAAO;AAAA,cACL,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,cACT,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,IAAI,EAAE,MAAM,UAAU,aAAa,YAAY;AAAA,UACjD;AAAA,UACA,UAAU,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,IAAI,EAAE,MAAM,UAAU,aAAa,sBAAsB;AAAA,UAC3D;AAAA,UACA,UAAU,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,UAAU,EAAE,MAAM,UAAU,aAAa,mBAAmB;AAAA,YAC5D,UAAU,EAAE,MAAM,UAAU,aAAa,mBAAmB;AAAA,YAC5D,kBAAkB;AAAA,cAChB,MAAM;AAAA,cACN,MAAM,CAAC,WAAW,WAAW,eAAe,UAAU;AAAA,cACtD,aAAa;AAAA,YACf;AAAA,YACA,UAAU;AAAA,cACR,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,cACT,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,YAAY,YAAY,kBAAkB;AAAA,QACvD;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY;AAAA,YACV,IAAI,EAAE,MAAM,UAAU,aAAa,YAAY;AAAA,YAC/C,QAAQ;AAAA,cACN,MAAM;AAAA,cACN,SAAS;AAAA,cACT,SAAS;AAAA,cACT,SAAS;AAAA,cACT,aAAa;AAAA,YACf;AAAA,UACF;AAAA,UACA,UAAU,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,aAAa;AAAA,QACb,aAAa;AAAA,UACX,MAAM;AAAA,UACN,YAAY,CAAC;AAAA,QACf;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF,CAAC;AAED,OAAO,kBAAkB,uBAAuB,OAAO,YAAY;AACjE,QAAM,EAAE,MAAM,WAAW,KAAK,IAAI,QAAQ;AAC1C,QAAM,QAAQ,MAAM,eAAe;AAEnC,MAAI;AACF,YAAQ,MAAM;AAAA,MACZ,KAAK,gBAAgB;AACnB,cAAM,QAAQ,uBAAuB,MAAM,IAAI;AAC/C,cAAM,SAAS,MAAM,MAAM,OAAO;AAAA,UAChC,SAAS;AAAA,UACT,SAAS,MAAM;AAAA,UACf,UAAU,MAAM;AAAA,UAChB,MAAM,MAAM;AAAA,UACZ,UAAU,MAAM;AAAA,QAClB,CAAC;AACD,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA;AAAA,MAAsC,OAAO,EAAE;AAAA,YAAe,OAAO,QAAQ;AAAA,QAAW,OAAO,IAAI;AAAA,QAAW,OAAO,KAAK,KAAK,IAAI,KAAK,MAAM;AAAA,YACtJ;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,iBAAiB;AACpB,cAAM,QAAQ,wBAAwB,MAAM,IAAI;AAChD,cAAM,UAAU,MAAM,MAAM,eAAe,MAAM,OAAO;AAAA,UACtD,SAAS;AAAA,UACT,UAAU,MAAM;AAAA,UAChB,MAAM,MAAM;AAAA,UACZ,MAAM,MAAM;AAAA,UACZ,OAAO,MAAM;AAAA,UACb,WAAW,MAAM;AAAA,QACnB,CAAC;AAED,YAAI,QAAQ,WAAW,GAAG;AACxB,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,yCAAyC,CAAC;AAAA,UAC5E;AAAA,QACF;AAEA,cAAM,YAAY,QACf;AAAA,UACC,CAAC,GAAG,MACF,GAAG,IAAI,CAAC,MAAM,EAAE,OAAO,QAAQ,aAAa,EAAE,MAAM,QAAQ,CAAC,CAAC;AAAA,SAAa,EAAE,OAAO,EAAE;AAAA,KAAQ,EAAE,OAAO,OAAO;AAAA,WAAc,EAAE,OAAO,KAAK,KAAK,IAAI,KAAK,MAAM;AAAA,QAClK,EACC,KAAK,MAAM;AAEd,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM,SAAS,QAAQ,MAAM;AAAA;AAAA,EAAiB,SAAS;AAAA,YACzD;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,iBAAiB;AACpB,cAAM,QAAQ,wBAAwB,MAAM,IAAI;AAChD,YAAI,WAAW,MAAM,MAAM,KAAK,UAAU,MAAM,SAAS,EAAE;AAE3D,YAAI,MAAM,UAAU;AAClB,qBAAW,SAAS,OAAO,OAAK,EAAE,aAAa,MAAM,QAAQ;AAAA,QAC/D;AACA,YAAI,MAAM,MAAM;AACd,qBAAW,SAAS,OAAO,OAAK,EAAE,SAAS,MAAM,IAAI;AAAA,QACvD;AACA,YAAI,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;AACvC,qBAAW,SAAS;AAAA,YAAO,OACzB,MAAM,KAAM,KAAK,SAAO,EAAE,KAAK,SAAS,GAAG,CAAC;AAAA,UAC9C;AAAA,QACF;AAEA,YAAI,SAAS,WAAW,GAAG;AACzB,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,gDAAgD,CAAC;AAAA,UACnF;AAAA,QACF;AAEA,cAAM,YAAY,SACf;AAAA,UACC,CAAC,GAAG,MACF,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,MAAM,EAAE,IAAI;AAAA,SAAa,EAAE,EAAE;AAAA,KAAQ,EAAE,OAAO;AAAA,YAAe,EAAE,mBAAmB,QAAQ,CAAC,CAAC,cAAc,EAAE,WAAW;AAAA,QACnJ,EACC,KAAK,MAAM;AAEd,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM,YAAY,SAAS,MAAM;AAAA;AAAA,EAAiB,SAAS;AAAA,YAC7D;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,cAAc;AACjB,cAAM,QAAQ,qBAAqB,MAAM,IAAI;AAC7C,cAAM,SAAS,MAAM,MAAM,IAAI,MAAM,EAAE;AAEvC,YAAI,CAAC,QAAQ;AACX,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,qBAAqB,MAAM,EAAE,GAAG,CAAC;AAAA,YACjE,SAAS;AAAA,UACX;AAAA,QACF;AAEA,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA;AAAA,MAA0B,OAAO,EAAE;AAAA,YAAe,OAAO,QAAQ;AAAA,QAAW,OAAO,IAAI;AAAA,WAAc,OAAO,OAAO;AAAA,QAAW,OAAO,KAAK,KAAK,IAAI,KAAK,MAAM;AAAA,iBAAoB,OAAO,mBAAmB,QAAQ,CAAC,CAAC;AAAA,gBAAmB,OAAO,WAAW;AAAA,WAAc,OAAO,SAAS;AAAA,iBAAoB,OAAO,cAAc;AAAA,YAC1U;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,iBAAiB;AACpB,cAAM,QAAQ,wBAAwB,MAAM,IAAI;AAChD,cAAM,WAAW,MAAM,MAAM,IAAI,MAAM,EAAE;AAEzC,YAAI,CAAC,UAAU;AACb,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,qBAAqB,MAAM,EAAE,GAAG,CAAC;AAAA,YACjE,SAAS;AAAA,UACX;AAAA,QACF;AAEA,cAAM,MAAM,OAAO,MAAM,EAAE;AAE3B,eAAO;AAAA,UACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,mBAAmB,MAAM,EAAE,GAAG,CAAC;AAAA,QACjE;AAAA,MACF;AAAA,MAEA,KAAK,eAAe;AAClB,cAAM,QAAQ,wBAAwB,MAAM,IAAI;AAChD,cAAM,OAAO,MAAM,MAAM;AAAA,UACvB,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,QACR;AAEA,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA;AAAA,MAAwB,KAAK,EAAE;AAAA,EAAK,MAAM,QAAQ,OAAO,MAAM,gBAAgB,QAAQ,MAAM,QAAQ;AAAA,YAAe,KAAK,QAAQ;AAAA,YACzI;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,oBAAoB;AACvB,cAAM,QAAQ,2BAA2B,MAAM,IAAI;AACnD,cAAM,WAAW,MAAM,MAAM,IAAI,MAAM,EAAE;AACzC,YAAI,CAAC,UAAU;AACb,iBAAO;AAAA,YACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,qBAAqB,MAAM,EAAE,GAAG,CAAC;AAAA,YACjE,SAAS;AAAA,UACX;AAAA,QACF;AACA,cAAM,SAAS,MAAM,MAAM,UAAU,MAAM,IAAI,MAAM,UAAU,GAAG;AAClE,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA;AAAA,MAA6B,OAAO,EAAE;AAAA,aAAgB,OAAO,mBAAmB,QAAQ,CAAC,CAAC;AAAA,QAAW,OAAO,IAAI;AAAA,YACxH;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA,KAAK,gBAAgB;AACnB,cAAM,QAAQ,MAAM,MAAM,SAAS,QAAQ;AAE3C,cAAM,oBAAoB,OAAO,QAAQ,MAAM,UAAU,EACtD,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,KAAK,GAAG,KAAK,KAAK,EAAE,EAC1C,KAAK,IAAI;AAEZ,cAAM,gBAAgB,OAAO,QAAQ,MAAM,MAAM,EAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,EAAE,EAC5C,KAAK,IAAI;AAEZ,eAAO;AAAA,UACL,SAAS;AAAA,YACP;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA;AAAA,kBAAyC,MAAM,aAAa;AAAA,yBAA4B,MAAM,sBAAsB,QAAQ,CAAC,CAAC;AAAA;AAAA;AAAA,EAAqB,iBAAiB;AAAA;AAAA;AAAA,EAAiB,aAAa;AAAA;AAAA,UAAe,MAAM,gBAAgB,KAAK;AAAA,UAAa,MAAM,gBAAgB,KAAK;AAAA,YAC5R;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,MAEA;AACE,eAAO;AAAA,UACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,iBAAiB,IAAI,GAAG,CAAC;AAAA,UACzD,SAAS;AAAA,QACX;AAAA,IACJ;AAAA,EACF,SAAS,OAAO;AACd,UAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU;AACzD,WAAO;AAAA,MACL,SAAS,CAAC,EAAE,MAAM,QAAQ,MAAM,UAAU,OAAO,GAAG,CAAC;AAAA,MACrD,SAAS;AAAA,IACX;AAAA,EACF;AACF,CAAC;AAED,OAAO,kBAAkB,4BAA4B,YAAY;AAC/D,SAAO;AAAA,IACL,WAAW;AAAA,MACT;AAAA,QACE,KAAK;AAAA,QACL,MAAM;AAAA,QACN,aAAa;AAAA,QACb,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,KAAK;AAAA,QACL,MAAM;AAAA,QACN,aAAa;AAAA,QACb,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACF,CAAC;AAED,OAAO,kBAAkB,2BAA2B,OAAO,YAAY;AACrE,QAAM,EAAE,IAAI,IAAI,QAAQ;AACxB,QAAM,QAAQ,MAAM,eAAe;AAEnC,MAAI,QAAQ,kBAAkB;AAC5B,UAAM,QAAQ,MAAM,MAAM,SAAS,QAAQ;AAC3C,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,OAAO,MAAM,CAAC;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,UAAM,WAAW,MAAM,MAAM,KAAK,UAAU,EAAE;AAC9C,WAAO;AAAA,MACL,UAAU;AAAA,QACR;AAAA,UACE;AAAA,UACA,UAAU;AAAA,UACV,MAAM,KAAK,UAAU,UAAU,MAAM,CAAC;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,qBAAqB,GAAG,EAAE;AAC5C,CAAC;AAED,eAAe,OAAO;AACpB,QAAM,YAAY,IAAI,qBAAqB;AAC3C,QAAM,OAAO,QAAQ,SAAS;AAC9B,UAAQ,MAAM,6CAA6C;AAC7D;AAEA,IAAM,SAAS,QAAQ,KAAK,CAAC,MAAM,cAAc,YAAY,GAAG;AAChE,IAAI,QAAQ;AACV,OAAK,EAAE,MAAM,CAAC,UAAU;AACtB,YAAQ,MAAM,gBAAgB,KAAK;AACnC,YAAQ,KAAK,CAAC;AAAA,EAChB,CAAC;AACH;","names":[]}

package/package.json

@@ -0,0 +1,50 @@
+{
+  "name": "@skillkit/mcp-memory",
+  "version": "1.8.0",
+  "description": "MCP (Model Context Protocol) server for SkillKit persistent memory",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "bin": {
+    "skillkit-memory-server": "./dist/index.js"
+  },
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.0.0",
+    "zod": "^3.24.0",
+    "@skillkit/memory": "1.8.0"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.5",
+    "tsup": "^8.3.5",
+    "typescript": "^5.7.2",
+    "vitest": "^2.1.8"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "license": "Apache-2.0",
+  "keywords": [
+    "mcp",
+    "model-context-protocol",
+    "memory",
+    "ai",
+    "claude",
+    "skillkit"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "start": "node dist/index.js"
+  }
+}