"A search for ways to save the world" matching MCP servers:

Persistent 3D/2D spatial world model MCP server for AI agents. Entity tracking, object permanence, AABB collision simulation & view frustum projection via local SQLite.

Temporal knowledge graph for codebases that captures decision traces, links test failures to code changes, learns co-edit patterns, predicts regression risk, and enforces learned constraints at the edit boundary via a PreToolUse hook.

A narrative graph engine that enables LLMs to generate, track, and mutate complex fictional worlds while maintaining consistency between factions, characters, and locations. It acts as a specialized RAG framework for storytelling, allowing models to manage thousands of entities without exceeding context limits.

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.

An MCP server that manages your conversation context automatically, pruning dead branches and keeping an audit trail of every cut.

Provides local, evidence-aware research memory with human review, revision history, and an inspector, allowing assistants to preserve source reports, inferences, assumptions, and evidence across sessions.

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.

Turns a codebase into a persistent knowledge graph so AI coding agents can answer structural questions about functions, call chains, routes, and cross-service links through graph queries instead of reading files one by one.

Enables semantic search across conversation archives via MCP, allowing AI clients to retrieve relevant past conversations using vector embeddings and text fallback.

Turns GitHub repository history into a cited maintainer skill for coding agents, providing tools to collect evidence, query the knowledge graph, and inspect bundles.

Persists Claude Code sessions to Notion as team memory, enabling queryable recall of decisions, work state, and project architecture.

A federation MCP server that sits in front of multiple memory backends and presents a unified search surface to AI agents, allowing a single query to search across knowledge graphs, session history, and web search.

Full-text search over Claude Code conversation history using SQLite FTS5, exposing indexed transcripts as MCP tools for searching, browsing, and reading turns.

Provides an intelligent, graph-based memory system for LLM agents using the Zettelkasten principle, enabling automatic note construction, semantic linking, memory evolution, and autonomous graph maintenance with background optimization processes.

Enables keyword search, filtering, and retrieval of Claude Code memory files, reducing context overhead by fetching only relevant memories on demand.

Enables semantic search over markdown files to find related notes by meaning rather than keywords, and automatically detect duplicate content before creating new notes.

MCP server for Yandex Wiki with full-text search. Read and write pages, comments, attachments, and dynamic tables (grids); optional server-side read-only mode for agents. Docker-ready.

Turn Obsidian notes into agent-ready context, preview-only plans, and safe repo handoffs.

MCP bridge for PDF Content Search — full-text PDF search with Apple Vision OCR across thousands of documents in under a second from Claude, Cursor, or any MCP client. Advanced filters (date, category, sender, amount), wildcards, boolean operators. Bridge open-source (MIT), PDF Content Search app is commercial with free iOS+Android companion scanner apps.

Persistent memory system for AI agents that records episodic memories with care-weighting and emotional valence, and provides full-text search with temporal chaining and automatic consolidation.