#1 AIUnknown
LynxMCP — alternative #1 to workspace-qdrant-mcp
🐍 🏠 🍎 🪟 🐧 - 100% local semantic code search for AI agents: AST-aware chunking (tree-sitter), hybrid BM25+dense retrieval, and a code knowled...
GitHub source
Recorded alternatives
Alternatives to workspace-qdrant-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.
#2 AIUnknown
rms-memory-mcp — alternative #2 to workspace-qdrant-mcp
🦀 🏠 🍎 🐧 🪟 - Local-first persistent memory for AI coding agents. Hybrid vector + full-text search (LanceDB + Tantivy), separate Markdown and...
GitHub source
#3 AIUnknown
akb — alternative #3 to workspace-qdrant-mcp
🐍 📇 🏠 🍎 🪟 🐧 - Organizational knowledge base for AI agents. Vault-scoped Markdown docs, structured PostgreSQL tables, and files unified by a...
GitHub source
#4 AIUnknown
octocode — alternative #4 to workspace-qdrant-mcp
[octocode] - Semantic code indexer with GraphRAG knowledge graph and MCP server. Tree-sitter AST parsing, ast-grep structural search, LanceD...
GitHub source
#5 AIUnknown
rag-rat — alternative #5 to workspace-qdrant-mcp
🦀 🏠 🍎 🪟 🐧 - Local repo-intelligence index and MCP server for coding agents — "what a repository knows about itself." Hybrid BM25 + vector se...
GitHub source
#6 AIUnknown
mcp-memory-gateway — alternative #6 to workspace-qdrant-mcp
📇 🏠 - Pre-action gates that prevent AI coding agents from repeating known mistakes. Captures explicit feedback, auto-promotes failures into...
GitHub source
#7 AIUnknown
talonic-mcp — alternative #7 to workspace-qdrant-mcp
📇 ☁️ - Schema-validated document extraction with searchable workspace memory. Extract structured fields from PDFs, scans, images, and forms;...
GitHub source
#8 AIUnknown
when — alternative #8 to workspace-qdrant-mcp
📇 🏠 🍎 🪟 🐧 - Developer toolkit: auto-detect stack for AI context files, catch port conflicts, validate .env schemas, spot docs drift, audit d...
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 workspace-qdrant-mcp directly — Oryxen records pricing classes, not live quotes.