vectr — alternative #1 to LynxMCP
🐍 🏠 🍎 🪟 🐧 - Semantic codebase search + persistent working memory for AI code editors. Hybrid dense + BM25 search over AST-aware chunks, a sy...
Search tools, jump to categories, and open key destinations
Recorded alternatives
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.
🐍 🏠 🍎 🪟 🐧 - Semantic codebase search + persistent working memory for AI code editors. Hybrid dense + BM25 search over AST-aware chunks, a sy...
🐍 🏠 🍎 🪟 🐧 - Local RAG system for Claude Code with hybrid search (BM25 + semantic), cross-encoder reranking, markdown-aware chunking, query e...
🐍 🏠 🍎 🪟 🐧 - Durable hybrid memory for AI agents. Combines vector search, BM25, temporal retrieval, and optional Memgraph knowledge graph via...
Local-first, full-text code search engine for AI coding agents. Trigram-indexed, sub-100ms queries, MCP server mode...
📇 🏠 ☁️ - Convert source code repositories into searchable knowledge bases with AI-powered search using GPT-5, intelligent chunking, and Open...
⭐ 46 — Coordination protocol that prevents merge conflicts between parallel AI agents. Locks specific functions (not files) via Tree-sitter...
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.
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 LynxMCP directly — Oryxen records pricing classes, not live quotes.