@graph-tl/graph 0.1.5 → 0.1.8

package/README.md

@@ -2,9 +2,28 @@
 
 A task tracker built for AI agents, not humans.
 
-Graph is an MCP server that lets agents plan, execute, and hand off work across sessions. It stores tasks as a dependency graph in SQLite — agents decompose work into subtrees, claim tasks, record what they did, and pass context to the next agent automatically.
+Graph is an MCP server that gives agents persistent memory across sessions. They decompose work into dependency trees, claim tasks, record evidence of what they did, and hand off to the next agent automatically.
 
-Humans create projects and review results. Agents do everything in between.
+## Install
+
+```bash
+npx -y @graph-tl/graph init
+```
+
+Restart Claude Code. That's it.
+
+## See it work
+
+Tell your agent: "Use graph to plan building a REST API with auth and tests."
+
+The agent will:
+1. Create a project (`graph_open`)
+2. Interview you about scope (`discovery`)
+3. Decompose into a dependency tree (`graph_plan`)
+4. Claim and work on tasks one by one (`graph_next` → work → `graph_update`)
+5. When you start a new session, the next agent picks up exactly where the last one left off (`graph_onboard`)
+
+No copy-pasting context. No re-explaining what was done. The graph carries it forward.
 
 ## Why
 
@@ -15,22 +34,10 @@ Graph gives agents what they actually need:
 - **Arbitrary nesting** — decompose work as deep as needed
 - **Dependencies with cycle detection** — the engine knows what's blocked and what's ready
 - **Server-side ranking** — one call to get the highest-priority actionable task
-- **Evidence trail** — agents record decisions, commits, and test results as they work, so the next agent inherits that knowledge
+- **Evidence trail** — agents record decisions, commits, and test results so the next agent inherits that knowledge
 - **~450 tokens** for a full claim-work-resolve cycle (vs ~5000+ with Linear MCP)
 
-## Use Cases
-
-**Multi-session projects.** You tell Claude Code to build a feature. It plans the work into a graph, finishes 3 of 5 tasks, and hits the context limit. You start a new session — the agent calls `graph_onboard`, sees what was done, what's left, and picks up the next task with full context. No copy-pasting, no re-explaining.
-
-**Agent handoff.** Agent 1 builds the backend. Agent 2 starts a fresh session to work on the frontend. It calls `graph_next` and gets the highest-priority unblocked task, along with evidence from the tasks it depends on — what was implemented, what decisions were made, what files were touched.
-
-**Complex decomposition.** You say "build me a CLI tool with auth, a database layer, and tests." The agent breaks this into a task tree with dependencies — tests depend on implementation, implementation depends on design. The engine tracks what's blocked and what's ready so the agent always works on the right thing.
-
-**Replanning mid-flight.** Halfway through a project, requirements change. The agent uses `graph_restructure` to drop irrelevant tasks, add new ones, and reparent subtrees. Dependencies recalculate automatically.
-
-## How It Works
-
-An agent's workflow with Graph looks like this:
+## How it works
 
 ```
 1. graph_onboard     → "What's the state of this project?"
@@ -41,13 +48,11 @@ An agent's workflow with Graph looks like this:
 6. graph_next        → "What's next?"
 ```
 
-When a new agent joins, `graph_onboard` returns everything it needs in one call: project status, task tree, recent evidence from completed work, all file references, and what's actionable now.
+When a new agent joins, `graph_onboard` returns everything it needs in one call: project goal, task tree, recent evidence, knowledge entries, what was recently resolved, and what's actionable now.
 
-### Example: Planning a project
+### Planning
 
-You tell the agent: "Build a REST API with authentication and tests."
-
-The agent calls `graph_plan` to create this structure:
+The agent calls `graph_plan` to create a dependency tree:
 
 ```
 Build REST API
@@ -62,9 +67,9 @@ Build REST API
     └── Integration tests    (depends on: Unit tests)
 ```
 
-`graph_next` immediately knows: "Write API spec" and "Database layer" are actionable. Everything else is blocked. When "Write API spec" is resolved, "Auth module" and "Routes" unblock automatically.
+`graph_next` immediately knows: "Write API spec" and "Database layer" are actionable. Everything else is blocked. When a task resolves, dependents unblock automatically.
 
-### Example: Agent handoff between sessions
+### Agent handoff
 
 Session 1 ends after completing 3 tasks. Session 2 starts:
 
