nowfound

Alternatives

Products that do what Dbzero – Code as if you have infinite RAM (Python persistence engine) does

  1. 1SM

    I wanted to see how fast an isolated code sandbox could start if I never had to boot a fresh VM. So instead of launching a new microVM per execution, I boot Firecracker once with Python and numpy already loaded, then snapshot the full VM state. Every execution after that creates a new KVM VM backed by a `MAP_PRIVATE` mapping of the snapshot memory, so Linux gives me copy-on-write pages automatically. That means each sandbox starts from an already-running Python process inside a real VM, runs the code, and exits. These are real KVM VMs, not containers: separate guest kernel, separate guest…

    Mar 2026 · github.com

  2. 2SP

    2017 · sultan.readthedocs.io

  3. 3

    Persistent memory for Claude Code, Codex & coding agents

    May 2026 · agent-memory.dev

  4. 4

    Persistent memory for AI coding agents

    Apr 2026

  5. 5SC

    I got tired of Claude Code forgetting all my context every time I open a new session: set-up decisions, how I like my margins, decision history. etc. We built a shared memory layer you can drop in as a Claude Code Skill. It’s basically a tiny memory DB with recall that remembers your sessions. Not magic. Not AGI. Just state. Install in Claude Code: /plugin marketplace add https://github.com/mutable-state-inc/ensue-skill /plugin install ensue-memory # restart Claude Code What it does: (1) persists context between sessions (2) semantic & temportal search (not just…

    Dec 2025 · github.com

  6. 6RG

    Hey HN! I'm José, and I built Recall to solve a problem that was driving me crazy. The Problem: I use Claude for coding daily, but every conversation starts from scratch. I'd explain my architecture, coding standards, past decisions... then hit the context limit and lose everything. Next session? Start over. The Solution: Recall is an MCP (Model Context Protocol) server that gives Claude persistent memory using Redis + semantic search. Think of it as long-term memory that survives context limits and session restarts. How it works: - Claude stores important context as "memories" during…

    Oct 2025 · npmjs.com

  7. 7PM
  8. 8MM
  9. 9MW
  10. 10CL

    I have a proposal that addresses long-term memory problems for LLMs when new data arrives continuously (cheaply!). The program involves no code, but two Markdown files. For retrieval, there is a semantic filesystem that makes it easy for LLMs to search using shell commands. It is currently a scrappy v1, but it works better than anything I have tried. Curious for any feedback!

    Apr 2026 · github.com

  11. 11LR
  12. 12BA

    Tired of AI coding tools that forget everything between sessions? Every time I open a new chat with Claude or fire up Copilot, I'm back to square one explaining my codebase structure. So I built something to fix this. It's called In Memoria. Its an MCP server that gives AI tools persistent memory. Instead of starting fresh every conversation, the AI remembers your coding patterns, architectural decisions, and all the context you've built up. The setup is dead simple: `npx in-memoria server` then connect your AI tool. No accounts, no data leaves your machine. Under the hood it's TypeScript +…

    2025 · github.com

  13. 13CM

    We built CodeYam Memory because Claude Code kept making the same mistakes on our codebase. Our claude.md files quickly got stale and maintaining by hand or with Claude wasn’t sufficient. While digging into this we found that Claude has a native rules system that allowed us to target specific parts of our repo with path matching. This was ideal for our use case but trying to manage these rules by hand was already not working and would be even harder with more granular, targeted rules. CodeYam Memory uses a background agent to review your coding session transcripts, identifies confusion…

    Mar 2026

  14. 14PC
  15. 15AB

    2012 · blog.alonsebastian.com.ar

  16. 16

    Persistent memory plugin for Codex.

    Apr 2026 · github.com

  17. 17AI
  18. 18OS
  19. 19LS
  20. 20PM

    I built an MCP server that gives Claude Code long-term memory across sessions, backed by infrastructure you control. Every Claude Code session starts from zero, no memory of previous sessions. This server uses mem0ai as a library and exposes 11 MCP tools for storing, searching, and managing memories. Qdrant handles vector storage, Ollama runs embeddings locally (bge-m3), and Neo4j optionally builds a knowledge graph. Some engineering details HN might find interesting: - Zero-config auth: auto-reads Claude Code's OAT token from ~/.claude/.credentials.json, detects token type (OAT vs…

    Feb 2026 · github.com

  21. 21SM
  22. 22

    Open-source MCP server. #5 on LoCoMo. 100% local. MIT.

    May 2026 · totalmemory.dev

  23. 23IB

    I wanted to share a project I have been working on over the past week. It is a simple local memory system that saves your sessions into Markdown files, which can be viewed later. I developed this after using Claude Mem. I really enjoyed working with it, but it was consuming a lot of RAM, and each Claude session was becoming a major resource hog. I also tried other plugins and MCP solutions, but ran into similar issues, either slow performance or concerns about data being sent elsewhere. Because privacy was a big thing for me, I decided to build my own solution that keeps all data local.

    Feb 2026 · github.com

  24. 24PM

    This is my attempt in building a memory that evolves and persist for claude code. My approach is inspired from Zettelkasten method, memories are atomic, connected and dynamic. Existing memories can evolve based on newer memories. In the background it uses LLM to handle linking and evolution. I have only used it with claude code so far, it works well with me but still early stage, so rough edges likely. I'm planning to extend it to other coding agents as I use several different agents during development. Looking for feedbacks!

    Jan 2026 · github.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →