Command Palette

Search for a command to run...

UnylyUnyly
Весь каталог

MemMCP

БесплатноНе проверен

A Byzantine fault-tolerant MCP Memory server that uses SQLite write-ahead logging and FAISS hybrid vector search for deterministic, secure memory operations.

GitHubEmbed

Описание

A Byzantine fault-tolerant MCP Memory server that uses SQLite write-ahead logging and FAISS hybrid vector search for deterministic, secure memory operations.

README

🧠 MemMCP

Deterministic, BFT-Hardened MCP Memory Server for Agent Swarms

Build Status Python Version SQLite WAL License


MemMCP is a hyper-optimized Memory Server natively implementing the Model Context Protocol (MCP). It bridges the gap between lexical keyword search and semantic vector embeddings, delivering 100% deterministic, deduplicated memory recall for autonomous AI Agent Swarms.

📖 Table of Contents

🤔 Why MemMCP?

When dozens of autonomous agents operate in parallel, standard vector databases suffer from race conditions, data duplication, and context hallucination. MemMCP solves this by merging SQLite Write-Ahead Logging (WAL) for ACID-compliant state management with FAISS Hybrid Reciprocal Rank Fusion (RRF) for unparalleled semantic retrieval.

✨ Core Features

Feature Description Architecture
Byzantine Fault Tolerance Strict isolation of execution states using Bloom-Filter Idempotency tracking. Never stores the same memory twice. SQLite WAL
Data Integrity Dual-ledger Distributed Consensus architecture powered by Merkle-Root signatures. msvcrt RWLocks
O(N) Vector Batching Bounds FAISS Semantic search with hybrid RRF logic executing strictly within <50ms latency bounds. FAISS + FTS5
Zero-Trust Execution Hardened against indirect prompt injection with explicit XML RAG bounding. MCP stdio

🚀 Quick Start

MemMCP is designed to be booted instantly by any MCP-compliant LLM or Agent Framework via standard IO streams (stdio).

# 1. Clone the repository
git clone https://github.com/axton/project_2_mcp_memory.git
cd project_2_mcp_memory

# 2. Build the exact dependency graph using uv
make build

# 3. Verify the rigorous mathematical test suite
make test

# 4. Boot the MCP server directly
make run

🏗 Architecture

graph TD
    A[MCP Client] --> B{Bloom-Filter Idempotency Gate}
    B -->|Duplicate Request| C["Drop (Idempotent Return)"]
    B -->|New Request| D[Vectorization]
    D --> E[FAISS Hybrid RRF Search]
    E --> F[SQLite WAL Merkle-Root Ledger]
    F --> G[XML RAG Formatter]
    G --> H[Response]

🛠 MCP Tool Reference

MemMCP automatically exposes the following functions to any connected agent:

  • store_memory: Store a single memory. Generates unique keys and updates FAISS indices.
  • store_memories_batch: Store multiple memories atomically in a single massive transaction, rebuilding the index only once.
  • recall_memories: Retrieve relevant memories using Reciprocal Rank Fusion (blending Semantic FAISS similarity + SQLite FTS5 keyword search).

🤝 Contributing & Security

To contribute, you must abide by our strict mathematical isolation limits. See CONTRIBUTING.md for details. For vulnerabilities, refer to SECURITY.md.

📄 License

MIT License. Copyright (c) 2026 Axton Carroll.

from github.com/axtontc/MemMCP

Установка MemMCP

У этого сервера нет опубликованного пакета — он собирается из исходников. Открой репозиторий и следуй инструкции в README.

▸ github.com/axtontc/MemMCP

FAQ

MemMCP MCP бесплатный?

Да, MemMCP MCP бесплатный — установка в пару кликов через Unyly без оплаты.

Нужен ли API-ключ для MemMCP?

Нет, MemMCP работает без API-ключей и переменных окружения.

MemMCP — hosted или self-hosted?

Self-hosted: сервер запускается локально на твоей машине командой из раздела установки.

Как установить MemMCP в Claude Desktop, Claude Code или Cursor?

Открой MemMCP на unyly.org, выбери вкладку своего клиента (Claude Desktop, Claude Code, Cursor) и нажми Install — конфиг сгенерируется автоматически, без правки JSON.

Похожие MCP

Compare MemMCP with

Не уверен что выбрать?

Найди свой стек за 60 секунд

Автор?

Embed-бейдж для README

Похожее

Все в категории data