Skill Security →

Attack Tree Construction

Build comprehensive attack trees to visualize threat paths.

A systematic method and Python toolkit for modeling how an attacker reaches a goal, then turning that map into defense priorities. It builds attack trees with OR/AND/leaf nodes scored by cost, difficulty, time and detection risk, so you can find the cheapest, stealthiest and most critical paths to block.

$15 one-time
Add to a kit →

Prices include 20% VAT. · Forged on real agency work · one-time, no lock-in

  • Type Skill
  • Category Security
  • Delivery Email · instant
  • License One-time
Run preview
forgehouse, attack-tree-construction

Inside the run · no black box

See the actual work before you buy it.

Defense planning starts by thinking like the attacker. The skill maps every route to the goal, then finds the nodes where one fix cuts several attack paths at once:

  1. Defines the root goal from the attacker's side and fills the Diamond Model corners while doing it: who the adversary is (insider or outsider), what tooling they bring, what infrastructure they use, which victim assets they target.
  2. Builds the tree with a fluent builder: OR nodes where any child achieves the goal, AND nodes where all children are required, and leaf attacks each scored on difficulty, cost, detection risk and time in hours, with known mitigations attached per leaf.
  3. Runs path analysis over the finished tree: enumerates all attack paths, then computes the easiest, the cheapest and the stealthiest route so the defender knows which door an attacker would actually pick.
  4. Identifies critical nodes, the steps that appear in the most paths, because hardening one of those cuts several attack routes at once; coverage analysis verifies how many paths a given mitigation set actually blocks.
  5. Prioritizes mitigations by coverage impact with a Pareto lens: the top 3 to 5 recommendations typically block the bulk of total risk, and unmitigated leaf attacks are surfaced as explicit gaps.
  6. Exports the result as a Mermaid or PlantUML diagram, color coded by attack difficulty, so the same tree works for both engineering review and stakeholder communication.
Use cases · what happens when you plug it in

One power source. 6 lines out.

attack-tree-construction · core

core active · 6 lines

  1. Mapping account takeover or breach scenarios for a system

    ✓ mapping account takeover
  2. Identifying which single defense blocks the most attack paths

    ✓ identifying which single
  3. Communicating security risk to non-technical stakeholders visually

    ✓ communicating security r…
  4. Planning where to invest a limited security budget

    ✓ planning where to invest
  5. Scoping and prioritizing a penetration test

    ✓ scoping and prioritizing
  6. Reviewing a security architecture for gaps before launch

    ✓ reviewing a security arc…
Benefits · what you walk away with

Yours to keep.

Drag time forward. Watch what stays.

Forever

That's what owning means.

The rented stack

ai writing tool: subscription

expired · access lost

analytics suite: subscription

expired · access lost

design platform: subscription

expired · access lost

(nothing left)

Your forge

  1. See where one fix closes many attack paths instead of patching blindly

    license: perpetual
  2. Spend security budget on the highest-impact defenses using path coverage data

    license: perpetual
  3. Turn abstract 'we might get hacked' fears into ranked, evidence-based decisions

    license: perpetual
  4. Give executives a clear visual of threat paths and mitigation impact

    license: perpetual

subscriptions expire · deeds don't

What's included · the full manifest

Everything in the box.

Pick a piece up. Watch it work.

Full attack-tree data model with cost, difficulty, detection and time attributes

part 01 of 06 · in the box

6 parts · one working system · ships instantly by email

Who it's for

This wasn't forged for everyone.

  • Not for you if you'd rather rent a tool than own one.
  • Not for you if you want someone else to run your stack.
  • Not for you if you're happy guessing.
Still here? Good.

Security architects, red teamers and risk owners who need to map threats rigorously and justify defensive spend with hard numbers.

then this was forged for you.

Works with

Universal by design: these run in any AI. Delivered in the open Agent Skills + MCP format (native in Claude); ChatGPT, Gemini, Cursor and Copilot adapt the same files their own way.

  • Claude Native format
  • ChatGPT Adapts via open standards
  • Gemini Adapts via open standards
  • Cursor Adapts via open standards
  • Copilot Adapts via open standards
Questions · still in the air

Catch what's on your mind.

the air is clear. nothing between you and the forge.
catch a spark: the forge will answer

  1. Do I have to write Python to use this, or is it a method I can do on paper?

    It's both: a systematic method for building the trees plus a Python toolkit that scores and analyzes them. You can reason through the structure by hand, but the toolkit does the path-finding across cost, difficulty, time, and detection risk.

  2. The node scores are my estimates, doesn't that make the output subjective?

    The scores are judgment calls, so the tree is only as good as your inputs, but making those estimates explicit is the point. It turns 'this feels risky' into a comparable ranking you can challenge and revise, instead of an opinion.

  3. Will it find the actual vulnerabilities in my system?

    No, it models how an attacker would chain known weaknesses toward a goal and shows which single defense blocks the most paths. Discovering the underlying vulnerabilities is separate work you feed into the tree.

  4. How is it delivered?

    By email right after purchase: ready to run, downloaded instantly, no setup wait.

  5. One-time or subscription?

    A one-time purchase; no subscription or hidden fees. VAT (20%) is included.

  6. Can I get a refund?

    As a digital product, it can’t be refunded once downloaded. That’s why we show exactly what’s inside and who it’s for, right here.