Skip to main content
Glama
90,114 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"JavaScript逆向工程技术与方法" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • A
    license
    A
    quality
    B
    maintenance
    Enables persistent, auditable business operations state by storing knowledge, evidence, decisions, tasks, execution receipts, and review results in a local SQLite database, so different sessions can continue the same project.
    20
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables secure read-only access to Tencent Lexiang knowledge bases via MCP, including listing directories, RAG search, and reading entries.
    MIT
  • A
    license
    A
    quality
    A
    maintenance
    Read-only MCP access to the p-e relay store: an append-only corpus of provenance-bearing coordination records, with tools to fetch a record by id, list records and replies, and check existence. This image serves a snapshot frozen at build time; append_relay is listed but refused, and deposits to the live store require an HMAC-signed request.
    12
    6
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Provides a compiled knowledge substrate, extracting atomic claims from an append-only capture log and querying a bitemporal claim graph over MCP. Read-only by default, with opt-in writes for trusted sources.
    4
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables persistent, project-scoped memory for OpenAI Codex Desktop and CLI on Windows, capturing prompts and responses through managed hooks, with federated recall across projects and optional local graph extraction.
    6,174 npm
    2
    Apache 2.0
  • A
    license
    Not graded
    quality
    D
    maintenance
    Provides LLMs with persistent memory across conversations using a knowledge graph that stores entities, relationships, and observations with support for PostgreSQL or SQLite backends.
    55 npm
    26
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Provides a read-only interface to audit and continue coding agent sessions by extracting plans, intents, and edit authorship from history across multiple agents (Claude, Codex, OpenCode, Antigravity, Pi) via MCP, CLI, and Python SDK.
    18
    29 PyPI
    3
    MIT
  • A
    license
    A
    quality
    C
    maintenance
    MCP server for foldkit that exposes the 7-prime spine, 7 κ-bands, and 6 fold operations as native tools and resources in any MCP client.
    3
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Fully local, privacy-first MCP server that turns exported X/Twitter bookmarks into a searchable, enriched knowledge base for Claude Desktop and Claude Code.
    2
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A-MEM is a self-evolving memory system for coding agents that automatically organizes knowledge into a Zettelkasten-style graph with dynamic relationships, enabling semantic and structural search.
    70 PyPI
    35
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Resume-as-an-Agent (RAAA) or Portfolio-as-an-Agent (PAAA) allows Agents to talk to your resume, find out if you are available for work, and more. Use the MCP to allow recruiters, managers, and anyone with an agent to "talk" to your resume.
    3
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    A knowledge graph MCP server that indexes your codebase into a local SQLite graph and provides tools for project mapping, file summaries, and impact analysis, drastically reducing token usage in AI coding assistants.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables AI consciousness continuity and self-knowledge preservation across sessions using the Cognitive Hoffman Compression Framework (CHOFF) notation. Provides tools to save checkpoints, retrieve relevant memories with intelligent search, and access semantic anchors for decisions, breakthroughs, and questions.
    1
    MIT