Public report of anthropics/claude-plugins-official, published 15 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 15 November 2026, 18:41 UTC · Survey ID cd_d20de8e31f9548699238c48ef2a0e399

anthropics/claude-plugins-official

Measured 15 November 2026, 18:41 UTC, at code version b5b01ac

Knowledge freshness is not measured: Freshness signal contradicted by repo activity.

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 33out of 100 At risk

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A medium codebase: 43,709 lines of product code in 6 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 21

Findings by how serious they are

87 critical 697 serious 60 minor

15 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
15 November 2026, 18:41 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

63of 63 dimensions measured by tools.
830of 844 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
63dimensions across 7 lenses, read from 43,709 lines of product code in 6 projects.
Chapters

Executive summary

anthropics/claude-plugins-official is rated At risk because critical security findings are open, most of them in the packages it uses. Its score is held back because we found no logging, tracing or health checks in the code and no automated security scanning of the code, its secrets or its dependencies. It scores 33 out of 100, which the At risk rating leaves unchanged. We judged it as a template or a sample, against a lower bar.

Production Readiness, at 21, is the weakest lens and counts most in the score. The best first steps are logging through a logging library and adding automated security scanning, each worth about 4 points. Raising Production Readiness to 52 would lift the score to about 41.

Sixty-two known security holes in the packages the code depends on can be used by attackers. Eleven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and four automatic updates take new releases before a bad one can be spotted. Updating the vulnerable packages, pinning each tool to an exact version and setting a waiting period for automatic updates would close these risks. The four form fields without a label need a label.

The product code is 43,709 lines, about €54,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 21 · counts for 46%Accessibility 30 · counts for 25%Code Health 37 · counts for 14%Performance 60 · counts for 8%Security and Compliance 64 · counts for 4%Maturity 76 · counts for 2%Architecture 98 · counts for 1%

If Production Readiness rose from 21 to 52, the lowest score rated Strong, the score would rise from 33 to about 41.

Code composition: what the lines of code are
Product code 69%Tests 31%
Rebuild cost: about €54,000 · Estimate
Cost to rebuild€18,000 to €90,000, for 299 to 948 hours of work, about 0.4 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 33. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 43,709 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Log through `logging.getLogger(__name__)` (or structlog) with a JSON formatter at meaningful points in the modules you run.
Raises the score by about 4 points · Medium effort · Observability
2
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Raises the score by about 4 points · Medium effort · Security & performance tooling
3
Add a test runner (vitest / jest / playwright) and eslint and `tsc --noEmit` as REDACTED scripts and run them in CI.
Raises the score by about 4 points · Medium effort · Tooling

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €54,000 to build again, about 0.4 person-years of work. Its weakest lens is Production Readiness, at 21 (Critical). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Log through `logging.getLogger(__name__)` (or structlog) with a JSON formatter at meaningful points in the modules you run. Of all the actions in this report, it raises the score most for the work it takes: about 4 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.8 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 94,371 lines over the last 90 days, which is about 382,727 lines a year. At that pace, the extra work comes to an estimated 51.6 to 309.4 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

77 modules, with 33 dependencies between them. Every module uses only modules listed above it, so there are no loops.

The table shows the 40 modules with the most connections; 37 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 .github.scripts2 external_plugins.discord.server3 external_plugins.fakechat.server4 external_plugins.imessage.server5 external_plugins.telegram.server6 plugins.claude-security.scripts.lib.chain7 plugins.claude-security.scripts.lib.finding8 plugins.claude-security.scripts.lib.revision9 plugins.claude-security.scripts.lib.sarif10 plugins.claude-security.scripts.write_scan_meta11 plugins.code-modernization.hooks.map.estate12 plugins.code-modernization.hooks.reader.modernized13 plugins.code-modernization.hooks.reader.progress14 plugins.code-modernization.hooks.reader.tracks15 plugins.code-modernization.hooks.review.deck16 plugins.hookify.core.config_loader17 plugins.theme-examples.hooks.project-key18 plugins.theme-examples.hooks.register19 plugins.theme-examples.hooks.scenes.braille-stars20 plugins.theme-examples.hooks.scenes.dither-dunes21 plugins.theme-examples.hooks.scenes.halftone-dawn22 plugins.theme-examples.hooks.scenes.night-reef23 plugins.theme-examples.hooks.scenes.paper-garden24 plugins.theme-examples.hooks.scenes.plotter-tide25 plugins.theme-examples.hooks.scenes.snow-pines26 external_plugins.discord27 external_plugins.fakechat28 external_plugins.imessage29 external_plugins.telegram30 plugins.claude-security.scripts.lib31 plugins.claude-security.scripts.patch_artifacts32 plugins.claude-security.scripts.render_report33 plugins.claude-security.scripts.save_result34 plugins.code-modernization.hooks.map35 plugins.code-modernization.hooks.reader36 plugins.code-modernization.hooks.review37 plugins.hookify.core.rule_engine38 plugins.theme-examples.hooks39 plugins.theme-examples.hooks.scenes40 plugins.claude-security.scripts
1 .github.scripts
2 external_plugins.discord.server
3 external_plugins.fakechat.server
4 external_plugins.imessage.server
5 external_plugins.telegram.server
6 plugins.claude-security.scripts.lib.chain
7 plugins.claude-security.scripts.lib.finding
8 plugins.claude-security.scripts.lib.revision
9 plugins.claude-security.scripts.lib.sarif
10 plugins.claude-security.scripts.write_scan_meta
11 plugins.code-modernization.hooks.map.estate
12 plugins.code-modernization.hooks.reader.modernized
13 plugins.code-modernization.hooks.reader.progress
14 plugins.code-modernization.hooks.reader.tracks
15 plugins.code-modernization.hooks.review.deck
16 plugins.hookify.core.config_loader
17 plugins.theme-examples.hooks.project-key
18 plugins.theme-examples.hooks.register
19 plugins.theme-examples.hooks.scenes.braille-stars
20 plugins.theme-examples.hooks.scenes.dither-dunes
21 plugins.theme-examples.hooks.scenes.halftone-dawn
22 plugins.theme-examples.hooks.scenes.night-reef
23 plugins.theme-examples.hooks.scenes.paper-garden
24 plugins.theme-examples.hooks.scenes.plotter-tide
25 plugins.theme-examples.hooks.scenes.snow-pines
26 external_plugins.discord1
27 external_plugins.fakechat1
28 external_plugins.imessage1
29 external_plugins.telegram1
30 plugins.claude-security.scripts.lib162
31 plugins.claude-security.scripts.patch_artifacts1
32 plugins.claude-security.scripts.render_report1
33 plugins.claude-security.scripts.save_result1
34 plugins.code-modernization.hooks.map11
35 plugins.code-modernization.hooks.reader23
36 plugins.code-modernization.hooks.review11
37 plugins.hookify.core.rule_engine2
38 plugins.theme-examples.hooks51
39 plugins.theme-examples.hooks.scenes3712457
40 plugins.claude-security.scripts2113631
Uses a module listed above itPart of a loopThe module itself
1 .github.scripts2 external_plugins.discord.server3 external_plugins.fakechat.server4 external_plugins.imessage.server5 external_plugins.telegram.server6 plugins.claude-security.scripts.lib.chain7 plugins.claude-security.scripts.lib.finding8 plugins.claude-security.scripts.lib.revision9 plugins.claude-security.scripts.lib.sarif10 plugins.claude-security.scripts.write_scan_meta11 plugins.code-modernization.hooks.map.estate12 plugins.code-modernization.hooks.reader.modernized13 plugins.code-modernization.hooks.reader.progress14 plugins.code-modernization.hooks.reader.tracks15 plugins.code-modernization.hooks.review.deck16 plugins.hookify.core.config_loader17 plugins.theme-examples.hooks.project-key18 plugins.theme-examples.hooks.register19 plugins.theme-examples.hooks.scenes.braille-stars20 plugins.theme-examples.hooks.scenes.dither-dunes21 plugins.theme-examples.hooks.scenes.halftone-dawn22 plugins.theme-examples.hooks.scenes.night-reef23 plugins.theme-examples.hooks.scenes.paper-garden24 plugins.theme-examples.hooks.scenes.plotter-tide25 plugins.theme-examples.hooks.scenes.snow-pines26 external_plugins.discord27 external_plugins.fakechat28 external_plugins.imessage29 external_plugins.telegram30 plugins.claude-security.scripts.lib31 plugins.claude-security.scripts.patch_artifacts32 plugins.claude-security.scripts.render_report33 plugins.claude-security.scripts.save_result34 plugins.code-modernization.hooks.map35 plugins.code-modernization.hooks.reader36 plugins.code-modernization.hooks.review37 plugins.hookify.core.rule_engine38 plugins.theme-examples.hooks39 plugins.theme-examples.hooks.scenes40 plugins.claude-security.scripts.github.scripts1external_plugins.discord.server2external_plugins.fakechat.server3external_plugins.imessage.server4external_plugins.telegram.server5plugins.claude-security.scripts.lib.chain6plugins.claude-security.scripts.lib.finding7plugins.claude-security.scripts.lib.revision8plugins.claude-security.scripts.lib.sarif9plugins.claude-security.scripts.write_scan_meta10plugins.code-modernization.hooks.map.estate11plugins.code-modernization.hooks.reader.modernized12plugins.code-modernization.hooks.reader.progress13plugins.code-modernization.hooks.reader.tracks14plugins.code-modernization.hooks.review.deck15plugins.hookify.core.config_loader16plugins.theme-examples.hooks.project-key17plugins.theme-examples.hooks.register18plugins.theme-examples.hooks.scenes.braille-stars19plugins.theme-examples.hooks.scenes.dither-dunes20plugins.theme-examples.hooks.scenes.halftone-dawn21plugins.theme-examples.hooks.scenes.night-reef22plugins.theme-examples.hooks.scenes.paper-garden23plugins.theme-examples.hooks.scenes.plotter-tide24plugins.theme-examples.hooks.scenes.snow-pines25external_plugins.discord26external_plugins.fakechat27external_plugins.imessage28external_plugins.telegram29plugins.claude-security.scripts.lib30plugins.claude-security.scripts.patch_artifacts31plugins.claude-security.scripts.render_report32plugins.claude-security.scripts.save_result33plugins.code-modernization.hooks.map34plugins.code-modernization.hooks.reader35plugins.code-modernization.hooks.review36plugins.hookify.core.rule_engine37plugins.theme-examples.hooks38plugins.theme-examples.hooks.scenes39plugins.claude-security.scripts40111116211111231125137124572113631+37 more modules (most-connected shown)

At a glance — Code Health · 37% · Weak · gated by D1, D2, R2, R3, R7 ·

At a glance — Architecture · 98% · Exemplary ·

At a glance — Maturity · 76% · Exemplary ·

At a glance — Readiness · 21% · Weak · gated by R6, P2, P3, P6 ·

At a glance — Security · 64% · Adequate · gated by D29 ·

At a glance — Accessibility · 30% · Weak · gated by AC1, AC4, AC6 ·

At a glance — Performance · 60% · Strong ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures78High / Critical
A05:2025 — Injection28High / Critical

Roadmap

Top priorities: Log through `logging.getLogger(__name__)` (or structlog) with a JSON formatter at meaningful points in the modules you run; Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing; Add a test runner (vitest / jest / playwright) and eslint and `tsc --noEmit` as REDACTED scripts and run them in CI.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Log through `logging.getLogger(__name__)` (or structlog) with a JSON formatter at meaningful points in the modules you run.+4.2 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.+4.2 ptsMediumSecurity & performance tooling
Add a test runner (vitest / jest / playwright) and eslint and `tsc --noEmit` as REDACTED scripts and run them in CI.+4.2 ptsMediumTooling
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.+2.5 ptsMediumText alternatives
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.+2.5 ptsMediumKeyboard semantics
Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.+2.1 ptsMediumRelease Hygiene
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+1.7 ptsMediumVisual & motion safety
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.+1.6 ptsMediumDependency Hygiene

File quality

Per-file score 0–10 — a quality signature. Of 86 files carrying findings, judged against the Template bar: 5% slop · 11% mixed · 84% near-clean.

FileScoreBandWorst signal
REDACTED0.5SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.5SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.5SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.5SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.2MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.6MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.8MixedDependency Vulnerabilities: High CVE: REDACTED
REDACTED6.0MixedCyclomatic Complexity: llm._agentic_review (cyclomatic 44)
plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py7.0Near-cleanCyclomatic Complexity: Pulse.one_day (cyclomatic 131)
plugins/session-report/skills/session-report/analyze-sessions.mjs7.0Near-cleanCyclomatic Complexity: analyze-sessions.processFile (cyclomatic 95)
plugins/security-guidance/hooks/security_reminder_hook.py7.0Near-cleanCyclomatic Complexity: security_reminder_hook.handle_commit_review_posttooluse (cyclomatic 93)
plugins/code-modernization/scripts/build_report.py7.0Near-cleanCyclomatic Complexity: build_report.proof_module (cyclomatic 69)
plugins/code-modernization/scripts/proof_pack.py7.0Near-cleanCyclomatic Complexity: proof_pack.render_md (cyclomatic 53)
plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py7.0Near-cleanCyclomatic Complexity: Page.check (cyclomatic 49)

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 87

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 697

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 60

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 15

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 63 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.

What we checked — 63 dimensions across the health lenses
D1D2D3D4D5D6D10D12D13D14D15D16D17D19D24D26D27D28D29D30D35D43AC1AC2AC3AC4AC5AC6AX10AX3AX4AX6M1M2M3M4P1P2P3P6PF3R1R10R2R3R4R6R7R8R9X1X12X13X19X2X21X24X25X27X28X3X30X5

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 830 of 844 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1e083-61fd-7fbc-9788-63c2a794d9a6.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py, .ts) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
  • D10 Test Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 131 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 79 test source file(s) (.py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not included — the Python suite (repository root, 78 test files) did not finish re-running within its budget: the Python suite did not finish re-running within its tier budget.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository publishes a package — a Claude Code plugin, declared by plugins/typescript-lsp/.claude-plugin/plugin.json — so it DOES have an intentionally-exposed surface: the commands, skills, agents and hooks the plugin contributes to its host, which consumers reach by name. D22 collects code-API surfaces (type and member signatures) only, and has no collector for a plugin's contribution surface, so the consistency of that surface was not judged. That is OUR side and it is a COLLECTOR gap, not an environment fault — no change to the scan image can close it.
  • D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D27 Navigability — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Tracing effort is measured over resolved call sites, and all 1449 sampled here came from .py files. This repository's .ts source is a material share of its production lines and contributed none, so the score above is a verdict about the part that was read. Not a finding that the unread half navigates well — it is unmeasured.
  • D34 Knowledge Freshness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. File-level freshness contradicts repo activity: 1527 commits in the last 90 days, yet 49 of 90 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run.
  • D44 Platform End-of-Life — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `npm run` found no REDACTED in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no REDACTED in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read REDACTED: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (start). the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no REDACTED in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read REDACTED: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P1 CI/CD gates — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A CI pipeline exists and the word "test" appears, but no explicit test-runner invocation (your stack's test command, or a test job) was matched — so either the gate runs tests through a step this pass could not recognise, or "test" is incidental here (a path, "latest", a reporter). Which of the two it is cannot be settled from this dimension's evidence; the coverage dimensions report whether a suite exists at all. You can widen what we reach: name the test runner explicitly in the pipeline step (your stack's test command, or a job named for the suite) so the gate is unambiguous to a reader and to this pass.
  • R2 Cyclomatic Complexity — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 47 further occurrence(s) are not listed individually; the score already reflects all 87.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X27 Collection changed while being enumerated — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X3 Exception handling — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 34 further occurrence(s) are not listed individually; the score already reflects all 74.
  • X4 Structured logging — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala, Rust, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Prevented

166 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was register.register at 243.

register.register (cyclomatic 243)plugins/code-modernization/hooks/register.ts:104
Pulse.one_day (cyclomatic 131)plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1190
progress.readSnapshot (cyclomatic 124)plugins/code-modernization/hooks/reader/progress.ts:496
analyze-sessions.processFile (cyclomatic 95)plugins/session-report/skills/session-report/analyze-sessions.mjs:191
security_reminder_hook.handle_commit_review_posttooluse (cyclomatic 93)plugins/security-guidance/hooks/security_reminder_hook.py:1765

+ 156 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 10 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with register.register (cyclomatic 243), Pulse.one_day (cyclomatic 131), progress.readSnapshot (cyclomatic 124). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 10 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Prevented

222 method(s) exceeded the cognitive complexity threshold of 15; the worst was analyze-sessions.processFile at 201.

analyze-sessions.processFile (cognitive 201)plugins/session-report/skills/session-report/analyze-sessions.mjs:191
viewer.html.renderBenchmark (cognitive 181)plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:1114
Pulse.one_day (cognitive 179)plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1190
progress.readSnapshot (cognitive 165)plugins/code-modernization/hooks/reader/progress.ts:496
security_reminder_hook.handle_commit_review_posttooluse (cognitive 129)plugins/security-guidance/hooks/security_reminder_hook.py:1765

+ 213 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 27 bodies over 60 down to 60 or less in Cognitive Complexity — start with analyze-sessions.processFile (cognitive 201), viewer.html.renderBenchmark (cognitive 181), Pulse.one_day (cognitive 179). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 27 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes7.3 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 7.3 / 10 · rule-coverage 100% · ceiling Prevented

27 god class(es) detected.

FileTooLong: scripts/pulse_compute.py · ×22plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py
FunctionTooLong: register.register · ×4plugins/code-modernization/hooks/register.ts:104
ClassTooLong: registerplugins/code-modernization/hooks/register.ts:1

What to do

  1. Resolve the 22 FileTooLong finding(s) in God Classes — start with REDACTED (3), pulse_compute.py, security_reminder_hook.py. — One of this dimension's main actionable groups (22 warning-level).
  2. Resolve the 4 FunctionTooLong finding(s) in God Classes — start with register.ts, analyze-sessions.mjs, viewer.html. — One of this dimension's main actionable groups (4 warning-level).
  3. Resolve the 1 ClassTooLong finding(s) in God Classes — start with register.ts. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication9.4 / 10Stronggated by 27 serious findings✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Verified

15 duplicated block group(s) detected. 1.6 % of the production lines (680 of 43,709) are in a reported copy. A further 12 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. Measured on part of this repository only: .ts (30% of production source) was not exposed to THIS dimension's token comparison and is not in this count; duplication there is measured by R10 Code Duplication, the frontend lens's card running the same clone algorithm over the JS/TS token stream.

Edited copy of a member (11 corresponding lines) · ×2plugins/code-modernization/scripts/baseline_diff.py:111
Duplicated block (8 lines × 2) · ×2plugins/security-guidance/hooks/security_reminder_hook.py:2286
Duplicated block (6 lines × 2) · ×2plugins/security-guidance/hooks/security_reminder_hook.py:2281
Duplicated block (5 lines × 2) · ×2plugins/security-guidance/hooks/diffstate.py:1327
Members sharing a duplicated core (4 members, 50+ identical tokens)plugins/hookify/hooks/posttooluse.py:27

+ 18 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 2 Edited copy of a member (11 corresponding lines) finding(s) in Code Duplication — start with baseline_diff.py, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  2. Resolve the 2 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with security_reminder_hook.py, run_eval.py. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 2 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with security_reminder_hook.py, run_eval.py. — One of this dimension's main actionable groups (2 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

5 production modules (npm+source-import), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations, and — for the source no manifest declares — its top-level source directories, with the imports between them as edges; 0 module(s) off the main sequence.

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 8 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests truly assert behaviour rather than just running the code.

Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 131 tests. Measured on the JavaScript/TypeScript suite only — at least 79 test source file(s) (.py) went unread, so its test quality is unmeasured and is not in these counts.

✓ On the Gold path — maintain.

Detailed fixes: d10_recommendation.md.

D12 · Dependency Hygiene9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Verified

4 outdated direct production npm dependency(ies) of 4 graded, 0 pinning defect(s), across 4 REDACTED (4 of them the product) and 4 committed lockfile(s). Development dependencies are deliberately not graded for currency: that grade is about what SHIPS. 0 direct dependency(ies) — production, development or optional — are marked DEPRECATED by their publisher (the registry's per-version mark, or the lockfile's copy of it when the registry could not be asked); deprecated transitive packages are listed but not charged. Whether any is UNMAINTAINED is not graded — the registry publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, and the frontend dependency lens (R8) answers it in this same run. Known CVEs in this dependency graph are D30's question, read from the manifest there.

Outdated (npm): @modelcontextprotocol/sdk · ×4

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 121 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 121 package(s) this repository's committed lockfile installs for a consumer — its 4 production, optional and peer dependency(ies), across 4 product REDACTED manifest(s), and everything those install in turn. Its 2 `devDependencies` declaration(s), and every package only they reach, are excluded: a consumer installs none of them. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. Third-party code that ships WITHOUT a manifest entry was read too: 0 component(s) whose licence travels in the tree (vendored or copied-in directories, licence comments preserved in committed bundles, compiled wasm modules) and 0 bundled package(s) named only by a bundle's module path, graded on the registry; 0 use a banned licence. 11 vendored, copied-in or compiled component(s) state no licence this pass can read — missing data, not charged. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots7.7 / 10Strong✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 7.7 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: plugins/security-guidance/hooks/security_reminder_hook.py (68×93=6324); REDACTED (32×44=1408); plugins/code-modernization/hooks/register.ts (5×243=1215)

Hotspot: plugins/security-guidance/hooks/security_reminder_hook.py · ×19plugins/security-guidance/hooks/security_reminder_hook.py:1765

What to do

  1. Resolve the 19 Hotspot finding(s) in Churn × Complexity Hotspots — start with security_reminder_hook.py, REDACTED, register.ts. — One of this dimension's main actionable groups (19 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor7.6 / 10Strong✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 7.6 / 10 · rule-coverage 100% · ceiling Documented

22 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is plugins/code-modernization/scripts/proof_pack.py. Counted over 90 of the 113 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt10.0 / 10Exemplary○ Nothing flagged

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

0 deducted task-comment markers across 43709 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

2 of 2 documentation facets pass in full. 53 document(s) read across 5 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D24 · Comment Value10.0 9.8 / 10Exemplary○ Nothing flagged

What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).

Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 98% · ceiling Documented

0 of 528 judged comments only repeat the code they sit on (0.0 %). 13 comment(s) in another language or script were not judged.

doc comments repeat the namesplugins/code-modernization/hooks/reader/brief.ts:65

✓ On the Gold path — maintain.

Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion6.7 / 10Adequate✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 6.7 / 10 · rule-coverage 100% · ceiling Documented

1 of 6 build units (checkout, npm, tsc) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D27 · Navigability10.0 / 10Exemplary✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

80 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated. Measured over the .py source only — this repository's .ts was not sampled for call sites, so this score covers part of the tree, not all of it.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)2.8 / 10Weak✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 2.8 / 10 · rule-coverage 100% · ceiling Documented

28 finding(s): 0 critical, 15 high, 11 medium, 2 low. 11 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 6 file(s) — `plugins/claude-security/hooks/hooks.sh` (lines 5–14, line 17, lines 17–18, …), `plugins/claude-security/scripts/keep-waiting.sh` (lines 8–9), `plugins/claude-security/workflows/scan.js`, `plugins/code-modernization/scripts/telemetry.sh` (lines 11–129), `plugins/ralph-loop/scripts/setup-ralph-loop.sh` (lines 6–204), … (+1 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 1 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 8 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (8 warning-level).
  2. Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
  3. No action in Static Analysis (SAST) — all 11 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (11 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities0.2 / 10Critical✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 0.2 / 10 · rule-coverage 100% · ceiling Documented

78 finding(s): 8 critical, 54 high, 16 medium, 0 low.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 54 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (49), REDACTED (5). — One of this dimension's main actionable groups (54 issue-level).
  2. Resolve the 8 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (8). — One of this dimension's main actionable groups (8 issue-level).
  3. Resolve the 16 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (16). — One of this dimension's main actionable groups (16 warning-level).

Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.

  • A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. — plugins/code-modernization/assets/topology-viewer.html:73

What to do

  • Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
AC2 · Forms & labels4.9 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×2) — external_plugins/fakechat/server.ts:227, external_plugins/fakechat/server.ts:229
  • A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). — REDACTED:72
  • This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×2) — plugins/code-modernization/assets/topology-viewer.html:81, plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:604
  • A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label. — plugins/project-artifact/skills/project-artifact/template.html:226

What to do

  • Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
AC3 · Page structure5.7 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×4) — plugins/code-modernization/assets/topology-viewer.html:2, plugins/session-report/skills/session-report/template.html:2, plugins/skill-creator/skills/skill-creator/assets/eval_review.html:2, …
  • An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative. (×3) — plugins/project-artifact/skills/project-artifact/template.html:233, plugins/project-artifact/skills/project-artifact/template.html:266, plugins/project-artifact/skills/project-artifact/template.html:268
  • Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. — plugins/project-artifact/skills/project-artifact/template.html:258

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC4 · Keyboard semantics1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.

Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".

  • A script attaches a click listener to this <canvas>, but it has no role, no tabindex and no key handler, so it can only be operated with a mouse. Use a <button>, or add role + tabindex="0" + a key handler. — plugins/code-modernization/assets/topology-viewer.html:73

