lean-memory — alternative #1 to LINZA-MCP
🐍 🏠 🍎 🪟 🐧 - Embedded, local-first agent memory in a single SQLite file per namespace (vec0 + FTS5 hybrid retrieval). ADD-only history querya...
Search tools, jump to categories, and open key destinations
Recorded alternatives
Every candidate below sits in AI Coding. 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.
🐍 🏠 🍎 🪟 🐧 - Embedded, local-first agent memory in a single SQLite file per namespace (vec0 + FTS5 hybrid retrieval). ADD-only history querya...
🐍 🏠 🍎 🪟 🐧 - Event-sourced agent memory on a hash-chained append-only log with an embedded temporal knowledge graph (Kuzu, no sidecar). Cited...
🐍 🏠 🍎 🪟 🐧 - Governed memory for coding agents with trust lifecycle (hypothesis → active → validated → deprecated), conflict detection, stale...
🐍 🏠 - Evidence-backed PR contribution advisor. 550+ case studies from 33 repos, 8 tools for merge probability analysis, pattern matching, an...
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 LINZA-MCP directly — Oryxen records pricing classes, not live quotes.