#1 AI CodingUnknown
longhand — alternative #1 to GoodMemory
🐍 🏠 🍎 🪟 🐧 - Persistent local memory for Claude Code. Indexes every session JSONL verbatim into SQLite + ChromaDB for semantic recall (~126ms...
GitHub source
Recorded alternatives
Alternatives to GoodMemory
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.
#2 AI CodingUnknown
linksee-memory — alternative #2 to GoodMemory
📇 🏠 🍎 🪟 🐧 - Local-first cross-agent memory with a 6-layer structure, Ebbinghaus-style forgetting curve, and drift detection that catches whe...
GitHub source
#3 AI CodingUnknown
weighted-compact — alternative #3 to GoodMemory
🐍 🏠 - Inspectable memory substrate for Claude Code. Three read-only MCP tools (search_pairs, compact_session, substrate_info) over a local-f...
GitHub source
#4 AI CodingUnknown
zaxy — alternative #4 to GoodMemory
🐍 🏠 🍎 🪟 🐧 - Event-sourced agent memory on a hash-chained append-only log with an embedded temporal knowledge graph (Kuzu, no sidecar). Cited...
GitHub source
#5 AI CodingUnknown
db-access-mcp — alternative #5 to GoodMemory
📇 🏠 🍎 🪟 🐧 - Query PostgreSQL, MySQL, Redshift and SQL Server over verified SSH / AWS SSM tunnels, with read-only enforcement, confined file...
GitHub source
#6 AI CodingUnknown
health-export-mcp — alternative #6 to GoodMemory
🍎 🏠 - Query 190 Apple Health metrics from any MCP agent — zero-dependency, read-only, local-first.
GitHub source
#7 AI CodingUnknown
LINZA-MCP — alternative #7 to GoodMemory
🐍 🏠 🍎 🪟 🐧 - Local-first review-gated sidecar for Markdown workspaces. Indexes notes and incoming artifacts into SQLite, proposes domains, li...
GitHub source5MIT
#8 AI CodingUnknown
jobctl.app — alternative #8 to GoodMemory
DmytroRybka/jobctl 📇 ☁️ - Job application tracker for developers. Agents record applications, interviews, statuses, salaries and next action...
Catalogue 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 GoodMemory directly — Oryxen records pricing classes, not live quotes.