Search Oryxen

Search tools, jump to categories, and open key destinations

Recorded alternatives

Alternatives to rms-memory-mcp

Every candidate below sits in AI. What ends up on this page is decided entirely by a recorded score — not by bidding, not by editor taste. Review both records, check current vendor terms, then decide.

#1 AIUnknown

ChatCrystal — alternative #1 to rms-memory-mcp

📇 🏠 🍎 🪟 🐧 - Local-first AI PKM memory server for coding conversations. Imports Claude Code, Cursor, Codex CLI, Trae, and GitHub Copilot chat...

GitHub source
#2 AIUnknown

Midas — alternative #2 to rms-memory-mcp

🐍 📇 🏠 🍎 🪟 🐧 - Local-first memory for long-horizon AI agents with no LLM at ingest — $0 per message, zero data egress, verbatim source-tracea...

GitHub source
#3 AIUnknown

threadctx-mcp — alternative #3 to rms-memory-mcp

📇 🏠 ☁️ 🍎 🪟 🐧 - Shared team memory for AI coding agents. Decisions, fixes, and gotchas persist per repo and are shared across Claude Code, Cu...

GitHub source
#4 AIUnknown

iranti — alternative #4 to rms-memory-mcp

📇 🏠 ☁️ 🍎 🪟 🐧 - Persistent shared memory for AI coding agents. Stores facts as entity/key/value triples with hybrid semantic search, task che...

GitHub source
#5 AIUnknown

reflex-search — alternative #5 to rms-memory-mcp

Local-first, full-text code search engine for AI coding agents. Trigram-indexed, sub-100ms queries, MCP server mode...

Catalogue source
#6 AIUnknown

CodeCortex — alternative #6 to rms-memory-mcp

📇 🏠 🍎 🪟 🐧 - Persistent codebase knowledge layer for AI coding agents. Pre-digests codebases into structured knowledge (symbols, dependency g...

GitHub source
#7 AIUnknown

devrecall — alternative #7 to rms-memory-mcp

🏎️ 🏠 🍎 🐧 - Local-first developer activity aggregator. Indexes commits, PRs, Jira/Linear tickets, Confluence docs, Slack threads, and Calenda...

GitHub source
#8 AIUnknown

agentram-mcp — alternative #8 to rms-memory-mcp

📇 ☁️ - Persistent memory for AI agents through a simple key-value HTTP API. No vector database or embeddings required. Store, retrieve, sear...

GitHub source

Questions about this page

How were these alternatives selected?

Each candidate is a live catalogue record in the same primary category, picked by a deterministic score that Oryxen records in its catalogue: how many meaningful words the two listings share, whether their pricing classes oppose (a paid product against a free one), whether both are open source, and whether either record is featured. The same catalogue state always produces the same list — no randomness, no manual ranking.

Are these alternatives ranked by payment?

No. Rows are ordered only by the recorded score, highest first, with alphabetical ties — payment never influences the order, nothing here is paid placement, and Oryxen charges no listing or placement fee.

Always verify current terms with rms-memory-mcp directly — Oryxen records pricing classes, not live quotes.