Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add rules/alkoleft/platform-context-exporter/complexity-decision-treegit clone --depth 1 https://github.com/alkoleft/platform-context-exporterWhat it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00000 | $0.01652 |
| Opus 5 | $0.00000 | $0.00826 |
| Sonnet 5 | $0.00000 | $0.00330 |
| Haiku 4.5 | $0.00000 | $0.00165 |
Grade A, and why
complexity-decision-tree scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
This is a copy
100% identical to complexity-decision-tree — 0 lines differ, which has more behind it and is treated as the original. This page carries a canonical link to it rather than competing with it.
How it starts
The opening of the file, as written. The whole thing — 188 lines — stays where its author put it; the contents beside it link to each section on GitHub.
TASK COMPLEXITY DETERMINATION
TL;DR: This document helps determine the appropriate complexity level (1-4) for any task. Use the decision tree and indicators to select the right process level, then load the corresponding process map.
🌳 COMPLEXITY DECISION TREE
graph TD
Start["New Task"] --> Q1{"Bug fix or<br>error correction?"}
Q1 -->|Yes| Q1a{"Affects single<br>component?"}
Q1a -->|Yes| L1["Level 1:<br>Quick Bug Fix"]
Q1a -->|No| Q1b{"Affects multiple<br>components?"}
Q1b -->|Yes| L2["Level 2:<br>Simple Enhancement"]
Q1b -->|No| Q1c{"Affects system<br>architecture?"}
Q1c -->|Yes| L3["Level 3:<br>Intermediate Feature"]
Q1c -->|No| L2
Q1 -->|No| Q2{"Adding small<br>feature or<br>enhancement?"}
Q2 -->|Yes| Q2a{"Self-contained<br>change?"}
Q2a -->|Yes| L2
Q2a -->|No| Q2b{"Affects multiple<br>components?"}
Q2b -->|Yes| L3
Q2b -->|No| L2
Q2 -->|No| Q3{"Complete feature<br>requiring multiple<br>components?"}
Q3 -->|Yes| Q3a{"Architectural<br>implications?"}
Q3a -->|Yes| L4["Level 4:<br>Complex System"]
Q3a -->|No| L3
Q3 -->|No| Q4{"System-wide or<br>architectural<br>change?"}
Q4 -->|Yes| L4
Q4 -->|No| L3
L1 --> LoadL1["Load Level 1 Map"]
L2 --> LoadL2["Load Level 2 Map"]
L3 --> LoadL3["Load Level 3 Map"]
L4 --> LoadL4["Load Level 4 Map"]
📊 COMPLEXITY LEVEL INDICATORS
Use these indicators to help determine task complexity:
Level 1: Quick Bug Fix
- Keywords: "fix", "broken", "not working", "issue", "bug", "error", "crash"
- Scope: Single component or UI element
- Duration: Can be completed quickly (minutes to hours)
- Risk: Low, isolated changes
- Examples:
- Fix button not working
- Correct styling issue
- Fix validation error
- Resolve broken link
- Fix typo or text issue
Level 2: Simple Enhancement
- Keywords: "add", "improve", "update", "change", "enhance", "modify"
- Scope: Single component or subsystem
- Duration: Hours to 1-2 days
- Risk: Moderate, contained to specific area
- Examples:
- Add form field
- Improve validation
- Update styling
- Add simple feature
- Change text content
- Enhance existing component
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2d ago First seen · 188 lines · 0 tokens per session scan A b15263400b63
complexity-decision-tree is a cursor rule published in the GitHub repository alkoleft/platform-context-exporter (48 stars, last pushed 1y ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 1,652 tokens. A static security scan graded it A with 0 findings. It is 100% identical to complexity-decision-tree, differing in 0 lines, and is treated as a copy.
Other cursor rules, from other repositories
1c-coding-standards
Стандарты кода BSL: именование, запросы, коллекции.
bsp-profile-rights-api
Программная работа с профилями групп доступа БСП: ссылки на ИдентификаторыОбъектовМетаданных.
anti_patterns
Критические антипаттерны 1С: запрос в цикле, реквизиты через точку.
bsl-ssl
Переиспользование БСП, разметка правок типовых модулей, устаревшие объекты.
edt-form-xml-requirements
Требования EDT к XML-формам (Form.form): extInfo, дефолты полей.
sdd-workflow
Specification-Driven Development: 9-фазный workflow разработки.