Search Oryxen

Search tools, jump to categories, and open key destinations

Recorded alternatives

Alternatives to memory-arbiter-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

engram — alternative #1 to memory-arbiter-mcp

📇 🏠 🍎 🪟 🐧 - Local-first persistent memory for AI agents. SQLite + local embeddings (all-MiniLM-L6-v2), hybrid semantic + FTS5 recall, secret...

GitHub source
#2 AIUnknown

enquire-mcp — alternative #2 to memory-arbiter-mcp

📇 🏠 🍎 🪟 🐧 - Long-term memory for AI agents (Claude Code/Desktop, Cursor, ChatGPT, Codex, OpenClaw) backed by a local Obsidian markdown vault...

GitHub source
#3 AIUnknown

Midas — alternative #3 to memory-arbiter-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
#4 AIUnknown

rms-memory-mcp — alternative #4 to memory-arbiter-mcp

🦀 🏠 🍎 🐧 🪟 - Local-first persistent memory for AI coding agents. Hybrid vector + full-text search (LanceDB + Tantivy), separate Markdown and...

GitHub source
#5 AIUnknown

threadctx-mcp — alternative #5 to memory-arbiter-mcp

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

GitHub source
#6 AIUnknown

nucleus-mcp — alternative #6 to memory-arbiter-mcp

🐍 🏠 ☁️ 🍎 🪟 🐧 - Sovereign Agent OS — persistent memory, governance, and audit trails for AI agents. One brain for Cursor, Claude Code, Windsu...

GitHub source
#7 AIUnknown

toolport — alternative #7 to memory-arbiter-mcp

🦀 🏠 🍎 🪟 🐧 - One local gateway and manager for all your MCP servers, shared across every AI coding tool (Claude, Cursor, VS Code, Codex, and...

GitHub source
#8 AIUnknown

vestige — alternative #8 to memory-arbiter-mcp

⭐ 605 — Local-first cognitive memory MCP server for coding agents; SQLite store, FSRS-6 retention, prediction-error gating, active forgettin...

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 memory-arbiter-mcp directly — Oryxen records pricing classes, not live quotes.