AgentStack
Browse Sign in
Browse Why AgentStack Sell Docs
Sign in
SKILL verified MIT Self-run

Decision Graph

skill-gaearon-woodshed-connective · by gaearon

Use when building a deciduous decision graph to capture design evolution, architecture history, or how a codebase's design changed over time. Provides the deciduous CLI commands and graph structure guidelines.

— No reviews yet
0 installs
23 views
0.0% view→install

Install

$ agentstack add skill-gaearon-woodshed-connective

✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.

Security review

✓ Passed

No issues found. Passed automated security review. · v0.1.0 How review works →

  • ✓ Prompt-injection patterns
  • ✓ Secret / credential exfiltration
  • ✓ Dangerous shell & filesystem operations
  • ✓ Untrusted network calls
  • ✓ Known-malicious package signatures

What it can access

  • ✓ Network access No
  • ✓ Filesystem access No
  • ✓ Shell / process execution No
  • ✓ Environment & secrets No
  • ✓ Dynamic code execution No

From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.

View the full security report →

Verified badge

Passed review? Show it. Paste this badge into your README, it links to the public security report.

AgentStack Verified badge Links to your public security report.
[![AgentStack Verified](https://agentstack.voostack.com/badges/verified.svg)](https://agentstack.voostack.com/security/report/skill-gaearon-woodshed-connective)

Reliability & compatibility

✓ Security review passed
0 installs to date
— no reviews yet
○ 8mo ago

Declared compatibility

Claude CodeClaude Desktop

Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.

Preview Execution monitoring

We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.

How agent discovery & health will work →
Are you the author of Decision Graph? Claim this listing to set pricing, connect Stripe payouts, and keep 70% of every sale.
Sign up to claim

About

Decision Graph Construction

You are building a deciduous decision graph - a DAG that captures the evolution of design decisions in a codebase.

Use the deciduous CLI (at ~/.cargo/bin/deciduous) to build the graph. Run deciduous commands in the current directory (not inside the source repo).

For git commands to explore commit history, use git -C to target the source repo.

CRITICAL: Only use information from the repository itself (commits, code, comments, tests). Do not use your prior knowledge about the project. Everything must be grounded in what you find in the repo.

Commit Exploration

Use a layered strategy to find all relevant commits:

Layer 1: See all commits. Start with the full list when building narratives.

git log --oneline --after="..." --before="..." -- path/

Layer 2: Keyword expansion. Once you have narratives, search for spelling variations and related terms you might have missed (e.g., "cache" → "caching", "cached", "LRU", "invalidate"). For each key identifier in your narratives, trace its full lifecycle:

  • Introduction
  • Changes and modifications
  • Renames
  • Deprecation or removal
  • Replacement by other mechanisms
  • Becoming stable/public API

If there's a feature flag controlling the feature, search for commits mentioning that flag.

Layer 3: Follow authors. If a narrative has a key author, check their commits ±1 month from known commits. They often work on related things.

DO NOT:

  • git log ... | head -100 — NO. You will miss commits in the middle.
  • git log ... | tail -200 — NO. Same problem.
  • Start with keyword filtering — NO. You'll miss things with unexpected names.

DO:

  • See all commits first, filter mentally while building narratives
  • Include "remove", "delete", "disable", "deprecate" in keyword searches — removals explain transitions
  • Check the commit count first (| wc -l), but then see them all
  • Read full commit messages for any commit whose title mentions an identifier or concept relevant to your narrative — you need precise understanding of what happened to each one you care about

Finding the Story

Not every commit matters. Look for commits that change the model - how the system conceptualizes the problem:

  • Existing tests modified (contract changing, not just bugs fixed)
  • Data structures replaced or reworked
  • Heuristics changed significantly
  • New abstractions introduced
  • API behavior shifts

Skip commits that are pure implementation (same model, different code) or routine fixes that just add tests.

Among model-changing commits, find the spine: what question keeps getting re-answered? What approach keeps getting replaced or refined? That's your central thread - build the graph around it.

Narrative Tracking

Don't build the graph as you explore. First, collect commits into narratives.

Maintain narratives.md as you explore:

  1. For each significant commit, read narratives.md
  2. Ask: "Does this commit evolve an existing narrative?"
  3. If yes: append the commit to that narrative's section
  4. If no: add a new narrative section

Example narratives.md:

## Cache Strategy

**Arc:** The service initially hit the database on every request, which worked until traffic spiked and the DB became the bottleneck. An in-memory cache solved the latency problem but created a new one: each server instance had its own cache, so users saw inconsistent data depending on which instance handled their request. The team tried cache invalidation broadcasts, but the complexity exploded. Moving to Redis gave a single source of truth at the cost of network latency - but that latency was still 10x better than the DB, and consistency issues disappeared.

- a1b2c3d: Add in-memory cache
- e4f5g6h: Cache invalidation issues
- i7j8k9l: Switch to Redis

## API Rate Limiting

**Arc:** The API originally had no rate limits, which was fine until a misbehaving client brought down the service with a retry loop. The initial fix was simple per-IP throttling, but this broke legitimate use cases like corporate NATs where thousands of users share one IP. The insight was distinguishing between "sustained abuse" and "burst traffic" - a token bucket algorithm lets clients burst up to a limit while still preventing sustained overload. The final refinement added per-endpoint limits after discovering that the /search endpoint was 100x more expensive than others.

- m1n2o3p: Add basic throttling
- ...

The Arc tells the narrative as a story: what problem started it, what was tried, what went wrong, what insight emerged, and where it ended up. If your arc has gaps ("then somehow we ended up with X"), you're missing commits.

Before building the graph, take a critical pass over narratives.md:

  • Merge narratives that are essentially the same evolving thing
  • Ensure each narrative clearly explains how one independent piece evolved
  • Note where narratives branch from or feed into each other

Hardening Phase

After building initial narratives, harden them to ensure nothing is missed.

Assume the commit list is incomplete. Your first pass probably missed things. Before synthesizing the narrative into a graph, actively search for what's missing. If a commit mentions a new term or concept you hadn't searched for, search for that too. Follow the trail until searches stop turning up new relevant commits.

Step 1: Extract concepts per narrative

For each narrative, list the key concepts/APIs/identifiers and their lifecycle stage:

  • Introduced: First appearance of the concept
  • Changed: Modifications to behavior or implementation
  • Renamed/Deprecated/Removed: End of life or replacement
  • Marked stable: Became public API or removed "unstable\_" prefix

Example addition to narrative:

## Cache Strategy
Concepts: cache, LRUCache, cacheTimeout, invalidate

Lifecycle:
- cache: introduced (a1b2c3d), changed (e4f5g6h), renamed to LRUCache (x1y2z3)
- cacheTimeout: introduced (e4f5g6h), removed (i7j8k9l)
- LRUCache: introduced via rename (x1y2z3), marked stable (p1q2r3)

Commits:
- a1b2c3d: Add in-memory cache
- ...

Step 2: Exhaustive search per concept

For each concept, search full commit messages (not just subject lines):

git log --all --after="..." --before="..." --grep="" --format="%H %s" -- path/

For each match, read the full commit message:

git show  --format="%B" --no-patch

Step 3: Follow replacements

When something is removed or deprecated, trace what replaced it. The replacement mechanism is its own concept that needs lifecycle tracking.

Example: If you find "Remove ManualCache in favor of AutoCache", then:

  1. Add AutoCache to your concepts list
  2. Search for all commits mentioning AutoCache
  3. Track its full lifecycle (introduced, changed, etc.)

Replacements often represent a distinct design phase. Don't collapse "X removed, Y introduced" into a single node - model Y's introduction and evolution as its own chain.

Step 4: Rewrite narratives with gaps filled

Rewrite narratives.md integrating any newly discovered commits. The rewritten version should:

  • Include ALL commits found for each concept
  • Include replacement mechanisms as first-class concepts
  • Update the lifecycle tracking for each concept
  • Ensure the arc is complete (if something was introduced, when was it changed/removed?)

If a concept has an incomplete arc (e.g., introduced but never removed, yet it's not in current code), investigate further.

Cross-Narrative Connections

When building the graph, capture how narratives relate - but only connect things that are causally related.

The Causality Test

Before connecting A → B, ask: Would B have happened anyway if A hadn't existed?

  • Yes, B would happen anyway → They're parallel concerns. Both branch from their common parent (often the goal).
  • No, B only exists because of A → Sequential. A leads_to B.

Examples:

# WRONG - these are parallel concerns, not causal
outcome: "Improved fallback display heuristics"
    → observation: "Developers need more control over timing"

# Why wrong? Developers wanting control isn't CAUSED BY the heuristics improvement.
# They're both responses to the same parent goal.

# RIGHT - branch both from the goal
goal: "Make Suspense fallback behavior good"
    → decision: "How to improve heuristics?"
    → decision: "How to give developers control?"
# RIGHT - actually causal
outcome: "Timeout mechanism works"
    → observation: "But it deletes children, losing state"
    → decision: "How to preserve state?"

# Why right? The state preservation question AROSE FROM implementing timeout.
# They wouldn't be asking this if timeout hadn't been built first.

Types of Causal Connections

Prerequisite: B literally couldn't exist without A. B extends, refines, or builds on A.

  • Connect: outcome(A) → decision(B)
  • Example: "Add cache eviction policies" requires the cache to exist first
  • Example: "Optimize query batching" requires the query layer to exist first
  • This is the most common causal connection - features building on features

Caused problem: A working revealed a new problem that B addresses.

  • Connect: outcome(A) → observation("problem") → decision(B)
  • Example: Cache works → but causes stale reads → how to invalidate?

Made obsolete: A's success made B unnecessary.

  • Connect: outcome(A) → observation("B no longer needed")
  • Example: Auto-scaling works → observation: manual capacity planning no longer needed

Informed by: Learning from A directly shaped how B was designed.

  • Connect: observation(from A) → decision(B)
  • Example: Observation about user behavior from A informed the API design of B

NOT Causal (Keep Parallel)

Same timeframe: A and B happened around the same time, but neither caused the other.

  • Both branch from common parent.

Same area: A and B both touch the same code, but are independent concerns.

  • Both branch from common parent.

Same author: Same person worked on both, but they're separate problems.

  • Both branch from common parent.

Before Building the Graph

List cross-narrative connections explicitly, but only include causal ones:

## Cross-Narrative Connections

**Causal connections:**

- Narrative B branched from Narrative A's outcome because [specific reason]
- Observation X from Narrative A informed Decision Y in Narrative B because [specific reason]

**Parallel concerns (no connection needed):**

- Narratives C and D both address [goal] but don't causally relate

If you can't articulate WHY one caused the other, they're probably parallel.

Node Types

| Type | Purpose | | --------------- | ----------------------------------------------------- | | goal | High-level objective being pursued | | decision | A choice point with multiple possible paths | | option | A possible approach to a decision | | observation | Learning, insight, or new information discovered | | action | Something that was done (must reference a commit) | | outcome | Result or consequence of an action | | revisit | Pivot point where a previous approach is reconsidered |

CLI Commands

# Add nodes (returns node ID)
deciduous add goal "Title of the goal"
deciduous add decision "The question or choice point"
deciduous add option "One possible approach"
deciduous add observation "Something learned or discovered"
deciduous add action "Descriptive title of what was done"
deciduous add outcome "What resulted from the action"
deciduous add revisit "Reconsidering previous approach"

# Add nodes with descriptions (use -d for explanations and sources)
deciduous add action "Title" -d "Explanation of what happened and why.

Sources:
- abc123: 'Relevant quote from commit message'"

# Set status on options
deciduous status  rejected    # option that wasn't chosen
deciduous status  completed   # option that was chosen

# Connect nodes (from → to means "from leads_to to")
deciduous link  
deciduous link   -r "Why this led to that"

# View/restructure
deciduous nodes           # list all
deciduous edges           # list connections
deciduous unlink     # remove edge
deciduous delete           # remove node and edges

Narrative Discipline

You're not collecting facts - you're crafting a story. Every node needs a raison d'être.

Before adding a node, stop and ask: Why does this exist? What prompted it?

  • Is this commit evolving something that's already in the graph? Then connect it there - it's a continuation, not a new branch.
  • Is this a response to an observation about existing work? Then chain from that observation - something was learned, and this is the reaction.
  • Did the winds change? Look for the moment the team realized the old approach wasn't working. That's an observation node, and it's the bridge to what came next.

Don't branch from the goal unless it's genuinely new. If you're about to draw an edge from the root goal, ask: does this replace or refine something we already designed? If yes, find that thing and connect there instead.

The test: can someone read your graph and understand not just what happened, but why each thing happened? Every node should feel inevitable given what came before it.

Think of commits as chapters in a story. Each chapter exists because of what happened in previous chapters. Your job is to find those causal threads and make them explicit.

Temporal Rule

Time flows forward. Past influences future, never reverse.

Options under a decision are alternatives considered at the same time. If an approach was tried, failed, and a new approach was designed later - that's a new decision node, connected by observations about why the old approach failed.

Example - DON'T model sequential attempts as parallel options:

# WRONG - these were decided years apart, not simultaneously
decision: "How to handle caching?"
  ├→ option: in-memory cache (2019)
  ├→ option: Redis (2020)
  └→ option: CDN (2021)

Example - DO model as chain of decisions with learning:

# RIGHT - each attempt informs the next, options are simultaneous alternatives
decision: "How to handle caching?" (2019)
  ├→ option: in-memory cache [chosen]
  └→ option: no caching [rejected] "Perf requirements too strict"
        ↓
option: in-memory cache → action → outcome
        ↓
observation: "Doesn't scale across instances"
        ↓
decision: "How to share cache across instances?" (2020)
  ├→ option: Redis [chosen] "Team has Redis experience"
  ├→ option: Memcached [rejected] "Less feature-rich"
  └→ option: database caching [rejected] "Adds DB load"
        ↓
option: Redis → action → outcome
        ↓
observation: "Latency too high for hot paths"
        ↓
decision: "How to reduce latency for static assets?" (2021)
  └→ option: CDN [chosen]

Multiple observations can converge into one decision. Multiple options can branch from one decision. But the graph flows forward in time.

Edge Types

Use specific edge types to show relationships:

deciduous link   -t chosen -r "Why this was selected"
deciduous link   -t rejected -r "Why this wasn't selected"
deciduous link   -t leads_to -r "How this led to that"
  • decision --chosen--> option - This option was selected
  • decision --rejected--> option - This option was considered but not selected (with rationale)
  • decision --leads_to--> option - Lists available options

For post-hoc abandonment (tried something, it failed later):

  • Mark the option status as rejected: deciduous status rejected
  • Create an observation explaining why it failed
  • Link observation to the new decision it triggered

Link Patterns

  • goal → decision - Goal leads to choice point
  • decision → option

…

Source & license

This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.

Install and usage instructions live in the source repository linked above.

Reviews

No reviews yet, be the first.

Versions

  • v0.1.0 Imported from the upstream source.