Context7
Up-to-date docs for AI agents
作者提供的说明(英文原文)
Open-source causal memory for AI agents: persistent, explainable, MCP-native memory (13 tools).
这三项永远不会合并成一个分数:意见、测量和人气是不同的东西。
我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。
选择你使用的 AI 应用,然后复制设置。
OPENAI_API_KEY, ANTHROPIC_API_KEY, GENESYS_EMBEDDER标为机密的值是你账户的钥匙。千万不要分享给别人,也不要粘贴到聊天里。
你需要
你用的是哪个应用?
在上方选择你的应用。我们会记住它,下次按钮会显示“安装到 …”。
打开 Claude Desktop → Settings → Developer → Edit Config,把下面的内容粘贴到 claude_desktop_config.json
{
"mcpServers": {
"genesys-memory": {
"command": "uvx",
"args": [
"genesys-memory"
],
"env": {
"OPENAI_API_KEY": "your-value",
"ANTHROPIC_API_KEY": "your-value",
"GENESYS_EMBEDDER": "your-value"
}
}
}
}在终端中运行这条命令
claude mcp add genesys-memory --env OPENAI_API_KEY=your-value --env ANTHROPIC_API_KEY=your-value --env GENESYS_EMBEDDER=your-value -- uvx genesys-memory运行前请先填写空着的值。
粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json
{
"mcpServers": {
"genesys-memory": {
"command": "uvx",
"args": [
"genesys-memory"
],
"env": {
"OPENAI_API_KEY": "your-value",
"ANTHROPIC_API_KEY": "your-value",
"GENESYS_EMBEDDER": "your-value"
}
}
}
}浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。
粘贴到项目中的 .vscode/mcp.json
{
"servers": {
"genesys-memory": {
"type": "stdio",
"command": "uvx",
"args": [
"genesys-memory"
],
"env": {
"OPENAI_API_KEY": "your-value",
"ANTHROPIC_API_KEY": "your-value",
"GENESYS_EMBEDDER": "your-value"
}
}
}
}浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。
这个服务器在你的电脑上运行,而 ChatGPT 只能连接互联网上的服务器。请选择其他应用。
你的选择通过 Cookie 保存在这台设备上,无需账户。
GENESYS_EMBEDDER env这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同,请以 README 为准。
它在你的电脑上运行;安装后,工具列表会显示在你的 AI 应用中。
我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月7日
注册名称已通过 GitHub 账户 Astrix-Labs 验证,该账户拥有此仓库
我们还没有从 GitHub 读取这个仓库
我们还没有从 GitHub 读取这个仓库
它在你的电脑上运行,没有互联网端点
在你的电脑上运行,改用本地设置
它在你的电脑上运行;我们只能读取互联网端点的工具列表
与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。
它在 1 项适用的基础检查中通过了 1 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。
你需要填写:OPENAI_API_KEY, ANTHROPIC_API_KEY
它在你的电脑上运行。你的 AI 应用会在需要时启动它,数据不会经过作者的服务器(除非它自己调用在线服务)。
GitHub 仓库最后更新于–,最新版本(0.5.2)于4个月前进入注册中心。
支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。你的电脑上还需要有 Python (uv)。
同一分类中有:Context7, Codebase Memory, Exa
同一分类中其他作者的服务器,按星标数排序。
如何看卡片:★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i
Up-to-date docs for AI agents
Codebase knowledge graph for AI agents — 162 languages, sub-ms queries, 99% fewer tokens.
Connect AI agents to Exa for web search, content fetching, and multi-step research.
按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。
The intelligence layer for AI memory.
Papez doesn't just remember what happened; it remembers why. A scoring engine + causal graph + lifecycle manager for AI agent memory. Speaks MCP natively.
| System | Score | Protocol |
|---|---|---|
| Papez | 85.55 ± 0.37 | Frozen: gpt-4o-mini answerer + judge, temp 0, n=1,540, cats 1–4, 10 runs (July 2026) |
| Zep | 75.14 | Comparable published setup |
| Mem0 | 66.9 | Comparable published setup (Mem0 paper) |
Self-reported vendor figures above ~90 use different answerers/judges and are not comparable — the oracle retrieval ceiling under this frozen protocol is 94.9. Reproduce it yourself: Astrix-Labs/locomo-harness · full methodology · per-run results.
Hosted product: papez.ai — your personal memory for AI, carried across ChatGPT, Claude, and every MCP app · Pricing · Developer docs · Benchmark methodology (85.55 on LoCoMo, certified over 10 runs, receipts published)
Papez is a scoring engine, causal graph, and lifecycle manager for AI memory. Memories are scored by a multiplicative formula (relevance × connectivity × reactivation), connected in a causal graph, and actively forgotten when they become irrelevant.
This package (papez) is the core library: an in-memory causal graph engine with optional JSON persistence, plus a stdio MCP server. It has no database dependency and no REST API. A hosted product built on top of this library — with Postgres, additional storage backends, and a REST/HTTP MCP API — is available separately at api.papez.ai; it is not part of this package.
Your AI remembers everything but understands nothing. Papez fixes that.
Requires Python 3.11 or newer.
Install the package. The base install has zero database dependencies — state lives in memory and is optionally persisted to a JSON file.
pip install papez
Optional extras:
pip install 'papez[openai]' # OpenAI embeddings
pip install 'papez[local]' # Local embeddings (sentence-transformers, no API key) pip install 'papez[anthropic]' # LLM-based causal inference (consolidation, contradiction detection)
Run the stdio MCP server directly:
python3 -m papez
git clone https://github.com/Astrix-Labs/papez.git
cd papez pip install -e '.[dev]' pytest tests/
claude mcp add papez -- python -m papez
Add to your claude_desktop_config.json:
{
"mcpServers": { "papez": { "command": "python", "args": ["-m", "papez"] } } }
The stdio server is a single local process. Under load — or during a restart or redeploy of a hosted transport in front of it — a tool call can transiently fail or the connection can briefly go unresponsive. Memory writes and reads are not worth crashing an agent turn over, so clients should degrade gracefully rather than treat a memory call as fatal:
{"error": "...", "retryable": bool} payload instead of a protocol-level MCP failure, so a memory hiccup never crashes the transport. The retryable flag encodes the guidance below: true for the read tools, and for a memory_store_batch call in which every item carries an external_id.memory_recall, memory_search, memory_traverse, memory_explain, memory_stats, list_core_memories, space_list, space_get, space_member_list) with a short bounded backoff (e.g. 2–3 attempts). These have no side effects worth worrying about beyond reactivation bookkeeping.memory_store with an external_id, and memory_store_batch when every item has one, are idempotent: a resend returns unchanged (or amended if the content really changed) with the same node ids, never a duplicate. See Idempotent writes and batches.memory_recall, or pass a stable source_session so duplicates are easy to spot. (retryable stays false for memory_store even with an external_id, because the flag is per tool; the call itself is safe to resend.)| Tool | Description |
|---|---|
memory_store | Store a new memory. Use related for writer-specified typed edges ({id, type}); related_to is legacy and always creates caused_by. Optional category, refs, tags, space, external_id, on_existing (amend default, skip, error). May return possible_conflicts (heuristic hints). |
memory_amend | Record a correction: creates a new memory that supersedes an existing one. The old memory is kept (decayed in recall), not deleted. Optional refs / tags (omitted: copied from the old memory; given: replace). Stays in the old memory's space. |
memory_recall | Recall memories by natural language query (vector + keyword + graph spreading activation). Supports verbosity: "concise" or "light" for lightweight payloads. Optional tags_any, ref_type, space, spaces, include_personal, category, exclude_superseded. |
memory_search | Filtered vector search by status, category, date (since), last-active date (active_since), entity, and now tags_any, tags_all, ref_type, ref_id. Pass an empty query to enumerate by recency instead (no embedder needed) — with since/active_since this answers "what's new since I last looked" without knowing what to query for. Optional space, spaces, include_personal. |
memory_traverse | Walk the causal graph from a node. Returns reachable nodes and the edges of the induced subgraph (source/target/type/weight/created_by) — a superset of the BFS tree, so paths can be reconstructed. Honors edge_types. Optional space, spaces, include_personal. An invisible start node returns not_found. |
memory_explain | Explain a memory's score. Includes a score_model block (formula + live per-force breakdown + staleness note), removal_impact, and the memory's refs, tags, space. |
memory_stats | Get memory system statistics over what you can see. Optional space. |
pin_memory | Pin a memory so it's never forgotten (writer+ for space memories) |
unpin_memory | Unpin a previously pinned memory (writer+ for space memories) |
delete_memory | Permanently delete a memory (writer+ for space memories) |
list_core_memories | List core memories, optionally filtered by category. Optional space. |
set_core_preferences | Set user preferences for core memory categories |
promote_to_org | Promote a private memory to org visibility (not for space memories) |
memory_store_batch | Store up to 100 memories into one space in one call. Validates every item first (all or nothing), supports ref_index links to earlier items, returns one result per item. Safe to retry when every item has an external_id. |
memory_retire_by_ref | Retire the memories citing a removed source (ref_type, ref_id). mode="amend" (default) or "delete". Optional space. |
space_create | Create a Mind Space; you become its owner. name, optional slug, org_id, description, forgetting_policy, llm_inference_enabled, show_service_names. |
space_list | List your spaces with your role and counts. Optional include_archived. |
space_get | One space, with member and memory counts (reader+) |
space_update | Change name, description, forgetting_policy, llm_inference_enabled, show_service_names (owner) |
space_member_add | Add a user or service with a role, or change an existing member's role (owner) |
space_member_remove | Remove a member (owner; the last user owner can't be removed) |
space_member_list | List members (reader+) |
space_archive / space_unarchive | Make a space read-only and hidden from default recall, or undo it (owner) |
space_erase | Permanently delete a space and everything in it (owner, confirm_slug, optional dry_run) |
promote_to_space | Copy one of your personal memories into a space (writer+). Optional keep_original. |
memory_store's related argument lets the writer set edge semantics instead of guessing. Each entry is {"id": " ", "type": " "}, directed new_node --type--> target (so supersedes means the new node supersedes the target). Invalid types are rejected before the node is created — explicit writes never half-succeed. related_to still exists but always creates caused_by; prefer related.
To correct a fact, use memory_amend(node_id, content, reason=...): it stores the new version, links it SUPERSEDES → old, and keeps the old memory for audit. Recall automatically deprioritizes superseded hits and tags them with superseded_by.
When you memory_store something that lexically disagrees with an auto-link candidate (a changed number, a negation), the result may include possible_conflicts — heuristic hints, not verified contradictions, and never materialized as edges. Use them to decide whether to memory_amend.
Every memory can say where it came from (refs) and carry labels (tags):
{"content": "Manual payments over $10K ship overnight via FedEx Priority.",
"tags": ["Manual Payments", "bank-a"], "refs": [{"type": "document", "id": "doc_8812", "label": "Mail Matrix.pdf", "url": "https://docs.example.com/d/doc_8812"}]}
- ("Manual Payments" -> manual-payments), empty tags dropped, duplicates removed in order. Only a-z 0-9 - _ . : are allowed ("q2/2026" is rejected with invalid_tag). At most 20 tags of 50 cha只显示了开头部分;其余内容请在仓库中阅读