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/mcp-bsl-platform-context/van-complexity-determinationgit clone --depth 1 https://github.com/alkoleft/mcp-bsl-platform-contextWhat 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.01276 |
| Opus 5 | $0.00000 | $0.00638 |
| Sonnet 5 | $0.00000 | $0.00255 |
| Haiku 4.5 | $0.00000 | $0.00128 |
Grade A, and why
van-complexity-determination 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 3d 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 van-complexity-determination — 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 — 142 lines — stays where its author put it; the contents beside it link to each section on GitHub.
VAN MODE: COMPLEXITY DETERMINATION
TL;DR: This component determines the appropriate complexity level (1-4) for the current task and directs the workflow accordingly.
🔍 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
style Start fill:#4da6ff,stroke:#0066cc,color:white
style L1 fill:#10b981,stroke:#059669,color:white
style L2 fill:#f6546a,stroke:#c30052,color:white
style L3 fill:#f6546a,stroke:#c30052,color:white
style L4 fill:#f6546a,stroke:#c30052,color:white
📋 LEVEL INDICATORS
Level 1: Quick Bug Fix
- Keywords: fix, bug, error, crash, issue
- Scope: Single component
- Time: Minutes to hours
- Risk: Low, isolated
- Example: Button not working, styling issue
Level 2: Simple Enhancement
- Keywords: add, improve, update, enhance
- Scope: Single component/subsystem
- Time: Hours to 1-2 days
- Risk: Moderate, contained
- Example: Add form field, improve validation
Level 3: Intermediate Feature
- Keywords: implement, create, develop
- Scope: Multiple components
- Time: Days to 1-2 weeks
- Risk: Significant
- Example: User authentication, dashboard
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.
- 3d ago First seen · 142 lines · 0 tokens per session scan A 334ff9cd46ec
van-complexity-determination is a cursor rule published in the GitHub repository alkoleft/mcp-bsl-platform-context (191 stars, last pushed 5mo ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 1,276 tokens. A static security scan graded it A with 0 findings. It is 100% identical to van-complexity-determination, differing in 0 lines, and is treated as a copy.
Other cursor rules, from other repositories
111-java-object-oriented-design
Java Object-Oriented Design Guidelines.
131-java-refactoring-with-modern-features
Modern Java Development Guidelines (Java 8+).
115-java-concurrency
Java rules for Concurrency objects.
133-java-data-oriented-programming
Java rules to apply data oriented programming style.
113-java-general-guidelines
This document outlines general Java coding guidelines covering fundamental aspects such as naming conventions for packages, classes, methods, variables, and constants; code formatting rules including indentation, line length, brace style, and whitespace usage; standards for organizing import statements; best practices…
122-java-integration-testing
Java Integration testing guidelines.