AMUX vs Beads (bd)

“This is exactly what the agentmaxxing workflow needs. Single Python file, no external services, and the kanban board preventing duplicate agent work is genuinely clever engineering. The self-healing watchdog alone saves hours of babysitting stuck sessions.”

“The primitive here is clean: a dependency-aware DAG of tasks, stored as versioned JSONL inside your repo, with hash-based IDs that make merge collisions structurally impossible rather than a discipline problem. The DX bet — put the complexity in the data model, not the CLI — is exactly the right call, and `bd claim` for atomic task assignment is the kind of thing you only design if you've actually run two agents into each other and watched them both pull the same file. The weekend alternative here is a markdown TODO in a git repo, and it collapses the moment you have two agents or a branch switch; Beads earns its existence specifically because the naive solution fails in a documented and predictable way.”

“MIT + Commons Clause isn't really open source in the traditional sense — you can't build a commercial product on top of it. Also, coordinating 20+ agents that all share Claude Code rate limits means you'll hit API throttling walls faster than you think.”

“Direct competitor is Linear or GitHub Issues used as agent context via MCP — and the reason Beads wins that comparison is that those tools were designed for humans and bolt agent support on top, while Beads is designed for the case where the agent *is* the primary user and humans are secondary readers. The scenario where Beads breaks is a solo developer running a single-agent workflow on a small project, where the overhead of a Dolt-backed graph is pure ceremony for a problem that a flat task list already solves. What kills it in 12 months: Anthropic or the Claude Code team ships a native persistent task graph in the agent runtime itself, making Beads infrastructure that got absorbed — but that's a win condition for users, not a failure condition for the idea.”

“We're moving from one developer + one agent to one developer + agent swarm. AMUX is early infrastructure for that paradigm shift. The agent-to-agent coordination REST API hints at genuine multi-agent systems emerging from terminal tooling.”

“The thesis here is falsifiable: within 3 years, multi-agent software development becomes the default mode, and the binding constraint on parallelism shifts from compute to coordination — specifically, agents colliding on tasks, losing context at session boundaries, and producing incoherent work when they can't see each other's progress. Beads bets on this and solves exactly the coordination layer, not the intelligence layer, which is the right abstraction boundary to defend. The second-order effect that matters: if Beads or something like it becomes standard infrastructure, it shifts the locus of software project state from human-readable GitHub Issues into a machine-first graph format, which subtly transfers project legibility from PMs and engineers to the agents themselves — and that's a much larger change than the tool's README suggests.”

“The web dashboard with live terminal peeking is surprisingly polished for a side project. Being able to monitor your agent army from a mobile PWA while away from the desk is a genuinely practical touch.”

“The job-to-be-done is unambiguous: give AI coding agents persistent, collision-safe, dependency-aware task memory that survives the boundaries a scratchpad cannot. That's one job, stated without an 'and,' and Beads does not wander from it. The completeness test is where it earns real points — embedded mode means a solo developer can `brew install bd` and have a working agent memory layer without running a server, while server mode handles the multi-agent case without requiring a different mental model; you don't have to keep the old solution around for any part of the workflow. The one gap: onboarding assumes you already know what a Dolt-backed JSONL task graph is and why you want one, which means developers who haven't already felt the pain of agent context loss will bounce before they reach the moment of value.”