@@ -72,13 +77,15 @@ Session 1 ends after completing 3 tasks. Session 2 starts:
 → graph_onboard("my-project")
 
 ← {
-    summary: { total: 8, resolved: 3, unresolved: 5, actionable: 2 },
-    recent_evidence: [
-      { task: "Auth module", type: "note", ref: "Used JWT with RS256, keys in /config" },
-      { task: "Auth module", type: "git", ref: "a]1b2c3d — implement auth middleware" },
-      ...
+    goal: "Build REST API",
+    hint: "2 actionable task(s) ready. 3 resolved recently.",
+    summary: { total: 8, resolved: 3, actionable: 2 },
+    recently_resolved: [
+      { summary: "Auth module", agent: "claude-code", resolved_at: "..." },
+    ],
+    knowledge: [
+      { key: "auth-decisions", content: "JWT with RS256, keys in /config" },
     ],
-    context_links: ["src/auth.ts", "src/db.ts", "config/keys.json"],
     actionable: [
       { summary: "Routes", priority: 8 },
       { summary: "Database layer", priority: 7 },
@@ -86,13 +93,11 @@ Session 1 ends after completing 3 tasks. Session 2 starts:
   }
 ```
 
-The new agent knows what was built, how, and what to do next — without reading the entire codebase or prior conversation.
-
-### Code annotations: from static comments to traceable history
+The new agent knows what was built, what decisions were made, and what to do next.
 
-Code comments tell you *what* code does. Graph annotations tell you *why it exists, who wrote it, and what was considered*.
+### Code annotations
 
-When agents work through Graph, they annotate key changes with `// [sl:nodeId]`:
+Agents annotate key changes with `// [sl:nodeId]`:
 
 ```typescript
 // [sl:OZ0or-q5TserCEfWUeMVv] Require evidence when resolving
@@ -105,28 +110,30 @@ if (input.resolved === true && !node.resolved) {
 }
 ```
 
-That node ID links to a task in the graph. A future agent (or human) can call `graph_context` or `graph_history` on that ID and get:
-
-- **What the task was** — "Enforce evidence on resolve"
-- **Why it was done** — the evidence trail: design decisions, alternatives considered
-- **What else changed** — context links to every file modified for that task
-- **Who did it and when** — the full audit log
-
-Comments are a snapshot. Graph turns your codebase into a traceable history of decisions.
-
-## Install
-
-Run this in your project directory:
-
-```bash
-npx -y @graph-tl/graph init
-```
-
-This adds Graph to your `.mcp.json`. Restart Claude Code and you're done.
+That node ID links to a task in the graph. Call `graph_context` or `graph_history` on it to see what the task was, why it was done, what files were touched, and who did it.
 
-### Manual setup
+## Tools
 
-If you prefer to configure it yourself, add this to `.mcp.json` in your project root:
+| Tool | Purpose |
+|---|---|
+| **graph_onboard** | Single-call orientation: project summary, tree, evidence, knowledge, actionable tasks. Omit project to auto-select |
+| **graph_open** | Open or create a project. No args = list all projects |
+| **graph_plan** | Batch create tasks with dependencies. Atomic |
+| **graph_next** | Get next actionable task, ranked by priority/depth/recency. Optional claim |
+| **graph_tree** | Full project tree visualization with resolve status |
+| **graph_context** | Deep-read a task: ancestors, children, dependency graph |
+| **graph_update** | Resolve tasks, add evidence. Reports newly unblocked tasks. Auto-resolves parents when all children complete |
+| **graph_connect** | Add/remove dependency edges with cycle detection |
+| **graph_query** | Search and filter by state, properties, text, ancestry |
+| **graph_restructure** | Move, merge, or drop tasks for replanning |
+| **graph_history** | Audit trail: who changed what, when |
+| **graph_knowledge_write** | Store persistent project knowledge (architecture decisions, conventions) |
+| **graph_knowledge_read** | Read knowledge entries or list all |
+| **graph_knowledge_search** | Search knowledge by substring |
+
+## Configuration
+
+Add to `.mcp.json` (or run `npx -y @graph-tl/graph init`):
 
 ```json
 {
@@ -142,62 +149,35 @@ If you prefer to configure it yourself, add this to `.mcp.json` in your project
 }
 ```
 
-### Configuration
-
 Environment variables (all optional):
 
 | Variable | Default | Description |
 |---|---|---|
-| `GRAPH_AGENT` | `default-agent` | Agent identity, attached to all writes |
-| `GRAPH_DB` | `~/.graph/db/<hash>/graph.db` | SQLite database path. Defaults to a per-project directory in your home folder — no files in your repo. |
+| `GRAPH_AGENT` | `default-agent` | Agent identity for audit trail |
+| `GRAPH_DB` | `~/.graph/db/<hash>/graph.db` | Database path (per-project, outside your repo) |
 | `GRAPH_CLAIM_TTL` | `60` | Soft claim expiry in minutes |
 
-## Tools
-
-| Tool | Purpose |
-|---|---|
-| **graph_onboard** | Single-call orientation for a new agent joining a project. Returns project summary, task tree, recent evidence, context links, and actionable tasks. |
-| **graph_open** | Open or create a project. No args = list all projects. |
-| **graph_plan** | Batch create tasks with parent-child and dependency relationships. Atomic. |
-| **graph_next** | Get the next actionable task, ranked by priority/depth/recency. Optional scope to a subtree. Optional soft claim. |
-| **graph_context** | Deep-read a task: ancestors, children tree, dependency graph. |
-| **graph_update** | Resolve tasks, add evidence/context links. Reports newly unblocked tasks. |
-| **graph_connect** | Add or remove dependency edges. Cycle detection on `depends_on`. |
-| **graph_query** | Search and filter tasks by state, properties, text, ancestry, actionability. |
-| **graph_restructure** | Move, merge, or drop tasks. For replanning. |
-| **graph_history** | Audit trail for a task — who changed what, when. |
-
-See [TOOLS.md](TOOLS.md) for full schemas and response shapes.
-
-## Token Efficiency
-
-Every response is compact JSON — no UI chrome, no avatar URLs, no pagination boilerplate. Measured against real Claude Code sessions:
+## Token efficiency
 
 | Operation | Tokens | Round trips |
 |---|---|---|
-| Onboard a new agent to a 30-task project | ~500 | 1 |
+| Onboard to a 30-task project | ~500 | 1 |
 | Plan 4 tasks with dependencies | ~220 | 1 |
-| Get next actionable task (with context) | ~300 | 1 |
-| Resolve a task + see what unblocked | ~120 | 1 |
+| Get next actionable task | ~300 | 1 |
+| Resolve + see what unblocked | ~120 | 1 |
 | **Full claim-work-resolve cycle** | **~450** | **3** |
 
-The same workflow through a traditional tracker's MCP integration typically costs ~4500 tokens across 6 round trips. **~90% token reduction, ~50% fewer round trips.**
+~90% fewer tokens and ~50% fewer round trips vs traditional tracker MCP integrations.
 
-## Data & Security
+## Data & security
 
 Graph is fully local. Your data never leaves your machine.
 
-- **Single SQLite file** — everything is stored in one `.db` file. By default it lives in `~/.graph/db/` — outside your repo, nothing to gitignore.
-- **No network calls** — Graph is a stdio MCP server. It reads and writes to disk. There is no telemetry, no cloud sync, no external API calls.
-- **No secrets in the graph** — Graph stores task summaries, evidence notes, and file path references. It does not read file contents, access credentials, or store source code.
-- **You control the data** — the SQLite file is yours. Back it up, delete it, move it between machines. There is no account, no server, no lock-in.
-
-## Design
-
-- **`resolved` boolean** is the only field the engine interprets. Drives dependency computation. `state` is freeform for agent semantics.
-- **Evidence model** — hints, notes, commits, test results are all evidence entries with a `type` field. One mechanism.
-- **Linked context** — nodes store pointers to files/commits/docs, not content blobs.
+- **Single SQLite file** in `~/.graph/db/` — outside your repo, nothing to gitignore
+- **No network calls** — stdio MCP server, no telemetry, no cloud sync
+- **No secrets stored** — task summaries, evidence notes, and file path references only
+- **You own your data** — back it up, delete it, move it between machines
 
 ## License
 
-MIT
+MIT — free and open source.

package/dist/chunk-ILTJI4ZN.js

@@ -0,0 +1,122 @@
+#!/usr/bin/env node
+
+// src/tools/agent-config.ts
+var AGENT_PROMPT = `---
+name: graph
+description: Use this agent for tasks tracked in Graph. Enforces the claim-work-resolve workflow \u2014 always checks graph_next before working, adds new work to the graph before executing, and resolves with evidence.
+tools: Read, Edit, Write, Bash, Glob, Grep, Task(Explore), AskUserQuestion
+model: sonnet
+---
+
+You are a graph-optimized agent. You execute tasks tracked in a Graph project. Follow this workflow strictly. The human directs, you execute through the graph.
+
+# Workflow
+
+## 1. ORIENT
+On your first call, orient yourself:
+\`\`\`
+graph_onboard({ project: "<project-name>" })
+\`\`\`
+Read the \`hint\` field first \u2014 it tells you exactly what to do next. Then read the summary, evidence, knowledge, and actionable tasks.
+
+**First-run:** If the tree is empty and discovery is \`"pending"\`, this is a brand new project. Jump directly to DISCOVER below. Do not call graph_next on an empty project.
+
+## 2. DISCOVER (when discovery is pending)
+If the project root or a task node has \`discovery: "pending"\`, you must complete discovery before decomposing it. Discovery is an interview with the user to understand what needs to happen.
+
+Use AskUserQuestion to cover these areas (adapt to what's relevant \u2014 skip what's obvious):
+- **Scope** \u2014 What exactly needs to happen? What's explicitly out of scope?
+- **Existing patterns** \u2014 How does the codebase currently handle similar things? (explore first, then confirm)
+- **Technical approach** \u2014 What libraries, APIs, or patterns should we use?
+- **Acceptance criteria** \u2014 How will we know it's done? What does success look like?
+
+After the interview:
+1. Write findings as knowledge: \`graph_knowledge_write({ project, key: "discovery-<topic>", content: "..." })\`
+2. Flip discovery to done: \`graph_update({ updates: [{ node_id: "<id>", discovery: "done" }] })\`
+3. NOW decompose with graph_plan
+
+Do NOT skip discovery. If you try to add children to a node with \`discovery: "pending"\`, graph_plan will reject it.
+
+## 3. CLAIM
+Get your next task:
+\`\`\`
+graph_next({ project: "<project-name>", claim: true })
+\`\`\`
+Read the task summary, ancestor chain (for scope), resolved dependencies (for context on what was done before you), and context links (for files to look at).
+
+## 4. PLAN
+If you discover work that isn't in the graph, add it BEFORE executing:
+\`\`\`
+graph_plan({ nodes: [{ ref: "new-work", parent_ref: "<parent-id>", summary: "..." }] })
+\`\`\`
+Never execute ad-hoc work. The graph is the source of truth.
+
+When decomposing work:
+- Set dependencies on LEAF nodes, not parent nodes. If "Page A" depends on "Layout", the dependency is from "Page A" to "Layout", not from the "Pages" parent to "Layout".
+- Keep tasks small and specific. A task should be completable in one session.
+- Parent nodes are organizational \u2014 they resolve when all children resolve. Don't put work in parent nodes.
+
+## 5. WORK
+Execute the claimed task. While working:
+- Annotate key code changes with \`// [sl:nodeId]\` where nodeId is the task you're working on
+- This creates a traceable link from code back to the task, its evidence, and its history
+- Build and run tests before considering a task done
+
+## 6. RESOLVE
+When done, resolve the task with evidence:
+\`\`\`
+graph_update({ updates: [{
+  node_id: "<task-id>",
+  resolved: true,
+  add_evidence: [
+    { type: "note", ref: "What you did and why" },
+    { type: "git", ref: "<commit-hash> \u2014 <summary>" },
+    { type: "test", ref: "Test results" }
+  ],
+  add_context_links: ["path/to/files/you/touched"]
+}] })
+\`\`\`
+Evidence is mandatory. At minimum, include one note explaining what you did.
+
+## 7. PAUSE
+After resolving a task, STOP. Tell the user:
+- What you just completed
+- What the next actionable task is
+- Wait for the user to say "continue" before claiming the next task
+
+The user controls the pace. Do not auto-claim the next task.
+
+# Rules
+
+- NEVER start work without a claimed task
+- NEVER resolve without evidence
+- NEVER execute ad-hoc work \u2014 add it to the graph first via graph_plan
+- NEVER auto-continue to the next task \u2014 pause and let the user decide
+- ALWAYS build and test before resolving
+- ALWAYS include context_links for files you modified when resolving
+- Parent nodes auto-resolve when all their children are resolved \u2014 you don't need to manually resolve them
+- NEVER skip discovery on nodes with discovery:pending \u2014 the system will block you from decomposing
+- If you're approaching context limits, ensure your current task's state is captured (update with evidence even if not fully resolved) so the next agent can pick up where you left off
+
+# Common mistakes to avoid
+
+- Setting dependencies on parent nodes instead of leaf nodes
+- Running project scaffolding tools (create-next-app, etc.) before planning in the graph
+- Resolving tasks without running tests
+- Doing work that isn't tracked in the graph
+- Continuing to the next task without pausing for user review
+- Trying to decompose a node without completing discovery first
+- Not writing knowledge entries during discovery \u2014 future agents need this context
+`;
+function handleAgentConfig() {
+  return {
+    agent_file: AGENT_PROMPT,
+    install_path: ".claude/agents/graph.md",
+    instructions: "Save the agent_file content to .claude/agents/graph.md in your project root. Claude Code will automatically discover it and use it when tasks match the agent description."
+  };
+}
+
+export {
+  handleAgentConfig
+};
+//# sourceMappingURL=chunk-ILTJI4ZN.js.map

package/dist/chunk-ILTJI4ZN.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/tools/agent-config.ts"],"sourcesContent":["// [sl:fV9I7Vel3xT5d_Ws2YHul] Subagent delivery — free for all (retention hook)\n\nconst AGENT_PROMPT = `---\nname: graph\ndescription: Use this agent for tasks tracked in Graph. Enforces the claim-work-resolve workflow — always checks graph_next before working, adds new work to the graph before executing, and resolves with evidence.\ntools: Read, Edit, Write, Bash, Glob, Grep, Task(Explore), AskUserQuestion\nmodel: sonnet\n---\n\nYou are a graph-optimized agent. You execute tasks tracked in a Graph project. Follow this workflow strictly. The human directs, you execute through the graph.\n\n# Workflow\n\n## 1. ORIENT\nOn your first call, orient yourself:\n\\`\\`\\`\ngraph_onboard({ project: \"<project-name>\" })\n\\`\\`\\`\nRead the \\`hint\\` field first — it tells you exactly what to do next. Then read the summary, evidence, knowledge, and actionable tasks.\n\n**First-run:** If the tree is empty and discovery is \\`\"pending\"\\`, this is a brand new project. Jump directly to DISCOVER below. Do not call graph_next on an empty project.\n\n## 2. DISCOVER (when discovery is pending)\nIf the project root or a task node has \\`discovery: \"pending\"\\`, you must complete discovery before decomposing it. Discovery is an interview with the user to understand what needs to happen.\n\nUse AskUserQuestion to cover these areas (adapt to what's relevant — skip what's obvious):\n- **Scope** — What exactly needs to happen? What's explicitly out of scope?\n- **Existing patterns** — How does the codebase currently handle similar things? (explore first, then confirm)\n- **Technical approach** — What libraries, APIs, or patterns should we use?\n- **Acceptance criteria** — How will we know it's done? What does success look like?\n\nAfter the interview:\n1. Write findings as knowledge: \\`graph_knowledge_write({ project, key: \"discovery-<topic>\", content: \"...\" })\\`\n2. Flip discovery to done: \\`graph_update({ updates: [{ node_id: \"<id>\", discovery: \"done\" }] })\\`\n3. NOW decompose with graph_plan\n\nDo NOT skip discovery. If you try to add children to a node with \\`discovery: \"pending\"\\`, graph_plan will reject it.\n\n## 3. CLAIM\nGet your next task:\n\\`\\`\\`\ngraph_next({ project: \"<project-name>\", claim: true })\n\\`\\`\\`\nRead the task summary, ancestor chain (for scope), resolved dependencies (for context on what was done before you), and context links (for files to look at).\n\n## 4. PLAN\nIf you discover work that isn't in the graph, add it BEFORE executing:\n\\`\\`\\`\ngraph_plan({ nodes: [{ ref: \"new-work\", parent_ref: \"<parent-id>\", summary: \"...\" }] })\n\\`\\`\\`\nNever execute ad-hoc work. The graph is the source of truth.\n\nWhen decomposing work:\n- Set dependencies on LEAF nodes, not parent nodes. If \"Page A\" depends on \"Layout\", the dependency is from \"Page A\" to \"Layout\", not from the \"Pages\" parent to \"Layout\".\n- Keep tasks small and specific. A task should be completable in one session.\n- Parent nodes are organizational — they resolve when all children resolve. Don't put work in parent nodes.\n\n## 5. WORK\nExecute the claimed task. While working:\n- Annotate key code changes with \\`// [sl:nodeId]\\` where nodeId is the task you're working on\n- This creates a traceable link from code back to the task, its evidence, and its history\n- Build and run tests before considering a task done\n\n## 6. RESOLVE\nWhen done, resolve the task with evidence:\n\\`\\`\\`\ngraph_update({ updates: [{\n  node_id: \"<task-id>\",\n  resolved: true,\n  add_evidence: [\n    { type: \"note\", ref: \"What you did and why\" },\n    { type: \"git\", ref: \"<commit-hash> — <summary>\" },\n    { type: \"test\", ref: \"Test results\" }\n  ],\n  add_context_links: [\"path/to/files/you/touched\"]\n}] })\n\\`\\`\\`\nEvidence is mandatory. At minimum, include one note explaining what you did.\n\n## 7. PAUSE\nAfter resolving a task, STOP. Tell the user:\n- What you just completed\n- What the next actionable task is\n- Wait for the user to say \"continue\" before claiming the next task\n\nThe user controls the pace. Do not auto-claim the next task.\n\n# Rules\n\n- NEVER start work without a claimed task\n- NEVER resolve without evidence\n- NEVER execute ad-hoc work — add it to the graph first via graph_plan\n- NEVER auto-continue to the next task — pause and let the user decide\n- ALWAYS build and test before resolving\n- ALWAYS include context_links for files you modified when resolving\n- Parent nodes auto-resolve when all their children are resolved — you don't need to manually resolve them\n- NEVER skip discovery on nodes with discovery:pending — the system will block you from decomposing\n- If you're approaching context limits, ensure your current task's state is captured (update with evidence even if not fully resolved) so the next agent can pick up where you left off\n\n# Common mistakes to avoid\n\n- Setting dependencies on parent nodes instead of leaf nodes\n- Running project scaffolding tools (create-next-app, etc.) before planning in the graph\n- Resolving tasks without running tests\n- Doing work that isn't tracked in the graph\n- Continuing to the next task without pausing for user review\n- Trying to decompose a node without completing discovery first\n- Not writing knowledge entries during discovery — future agents need this context\n`;\n\nexport interface AgentConfigResult {\n  agent_file: string;\n  install_path: string;\n  instructions: string;\n}\n\nexport function handleAgentConfig(): AgentConfigResult {\n  return {\n    agent_file: AGENT_PROMPT,\n    install_path: \".claude/agents/graph.md\",\n    instructions:\n      \"Save the agent_file content to .claude/agents/graph.md in your project root. \" +\n      \"Claude Code will automatically discover it and use it when tasks match the agent description.\",\n  };\n}\n"],"mappings":";;;AAEA,IAAM,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkHd,SAAS,oBAAuC;AACrD,SAAO;AAAA,IACL,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,cACE;AAAA,EAEJ;AACF;","names":[]}

package/dist/{chunk-NWCUIW6D.js → chunk-TWT5GUXW.js}

@@ -95,6 +95,12 @@ function migrate(db2) {
       UPDATE nodes SET depth = (SELECT depth FROM tree WHERE tree.id = nodes.id)
     `);
   }
+  const hasDiscovery = db2.prepare(
+    "SELECT COUNT(*) as cnt FROM pragma_table_info('nodes') WHERE name = 'discovery'"
+  ).get();
+  if (hasDiscovery.cnt === 0) {
+    db2.exec("ALTER TABLE nodes ADD COLUMN discovery TEXT DEFAULT NULL");
+  }
 }
 function checkpointDb() {
   if (db) {
@@ -238,6 +244,7 @@ function rowToNode(row) {
     summary: row.summary,
     resolved: row.resolved === 1,
     depth: row.depth,
+    discovery: row.discovery ?? null,
     state: row.state ? JSON.parse(row.state) : null,
     properties: JSON.parse(row.properties),
     context_links: JSON.parse(row.context_links),
@@ -264,6 +271,7 @@ function createNode(input) {
     summary: input.summary,
     resolved: false,
     depth,
+    discovery: input.discovery ?? null,
     state: input.state ?? null,
     properties: input.properties ?? {},
     context_links: input.context_links ?? [],
@@ -273,8 +281,8 @@ function createNode(input) {
     updated_at: now
   };
   db2.prepare(`
-    INSERT INTO nodes (id, rev, parent, project, summary, resolved, depth, state, properties, context_links, evidence, created_by, created_at, updated_at)
-    VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    INSERT INTO nodes (id, rev, parent, project, summary, resolved, depth, discovery, state, properties, context_links, evidence, created_by, created_at, updated_at)
+    VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
   `).run(
     node.id,
     node.rev,
@@ -283,6 +291,7 @@ function createNode(input) {
     node.summary,
     0,
     node.depth,
+    node.discovery,
     node.state !== null ? JSON.stringify(node.state) : null,
     JSON.stringify(node.properties),
     JSON.stringify(node.context_links),
@@ -356,6 +365,7 @@ function updateNode(input) {
   const changes = [];
   const now = (/* @__PURE__ */ new Date()).toISOString();
   let newResolved = node.resolved;
+  let newDiscovery = node.discovery;
   let newState = node.state;
   let newSummary = node.summary;
   let newProperties = { ...node.properties };
@@ -375,6 +385,10 @@ function updateNode(input) {
     changes.push({ field: "resolved", before: node.resolved, after: input.resolved });
     newResolved = input.resolved;
   }
+  if (input.discovery !== void 0 && input.discovery !== node.discovery) {
+    changes.push({ field: "discovery", before: node.discovery, after: input.discovery });
+    newDiscovery = input.discovery;
+  }
   if (input.state !== void 0) {
     changes.push({ field: "state", before: node.state, after: input.state });
     newState = input.state;
@@ -433,6 +447,7 @@ function updateNode(input) {
     UPDATE nodes SET
       rev = ?,
       resolved = ?,
+      discovery = ?,
       state = ?,
       summary = ?,
       properties = ?,
@@ -443,6 +458,7 @@ function updateNode(input) {
   `).run(
     newRev,
     newResolved ? 1 : 0,
+    newDiscovery,
     newState !== null ? JSON.stringify(newState) : null,
     newSummary,
     JSON.stringify(newProperties),
@@ -515,4 +531,4 @@ export {
   updateNode,
   getProjectSummary
 };
-//# sourceMappingURL=chunk-NWCUIW6D.js.map
+//# sourceMappingURL=chunk-TWT5GUXW.js.map

package/dist/chunk-TWT5GUXW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/nodes.ts","../src/db.ts","../src/events.ts","../src/validate.ts"],"sourcesContent":["import { nanoid } from \"nanoid\";\nimport { getDb } from \"./db.js\";\nimport { logEvent } from \"./events.js\";\nimport { EngineError } from \"./validate.js\";\nimport type { Node, NodeRow, Evidence, FieldChange } from \"./types.js\";\n\n// --- Row <-> Node conversion ---\n\nfunction rowToNode(row: NodeRow): Node {\n  return {\n    id: row.id,\n    rev: row.rev,\n    parent: row.parent,\n    project: row.project,\n    summary: row.summary,\n    resolved: row.resolved === 1,\n    depth: row.depth,\n    discovery: row.discovery ?? null,\n    state: row.state ? JSON.parse(row.state) : null,\n    properties: JSON.parse(row.properties),\n    context_links: JSON.parse(row.context_links),\n    evidence: JSON.parse(row.evidence),\n    created_by: row.created_by,\n    created_at: row.created_at,\n    updated_at: row.updated_at,\n  };\n}\n\n// --- Create ---\n\nexport interface CreateNodeInput {\n  parent?: string;\n  project: string;\n  summary: string;\n  discovery?: string | null;\n  state?: unknown;\n  properties?: Record<string, unknown>;\n  context_links?: string[];\n  agent: string;\n}\n\nexport function createNode(input: CreateNodeInput): Node {\n  const db = getDb();\n  const now = new Date().toISOString();\n  const id = nanoid();\n\n  // [sl:yBBVr4wcgVfWA_w8U8hQo] Compute depth from parent\n  let depth = 0;\n  if (input.parent) {\n    const parentRow = db.prepare(\"SELECT depth FROM nodes WHERE id = ?\").get(input.parent) as { depth: number } | undefined;\n    if (parentRow) depth = parentRow.depth + 1;\n  }\n\n  const node: Node = {\n    id,\n    rev: 1,\n    parent: input.parent ?? null,\n    project: input.project,\n    summary: input.summary,\n    resolved: false,\n    depth,\n    discovery: input.discovery ?? null,\n    state: input.state ?? null,\n    properties: input.properties ?? {},\n    context_links: input.context_links ?? [],\n    evidence: [],\n    created_by: input.agent,\n    created_at: now,\n    updated_at: now,\n  };\n\n  db.prepare(`\n    INSERT INTO nodes (id, rev, parent, project, summary, resolved, depth, discovery, state, properties, context_links, evidence, created_by, created_at, updated_at)\n    VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n  `).run(\n    node.id,\n    node.rev,\n    node.parent,\n    node.project,\n    node.summary,\n    0,\n    node.depth,\n    node.discovery,\n    node.state !== null ? JSON.stringify(node.state) : null,\n    JSON.stringify(node.properties),\n    JSON.stringify(node.context_links),\n    JSON.stringify(node.evidence),\n    node.created_by,\n    node.created_at,\n    node.updated_at\n  );\n\n  logEvent(node.id, input.agent, \"created\", [\n    { field: \"summary\", before: null, after: node.summary },\n  ]);\n\n  return node;\n}\n\n// --- Read ---\n\nexport function getNode(id: string): Node | null {\n  const db = getDb();\n  const row = db.prepare(\"SELECT * FROM nodes WHERE id = ?\").get(id) as\n    | NodeRow\n    | undefined;\n  return row ? rowToNode(row) : null;\n}\n\nexport function getNodeOrThrow(id: string): Node {\n  const node = getNode(id);\n  if (!node) {\n    throw new EngineError(\"node_not_found\", `Node not found: ${id}. Verify the ID is correct and the node hasn't been deleted.`);\n  }\n  return node;\n}\n\nexport function getChildren(parentId: string): Node[] {\n  const db = getDb();\n  const rows = db\n    .prepare(\"SELECT * FROM nodes WHERE parent = ?\")\n    .all(parentId) as NodeRow[];\n  return rows.map(rowToNode);\n}\n\nexport function getAncestors(nodeId: string): Array<{ id: string; summary: string; resolved: boolean }> {\n  const ancestors: Array<{ id: string; summary: string; resolved: boolean }> = [];\n  let current = getNode(nodeId);\n\n  while (current?.parent) {\n    const parent = getNode(current.parent);\n    if (!parent) break;\n    ancestors.unshift({ id: parent.id, summary: parent.summary, resolved: parent.resolved });\n    current = parent;\n  }\n\n  return ancestors;\n}\n\nexport function getProjectRoot(project: string): Node | null {\n  const db = getDb();\n  const row = db\n    .prepare(\"SELECT * FROM nodes WHERE project = ? AND parent IS NULL\")\n    .get(project) as NodeRow | undefined;\n  return row ? rowToNode(row) : null;\n}\n\nexport function listProjects(): Array<{\n  project: string;\n  id: string;\n  summary: string;\n  total: number;\n  resolved: number;\n  unresolved: number;\n  updated_at: string;\n}> {\n  const db = getDb();\n\n  const roots = db\n    .prepare(\"SELECT * FROM nodes WHERE parent IS NULL\")\n    .all() as NodeRow[];\n\n  return roots.map((root) => {\n    const counts = db\n      .prepare(\n        `SELECT\n          COUNT(*) as total,\n          SUM(CASE WHEN resolved = 1 THEN 1 ELSE 0 END) as resolved\n        FROM nodes WHERE project = ?`\n      )\n      .get(root.project) as { total: number; resolved: number };\n\n    return {\n      project: root.project,\n      id: root.id,\n      summary: root.summary,\n      total: counts.total,\n      resolved: counts.resolved,\n      unresolved: counts.total - counts.resolved,\n      updated_at: root.updated_at,\n    };\n  });\n}\n\n// --- Update ---\n\nexport interface UpdateNodeInput {\n  node_id: string;\n  agent: string;\n  resolved?: boolean;\n  discovery?: string | null;\n  state?: unknown;\n  summary?: string;\n  properties?: Record<string, unknown>;\n  add_context_links?: string[];\n  remove_context_links?: string[];\n  add_evidence?: Array<{ type: string; ref: string }>;\n}\n\nexport function updateNode(input: UpdateNodeInput): Node {\n  const db = getDb();\n  const node = getNodeOrThrow(input.node_id);\n  const changes: FieldChange[] = [];\n  const now = new Date().toISOString();\n\n  let newResolved = node.resolved;\n  let newDiscovery = node.discovery;\n  let newState = node.state;\n  let newSummary = node.summary;\n  let newProperties = { ...node.properties };\n  let newContextLinks = [...node.context_links];\n  let newEvidence = [...node.evidence];\n\n  // [sl:OZ0or-q5TserCEfWUeMVv] Require evidence when resolving\n  if (input.resolved === true && !node.resolved) {\n    const hasExistingEvidence = node.evidence.length > 0;\n    const hasNewEvidence = input.add_evidence && input.add_evidence.length > 0;\n    if (!hasExistingEvidence && !hasNewEvidence) {\n      throw new EngineError(\n        \"evidence_required\",\n        `Cannot resolve node ${input.node_id} without evidence. Add at least one add_evidence entry (type: 'git', 'note', 'test', etc.) explaining what was done.`\n      );\n    }\n  }\n\n  if (input.resolved !== undefined && input.resolved !== node.resolved) {\n    changes.push({ field: \"resolved\", before: node.resolved, after: input.resolved });\n    newResolved = input.resolved;\n  }\n\n  if (input.discovery !== undefined && input.discovery !== node.discovery) {\n    changes.push({ field: \"discovery\", before: node.discovery, after: input.discovery });\n    newDiscovery = input.discovery;\n  }\n\n  if (input.state !== undefined) {\n    changes.push({ field: \"state\", before: node.state, after: input.state });\n    newState = input.state;\n  }\n\n  if (input.summary !== undefined && input.summary !== node.summary) {\n    changes.push({ field: \"summary\", before: node.summary, after: input.summary });\n    newSummary = input.summary;\n  }\n\n  if (input.properties) {\n    for (const [key, value] of Object.entries(input.properties)) {\n      if (value === null) {\n        if (key in newProperties) {\n          changes.push({ field: `properties.${key}`, before: newProperties[key], after: null });\n          delete newProperties[key];\n        }\n      } else {\n        changes.push({ field: `properties.${key}`, before: newProperties[key] ?? null, after: value });\n        newProperties[key] = value;\n      }\n    }\n  }\n\n  if (input.add_context_links) {\n    for (const link of input.add_context_links) {\n      if (!newContextLinks.includes(link)) {\n        newContextLinks.push(link);\n        changes.push({ field: \"context_links\", before: null, after: link });\n      }\n    }\n  }\n\n  if (input.remove_context_links) {\n    for (const link of input.remove_context_links) {\n      const idx = newContextLinks.indexOf(link);\n      if (idx !== -1) {\n        newContextLinks.splice(idx, 1);\n        changes.push({ field: \"context_links\", before: link, after: null });\n      }\n    }\n  }\n\n  if (input.add_evidence) {\n    for (const ev of input.add_evidence) {\n      const evidence: Evidence = {\n        type: ev.type,\n        ref: ev.ref,\n        agent: input.agent,\n        timestamp: now,\n      };\n      newEvidence.push(evidence);\n      changes.push({ field: \"evidence\", before: null, after: evidence });\n    }\n  }\n\n  if (changes.length === 0) {\n    return node;\n  }\n\n  const newRev = node.rev + 1;\n\n  db.prepare(`\n    UPDATE nodes SET\n      rev = ?,\n      resolved = ?,\n      discovery = ?,\n      state = ?,\n      summary = ?,\n      properties = ?,\n      context_links = ?,\n      evidence = ?,\n      updated_at = ?\n    WHERE id = ?\n  `).run(\n    newRev,\n    newResolved ? 1 : 0,\n    newDiscovery,\n    newState !== null ? JSON.stringify(newState) : null,\n    newSummary,\n    JSON.stringify(newProperties),\n    JSON.stringify(newContextLinks),\n    JSON.stringify(newEvidence),\n    now,\n    input.node_id\n  );\n\n  const action = input.resolved === true ? \"resolved\" : \"updated\";\n  logEvent(input.node_id, input.agent, action, changes);\n\n  return getNodeOrThrow(input.node_id);\n}\n\n// --- Query helpers ---\n\nexport function getProjectSummary(project: string): {\n  total: number;\n  resolved: number;\n  unresolved: number;\n  blocked: number;\n  actionable: number;\n} {\n  const db = getDb();\n\n  const counts = db\n    .prepare(\n      `SELECT\n        COUNT(*) as total,\n        SUM(CASE WHEN resolved = 1 THEN 1 ELSE 0 END) as resolved\n      FROM nodes WHERE project = ?`\n    )\n    .get(project) as { total: number; resolved: number };\n\n  // Blocked: unresolved nodes that have at least one unresolved dependency\n  const blocked = db\n    .prepare(\n      `SELECT COUNT(DISTINCT n.id) as count\n       FROM nodes n\n       JOIN edges e ON e.from_node = n.id AND e.type = 'depends_on'\n       JOIN nodes dep ON dep.id = e.to_node AND dep.resolved = 0\n       WHERE n.project = ? AND n.resolved = 0`\n    )\n    .get(project) as { count: number };\n\n  // Actionable: unresolved leaves (no unresolved children) with all deps resolved\n  const actionable = db\n    .prepare(\n      `SELECT COUNT(*) as count FROM nodes n\n       WHERE n.project = ? AND n.resolved = 0\n       AND NOT EXISTS (\n         SELECT 1 FROM nodes child WHERE child.parent = n.id AND child.resolved = 0\n       )\n       AND NOT EXISTS (\n         SELECT 1 FROM edges e\n         JOIN nodes dep ON dep.id = e.to_node AND dep.resolved = 0\n         WHERE e.from_node = n.id AND e.type = 'depends_on'\n       )`\n    )\n    .get(project) as { count: number };\n\n  return {\n    total: counts.total,\n    resolved: counts.resolved,\n    unresolved: counts.total - counts.resolved,\n    blocked: blocked.count,\n    actionable: actionable.count,\n  };\n}\n","import Database from \"better-sqlite3\";\nimport path from \"path\";\n\nlet db: Database.Database;\nlet dbPath: string;\n\nexport function setDbPath(p: string): void {\n  dbPath = p;\n}\n\nexport function getDb(): Database.Database {\n  if (!db) {\n    const resolvedPath = dbPath ?? path.resolve(\"graph.db\");\n    db = new Database(resolvedPath);\n    db.pragma(\"journal_mode = WAL\");\n    db.pragma(\"synchronous = FULL\");\n    db.pragma(\"foreign_keys = ON\");\n    migrate(db);\n  }\n  return db;\n}\n\nexport function initDb(p?: string): Database.Database {\n  // Close existing db if any (used by tests to reset state)\n  if (db) {\n    db.close();\n    db = undefined!;\n  }\n  if (p) dbPath = p;\n  return getDb();\n}\n\nfunction migrate(db: Database.Database): void {\n  db.exec(`\n    CREATE TABLE IF NOT EXISTS nodes (\n      id TEXT PRIMARY KEY,\n      rev INTEGER NOT NULL DEFAULT 1,\n      parent TEXT REFERENCES nodes(id),\n      project TEXT NOT NULL,\n      summary TEXT NOT NULL,\n      resolved INTEGER NOT NULL DEFAULT 0,\n      depth INTEGER NOT NULL DEFAULT 0,\n      state TEXT,\n      properties TEXT NOT NULL DEFAULT '{}',\n      context_links TEXT NOT NULL DEFAULT '[]',\n      evidence TEXT NOT NULL DEFAULT '[]',\n      created_by TEXT NOT NULL,\n      created_at TEXT NOT NULL,\n      updated_at TEXT NOT NULL\n    );\n\n    CREATE TABLE IF NOT EXISTS edges (\n      id TEXT PRIMARY KEY,\n      from_node TEXT NOT NULL REFERENCES nodes(id),\n      to_node TEXT NOT NULL REFERENCES nodes(id),\n      type TEXT NOT NULL,\n      created_at TEXT NOT NULL,\n      UNIQUE(from_node, to_node, type)\n    );\n\n    CREATE TABLE IF NOT EXISTS events (\n      id TEXT PRIMARY KEY,\n      node_id TEXT NOT NULL REFERENCES nodes(id),\n      agent TEXT NOT NULL,\n      action TEXT NOT NULL,\n      changes TEXT NOT NULL,\n      timestamp TEXT NOT NULL\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_nodes_project ON nodes(project);\n    CREATE INDEX IF NOT EXISTS idx_nodes_parent ON nodes(parent);\n    CREATE INDEX IF NOT EXISTS idx_nodes_resolved ON nodes(project, resolved);\n    CREATE INDEX IF NOT EXISTS idx_edges_from ON edges(from_node);\n    CREATE INDEX IF NOT EXISTS idx_edges_to ON edges(to_node);\n    CREATE INDEX IF NOT EXISTS idx_edges_type ON edges(from_node, type);\n    CREATE INDEX IF NOT EXISTS idx_events_node ON events(node_id);\n\n    CREATE TABLE IF NOT EXISTS knowledge (\n      id TEXT PRIMARY KEY,\n      project TEXT NOT NULL,\n      key TEXT NOT NULL,\n      content TEXT NOT NULL,\n      created_by TEXT NOT NULL,\n      created_at TEXT NOT NULL,\n      updated_at TEXT NOT NULL,\n      UNIQUE(project, key)\n    );\n\n    CREATE INDEX IF NOT EXISTS idx_knowledge_project ON knowledge(project);\n  `);\n\n  // [sl:yBBVr4wcgVfWA_w8U8hQo] Migration: add depth column if it doesn't exist\n  const hasDepth = db.prepare(\n    \"SELECT COUNT(*) as cnt FROM pragma_table_info('nodes') WHERE name = 'depth'\"\n  ).get() as { cnt: number };\n\n  if (hasDepth.cnt === 0) {\n    db.exec(\"ALTER TABLE nodes ADD COLUMN depth INTEGER NOT NULL DEFAULT 0\");\n    // Backfill depths using recursive CTE\n    db.exec(`\n      WITH RECURSIVE tree(id, depth) AS (\n        SELECT id, 0 FROM nodes WHERE parent IS NULL\n        UNION ALL\n        SELECT n.id, t.depth + 1\n        FROM nodes n JOIN tree t ON n.parent = t.id\n      )\n      UPDATE nodes SET depth = (SELECT depth FROM tree WHERE tree.id = nodes.id)\n    `);\n  }\n\n  // [sl:AOXqUIhpW2-gdMqWATf66] Migration: add discovery column if it doesn't exist\n  const hasDiscovery = db.prepare(\n    \"SELECT COUNT(*) as cnt FROM pragma_table_info('nodes') WHERE name = 'discovery'\"\n  ).get() as { cnt: number };\n\n  if (hasDiscovery.cnt === 0) {\n    db.exec(\"ALTER TABLE nodes ADD COLUMN discovery TEXT DEFAULT NULL\");\n  }\n}\n\nexport function checkpointDb(): void {\n  if (db) {\n    db.pragma(\"wal_checkpoint(TRUNCATE)\");\n  }\n}\n\nexport function closeDb(): void {\n  if (db) {\n    checkpointDb();\n    db.close();\n  }\n}\n","import { nanoid } from \"nanoid\";\nimport { getDb } from \"./db.js\";\nimport type { FieldChange, Event } from \"./types.js\";\n\nconst INSERT_EVENT = `\n  INSERT INTO events (id, node_id, agent, action, changes, timestamp)\n  VALUES (?, ?, ?, ?, ?, ?)\n`;\n\nexport function logEvent(\n  nodeId: string,\n  agent: string,\n  action: string,\n  changes: FieldChange[]\n): Event {\n  const db = getDb();\n  const event: Event = {\n    id: nanoid(),\n    node_id: nodeId,\n    agent,\n    action,\n    changes,\n    timestamp: new Date().toISOString(),\n  };\n\n  db.prepare(INSERT_EVENT).run(\n    event.id,\n    event.node_id,\n    event.agent,\n    event.action,\n    JSON.stringify(event.changes),\n    event.timestamp\n  );\n\n  return event;\n}\n\nexport function getEvents(\n  nodeId: string,\n  limit: number = 20,\n  cursor?: string\n): { events: Event[]; next_cursor: string | null } {\n  const db = getDb();\n\n  let query: string;\n  let params: unknown[];\n\n  if (cursor) {\n    query = `\n      SELECT * FROM events\n      WHERE node_id = ? AND timestamp < ?\n      ORDER BY timestamp DESC\n      LIMIT ?\n    `;\n    params = [nodeId, cursor, limit + 1];\n  } else {\n    query = `\n      SELECT * FROM events\n      WHERE node_id = ?\n      ORDER BY timestamp DESC\n      LIMIT ?\n    `;\n    params = [nodeId, limit + 1];\n  }\n\n  const rows = db.prepare(query).all(...params) as Array<{\n    id: string;\n    node_id: string;\n    agent: string;\n    action: string;\n    changes: string;\n    timestamp: string;\n  }>;\n\n  const hasMore = rows.length > limit;\n  const slice = hasMore ? rows.slice(0, limit) : rows;\n\n  const events: Event[] = slice.map((row) => ({\n    id: row.id,\n    node_id: row.node_id,\n    agent: row.agent,\n    action: row.action,\n    changes: JSON.parse(row.changes),\n    timestamp: row.timestamp,\n  }));\n\n  return {\n    events,\n    next_cursor: hasMore ? slice[slice.length - 1].timestamp : null,\n  };\n}\n","export class ValidationError extends Error {\n  code = \"validation_error\";\n  constructor(message: string) {\n    super(message);\n    this.name = \"ValidationError\";\n  }\n}\n\nexport class EngineError extends Error {\n  code: string;\n  constructor(code: string, message: string) {\n    super(message);\n    this.name = \"EngineError\";\n    this.code = code;\n  }\n}\n\nexport function requireString(value: unknown, field: string): string {\n  if (typeof value !== \"string\" || value.trim().length === 0) {\n    throw new ValidationError(`${field} is required and must be a non-empty string`);\n  }\n  return value.trim();\n}\n\nexport function optionalString(value: unknown, field: string): string | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"string\") {\n    throw new ValidationError(`${field} must be a string`);\n  }\n  return value;\n}\n\nexport function requireArray<T>(value: unknown, field: string): T[] {\n  if (!Array.isArray(value) || value.length === 0) {\n    throw new ValidationError(`${field} is required and must be a non-empty array`);\n  }\n  return value as T[];\n}\n\nexport function optionalArray<T>(value: unknown, field: string): T[] | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (!Array.isArray(value)) {\n    throw new ValidationError(`${field} must be an array`);\n  }\n  return value as T[];\n}\n\nexport function optionalNumber(value: unknown, field: string, min?: number, max?: number): number | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"number\" || isNaN(value)) {\n    throw new ValidationError(`${field} must be a number`);\n  }\n  if (min !== undefined && value < min) {\n    throw new ValidationError(`${field} must be >= ${min}`);\n  }\n  if (max !== undefined && value > max) {\n    throw new ValidationError(`${field} must be <= ${max}`);\n  }\n  return value;\n}\n\nexport function optionalBoolean(value: unknown, field: string): boolean | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"boolean\") {\n    throw new ValidationError(`${field} must be a boolean`);\n  }\n  return value;\n}\n\nexport function requireObject(value: unknown, field: string): Record<string, unknown> {\n  if (value === null || typeof value !== \"object\" || Array.isArray(value)) {\n    throw new ValidationError(`${field} is required and must be an object`);\n  }\n  return value as Record<string, unknown>;\n}\n"],"mappings":";;;AAAA,SAAS,UAAAA,eAAc;;;ACAvB,OAAO,cAAc;AACrB,OAAO,UAAU;AAEjB,IAAI;AACJ,IAAI;AAEG,SAAS,UAAU,GAAiB;AACzC,WAAS;AACX;AAEO,SAAS,QAA2B;AACzC,MAAI,CAAC,IAAI;AACP,UAAM,eAAe,UAAU,KAAK,QAAQ,UAAU;AACtD,SAAK,IAAI,SAAS,YAAY;AAC9B,OAAG,OAAO,oBAAoB;AAC9B,OAAG,OAAO,oBAAoB;AAC9B,OAAG,OAAO,mBAAmB;AAC7B,YAAQ,EAAE;AAAA,EACZ;AACA,SAAO;AACT;AAYA,SAAS,QAAQC,KAA6B;AAC5C,EAAAA,IAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAwDP;AAGD,QAAM,WAAWA,IAAG;AAAA,IAClB;AAAA,EACF,EAAE,IAAI;AAEN,MAAI,SAAS,QAAQ,GAAG;AACtB,IAAAA,IAAG,KAAK,+DAA+D;AAEvE,IAAAA,IAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQP;AAAA,EACH;AAGA,QAAM,eAAeA,IAAG;AAAA,IACtB;AAAA,EACF,EAAE,IAAI;AAEN,MAAI,aAAa,QAAQ,GAAG;AAC1B,IAAAA,IAAG,KAAK,0DAA0D;AAAA,EACpE;AACF;AAEO,SAAS,eAAqB;AACnC,MAAI,IAAI;AACN,OAAG,OAAO,0BAA0B;AAAA,EACtC;AACF;AAEO,SAAS,UAAgB;AAC9B,MAAI,IAAI;AACN,iBAAa;AACb,OAAG,MAAM;AAAA,EACX;AACF;;;ACnIA,SAAS,cAAc;AAIvB,IAAM,eAAe;AAAA;AAAA;AAAA;AAKd,SAAS,SACd,QACA,OACA,QACA,SACO;AACP,QAAMC,MAAK,MAAM;AACjB,QAAM,QAAe;AAAA,IACnB,IAAI,OAAO;AAAA,IACX,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,EACpC;AAEA,EAAAA,IAAG,QAAQ,YAAY,EAAE;AAAA,IACvB,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,KAAK,UAAU,MAAM,OAAO;AAAA,IAC5B,MAAM;AAAA,EACR;AAEA,SAAO;AACT;AAEO,SAAS,UACd,QACA,QAAgB,IAChB,QACiD;AACjD,QAAMA,MAAK,MAAM;AAEjB,MAAI;AACJ,MAAI;AAEJ,MAAI,QAAQ;AACV,YAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAMR,aAAS,CAAC,QAAQ,QAAQ,QAAQ,CAAC;AAAA,EACrC,OAAO;AACL,YAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAMR,aAAS,CAAC,QAAQ,QAAQ,CAAC;AAAA,EAC7B;AAEA,QAAM,OAAOA,IAAG,QAAQ,KAAK,EAAE,IAAI,GAAG,MAAM;AAS5C,QAAM,UAAU,KAAK,SAAS;AAC9B,QAAM,QAAQ,UAAU,KAAK,MAAM,GAAG,KAAK,IAAI;AAE/C,QAAM,SAAkB,MAAM,IAAI,CAAC,SAAS;AAAA,IAC1C,IAAI,IAAI;AAAA,IACR,SAAS,IAAI;AAAA,IACb,OAAO,IAAI;AAAA,IACX,QAAQ,IAAI;AAAA,IACZ,SAAS,KAAK,MAAM,IAAI,OAAO;AAAA,IAC/B,WAAW,IAAI;AAAA,EACjB,EAAE;AAEF,SAAO;AAAA,IACL;AAAA,IACA,aAAa,UAAU,MAAM,MAAM,SAAS,CAAC,EAAE,YAAY;AAAA,EAC7D;AACF;;;AC1FO,IAAM,kBAAN,cAA8B,MAAM;AAAA,EACzC,OAAO;AAAA,EACP,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEO,IAAM,cAAN,cAA0B,MAAM;AAAA,EACrC;AAAA,EACA,YAAY,MAAc,SAAiB;AACzC,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EACd;AACF;AAEO,SAAS,cAAc,OAAgB,OAAuB;AACnE,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,WAAW,GAAG;AAC1D,UAAM,IAAI,gBAAgB,GAAG,KAAK,6CAA6C;AAAA,EACjF;AACA,SAAO,MAAM,KAAK;AACpB;AAEO,SAAS,eAAe,OAAgB,OAAmC;AAChF,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,gBAAgB,GAAG,KAAK,mBAAmB;AAAA,EACvD;AACA,SAAO;AACT;AAEO,SAAS,aAAgB,OAAgB,OAAoB;AAClE,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAC/C,UAAM,IAAI,gBAAgB,GAAG,KAAK,4CAA4C;AAAA,EAChF;AACA,SAAO;AACT;AAUO,SAAS,eAAe,OAAgB,OAAe,KAAc,KAAkC;AAC5G,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,GAAG;AAC7C,UAAM,IAAI,gBAAgB,GAAG,KAAK,mBAAmB;AAAA,EACvD;AACA,MAAI,QAAQ,UAAa,QAAQ,KAAK;AACpC,UAAM,IAAI,gBAAgB,GAAG,KAAK,eAAe,GAAG,EAAE;AAAA,EACxD;AACA,MAAI,QAAQ,UAAa,QAAQ,KAAK;AACpC,UAAM,IAAI,gBAAgB,GAAG,KAAK,eAAe,GAAG,EAAE;AAAA,EACxD;AACA,SAAO;AACT;AAEO,SAAS,gBAAgB,OAAgB,OAAoC;AAClF,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,WAAW;AAC9B,UAAM,IAAI,gBAAgB,GAAG,KAAK,oBAAoB;AAAA,EACxD;AACA,SAAO;AACT;;;AH3DA,SAAS,UAAU,KAAoB;AACrC,SAAO;AAAA,IACL,IAAI,IAAI;AAAA,IACR,KAAK,IAAI;AAAA,IACT,QAAQ,IAAI;AAAA,IACZ,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,UAAU,IAAI,aAAa;AAAA,IAC3B,OAAO,IAAI;AAAA,IACX,WAAW,IAAI,aAAa;AAAA,IAC5B,OAAO,IAAI,QAAQ,KAAK,MAAM,IAAI,KAAK,IAAI;AAAA,IAC3C,YAAY,KAAK,MAAM,IAAI,UAAU;AAAA,IACrC,eAAe,KAAK,MAAM,IAAI,aAAa;AAAA,IAC3C,UAAU,KAAK,MAAM,IAAI,QAAQ;AAAA,IACjC,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,EAClB;AACF;AAeO,SAAS,WAAW,OAA8B;AACvD,QAAMC,MAAK,MAAM;AACjB,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,KAAKC,QAAO;AAGlB,MAAI,QAAQ;AACZ,MAAI,MAAM,QAAQ;AAChB,UAAM,YAAYD,IAAG,QAAQ,sCAAsC,EAAE,IAAI,MAAM,MAAM;AACrF,QAAI,UAAW,SAAQ,UAAU,QAAQ;AAAA,EAC3C;AAEA,QAAM,OAAa;AAAA,IACjB;AAAA,IACA,KAAK;AAAA,IACL,QAAQ,MAAM,UAAU;AAAA,IACxB,SAAS,MAAM;AAAA,IACf,SAAS,MAAM;AAAA,IACf,UAAU;AAAA,IACV;AAAA,IACA,WAAW,MAAM,aAAa;AAAA,IAC9B,OAAO,MAAM,SAAS;AAAA,IACtB,YAAY,MAAM,cAAc,CAAC;AAAA,IACjC,eAAe,MAAM,iBAAiB,CAAC;AAAA,IACvC,UAAU,CAAC;AAAA,IACX,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,IACZ,YAAY;AAAA,EACd;AAEA,EAAAA,IAAG,QAAQ;AAAA;AAAA;AAAA,GAGV,EAAE;AAAA,IACD,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL;AAAA,IACA,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK,UAAU,OAAO,KAAK,UAAU,KAAK,KAAK,IAAI;AAAA,IACnD,KAAK,UAAU,KAAK,UAAU;AAAA,IAC9B,KAAK,UAAU,KAAK,aAAa;AAAA,IACjC,KAAK,UAAU,KAAK,QAAQ;AAAA,IAC5B,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EACP;AAEA,WAAS,KAAK,IAAI,MAAM,OAAO,WAAW;AAAA,IACxC,EAAE,OAAO,WAAW,QAAQ,MAAM,OAAO,KAAK,QAAQ;AAAA,EACxD,CAAC;AAED,SAAO;AACT;AAIO,SAAS,QAAQ,IAAyB;AAC/C,QAAMA,MAAK,MAAM;AACjB,QAAM,MAAMA,IAAG,QAAQ,kCAAkC,EAAE,IAAI,EAAE;AAGjE,SAAO,MAAM,UAAU,GAAG,IAAI;AAChC;AAEO,SAAS,eAAe,IAAkB;AAC/C,QAAM,OAAO,QAAQ,EAAE;AACvB,MAAI,CAAC,MAAM;AACT,UAAM,IAAI,YAAY,kBAAkB,mBAAmB,EAAE,8DAA8D;AAAA,EAC7H;AACA,SAAO;AACT;AAEO,SAAS,YAAY,UAA0B;AACpD,QAAMA,MAAK,MAAM;AACjB,QAAM,OAAOA,IACV,QAAQ,sCAAsC,EAC9C,IAAI,QAAQ;AACf,SAAO,KAAK,IAAI,SAAS;AAC3B;AAEO,SAAS,aAAa,QAA2E;AACtG,QAAM,YAAuE,CAAC;AAC9E,MAAI,UAAU,QAAQ,MAAM;AAE5B,SAAO,SAAS,QAAQ;AACtB,UAAM,SAAS,QAAQ,QAAQ,MAAM;AACrC,QAAI,CAAC,OAAQ;AACb,cAAU,QAAQ,EAAE,IAAI,OAAO,IAAI,SAAS,OAAO,SAAS,UAAU,OAAO,SAAS,CAAC;AACvF,cAAU;AAAA,EACZ;AAEA,SAAO;AACT;AAEO,SAAS,eAAe,SAA8B;AAC3D,QAAMA,MAAK,MAAM;AACjB,QAAM,MAAMA,IACT,QAAQ,0DAA0D,EAClE,IAAI,OAAO;AACd,SAAO,MAAM,UAAU,GAAG,IAAI;AAChC;AAEO,SAAS,eAQb;AACD,QAAMA,MAAK,MAAM;AAEjB,QAAM,QAAQA,IACX,QAAQ,0CAA0C,EAClD,IAAI;AAEP,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,UAAM,SAASA,IACZ;AAAA,MACC;AAAA;AAAA;AAAA;AAAA,IAIF,EACC,IAAI,KAAK,OAAO;AAEnB,WAAO;AAAA,MACL,SAAS,KAAK;AAAA,MACd,IAAI,KAAK;AAAA,MACT,SAAS,KAAK;AAAA,MACd,OAAO,OAAO;AAAA,MACd,UAAU,OAAO;AAAA,MACjB,YAAY,OAAO,QAAQ,OAAO;AAAA,MAClC,YAAY,KAAK;AAAA,IACnB;AAAA,EACF,CAAC;AACH;AAiBO,SAAS,WAAW,OAA8B;AACvD,QAAMA,MAAK,MAAM;AACjB,QAAM,OAAO,eAAe,MAAM,OAAO;AACzC,QAAM,UAAyB,CAAC;AAChC,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AAEnC,MAAI,cAAc,KAAK;AACvB,MAAI,eAAe,KAAK;AACxB,MAAI,WAAW,KAAK;AACpB,MAAI,aAAa,KAAK;AACtB,MAAI,gBAAgB,EAAE,GAAG,KAAK,WAAW;AACzC,MAAI,kBAAkB,CAAC,GAAG,KAAK,aAAa;AAC5C,MAAI,cAAc,CAAC,GAAG,KAAK,QAAQ;AAGnC,MAAI,MAAM,aAAa,QAAQ,CAAC,KAAK,UAAU;AAC7C,UAAM,sBAAsB,KAAK,SAAS,SAAS;AACnD,UAAM,iBAAiB,MAAM,gBAAgB,MAAM,aAAa,SAAS;AACzE,QAAI,CAAC,uBAAuB,CAAC,gBAAgB;AAC3C,YAAM,IAAI;AAAA,QACR;AAAA,QACA,uBAAuB,MAAM,OAAO;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,aAAa,UAAa,MAAM,aAAa,KAAK,UAAU;AACpE,YAAQ,KAAK,EAAE,OAAO,YAAY,QAAQ,KAAK,UAAU,OAAO,MAAM,SAAS,CAAC;AAChF,kBAAc,MAAM;AAAA,EACtB;AAEA,MAAI,MAAM,cAAc,UAAa,MAAM,cAAc,KAAK,WAAW;AACvE,YAAQ,KAAK,EAAE,OAAO,aAAa,QAAQ,KAAK,WAAW,OAAO,MAAM,UAAU,CAAC;AACnF,mBAAe,MAAM;AAAA,EACvB;AAEA,MAAI,MAAM,UAAU,QAAW;AAC7B,YAAQ,KAAK,EAAE,OAAO,SAAS,QAAQ,KAAK,OAAO,OAAO,MAAM,MAAM,CAAC;AACvE,eAAW,MAAM;AAAA,EACnB;AAEA,MAAI,MAAM,YAAY,UAAa,MAAM,YAAY,KAAK,SAAS;AACjE,YAAQ,KAAK,EAAE,OAAO,WAAW,QAAQ,KAAK,SAAS,OAAO,MAAM,QAAQ,CAAC;AAC7E,iBAAa,MAAM;AAAA,EACrB;AAEA,MAAI,MAAM,YAAY;AACpB,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,UAAU,GAAG;AAC3D,UAAI,UAAU,MAAM;AAClB,YAAI,OAAO,eAAe;AACxB,kBAAQ,KAAK,EAAE,OAAO,cAAc,GAAG,IAAI,QAAQ,cAAc,GAAG,GAAG,OAAO,KAAK,CAAC;AACpF,iBAAO,cAAc,GAAG;AAAA,QAC1B;AAAA,MACF,OAAO;AACL,gBAAQ,KAAK,EAAE,OAAO,cAAc,GAAG,IAAI,QAAQ,cAAc,GAAG,KAAK,MAAM,OAAO,MAAM,CAAC;AAC7F,sBAAc,GAAG,IAAI;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,mBAAmB;AAC3B,eAAW,QAAQ,MAAM,mBAAmB;AAC1C,UAAI,CAAC,gBAAgB,SAAS,IAAI,GAAG;AACnC,wBAAgB,KAAK,IAAI;AACzB,gBAAQ,KAAK,EAAE,OAAO,iBAAiB,QAAQ,MAAM,OAAO,KAAK,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,sBAAsB;AAC9B,eAAW,QAAQ,MAAM,sBAAsB;AAC7C,YAAM,MAAM,gBAAgB,QAAQ,IAAI;AACxC,UAAI,QAAQ,IAAI;AACd,wBAAgB,OAAO,KAAK,CAAC;AAC7B,gBAAQ,KAAK,EAAE,OAAO,iBAAiB,QAAQ,MAAM,OAAO,KAAK,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,cAAc;AACtB,eAAW,MAAM,MAAM,cAAc;AACnC,YAAM,WAAqB;AAAA,QACzB,MAAM,GAAG;AAAA,QACT,KAAK,GAAG;AAAA,QACR,OAAO,MAAM;AAAA,QACb,WAAW;AAAA,MACb;AACA,kBAAY,KAAK,QAAQ;AACzB,cAAQ,KAAK,EAAE,OAAO,YAAY,QAAQ,MAAM,OAAO,SAAS,CAAC;AAAA,IACnE;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,KAAK,MAAM;AAE1B,EAAAA,IAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAYV,EAAE;AAAA,IACD;AAAA,IACA,cAAc,IAAI;AAAA,IAClB;AAAA,IACA,aAAa,OAAO,KAAK,UAAU,QAAQ,IAAI;AAAA,IAC/C;AAAA,IACA,KAAK,UAAU,aAAa;AAAA,IAC5B,KAAK,UAAU,eAAe;AAAA,IAC9B,KAAK,UAAU,WAAW;AAAA,IAC1B;AAAA,IACA,MAAM;AAAA,EACR;AAEA,QAAM,SAAS,MAAM,aAAa,OAAO,aAAa;AACtD,WAAS,MAAM,SAAS,MAAM,OAAO,QAAQ,OAAO;AAEpD,SAAO,eAAe,MAAM,OAAO;AACrC;AAIO,SAAS,kBAAkB,SAMhC;AACA,QAAMA,MAAK,MAAM;AAEjB,QAAM,SAASA,IACZ;AAAA,IACC;AAAA;AAAA;AAAA;AAAA,EAIF,EACC,IAAI,OAAO;AAGd,QAAM,UAAUA,IACb;AAAA,IACC;AAAA;AAAA;AAAA;AAAA;AAAA,EAKF,EACC,IAAI,OAAO;AAGd,QAAM,aAAaA,IAChB;AAAA,IACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUF,EACC,IAAI,OAAO;AAEd,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd,UAAU,OAAO;AAAA,IACjB,YAAY,OAAO,QAAQ,OAAO;AAAA,IAClC,SAAS,QAAQ;AAAA,IACjB,YAAY,WAAW;AAAA,EACzB;AACF;","names":["nanoid","db","db","db","nanoid"]}

package/dist/index.js

@@ -6,10 +6,10 @@ if (args[0] === "activate") {
   const { activate } = await import("./activate-DSDTR2EJ.js");
   activate(args[1]);
 } else if (args[0] === "init") {
-  const { init } = await import("./init-JYP72OZQ.js");
+  const { init } = await import("./init-PPICS5PC.js");
   init();
 } else {
-  const { startServer } = await import("./server-4T5WYSAE.js");
+  const { startServer } = await import("./server-6TNHZCUW.js");
   startServer().catch((error) => {
     console.error("Failed to start graph:", error);
     process.exit(1);

package/dist/init-PPICS5PC.js

@@ -0,0 +1,61 @@
+#!/usr/bin/env node
+import {
+  handleAgentConfig
+} from "./chunk-ILTJI4ZN.js";
+
+// src/init.ts
+import { readFileSync, writeFileSync, existsSync, mkdirSync } from "fs";
+import { join, dirname } from "path";
+var MCP_CONFIG = {
+  command: "npx",
+  args: ["-y", "@graph-tl/graph"],
+  env: {
+    GRAPH_AGENT: "claude-code"
+  }
+};
+function init() {
+  const cwd = process.cwd();
+  let wrote = false;
+  const configPath = join(cwd, ".mcp.json");
+  if (existsSync(configPath)) {
+    try {
+      const config = JSON.parse(readFileSync(configPath, "utf8"));
+      if (config.mcpServers?.graph) {
+        console.log("\u2713 .mcp.json \u2014 graph already configured");
+      } else {
+        config.mcpServers = config.mcpServers ?? {};
+        config.mcpServers.graph = MCP_CONFIG;
+        writeFileSync(configPath, JSON.stringify(config, null, 2) + "\n", "utf8");
+        console.log("\u2713 .mcp.json \u2014 added graph server");
+        wrote = true;
+      }
+    } catch {
+      console.error(`\u2717 .mcp.json exists but is not valid JSON \u2014 skipping`);
+    }
+  } else {
+    const config = { mcpServers: { graph: MCP_CONFIG } };
+    writeFileSync(configPath, JSON.stringify(config, null, 2) + "\n", "utf8");
+    console.log("\u2713 .mcp.json \u2014 created with graph server");
+    wrote = true;
+  }
+  const agentPath = join(cwd, ".claude", "agents", "graph.md");
+  if (existsSync(agentPath)) {
+    console.log("\u2713 .claude/agents/graph.md \u2014 already exists");
+  } else {
+    const { agent_file } = handleAgentConfig();
+    mkdirSync(dirname(agentPath), { recursive: true });
+    writeFileSync(agentPath, agent_file, "utf8");
+    console.log("\u2713 .claude/agents/graph.md \u2014 created graph workflow agent");
+    wrote = true;
+  }
+  console.log("");
+  if (wrote) {
+    console.log("Graph is ready. Restart Claude Code to load the MCP server.");
+  } else {
+    console.log("Graph is already set up \u2014 nothing to do.");
+  }
+}
+export {
+  init
+};
+//# sourceMappingURL=init-PPICS5PC.js.map

package/dist/init-PPICS5PC.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/init.ts"],"sourcesContent":["import { readFileSync, writeFileSync, existsSync, mkdirSync } from \"fs\";\nimport { join, dirname } from \"path\";\nimport { handleAgentConfig } from \"./tools/agent-config.js\";\n\n// [sl:hy8oXisWnrZN1BfkonUqd] npx @graph-tl/graph init — zero friction onboarding\n\nconst MCP_CONFIG = {\n  command: \"npx\",\n  args: [\"-y\", \"@graph-tl/graph\"],\n  env: {\n    GRAPH_AGENT: \"claude-code\",\n  },\n};\n\nexport function init(): void {\n  const cwd = process.cwd();\n  let wrote = false;\n\n  // 1. Write .mcp.json\n  const configPath = join(cwd, \".mcp.json\");\n  if (existsSync(configPath)) {\n    try {\n      const config = JSON.parse(readFileSync(configPath, \"utf8\"));\n      if (config.mcpServers?.graph) {\n        console.log(\"✓ .mcp.json — graph already configured\");\n      } else {\n        config.mcpServers = config.mcpServers ?? {};\n        config.mcpServers.graph = MCP_CONFIG;\n        writeFileSync(configPath, JSON.stringify(config, null, 2) + \"\\n\", \"utf8\");\n        console.log(\"✓ .mcp.json — added graph server\");\n        wrote = true;\n      }\n    } catch {\n      console.error(`✗ .mcp.json exists but is not valid JSON — skipping`);\n    }\n  } else {\n    const config = { mcpServers: { graph: MCP_CONFIG } };\n    writeFileSync(configPath, JSON.stringify(config, null, 2) + \"\\n\", \"utf8\");\n    console.log(\"✓ .mcp.json — created with graph server\");\n    wrote = true;\n  }\n\n  // 2. Write .claude/agents/graph.md\n  const agentPath = join(cwd, \".claude\", \"agents\", \"graph.md\");\n  if (existsSync(agentPath)) {\n    console.log(\"✓ .claude/agents/graph.md — already exists\");\n  } else {\n    const { agent_file } = handleAgentConfig();\n    mkdirSync(dirname(agentPath), { recursive: true });\n    writeFileSync(agentPath, agent_file, \"utf8\");\n    console.log(\"✓ .claude/agents/graph.md — created graph workflow agent\");\n    wrote = true;\n  }\n\n  // 3. Summary\n  console.log(\"\");\n  if (wrote) {\n    console.log(\"Graph is ready. Restart Claude Code to load the MCP server.\");\n  } else {\n    console.log(\"Graph is already set up — nothing to do.\");\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAS,cAAc,eAAe,YAAY,iBAAiB;AACnE,SAAS,MAAM,eAAe;AAK9B,IAAM,aAAa;AAAA,EACjB,SAAS;AAAA,EACT,MAAM,CAAC,MAAM,iBAAiB;AAAA,EAC9B,KAAK;AAAA,IACH,aAAa;AAAA,EACf;AACF;AAEO,SAAS,OAAa;AAC3B,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,QAAQ;AAGZ,QAAM,aAAa,KAAK,KAAK,WAAW;AACxC,MAAI,WAAW,UAAU,GAAG;AAC1B,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,aAAa,YAAY,MAAM,CAAC;AAC1D,UAAI,OAAO,YAAY,OAAO;AAC5B,gBAAQ,IAAI,kDAAwC;AAAA,MACtD,OAAO;AACL,eAAO,aAAa,OAAO,cAAc,CAAC;AAC1C,eAAO,WAAW,QAAQ;AAC1B,sBAAc,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI,MAAM,MAAM;AACxE,gBAAQ,IAAI,4CAAkC;AAC9C,gBAAQ;AAAA,MACV;AAAA,IACF,QAAQ;AACN,cAAQ,MAAM,+DAAqD;AAAA,IACrE;AAAA,EACF,OAAO;AACL,UAAM,SAAS,EAAE,YAAY,EAAE,OAAO,WAAW,EAAE;AACnD,kBAAc,YAAY,KAAK,UAAU,QAAQ,MAAM,CAAC,IAAI,MAAM,MAAM;AACxE,YAAQ,IAAI,mDAAyC;AACrD,YAAQ;AAAA,EACV;AAGA,QAAM,YAAY,KAAK,KAAK,WAAW,UAAU,UAAU;AAC3D,MAAI,WAAW,SAAS,GAAG;AACzB,YAAQ,IAAI,sDAA4C;AAAA,EAC1D,OAAO;AACL,UAAM,EAAE,WAAW,IAAI,kBAAkB;AACzC,cAAU,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACjD,kBAAc,WAAW,YAAY,MAAM;AAC3C,YAAQ,IAAI,oEAA0D;AACtE,YAAQ;AAAA,EACV;AAGA,UAAQ,IAAI,EAAE;AACd,MAAI,OAAO;AACT,YAAQ,IAAI,6DAA6D;AAAA,EAC3E,OAAO;AACL,YAAQ,IAAI,+CAA0C;AAAA,EACxD;AACF;","names":[]}

package/dist/{nodes-7UZATPPU.js → nodes-4OJBNDHG.js}

@@ -9,7 +9,7 @@ import {
   getProjectSummary,
   listProjects,
   updateNode
-} from "./chunk-NWCUIW6D.js";
+} from "./chunk-TWT5GUXW.js";
 export {
   createNode,
   getAncestors,
@@ -21,4 +21,4 @@ export {
   listProjects,
   updateNode
 };
-//# sourceMappingURL=nodes-7UZATPPU.js.map
+//# sourceMappingURL=nodes-4OJBNDHG.js.map