cc-tree

cc-tree

A Claude Code plugin: one universal radial-tree exploration engine, four swappable presets. Use it for divergent ideation, adversarial critique, design-space exploration, or code audit — same engine, different vocabulary.

claude plugin marketplace add skymanbp/cc-tree
claude plugin install cc-tree@cc-tree

Refactor of sci-paper's brainstorm + paper-attack-tree skills, stripped of paper-specific anchors and parameterized via presets.

The idea — a phylogenetic tree of thoughts

cc-tree treats any open-ended thinking task as a phylogenetic tree growing outward from one root. The root is your input (a topic, a document, a code path, a design prompt). Every node is expanded by the same 12 framing passes, each child is fully derived and scored, and only the high-value (advances) leaves get re-expanded — until the tree reaches substantive convergence, not an arbitrary count.

_{Inspired by the radial tree of life. The vocabulary the rest of this README uses is all in this one picture: root (the input at the centre — topic · artifact · code · design), node (one idea / critique / option / finding, each with the same 12-field derivation), depth (the concentric framing-recursion rings; branches stop at different rings because only advances leaves re-expand), width (the total number of terminal leaves / tips, wherever they land — set by convergence, not a hand-picked cap), and n (total nodes in the tree). Diagram source: tools/gen_radial_tree.py.}

  the tree grows OUTWARD from one root. a branch can WIN, hit a DEAD END, or
  keep BRANCHING and be judged again — no single winner, wins at any depth:

    ROOT ──┬── pruned                      (dead end at depth 1)
           ├── advances                    (a win at depth 1)
           └── advances ──┬── pruned        (this branch keeps going…)
                          └── advances ──┬── advances   (…a deeper win)
                                         └── blocked

  each node → 12 framings (§3.A–§3.L) → 12-field derivation → score → verdict;
  branches that keep advancing grow deeper; pruned / blocked ones stop.

The per-node loop, precisely:

flowchart LR
    R([root<br/>topic · artifact · code · design]) --> F{{12 framing passes<br/>§3.A–§3.L}}
    F --> D[per-node 12-field derivation<br/>evidence · no hedging · no defer]
    D --> S[score 5 dims → verdict]
    S -->|advances| RE((re-expand<br/>this leaf))
    RE --> F
    S -->|kept / pruned| K[keep in tree,<br/>don't re-expand]
    S -->|blocked| B[INCOMPLETE_FORBIDDEN<br/>drive to completion]
    B --> D
    S --> C{§6 convergence?<br/>6 conditions all true}
    C -->|no| RE
    C -->|yes| OUT[/final report +<br/>tree.md · tree.json/]

Two properties make this more than "brainstorm in a loop": (1) every leaf is fully derived with file:line / URL evidence — a hard ban on defer / future-work / TODO / NEEDS-MORE-INFO leaves (§0.5); (2) termination is substantive convergence (six simultaneous conditions), never "ran out of patience".

What it ships

1 skill

Skill	What it does
/cc-tree:tree	Universal radial-tree engine. Loads a preset, builds the §2 baseline, then recursively applies 12 framing passes per node until stable convergence (no new high-verdict branches over the last 2 rounds + all 12 framings exercised + all leaves complete). Width × depth default to ∞; resource caps are opt-in. Hard ban on defer / future-work / TODO / NEEDS-MORE-INFO leaves.

4 presets (presets/<name>.md)