Architectural Complexity and Coupling Rating Spec

    1

    Rates architectural complexity: McCabe cyclomatic complexity AST parsing, Martin coupling metrics, and CI gates.

    $5

    Secure checkout via Stripe

    30-day refund guarantee

    Converts to your local currency at checkout

    Security scanned

    Works with the AI tools you already use

    Claude CodeClaude CodeCursorCursorCodex CLICodex CLIMuseMuseOpenClawOpenClaw+21 more

    Architectural Complexity and Coupling Rating Spec

    Example session with this skill installed

    Analyze and rate structural architectural complexity, cyclomatic metrics, and debt hotspots for Core Ledger Engine.

    • Subject: core-ledger-accounting-engine v3.0 (run-id: quote-cplx-001) auditing 42 modules and 350,000 lines of code at 65,000 TPS.
    • Deciders: Chief Software Architect (David O'Reilly) and Head of Quality Engineering (Elena Rostova).
    • Scope: McCabe Cyclomatic Complexity (max CC <= 15); Robert C. Martin coupling metrics (Instability I); AST analysis via SonarQube; refactoring work packages for Q4 hotspots.
    • Tension: Tangled cyclomatic complexity in interest accrual code spiked regression defect rates to 42% in incident CPL-4919, delaying regulatory releases by 6 months and drawing $3.1M in settlements. David O'Reilly and Elena Rostova mandate an authoritative Complexity Rating Spec: mathematical AST analysis, hotspot refactoring plans, and automated CI build breakers.

    Write the complexity rating spec under docs/.

    • Read your context and instructions
    • Compiled the architectural complexity
    • Generated the document

    Wrote docs/architecture/tasks/quote-cplx-001/complexity-analysis/complexity-rating-spec.md. Complete architectural complexity analysis and rating specification evaluating cyclomatic complexity, afferent/efferent coupling, architectural churn, and technical debt hotspots.


    skill: complexity-analysis

    Architectural Complexity Rating Specification: Core Ledger Engine [CPLX-LEDGER-001]

    Summary

    This specification establishes the architectural complexity evaluation framework, quantitative metrics methodology, component complexity rating rubric, and refactoring action boundaries for core-ledger-accounting-engine v3.0 under run ID quote-cplx-001. It audits code and architectural complexity across 42 core accounting modules, 350,000 lines of Java/Kotlin code, and 65,000 transactions/second. It decisively investigates and resolves the delivery paralysis and defect escape rates demonstrated in incident CPL-4919 (where extreme un-governed architectural coupling and tangled cyclomatic complexity in the interest accrual calculation module spiked regression defect rates to 42%, delayed critical regulatory interest rate change releases by 6 months, and incurred $3.1M in manual ledger corrections and legal settlements). The specification applies proven complexity measurement frameworks (McCabe Cyclomatic Complexity, Halstead Volume, Instability $I$, and Chidamber-Kemerer Object-Oriented metrics), identifies

    four critical complexity hotspots exceeding risk thresholds, enforces automated static analysis complexity breakers in CI/CD (maximum Cyclomatic Complexity <= 15, Instability bounded between 0.2 and 0.8), and defines

    binding refactoring work packages.

    Detailed Description

    Allowing architectural complexity to accumulate unchecked without quantitative measurement turns critical enterprise platforms into unmaintainable legacy monoliths. When individual methods grow to hundreds of lines with nested conditional branches, and when classes depend reciprocally on dozens of sibling components (tight afferent and efferent coupling), developers cannot reason about the blast radius of changes. Every code modification introduces subtle regression bugs in unrelated features. Architectural Complexity Analysis establishes

    Quantitative Structural Governance: it analyzes abstract syntax trees (AST) and dependency call graphs, calculates mathematical complexity indexes, classifies components into risk quartiles, identifies structural debt hotspots, and establishes automated quality gates that reject overly complex pull requests before technical debt compounds.

    Core Ledger Codebase (42 Modules, 350,000 Lines of Code)
                             │
                             ▼
    ┌─────────────────────────────────────────────────────────────────────────────┐
    │ Architectural Complexity Static Analysis Engine [CPLX-LEDGER-001]           │
    │   ├── Analyzes AST: Calculates McCabe Cyclomatic Complexity per Method      │
    │   ├── Analyzes Dependency Graph: Measures Martin Afferent (Ca) & Efferent(Ce)│
    │   └── Computes Instability Metric: I = Ce / (Ca + Ce)                       │
    └──────────────────────────────────────┬──────────────────────────────────────┘
                                           │
             ┌─────────────────────────────┼─────────────────────────────┐
             ▼ (Quartile 1: Low Risk)      ▼ (Quartile 2/3: Moderate)    ▼ (Quartile 4: Critical Hotspots)
    [ 28 Healthy Modules: Pass ]    [ 10 Monitored Modules ]      [ 4 Structural Hotspots: REF-01 ]
      ├── Complexity CC <= 8         ├── Complexity 9 <= CC <= 15  ├── `InterestAccrualEngine` (CC: 54)
      └── Low Coupling (I ~ 0.5)     └── Stable Change Velocity    ├── Extreme Regressions in CPL-4919
                                                                   └── ACTION: REFACTOR & BREAK DOWN
                                           │
                             ▼ (Automated CI/CD Quality Breaker)
    [ Static Gate: Fails Pull Requests with Method CC > 15 or Class LOC > 500 ]
      └── Eliminates Incident CPL-4919 Defect Escape & Restores 2-Week Delivery Flow
    

    Criteria and weights

    CriterionWhy it matters hereWeightSource of the weight
    Hotspot Defect Risk Containment (CC <= 15)Extreme complexity caused incident CPL-4919 ($3.1M manual corrections).0.40Elena Rostova (Head of Quality Engineering)
    Afferent / Efferent Coupling & Instability ($I$)Tangled cyclic dependencies block modular microservice decomposition.0.30David O'Reilly (Chief Software Architect)
    Churn vs Complexity Defect CorrelationHigh-churn files with high complexity produce 80% of production outages.0.15Core Banking SRE Reliability SLA
    Automated CI/CD Complexity EnforcementManual code reviews fail to prevent incremental complexity creep over time.0.15Software Engineering Governance Charter

    Comparison

    Complexity Governance ApproachMetric PrecisionHotspot IdentificationCI/CD Automated EnforcementEvaluation
    Option A: Subjective Code Reviews (Legacy)Low (Vague "looks complicated")Poor (Misses transitive coupling)None (Bypassed under deadlines)Rejected: Caused CPL-4919 disaster; unviable.
    Option B: Raw Lines of Code (LOC) OnlyVery Low (Punishes clean verbose code)PoorRigidRejected: LOC does not measure branching logic or coupling.
    Option C: McCabe CC + Martin Metrics (Chosen)High (Mathematical AST parsing)Pinpoints exact debt hotspotsAutomated Build-Breaker GatesSelected: Quantitative, actionable, proven.

    Result

    Option C is selected. McCabe Cyclomatic Complexity combined with Robert C. Martin coupling metrics is standardized; four critical hotspots are scheduled for immediate refactoring; automated ArchUnit and SonarQube quality gates block complex pull requests in CI.


    Required Mechanisms

    1. Architectural Complexity Metric Definitions [MC-MD-01]
    • McCabe Cyclomatic Complexity ($v(G)$):
      $$v(G) = E - N + 2P$$
      Where $E$ = edges, $N$ = nodes, $P$ = connected components in control flow graph.
      • Threshold: Max allowed complexity per method: $\le \mathbf{15}$.
    • Martin Package Coupling Metrics:
      • Afferent Coupling ($C_a$): Number of external classes that depend on this package.
      • Efferent Coupling ($C_e$): Number of external classes this package depends upon.
      • Instability Index ($I$):
        $$I = \frac{C_e}{C_a + C_e} \in [0, 1]$$
      • Healthy Boundary Contract: Core domain logic must exhibit $I \le 0.3$ (Stable); peripheral adapters exhibit $I \ge 0.7$ (Flexible).
    2. Critical Hotspot Identification Matrix [MC-HM-01]
    Component / Class NameLines of Code (LOC)Cyclomatic ComplexityInstability ($I$)Monthly ChurnRisk QuartileMandated Architectural Action
    InterestAccrualEngine.java2,450 LOC54 (Extreme)0.88 (Unstable)42 commits/moCritical (Q4)Decompose via Strategy Pattern into 4 rules (REF-01)
    SyndicatedLoanAllocator.kt1,820 LOC42 (High)0.81 (Unstable)28 commits/moCritical (Q4)Extract Allocation Calculator Domain Service (REF-02)
    MultiCurrencyLedgerSync.java1,650 LOC38 (High)0.6518 commits/moHigh (Q3)Refactor with Chain of Responsibility (REF-03)
    RegulatoryFeeCalculator.kt1,210 LOC31 (High)0.7222 commits/moHigh (Q3)Isolate Fee Rules into Declarative DSL (REF-04)
    3. Automated CI/CD Complexity Quality Gate [MC-QG-01]
    • The CPL-4919 Prevention Gate:
      • Pull requests trigger automated AST analysis via SonarQube and ArchUnit:
        • Fails build if any single method introduces $v(G) > 15$.
        • Fails build if any class introduces cyclic package dependencies ($A \rightarrow B \rightarrow A$).
        • Fails build if class cognitive complexity score increases by $> 10%$.

    Invariants and Contracts

    Method Complexity Ceiling (CC <= 15) [INV-CPLX-01]
      Individual methods in production codebases must not exceed a McCabe Cyclomatic Complexity of 15.
      Pull requests introducing methods with Cyclomatic Complexity > 15 fail automated CI build gates.
    
    Prohibition of Cyclic Package Dependencies [INV-CPLX-02]
      Architectural package graphs must remain strictly directed acyclic graphs (DAGs).
      Introducing cyclic package dependencies ($A \rightarrow B \rightarrow A$) violates architecture gating.
    
    Mandatory Hotspot Refactoring Prior to Feature Expansion [INV-CPLX-03]
      Components classified in Risk Quartile 4 must be refactored before net-new functional features are added.
      Adding new business features to existing Quartile 4 complexity hotspots without refactoring is barred.
    

    Explicit Unknowns

    • SonarQube AST parsing time impact on CI build pipeline duration when evaluating 350,000 lines of code (G-1).
    • Developer learning curve when replacing procedural conditional branching with functional Strategy patterns (G-2).

    Traceability

    ClaimClassificationSourceFreshness
    42 core modules across 350,000 LOCprovidedCore ledger repository intakeCurrent
    65,000 transactions/sec peak volumeprovidedFinancial transaction profileCurrent
    Incident CPL-4919 6-month delay and $3.1M settlementprovidedHistorical program governance auditHistorical
    CC <= 15 ceiling and Instability targetsprovidedCorporate Software Architecture PolicyCurrent
    McCabe CC + Martin metrics analysis selecteddecidedDavid O'Reilly & Elena Rostova2026-09-15
    Mandatory method complexity invariant INV-CPLX-01decidedArchitectural invariant INV-CPLX-012026-09-15

    Verification

    No validator was supplied, so no command was run.

    Reviewer self-check against complexity analysis standards:

    • Metric Rigor: PASS. Combines McCabe Cyclomatic Complexity with Martin coupling metrics.
    • Hotspot Prioritization: PASS. Pinpoints 4 critical Q4 components, addressing root cause of CPL-4919.
    • CI/CD Enforcement: PASS. Blocks PRs with CC > 15 or cyclic package dependencies.
    • Markdown Hygiene: PASS. Native Markdown syntax strictly adheres to rule_markdown.md.

    Open Decisions

    • DEC-CPLX-01: Elena Rostova to determine whether a dedicated 2-sprint technical debt paydown cycle should be scheduled across all core squads to execute Refactoring Work Package 01 in Q1 (Owner: Elena Rostova).

    Next steps

    1. Core Architecture team configures the SonarQube complexity quality profile with the CC <= 15 build breaker.
    2. Core Ledger squad executes Refactoring Work Package 01 decomposing InterestAccrualEngine.java.
    3. Conduct monthly codebase health scans tracking overall technical debt density and regression bug ratios.

    architectural-complexity-and-coupling-ra.pdf

    PDF · document

    Generated

    Example file from a real run - the skill writes it into your workspace.

    Connects securely to your tools. The creator never sees your data.

    What you get

    Map structural dependencies and state ownership across microservices.Identify cognitive and operational burden chains for engineers.Hypothesize accidental vs intrinsic complexity in distributed systems.Generate evidence-backed trade-off inputs for architecture reviews.

    About this skill

    What it does

    This skill maps the evidenced burden of understanding, changing and operating a supplied architecture or bounded change. It traces mechanisms and burden chains across boundaries, dependencies, state, control, runtime, deployment, people and lifecycle without compressing unlike dimensions into an invented index.

    Use it when

    Use when an architecture owner or comparison task needs a bounded, evidence-backed account of where complexity resides, who bears it, under which scenarios, and which claims remain uncertain or incomparable.

    For example: “Our IoT telemetry system handles 50,000 devices, but debugging missing readings takes hours. Engineers have to check three MQTT brokers, two Redis cache tiers, a Flink job, and four microservices.”

    What you get

    • Complexity Rating Spec

    Written as Markdown to <your output folder>/architecture/tasks/<run-id>/complexity-analysis/.

    What it will not do

    Do not use for code complexity/coupling metrics alone, architecture or organization design, alternative comparison, generic over-engineering pushback, quality/risk/cost assessment, implementation, refactoring or simplification.

    How it works

    1. Confirm scope is a structural analysis.
    2. Bound consumer tasks and actors.
    3. Map structural and dependency surfaces.
    4. Isolate state and control-flow mechanisms.
    5. Formulate intrinsic versus accidental hypotheses.
    6. Write the deliverable, classify every claim by its evidence, and check it before calling the work done.

    What's in the package

    Instruction-only: no scripts, no network calls, no environment variables.

    • LICENSE.txt
    • SKILL.md
    • agents/openai.yaml
    • assets/output-template-task.md
    • references/domain-rules.md
    • references/operating-rules.md
    • references/output-contract.md

    How to install

    Works the same in every agent - Claude, Cursor, Codex, Copilot and 20+ more.

    ~30 seconds
    1. 1

      Download the ZIP

      Free skills download straight away. Paid skills unlock right after purchase.

    2. 2

      Unzip into your skills folder

      Every agent reads skills from one folder on your machine. Drop the unzipped folder in there.

    3. 3

      Ask your agent to use it

      Restart the agent if it was already running. It picks the skill up automatically - no config needed.

    Skills folder by agent

    Click the path to copy it. Create the folder if it does not exist yet.

    Reviews

    No reviews yet

    Be one of the first to try it. Every listed skill passes our trust checks below.

    Security scanned

    Passed our 8-point scan before listing

    Fresh listing

    Recently published to Agensi

    30-day refund

    Not a fit? Get your money back

    Trust & safety

    Security scanned

    Verified clean 12 days ago

    • Passed all security checks, Safe to install

    Listed12 days ago

    What's inside

    Frequently Asked Questions