Analysis updated 2026-05-18
Give a coding agent a searchable database of previously solved problems instead of loading every note file into context.
Keep a small always-loaded index of known issues while storing full details in a queryable database.
Search past solutions by keyword using built in full text search when a familiar problem comes up again.
Track root causes, gotchas, and fixes for recurring technical problems in a team or personal project.
| tadelstein9/two-tier-memory | 1038lab/agnes-ai | 3eyedtiger/video2vrcemote | |
|---|---|---|---|
| Stars | 4 | 4 | 4 |
| Language | Python | Python | Python |
| Setup difficulty | easy | easy | easy |
| Complexity | 2/5 | 2/5 | 1/5 |
| Audience | developer | vibe coder | vibe coder |
Figures from each repo's GitHub metadata at analysis time.
No dependencies beyond Python 3 and its built in sqlite3 module.
Two-tier-memory is a small tool that gives AI coding agents a better way to remember things they have already solved, instead of relying on a growing pile of markdown files loaded into the agent's context at the start of every session. The README explains that this approach works fine with a handful of files but breaks down once there are a hundred or more, because everything competes for the same limited context space, and once that space runs out the agent starts quietly forgetting things and re-solving problems it already fixed. The fix here borrows an old idea from databases: instead of loading everything, keep two separate layers. The first layer is a small, always-loaded index file with just a title and pointer for each solved problem, so the agent knows what already exists without needing the full details. The second layer is a plain SQLite database where each hard problem is stored as a row, including the problem itself, its root cause, what worked, and any gotchas. The database can hold thousands of entries cheaply, since the agent only looks something up when it actually needs it, using a built in search feature. The tool is a single Python script with no external dependencies beyond Python's own built in SQLite support. It offers simple commands to set up the database, add a new solved problem, search past entries, look up a specific one, and regenerate the always-loaded index file from the database. The author notes that the tool alone does not solve the problem. It only works well if the agent is instructed to search the memory before trying to solve something again, and if entries are kept accurate and removed once they turn out to be wrong. This project is released under the MIT license.
A lightweight SQLite based memory tool that lets AI coding agents look up past solved problems instead of reloading a growing pile of markdown files.
Mainly Python. The stack also includes Python, SQLite.
Use freely for any purpose, including commercial use, as long as you keep the copyright notice.
Setup difficulty is rated easy, with roughly 5min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.