v0.8.3 · Built for Claude Code

The productivity harness
for Claude Code.

Your agents know everything you've done. They talk to each other to coordinate, grep massive libraries for minimal tokens, and never make the same mistake twice.

npm install -g greprag

Then run /greprag in any Claude Code session.

Setup

Two commands. Zero config.

Install once. Type /greprag in Claude Code. The agent walks you through email signup, hook wiring, and project anchoring. Conversation, not a manual.

Architecture

Pyramid compaction

weekly
daily
hourly
turn

Each tier synthesizes the one below. Crons fire automatically.

Isolation

Per-project memory

Each repo gets its own anchor. Memory for one project never bleeds into another.

Continuity

Session-start briefing

Yesterday's summary and recent activity appear at the top of every new session.

Fidelity

Verbatim recall

The compactor shapes once. After that, your work surfaces as-is. No LLM rewriting at retrieval.

Pricing

Free during beta

No credit card. Email signup via OTP. Use it on as many projects as you like.

Example

What you see at session start

$ claude

[GrepRAG memory: your-project]

Yesterday's summary:
1. Shipped the new auth flow with migration 028 and updated env vars.
2. Fixed the race condition in the queue worker. Added the missing lock.
3. Refactored the API layer to use the new typed-client.

Recent sessions:

4 hours ago:
1. Started exploring the bento layout for the landing page.

1 hour ago:
1. Wired the SessionStart recap hook end-to-end.

The full surface

Four stores. One engine.

What an orchestrator agent and its subagents share. Odyssey for the journey. Corpus for research. Lore to skip mistakes twice. Inbox to coordinate.

The hero

Memory alone is dead weight.

That's why greprag ships with advisors. Business. Content. Skill. Each one reads your four stores, forms strategy, and dispatches sub-agents to act.

Composition

The loop closes itself.

Chips orchestrate. Crons refine. Hooks inject. A chip hits friction, seeds a lore note, and the next chip skips the discovery. When a chip misses the moment, the hourly extractor catches it.

See the recursive learning loop →