What to do

  • Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.

Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC6 · Visual & motion safety3.6 / 10Weak✓ Tool-verified

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • `body` sets color: #1a1f27 on background-color: #0e1217 — 1.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — REDACTED:18
  • `input,button,select` sets color: #1a1f27 on background-color: #161b22 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — REDACTED:28
  • `.mm` sets color: #e6e9ee on background-color: #fff — 1.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — REDACTED:58
  • `.copy` sets color: #1a1f27 on background-color: #161b22 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — REDACTED:63
  • `#hint` sets color: #8a8a8a on background-color: #252526 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/code-modernization/assets/topology-viewer.html:66
  • `th` sets color: rgb(80,80,80) on background-color: #1a1918 — 2.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/session-report/skills/session-report/template.html:195
  • `.btn-add` sets color: white on background-color: #6a9bcc — 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/assets/eval_review.html:17
  • `.btn-export` sets color: white on background-color: #d97757 — 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/assets/eval_review.html:19
  • `.grades-toggle .arrow` moves (`transition: transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:275
  • `.section-header` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:83
  • `.output-file-header` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:136
  • `.output-file-content .download-link` sets color: #d97757 on background-color: #faf9f5 — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:197
  • `.prev-feedback` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:221
  • `.grade-pass` sets color: #788c5d on background-color: #eef2e8 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:302
  • `.grade-fail` sets color: #c44 on background-color: #fceaea — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:303
  • `.done-btn.ready` sets color: white on background-color: #d97757 — 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:467

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

M1 · Documentation (README)9.3 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

P1 · CI/CD gates8.5 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

What to do

  • Run the test suite in CI via an explicit runner step (`npm test` for the toolchain this pipeline already uses) and gate merges on it.
P2 · Observability0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

  • No logging call was found in the 19 Python, JavaScript/TypeScript production file(s) this check read across 6 module(s). Each was searched for its ecosystem's logging libraries (Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.

What to do

  • Log through `logging.getLogger(__name__)` (or structlog) with a JSON formatter at meaningful points in the modules you run.
  • Add a health-check endpoint (a /health route) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

  • No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 7 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:12
  • `REDACTED` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — REDACTED:10

What to do

  • Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene3.0 / 10Weak✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.

What to do

  • Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.
PF3 · Async & latency hygiene6.0 / 10Strong✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

  • `rmSync` in `callback to void` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:357, REDACTED:361
  • `mkdirSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:428
  • `writeFileSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:429
  • `statSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×4) — REDACTED:616, external_plugins/fakechat/server.ts:109, REDACTED:671, …
  • `mkdirSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — external_plugins/fakechat/server.ts:105, REDACTED:620
  • `copyFileSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — external_plugins/fakechat/server.ts:113
  • `mkdirSync` in `callback to return` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — external_plugins/fakechat/server.ts:182
  • `writeFileSync` in `callback to return` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — external_plugins/fakechat/server.ts:185
  • `writeFileSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:621
  • `mkdirSync` in `callback to handleInbound` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:814
  • `writeFileSync` in `callback to handleInbound` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:815

What to do

  • TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
R1 · Type Safety8.6 / 10Exemplary✓ Tool-verified

React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.

Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.

R10 · Code Duplication7.8 / 10Strong✓ Tool-verified

React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.

Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.

  • 18 duplicated blocks under external_plugins/ have copies in at least two of the sibling directories discord, fakechat, imessage, telegram — 17 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 18 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 18 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 18 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — REDACTED:92
  • REDACTED:92 · REDACTED:98 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — REDACTED:92
  • plugins/theme-examples/hooks/scenes/honu-lagoon.ts:181 · plugins/theme-examples/hooks/scenes/koi-mosaic.ts:282 — the two spans are one implementation copied and then locally edited — 189 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:181
  • REDACTED:753 · REDACTED:748 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:753
  • REDACTED:37 · REDACTED:28 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:37
  • REDACTED:706 · REDACTED:717 · REDACTED:635 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:706
  • REDACTED:252 · REDACTED:339 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:252
  • REDACTED:464 · REDACTED:415 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:464
  • REDACTED:373 · REDACTED:366 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:373
  • REDACTED:312 · REDACTED:325 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:312
  • REDACTED:623 · REDACTED:550 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:623
  • plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178 · plugins/theme-examples/hooks/scenes/night-reef.ts:209 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178
  • REDACTED:595 · external_plugins/fakechat/server.ts:88 · REDACTED:650 · REDACTED:522 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:595
  • plugins/code-modernization/hooks/reader/fs.ts:9 · plugins/code-modernization/hooks/reader/fs.ts:32 — the two spans are one implementation copied and then locally edited — 81 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/code-modernization/hooks/reader/fs.ts:9
  • plugins/code-modernization/hooks/reader/progress.ts:364 · plugins/code-modernization/hooks/reader/progress.ts:394 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/code-modernization/hooks/reader/progress.ts:364
  • REDACTED:496 · REDACTED:777 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:496
  • REDACTED:669 · REDACTED:542 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:669
  • REDACTED:788 · REDACTED:775 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:788
  • plugins/session-report/skills/session-report/analyze-sessions.mjs:801 · plugins/session-report/skills/session-report/analyze-sessions.mjs:825 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/session-report/skills/session-report/analyze-sessions.mjs:801
  • REDACTED:460 · REDACTED:470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:460
  • REDACTED:283 · REDACTED:280 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:283
  • REDACTED:612 · REDACTED:540 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — REDACTED:612
  • REDACTED:732 · REDACTED:667 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:732
  • REDACTED:838 · REDACTED:833 · REDACTED:935 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:838
  • REDACTED:323 · REDACTED:232 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are. — REDACTED:323
  • plugins/code-modernization/workflows/portfolio-assess.js:7 · plugins/code-modernization/workflows/reimagine-scaffold.js:7 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/code-modernization/workflows/portfolio-assess.js:7
  • plugins/theme-examples/hooks/scenes/koi-mosaic.ts:41 · plugins/theme-examples/hooks/scenes/koi-mosaic.ts:237 — the two spans are one implementation copied and then locally edited — 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/theme-examples/hooks/scenes/koi-mosaic.ts:41
  • plugins/theme-examples/hooks/scenes/paper-garden.ts:197 · plugins/theme-examples/hooks/scenes/paper-garden.ts:225 — the two spans are one implementation copied and then locally edited — 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/theme-examples/hooks/scenes/paper-garden.ts:197
  • REDACTED:121 · REDACTED:150 — the two spans are one implementation copied and then locally edited — 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:121
  • plugins/code-modernization/hooks/views/deck.tsx:174 · plugins/code-modernization/hooks/views/deck.tsx:236 — the two spans are one implementation copied and then locally edited — 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — plugins/code-modernization/hooks/views/deck.tsx:174
  • plugins/code-modernization/workflows/extract-rules.js:15 · plugins/code-modernization/workflows/harden-scan.js:9 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/code-modernization/workflows/extract-rules.js:15
  • plugins/code-modernization/workflows/uplift-deltas.js:9 · plugins/code-modernization/workflows/uplift-migrate.js:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/code-modernization/workflows/uplift-deltas.js:9
  • plugins/theme-examples/hooks/scenes/braille-stars.ts:39 · plugins/theme-examples/hooks/scenes/halftone-dawn.ts:42 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — plugins/theme-examples/hooks/scenes/braille-stars.ts:39
  • plugins/theme-examples/hooks/scenes/departure-board.ts:48 · plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178 · plugins/theme-examples/hooks/scenes/night-reef.ts:209 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/theme-examples/hooks/scenes/departure-board.ts:48
  • plugins/theme-examples/hooks/scenes/koi-mosaic.ts:17 · plugins/theme-examples/hooks/scenes/teletext-clouds.ts:52 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — plugins/theme-examples/hooks/scenes/koi-mosaic.ts:17
  • plugins/code-modernization/workflows/harden-scan.js:282 · plugins/code-modernization/workflows/uplift-deltas.js:212 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — plugins/code-modernization/workflows/harden-scan.js:282
  • plugins/theme-examples/hooks/scenes/braille-stars.ts:39 · plugins/theme-examples/hooks/scenes/dither-dunes.ts:112 · plugins/theme-examples/hooks/scenes/halftone-dawn.ts:42 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — plugins/theme-examples/hooks/scenes/braille-stars.ts:39
  • plugins/theme-examples/hooks/scenes/honu-lagoon.ts:37 · plugins/theme-examples/hooks/scenes/paper-garden.ts:92 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:37

What to do

  • Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity3.0 / 10Weak✓ Tool-verified

React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.

Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.

  • readSnapshot has cyclomatic complexity 132 and cognitive complexity 183; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/progress.ts:496
  • processFile has cyclomatic complexity 95 and cognitive complexity 195; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/session-report/skills/session-report/analyze-sessions.mjs:191
  • (anonymous) has cyclomatic complexity 61 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/register.ts:1142
  • xrayOf has cyclomatic complexity 46 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/xray/xray.ts:133
  • (anonymous) has cyclomatic complexity 40 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:528
  • deckView has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/views/deck.tsx:87
  • parseBrief has cyclomatic complexity 38 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/brief.ts:71
  • parseBaseline has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/uplift.ts:52
  • pineCells has cyclomatic complexity 32 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/snow-pines.ts:103
  • (anonymous) has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:601
  • handleInbound has cyclomatic complexity 30 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:778
  • milkyWayCells has cyclomatic complexity 29 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/braille-stars.ts:196
  • (anonymous) has cyclomatic complexity 29 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:656
  • (anonymous) has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/register.ts:837
  • paint has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/map/estate.ts:189
  • parseVerification has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/verification.ts:73
  • parseTopology has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/topology.ts:98
  • planOf has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/views/pane.tsx:542
  • turtleCells has cyclomatic complexity 25 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:56
  • cardOf has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:194
  • alphabet has cyclomatic complexity 23 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/departure-board.ts:85
  • handleInbound has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:907
  • handleUser has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/session-report/skills/session-report/analyze-sessions.mjs:420
  • islandCells has cyclomatic complexity 22 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:134
  • (anonymous) has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/workflows/extract-rules.js:671
  • gate has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:236
  • nextOfTransform has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/progress.ts:273
  • gate has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:236
  • (anonymous) has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:362
  • session has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/views/pane.tsx:315
  • handleInbound has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:810
  • directoryUnits has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/reader/discover.ts:235
  • (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/views/pane.tsx:267
  • gate has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:327
  • upliftXray has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/xray/xray.ts:91
  • fieldStars has cyclomatic complexity 18 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/braille-stars.ts:256
  • levelPath has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/theme-examples/hooks/scenes/dither-dunes.ts:181
  • parseLedger has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — plugins/code-modernization/hooks/review/ledger.ts:24
  • rowOf has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:288
  • readTestsAt has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:157
R3 · Large Files1.2 / 10Critical✓ Tool-verified

React / JS · Code Health — How many source files exceed the large-file threshold.

Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.

  • plugins/code-modernization/hooks/register.ts has 1051 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/code-modernization/hooks/register.ts:1
  • REDACTED has 959 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • plugins/theme-examples/hooks/register.tsx has 894 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/theme-examples/hooks/register.tsx:1
  • plugins/code-modernization/hooks/reader/progress.ts has 832 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/code-modernization/hooks/reader/progress.ts:1
  • REDACTED has 826 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • plugins/code-modernization/workflows/extract-rules.js has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/code-modernization/workflows/extract-rules.js:1
  • plugins/session-report/skills/session-report/analyze-sessions.mjs has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/session-report/skills/session-report/analyze-sessions.mjs:1
  • REDACTED has 798 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
  • plugins/code-modernization/hooks/views/pane.tsx has 588 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/code-modernization/hooks/views/pane.tsx:1
  • plugins/theme-examples/hooks/scenes/koi-mosaic.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/theme-examples/hooks/scenes/koi-mosaic.ts:1
  • plugins/theme-examples/hooks/scenes/night-reef.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/theme-examples/hooks/scenes/night-reef.ts:1
  • plugins/theme-examples/hooks/scenes/paper-garden.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/theme-examples/hooks/scenes/paper-garden.ts:1
  • plugins/theme-examples/hooks/scenes/braille-stars.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — plugins/theme-examples/hooks/scenes/braille-stars.ts:1

What to do

  • Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R4 · Test Coverage4.1 / 10Adequate✓ Tool-verified

React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.

Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.

  • No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×34) — plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:1, plugins/code-modernization/hooks/register.ts:1, plugins/theme-examples/hooks/register.tsx:1, …

What to do

  • Add tests that import the unreached modules (directly or through their public entry).
R6 · Tooling0.0 / 10Critical✓ Tool-verified

React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each REDACTED script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.

Method: REDACTED scanned for test/lint/typecheck script wiring. Deterministic presence check.

  • test ✗ · lint ✗ · typecheck ✗ — read from this repository's REDACTED scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.

What to do

  • Add a test runner (vitest / jest / playwright) and eslint and `tsc --noEmit` as REDACTED scripts and run them in CI.
R7 · Dead Code2.4 / 10Weak✓ Tool-verified

React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).

Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.

  • Unreachable from the 8 application, 7 tooling and 10 test entry point(s) detected in this repo. This repository declares no build, type-check or test script, so nothing here would fail on a wrong deletion — confirm by hand that nothing loads each file (including by a path built at runtime) before removing it. An undetected custom entry would make these reachable.
  • no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×8) — plugins/code-modernization/hooks/register.ts, plugins/theme-examples/hooks/register.tsx, plugins/code-modernization/workflows/extract-rules.js, …
  • no import path from any entry point (8 application, 7 tooling, 10 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (plugins/theme-examples/hooks/register.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it — plugins/theme-examples/hooks/project-key.ts
  • Nothing imports this binding — it is safe to review for removal. (×3) — plugins/code-modernization/hooks/reader/estate-model.ts:114, REDACTED:361, plugins/code-modernization/hooks/state.ts:13
  • This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. — plugins/code-modernization/hooks/reader/discover.ts:177

What to do

  • Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene4.0 / 10Adequate✓ Tool-verified

React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.

Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.

  • Imported but not declared in any reachable REDACTED — installs work only by hoisting accident. (×3) — plugins/code-modernization/hooks/host.ts:1, REDACTED:19, REDACTED:18

What to do

  • Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports10.0 / 10Exemplary✓ Tool-verified

React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.

Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X2 · Cancellation propagation4.0 / 10Weak✓ Tool-verified

Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).

Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.

  • Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
  • `downloadAttachment` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — REDACTED:418

What to do

  • Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X3 · Exception handling5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included. (×7) — plugins/session-report/skills/session-report/analyze-sessions.mjs:101, plugins/session-report/skills/session-report/analyze-sessions.mjs:222, plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:483, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×17) — plugins/session-report/skills/session-report/analyze-sessions.mjs:145, plugins/security-guidance/hooks/_base.py:151, plugins/security-guidance/hooks/_base.py:511, …
  • `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×16) — plugins/security-guidance/hooks/_base.py:239, plugins/security-guidance/hooks/_base.py:538, plugins/security-guidance/hooks/diffstate.py:230, …

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types9.4 / 10Exemplary✓ Tool-verified

Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • ~1.5 `!` null assertions per 1k TypeScript source lines — 16 assertion(s) across the 10696 source line(s) of the 31 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: REDACTED (10), REDACTED (3), REDACTED (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.

What to do

  • The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).

WCAG coverage — what static analysis assessed

Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC1 · Text alternatives1.1.1, 1.2.2, 1.2.5Partial signal
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC4 · Keyboard semantics2.1.1, 2.4.3Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only

