Hysen Labs
Open-source project
Agent-Field/plandb avatar
Agent-Field

plandb

The issue tracker your AI agents are missing. Think Linear or Jira, but for your Claude Code..

100 stars9 forksRustApache-2.0
01
DEEP OPEN-SOURCE ANALYSIS

PlanDB, a planning layer for AI coding agents

PlanDB is a local-first, single binary, SQLite-backed issue tracker aimed at AI agents, giving them a compound task graph, atomic claiming, and context that resurfaces on its own.

02
DEEP OPEN-SOURCE ANALYSIS

An issue tracker built for agents

PlanDB is described as the issue tracker AI agents are missing, a Linear or Jira for machines rather than humans. The argument is that agents decompose tasks mid-flight, parallelize across branches, and pivot entire subtrees when an approach fails, so they need infrastructure that keeps up. The answer is local-first: a single binary, SQLite backed, with no cloud, no accounts, and no setup.

03
DEEP OPEN-SOURCE ANALYSIS

One command to install

Installation is a single command. The installer downloads the binary and auto-configures your agents with full planning instructions, supporting Claude Code, Cursor, Codex, Gemini CLI, OpenCode, Windsurf, and Aider. Re-running it is safe because it is idempotent. For Claude Code specifically it installs a rules file plus a skill that adds a structured 6-phase workflow with command gotchas and anti-patterns, so agents plan automatically.

04
DEEP OPEN-SOURCE ANALYSIS

A compound graph, not a checklist

The design is a compound graph rather than a flat task list. Tasks contain subtasks to any depth, like folders, and dependencies connect tasks across those boundaries, like symlinks. A backend subtask can depend directly on a schema task in a different part of the tree, one split can turn a stuck task into three parallel subtasks, and a --dep flag wires them into the right execution order. Plans adapt mid-flight: splitting a task, inserting a missed step, or pivoting a subtree rewires dependencies automatically.

05
DEEP OPEN-SOURCE ANALYSIS

Claiming work and finding it again

Atomic claiming means two agents cannot grab the same task, with no locks, no races, and no duplicate work. Critical path analysis shows the longest dependency chain, and a bottlenecks view shows what blocks the most downstream work. Context recorded with plandb context surfaces automatically through BM25 when a related task is claimed later, so knowledge compounds across agents and sessions without anyone searching for it.

06
DEEP OPEN-SOURCE ANALYSIS

A case study and the interfaces

The README shares a test run: one Claude Code instance was given a single sentence, build a GPT from scratch in Rust and train it to do tool calling, and PlanDB handled the planning with no human intervention. The agent built a 3,769-line transformer in pure Rust with zero ML frameworks, ran 7 RL experiments, and the plan grew from 6 to 20 tasks. Three interfaces are documented: a CLI for shell agents, an MCP server for Claude Code, Cursor, and Windsurf, and an HTTP API via plandb serve for custom agents and dashboards. PlanDB is the task planning layer of the AgentField project, and SWE-AF uses it internally to coordinate parallel workstreams.

07
DEEP OPEN-SOURCE ANALYSIS

Editorial conclusion

The pitch is direct: agents have no issue tracker, and PlanDB installs with one command and no configuration. The case study of a single sentence growing into a 20 task plan is the README's best evidence that the approach holds up in practice.

08
DEEP OPEN-SOURCE ANALYSIS

Official sources

09
Community notes

Community notes