#1 AI CodingUnknown
forge — alternative #1 to ctxfile
📇 🏠 🍎 🪟 🐧 - Structured planning, parallel execution in git worktrees, and deep validation for Claude Code. Turns a one-line objective into a...
GitHub source
Recorded alternatives
Alternatives to ctxfile
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
DecisionNode — alternative #2 to ctxfile
📇 🏠 🍎 🪟 🐧 - Record development decisions as structured JSON, embed as vectors via Gemini, and search semantically over MCP. Shared store acr...
GitHub source
#3 AI CodingUnknown
m1nd — alternative #3 to ctxfile
⭐ 22 — Local-first MCP server that gives a CLI coding agent a neuro-symbolic code graph over the repo: impact/why/change-reasoning across a...
GitHub source
#4 AI CodingUnknown
weighted-compact — alternative #4 to ctxfile
🐍 🏠 - Inspectable memory substrate for Claude Code. Three read-only MCP tools (search_pairs, compact_session, substrate_info) over a local-f...
GitHub source
#5 AI CodingUnknown
acheron-mcp-server — alternative #5 to ctxfile
📇 🏠 - Cross-surface persistent memory for Claude. Bridges context between Claude Chat, Code, and Cowork via local SQLite with full-text sear...
GitHub source
#6 AI CodingUnknown
DvalinCode — alternative #6 to ctxfile
⭐ 112 — Provider-neutral, local-first coding agent (Chat/Cowork/Code modes) built for governance: an org policy engine, enforced network egr...
GitHub source
#7 AI CodingUnknown
GoodMemory — alternative #7 to ctxfile
📇 🏠 - Local-first, auditable memory layer for Codex, Claude Code, and MCP clients. Stores scoped user/project memory in SQLite or Postgres,...
GitHub source
#8 AI CodingUnknown
linksee-memory — alternative #8 to ctxfile
📇 🏠 🍎 🪟 🐧 - Local-first cross-agent memory with a 6-layer structure, Ebbinghaus-style forgetting curve, and drift detection that catches whe...
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 ctxfile directly — Oryxen records pricing classes, not live quotes.