Not statically assessed — these 40 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.2.1, 1.2.3, 1.2.4, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health37%Weak — gated by D1, D2, R2, R3, R7Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture98%ExemplaryStrongest area.
Maturity76%ExemplarySolid.
Readiness21%Weak — gated by R6, P2, P3, P6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security64%Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility30%Weak — gated by AC1, AC4, AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance60%StrongSolid.
Unscored — 3 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 14 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 10 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 15 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 60 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no REDACTED in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read REDACTED: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D11 Test Reliability — Test reliability not included
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D20 ADR Quality — N/A — this repo declares itself a template / kata / sample / demo; a formal ADR log is deferred to a real application built from it.
  • D21 Naming Consistency — Naming consistency does not read html yet; not measured.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D25 ADR Conformance — no ADRs to check
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D34 Knowledge Freshness — knowledge concentrated in recent work — freshness signal contradicted by repo activity
  • D36 Supply-chain Provenance & Signing — The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (15 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala and Rust, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Python source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
  • R5 Dependency Freshness — uses a bun lockfile — dependency freshness not measured here; JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 42% of this repository's production lines — python (28,777 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — X29 reached only 42% of this repository's production lines — python (28,777 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 87 finding(s)
D30 · Dependency Vulnerabilities · High CVE · ×54
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • + 29 more in this group — see findings.md.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×8
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC2 · Forms & labels · <textarea> without a programmatic label · ×2
  • <textarea> without a programmatic label external_plugins/fakechat/server.ts:227 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <textarea> without a programmatic label plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:604 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
AC2 · Forms & labels · <input> without a programmatic label · ×2
  • <input> without a programmatic label external_plugins/fakechat/server.ts:229 — This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
  • <input> without a programmatic label plugins/code-modernization/assets/topology-viewer.html:81 — This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
R8 · Dependency Hygiene · Unlisted import 'zod' · ×2
  • Unlisted import 'zod' REDACTED:19 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
  • Unlisted import 'zod' REDACTED:18 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
AC2 · Forms & labels · <button> with no accessible text · ×1
  • <button> with no accessible text REDACTED:72 — A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC2 · Forms & labels · Link with no accessible name · ×1
  • Link with no accessible name plugins/project-artifact/skills/project-artifact/template.html:226 — A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can't say where it goes. Add visible text or an aria-label.
AC4 · Keyboard semantics · Click handler on a non-interactive <canvas> · ×1
  • Click handler on a non-interactive <canvas> plugins/code-modernization/assets/topology-viewer.html:73 — A script attaches a click listener to this <canvas>, but it has no role, no tabindex and no key handler, so it can only be operated with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
R8 · Dependency Hygiene · Unlisted import 'claude-code' · ×1
  • Unlisted import 'claude-code' plugins/code-modernization/hooks/host.ts:1 — Imported but not declared in any reachable REDACTED — installs work only by hoisting accident.
Serious — 697 finding(s)
R4 · Test Coverage · No test reaches this file · ×34
  • No test reaches this file plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/hooks/register.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/register.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file REDACTED:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/session-report/skills/session-report/analyze-sessions.mjs:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/workflows/extract-rules.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/hooks/views/pane.tsx:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/koi-mosaic.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/night-reef.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/paper-garden.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/braille-stars.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/snow-pines.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/workflows/uplift-migrate.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/vector-range.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/dither-dunes.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/plotter-tide.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/honu-lagoon.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/workflows/harden-scan.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/blueprint.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/departure-board.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/scenes/teletext-clouds.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/theme-examples/hooks/project-key.ts:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • No test reaches this file plugins/code-modernization/workflows/uplift-deltas.js:1 — No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
  • + 9 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×23
  • Swallowed exception (caught, then discarded) plugins/session-report/skills/session-report/analyze-sessions.mjs:101 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) plugins/session-report/skills/session-report/analyze-sessions.mjs:222 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/_base.py:239 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/_base.py:538 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/diffstate.py:230 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:367 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:481 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:685 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:697 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/extensibility.py:585 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:454 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:460 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:2550 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) REDACTED:2718 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/reporesolve.py:66 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/reporesolve.py:294 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/security_reminder_hook.py:732 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/security-guidance/hooks/security_reminder_hook.py:758 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:483 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:491 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:514 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:532 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
  • Swallowed exception (caught, then discarded) REDACTED:149 — `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (`catch (e) { if (!(e instanceof SyntaxError)) throw e; … }`, or test `e.name`), because a JavaScript catch takes every exception, programming errors included.
D3 · God Classes · FileTooLong · ×22
  • FileTooLong: scripts/pulse_compute.py plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py — FileTooLong — 2014 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1514 over it, 4.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: hooks/security_reminder_hook.py plugins/security-guidance/hooks/security_reminder_hook.py — FileTooLong — 1988 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1488 over it, 3.98× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 1679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1179 over it, 3.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: hooks/gitutil.py plugins/security-guidance/hooks/gitutil.py — FileTooLong — 1349 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 849 over it, 2.70× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/plant_setup.py plugins/claude-for-manufacturing/shared/scripts/plant_setup.py — FileTooLong — 1004 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 504 over it, 2.01× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/patch_artifacts.py plugins/claude-security/scripts/patch_artifacts.py — FileTooLong — 971 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 471 over it, 1.94× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: hooks/diffstate.py plugins/security-guidance/hooks/diffstate.py — FileTooLong — 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/proof_pack.py plugins/code-modernization/scripts/proof_pack.py — FileTooLong — 814 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 314 over it, 1.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: hooks/register.ts plugins/code-modernization/hooks/register.ts — FileTooLong — 783 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: register (104-1296). The bar is 500 significant lines; this is 283 over it, 1.57× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: scripts/mine-transcripts.mjs plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs — FileTooLong — 758 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 258 over it, 1.52× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/render_report.py plugins/claude-security/scripts/render_report.py — FileTooLong — 715 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 215 over it, 1.43× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/render_short.py plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py — FileTooLong — 692 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 192 over it, 1.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 686 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 186 over it, 1.37× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/baseline_diff.py plugins/code-modernization/scripts/baseline_diff.py — FileTooLong — 650 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 150 over it, 1.30× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: reader/progress.ts plugins/code-modernization/hooks/reader/progress.ts — FileTooLong — 628 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 128 over it, 1.26× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: session-report/analyze-sessions.mjs plugins/session-report/skills/session-report/analyze-sessions.mjs — FileTooLong — 605 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 105 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/build_report.py plugins/code-modernization/scripts/build_report.py — FileTooLong — 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/telemetry.py plugins/code-modernization/scripts/telemetry.py — FileTooLong — 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: REDACTED REDACTED — FileTooLong — 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: workflows/extract-rules.js plugins/code-modernization/workflows/extract-rules.js — FileTooLong — 538 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 38 over it, 1.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D15 · Churn × Complexity Hotspots · Hotspot · ×19
  • Hotspot: plugins/security-guidance/hooks/security_reminder_hook.py plugins/security-guidance/hooks/security_reminder_hook.py:1765 — plugins/security-guidance/hooks/security_reminder_hook.py changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in security_reminder_hook.handle_commit_review_posttooluse at line 1765. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/security-guidance/hooks/security_reminder_hook.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:2204 — REDACTED changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in llm._agentic_review at line 2204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/hooks/register.ts plugins/code-modernization/hooks/register.ts:104 — plugins/code-modernization/hooks/register.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 243 in register.register at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/hooks/register.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:701 — REDACTED changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in ensure_agent_sdk.main at line 701. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/security-guidance/hooks/diffstate.py plugins/security-guidance/hooks/diffstate.py:1356 — plugins/security-guidance/hooks/diffstate.py changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in diffstate.compute_v2_review_set at line 1356. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/security-guidance/hooks/diffstate.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/hooks/reader/progress.ts plugins/code-modernization/hooks/reader/progress.ts:496 — plugins/code-modernization/hooks/reader/progress.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in progress.readSnapshot at line 496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/hooks/reader/progress.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/scripts/build_report.py plugins/code-modernization/scripts/build_report.py:383 — plugins/code-modernization/scripts/build_report.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in build_report.proof_module at line 383. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/scripts/build_report.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:335 — REDACTED changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in REDACTED.proofModule at line 335. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/workflows/extract-rules.js plugins/code-modernization/workflows/extract-rules.js:432 — plugins/code-modernization/workflows/extract-rules.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in extract-rules.verifyAndFold at line 432. 1 of those changes was a fix/bug commit, and the other 10 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/workflows/extract-rules.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/scripts/render_rules.py plugins/code-modernization/scripts/render_rules.py:84 — plugins/code-modernization/scripts/render_rules.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in render_rules.main at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/scripts/render_rules.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/security-guidance/hooks/extensibility.py plugins/security-guidance/hooks/extensibility.py:380 — plugins/security-guidance/hooks/extensibility.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in extensibility._validate_pattern at line 380. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/security-guidance/hooks/extensibility.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/security-guidance/hooks/reporesolve.py plugins/security-guidance/hooks/reporesolve.py:70 — plugins/security-guidance/hooks/reporesolve.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in reporesolve.dirs_from_command at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/security-guidance/hooks/reporesolve.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/claude-security/scripts/render_report.py plugins/claude-security/scripts/render_report.py:367 — plugins/claude-security/scripts/render_report.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in render_report.verification_summary at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/claude-security/scripts/render_report.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/claude-security/scripts/write_scan_meta.py plugins/claude-security/scripts/write_scan_meta.py:427 — plugins/claude-security/scripts/write_scan_meta.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in write_scan_meta.record at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/claude-security/scripts/write_scan_meta.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/scripts/proof_pack.py plugins/code-modernization/scripts/proof_pack.py:881 — plugins/code-modernization/scripts/proof_pack.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in proof_pack.render_md at line 881. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/scripts/proof_pack.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/hooks/xray/xray.ts plugins/code-modernization/hooks/xray/xray.ts:133 — plugins/code-modernization/hooks/xray/xray.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in xray.xrayOf at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/hooks/xray/xray.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/hooks/views/deck.tsx plugins/code-modernization/hooks/views/deck.tsx:87 — plugins/code-modernization/hooks/views/deck.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in deck.deckView at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/hooks/views/deck.tsx`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/code-modernization/scripts/compare.py plugins/code-modernization/scripts/compare.py:269 — plugins/code-modernization/scripts/compare.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in compare.judge at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/code-modernization/scripts/compare.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: plugins/claude-security/scripts/lib/finding.py plugins/claude-security/scripts/lib/finding.py:327 — plugins/claude-security/scripts/lib/finding.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in finding.relative_path at line 327. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 00:41:08 +00:00' --until='2026-11-14 00:41:08 +00:00' --full-history --no-merges -- plugins/claude-security/scripts/lib/finding.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
X3 · Exception handling · Swallowed exception (empty catch) · ×17
  • Swallowed exception (empty catch) plugins/session-report/skills/session-report/analyze-sessions.mjs:145 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/_base.py:151 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/_base.py:511 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/diffstate.py:1227 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:668 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:432 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:444 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:1026 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/reporesolve.py:285 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/security_reminder_hook.py:767 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/security_reminder_hook.py:783 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/security_reminder_hook.py:2242 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/security-guidance/hooks/session_state.py:110 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) plugins/code-modernization/hooks/reader/fs.ts:72 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:177 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:42 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) REDACTED:77 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
D30 · Dependency Vulnerabilities · Medium CVE · ×16
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
PF3 · Async & latency hygiene · Sync-over-async blocking · ×16
  • Sync-over-async blocking REDACTED:357 — `rmSync` in `callback to void` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:361 — `rmSync` in `callback to void` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:428 — `mkdirSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:429 — `writeFileSync` in `downloadAttachment` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:616 — `statSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking external_plugins/fakechat/server.ts:105 — `mkdirSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking external_plugins/fakechat/server.ts:109 — `statSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking external_plugins/fakechat/server.ts:113 — `copyFileSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking external_plugins/fakechat/server.ts:182 — `mkdirSync` in `callback to return` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking external_plugins/fakechat/server.ts:185 — `writeFileSync` in `callback to return` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:671 — `statSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:544 — `statSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:620 — `mkdirSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:621 — `writeFileSync` in `callback to mcp.setRequestHandler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:814 — `mkdirSync` in `callback to handleInbound` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
  • Sync-over-async blocking REDACTED:815 — `writeFileSync` in `callback to handleInbound` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
AC3 · Page structure · Page without a main landmark · ×4
  • Page without a main landmark plugins/code-modernization/assets/topology-viewer.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark plugins/session-report/skills/session-report/template.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark plugins/skill-creator/skills/skill-creator/assets/eval_review.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
  • Page without a main landmark plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:2 — No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D3 · God Classes · FunctionTooLong · ×4
  • FunctionTooLong: register.register plugins/code-modernization/hooks/register.ts:104 — FunctionTooLong — register runs 710 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 610 over it, 7.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: analyze-sessions.processFile plugins/session-report/skills/session-report/analyze-sessions.mjs:191 — FunctionTooLong — processFile runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: viewer.html.renderBenchmark plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:1114 — FunctionTooLong — renderBenchmark runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
  • FunctionTooLong: deck.deckView plugins/code-modernization/hooks/views/deck.tsx:87 — FunctionTooLong — deckView runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
R10 · Code Duplication · Duplicated block (8 lines × 2 locations) · ×4
  • Duplicated block (8 lines × 2 locations) REDACTED:283 — REDACTED:283 · REDACTED:280 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (8 lines × 2 locations) REDACTED:612 — REDACTED:612 · REDACTED:540 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (8 lines × 2 locations) REDACTED:732 — REDACTED:732 · REDACTED:667 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (8 lines × 2 locations) REDACTED:323 — REDACTED:323 · REDACTED:232 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block (6 lines × 2 locations) · ×4
  • Duplicated block (6 lines × 2 locations) plugins/code-modernization/workflows/extract-rules.js:15 — plugins/code-modernization/workflows/extract-rules.js:15 · plugins/code-modernization/workflows/harden-scan.js:9 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (6 lines × 2 locations) plugins/code-modernization/workflows/uplift-deltas.js:9 — plugins/code-modernization/workflows/uplift-deltas.js:9 · plugins/code-modernization/workflows/uplift-migrate.js:12 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (6 lines × 2 locations) plugins/theme-examples/hooks/scenes/braille-stars.ts:39 — plugins/theme-examples/hooks/scenes/braille-stars.ts:39 · plugins/theme-examples/hooks/scenes/halftone-dawn.ts:42 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
  • Duplicated block (6 lines × 2 locations) plugins/theme-examples/hooks/scenes/koi-mosaic.ts:17 — plugins/theme-examples/hooks/scenes/koi-mosaic.ts:17 · plugins/theme-examples/hooks/scenes/teletext-clouds.ts:52 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.1 · ×3
  • Low contrast colour pair in CSS (2.1:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:83 — `.section-header` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.1:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:136 — `.output-file-header` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (2.1:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:221 — `.prev-feedback` sets color: #b0aea5 on background-color: #faf9f5 — 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC3 · Page structure · Empty <h3> heading · ×2
  • Empty <h3> heading plugins/project-artifact/skills/project-artifact/template.html:266 — An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
  • Empty <h3> heading plugins/project-artifact/skills/project-artifact/template.html:268 — An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (1.0 · ×2
  • Low contrast colour pair in CSS (1.0:1) REDACTED:28 — `input,button,select` sets color: #1a1f27 on background-color: #161b22 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (1.0:1) REDACTED:63 — `.copy` sets color: #1a1f27 on background-color: #161b22 — 1.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.1 · ×2
  • Low contrast colour pair in CSS (3.1:1) plugins/skill-creator/skills/skill-creator/assets/eval_review.html:19 — `.btn-export` sets color: white on background-color: #d97757 — 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
  • Low contrast colour pair in CSS (3.1:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:467 — `.done-btn.ready` sets color: white on background-color: #d97757 — 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×2
  • Edited copy of a member (11 corresponding lines) plugins/code-modernization/scripts/baseline_diff.py:111 — plugins/code-modernization/scripts/baseline_diff.py:111-125 | plugins/code-modernization/scripts/build_report.py:127-137 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) REDACTED:1915 — REDACTED:1915-1925 | plugins/security-guidance/hooks/security_reminder_hook.py:1285-1299 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×2
  • Duplicated block (8 lines × 2) plugins/security-guidance/hooks/security_reminder_hook.py:2286 — plugins/security-guidance/hooks/security_reminder_hook.py:2286-2293 | plugins/security-guidance/hooks/security_reminder_hook.py:3124-3131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:270 — plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:270-277 | plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:259-266 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:257` calls `add_argument` and `plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:269` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) plugins/security-guidance/hooks/security_reminder_hook.py:2281 — plugins/security-guidance/hooks/security_reminder_hook.py:2281-2286 | plugins/security-guidance/hooks/security_reminder_hook.py:2707-2712 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `plugins/security-guidance/hooks/security_reminder_hook.py:2281` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (6 lines × 2) plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:261 — plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:261-266 | plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:246-251 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:253` calls `add_argument` and `plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:268` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • Duplicated block (5 lines × 2) plugins/security-guidance/hooks/diffstate.py:1327 — plugins/security-guidance/hooks/diffstate.py:1327-1331 | plugins/security-guidance/hooks/gitutil.py:1419-1423 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `plugins/security-guidance/hooks/diffstate.py:1327` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) REDACTED:2565 — REDACTED:2565-2569 | plugins/security-guidance/hooks/review_api.py:309-317 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:2565` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
R10 · Code Duplication · Duplicated block (21 lines × 2 locations) · ×2
  • Duplicated block (21 lines × 2 locations) REDACTED:252 — REDACTED:252 · REDACTED:339 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (21 lines × 2 locations) REDACTED:464 — REDACTED:464 · REDACTED:415 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (13 lines × 2 locations) · ×2
  • Duplicated block (13 lines × 2 locations) REDACTED:623 — REDACTED:623 · REDACTED:550 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
  • Duplicated block (13 lines × 2 locations) plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178 — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178 · plugins/theme-examples/hooks/scenes/night-reef.ts:209 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (11 lines × 2 locations) · ×2
  • Duplicated block (11 lines × 2 locations) REDACTED:496 — REDACTED:496 · REDACTED:777 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2 locations) REDACTED:669 — REDACTED:669 · REDACTED:542 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (10 lines × 2 locations) · ×2
  • Duplicated block (10 lines × 2 locations) REDACTED:788 — REDACTED:788 · REDACTED:775 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (10 lines × 2 locations) plugins/session-report/skills/session-report/analyze-sessions.mjs:801 — plugins/session-report/skills/session-report/analyze-sessions.mjs:801 · plugins/session-report/skills/session-report/analyze-sessions.mjs:825 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (7 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (7 matched lines × 2 locations) plugins/theme-examples/hooks/scenes/koi-mosaic.ts:41 — plugins/theme-examples/hooks/scenes/koi-mosaic.ts:41 · plugins/theme-examples/hooks/scenes/koi-mosaic.ts:237 — the two spans are one implementation copied and then locally edited — 75 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (7 matched lines × 2 locations) plugins/theme-examples/hooks/scenes/paper-garden.ts:197 — plugins/theme-examples/hooks/scenes/paper-garden.ts:197 · plugins/theme-examples/hooks/scenes/paper-garden.ts:225 — the two spans are one implementation copied and then locally edited — 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block with local edits (6 matched lines × 2 locations) · ×2
  • Duplicated block with local edits (6 matched lines × 2 locations) REDACTED:121 — REDACTED:121 · REDACTED:150 — the two spans are one implementation copied and then locally edited — 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
  • Duplicated block with local edits (6 matched lines × 2 locations) plugins/code-modernization/hooks/views/deck.tsx:174 — plugins/code-modernization/hooks/views/deck.tsx:174 · plugins/code-modernization/hooks/views/deck.tsx:236 — the two spans are one implementation copied and then locally edited — 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (5 lines × 2 locations) · ×2
  • Duplicated block (5 lines × 2 locations) plugins/code-modernization/workflows/harden-scan.js:282 — plugins/code-modernization/workflows/harden-scan.js:282 · plugins/code-modernization/workflows/uplift-deltas.js:212 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
  • Duplicated block (5 lines × 2 locations) plugins/theme-examples/hooks/scenes/honu-lagoon.ts:37 — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:37 · plugins/theme-examples/hooks/scenes/paper-garden.ts:92 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
AC1 · Text alternatives · <canvas> without a text alternative · ×1
  • <canvas> without a text alternative plugins/code-modernization/assets/topology-viewer.html:73 — A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
AC3 · Page structure · Empty <h2> heading · ×1
  • Empty <h2> heading plugins/project-artifact/skills/project-artifact/template.html:233 — An empty heading appears in the document outline announced with no text. Give the heading text, or remove it if it's decorative.
AC3 · Page structure · Heading level jumps from h2 to h4 · ×1
  • Heading level jumps from h2 to h4 plugins/project-artifact/skills/project-artifact/template.html:258 — Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (1.1 · ×1
  • Low contrast colour pair in CSS (1.1:1) REDACTED:18 — `body` sets color: #1a1f27 on background-color: #0e1217 — 1.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (1.2 · ×1
  • Low contrast colour pair in CSS (1.2:1) REDACTED:58 — `.mm` sets color: #e6e9ee on background-color: #fff — 1.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.4 · ×1
  • Low contrast colour pair in CSS (4.4:1) plugins/code-modernization/assets/topology-viewer.html:66 — `#hint` sets color: #8a8a8a on background-color: #252526 — 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.2 · ×1
  • Low contrast colour pair in CSS (2.2:1) plugins/session-report/skills/session-report/template.html:195 — `th` sets color: rgb(80,80,80) on background-color: #1a1918 — 2.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.9 · ×1
  • Low contrast colour pair in CSS (2.9:1) plugins/skill-creator/skills/skill-creator/assets/eval_review.html:17 — `.btn-add` sets color: white on background-color: #6a9bcc — 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×1
  • Animation without a prefers-reduced-motion guard plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:275 — `.grades-toggle .arrow` moves (`transition: transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.0 · ×1
  • Low contrast colour pair in CSS (3.0:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:197 — `.output-file-content .download-link` sets color: #d97757 on background-color: #faf9f5 — 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.2 · ×1
  • Low contrast colour pair in CSS (3.2:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:302 — `.grade-pass` sets color: #788c5d on background-color: #eef2e8 — 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (4.0 · ×1
  • Low contrast colour pair in CSS (4.0:1) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:303 — `.grade-fail` sets color: #c44 on background-color: #fceaea — 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
D1 · Cyclomatic Complexity · register.register (cyclomatic 243) · ×1
  • register.register (cyclomatic 243) plugins/code-modernization/hooks/register.ts:104 — register.register has cyclomatic complexity 243 (threshold 15). Most of this is not in the body itself: 1 of the 243 points is its own statement and the rest belongs to 43 function items inside it that branch (a function literal at line 1142, a function literal at line 837, refresh, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · Pulse.one_day (cyclomatic 131) · ×1
  • Pulse.one_day (cyclomatic 131) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1190 — Pulse.one_day has cyclomatic complexity 131 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · progress.readSnapshot (cyclomatic 124) · ×1
  • progress.readSnapshot (cyclomatic 124) plugins/code-modernization/hooks/reader/progress.ts:496 — progress.readSnapshot has cyclomatic complexity 124 (threshold 15). Of this number, 116 points are the body's own statements and 8 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze-sessions.processFile (cyclomatic 95) · ×1
  • analyze-sessions.processFile (cyclomatic 95) plugins/session-report/skills/session-report/analyze-sessions.mjs:191 — analyze-sessions.processFile has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.handle_commit_review_posttooluse (cyclomatic 93) · ×1
  • security_reminder_hook.handle_commit_review_posttooluse (cyclomatic 93) plugins/security-guidance/hooks/security_reminder_hook.py:1765 — security_reminder_hook.handle_commit_review_posttooluse has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.handle_stop_hook (cyclomatic 91) · ×1
  • security_reminder_hook.handle_stop_hook (cyclomatic 91) plugins/security-guidance/hooks/security_reminder_hook.py:2751 — security_reminder_hook.handle_stop_hook has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · viewer.html.renderBenchmark (cyclomatic 79) · ×1
  • viewer.html.renderBenchmark (cyclomatic 79) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:1114 — viewer.html.renderBenchmark has cyclomatic complexity 79 (threshold 15). Of this number, 66 points are the body's own statements and 13 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.handle_push_sweep_posttooluse (cyclomatic 73) · ×1
  • security_reminder_hook.handle_push_sweep_posttooluse (cyclomatic 73) plugins/security-guidance/hooks/security_reminder_hook.py:2336 — security_reminder_hook.handle_push_sweep_posttooluse has cyclomatic complexity 73 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · build_report.proof_module (cyclomatic 69) · ×1
  • build_report.proof_module (cyclomatic 69) plugins/code-modernization/scripts/build_report.py:383 — build_report.proof_module has cyclomatic complexity 69 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · ensure_agent_sdk.main (cyclomatic 69) · ×1
  • ensure_agent_sdk.main (cyclomatic 69) REDACTED:701 — ensure_agent_sdk.main has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.freshness (cyclomatic 60) · ×1
  • Pulse.freshness (cyclomatic 60) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:736 — Pulse.freshness has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.rollup (cyclomatic 60) · ×1
  • Pulse.rollup (cyclomatic 60) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1719 — Pulse.rollup has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.output (cyclomatic 58) · ×1
  • Pulse.output (cyclomatic 58) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:856 — Pulse.output has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · REDACTED.proofModule (cyclomatic 56) · ×1
  • REDACTED.proofModule (cyclomatic 56) REDACTED:335 — REDACTED.proofModule has cyclomatic complexity 56 (threshold 15). Of this number, 48 points are the body's own statements and 8 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · topology-viewer.html.draw (cyclomatic 55) · ×1
  • topology-viewer.html.draw (cyclomatic 55) plugins/code-modernization/assets/topology-viewer.html:223 — topology-viewer.html.draw has cyclomatic complexity 55 (threshold 15). Of this number, 50 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.classes (cyclomatic 53) · ×1
  • Pulse.classes (cyclomatic 53) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1410 — Pulse.classes has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.render_md (cyclomatic 53) · ×1
  • proof_pack.render_md (cyclomatic 53) plugins/code-modernization/scripts/proof_pack.py:881 — proof_pack.render_md has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · reporesolve.dirs_from_command (cyclomatic 50) · ×1
  • reporesolve.dirs_from_command (cyclomatic 50) plugins/security-guidance/hooks/reporesolve.py:70 — reporesolve.dirs_from_command has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.emit (cyclomatic 49) · ×1
  • Pulse.emit (cyclomatic 49) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:2004 — Pulse.emit has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Page.check (cyclomatic 49) · ×1
  • Page.check (cyclomatic 49) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:591 — Page.check has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.main (cyclomatic 49) · ×1
  • security_reminder_hook.main (cyclomatic 49) plugins/security-guidance/hooks/security_reminder_hook.py:3284 — security_reminder_hook.main has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · baseline_diff.compare (cyclomatic 46) · ×1
  • baseline_diff.compare (cyclomatic 46) plugins/code-modernization/scripts/baseline_diff.py:633 — baseline_diff.compare has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · render_rules.main (cyclomatic 46) · ×1
  • render_rules.main (cyclomatic 46) plugins/code-modernization/scripts/render_rules.py:84 — render_rules.main has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · build_report.equivalence_view (cyclomatic 45) · ×1
  • build_report.equivalence_view (cyclomatic 45) plugins/code-modernization/scripts/build_report.py:272 — build_report.equivalence_view has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · xray.xrayOf (cyclomatic 45) · ×1
  • xray.xrayOf (cyclomatic 45) plugins/code-modernization/hooks/xray/xray.ts:133 — xray.xrayOf has cyclomatic complexity 45 (threshold 15). Of this number, 42 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · llm._agentic_review (cyclomatic 44) · ×1
  • llm._agentic_review (cyclomatic 44) REDACTED:2204 — llm._agentic_review has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · trace_rules.trace (cyclomatic 43) · ×1
  • trace_rules.trace (cyclomatic 43) plugins/code-modernization/scripts/trace_rules.py:327 — trace_rules.trace has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · pane.planOf (cyclomatic 42) · ×1
  • pane.planOf (cyclomatic 42) plugins/code-modernization/hooks/views/pane.tsx:542 — pane.planOf has cyclomatic complexity 42 (threshold 15). Of this number, 24 points are the body's own statements and 18 belong to 11 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · build_report.build (cyclomatic 39) · ×1
  • build_report.build (cyclomatic 39) plugins/code-modernization/scripts/build_report.py:562 — build_report.build has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.exceptions (cyclomatic 38) · ×1
  • Pulse.exceptions (cyclomatic 38) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1553 — Pulse.exceptions has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · pulse_compute.parse_profile (cyclomatic 38) · ×1
  • pulse_compute.parse_profile (cyclomatic 38) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:333 — pulse_compute.parse_profile has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · deck.deckView (cyclomatic 38) · ×1
  • deck.deckView (cyclomatic 38) plugins/code-modernization/hooks/views/deck.tsx:87 — deck.deckView has cyclomatic complexity 38 (threshold 15). Of this number, 34 points are the body's own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · baseline_diff.parse_baseline (cyclomatic 37) · ×1
  • baseline_diff.parse_baseline (cyclomatic 37) plugins/code-modernization/scripts/baseline_diff.py:135 — baseline_diff.parse_baseline has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · write_scan_meta.record (cyclomatic 36) · ×1
  • write_scan_meta.record (cyclomatic 36) plugins/claude-security/scripts/write_scan_meta.py:427 — write_scan_meta.record has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · REDACTED.inline (cyclomatic 36) · ×1
  • REDACTED.inline (cyclomatic 36) REDACTED:120 — REDACTED.inline has cyclomatic complexity 36 (threshold 15). Of this number, 34 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · discover_bumps.main (cyclomatic 34) · ×1
  • discover_bumps.main (cyclomatic 34) .github/scripts/discover_bumps.py:87 — discover_bumps.main has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · REDACTED.renderGlance (cyclomatic 34) · ×1
  • REDACTED.renderGlance (cyclomatic 34) REDACTED:259 — REDACTED.renderGlance has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · plant_setup._selftest (cyclomatic 33) · ×1
  • plant_setup._selftest (cyclomatic 33) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:1184 — plant_setup._selftest has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · REDACTED.partEquiv (cyclomatic 33) · ×1
  • REDACTED.partEquiv (cyclomatic 33) REDACTED:296 — REDACTED.partEquiv has cyclomatic complexity 33 (threshold 15). Of this number, 16 points are the body's own statements and 17 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · run_eval.run_single_query (cyclomatic 32) · ×1
  • run_eval.run_single_query (cyclomatic 32) plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:35 — run_eval.run_single_query has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.mcp.setRequestHandler() (cyclomatic 32) · ×1
  • server.mcp.setRequestHandler() (cyclomatic 32) REDACTED:528 — server.mcp.setRequestHandler() has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · brief.parseBrief (cyclomatic 32) · ×1
  • brief.parseBrief (cyclomatic 32) plugins/code-modernization/hooks/reader/brief.ts:71 — brief.parseBrief has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.decisions (cyclomatic 31) · ×1
  • Pulse.decisions (cyclomatic 31) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1911 — Pulse.decisions has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.handleInbound (cyclomatic 31) · ×1
  • server.handleInbound (cyclomatic 31) REDACTED:778 — server.handleInbound has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · REDACTED.md (cyclomatic 31) · ×1
  • REDACTED.md (cyclomatic 31) REDACTED:204 — REDACTED.md has cyclomatic complexity 31 (threshold 15). Of this number, 29 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.brief_items (cyclomatic 30) · ×1
  • proof_pack.brief_items (cyclomatic 30) plugins/code-modernization/scripts/proof_pack.py:339 — proof_pack.brief_items has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · config_loader.extract_frontmatter (cyclomatic 30) · ×1
  • config_loader.extract_frontmatter (cyclomatic 30) plugins/hookify/core/config_loader.py:87 — config_loader.extract_frontmatter has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · llm._call_claude (cyclomatic 30) · ×1
  • llm._call_claude (cyclomatic 30) REDACTED:1253 — llm._call_claude has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · uplift_checks.parse_deltas (cyclomatic 28) · ×1
  • uplift_checks.parse_deltas (cyclomatic 28) plugins/code-modernization/scripts/uplift_checks.py:222 — uplift_checks.parse_deltas has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · run_loop.run_loop (cyclomatic 28) · ×1
  • run_loop.run_loop (cyclomatic 28) plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:47 — run_loop.run_loop has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · verification.parseVerification (cyclomatic 28) · ×1
  • verification.parseVerification (cyclomatic 28) plugins/code-modernization/hooks/reader/verification.ts:73 — verification.parseVerification has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.context (cyclomatic 27) · ×1
  • Pulse.context (cyclomatic 27) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:626 — Pulse.context has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · render_report.verification_summary (cyclomatic 27) · ×1
  • render_report.verification_summary (cyclomatic 27) plugins/claude-security/scripts/render_report.py:367 — render_report.verification_summary has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · render_report.scan_of (cyclomatic 27) · ×1
  • render_report.scan_of (cyclomatic 27) plugins/claude-security/scripts/render_report.py:510 — render_report.scan_of has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · render_report.render (cyclomatic 27) · ×1
  • render_report.render (cyclomatic 27) plugins/claude-security/scripts/render_report.py:776 — render_report.render has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · baseline_diff.read_baseline_evidence (cyclomatic 27) · ×1
  • baseline_diff.read_baseline_evidence (cyclomatic 27) plugins/code-modernization/scripts/baseline_diff.py:525 — baseline_diff.read_baseline_evidence has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.mcp.setRequestHandler() (cyclomatic 27) · ×1
  • server.mcp.setRequestHandler() (cyclomatic 27) REDACTED:601 — server.mcp.setRequestHandler() has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · pane.modules (cyclomatic 27) · ×1
  • pane.modules (cyclomatic 27) plugins/code-modernization/hooks/views/pane.tsx:245 — pane.modules has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 267). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · make_shards.from_tree (cyclomatic 26) · ×1
  • make_shards.from_tree (cyclomatic 26) plugins/code-modernization/scripts/make_shards.py:160 — make_shards.from_tree has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · estate.paint (cyclomatic 26) · ×1
  • estate.paint (cyclomatic 26) plugins/code-modernization/hooks/map/estate.ts:189 — estate.paint has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Page.output_section (cyclomatic 25) · ×1
  • Page.output_section (cyclomatic 25) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:313 — Page.output_section has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.evaluate (cyclomatic 25) · ×1
  • proof_pack.evaluate (cyclomatic 25) plugins/code-modernization/scripts/proof_pack.py:788 — proof_pack.evaluate has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RuleEngine._extract_field (cyclomatic 25) · ×1
  • RuleEngine._extract_field (cyclomatic 25) plugins/hookify/core/rule_engine.py:182 — RuleEngine._extract_field has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ensure_agent_sdk._pip_err_from_stderr (cyclomatic 25) · ×1
  • ensure_agent_sdk._pip_err_from_stderr (cyclomatic 25) REDACTED:411 — ensure_agent_sdk._pip_err_from_stderr has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 25) · ×1
  • (anonymous) (cyclomatic 25) plugins/code-modernization/workflows/extract-rules.js:671 — (anonymous) has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body's own statements and 3 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · plant_setup.work_view (cyclomatic 24) · ×1
  • plant_setup.work_view (cyclomatic 24) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:648 — plant_setup.work_view has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · plant_setup._work_selftest (cyclomatic 24) · ×1
  • plant_setup._work_selftest (cyclomatic 24) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:1039 — plant_setup._work_selftest has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Page.scrap_section (cyclomatic 24) · ×1
  • Page.scrap_section (cyclomatic 24) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:471 — Page.scrap_section has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · baseline_diff.assess_baseline (cyclomatic 24) · ×1
  • baseline_diff.assess_baseline (cyclomatic 24) plugins/code-modernization/scripts/baseline_diff.py:587 — baseline_diff.assess_baseline has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · proof_pack.check_fresh (cyclomatic 24) · ×1
  • proof_pack.check_fresh (cyclomatic 24) plugins/code-modernization/scripts/proof_pack.py:671 — proof_pack.check_fresh has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · server.mcp.setRequestHandler() (cyclomatic 24) · ×1
  • server.mcp.setRequestHandler() (cyclomatic 24) REDACTED:656 — server.mcp.setRequestHandler() has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · rules.cardOf (cyclomatic 24) · ×1
  • rules.cardOf (cyclomatic 24) REDACTED:194 — rules.cardOf has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Pulse.fold_diagnoses (cyclomatic 23) · ×1
  • Pulse.fold_diagnoses (cyclomatic 23) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1638 — Pulse.fold_diagnoses has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · trace_rules.parse_rules (cyclomatic 23) · ×1
  • trace_rules.parse_rules (cyclomatic 23) plugins/code-modernization/scripts/trace_rules.py:167 — trace_rules.parse_rules has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ledger.check (cyclomatic 23) · ×1
  • ledger.check (cyclomatic 23) plugins/math-proof/skills/siege/scripts/ledger.py:483 — ledger.check has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.check_patterns (cyclomatic 23) · ×1
  • security_reminder_hook.check_patterns (cyclomatic 23) plugins/security-guidance/hooks/security_reminder_hook.py:735 — security_reminder_hook.check_patterns has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · improve_description.improve_description (cyclomatic 23) · ×1
  • improve_description.improve_description (cyclomatic 23) plugins/skill-creator/skills/skill-creator/scripts/improve_description.py:50 — improve_description.improve_description has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · quick_validate.validate_skill (cyclomatic 23) · ×1
  • quick_validate.validate_skill (cyclomatic 23) plugins/skill-creator/skills/skill-creator/scripts/quick_validate.py:12 — quick_validate.validate_skill has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · uplift.parseBaseline (cyclomatic 23) · ×1
  • uplift.parseBaseline (cyclomatic 23) plugins/code-modernization/hooks/reader/uplift.ts:52 — uplift.parseBaseline has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze-sessions.handleUser (cyclomatic 23) · ×1
  • analyze-sessions.handleUser (cyclomatic 23) plugins/session-report/skills/session-report/analyze-sessions.mjs:420 — analyze-sessions.handleUser has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.source_check (cyclomatic 22) · ×1
  • proof_pack.source_check (cyclomatic 22) plugins/code-modernization/scripts/proof_pack.py:291 — proof_pack.source_check has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _base.interp_reparse_metric (cyclomatic 22) · ×1
  • _base.interp_reparse_metric (cyclomatic 22) plugins/security-guidance/hooks/_base.py:467 — _base.interp_reparse_metric has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · llm.analyze_code_security (cyclomatic 22) · ×1
  • llm.analyze_code_security (cyclomatic 22) REDACTED:1753 — llm.analyze_code_security has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · generate_report.generate_html (cyclomatic 22) · ×1
  • generate_report.generate_html (cyclomatic 22) plugins/skill-creator/skills/skill-creator/scripts/generate_report.py:16 — generate_report.generate_html has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · progress.nextOfTransform (cyclomatic 22) · ×1
  • progress.nextOfTransform (cyclomatic 22) plugins/code-modernization/hooks/reader/progress.ts:273 — progress.nextOfTransform has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · raster.codePointOf (cyclomatic 22) · ×1
  • raster.codePointOf (cyclomatic 22) plugins/code-modernization/hooks/map/raster.ts:36 — raster.codePointOf has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · Ladder._match (cyclomatic 21) · ×1
  • Ladder._match (cyclomatic 21) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:556 — Ladder._match has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.rank_events (cyclomatic 21) · ×1
  • Pulse.rank_events (cyclomatic 21) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1055 — Pulse.rank_events has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · render_report.notifications_of (cyclomatic 21) · ×1
  • render_report.notifications_of (cyclomatic 21) plugins/claude-security/scripts/render_report.py:680 — render_report.notifications_of has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compare.judge (cyclomatic 21) · ×1
  • compare.judge (cyclomatic 21) plugins/code-modernization/scripts/compare.py:269 — compare.judge has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · make_shards.main (cyclomatic 21) · ×1
  • make_shards.main (cyclomatic 21) plugins/code-modernization/scripts/make_shards.py:208 — make_shards.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · aggregate_benchmark.load_run_results (cyclomatic 21) · ×1
  • aggregate_benchmark.load_run_results (cyclomatic 21) plugins/skill-creator/skills/skill-creator/scripts/aggregate_benchmark.py:67 — aggregate_benchmark.load_run_results has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · mine-transcripts.renderHTML (cyclomatic 21) · ×1
  • mine-transcripts.renderHTML (cyclomatic 21) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:1204 — mine-transcripts.renderHTML has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Pulse.days (cyclomatic 20) · ×1
  • Pulse.days (cyclomatic 20) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1147 — Pulse.days has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · pulse_compute.load_exports (cyclomatic 20) · ×1
  • pulse_compute.load_exports (cyclomatic 20) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:265 — pulse_compute.load_exports has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Page.freshness (cyclomatic 20) · ×1
  • Page.freshness (cyclomatic 20) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:130 — Page.freshness has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · patch_artifacts.section_stat (cyclomatic 20) · ×1
  • patch_artifacts.section_stat (cyclomatic 20) plugins/claude-security/scripts/patch_artifacts.py:470 — patch_artifacts.section_stat has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.check_tests_state (cyclomatic 20) · ×1
  • proof_pack.check_tests_state (cyclomatic 20) plugins/code-modernization/scripts/proof_pack.py:463 — proof_pack.check_tests_state has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · proof_pack.check_rules (cyclomatic 20) · ×1
  • proof_pack.check_rules (cyclomatic 20) plugins/code-modernization/scripts/proof_pack.py:485 — proof_pack.check_rules has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · trace_rules.render (cyclomatic 20) · ×1
  • trace_rules.render (cyclomatic 20) plugins/code-modernization/scripts/trace_rules.py:448 — trace_rules.render has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · trace_rules.main (cyclomatic 20) · ×1
  • trace_rules.main (cyclomatic 20) plugins/code-modernization/scripts/trace_rules.py:473 — trace_rules.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ledger.main (cyclomatic 20) · ×1
  • ledger.main (cyclomatic 20) plugins/math-proof/skills/siege/scripts/ledger.py:600 — ledger.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · extensibility._validate_pattern (cyclomatic 20) · ×1
  • extensibility._validate_pattern (cyclomatic 20) plugins/security-guidance/hooks/extensibility.py:380 — extensibility._validate_pattern has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · generate_review.build_run (cyclomatic 20) · ×1
  • generate_review.build_run (cyclomatic 20) plugins/skill-creator/skills/skill-creator/eval-viewer/generate_review.py:85 — generate_review.build_run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · topology-viewer.html.renderSidebar (cyclomatic 20) · ×1
  • topology-viewer.html.renderSidebar (cyclomatic 20) plugins/code-modernization/assets/topology-viewer.html:392 — topology-viewer.html.renderSidebar has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · pane.session (cyclomatic 20) · ×1
  • pane.session (cyclomatic 20) plugins/code-modernization/hooks/views/pane.tsx:315 — pane.session has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze-sessions.main (cyclomatic 20) · ×1
  • analyze-sessions.main (cyclomatic 20) plugins/session-report/skills/session-report/analyze-sessions.mjs:535 — analyze-sessions.main has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.normalize (cyclomatic 19) · ×1
  • Pulse.normalize (cyclomatic 19) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:682 — Pulse.normalize has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · compare.within_tolerance (cyclomatic 19) · ×1
  • compare.within_tolerance (cyclomatic 19) plugins/code-modernization/scripts/compare.py:138 — compare.within_tolerance has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.suite_evidence (cyclomatic 19) · ×1
  • proof_pack.suite_evidence (cyclomatic 19) plugins/code-modernization/scripts/proof_pack.py:216 — proof_pack.suite_evidence has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · telemetry.snapshot (cyclomatic 19) · ×1
  • telemetry.snapshot (cyclomatic 19) plugins/code-modernization/scripts/telemetry.py:308 — telemetry.snapshot has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · uplift_checks.main (cyclomatic 19) · ×1
  • uplift_checks.main (cyclomatic 19) plugins/code-modernization/scripts/uplift_checks.py:316 — uplift_checks.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ledger.answers (cyclomatic 19) · ×1
  • ledger.answers (cyclomatic 19) plugins/math-proof/skills/siege/scripts/ledger.py:416 — ledger.answers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · diffstate.compute_v2_review_set (cyclomatic 19) · ×1
  • diffstate.compute_v2_review_set (cyclomatic 19) plugins/security-guidance/hooks/diffstate.py:1356 — diffstate.compute_v2_review_set has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · llm._call_claude_dual_or (cyclomatic 19) · ×1
  • llm._call_claude_dual_or (cyclomatic 19) REDACTED:1427 — llm._call_claude_dual_or has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · reporesolve.iter_git_repos (cyclomatic 19) · ×1
  • reporesolve.iter_git_repos (cyclomatic 19) plugins/security-guidance/hooks/reporesolve.py:191 — reporesolve.iter_git_repos has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · security_reminder_hook.emit_metrics (cyclomatic 19) · ×1
  • security_reminder_hook.emit_metrics (cyclomatic 19) plugins/security-guidance/hooks/security_reminder_hook.py:354 — security_reminder_hook.emit_metrics has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · REDACTED.partNodes (cyclomatic 19) · ×1
  • REDACTED.partNodes (cyclomatic 19) REDACTED:399 — REDACTED.partNodes has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · topology.parseTopology (cyclomatic 19) · ×1
  • topology.parseTopology (cyclomatic 19) plugins/code-modernization/hooks/reader/topology.ts:98 — topology.parseTopology has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · modernized.readTestsAt (cyclomatic 19) · ×1
  • modernized.readTestsAt (cyclomatic 19) REDACTED:157 — modernized.readTestsAt has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · plant_setup.details_html (cyclomatic 18) · ×1
  • plant_setup.details_html (cyclomatic 18) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:297 — plant_setup.details_html has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · plant_setup.prune (cyclomatic 18) · ×1
  • plant_setup.prune (cyclomatic 18) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:864 — plant_setup.prune has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pulse.downtime (cyclomatic 18) · ×1
  • Pulse.downtime (cyclomatic 18) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:995 — Pulse.downtime has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · finding.relative_path (cyclomatic 18) · ×1
  • finding.relative_path (cyclomatic 18) plugins/claude-security/scripts/lib/finding.py:327 — finding.relative_path has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · baseline_diff.render (cyclomatic 18) · ×1
  • baseline_diff.render (cyclomatic 18) plugins/code-modernization/scripts/baseline_diff.py:715 — baseline_diff.render has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · proof_pack.baseline_state (cyclomatic 18) · ×1
  • proof_pack.baseline_state (cyclomatic 18) plugins/code-modernization/scripts/proof_pack.py:531 — proof_pack.baseline_state has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · proof_pack.check_same (cyclomatic 18) · ×1
  • proof_pack.check_same (cyclomatic 18) plugins/code-modernization/scripts/proof_pack.py:628 — proof_pack.check_same has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ledger.early_conclude_ok (cyclomatic 18) · ×1
  • ledger.early_conclude_ok (cyclomatic 18) plugins/math-proof/skills/siege/scripts/ledger.py:167 — ledger.early_conclude_ok has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _base._record_usage (cyclomatic 18) · ×1
  • _base._record_usage (cyclomatic 18) plugins/security-guidance/hooks/_base.py:289 — _base._record_usage has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · gitutil.filter_preexisting_from_diff (cyclomatic 18) · ×1
  • gitutil.filter_preexisting_from_diff (cyclomatic 18) plugins/security-guidance/hooks/gitutil.py:2203 — gitutil.filter_preexisting_from_diff has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.gate (cyclomatic 18) · ×1
  • server.gate (cyclomatic 18) REDACTED:236 — server.gate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · REDACTED.draw (cyclomatic 18) · ×1
  • REDACTED.draw (cyclomatic 18) REDACTED:467 — REDACTED.draw has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 481, 478, 492). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · rules.parseRules (cyclomatic 18) · ×1
  • rules.parseRules (cyclomatic 18) REDACTED:340 — rules.parseRules has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 362, close). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D1 · Cyclomatic Complexity · ledger.parseLedger (cyclomatic 18) · ×1
  • ledger.parseLedger (cyclomatic 18) plugins/code-modernization/hooks/review/ledger.ts:24 — ledger.parseLedger has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · write_scan_meta.tree_extent (cyclomatic 17) · ×1
  • write_scan_meta.tree_extent (cyclomatic 17) plugins/claude-security/scripts/write_scan_meta.py:120 — write_scan_meta.tree_extent has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.not_proven (cyclomatic 17) · ×1
  • proof_pack.not_proven (cyclomatic 17) plugins/code-modernization/scripts/proof_pack.py:763 — proof_pack.not_proven has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · diffstate._diff_review_started (cyclomatic 17) · ×1
  • diffstate._diff_review_started (cyclomatic 17) plugins/security-guidance/hooks/diffstate.py:964 — diffstate._diff_review_started has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.handleInbound (cyclomatic 17) · ×1
  • server.handleInbound (cyclomatic 17) REDACTED:907 — server.handleInbound has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · extract-rules.verifyAndFold (cyclomatic 17) · ×1
  • extract-rules.verifyAndFold (cyclomatic 17) plugins/code-modernization/workflows/extract-rules.js:432 — extract-rules.verifyAndFold has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 474, 451). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · hooks.metrics (cyclomatic 16) · ×1
  • hooks.metrics (cyclomatic 16) plugins/claude-security/hooks/hooks.py:270 — hooks.metrics has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · hooks.tip (cyclomatic 16) · ×1
  • hooks.tip (cyclomatic 16) plugins/claude-security/hooks/hooks.py:430 — hooks.tip has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · save_result.checked (cyclomatic 16) · ×1
  • save_result.checked (cyclomatic 16) plugins/claude-security/scripts/save_result.py:221 — save_result.checked has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · write_scan_meta.capture_revision (cyclomatic 16) · ×1
  • write_scan_meta.capture_revision (cyclomatic 16) plugins/claude-security/scripts/write_scan_meta.py:292 — write_scan_meta.capture_revision has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · baseline_diff.result_files (cyclomatic 16) · ×1
  • baseline_diff.result_files (cyclomatic 16) plugins/code-modernization/scripts/baseline_diff.py:258 — baseline_diff.result_files has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · baseline_diff.read_results (cyclomatic 16) · ×1
  • baseline_diff.read_results (cyclomatic 16) plugins/code-modernization/scripts/baseline_diff.py:295 — baseline_diff.read_results has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · baseline_diff.parse_results_json (cyclomatic 16) · ×1
  • baseline_diff.parse_results_json (cyclomatic 16) plugins/code-modernization/scripts/baseline_diff.py:501 — baseline_diff.parse_results_json has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · build_report.proof_view (cyclomatic 16) · ×1
  • build_report.proof_view (cyclomatic 16) plugins/code-modernization/scripts/build_report.py:459 — build_report.proof_view has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · compare.self_check (cyclomatic 16) · ×1
  • compare.self_check (cyclomatic 16) plugins/code-modernization/scripts/compare.py:338 — compare.self_check has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.check_canary (cyclomatic 16) · ×1
  • proof_pack.check_canary (cyclomatic 16) plugins/code-modernization/scripts/proof_pack.py:728 — proof_pack.check_canary has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · proof_pack.build (cyclomatic 16) · ×1
  • proof_pack.build (cyclomatic 16) plugins/code-modernization/scripts/proof_pack.py:836 — proof_pack.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · diffstate.turn_commits_code (cyclomatic 16) · ×1
  • diffstate.turn_commits_code (cyclomatic 16) plugins/security-guidance/hooks/diffstate.py:822 — diffstate.turn_commits_code has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · llm._net_error_class (cyclomatic 16) · ×1
  • llm._net_error_class (cyclomatic 16) REDACTED:378 — llm._net_error_class has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · reporesolve.repos_from_paths (cyclomatic 16) · ×1
  • reporesolve.repos_from_paths (cyclomatic 16) plugins/security-guidance/hooks/reporesolve.py:244 — reporesolve.repos_from_paths has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · server.gate (cyclomatic 16) · ×1
  • server.gate (cyclomatic 16) REDACTED:236 — server.gate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · discover.walk (cyclomatic 16) · ×1
  • discover.walk (cyclomatic 16) plugins/code-modernization/hooks/reader/discover.ts:59 — discover.walk has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 88, 86). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · discover.directoryUnits (cyclomatic 16) · ×1
  • discover.directoryUnits (cyclomatic 16) plugins/code-modernization/hooks/reader/discover.ts:235 — discover.directoryUnits has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · progress.oneLineOf (cyclomatic 16) · ×1
  • progress.oneLineOf (cyclomatic 16) plugins/code-modernization/hooks/reader/progress.ts:952 — progress.oneLineOf has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · xray.upliftXray (cyclomatic 16) · ×1
  • xray.upliftXray (cyclomatic 16) plugins/code-modernization/hooks/xray/xray.ts:91 — xray.upliftXray has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · mine-transcripts.gitCommitsWithOurWork (cyclomatic 16) · ×1
  • mine-transcripts.gitCommitsWithOurWork (cyclomatic 16) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:770 — mine-transcripts.gitCommitsWithOurWork has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · analyze-sessions.printText (cyclomatic 16) · ×1
  • analyze-sessions.printText (cyclomatic 16) plugins/session-report/skills/session-report/analyze-sessions.mjs:751 — analyze-sessions.printText has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · (anonymous) (cyclomatic 16) · ×1
  • (anonymous) (cyclomatic 16) plugins/code-modernization/workflows/extract-rules.js:154 — (anonymous) has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · analyze-sessions.processFile (cognitive 201) · ×1
  • analyze-sessions.processFile (cognitive 201) plugins/session-report/skills/session-report/analyze-sessions.mjs:191 — analyze-sessions.processFile has cognitive complexity 201 (threshold 15). Drivers by points: if/else 45 (146 pts), boolean chains 36, loops 6 (12 pts), ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 111). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · viewer.html.renderBenchmark (cognitive 181) · ×1
  • viewer.html.renderBenchmark (cognitive 181) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:1114 — viewer.html.renderBenchmark has cognitive complexity 181 (threshold 15). Drivers by points: if/else 23 (58 pts), loops 12 (48 pts), ternaries 11 (46 pts), boolean chains 29 (nesting depth added 106). Of this number, 169 points are the body's own statements and 12 belong to 7 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Pulse.one_day (cognitive 179) · ×1
  • Pulse.one_day (cognitive 179) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1190 — Pulse.one_day has cognitive complexity 179 (threshold 15). Drivers by points: if/else 47 (82 pts), boolean chains 42, ternaries 20 (38 pts), loops 13 (17 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · progress.readSnapshot (cognitive 165) · ×1
  • progress.readSnapshot (cognitive 165) plugins/code-modernization/hooks/reader/progress.ts:496 — progress.readSnapshot has cognitive complexity 165 (threshold 15). Drivers by points: ternaries 25 (54 pts), if/else 28 (48 pts), boolean chains 44, loops 9 (19 pts) (nesting depth added 59). Of this number, 159 points are the body's own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook.handle_commit_review_posttooluse (cognitive 129) · ×1
  • security_reminder_hook.handle_commit_review_posttooluse (cognitive 129) plugins/security-guidance/hooks/security_reminder_hook.py:1765 — security_reminder_hook.handle_commit_review_posttooluse has cognitive complexity 129 (threshold 15). Drivers by points: if/else 53 (72 pts), ternaries 20 (33 pts), boolean chains 18, error handling 2 (3 pts), loops 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook.handle_stop_hook (cognitive 123) · ×1
  • security_reminder_hook.handle_stop_hook (cognitive 123) plugins/security-guidance/hooks/security_reminder_hook.py:2751 — security_reminder_hook.handle_stop_hook has cognitive complexity 123 (threshold 15). Drivers by points: if/else 47 (64 pts), ternaries 18 (29 pts), boolean chains 21, loops 3 (5 pts), error handling 2 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · reporesolve.dirs_from_command (cognitive 120) · ×1
  • reporesolve.dirs_from_command (cognitive 120) plugins/security-guidance/hooks/reporesolve.py:70 — reporesolve.dirs_from_command has cognitive complexity 120 (threshold 15). Drivers by points: if/else 26 (84 pts), boolean chains 18, ternaries 4 (13 pts), loops 2 (5 pts) (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Pulse.freshness (cognitive 117) · ×1
  • Pulse.freshness (cognitive 117) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:736 — Pulse.freshness has cognitive complexity 117 (threshold 15). Drivers by points: if/else 25 (59 pts), ternaries 18 (32 pts), loops 10 (18 pts), boolean chains 8 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.render_md (cognitive 102) · ×1
  • proof_pack.render_md (cognitive 102) plugins/code-modernization/scripts/proof_pack.py:881 — proof_pack.render_md has cognitive complexity 102 (threshold 15). Drivers by points: if/else 22 (43 pts), ternaries 16 (43 pts), boolean chains 14, loops 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook.main (cognitive 99) · ×1
  • security_reminder_hook.main (cognitive 99) plugins/security-guidance/hooks/security_reminder_hook.py:3284 — security_reminder_hook.main has cognitive complexity 99 (threshold 15). Drivers by points: if/else 34 (74 pts), boolean chains 11, ternaries 2 (7 pts), error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Pulse.output (cognitive 94) · ×1
  • Pulse.output (cognitive 94) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:856 — Pulse.output has cognitive complexity 94 (threshold 15). Drivers by points: if/else 22 (43 pts), ternaries 13 (24 pts), loops 12 (17 pts), boolean chains 10 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook.handle_push_sweep_posttooluse (cognitive 94) · ×1
  • security_reminder_hook.handle_push_sweep_posttooluse (cognitive 94) plugins/security-guidance/hooks/security_reminder_hook.py:2336 — security_reminder_hook.handle_push_sweep_posttooluse has cognitive complexity 94 (threshold 15). Drivers by points: if/else 40 (49 pts), boolean chains 20, ternaries 8 (15 pts), error handling 3 (7 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.classes (cognitive 93) · ×1
  • Pulse.classes (cognitive 93) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1410 — Pulse.classes has cognitive complexity 93 (threshold 15). Drivers by points: if/else 29 (54 pts), loops 13 (22 pts), boolean chains 9, ternaries 2 (8 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_rules.trace (cognitive 93) · ×1
  • trace_rules.trace (cognitive 93) plugins/code-modernization/scripts/trace_rules.py:327 — trace_rules.trace has cognitive complexity 93 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 8 (15 pts), ternaries 3 (15 pts), boolean chains 13 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Pulse.rollup (cognitive 89) · ×1
  • Pulse.rollup (cognitive 89) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1719 — Pulse.rollup has cognitive complexity 89 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 15 (20 pts), boolean chains 17, ternaries 8 (17 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.parse_baseline (cognitive 85) · ×1
  • baseline_diff.parse_baseline (cognitive 85) plugins/code-modernization/scripts/baseline_diff.py:135 — baseline_diff.parse_baseline has cognitive complexity 85 (threshold 15). Drivers by points: if/else 13 (36 pts), ternaries 7 (26 pts), loops 6 (15 pts), boolean chains 8 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.compare (cognitive 80) · ×1
  • baseline_diff.compare (cognitive 80) plugins/code-modernization/scripts/baseline_diff.py:633 — baseline_diff.compare has cognitive complexity 80 (threshold 15). Drivers by points: if/else 21 (45 pts), loops 10 (18 pts), boolean chains 10, ternaries 2 (7 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.emit (cognitive 79) · ×1
  • Pulse.emit (cognitive 79) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:2004 — Pulse.emit has cognitive complexity 79 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 11 (21 pts), ternaries 11 (20 pts), boolean chains 11 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · run_eval.run_single_query (cognitive 79) · ×1
  • run_eval.run_single_query (cognitive 79) plugins/skill-creator/skills/skill-creator/scripts/run_eval.py:35 — run_eval.run_single_query has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (66 pts), loops 3 (7 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · build_report.proof_module (cognitive 77) · ×1
  • build_report.proof_module (cognitive 77) plugins/code-modernization/scripts/build_report.py:383 — build_report.proof_module has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (29 pts), ternaries 22 (25 pts), boolean chains 20, loops 3 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · ensure_agent_sdk.main (cognitive 75) · ×1
  • ensure_agent_sdk.main (cognitive 75) REDACTED:701 — ensure_agent_sdk.main has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 26, error handling 7 (10 pts), ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.exceptions (cognitive 72) · ×1
  • Pulse.exceptions (cognitive 72) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1553 — Pulse.exceptions has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (33 pts), ternaries 8 (20 pts), loops 8 (12 pts), boolean chains 7 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._agentic_review (cognitive 71) · ×1
  • llm._agentic_review (cognitive 71) REDACTED:2204 — llm._agentic_review has cognitive complexity 71 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 9, error handling 5 (8 pts), loops 2 (5 pts), ternaries 2 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · topology-viewer.html.draw (cognitive 69) · ×1
  • topology-viewer.html.draw (cognitive 69) plugins/code-modernization/assets/topology-viewer.html:223 — topology-viewer.html.draw has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 11, loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 31). Of this number, 65 points are the body's own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.check (cognitive 68) · ×1
  • Page.check (cognitive 68) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:591 — Page.check has cognitive complexity 68 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 13, loops 10 (13 pts), ternaries 3 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.proofModule (cognitive 67) · ×1
  • REDACTED.proofModule (cognitive 67) REDACTED:335 — REDACTED.proofModule has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 24, if/else 15 (23 pts), ternaries 8 (20 pts) (nesting depth added 20). Of this number, 62 points are the body's own statements and 5 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · xray.xrayOf (cognitive 63) · ×1
  • xray.xrayOf (cognitive 63) plugins/code-modernization/hooks/xray/xray.ts:133 — xray.xrayOf has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (34 pts), ternaries 11 (19 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 22). Of this number, 61 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_rules.main (cognitive 60) · ×1
  • render_rules.main (cognitive 60) plugins/code-modernization/scripts/render_rules.py:84 — render_rules.main has cognitive complexity 60 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 14, loops 7 (11 pts), ternaries 2 (5 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · aggregate_benchmark.load_run_results (cognitive 58) · ×1
  • aggregate_benchmark.load_run_results (cognitive 58) plugins/skill-creator/skills/skill-creator/scripts/aggregate_benchmark.py:67 — aggregate_benchmark.load_run_results has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (31 pts), error handling 4 (15 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · discover_bumps.main (cognitive 57) · ×1
  • discover_bumps.main (cognitive 57) .github/scripts/discover_bumps.py:87 — discover_bumps.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 5 (13 pts), loops 5 (9 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build_report.equivalence_view (cognitive 57) · ×1
  • build_report.equivalence_view (cognitive 57) plugins/code-modernization/scripts/build_report.py:272 — build_report.equivalence_view has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 18, ternaries 11 (18 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._call_claude (cognitive 56) · ×1
  • llm._call_claude (cognitive 56) REDACTED:1253 — llm._call_claude has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 8, ternaries 2 (8 pts), error handling 3 (7 pts), loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build_report.build (cognitive 55) · ×1
  • build_report.build (cognitive 55) plugins/code-modernization/scripts/build_report.py:562 — build_report.build has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (29 pts), ternaries 9 (13 pts), boolean chains 6, loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · run_loop.run_loop (cognitive 55) · ×1
  • run_loop.run_loop (cognitive 55) plugins/skill-creator/skills/skill-creator/scripts/run_loop.py:47 — run_loop.run_loop has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (44 pts), ternaries 5 (9 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pulse_compute.parse_profile (cognitive 54) · ×1
  • pulse_compute.parse_profile (cognitive 54) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:333 — pulse_compute.parse_profile has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (30 pts), loops 5 (12 pts), boolean chains 10, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.mcp.setRequestHandler() (cognitive 54) · ×1
  • server.mcp.setRequestHandler() (cognitive 54) REDACTED:528 — server.mcp.setRequestHandler() has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 12 (28 pts), if/else 5 (11 pts), loops 3 (6 pts), boolean chains 5, error handling 2 (3 pts), match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uplift_checks.parse_deltas (cognitive 53) · ×1
  • uplift_checks.parse_deltas (cognitive 53) plugins/code-modernization/scripts/uplift_checks.py:222 — uplift_checks.parse_deltas has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 8, loops 4 (6 pts), ternaries 2 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · config_loader.extract_frontmatter (cognitive 51) · ×1
  • config_loader.extract_frontmatter (cognitive 51) plugins/hookify/core/config_loader.py:87 — config_loader.extract_frontmatter has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.inline (cognitive 51) · ×1
  • REDACTED.inline (cognitive 51) REDACTED:120 — REDACTED.inline has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 16, ternaries 4 (15 pts), loops 1 (nesting depth added 19). Of this number, 49 points are the body's own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook.check_patterns (cognitive 50) · ×1
  • security_reminder_hook.check_patterns (cognitive 50) plugins/security-guidance/hooks/security_reminder_hook.py:735 — security_reminder_hook.check_patterns has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (33 pts), error handling 3 (9 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.md (cognitive 49) · ×1
  • REDACTED.md (cognitive 49) REDACTED:204 — REDACTED.md has cognitive complexity 49 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 10 (14 pts), ternaries 3 (10 pts), boolean chains 9 (nesting depth added 21). Of this number, 42 points are the body's own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.decisions (cognitive 48) · ×1
  • Pulse.decisions (cognitive 48) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1911 — Pulse.decisions has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 8 (15 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · make_shards.from_tree (cognitive 48) · ×1
  • make_shards.from_tree (cognitive 48) plugins/code-modernization/scripts/make_shards.py:160 — make_shards.from_tree has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 9, loops 5 (8 pts), ternaries 1 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_rules.parse_rules (cognitive 46) · ×1
  • trace_rules.parse_rules (cognitive 46) plugins/code-modernization/scripts/trace_rules.py:167 — trace_rules.parse_rules has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (30 pts), ternaries 5 (11 pts), loops 3, boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.context (cognitive 45) · ×1
  • Pulse.context (cognitive 45) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:626 — Pulse.context has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 8, ternaries 4 (8 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.read_baseline_evidence (cognitive 45) · ×1
  • baseline_diff.read_baseline_evidence (cognitive 45) plugins/code-modernization/scripts/baseline_diff.py:525 — baseline_diff.read_baseline_evidence has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 6, loops 3 (5 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pulse_compute.load_exports (cognitive 44) · ×1
  • pulse_compute.load_exports (cognitive 44) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:265 — pulse_compute.load_exports has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (7 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · generate_review.build_run (cognitive 44) · ×1
  • generate_review.build_run (cognitive 44) plugins/skill-creator/skills/skill-creator/eval-viewer/generate_review.py:85 — generate_review.build_run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), error handling 3 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.mcp.setRequestHandler() (cognitive 44) · ×1
  • server.mcp.setRequestHandler() (cognitive 44) REDACTED:656 — server.mcp.setRequestHandler() has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 5 (11 pts), loops 4 (8 pts), boolean chains 3, error handling 1, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · estate.paint (cognitive 44) · ×1
  • estate.paint (cognitive 44) plugins/code-modernization/hooks/map/estate.ts:189 — estate.paint has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 9 (24 pts), boolean chains 8, if/else 2 (6 pts), loops 3 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.mcp.setRequestHandler() (cognitive 43) · ×1
  • server.mcp.setRequestHandler() (cognitive 43) REDACTED:601 — server.mcp.setRequestHandler() has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 8 (21 pts), if/else 4 (9 pts), loops 3 (6 pts), boolean chains 3, error handling 2 (3 pts), match/switch 1 (nesting depth added 22). Of this number, 37 points are the body's own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.work_view (cognitive 42) · ×1
  • plant_setup.work_view (cognitive 42) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:648 — plant_setup.work_view has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 6 (14 pts), boolean chains 5, loops 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · improve_description.improve_description (cognitive 42) · ×1
  • improve_description.improve_description (cognitive 42) plugins/skill-creator/skills/skill-creator/scripts/improve_description.py:50 — improve_description.improve_description has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 5 (14 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.handleInbound (cognitive 42) · ×1
  • server.handleInbound (cognitive 42) REDACTED:778 — server.handleInbound has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uplift.parseBaseline (cognitive 42) · ×1
  • uplift.parseBaseline (cognitive 42) plugins/code-modernization/hooks/reader/uplift.ts:52 — uplift.parseBaseline has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 9 (24 pts), if/else 4 (9 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · reporesolve.iter_git_repos (cognitive 41) · ×1
  • reporesolve.iter_git_repos (cognitive 41) plugins/security-guidance/hooks/reporesolve.py:191 — reporesolve.iter_git_repos has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (25 pts), error handling 2 (6 pts), boolean chains 5, loops 2 (3 pts), ternaries 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.days (cognitive 40) · ×1
  • Pulse.days (cognitive 40) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1147 — Pulse.days has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 6 (20 pts), if/else 8 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · generate_report.generate_html (cognitive 40) · ×1
  • generate_report.generate_html (cognitive 40) plugins/skill-creator/skills/skill-creator/scripts/generate_report.py:16 — generate_report.generate_html has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 11 (23 pts), loops 7 (12 pts), if/else 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · write_scan_meta.record (cognitive 39) · ×1
  • write_scan_meta.record (cognitive 39) plugins/claude-security/scripts/write_scan_meta.py:427 — write_scan_meta.record has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 9, ternaries 8, loops 2 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · baseline_diff.result_files (cognitive 39) · ×1
  • baseline_diff.result_files (cognitive 39) plugins/code-modernization/scripts/baseline_diff.py:258 — baseline_diff.result_files has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (8 pts), boolean chains 5, error handling 1 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.details_html (cognitive 38) · ×1
  • plant_setup.details_html (cognitive 38) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:297 — plant_setup.details_html has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 4 (11 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.brief_items (cognitive 38) · ×1
  • proof_pack.brief_items (cognitive 38) plugins/code-modernization/scripts/proof_pack.py:339 — proof_pack.brief_items has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 6, ternaries 3 (4 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _base.interp_reparse_metric (cognitive 38) · ×1
  • _base.interp_reparse_metric (cognitive 38) plugins/security-guidance/hooks/_base.py:467 — _base.interp_reparse_metric has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 3 (8 pts), boolean chains 4, loops 3 (4 pts), ternaries 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · brief.parseBrief (cognitive 38) · ×1
  • brief.parseBrief (cognitive 38) plugins/code-modernization/hooks/reader/brief.ts:71 — brief.parseBrief has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 12, ternaries 4 (6 pts), loops 1 (nesting depth added 13). Of this number, 34 points are the body's own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup._selftest (cognitive 37) · ×1
  • plant_setup._selftest (cognitive 37) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:1184 — plant_setup._selftest has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 16, loops 8 (9 pts), error handling 4 (8 pts), if/else 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · discover.walk (cognitive 37) · ×1
  • discover.walk (cognitive 37) plugins/code-modernization/hooks/reader/discover.ts:59 — discover.walk has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 3 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 88, 86). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · deck.deckView (cognitive 37) · ×1
  • deck.deckView (cognitive 37) plugins/code-modernization/hooks/views/deck.tsx:87 — deck.deckView has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 23 (27 pts), if/else 5, boolean chains 4, loops 1 (nesting depth added 4). Of this number, 33 points are the body's own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Pulse.normalize (cognitive 36) · ×1
  • Pulse.normalize (cognitive 36) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:682 — Pulse.normalize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (12 pts), ternaries 2 (7 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.output_section (cognitive 36) · ×1
  • Page.output_section (cognitive 36) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:313 — Page.output_section has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 8 (11 pts), boolean chains 4, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uplift_checks.main (cognitive 36) · ×1
  • uplift_checks.main (cognitive 36) plugins/code-modernization/scripts/uplift_checks.py:316 — uplift_checks.main has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 7 (16 pts), loops 4 (9 pts), if/else 5 (7 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · (anonymous) (cognitive 36) · ×1
  • (anonymous) (cognitive 36) plugins/code-modernization/workflows/extract-rules.js:671 — (anonymous) has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 2 (8 pts), boolean chains 5, loops 2 (3 pts), other 1 (nesting depth added 18). Of this number, 34 points are the body's own statements and 2 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compare.self_check (cognitive 35) · ×1
  • compare.self_check (cognitive 35) plugins/code-modernization/scripts/compare.py:338 — compare.self_check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RuleEngine._extract_field (cognitive 35) · ×1
  • RuleEngine._extract_field (cognitive 35) plugins/hookify/core/rule_engine.py:182 — RuleEngine._extract_field has cognitive complexity 35 (threshold 15). Drivers by points: error handling 4 (16 pts), if/else 9 (16 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ledger.check (cognitive 35) · ×1
  • ledger.check (cognitive 35) plugins/math-proof/skills/siege/scripts/ledger.py:483 — ledger.check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · progress.nextOfTransform (cognitive 35) · ×1
  • progress.nextOfTransform (cognitive 35) plugins/code-modernization/hooks/reader/progress.ts:273 — progress.nextOfTransform has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 6 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). Of this number, 34 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.prune (cognitive 34) · ×1
  • plant_setup.prune (cognitive 34) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:864 — plant_setup.prune has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.read_results (cognitive 33) · ×1
  • baseline_diff.read_results (cognitive 33) plugins/code-modernization/scripts/baseline_diff.py:295 — baseline_diff.read_results has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 6 (14 pts), loops 5 (10 pts), if/else 2 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.source_check (cognitive 33) · ×1
  • proof_pack.source_check (cognitive 33) plugins/code-modernization/scripts/proof_pack.py:291 — proof_pack.source_check has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 6 (8 pts), boolean chains 4, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.evaluate (cognitive 33) · ×1
  • proof_pack.evaluate (cognitive 33) plugins/code-modernization/scripts/proof_pack.py:788 — proof_pack.evaluate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil.filter_preexisting_from_diff (cognitive 33) · ×1
  • gitutil.filter_preexisting_from_diff (cognitive 33) plugins/security-guidance/hooks/gitutil.py:2203 — gitutil.filter_preexisting_from_diff has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · verification.parseVerification (cognitive 33) · ×1
  • verification.parseVerification (cognitive 33) plugins/code-modernization/hooks/reader/verification.ts:73 — verification.parseVerification has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 5 (8 pts), boolean chains 7, loops 2, error handling 1 (nesting depth added 10). Of this number, 32 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.fold_diagnoses (cognitive 32) · ×1
  • Pulse.fold_diagnoses (cognitive 32) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1638 — Pulse.fold_diagnoses has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 11, ternaries 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ledger.answers (cognitive 32) · ×1
  • ledger.answers (cognitive 32) plugins/math-proof/skills/siege/scripts/ledger.py:416 — ledger.answers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pane.session (cognitive 32) · ×1
  • pane.session (cognitive 32) plugins/code-modernization/hooks/views/pane.tsx:315 — pane.session has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 14 (27 pts), loops 3, if/else 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pulse_compute.read_xlsx (cognitive 31) · ×1
  • pulse_compute.read_xlsx (cognitive 31) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:73 — pulse_compute.read_xlsx has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (9 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · patch_artifacts.section_stat (cognitive 31) · ×1
  • patch_artifacts.section_stat (cognitive 31) plugins/claude-security/scripts/patch_artifacts.py:470 — patch_artifacts.section_stat has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (7 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uplift_checks.walk_tests (cognitive 31) · ×1
  • uplift_checks.walk_tests (cognitive 31) plugins/code-modernization/scripts/uplift_checks.py:52 — uplift_checks.walk_tests has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · reporesolve.repos_from_paths (cognitive 31) · ×1
  • reporesolve.repos_from_paths (cognitive 31) plugins/security-guidance/hooks/reporesolve.py:244 — reporesolve.repos_from_paths has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.renderGlance (cognitive 31) · ×1
  • REDACTED.renderGlance (cognitive 31) REDACTED:259 — REDACTED.renderGlance has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 12, if/else 11 (12 pts), ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 4). Of this number, 27 points are the body's own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · modernized.readTestsAt (cognitive 31) · ×1
  • modernized.readTestsAt (cognitive 31) REDACTED:157 — modernized.readTestsAt has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 5 (11 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 15). Of this number, 28 points are the body's own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pane.modules (cognitive 31) · ×1
  • pane.modules (cognitive 31) plugins/code-modernization/hooks/views/pane.tsx:245 — pane.modules has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 16 (24 pts), boolean chains 6, if/else 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 267). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Pulse.rank_events (cognitive 30) · ×1
  • Pulse.rank_events (cognitive 30) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1055 — Pulse.rank_events has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 10, ternaries 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · proof_pack.check_rules (cognitive 30) · ×1
  • proof_pack.check_rules (cognitive 30) plugins/code-modernization/scripts/proof_pack.py:485 — proof_pack.check_rules has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 3 (9 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · treemap.squarify (cognitive 30) · ×1
  • treemap.squarify (cognitive 30) plugins/code-modernization/hooks/map/treemap.ts:38 — treemap.squarify has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 4 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compare.judge (cognitive 29) · ×1
  • compare.judge (cognitive 29) plugins/code-modernization/scripts/compare.py:269 — compare.judge has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 6 (11 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ledger.main (cognitive 29) · ×1
  • ledger.main (cognitive 29) plugins/math-proof/skills/siege/scripts/ledger.py:600 — ledger.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (9 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · quick_validate.validate_skill (cognitive 29) · ×1
  • quick_validate.validate_skill (cognitive 29) plugins/skill-creator/skills/skill-creator/scripts/quick_validate.py:12 — quick_validate.validate_skill has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.gate (cognitive 29) · ×1
  • server.gate (cognitive 29) REDACTED:236 — server.gate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · analyze-sessions.handleUser (cognitive 29) · ×1
  • analyze-sessions.handleUser (cognitive 29) plugins/session-report/skills/session-report/analyze-sessions.mjs:420 — analyze-sessions.handleUser has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 8 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_report.render (cognitive 28) · ×1
  • render_report.render (cognitive 28) plugins/claude-security/scripts/render_report.py:776 — render_report.render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (19 pts), ternaries 4, boolean chains 2, loops 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · baseline_diff.evidence_paths (cognitive 28) · ×1
  • baseline_diff.evidence_paths (cognitive 28) plugins/code-modernization/scripts/baseline_diff.py:458 — baseline_diff.evidence_paths has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 4, ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.parse_results_json (cognitive 28) · ×1
  • baseline_diff.parse_results_json (cognitive 28) plugins/code-modernization/scripts/baseline_diff.py:501 — baseline_diff.parse_results_json has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · make_shards.main (cognitive 28) · ×1
  • make_shards.main (cognitive 28) plugins/code-modernization/scripts/make_shards.py:208 — make_shards.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_rules.main (cognitive 28) · ×1
  • trace_rules.main (cognitive 28) plugins/code-modernization/scripts/trace_rules.py:473 — trace_rules.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 4 (6 pts), boolean chains 4, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · main (cognitive 28) · ×1
  • main (cognitive 28) plugins/session-report/skills/session-report/analyze-sessions.mjs:535 — main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, loops 3 (4 pts), ternaries 2 (nesting depth added 8). Of this number, 24 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Ladder._match (cognitive 27) · ×1
  • Ladder._match (cognitive 27) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:556 — Ladder._match has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.downtime (cognitive 27) · ×1
  • Pulse.downtime (cognitive 27) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:995 — Pulse.downtime has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 5 (8 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.scrap_section (cognitive 27) · ×1
  • Page.scrap_section (cognitive 27) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:471 — Page.scrap_section has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), ternaries 5 (7 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_report.scan_of (cognitive 27) · ×1
  • render_report.scan_of (cognitive 27) plugins/claude-security/scripts/render_report.py:510 — render_report.scan_of has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12, boolean chains 9, ternaries 3 (4 pts), error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · write_scan_meta.tree_extent (cognitive 27) · ×1
  • write_scan_meta.tree_extent (cognitive 27) plugins/claude-security/scripts/write_scan_meta.py:120 — write_scan_meta.tree_extent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.assess_baseline (cognitive 27) · ×1
  • baseline_diff.assess_baseline (cognitive 27) plugins/code-modernization/scripts/baseline_diff.py:587 — baseline_diff.assess_baseline has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (12 pts), ternaries 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · proof_pack.suite_evidence (cognitive 27) · ×1
  • proof_pack.suite_evidence (cognitive 27) plugins/code-modernization/scripts/proof_pack.py:216 — proof_pack.suite_evidence has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (8 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.check_fresh (cognitive 27) · ×1
  • proof_pack.check_fresh (cognitive 27) plugins/code-modernization/scripts/proof_pack.py:671 — proof_pack.check_fresh has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 10, boolean chains 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · compare.within_tolerance (cognitive 26) · ×1
  • compare.within_tolerance (cognitive 26) plugins/code-modernization/scripts/compare.py:138 — compare.within_tolerance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.check_same (cognitive 26) · ×1
  • proof_pack.check_same (cognitive 26) plugins/code-modernization/scripts/proof_pack.py:628 — proof_pack.check_same has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ledger.early_conclude_ok (cognitive 26) · ×1
  • ledger.early_conclude_ok (cognitive 26) plugins/math-proof/skills/siege/scripts/ledger.py:167 — ledger.early_conclude_ok has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.downtime_section (cognitive 25) · ×1
  • Page.downtime_section (cognitive 25) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:406 — Page.downtime_section has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (9 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_report.notifications_of (cognitive 25) · ×1
  • render_report.notifications_of (cognitive 25) plugins/claude-security/scripts/render_report.py:680 — render_report.notifications_of has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ensure_agent_sdk._pip_err_from_stderr (cognitive 25) · ×1
  • ensure_agent_sdk._pip_err_from_stderr (cognitive 25) REDACTED:411 — ensure_agent_sdk._pip_err_from_stderr has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 12, ternaries 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · llm.analyze_code_security (cognitive 25) · ×1
  • llm.analyze_code_security (cognitive 25) REDACTED:1753 — llm.analyze_code_security has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 4 (5 pts), loops 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · REDACTED.partEquiv (cognitive 25) · ×1
  • REDACTED.partEquiv (cognitive 25) REDACTED:296 — REDACTED.partEquiv has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, if/else 8, ternaries 3. Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 306, 302). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · pane.planOf (cognitive 25) · ×1
  • pane.planOf (cognitive 25) plugins/code-modernization/hooks/views/pane.tsx:542 — pane.planOf has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 18 (20 pts), if/else 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). Of this number, 15 points are the body's own statements and 10 belong to 11 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · extract-rules.verifyAndFold (cognitive 25) · ×1
  • extract-rules.verifyAndFold (cognitive 25) plugins/code-modernization/workflows/extract-rules.js:432 — extract-rules.verifyAndFold has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body's own statements and 12 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.gate (cognitive 24) · ×1
  • server.gate (cognitive 24) REDACTED:236 — server.gate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.handleInbound (cognitive 24) · ×1
  • server.handleInbound (cognitive 24) REDACTED:907 — server.handleInbound has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · topology.parseTopology (cognitive 24) · ×1
  • topology.parseTopology (cognitive 24) plugins/code-modernization/hooks/reader/topology.ts:98 — topology.parseTopology has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6, boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.put_block (cognitive 23) · ×1
  • plant_setup.put_block (cognitive 23) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:802 — plant_setup.put_block has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 9 (10 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup._work_selftest (cognitive 23) · ×1
  • plant_setup._work_selftest (cognitive 23) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:1039 — plant_setup._work_selftest has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, error handling 3, loops 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · finding.located (cognitive 23) · ×1
  • finding.located (cognitive 23) plugins/claude-security/scripts/lib/finding.py:295 — finding.located has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · write_scan_meta.capture_revision (cognitive 23) · ×1
  • write_scan_meta.capture_revision (cognitive 23) plugins/claude-security/scripts/write_scan_meta.py:292 — write_scan_meta.capture_revision has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compare.parse_masks (cognitive 23) · ×1
  • compare.parse_masks (cognitive 23) plugins/code-modernization/scripts/compare.py:74 — compare.parse_masks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diffstate._diff_review_started (cognitive 23) · ×1
  • diffstate._diff_review_started (cognitive 23) plugins/security-guidance/hooks/diffstate.py:964 — diffstate._diff_review_started has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _DiffKeeper._keep_added (cognitive 23) · ×1
  • _DiffKeeper._keep_added (cognitive 23) plugins/security-guidance/hooks/gitutil.py:1612 — _DiffKeeper._keep_added has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil._sweep_stale_indexes (cognitive 23) · ×1
  • gitutil._sweep_stale_indexes (cognitive 23) plugins/security-guidance/hooks/gitutil.py:443 — gitutil._sweep_stale_indexes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.gate (cognitive 23) · ×1
  • server.gate (cognitive 23) REDACTED:327 — server.gate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · mine-transcripts.gitCommitsWithOurWork (cognitive 23) · ×1
  • mine-transcripts.gitCommitsWithOurWork (cognitive 23) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:770 — mine-transcripts.gitCommitsWithOurWork has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.breakdown (cognitive 22) · ×1
  • Page.breakdown (cognitive 22) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:367 — Page.breakdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts), ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diffstate._mark_inflight (cognitive 22) · ×1
  • diffstate._mark_inflight (cognitive 22) plugins/security-guidance/hooks/diffstate.py:1184 — diffstate._mark_inflight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 4 (8 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diffstate.compute_v2_review_set (cognitive 22) · ×1
  • diffstate.compute_v2_review_set (cognitive 22) plugins/security-guidance/hooks/diffstate.py:1356 — diffstate.compute_v2_review_set has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, ternaries 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · extensibility._validate_pattern (cognitive 22) · ×1
  • extensibility._validate_pattern (cognitive 22) plugins/security-guidance/hooks/extensibility.py:380 — extensibility._validate_pattern has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · session_state.cleanup_old_state_files (cognitive 22) · ×1
  • session_state.cleanup_old_state_files (cognitive 22) plugins/security-guidance/hooks/session_state.py:75 — session_state.cleanup_old_state_files has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (7 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · progress.oneLineOf (cognitive 22) · ×1
  • progress.oneLineOf (cognitive 22) plugins/code-modernization/hooks/reader/progress.ts:952 — progress.oneLineOf has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 4, boolean chains 3 (nesting depth added 8). Of this number, 20 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · mine-transcripts.renderHTML (cognitive 22) · ×1
  • mine-transcripts.renderHTML (cognitive 22) plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:1204 — mine-transcripts.renderHTML has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 12 (14 pts), boolean chains 5, if/else 3 (nesting depth added 2). Of this number, 18 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · plant_setup.install_work (cognitive 21) · ×1
  • plant_setup.install_work (cognitive 21) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:737 — plant_setup.install_work has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · telemetry.run_hook (cognitive 21) · ×1
  • telemetry.run_hook (cognitive 21) plugins/code-modernization/scripts/telemetry.py:623 — telemetry.run_hook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (8 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uplift_checks.delta_coverage (cognitive 21) · ×1
  • uplift_checks.delta_coverage (cognitive 21) plugins/code-modernization/scripts/uplift_checks.py:281 — uplift_checks.delta_coverage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil._git_status_porcelain (cognitive 21) · ×1
  • gitutil._git_status_porcelain (cognitive 21) plugins/security-guidance/hooks/gitutil.py:1400 — gitutil._git_status_porcelain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._context_without_unreadable_store_certs (cognitive 21) · ×1
  • llm._context_without_unreadable_store_certs (cognitive 21) REDACTED:274 — llm._context_without_unreadable_store_certs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._call_claude_dual_or (cognitive 21) · ×1
  • llm._call_claude_dual_or (cognitive 21) REDACTED:1427 — llm._call_claude_dual_or has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (9 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · security_reminder_hook.emit_metrics (cognitive 21) · ×1
  • security_reminder_hook.emit_metrics (cognitive 21) plugins/security-guidance/hooks/security_reminder_hook.py:354 — security_reminder_hook.emit_metrics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · discover.directoryUnits (cognitive 21) · ×1
  • discover.directoryUnits (cognitive 21) plugins/code-modernization/hooks/reader/discover.ts:235 — discover.directoryUnits has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 9). Of this number, 19 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rules.parseRules (cognitive 21) · ×1
  • rules.parseRules (cognitive 21) REDACTED:340 — rules.parseRules has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 362, close). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
D2 · Cognitive Complexity · Page.freshness (cognitive 20) · ×1
  • Page.freshness (cognitive 20) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:130 — Page.freshness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 5, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · build_report.modernized_docs (cognitive 20) · ×1
  • build_report.modernized_docs (cognitive 20) plugins/code-modernization/scripts/build_report.py:499 — build_report.modernized_docs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.check_tests_state (cognitive 20) · ×1
  • proof_pack.check_tests_state (cognitive 20) plugins/code-modernization/scripts/proof_pack.py:463 — proof_pack.check_tests_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 8, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · telemetry.snapshot (cognitive 20) · ×1
  • telemetry.snapshot (cognitive 20) plugins/code-modernization/scripts/telemetry.py:308 — telemetry.snapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 4 (5 pts), loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · trace_rules.walk_module (cognitive 20) · ×1
  • trace_rules.walk_module (cognitive 20) plugins/code-modernization/scripts/trace_rules.py:250 — trace_rules.walk_module has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · trace_rules.render (cognitive 20) · ×1
  • trace_rules.render (cognitive 20) plugins/code-modernization/scripts/trace_rules.py:448 — trace_rules.render has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 5, if/else 5, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · _base._record_usage (cognitive 20) · ×1
  • _base._record_usage (cognitive 20) plugins/security-guidance/hooks/_base.py:289 — _base._record_usage has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts), loops 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · diffstate.turn_commits_code (cognitive 20) · ×1
  • diffstate.turn_commits_code (cognitive 20) plugins/security-guidance/hooks/diffstate.py:822 — diffstate.turn_commits_code has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · gitutil._is_secret_shaped (cognitive 20) · ×1
  • gitutil._is_secret_shaped (cognitive 20) plugins/security-guidance/hooks/gitutil.py:1895 — gitutil._is_secret_shaped has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm.gateway_review_cli (cognitive 20) · ×1
  • llm.gateway_review_cli (cognitive 20) REDACTED:1060 — llm.gateway_review_cli has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.listItems (cognitive 20) · ×1
  • REDACTED.listItems (cognitive 20) REDACTED:179 — REDACTED.listItems has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pulse.shift_coverage (cognitive 19) · ×1
  • Pulse.shift_coverage (cognitive 19) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:2114 — Pulse.shift_coverage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · patch_artifacts.report_findings (cognitive 19) · ×1
  • patch_artifacts.report_findings (cognitive 19) plugins/claude-security/scripts/patch_artifacts.py:901 — patch_artifacts.report_findings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · render_report.verification_summary (cognitive 19) · ×1
  • render_report.verification_summary (cognitive 19) plugins/claude-security/scripts/render_report.py:367 — render_report.verification_summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 4 (5 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · build_report.security_facts (cognitive 19) · ×1
  • build_report.security_facts (cognitive 19) plugins/code-modernization/scripts/build_report.py:207 — build_report.security_facts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.check_canary (cognitive 19) · ×1
  • proof_pack.check_canary (cognitive 19) plugins/code-modernization/scripts/proof_pack.py:728 — proof_pack.check_canary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 3 (6 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · telemetry.built_kind_and_count (cognitive 19) · ×1
  • telemetry.built_kind_and_count (cognitive 19) plugins/code-modernization/scripts/telemetry.py:288 — telemetry.built_kind_and_count has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (5 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._net_error_class (cognitive 19) · ×1
  • llm._net_error_class (cognitive 19) REDACTED:378 — llm._net_error_class has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · security_reminder_hook._claim_bash_hook_once (cognitive 19) · ×1
  • security_reminder_hook._claim_bash_hook_once (cognitive 19) plugins/security-guidance/hooks/security_reminder_hook.py:1224 — security_reminder_hook._claim_bash_hook_once has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 4 (6 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · rules.cardOf (cognitive 19) · ×1
  • rules.cardOf (cognitive 19) REDACTED:194 — rules.cardOf has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (5 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · pane.nextBlock (cognitive 19) · ×1
  • pane.nextBlock (cognitive 19) plugins/code-modernization/hooks/views/pane.tsx:481 — pane.nextBlock has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (15 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · register.register · ×1
  • register.register::nodesTouched::take (cognitive 19) plugins/code-modernization/hooks/register.ts:269 — register.register::nodesTouched::take has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.problems (cognitive 18) · ×1
  • plant_setup.problems (cognitive 18) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:134 — plant_setup.problems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · plant_setup.work_problems (cognitive 18) · ×1
  • plant_setup.work_problems (cognitive 18) plugins/claude-for-manufacturing/shared/scripts/plant_setup.py:568 — plant_setup.work_problems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · finding.relative_path (cognitive 18) · ×1
  • finding.relative_path (cognitive 18) plugins/claude-security/scripts/lib/finding.py:327 — finding.relative_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 3, error handling 3, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · write_scan_meta.sanitize_remote (cognitive 18) · ×1
  • write_scan_meta.sanitize_remote (cognitive 18) plugins/claude-security/scripts/write_scan_meta.py:238 — write_scan_meta.sanitize_remote has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.render (cognitive 18) · ×1
  • baseline_diff.render (cognitive 18) plugins/code-modernization/scripts/baseline_diff.py:715 — baseline_diff.render has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 6 (7 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · build_report.parse_rules (cognitive 18) · ×1
  • build_report.parse_rules (cognitive 18) plugins/code-modernization/scripts/build_report.py:147 — build_report.parse_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build_report.rule_facts (cognitive 18) · ×1
  • build_report.rule_facts (cognitive 18) plugins/code-modernization/scripts/build_report.py:191 — build_report.rule_facts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · build_report.baseline_facts (cognitive 18) · ×1
  • build_report.baseline_facts (cognitive 18) plugins/code-modernization/scripts/build_report.py:226 — build_report.baseline_facts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (4 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · compare.mask_spans (cognitive 18) · ×1
  • compare.mask_spans (cognitive 18) plugins/code-modernization/scripts/compare.py:171 — compare.mask_spans has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.baseline_state (cognitive 18) · ×1
  • proof_pack.baseline_state (cognitive 18) plugins/code-modernization/scripts/proof_pack.py:531 — proof_pack.baseline_state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · proof_pack.not_proven (cognitive 18) · ×1
  • proof_pack.not_proven (cognitive 18) plugins/code-modernization/scripts/proof_pack.py:763 — proof_pack.not_proven has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 5, loops 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · gitutil._copy_slot (cognitive 18) · ×1
  • gitutil._copy_slot (cognitive 18) plugins/security-guidance/hooks/gitutil.py:544 — gitutil._copy_slot has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · utils.parse_skill_md (cognitive 18) · ×1
  • utils.parse_skill_md (cognitive 18) plugins/skill-creator/skills/skill-creator/scripts/utils.py:7 — utils.parse_skill_md has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · modernized.readNotes (cognitive 18) · ×1
  • modernized.readNotes (cognitive 18) REDACTED:240 — modernized.readNotes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ledger.parseLedger (cognitive 18) · ×1
  • ledger.parseLedger (cognitive 18) plugins/code-modernization/hooks/review/ledger.ts:24 — ledger.parseLedger has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 3 (4 pts), error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Page.n (cognitive 17) · ×1
  • Page.n (cognitive 17) plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:60 — Page.n has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4, boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.load_test_runs (cognitive 17) · ×1
  • proof_pack.load_test_runs (cognitive 17) plugins/code-modernization/scripts/proof_pack.py:144 — proof_pack.load_test_runs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6, loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · telemetry.goal_code (cognitive 17) · ×1
  • telemetry.goal_code (cognitive 17) plugins/code-modernization/scripts/telemetry.py:266 — telemetry.goal_code has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · telemetry.failure_metrics (cognitive 17) · ×1
  • telemetry.failure_metrics (cognitive 17) plugins/code-modernization/scripts/telemetry.py:484 — telemetry.failure_metrics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · telemetry.show (cognitive 17) · ×1
  • telemetry.show (cognitive 17) plugins/code-modernization/scripts/telemetry.py:657 — telemetry.show has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · config_loader.load_rules (cognitive 17) · ×1
  • config_loader.load_rules (cognitive 17) plugins/hookify/core/config_loader.py:198 — config_loader.load_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · diffstate._hunk_keys (cognitive 17) · ×1
  • diffstate._hunk_keys (cognitive 17) plugins/security-guidance/hooks/diffstate.py:891 — diffstate._hunk_keys has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil._sweep_stale_stash_indexes (cognitive 17) · ×1
  • gitutil._sweep_stale_stash_indexes (cognitive 17) plugins/security-guidance/hooks/gitutil.py:485 — gitutil._sweep_stale_stash_indexes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (3 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil._gitlink_paths (cognitive 17) · ×1
  • gitutil._gitlink_paths (cognitive 17) plugins/security-guidance/hooks/gitutil.py:872 — gitutil._gitlink_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · gitutil._parse_diff_header (cognitive 17) · ×1
  • gitutil._parse_diff_header (cognitive 17) plugins/security-guidance/hooks/gitutil.py:2103 — gitutil._parse_diff_header has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._net_error_flags (cognitive 17) · ×1
  • llm._net_error_flags (cognitive 17) REDACTED:416 — llm._net_error_flags has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · server.handleInbound (cognitive 17) · ×1
  • server.handleInbound (cognitive 17) REDACTED:810 — server.handleInbound has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 6, error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · REDACTED.buildList (cognitive 17) · ×1
  • REDACTED.buildList (cognitive 17) REDACTED:193 — REDACTED.buildList has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · viewer.html.renderGrades (cognitive 17) · ×1
  • viewer.html.renderGrades (cognitive 17) plugins/skill-creator/skills/skill-creator/eval-viewer/viewer.html:858 — viewer.html.renderGrades has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 5, if/else 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · printText (cognitive 17) · ×1
  • printText (cognitive 17) plugins/session-report/skills/session-report/analyze-sessions.mjs:751 — printText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 5, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · patch_artifacts.build_claims (cognitive 16) · ×1
  • patch_artifacts.build_claims (cognitive 16) plugins/claude-security/scripts/patch_artifacts.py:220 — patch_artifacts.build_claims has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · patch_artifacts.index_markdown (cognitive 16) · ×1
  • patch_artifacts.index_markdown (cognitive 16) plugins/claude-security/scripts/patch_artifacts.py:715 — patch_artifacts.index_markdown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 2 (6 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · baseline_diff.parse_runner_log (cognitive 16) · ×1
  • baseline_diff.parse_runner_log (cognitive 16) plugins/code-modernization/scripts/baseline_diff.py:396 — baseline_diff.parse_runner_log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Source.read (cognitive 16) · ×1
  • Source.read (cognitive 16) plugins/code-modernization/scripts/build_report.py:68 — Source.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 2 (4 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.code_mtime (cognitive 16) · ×1
  • proof_pack.code_mtime (cognitive 16) plugins/code-modernization/scripts/proof_pack.py:190 — proof_pack.code_mtime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · proof_pack.build (cognitive 16) · ×1
  • proof_pack.build (cognitive 16) plugins/code-modernization/scripts/proof_pack.py:836 — proof_pack.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · trace_rules.run_evidence (cognitive 16) · ×1
  • trace_rules.run_evidence (cognitive 16) plugins/code-modernization/scripts/trace_rules.py:120 — trace_rules.run_evidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · extensibility.edit_stats (cognitive 16) · ×1
  • extensibility.edit_stats (cognitive 16) plugins/security-guidance/hooks/extensibility.py:570 — extensibility.edit_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, error handling 1 (3 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · extensibility.search_custom_regexes (cognitive 16) · ×1
  • extensibility.search_custom_regexes (cognitive 16) plugins/security-guidance/hooks/extensibility.py:636 — extensibility.search_custom_regexes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · llm._fetch_newest_models (cognitive 16) · ×1
  • llm._fetch_newest_models (cognitive 16) REDACTED:740 — llm._fetch_newest_models has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (4 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · REDACTED.draw (cognitive 16) · ×1
  • REDACTED.draw (cognitive 16) REDACTED:467 — REDACTED.draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 481, 478, 492). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · uplift.parseCatalog (cognitive 16) · ×1
  • uplift.parseCatalog (cognitive 16) plugins/code-modernization/hooks/reader/uplift.ts:157 — uplift.parseCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · xray.upliftXray (cognitive 16) · ×1
  • xray.upliftXray (cognitive 16) plugins/code-modernization/hooks/xray/xray.ts:91 — xray.upliftXray has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 4, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · (anonymous) (cognitive 16) · ×1
  • (anonymous) (cognitive 16) plugins/code-modernization/workflows/extract-rules.js:154 — (anonymous) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · ClassTooLong · ×1
  • ClassTooLong: register plugins/code-modernization/hooks/register.ts:1 — ClassTooLong — 710 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 310 over it, 1.78× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) plugins/hookify/hooks/posttooluse.py:27 — plugins/hookify/hooks/posttooluse.py:27-58 | plugins/hookify/hooks/pretooluse.py:28-62 | plugins/hookify/hooks/stop.py:27-51 | plugins/hookify/hooks/userpromptsubmit.py:27-50 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) REDACTED:1512 — REDACTED:1512-1542 | plugins/security-guidance/hooks/review_api.py:369-398 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×1
  • Edited copy of a member (18 corresponding lines) plugins/code-modernization/scripts/build_report.py:673 — plugins/code-modernization/scripts/build_report.py:673-692 | plugins/code-modernization/scripts/compare.py:431-448 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) REDACTED:513 — REDACTED:513-537 | plugins/security-guidance/hooks/review_api.py:34-64 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) plugins/security-guidance/hooks/gitutil.py:210 — plugins/security-guidance/hooks/gitutil.py:210-232 | plugins/security-guidance/hooks/gitutil.py:1069-1092 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) plugins/code-modernization/scripts/baseline_diff.py:89 — plugins/code-modernization/scripts/baseline_diff.py:89-92 | plugins/code-modernization/scripts/build_report.py:120-123 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 13+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 13+ corresponding lines) plugins/security-guidance/hooks/gitutil.py:1013 — plugins/security-guidance/hooks/gitutil.py:1013-1027 | plugins/security-guidance/hooks/gitutil.py:1096-1108 | plugins/security-guidance/hooks/gitutil.py:1165-1185 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×1
  • Edited copy of a member (2 corresponding lines) plugins/code-modernization/scripts/baseline_diff.py:56 — plugins/code-modernization/scripts/baseline_diff.py:56-57 | plugins/code-modernization/scripts/trace_rules.py:77-78 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×1
  • Edited copy of a member (10 corresponding lines) plugins/claude-security/scripts/patch_artifacts.py:1269 — plugins/claude-security/scripts/patch_artifacts.py:1269-1278 | plugins/claude-security/scripts/write_scan_meta.py:536-545 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×1
  • Edited copy of a member (6 corresponding lines) plugins/claude-security/scripts/lib/chain.py:20 — plugins/claude-security/scripts/lib/chain.py:20-25 | plugins/claude-security/scripts/save_result.py:108-113 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (56 lines × 2) · ×1
  • Duplicated block (56 lines × 2) REDACTED:2629 — REDACTED:2629-2684 | plugins/security-guidance/hooks/review_api.py:212-267 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (30–33 lines × 2) · ×1
  • Duplicated block (30–33 lines × 2) plugins/hookify/hooks/posttooluse.py:27 — plugins/hookify/hooks/posttooluse.py:27-56 | plugins/hookify/hooks/pretooluse.py:28-60 — before extracting anything, compare `plugins/hookify/hooks/posttooluse.py` and `plugins/hookify/hooks/pretooluse.py` as WHOLE FILES: 87% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18–28 lines × 2) · ×1
  • Duplicated block (18–28 lines × 2) REDACTED:2578 — REDACTED:2578-2605 | plugins/security-guidance/hooks/review_api.py:325-342 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (22–23 lines × 2) · ×1
  • Duplicated block (22–23 lines × 2) plugins/hookify/hooks/stop.py:27 — plugins/hookify/hooks/stop.py:27-49 | plugins/hookify/hooks/userpromptsubmit.py:27-48 — before extracting anything, compare `plugins/hookify/hooks/stop.py` and `plugins/hookify/hooks/userpromptsubmit.py` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (14–21 lines × 2) · ×1
  • Duplicated block (14–21 lines × 2) REDACTED:1524 — REDACTED:1524-1537 | plugins/security-guidance/hooks/review_api.py:371-391 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `plugins/security-guidance/hooks/review_api.py:371` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (14–18 lines × 2) · ×1
  • Duplicated block (14–18 lines × 2) plugins/security-guidance/hooks/security_reminder_hook.py:2155 — plugins/security-guidance/hooks/security_reminder_hook.py:2155-2172 | plugins/security-guidance/hooks/security_reminder_hook.py:2628-2641 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `plugins/security-guidance/hooks/security_reminder_hook.py:2628` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15–16 lines × 4) · ×1
  • Duplicated block (15–16 lines × 4) plugins/hookify/hooks/posttooluse.py:44 — plugins/hookify/hooks/posttooluse.py:44-58 | plugins/hookify/hooks/pretooluse.py:47-62 | plugins/hookify/hooks/stop.py:36-51 | plugins/hookify/hooks/userpromptsubmit.py:36-50 — before extracting anything, compare `plugins/hookify/hooks/posttooluse.py` and `plugins/hookify/hooks/pretooluse.py` as WHOLE FILES: 87% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×1
  • Duplicated block (9 lines × 2) REDACTED:1458 — REDACTED:1458-1466 | REDACTED:1469-1477 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) plugins/security-guidance/hooks/security_reminder_hook.py:1439 — plugins/security-guidance/hooks/security_reminder_hook.py:1439-1445 | plugins/security-guidance/hooks/security_reminder_hook.py:1454-1460 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `plugins/security-guidance/hooks/security_reminder_hook.py:1439` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging call was found in the 19 Python, JavaScript/TypeScript production file(s) this check read across 6 module(s). Each was searched for its ecosystem's logging libraries (Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
R10 · Code Duplication · Duplication concentrated across 4 sibling directories (18 clone groups) · ×1
  • Duplication concentrated across 4 sibling directories (18 clone groups) REDACTED:92 — 18 duplicated blocks under external_plugins/ have copies in at least two of the sibling directories discord, fakechat, imessage, telegram — 17 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 18 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 18 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 18 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication · Duplicated block (82 lines × 2 locations) · ×1
  • Duplicated block (82 lines × 2 locations) REDACTED:92 — REDACTED:92 · REDACTED:98 — the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct — and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal's entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins — a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are.
R10 · Code Duplication · Duplicated block with local edits (26 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (26 matched lines × 2 locations) plugins/theme-examples/hooks/scenes/honu-lagoon.ts:181 — plugins/theme-examples/hooks/scenes/honu-lagoon.ts:181 · plugins/theme-examples/hooks/scenes/koi-mosaic.ts:282 — the two spans are one implementation copied and then locally edited — 189 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (23 lines × 2 locations) · ×1
  • Duplicated block (23 lines × 2 locations) REDACTED:753 — REDACTED:753 · REDACTED:748 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (22 lines × 2 locations) · ×1
  • Duplicated block (22 lines × 2 locations) REDACTED:37 — REDACTED:37 · REDACTED:28 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (22 lines × 3 locations) · ×1
  • Duplicated block (22 lines × 3 locations) REDACTED:706 — REDACTED:706 · REDACTED:717 · REDACTED:635 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (20 lines × 2 locations) · ×1
  • Duplicated block (20 lines × 2 locations) REDACTED:373 — REDACTED:373 · REDACTED:366 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (17 lines × 2 locations) · ×1
  • Duplicated block (17 lines × 2 locations) REDACTED:312 — REDACTED:312 · REDACTED:325 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication · Duplicated block (12 lines × 4 locations) · ×1
  • Duplicated block (12 lines × 4 locations) REDACTED:595 — REDACTED:595 · external_plugins/fakechat/server.ts:88 · REDACTED:650 · REDACTED:522 — the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block with local edits (12 matched lines × 2 locations) · ×1
  • Duplicated block with local edits (12 matched lines × 2 locations) plugins/code-modernization/hooks/reader/fs.ts:9 — plugins/code-modernization/hooks/reader/fs.ts:9 · plugins/code-modernization/hooks/reader/fs.ts:32 — the two spans are one implementation copied and then locally edited — 81 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication · Duplicated block (12 lines × 2 locations) · ×1
  • Duplicated block (12 lines × 2 locations) plugins/code-modernization/hooks/reader/progress.ts:364 — plugins/code-modernization/hooks/reader/progress.ts:364 · plugins/code-modernization/hooks/reader/progress.ts:394 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (9 lines × 2 locations) · ×1
  • Duplicated block (9 lines × 2 locations) REDACTED:460 — REDACTED:460 · REDACTED:470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
R10 · Code Duplication · Duplicated block (8 lines × 3 locations) · ×1
  • Duplicated block (8 lines × 3 locations) REDACTED:838 — REDACTED:838 · REDACTED:833 · REDACTED:935 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (7 lines × 2 locations) · ×1
  • Duplicated block (7 lines × 2 locations) plugins/code-modernization/workflows/portfolio-assess.js:7 — plugins/code-modernization/workflows/portfolio-assess.js:7 · plugins/code-modernization/workflows/reimagine-scaffold.js:7 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (6 lines × 3 locations) · ×1
  • Duplicated block (6 lines × 3 locations) plugins/theme-examples/hooks/scenes/departure-board.ts:48 — plugins/theme-examples/hooks/scenes/departure-board.ts:48 · plugins/theme-examples/hooks/scenes/honu-lagoon.ts:178 · plugins/theme-examples/hooks/scenes/night-reef.ts:209 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication · Duplicated block (5 lines × 3 locations) · ×1
  • Duplicated block (5 lines × 3 locations) plugins/theme-examples/hooks/scenes/braille-stars.ts:39 — plugins/theme-examples/hooks/scenes/braille-stars.ts:39 · plugins/theme-examples/hooks/scenes/dither-dunes.ts:112 · plugins/theme-examples/hooks/scenes/halftone-dawn.ts:42 — the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R2 · Cyclomatic Complexity · Complex function readSnapshot (cyclomatic 132, cognitive 183) · ×1
  • Complex function readSnapshot (cyclomatic 132, cognitive 183) plugins/code-modernization/hooks/reader/progress.ts:496 — readSnapshot has cyclomatic complexity 132 and cognitive complexity 183; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function processFile (cyclomatic 95, cognitive 195) · ×1
  • Complex function processFile (cyclomatic 95, cognitive 195) plugins/session-report/skills/session-report/analyze-sessions.mjs:191 — processFile has cyclomatic complexity 95 and cognitive complexity 195; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 61, cognitive 76) · ×1
  • Complex function (anonymous) (cyclomatic 61, cognitive 76) plugins/code-modernization/hooks/register.ts:1142 — (anonymous) has cyclomatic complexity 61 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function xrayOf (cyclomatic 46, cognitive 67) · ×1
  • Complex function xrayOf (cyclomatic 46, cognitive 67) plugins/code-modernization/hooks/xray/xray.ts:133 — xrayOf has cyclomatic complexity 46 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 40, cognitive 62) · ×1
  • Complex function (anonymous) (cyclomatic 40, cognitive 62) REDACTED:528 — (anonymous) has cyclomatic complexity 40 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function deckView (cyclomatic 39, cognitive 40) · ×1
  • Complex function deckView (cyclomatic 39, cognitive 40) plugins/code-modernization/hooks/views/deck.tsx:87 — deckView has cyclomatic complexity 39 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseBrief (cyclomatic 38, cognitive 43) · ×1
  • Complex function parseBrief (cyclomatic 38, cognitive 43) plugins/code-modernization/hooks/reader/brief.ts:71 — parseBrief has cyclomatic complexity 38 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseBaseline (cyclomatic 33, cognitive 48) · ×1
  • Complex function parseBaseline (cyclomatic 33, cognitive 48) plugins/code-modernization/hooks/reader/uplift.ts:52 — parseBaseline has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function pineCells (cyclomatic 32, cognitive 57) · ×1
  • Complex function pineCells (cyclomatic 32, cognitive 57) plugins/theme-examples/hooks/scenes/snow-pines.ts:103 — pineCells has cyclomatic complexity 32 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 32, cognitive 44) · ×1
  • Complex function (anonymous) (cyclomatic 32, cognitive 44) REDACTED:601 — (anonymous) has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleInbound (cyclomatic 30, cognitive 43) · ×1
  • Complex function handleInbound (cyclomatic 30, cognitive 43) REDACTED:778 — handleInbound has cyclomatic complexity 30 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function milkyWayCells (cyclomatic 29, cognitive 63) · ×1
  • Complex function milkyWayCells (cyclomatic 29, cognitive 63) plugins/theme-examples/hooks/scenes/braille-stars.ts:196 — milkyWayCells has cyclomatic complexity 29 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 29, cognitive 49) · ×1
  • Complex function (anonymous) (cyclomatic 29, cognitive 49) REDACTED:656 — (anonymous) has cyclomatic complexity 29 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 28, cognitive 26) · ×1
  • Complex function (anonymous) (cyclomatic 28, cognitive 26) plugins/code-modernization/hooks/register.ts:837 — (anonymous) has cyclomatic complexity 28 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function paint (cyclomatic 27, cognitive 49) · ×1
  • Complex function paint (cyclomatic 27, cognitive 49) plugins/code-modernization/hooks/map/estate.ts:189 — paint has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseVerification (cyclomatic 27, cognitive 35) · ×1
  • Complex function parseVerification (cyclomatic 27, cognitive 35) plugins/code-modernization/hooks/reader/verification.ts:73 — parseVerification has cyclomatic complexity 27 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseTopology (cyclomatic 26, cognitive 31) · ×1
  • Complex function parseTopology (cyclomatic 26, cognitive 31) plugins/code-modernization/hooks/reader/topology.ts:98 — parseTopology has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function planOf (cyclomatic 26, cognitive 27) · ×1
  • Complex function planOf (cyclomatic 26, cognitive 27) plugins/code-modernization/hooks/views/pane.tsx:542 — planOf has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function turtleCells (cyclomatic 25, cognitive 73) · ×1
  • Complex function turtleCells (cyclomatic 25, cognitive 73) plugins/theme-examples/hooks/scenes/honu-lagoon.ts:56 — turtleCells has cyclomatic complexity 25 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function cardOf (cyclomatic 25, cognitive 27) · ×1
  • Complex function cardOf (cyclomatic 25, cognitive 27) REDACTED:194 — cardOf has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function alphabet (cyclomatic 23, cognitive 39) · ×1
  • Complex function alphabet (cyclomatic 23, cognitive 39) plugins/theme-examples/hooks/scenes/departure-board.ts:85 — alphabet has cyclomatic complexity 23 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleInbound (cyclomatic 23, cognitive 32) · ×1
  • Complex function handleInbound (cyclomatic 23, cognitive 32) REDACTED:907 — handleInbound has cyclomatic complexity 23 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleUser (cyclomatic 23, cognitive 29) · ×1
  • Complex function handleUser (cyclomatic 23, cognitive 29) plugins/session-report/skills/session-report/analyze-sessions.mjs:420 — handleUser has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function islandCells (cyclomatic 22, cognitive 55) · ×1
  • Complex function islandCells (cyclomatic 22, cognitive 55) plugins/theme-examples/hooks/scenes/honu-lagoon.ts:134 — islandCells has cyclomatic complexity 22 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 22, cognitive 34) · ×1
  • Complex function (anonymous) (cyclomatic 22, cognitive 34) plugins/code-modernization/workflows/extract-rules.js:671 — (anonymous) has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function gate (cyclomatic 22, cognitive 33) · ×1
  • Complex function gate (cyclomatic 22, cognitive 33) REDACTED:236 — gate has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function nextOfTransform (cyclomatic 21, cognitive 34) · ×1
  • Complex function nextOfTransform (cyclomatic 21, cognitive 34) plugins/code-modernization/hooks/reader/progress.ts:273 — nextOfTransform has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function gate (cyclomatic 21, cognitive 29) · ×1
  • Complex function gate (cyclomatic 21, cognitive 29) REDACTED:236 — gate has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 21, cognitive 20) · ×1
  • Complex function (anonymous) (cyclomatic 21, cognitive 20) REDACTED:362 — (anonymous) has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function session (cyclomatic 20, cognitive 27) · ×1
  • Complex function session (cyclomatic 20, cognitive 27) plugins/code-modernization/hooks/views/pane.tsx:315 — session has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function handleInbound (cyclomatic 20, cognitive 26) · ×1
  • Complex function handleInbound (cyclomatic 20, cognitive 26) REDACTED:810 — handleInbound has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function directoryUnits (cyclomatic 20, cognitive 26) · ×1
  • Complex function directoryUnits (cyclomatic 20, cognitive 26) plugins/code-modernization/hooks/reader/discover.ts:235 — directoryUnits has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function (anonymous) (cyclomatic 20, cognitive 19) · ×1
  • Complex function (anonymous) (cyclomatic 20, cognitive 19) plugins/code-modernization/hooks/views/pane.tsx:267 — (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function gate (cyclomatic 19, cognitive 27) · ×1
  • Complex function gate (cyclomatic 19, cognitive 27) REDACTED:327 — gate has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function upliftXray (cyclomatic 19, cognitive 19) · ×1
  • Complex function upliftXray (cyclomatic 19, cognitive 19) plugins/code-modernization/hooks/xray/xray.ts:91 — upliftXray has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function fieldStars (cyclomatic 18, cognitive 44) · ×1
  • Complex function fieldStars (cyclomatic 18, cognitive 44) plugins/theme-examples/hooks/scenes/braille-stars.ts:256 — fieldStars has cyclomatic complexity 18 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function levelPath (cyclomatic 18, cognitive 29) · ×1
  • Complex function levelPath (cyclomatic 18, cognitive 29) plugins/theme-examples/hooks/scenes/dither-dunes.ts:181 — levelPath has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function parseLedger (cyclomatic 18, cognitive 19) · ×1
  • Complex function parseLedger (cyclomatic 18, cognitive 19) plugins/code-modernization/hooks/review/ledger.ts:24 — parseLedger has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function rowOf (cyclomatic 18, cognitive 17) · ×1
  • Complex function rowOf (cyclomatic 18, cognitive 17) REDACTED:288 — rowOf has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity · Complex function readTestsAt (cyclomatic 17, cognitive 30) · ×1
  • Complex function readTestsAt (cyclomatic 17, cognitive 30) REDACTED:157 — readTestsAt has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files · plugins/code-modernization/hooks/register.ts · ×1
  • plugins/code-modernization/hooks/register.ts: 1051 lines of code plugins/code-modernization/hooks/register.ts:1 — plugins/code-modernization/hooks/register.ts has 1051 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 959 lines of code REDACTED:1 — REDACTED has 959 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/theme-examples/hooks/register.tsx · ×1
  • plugins/theme-examples/hooks/register.tsx: 894 lines of code plugins/theme-examples/hooks/register.tsx:1 — plugins/theme-examples/hooks/register.tsx has 894 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/code-modernization/hooks/reader/progress.ts · ×1
  • plugins/code-modernization/hooks/reader/progress.ts: 832 lines of code plugins/code-modernization/hooks/reader/progress.ts:1 — plugins/code-modernization/hooks/reader/progress.ts has 832 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 826 lines of code REDACTED:1 — REDACTED has 826 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/code-modernization/workflows/extract-rules.js · ×1
  • plugins/code-modernization/workflows/extract-rules.js: 818 lines of code plugins/code-modernization/workflows/extract-rules.js:1 — plugins/code-modernization/workflows/extract-rules.js has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/session-report/skills/session-report/analyze-sessions.mjs · ×1
  • plugins/session-report/skills/session-report/analyze-sessions.mjs: 818 lines of code plugins/session-report/skills/session-report/analyze-sessions.mjs:1 — plugins/session-report/skills/session-report/analyze-sessions.mjs has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · REDACTED · ×1
  • REDACTED: 798 lines of code REDACTED:1 — REDACTED has 798 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/code-modernization/hooks/views/pane.tsx · ×1
  • plugins/code-modernization/hooks/views/pane.tsx: 588 lines of code plugins/code-modernization/hooks/views/pane.tsx:1 — plugins/code-modernization/hooks/views/pane.tsx has 588 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/theme-examples/hooks/scenes/koi-mosaic.ts · ×1
  • plugins/theme-examples/hooks/scenes/koi-mosaic.ts: 446 lines of code plugins/theme-examples/hooks/scenes/koi-mosaic.ts:1 — plugins/theme-examples/hooks/scenes/koi-mosaic.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/theme-examples/hooks/scenes/night-reef.ts · ×1
  • plugins/theme-examples/hooks/scenes/night-reef.ts: 430 lines of code plugins/theme-examples/hooks/scenes/night-reef.ts:1 — plugins/theme-examples/hooks/scenes/night-reef.ts has 430 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/theme-examples/hooks/scenes/paper-garden.ts · ×1
  • plugins/theme-examples/hooks/scenes/paper-garden.ts: 416 lines of code plugins/theme-examples/hooks/scenes/paper-garden.ts:1 — plugins/theme-examples/hooks/scenes/paper-garden.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files · plugins/theme-examples/hooks/scenes/braille-stars.ts · ×1
  • plugins/theme-examples/hooks/scenes/braille-stars.ts: 402 lines of code plugins/theme-examples/hooks/scenes/braille-stars.ts:1 — plugins/theme-examples/hooks/scenes/braille-stars.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R6 · Tooling · No test, lint or typecheck script · ×1
  • No test, lint or typecheck script — test ✗ · lint ✗ · typecheck ✗ — read from this repository's REDACTED scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
R7 · Dead Code · Dead file (~1298 LoC) · ×1
  • Dead file (~1298 LoC) plugins/code-modernization/hooks/register.ts — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~1076 LoC) · ×1
  • Dead file (~1076 LoC) plugins/theme-examples/hooks/register.tsx — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~865 LoC) · ×1
  • Dead file (~865 LoC) plugins/code-modernization/workflows/extract-rules.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~425 LoC) · ×1
  • Dead file (~425 LoC) plugins/code-modernization/workflows/uplift-migrate.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~296 LoC) · ×1
  • Dead file (~296 LoC) plugins/code-modernization/workflows/harden-scan.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~238 LoC) · ×1
  • Dead file (~238 LoC) plugins/theme-examples/hooks/project-key.ts — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (plugins/theme-examples/hooks/register.tsx) — every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it
R7 · Dead Code · Dead file (~232 LoC) · ×1
  • Dead file (~232 LoC) plugins/code-modernization/workflows/uplift-deltas.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~110 LoC) · ×1
  • Dead file (~110 LoC) plugins/code-modernization/workflows/portfolio-assess.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
R7 · Dead Code · Dead file (~103 LoC) · ×1
  • Dead file (~103 LoC) plugins/code-modernization/workflows/reimagine-scaffold.js — no import path from any entry point (8 application, 7 tooling, 10 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
X2 · Cancellation propagation · Async function without AbortSignal · ×1
  • Async function without AbortSignal: downloadAttachment REDACTED:418 — `downloadAttachment` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Minor — 55 finding(s)
X10 · Duplicated predicate · Duplicated predicate · ×14
  • Duplicated predicate plugins/code-modernization/hooks/review/deck.ts:17 — `rule.confidence !== undefined && rule.confidence !== 'High'` appears character-identically in 2 files — plugins/code-modernization/hooks/review/deck.ts, plugins/code-modernization/hooks/xray/xray.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/hooks/reader/topology.ts:52 — `typeof value === 'object' && value !== null && !Array.isArray(value)` appears character-identically in 3 files — plugins/code-modernization/hooks/reader/topology.ts, plugins/code-modernization/hooks/reader/verification.ts, plugins/code-modernization/hooks/review/ledger.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/hooks/reader/estate-model.ts:203 — `unit.dir !== undefined && unit.dir !== ''` appears character-identically in 2 files — plugins/code-modernization/hooks/reader/estate-model.ts, plugins/code-modernization/hooks/register.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/hookify/hooks/posttooluse.py:14 — `PLUGIN_ROOT and PLUGIN_ROOT not in sys.path` appears character-identically in 4 files — plugins/hookify/hooks/posttooluse.py, plugins/hookify/hooks/pretooluse.py, plugins/hookify/hooks/stop.py, plugins/hookify/hooks/userpromptsubmit.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py:1917 — `fr["days_old"] is not None and fr["days_old"] > 1` appears character-identically in 2 files — plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/pulse_compute.py, plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/build_report.py:569 — `isinstance(reviews, dict) and isinstance(reviews.get("reviews"), dict)` appears character-identically in 2 files — plugins/code-modernization/scripts/build_report.py, plugins/code-modernization/scripts/telemetry.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/build_report.py:337 — `isinstance(value, int) and not isinstance(value, bool) and 0 <= value <= 10 ** 9` appears character-identically in 2 files — plugins/code-modernization/scripts/build_report.py, plugins/code-modernization/scripts/proof_pack.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/baseline_diff.py:119 — `j < len(lines) and "|" in lines[j] and lines[j].strip()` appears character-identically in 2 files — plugins/code-modernization/scripts/baseline_diff.py, plugins/code-modernization/scripts/build_report.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/build_report.py:701 — `not args.system or args.system in (".", "..") or re.search(r"[\\/\x00]", args.system)` appears character-identically in 2 files — plugins/code-modernization/scripts/build_report.py, plugins/code-modernization/scripts/trace_rules.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/security-guidance/hooks/gitutil.py:2164 — `not diff_output or not diff_output.strip()` appears character-identically in 2 files — plugins/security-guidance/hooks/gitutil.py, plugins/security-guidance/hooks/security_reminder_hook.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/claude-security/scripts/patch_artifacts.py:895 — `not is_str(prefix) or not scan_prefix_shaped(prefix)` appears character-identically in 2 files — plugins/claude-security/scripts/patch_artifacts.py, plugins/claude-security/scripts/render_report.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/proof_pack.py:124 — `os.path.isfile(path) and not os.path.islink(path)` appears character-identically in 2 files — plugins/code-modernization/scripts/proof_pack.py, plugins/code-modernization/scripts/telemetry.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/security-guidance/hooks/diffstate.py:262 — `rel == os.pardir or rel.startswith(os.pardir + os.sep)` appears character-identically in 2 files — plugins/security-guidance/hooks/diffstate.py, plugins/security-guidance/hooks/extensibility.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate plugins/code-modernization/scripts/baseline_diff.py:91 — `s.endswith("|") and not s.endswith("\\|")` appears character-identically in 2 files — plugins/code-modernization/scripts/baseline_diff.py, plugins/code-modernization/scripts/build_report.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×10
  • Hand-rolled JSON/XML parsing via regex plugins/skill-creator/skills/skill-creator/scripts/improve_description.py:146 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/skill-creator/skills/skill-creator/scripts/improve_description.py:175 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/code-modernization/scripts/baseline_diff.py:384 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/code-modernization/scripts/build_report.py:665 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:650 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:657 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:687 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:796 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:797 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex plugins/claude-for-manufacturing/skills/morning-plant-pulse/scripts/render_short.py:799 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×8
  • Silent fallback default on parse failure plugins/claude-security/hooks/hooks.py:101 — `parse` returns `{}` when `(ValueError, RecursionError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure plugins/code-modernization/scripts/telemetry.py:190 — `whole` returns `0` when `(TypeError, ValueError, OverflowError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure plugins/code-modernization/scripts/telemetry.py:199 — `plugin_version` returns `0` when `(OSError, ValueError, KeyError, TypeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure plugins/code-modernization/scripts/telemetry.py:212 — `inside` returns `False` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure plugins/security-guidance/hooks/_base.py:424 — `launcher_probe_metrics` returns `{}` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure REDACTED:240 — `_encode_rc` returns `0` when `(ValueError, IndexError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure REDACTED:348 — `_encode_errno` returns `0` when `(ValueError, IndexError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure plugins/security-guidance/hooks/gitutil.py:184 — `on_windows_drive` returns `False` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
X7 · Silent fallback defaults · Silent fallback default in catch · ×7
  • Silent fallback default in catch REDACTED:697 — `_plugin_version_int` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch REDACTED:454 — `_net_error_code` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch plugins/security-guidance/hooks/reporesolve.py:66 — `_tokenize` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch plugins/code-modernization/hooks/reader/fs.ts:39 — `listOrEmpty` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch REDACTED:148 — `changedAt` swallows every exception into `return 0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch plugins/code-modernization/hooks/review/ledger.ts:33 — `parseLedger` swallows every exception into `return {}` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch plugins/receipts/skills/receipts/scripts/mine-transcripts.mjs:807 — `gitCommitsWithOurWork` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 19 significant file(s) lose their only recent owner: plugins/code-modernization/scripts/proof_pack.py, plugins/code-modernization/scripts/build_report.py, plugins/code-modernization/scripts/baseline_diff.py, plugins/code-modernization/hooks/register.ts, plugins/code-modernization/scripts/telemetry.py, plugins/code-modernization/hooks/reader/progress.ts, plugins/code-modernization/scripts/trace_rules.py, plugins/code-modernization/hooks/views/pane.tsx (+11 more). Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (22 single-owned of 90 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 90 of the 113 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: REDACTED, plugins/security-guidance/hooks/session_state.py, plugins/math-proof/skills/siege/scripts/ledger.py.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — `(repository root)` (24250 LoC, 111 module-visible types across 12 directories) overshoots its size bounds. 1 of 6 build unit(s) (checkout, npm, tsc) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:12 — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 7 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation REDACTED:10 — `REDACTED` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
P6 · Release Hygiene · Changelog looks stale/thin · ×1
  • Changelog looks stale/thin — The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
R7 · Dead Code · Unused export 'isSourceFile' · ×1
  • Unused export 'isSourceFile' plugins/code-modernization/hooks/reader/estate-model.ts:114 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'readModernized' · ×1
  • Unused export 'readModernized' REDACTED:361 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused export 'DECK_ID' · ×1
  • Unused export 'DECK_ID' plugins/code-modernization/hooks/state.ts:13 — Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code · Unused module-local declaration 'under' · ×1
  • Unused module-local declaration 'under' plugins/code-modernization/hooks/reader/discover.ts:177 — This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
X2 · Cancellation propagation · Not all async functions that make a request accept an AbortSignal · ×1
  • Not all async functions that make a request accept an AbortSignal — Only 0/1 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X5 · Nullable reference types · Null assertions (`!`) override strict null checking · ×1
  • Null assertions (`!`) override strict null checking — ~1.5 `!` null assertions per 1k TypeScript source lines — 16 assertion(s) across the 10696 source line(s) of the 31 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: REDACTED (10), REDACTED (3), REDACTED (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Minor — 5 finding(s)
D12 · Dependency Hygiene · Outdated (npm) · ×4
  • Outdated (npm): @modelcontextprotocol/sdk — @modelcontextprotocol/sdk is pinned at 1.27.1; registry.npmjs.org publishes 1.32.2 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): discord.js — discord.js is pinned at 14.25.1; registry.npmjs.org publishes 14.28.1 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): grammy — grammy is pinned at 1.41.1; registry.npmjs.org publishes 1.46.0 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
  • Outdated (npm): zod — zod is pinned at 3.25.76; registry.npmjs.org publishes 4.6.7 as the latest release. Upgrading is a judgement call — read that package's changelog for what changed between the two — but a direct production dependency several releases behind is where security and compatibility debt accumulates silently.
D24 · Comment Value · doc comments repeat the names · ×1
  • doc comments repeat the names plugins/code-modernization/hooks/reader/brief.ts:65 — 0 of 13 documented parameters and 1 of 646 summaries in `.` only repeat the member or parameter name (e.g. "Parses the brief." for `parseBrief`). Delete the restating tags, or add what the name does not say.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-756dd472f7354f73b463345a60092a29/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-756dd472f7354f73b463345a60092a29/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=3200" --report-format json --report-path /tmp/watchdog-gitleaks-756dd472f7354f73b463345a60092a29/history-2.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=629" --report-format json --report-path /tmp/watchdog-gitleaks-756dd472f7354f73b463345a60092a29/history-3.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-3.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-756dd472f7354f73b463345a60092a29/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .28artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .78artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1e083-61fd-7fbc-9788-63c2a794d9a6 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md