Public report of alirezarezvani/claude-skills, published 20 October 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 reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog 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, 20 October 2026, 19:07 UTC · Survey ID cd_6d6ee2a6f3e242a9b18934db0bceb7b6
alirezarezvani/claude-skills
Measured 20 October 2026, 18:48 UTC, at code version 19392f7
Test reliability is not measured: A declared JavaScript/TypeScript suite contains no test files.
CAI scoreAt riskDown 7 since the last survey
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 large codebase: 239,340 lines of product code in 21 projects, tests not counted · Estimated rebuild effort: about 1.4 person-years · Weakest lens: Code Health, 29
Findings by how serious they are
153 critical2055 serious153 minor
4 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks 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
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
20 October 2026, 18:48 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 Watchdog. It is open to any tool that
implements it, and today Watchdog 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. Watchdog works 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 ▸
80of 85 dimensions measured by tools. The other 5 are advisory notes from an AI model, which explain the code but don't count towards the score.
2343of 2361 findings point to an exact file and line, so you can open each one in the code. The other 18 concern the repository as a whole, such as missing documentation.
85dimensions across 7 lenses, read from 239,340 lines of product code in 21 projects.
alirezarezvani/claude-skills scores 41 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.
The weakest lens counts most in the score, and here that is Code Health, which scores 29 and is rated Weak. Its Cyclomatic Complexity dimension scores 0 out of 10, and until that reaches 4, Code Health can't be rated higher than Adequate. The first actions are to break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5 and to resolve the 20 Leaked secret finding(s) in REDACTED Scanning, and if Code Health rose to 70, the score would rise from 41 to about 50.
153 findings are critical: 64 in Static Analysis (SAST), 41 in Knowledge Freshness, 20 in REDACTED Scanning, eight in Forms & labels, eight in Keyboard semantics, five in Dependency Vulnerabilities, four in Text alternatives, one in Dependency Hygiene, one in Secrets (history) and one in Test Reliability.
Watchdog couldn't measure 4 dimensions in this code, among them Internal API Consistency, Navigability and Collection changed while being enumerated, so they are left out of the score. The product code is 239,340 lines, which would take an estimated 1.4 person-years, around €200,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 forThe 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.
Visual & motion safety · Animation without a prefers-reduced-motion guard docs/stylesheets/extra.css
Visual & motion safety · Animation without a prefers-reduced-motion guard docs/stylesheets/extra.css
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 2 findings
These 2 critical or serious findings were in the previous survey, on 4 October 2026, and are gone from this one.
Dependency Vulnerabilities · Medium CVE: PYSEC-2026-2132 REDACTED
Supply-chain Provenance & Signing REDACTED
Rebuild cost: about €200,000 · Estimate
Cost to rebuild
€67,000 to €330,000, for 1,111 to 3,524 hours of work, about 1.4 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, 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 41. 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.
Size
Large: 239,340 lines of product code
Comment lines
The estimate prices 233,835 lines. Comment lines count towards the size of 239,340 lines but aren't priced as work.
How the estimate is made: Watchdog prices 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.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
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 €200,000 to build again, about 1.4 person-years of work. Its weakest lens is Code Health, at 29 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5. Of all the actions in this report, it raises the score most for the work it takes: about 5 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 6.3 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 4% to 10% on every change. The history of the code shows how much it changes: about 144,920 lines over the last 90 days, which is about 587,731 lines a year. At that pace, the extra work comes to an estimated 64.2 to 384.9 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 Watchdog's 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; 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.
532 modules, with 97 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; 492 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.
2 pairs of types, where a type in business-operations.skills.capacity-planner.scripts uses a type in business-operations.skills.capacity-planner.scripts.capacity_modeler.
business-operations.skills.capacity-planner.scripts uses business-operations.skills.capacity-planner.scripts.capacity_modeler, so a change to business-operations.skills.capacity-planner.scripts.capacity_modeler can break business-operations.skills.capacity-planner.scripts, while a change to business-operations.skills.capacity-planner.scripts can't break business-operations.skills.capacity-planner.scripts.capacity_modeler.
Position
Below the diagonal: business-operations.skills.capacity-planner.scripts uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in business-operations.skills.capacity-planner.scripts uses a type in business-operations.skills.capacity-planner.scripts.hiring_sequencer.
business-operations.skills.capacity-planner.scripts uses business-operations.skills.capacity-planner.scripts.hiring_sequencer, so a change to business-operations.skills.capacity-planner.scripts.hiring_sequencer can break business-operations.skills.capacity-planner.scripts, while a change to business-operations.skills.capacity-planner.scripts can't break business-operations.skills.capacity-planner.scripts.hiring_sequencer.
Position
Below the diagonal: business-operations.skills.capacity-planner.scripts uses a module listed above it, which is the healthy direction.
3 pairs of types, where a type in business-operations.skills.capacity-planner.scripts uses a type in business-operations.skills.capacity-planner.scripts.utilization_analyzer.
business-operations.skills.capacity-planner.scripts uses business-operations.skills.capacity-planner.scripts.utilization_analyzer, so a change to business-operations.skills.capacity-planner.scripts.utilization_analyzer can break business-operations.skills.capacity-planner.scripts, while a change to business-operations.skills.capacity-planner.scripts can't break business-operations.skills.capacity-planner.scripts.utilization_analyzer.
Position
Below the diagonal: business-operations.skills.capacity-planner.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.internal-comms.scripts uses a type in business-operations.skills.internal-comms.scripts.change_announcement_builder.
business-operations.skills.internal-comms.scripts uses business-operations.skills.internal-comms.scripts.change_announcement_builder, so a change to business-operations.skills.internal-comms.scripts.change_announcement_builder can break business-operations.skills.internal-comms.scripts, while a change to business-operations.skills.internal-comms.scripts can't break business-operations.skills.internal-comms.scripts.change_announcement_builder.
Position
Below the diagonal: business-operations.skills.internal-comms.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.internal-comms.scripts uses a type in business-operations.skills.internal-comms.scripts.comms_calendar_builder.
business-operations.skills.internal-comms.scripts uses business-operations.skills.internal-comms.scripts.comms_calendar_builder, so a change to business-operations.skills.internal-comms.scripts.comms_calendar_builder can break business-operations.skills.internal-comms.scripts, while a change to business-operations.skills.internal-comms.scripts can't break business-operations.skills.internal-comms.scripts.comms_calendar_builder.
Position
Below the diagonal: business-operations.skills.internal-comms.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.internal-comms.scripts uses a type in business-operations.skills.internal-comms.scripts.comms_template_filler.
business-operations.skills.internal-comms.scripts uses business-operations.skills.internal-comms.scripts.comms_template_filler, so a change to business-operations.skills.internal-comms.scripts.comms_template_filler can break business-operations.skills.internal-comms.scripts, while a change to business-operations.skills.internal-comms.scripts can't break business-operations.skills.internal-comms.scripts.comms_template_filler.
Position
Below the diagonal: business-operations.skills.internal-comms.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.knowledge-ops.scripts uses a type in business-operations.skills.knowledge-ops.scripts.runbook_validator.
business-operations.skills.knowledge-ops.scripts uses business-operations.skills.knowledge-ops.scripts.runbook_validator, so a change to business-operations.skills.knowledge-ops.scripts.runbook_validator can break business-operations.skills.knowledge-ops.scripts, while a change to business-operations.skills.knowledge-ops.scripts can't break business-operations.skills.knowledge-ops.scripts.runbook_validator.
Position
Below the diagonal: business-operations.skills.knowledge-ops.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.knowledge-ops.scripts uses a type in business-operations.skills.knowledge-ops.scripts.sop_generator.
business-operations.skills.knowledge-ops.scripts uses business-operations.skills.knowledge-ops.scripts.sop_generator, so a change to business-operations.skills.knowledge-ops.scripts.sop_generator can break business-operations.skills.knowledge-ops.scripts, while a change to business-operations.skills.knowledge-ops.scripts can't break business-operations.skills.knowledge-ops.scripts.sop_generator.
Position
Below the diagonal: business-operations.skills.knowledge-ops.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.process-mapper.scripts uses a type in business-operations.skills.process-mapper.scripts.cycle_time_analyzer.
business-operations.skills.process-mapper.scripts uses business-operations.skills.process-mapper.scripts.cycle_time_analyzer, so a change to business-operations.skills.process-mapper.scripts.cycle_time_analyzer can break business-operations.skills.process-mapper.scripts, while a change to business-operations.skills.process-mapper.scripts can't break business-operations.skills.process-mapper.scripts.cycle_time_analyzer.
Position
Below the diagonal: business-operations.skills.process-mapper.scripts uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in business-operations.skills.procurement-optimizer.scripts uses a type in business-operations.skills.procurement-optimizer.scripts.spend_categorizer.
business-operations.skills.procurement-optimizer.scripts uses business-operations.skills.procurement-optimizer.scripts.spend_categorizer, so a change to business-operations.skills.procurement-optimizer.scripts.spend_categorizer can break business-operations.skills.procurement-optimizer.scripts, while a change to business-operations.skills.procurement-optimizer.scripts can't break business-operations.skills.procurement-optimizer.scripts.spend_categorizer.
Position
Below the diagonal: business-operations.skills.procurement-optimizer.scripts uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in business-operations.skills.procurement-optimizer.scripts uses a type in business-operations.skills.procurement-optimizer.scripts.supplier_consolidation.
business-operations.skills.procurement-optimizer.scripts uses business-operations.skills.procurement-optimizer.scripts.supplier_consolidation, so a change to business-operations.skills.procurement-optimizer.scripts.supplier_consolidation can break business-operations.skills.procurement-optimizer.scripts, while a change to business-operations.skills.procurement-optimizer.scripts can't break business-operations.skills.procurement-optimizer.scripts.supplier_consolidation.
Position
Below the diagonal: business-operations.skills.procurement-optimizer.scripts uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep.backend uses engineering.skillopt-sleep.skillopt_sleep.types, so a change to engineering.skillopt-sleep.skillopt_sleep.types can break engineering.skillopt-sleep.skillopt_sleep.backend, while a change to engineering.skillopt-sleep.skillopt_sleep.backend can't break engineering.skillopt-sleep.skillopt_sleep.types.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep.backend uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep.cycle uses engineering.skillopt-sleep.skillopt_sleep.types, so a change to engineering.skillopt-sleep.skillopt_sleep.types can break engineering.skillopt-sleep.skillopt_sleep.cycle, while a change to engineering.skillopt-sleep.skillopt_sleep.cycle can't break engineering.skillopt-sleep.skillopt_sleep.types.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep.cycle uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep.rollout uses engineering.skillopt-sleep.skillopt_sleep.types, so a change to engineering.skillopt-sleep.skillopt_sleep.types can break engineering.skillopt-sleep.skillopt_sleep.rollout, while a change to engineering.skillopt-sleep.skillopt_sleep.rollout can't break engineering.skillopt-sleep.skillopt_sleep.types.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep.rollout uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep uses engineering.skillopt-sleep.skillopt_sleep.types, so a change to engineering.skillopt-sleep.skillopt_sleep.types can break engineering.skillopt-sleep.skillopt_sleep, while a change to engineering.skillopt-sleep.skillopt_sleep can't break engineering.skillopt-sleep.skillopt_sleep.types.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep uses engineering.skillopt-sleep.skillopt_sleep.backend, so a change to engineering.skillopt-sleep.skillopt_sleep.backend can break engineering.skillopt-sleep.skillopt_sleep, while a change to engineering.skillopt-sleep.skillopt_sleep can't break engineering.skillopt-sleep.skillopt_sleep.backend.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep uses engineering.skillopt-sleep.skillopt_sleep.cycle, so a change to engineering.skillopt-sleep.skillopt_sleep.cycle can break engineering.skillopt-sleep.skillopt_sleep, while a change to engineering.skillopt-sleep.skillopt_sleep can't break engineering.skillopt-sleep.skillopt_sleep.cycle.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep uses a module listed above it, which is the healthy direction.
engineering.skillopt-sleep.skillopt_sleep uses engineering.skillopt-sleep.skillopt_sleep.rollout, so a change to engineering.skillopt-sleep.skillopt_sleep.rollout can break engineering.skillopt-sleep.skillopt_sleep, while a change to engineering.skillopt-sleep.skillopt_sleep can't break engineering.skillopt-sleep.skillopt_sleep.rollout.
Position
Below the diagonal: engineering.skillopt-sleep.skillopt_sleep uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 29% · Weak · gated by D2, R1, R2, X1, X3, X5 ·
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 category
Findings
Severity
A05:2025 — Injection
76
High / Critical
A07:2025 — Authentication Failures
22
High / Critical
A03:2025 — Software Supply Chain Failures
18
High / Critical
Roadmap
First, reduce cyclomatic complexity by breaking down branch-heavy functions to improve maintainability. Next, immediately resolve the 20 leaked secrets, prioritizing the identified high-risk files, and ensure all custom controls are fully keyboard-operable with proper semantic attributes. Finally, enable nullable reference types across all files to eliminate warnings and update the documentation to accurately reflect the current project structure and dependencies.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.
Reconcile the README with reality: INSTALLATION.md names `.github/skills/`, but no file or folder `.github/skills` exists; README.md links to `Hermes`, but `Hermes` does not exist; README.md links to `Mistral`, but `Mistral` does not exist; README.md names `engineering/git-worktree-manager`, but no file or folder `engineering/git-worktree-manager` exists; README.md names `engineering/mcp-server-builder`, but no file or folder `engineering/mcp-server-builder` exists.
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
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.
Bring the 24 bodies over 60 down to 60 or less in Cognitive Complexity — start with generate-docs.main (cognitive 176), collect_sessions.parse_claude_session (cognitive 101), threat_signal_analyzer.main (cognitive 93).
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 — 153
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 — 2055
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 — 153
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 4
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
Watchdog 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. 80 of 85 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three 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; ◐ Advisory — an LLM prose judgement. 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; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 85 dimensions across the health lenses
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
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, 2343 of 2361 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.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
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.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
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.
D11 Test Reliability — not measured this run — Watchdog 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 scored — the JavaScript/TypeScript suite (jest via `npm install --ignore-scripts` (no lockfile) in engineering/skills/dependency-auditor/test-project/ (0 tests)) ran but surfaced no test cases to the runner, so flakiness couldn't be exercised.
D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 4 shipped Python distribution(s) across 2 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (48 contributor(s) across 1499 commit(s) sampled, automation and bot accounts excluded). One of them holds 86% of the history; the other 47 hold 0.3% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — Watchdog 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.
D27 Navigability — not measured this run — Watchdog 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AXR1 Runtime accessibility — not measured this run — Watchdog 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 (dev). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
M3 Folder & project structure — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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. Whether the tests sit apart from production code is not visible here, because the suite is not in a form this pass reads. The test-separation credit is granted rather than withheld: this is a gap in the analyzer's language coverage, not a finding about the repository's tests. You can widen what we reach: keep the test surface somewhere a reader can find it without opening a binary — an exported/checked-in test source tree beside the production code makes the suite reviewable, diffable and discoverable by tooling.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it 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. 138 further occurrence(s) are not listed individually; the score already reflects all 178.
X27 Collection changed while being enumerated — not measured this run — Watchdog 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 repository's C# was parsed (it ships no .sln or .csproj, so it was read as syntax-only projects), but this check proves its findings from resolved symbols and a reference-free parse resolves none. It abstained rather than report a clean bill it could not earn. That is a gap in this analyzer's reach into build-less repositories — 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
Watchdog assesses the repository exactly as committed, and only the repository. By design it does 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.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D13 REDACTED Scanning: REDACTED 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.
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 is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D25 ADR Conformance: ADR conformance is the LLM-scored fraction of sampled code that follows recorded decisions — it checks the decisions that were written down and the slices it sampled, not unrecorded rules or the whole tree.
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.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
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.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
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: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
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.
The LLM boundary
LLM-set scores this run (5): D19, D20, D21, D25, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
297 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was generate-docs.main at 74. A further 2 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being EcosystemAnalyzer._score_github_health at 18 — they are counted neither in the figure above nor in this dimension's score.
+ 286 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with generate-docs.main (cyclomatic 74). — Refactoring it lifts Cyclomatic Complexity from 5.0 to about 5.4/10.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 648 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 24 bodies over 60 down to 60 or less in Cognitive Complexity — start with generate-docs.main (cognitive 176), collect_sessions.parse_claude_session (cognitive 101), threat_signal_analyzer.main (cognitive 93). — 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 24 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.
Do you agree with this assessment?
D3 · God Classes8.8 / 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.
Resolve the 56 FileTooLong finding(s) in God Classes — start with architecture_designer.py (2), ratios.py, score.py. — One of this dimension's main actionable groups (56 warning-level).
Resolve the 7 TooManyMethods finding(s) in God Classes — start with pir_generator.py, ratios.py, api_scorecard.py. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 2 FunctionTooLong finding(s) in God Classes — start with full-page-screenshot.mjs (2). — One of this dimension's main actionable groups (2 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
830 duplicated block group(s) detected. A further 73 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 3 of the 903 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 254 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 65 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with ratios.py (3), brand_palette_validator.py (3), citation_tracker.py (3). — One of this dimension's main actionable groups (65 warning-level).
Resolve the 48 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with api_linter.py (3), schema_analyzer.py (3), crd_validator.py (2). — One of this dimension's main actionable groups (48 warning-level).
Resolve the 48 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with ship_gate_scanner.py (2), aims_gap_analyzer.py (2), citation_tracker.py (2). — One of this dimension's main actionable groups (48 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
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.
21 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.
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.
Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with sample_csharp_clean.cs, launch_checklist.py, localization_helper.py. — One of this dimension's main actionable groups (4 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
All 14 mechanizable ADR(s) are enforced: 4 by analyzers, 10 by tests. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
Line coverage 100.0% — read from a lcov report present in the working tree (.codex/skills/tdd-guide/assets/sample_coverage_report.lcov), which git does not track, so it was produced by a run outside this scan (a CI coverage step is the usual source). The in-image collector has no runner for this repository's ecosystem, so this is your own measurement rather than a fresh in-image one.
Coverage read from a report in the working tree
✓ On the Gold path — maintain.
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
53 test methods: 53 unit, 0 integration, 0 BDD, 0 e2e. The Python suite contributes 53 test function(s) across 1 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
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.
Resolve the 20 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (8), REDACTED (4), REDACTED (4). — One of this dimension's main actionable groups (20 issue-level).
Enforce REDACTED Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
0 of 35 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 4 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (31 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 1 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged.
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.
Top hotspots: engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py (16×32=512); scripts/generate-docs.py (4×74=296); scripts/derive_counters.py (13×18=234) Repeated repair below the complexity floor: engineering/skillopt-sleep/skillopt_sleep/staging.py (6 of 6 changes were fixes); productivity/meetings/skills/meetings/scripts/action_item_extractor.py (4 of 5 changes were fixes); engineering/skillopt-sleep/skillopt_sleep/scheduler.py (4 of 4 changes were fixes)
Resolve the 10 Hotspot finding(s) in Churn × Complexity Hotspots — start with validate_examples.py, generate-docs.py, derive_counters.py. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 4 Repeated repair finding(s) in Churn × Complexity Hotspots — start with staging.py, action_item_extractor.py, scheduler.py. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
19 deducted task-comment markers across 237246 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.
Resolve the 12 TodoComment finding(s) in Explicit Debt — start with test_generator.py (4), user_service.py (3), payment_processor.py (3). — One of this dimension's main actionable groups (12 warning-level).
Resolve the 3 FixmeComment finding(s) in Explicit Debt — start with payment_processor.py (2), user_service.py. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 HackComment finding(s) in Explicit Debt — start with user_service.py, payment_processor.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is a comprehensive overview of the project — it names and describes 388 Claude Code skills/plugins for 13 AI coding tools (including Gemini CLI, Cursor, Mistral Vibe), lists supported agents, and shows an installation-by-example flow. The agent-launcher/README documents that directory (agent-launcher) rather than the repository as a whole; each of its own READMEs is focused on one subdirectory and describes what it contains without mentioning the root project's overview, installation, or licensing. All 215 README files are present and well-structured with clear headings. A well-structured README set for the personas/ and c-level-advisor directories. Each persona README is a focused document of its own directory (e.g., startup-cto.md for the CTO persona), covering identity/memory, core mission, critical rules, workflows, communication style, success metrics, advanced capabilities, learning/memories, plus usage examples and an available-personas table comparing it to task agents. The c-level-advisor READMEs are similarly focused on their own directories (arquiteto-de-empresa, chief-customer-officer-advisor) with dual-publishing notes and skill mirroring. All four persona READMEs open with a paragraph under the title that states what the project is or does — the What's a Persona? section — so an overview judgment applies to each of them. (7 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
Evaluated 33 ADR(s) individually; mean quality 9.2/10 (consistently complete and clear). 1 flagged with a specific gap.
No context/problem and no consequences/trade-offs sections for living documentation (updates in same PR, remove outdated info), despite informative titlestandards/documentation/documentation-standards.md
What to do
Resolve the 1 No context/problem and no consequences/trade-offs sections for living… finding(s) in ADR Quality — start with documentation-standards.md. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
What it measures: Whether the code actually follows the decisions recorded in the project's ADRs.
Method: Judged by language model at low temperature against ADRs plus a deterministic structural code summary; findings linked to repo-rooted ADR paths for traceability. Advisory.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED 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.
1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
77 finding(s): 0 critical, 64 high, 8 medium, 5 low. 40 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 4 file(s) — `docs/overrides/404.html` (lines 1–3, line 19), `docs/overrides/main.html` (lines 1–3, line 13, line 37, …), `docs/overrides/partials/copyright.html` (lines 1–9, line 33), `markdown-html/skills/md-review/assets/md_review_template.html` (line 62) — 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. Separately, one or more rules could not re-parse an embedded snippet in 8 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 9 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
No action in Static Analysis (SAST) — all 40 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 (40 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 7 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (7). — One of this dimension's main actionable groups (7 warning-level).
Resolve the 3 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 2 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
76 of 728 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is engineering-team/skills/incident-commander/scripts/pir_generator.py. Counted over 728 of the 752 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 41 Orphaned knowledge finding(s) in Knowledge Freshness — start with pir_generator.py, hiring_calibrator.py, question_bank_generator.py. — One of this dimension's main actionable groups (41 issue-level).
Resolve the 35 Orphaned file finding(s) in Knowledge Freshness — start with tf_security_scanner.py, root_cause_analyzer.py, hypothesis_tester.py. — One of this dimension's main actionable groups (35 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
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. Scored 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. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 0 platform declaration(s) and 4 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives4.8 / 10Weak✓ 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.
An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative. (×4) — .codex/skills/a11y-audit/assets/sample-component.tsx:7, .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:7, .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:7, …
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.
Do you agree with this assessment?
AC2 · Forms & labels5.3 / 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 only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label. (×8) — .codex/skills/a11y-audit/assets/sample-component.tsx:16, .codex/skills/a11y-audit/assets/sample-component.tsx:24, .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:16, …
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.
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.
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×4) — .codex/skills/a11y-audit/assets/sample-component.tsx:34, .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:34, .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:34, …
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×8) — .codex/skills/md-review/assets/md_review_template.html:11, .codex/skills/md-slides/assets/md_slides_template.html:11, .hermes/skills/claude-skills/markdown-html/md-review/assets/md_review_template.html:11, …
Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×4) — .codex/skills/md-slides/assets/md_slides_template.html:72, .hermes/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:72, .vibe/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:72, …
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.
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 click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. (×8) — .codex/skills/a11y-audit/assets/sample-component.tsx:6, .codex/skills/a11y-audit/assets/sample-component.tsx:11, .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:6, …
A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM). (×4) — .codex/skills/a11y-audit/assets/sample-component.tsx:25, .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:25, .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:25, …
An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action. (×4) — .codex/skills/md-slides/assets/md_slides_template.html:84, .hermes/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:84, .vibe/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:84, …
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
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.
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.
`.md-typeset .md-button--primary` moves (`transition: transform 0.12s ease, box-shadow 0.18s ease, filter 0.18s ease`) 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. — docs/stylesheets/extra.css:216
`.md-typeset .md-button:not(.md-button--primary)` moves (`transition: background-color 0.15s ease, border-color 0.15s ease, transform 0.12s ease`) 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. — docs/stylesheets/extra.css:245
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.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 21 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
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.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
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.
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.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`HandleClick` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — REDACTED:25
What to do
Remove the dead code that still moves this score: delete dead if(false) / #if false branches and either do the real async work or drop the async keyword from fake-async methods.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
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.
Add a README to the 8 of 8 project(s) that lack one — worth up to 2 pts.
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.
35 ADR-shaped document(s) detected by content — `.codex/skills/cdo-review/SKILL.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_cost_economics.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_risk_governance.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_team_org_evolution.md`, `.codex/skills/chief-ai-officer-advisor/references/model_buildvsbuy_strategy.md`, `.codex/skills/chief-customer-officer-advisor/references/cs_coverage_model.md`, `.codex/skills/chief-customer-officer-advisor/references/cs_team_org_evolution.md`, `.codex/skills/chief-customer-officer-advisor/references/customer_segmentation_strategy.md`, `.codex/skills/chief-customer-officer-advisor/references/retention_decomposition.md`, `.codex/skills/chief-data-officer-advisor/references/ai_training_data_rights.md`, `.codex/skills/chief-data-officer-advisor/references/customer_data_as_asset.md`, `.codex/skills/chief-data-officer-advisor/references/data_product_strategy.md`, `.codex/skills/chief-data-officer-advisor/references/data_team_org_evolution.md`, `.codex/skills/chief-of-staff/SKILL.md`, `.codex/skills/collab-proof/references/session-documentation-patterns.md`, `.codex/skills/confluence-expert/references/templates.md`, `.codex/skills/cto-advisor/references/architecture_decision_records.md`, `.codex/skills/decide/SKILL.md`, `.codex/skills/freeze/SKILL.md`, `.codex/skills/tech-debt-tracker/references/stakeholder-communication-templates.md`, `.codex/skills/vpe-advisor/references/delivery_throughput.md`, `.codex/skills/vpe-advisor/references/eng_team_structure.md`, `.codex/skills/vpe-advisor/references/engineering_hiring_funnel.md`, `.codex/skills/vpe-advisor/references/production_discipline.md`, `compliance-os/agents/cs-fda-qsr-auditor.md`, `docs/agents/cs-fda-qsr-auditor.md`, `docs/agents/cs-handoff-author.md`, `docs/agents/hub-coordinator.md`, `docs/skills/c-level-advisor/c-level-agents-cdo-review.md`, `docs/skills/c-level-advisor/c-level-agents-decide.md`, `docs/skills/c-level-advisor/c-level-agents-freeze.md`, `docs/skills/c-level-advisor/chief-of-staff.md`, `engineering/agenthub/agents/hub-coordinator.md`, `engineering/handoff/agents/cs-handoff-author.md`, `standards/documentation/documentation-standards.md`. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live — so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here.
What to do
Move ADRs under docs/adr/ (or docs/adrs/) and name them NNNN-title.md so they're easy to find.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
INSTALLATION.md names `.github/skills/`, but no file or folder `.github/skills` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — INSTALLATION.md:193
README.md links to `Hermes`, but `Hermes` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:9
README.md links to `Mistral`, but `Mistral` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:10
README.md names `engineering/git-worktree-manager`, but no file or folder `engineering/git-worktree-manager` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:280
README.md names `engineering/mcp-server-builder`, but no file or folder `engineering/mcp-server-builder` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:281
README.md names `engineering/changelog-generator`, but no file or folder `engineering/changelog-generator` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:282
README.md names `engineering/ci-cd-pipeline-builder`, but no file or folder `engineering/ci-cd-pipeline-builder` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:283
README.md names `marketing-skill/prompt-engineer-toolkit`, but no file or folder `marketing-skill/prompt-engineer-toolkit` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:284
business-operations/README.md names `c-level-advisor/coo-advisor`, but no file or folder `c-level-advisor/coo-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — business-operations/README.md:32
business-operations/README.md names `engineering-team/runbook-generator`, but no file or folder `engineering-team/runbook-generator` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — business-operations/README.md:36
commercial/README.md names `business-growth/sales-engineer`, but no file or folder `business-growth/sales-engineer` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:32
commercial/README.md names `business-growth/revenue-operations`, but no file or folder `business-growth/revenue-operations` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:33
commercial/README.md names `business-growth/contract-and-proposal-writer`, but no file or folder `business-growth/contract-and-proposal-writer` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:34
commercial/README.md names `c-level-advisor/cro-advisor`, but no file or folder `c-level-advisor/cro-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:35
commercial/README.md names `c-level-advisor/cfo-advisor`, but no file or folder `c-level-advisor/cfo-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:36
commercial/README.md names `finance/financial-analysis`, but no file or folder `finance/financial-analysis` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — commercial/README.md:37
docs/integrations.md documents the environment variable `OPENCODE_DISABLE_CLAUDE_CODE_SKILLS`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/integrations.md:434
docs/integrations.md documents the environment variable `NOUS_API_KEY`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/integrations.md:595
docs/integrations.md documents the environment variable `MISTRAL_API_KEY`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/integrations.md:799
engineering-team/README.md names `code_review_checklist.md`, but no file or folder `code_review_checklist.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:310
engineering-team/README.md names `coding_standards.md`, but no file or folder `coding_standards.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:311
engineering-team/README.md names `common_antipatterns.md`, but no file or folder `common_antipatterns.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:312
engineering-team/README.md names `security_auditor.py`, but no file or folder `security_auditor.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:336
engineering-team/README.md names `pentest_automator.py`, but no file or folder `pentest_automator.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:337
engineering-team/README.md names `security_architecture_patterns.md`, but no file or folder `security_architecture_patterns.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:340
engineering-team/README.md names `penetration_testing_guide.md`, but no file or folder `penetration_testing_guide.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:341
engineering-team/README.md names `cryptography_implementation.md`, but no file or folder `cryptography_implementation.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:342
engineering-team/README.md names Node.js 20, but the repository declares engines `>=16.0.0`. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — engineering-team/README.md:472
loop-library/README.md names `skills/loop-library/`, but no file or folder `skills/loop-library` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — loop-library/README.md:5
marketing-skill/README.md links to `content-creator/SKILL.md`, but `marketing-skill/content-creator/SKILL.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — marketing-skill/README.md:130
marketing-skill/README.md links to `marketing-demand-acquisition/SKILL.md`, but `marketing-skill/marketing-demand-acquisition/SKILL.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — marketing-skill/README.md:183
marketing-skill/README.md links to `marketing-strategy-pmm/SKILL.md`, but `marketing-skill/marketing-strategy-pmm/SKILL.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — marketing-skill/README.md:230
project-management/README.md links to `scrum-master/SKILL.md`, but `project-management/scrum-master/SKILL.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — project-management/README.md:134
ra-qm-team/README.md names `submission_timeline_tracker.py`, but no file or folder `submission_timeline_tracker.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:132
ra-qm-team/README.md names `regulatory_intelligence_monitor.py`, but no file or folder `regulatory_intelligence_monitor.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:133
ra-qm-team/README.md names `qms_effectiveness_monitor.py`, but no file or folder `qms_effectiveness_monitor.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:160
ra-qm-team/README.md names `management_review_analyzer.py`, but no file or folder `management_review_analyzer.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:162
ra-qm-team/README.md names `qmr-responsibilities.md`, but no file or folder `qmr-responsibilities.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:165
ra-qm-team/README.md names `quality-leadership-framework.md`, but no file or folder `quality-leadership-framework.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:166
ra-qm-team/README.md names `qms_compliance_checker.py`, but no file or folder `qms_compliance_checker.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — ra-qm-team/README.md:189
What to do
Reconcile the README with reality: INSTALLATION.md names `.github/skills/`, but no file or folder `.github/skills` exists; README.md links to `Hermes`, but `Hermes` does not exist; README.md links to `Mistral`, but `Mistral` does not exist; README.md names `engineering/git-worktree-manager`, but no file or folder `engineering/git-worktree-manager` exists; README.md names `engineering/mcp-server-builder`, but no file or folder `engineering/mcp-server-builder` exists.
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.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
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 72277 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.
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.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
What to do
Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where Watchdog can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
Do you agree with this assessment?
P5 · DR & Backup7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
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 the language 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.
Do you agree with this assessment?
R1 · Type Safety3.9 / 10Weak✓ 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.
7 typed · 11 plain JS — the untyped files are REDACTED, engineering/hivemind/scripts/oc-aggregate.mjs, engineering/hivemind/scripts/oc-status.mjs, engineering/hivemind/scripts/oc-worker.mjs, engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs, engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js (+5 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): 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. Deterministic.
5 duplicated blocks under engineering-team/playwright-pro/integrations/ have copies in at least two of the sibling directories browserstack-mcp, testrail-mcp — 3 of them are reported below, and 2 are 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 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147
engineering/workflow-builder/skills/workflow-builder/assets/templates/pipeline.js:3 · engineering/workflow-builder/skills/workflow-builder/expected_outputs/scaffold_pipeline.js:3 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — engineering/workflow-builder/skills/workflow-builder/assets/templates/pipeline.js:3
engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:182 — the two spans are one implementation copied and then locally edited — 325 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147
engineering-team/playwright-pro/integrations/browserstack-mcp/src/client.ts:22 · engineering-team/playwright-pro/integrations/testrail-mcp/src/client.ts:26 — 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/client.ts:22
engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:439 · engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:830 — the two spans are one implementation copied and then locally edited — 142 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:439
engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59 · engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:189 — 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. — engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59
engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:250 · engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:267 — 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. — engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:250
engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:136 · engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:144 — 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:136
research/syllabus/skills/syllabus/scripts/generate_reading_list.js:270 · research/syllabus/skills/syllabus/scripts/generate_reading_list.js:277 · research/syllabus/skills/syllabus/scripts/generate_reading_list.js:284 — all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases. — research/syllabus/skills/syllabus/scripts/generate_reading_list.js:270
engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:203 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:226 — 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. — engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:203
engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:397 · engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:418 — 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:397
engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:160 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:205 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:216 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:228 — the 4 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:160
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.
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.
main 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. — engineering/hivemind/scripts/oc-worker.mjs:109
captureFullPage has cyclomatic complexity 18 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:221
renderUserDashboard has cyclomatic complexity 18 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. — engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59
modeUrl 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:524
parseNdjson has cyclomatic complexity 16 and cognitive complexity 22; 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. — engineering/hivemind/scripts/oc-worker.mjs:168
buildAuditLogSection has cyclomatic complexity 16 and cognitive complexity 15; 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. — research/syllabus/skills/syllabus/scripts/generate_reading_list.js:263
modeTarget has cyclomatic complexity 15 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:871
(anonymous) has cyclomatic complexity 15 and cognitive complexity 13; 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. — engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:112
(anonymous) has cyclomatic complexity 15 and cognitive complexity 11; 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. — engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:170
captureViaProxy has cyclomatic complexity 14 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:646
parseArgs has cyclomatic complexity 14 and cognitive complexity 15; 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. — engineering/hivemind/scripts/oc-worker.mjs:39
main has cyclomatic complexity 13 and cognitive complexity 16; 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. — engineering/hivemind/scripts/oc-aggregate.mjs:30
loadRun has cyclomatic complexity 13 and cognitive complexity 16; 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. — engineering/hivemind/scripts/oc-status.mjs:7
waitForLoad has cyclomatic complexity 11 and cognitive complexity 21; 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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:168
validateInput has cyclomatic complexity 11 and cognitive complexity 15; 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. — research/syllabus/skills/syllabus/scripts/generate_reading_list.js:85
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ 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.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json 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: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code5.5 / 10Adequate✓ 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 10 application, 5 tooling and 0 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (10 application, 5 tooling, 0 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 (×4) — engineering/hivemind/scripts/oc-worker.mjs, engineering/hivemind/scripts/oc-aggregate.mjs, engineering/hivemind/scripts/oc-status.mjs, …
Nothing imports this binding — it is safe to review for removal. — engineering-team/playwright-pro/integrations/testrail-mcp/src/types.ts:24
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. — engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:639
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
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 package.json — installs work only by hoisting accident. — engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:2
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
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.
Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself — a page handed to a consumer runs in that consumer's origin.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`https://cdn.jsdelivr.net/npm/prismjs@1.29.0/components/prism-core.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 8 such include(s) across the repository's markup. — .codex/skills/md-document/assets/md_document_template.html:97
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
Do you agree with this assessment?
X1 · Async correctness3.5 / 10Weak✓ Tool-verified
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.
`async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained. — REDACTED:25
Reading `.Result` of a task that has not completed blocks this thread until it does — the same block as `.Wait()`: under a synchronization context (Blazor, a UI thread, classic ASP.NET) it deadlocks, and on the thread pool it parks a thread for as long as the work runs. `await` the task instead (make the caller `async`); where a synchronous entry point must stay, keep the block in ONE documented bridge with a timeout. — REDACTED:28
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.
Do you agree with this assessment?
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.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. 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 `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
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.
Other · Code Health — Whether async methods accept a CancellationToken so work can be cancelled (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/4 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
No CancellationToken parameter — this work can't be stopped early once started. (×4) — engineering-team/skills/code-reviewer/assets/sample_csharp_clean.cs:43, engineering-team/skills/code-reviewer/assets/sample_csharp_clean.cs:50, REDACTED:25, …
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `ArgumentNullException` tells the caller a parameter was null when it provably was not.
Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.
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.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. 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 `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
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.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
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.
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. — REDACTED:49
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
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.
Do you agree with this assessment?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. 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 `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
0/2 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
What to do
Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
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).
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.
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.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 34 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 44 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 — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
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
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
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 did not expose a crawlable HTTP endpoint in time — no runtime evidence 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 — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, 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 the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D10 Test Quality — ~1897 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — No tests discovered
D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
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.
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. 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"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
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.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
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.
DM1 Domain Modelling — applicable but not scored (1 of 2 signals for this style — below the bar we score at): 300 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 (this repository commits no MSBuild project, so its C# was read as syntax-only projects — a handler marked ONLY by an interface from a package is not visible without a build)
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
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 measured — the application kind could not be determined for this repo
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 data present for 2 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R4 Test Coverage — the JS/TS workspace (16 production file(s)) has no JavaScript/TypeScript test, but it is 1.35% of this repository's production source and the other 98.65% carries 1,897 line(s) of test code this pass cannot read — an incidental frontend's reachability is not the repository's test posture, so it is not scored as one
R5 Dependency Freshness — no package-lock.json — dependency freshness not measured (would require an npm lockfile); JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
X27 Collection changed while being enumerated — This check needs a compiled C# program and this repository commits no project file to compile, so only its syntax could be read. That is a limit of the analyzer, not a finding about your code.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
Orphaned knowledge engineering-team/skills/incident-commander/scripts/pir_generator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/interview-system-designer/hiring_calibrator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/interview-system-designer/question_bank_generator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge REDACTED:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/migration-architect/scripts/rollback_generator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/observability-designer/scripts/dashboard_generator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/observability-designer/scripts/alert_optimizer.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/interview-system-designer/loop_designer.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/dependency-auditor/scripts/license_checker.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/dependency-auditor/scripts/upgrade_planner.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/migration-architect/scripts/compatibility_checker.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/database-designer/schema_analyzer.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge REDACTED:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/agent-designer/agent_planner.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/agent-designer/tool_schema_generator.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge project-management/skills/scrum-master/scripts/retrospective_analyzer.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering-team/skills/incident-commander/scripts/incident_classifier.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge project-management/skills/senior-pm/scripts/resource_capacity_planner.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge project-management/skills/senior-pm/scripts/project_health_dashboard.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/dependency-auditor/scripts/dep_scanner.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge engineering/skills/skill-tester/scripts/script_tester.py:1— No living knowledge remains for this large file — its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here.
AC2 · Forms & labels· <input> without a programmatic label · ×8
<input> without a programmatic label .codex/skills/a11y-audit/assets/sample-component.tsx:16— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label .codex/skills/a11y-audit/assets/sample-component.tsx:24— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:16— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:24— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:16— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:24— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:16— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
<input> without a programmatic label engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:24— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label htmlFor>, a wrapping <label>, or aria-label.
AC4 · Keyboard semantics· Click handler on a non-interactive <div> · ×8
Click handler on a non-interactive <div> .codex/skills/a11y-audit/assets/sample-component.tsx:6— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> .codex/skills/a11y-audit/assets/sample-component.tsx:11— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:6— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:11— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:6— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:11— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:6— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:11— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
AC1 · Text alternatives· <img> without a text alternative · ×4
<img> without a text alternative .codex/skills/a11y-audit/assets/sample-component.tsx:7— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:7— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:7— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
<img> without a text alternative engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:7— An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt — alt="" if it's purely decorative.
D11 · Test Reliability· Test suite declares a test script but contains no test files · ×1
Test suite declares a test script but contains no test files: engineering/skills/dependency-auditor/test-project/ — The jest suite in engineering/skills/dependency-auditor/test-project/ was installed and launched successfully, and the runner then found no test files to run — No tests found, exiting with code 1. The package declares a test script, so it reads as a tested package to anyone who checks its manifest, but there is nothing behind the declaration: no test case exists, so it cannot detect a regression and its presence overstates how much of this repository is tested. The ask is the owner's: write the first test for this package, or remove the test script from a package that has none. This is not a report that the tests FAIL — there are none.
Unlisted import 'react' engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:2— Imported but not declared in any reachable package.json — installs work only by hoisting accident.
Duplicated block (5 lines × 2) agent-launcher/skills/interview/scripts/primitives_validator.py:135— agent-launcher/skills/interview/scripts/primitives_validator.py:135-139 | agent-launcher/skills/stage-launch/scripts/payload_validator.py:135-139 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (5 lines × 2) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:196— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:196-200 | business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:228-232 — 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 (5 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:127— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:127-131 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:127-131 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:307— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:307-311 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:307-311 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:269— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:269-273 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:269-273 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 2) c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:504— c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:504-508 | c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:328-332 — 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 `c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:504` 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) c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:344— c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:344-348 | c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:395-399 — 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 `c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:344` 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) commercial/skills/commercial-policy/scripts/discount_matrix_builder.py:267— commercial/skills/commercial-policy/scripts/discount_matrix_builder.py:267-273 | commercial/skills/pricing-strategist/scripts/packaging_designer.py:227-231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `commercial/skills/commercial-policy/scripts/discount_matrix_builder.py:267` 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `argv` to `list[str]` in one and `list[str] | None = None` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) commercial/skills/partnerships-architect/scripts/joint_gtm_planner.py:315— commercial/skills/partnerships-architect/scripts/joint_gtm_planner.py:315-319 | commercial/skills/partnerships-architect/scripts/joint_gtm_planner.py:321-325 — 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 (5 lines × 2) commercial/skills/rfp-responder/scripts/rfp_parser.py:246— commercial/skills/rfp-responder/scripts/rfp_parser.py:246-250 | engineering/skills/interview-system-designer/loop_designer.py:804-809 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (5 lines × 2) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_recipe_runner.py:393— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_recipe_runner.py:393-398 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:245-249 — 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 `engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_recipe_runner.py:393` 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) engineering-team/skills/azure-cloud-architect/scripts/architecture_designer.py:496— engineering-team/skills/azure-cloud-architect/scripts/architecture_designer.py:496-500 | engineering/skills/skill-tester/assets/sample-skill/scripts/text_processor.py:276-280 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:951— engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:951-955 | engineering/llm-wiki/skills/llm-wiki/scripts/ingest_source.py:162-166 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:951` 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) engineering-team/skills/incident-commander/scripts/incident_classifier.py:695— engineering-team/skills/incident-commander/scripts/incident_classifier.py:695-701 | research/grants/skills/grants/scripts/fiscal_year_calculator.py:59-63 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) engineering-team/skills/senior-frontend/scripts/component_generator.py:226— engineering-team/skills/senior-frontend/scripts/component_generator.py:226-230 | engineering-team/skills/senior-frontend/scripts/frontend_scaffolder.py:902-906 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `result` to `dict` in one and `Dict` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:279— engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:279-283 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:301-305 — 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 `engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:279` 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.
Duplicated block (5 lines × 2) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:491— engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:491-495 | REDACTED:871-876 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (5 lines × 2) engineering-team/skills/tdd-guide/scripts/metrics_calculator.py:432— engineering-team/skills/tdd-guide/scripts/metrics_calculator.py:432-436 | engineering-team/skills/tdd-guide/scripts/metrics_calculator.py:441-445 — 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 (5 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:86— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:86-90 | engineering/skills/feature-flags-architect/scripts/rollout_planner.py:86-90 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py` and `engineering/skills/feature-flags-architect/scripts/rollout_planner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:66— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:66-70 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:66-70 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:99— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:99-103 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:99-103 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 2) engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:552— engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:552-556 | engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:591-595 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) engineering/skills/interview-system-designer/loop_designer.py:832— engineering/skills/interview-system-designer/loop_designer.py:832-836 | engineering/skills/interview-system-designer/question_bank_generator.py:977-981 — 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, `engineering/skills/interview-system-designer/question_bank_generator.py:976` calls `add_argument` and `engineering/skills/interview-system-designer/loop_designer.py:831` 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.
Duplicated block (5 lines × 2) engineering/skills/observability-designer/scripts/slo_designer.py:566— engineering/skills/observability-designer/scripts/slo_designer.py:566-570 | engineering/skills/observability-designer/scripts/slo_designer.py:573-577 — 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 (5 lines × 2) engineering/skills/slo-architect/scripts/slo_designer.py:79— engineering/skills/slo-architect/scripts/slo_designer.py:79-83 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:79-83 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
FileTooLong: scripts/ratios.py finance/skills/stock-analysis/scripts/ratios.py— FileTooLong — 1881 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1381 over it, 3.76× 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/score.py finance/skills/stock-analysis/scripts/score.py— FileTooLong — 1159 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 659 over it, 2.32× 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/etl_performance_optimizer.py engineering-team/skills/senior-data-engineer/scripts/etl_performance_optimizer.py— FileTooLong — 1117 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 617 over it, 2.23× 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/data_quality_validator.py engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py— FileTooLong — 1078 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 578 over it, 2.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: scripts/api_scorecard.py engineering/skills/api-design-reviewer/scripts/api_scorecard.py— FileTooLong — 1057 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 557 over it, 2.11× 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/pir_generator.py engineering-team/skills/incident-commander/scripts/pir_generator.py— FileTooLong — 1002 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 502 over it, 2.00× 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/verify_data.py finance/skills/stock-analysis/scripts/verify_data.py— FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 467 over it, 1.93× 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/ship_gate_scanner.py engineering/skills/ship-gate/scripts/ship_gate_scanner.py— FileTooLong — 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92× 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/dataset_pipeline_builder.py engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py— FileTooLong — 955 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 455 over it, 1.91× 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: agent-designer/agent_evaluator.py engineering/skills/agent-designer/agent_evaluator.py— FileTooLong — 883 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 383 over it, 1.77× 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: interview-system-designer/hiring_calibrator.py engineering/skills/interview-system-designer/hiring_calibrator.py— FileTooLong — 883 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 383 over it, 1.77× 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 — 838 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 338 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/rollback_generator.py engineering/skills/migration-architect/scripts/rollback_generator.py— FileTooLong — 799 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 299 over it, 1.60× 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/ops_efficiency_analyzer.py c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py— FileTooLong — 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50× 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/compliance_checker.py engineering-team/skills/senior-secops/scripts/compliance_checker.py— FileTooLong — 746 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 246 over it, 1.49× 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/skill_security_auditor.py engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py— FileTooLong — 745 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 245 over it, 1.49× 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/okr_tracker.py c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py— FileTooLong — 743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 243 over it, 1.49× 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/lint_report.py finance/skills/stock-analysis/scripts/lint_report.py— FileTooLong — 739 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 239 over it, 1.48× 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/breaking_change_detector.py engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py— FileTooLong — 736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 236 over it, 1.47× 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: interview-system-designer/question_bank_generator.py engineering/skills/interview-system-designer/question_bank_generator.py— FileTooLong — 734 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 234 over it, 1.47× 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/quality_scorer.py engineering/skills/skill-tester/scripts/quality_scorer.py— FileTooLong — 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 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/dashboard_generator.py engineering/skills/observability-designer/scripts/dashboard_generator.py— FileTooLong — 710 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 210 over it, 1.42× 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/code_quality_checker.py engineering-team/skills/code-reviewer/scripts/code_quality_checker.py— FileTooLong — 701 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 201 over it, 1.40× 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: database-designer/schema_analyzer.py engineering/skills/database-designer/schema_analyzer.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: scripts/license_checker.py engineering/skills/dependency-auditor/scripts/license_checker.py— FileTooLong — 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 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.
Duplicated block (9 lines × 2) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:422— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:422-430 | business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:434-442 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:444` calls `get` and `business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:432` 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.
Duplicated block (9 lines × 2) business-growth/skills/sales-engineer/scripts/poc_planner.py:678— business-growth/skills/sales-engineer/scripts/poc_planner.py:678-686 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:487-495 — 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.
Duplicated block (9 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:32— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:32-40 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:32-40 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:274— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:274-282 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:274-282 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:284— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:284-292 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:284-292 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:194— c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:194-202 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:223-231 — 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 (9 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:229— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:229-237 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:229-237 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:123— commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:123-131 | engineering/handoff/skills/handoff/scripts/handoff_template_generator.py:121-129 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1648— engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1648-1659 | ra-qm-team/skills/gdpr-dsgvo-expert/scripts/data_subject_rights_tracker.py:533-541 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1648` 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. 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.
Duplicated block (9 lines × 2) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:340— engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:340-348 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:351-359 — 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 (9 lines × 2) engineering-team/skills/senior-secops/scripts/security_scanner.py:184— engineering-team/skills/senior-secops/scripts/security_scanner.py:184-192 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:208-216 — 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 `engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:208` 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 (9 lines × 2) engineering/agent-harness/skills/agent-harness/scripts/loop_controller.py:58— engineering/agent-harness/skills/agent-harness/scripts/loop_controller.py:58-66 | productivity/deep-work/skills/deep-work/scripts/focus_session_logger.py:70-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) engineering/claude-coach/skills/claude-coach/scripts/coach_tip_classifier.py:189— engineering/claude-coach/skills/claude-coach/scripts/coach_tip_classifier.py:189-197 | engineering/claude-coach/skills/claude-coach/scripts/prompt_rater.py:160-168 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/claude-coach/skills/claude-coach/scripts/coach_tip_classifier.py:188` calls `add_argument` and `engineering/claude-coach/skills/claude-coach/scripts/prompt_rater.py:159` does not — after which the two agree again for 4 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.
Duplicated block (9 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:102— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:102-110 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:102-110 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9 lines × 2) engineering/human-gate/skills/human-gate/scripts/human_gate.py:577— engineering/human-gate/skills/human-gate/scripts/human_gate.py:577-585 | engineering/human-gate/skills/human-gate/scripts/human_gate.py:606-614 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/human-gate/skills/human-gate/scripts/human_gate.py:616` calls `open`, `write` and `engineering/human-gate/skills/human-gate/scripts/human_gate.py:587` 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.
Duplicated block (9 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:84— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:84-92 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:84-92 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:147— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:147-155 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:147-155 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9 lines × 2) engineering/skills/agent-designer/agent_evaluator.py:1172— engineering/skills/agent-designer/agent_evaluator.py:1172-1184 | engineering/skills/agent-designer/tool_schema_generator.py:934-942 — 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.
Duplicated block (9 lines × 2) engineering/skills/api-design-reviewer/scripts/api_linter.py:443— engineering/skills/api-design-reviewer/scripts/api_linter.py:443-451 | engineering/skills/api-design-reviewer/scripts/api_linter.py:454-462 — 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 (9 lines × 2) engineering/skills/api-design-reviewer/scripts/api_linter.py:487— engineering/skills/api-design-reviewer/scripts/api_linter.py:487-495 | engineering/skills/api-design-reviewer/scripts/api_linter.py:500-508 — 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 (9 lines × 2) engineering/skills/api-design-reviewer/scripts/api_linter.py:579— engineering/skills/api-design-reviewer/scripts/api_linter.py:579-587 | engineering/skills/api-design-reviewer/scripts/api_linter.py:591-599 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skills/api-design-reviewer/scripts/api_linter.py:575` calls `get` and `engineering/skills/api-design-reviewer/scripts/api_linter.py:587` 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.
Duplicated block (9 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1164— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1164-1172 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1349-1357 — 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.
Duplicated block (9 lines × 2) REDACTED:823— REDACTED:823-831 | engineering/skills/database-designer/schema_analyzer.py:892-900 — 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.
Duplicated block (9 lines × 2) engineering/skills/database-designer/schema_analyzer.py:852— engineering/skills/database-designer/schema_analyzer.py:852-860 | engineering/skills/database-designer/schema_analyzer.py:878-886 — 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 `engineering/skills/database-designer/schema_analyzer.py:852` 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.
Duplicated block (9 lines × 2) engineering/skills/database-designer/schema_analyzer.py:862— engineering/skills/database-designer/schema_analyzer.py:862-870 | engineering/skills/database-designer/schema_analyzer.py:888-896 — 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 (7 lines × 2) agent-launcher/skills/run-without-you/scripts/next_directions_writer.py:82— agent-launcher/skills/run-without-you/scripts/next_directions_writer.py:82-88 | agent-launcher/skills/wrap-up/scripts/overview_page.py:89-95 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `agent-launcher/skills/wrap-up/scripts/overview_page.py:88` calls `add_argument` and `agent-launcher/skills/run-without-you/scripts/next_directions_writer.py:81` 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.
Duplicated block (7 lines × 2) business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:366— business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:366-372 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:395-401 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:408— business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:408-415 | engineering/caveman/skills/caveman/scripts/caveman_lint.py:141-147 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:296— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:296-302 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:296-302 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (7 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:404— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:404-410 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:404-410 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:271— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:271-277 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:271-277 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:362— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:362-368 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:362-368 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 323 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (7 lines × 2) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:483— c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:483-489 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:503-509 — 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 (7 lines × 2) commercial/skills/rfp-responder/scripts/response_drafter.py:261— commercial/skills/rfp-responder/scripts/response_drafter.py:261-267 | commercial/skills/rfp-responder/scripts/rfp_parser.py:274-280 — 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.
Duplicated block (7 lines × 2) engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:517— engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:517-523 | engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:529-535 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:1035— engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:1035-1041 | engineering-team/skills/incident-response/scripts/incident_triage.py:663-669 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) engineering-team/skills/gcp-cloud-architect/scripts/architecture_designer.py:786— engineering-team/skills/gcp-cloud-architect/scripts/architecture_designer.py:786-792 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:444-450 — 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.
Duplicated block (7 lines × 2) engineering-team/skills/security-pen-testing/scripts/pentest_report_generator.py:418— engineering-team/skills/security-pen-testing/scripts/pentest_report_generator.py:418-424 | engineering-team/skills/security-pen-testing/scripts/vulnerability_scanner.py:501-507 — 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 `engineering-team/skills/security-pen-testing/scripts/pentest_report_generator.py:418` 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 (7 lines × 2) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:269— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:269-275 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:380-386 — 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 `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:380` 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.
Duplicated block (7 lines × 2) engineering-team/skills/senior-devops/scripts/deployment_manager.py:263— engineering-team/skills/senior-devops/scripts/deployment_manager.py:263-269 | engineering-team/skills/senior-devops/scripts/terraform_scaffolder.py:480-486 — 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.
Duplicated block (7 lines × 2) engineering-team/skills/senior-secops/scripts/security_scanner.py:388— engineering-team/skills/senior-secops/scripts/security_scanner.py:388-394 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:473-479 — 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.
Duplicated block (7 lines × 2) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:172— engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:172-178 | engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:275-281 — 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 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.
Duplicated block (7 lines × 2) engineering/llm-wiki/skills/llm-wiki/scripts/graph_analyzer.py:33— engineering/llm-wiki/skills/llm-wiki/scripts/graph_analyzer.py:33-39 | engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py:53-59 — 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.
Duplicated block (7 lines × 2) engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:293— engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:293-299 | engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:591-598 — 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 `engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:293` 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 (7 lines × 2) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:203— engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:203-209 | engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:662-668 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:202` calls `rglob`, `is_dir` and `engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:661` 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.
Duplicated block (7 lines × 2) engineering/skills/interview-system-designer/question_bank_generator.py:889— engineering/skills/interview-system-designer/question_bank_generator.py:889-895 | engineering/skills/migration-architect/scripts/rollback_generator.py:967-973 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:203— engineering/skills/ship-gate/scripts/ship_gate_scanner.py:203-209 | engineering/skills/ship-gate/scripts/ship_gate_scanner.py:589-595 — 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 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.
Duplicated block (7 lines × 2) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:764— engineering/skills/ship-gate/scripts/ship_gate_scanner.py:764-770 | engineering/skills/ship-gate/scripts/ship_gate_scanner.py:878-884 — 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 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. 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.
Duplicated block (7 lines × 2) engineering/skills/skill-tester/scripts/quality_scorer.py:1056— engineering/skills/skill-tester/scripts/quality_scorer.py:1056-1062 | engineering/skills/skill-tester/scripts/skill_validator.py:579-585 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `report` to `QualityReport` in one and `ValidationReport` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (7 lines × 2) finance/skills/financial-analyst/scripts/forecast_builder.py:241— finance/skills/financial-analyst/scripts/forecast_builder.py:241-248 | marketing-skill/skills/social-media-analyzer/scripts/calculate_metrics.py:41-47 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) business-growth/skills/sales-engineer/scripts/poc_planner.py:667— business-growth/skills/sales-engineer/scripts/poc_planner.py:667-672 | commercial/skills/commercial-policy/scripts/discount_matrix_builder.py:230-235 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:70— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:70-75 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:70-75 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (6 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:118— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:118-123 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:118-123 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (6 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:132— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:132-137 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:132-137 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (6 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:370— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:370-375 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:370-375 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) c-level-advisor/skills/cfo-advisor/scripts/fundraising_model.py:236— c-level-advisor/skills/cfo-advisor/scripts/fundraising_model.py:236-241 | c-level-advisor/skills/cfo-advisor/scripts/unit_economics_analyzer.py:226-231 — 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.
Duplicated block (6 lines × 2) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:170— c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:170-176 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:192-197 — 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 (6 lines × 2) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:322— c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:322-327 | c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:338-343 — 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 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.
Duplicated block (6 lines × 2) commercial/skills/deal-desk/scripts/deal_scorer.py:360— commercial/skills/deal-desk/scripts/deal_scorer.py:360-365 | commercial/skills/deal-desk/scripts/discount_approval_router.py:239-244 — 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.
Duplicated block (6 lines × 2) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:238— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:238-243 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/workspace_audit.py:301-306 — 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.
Duplicated block (6 lines × 2) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:250— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:250-255 | markdown-html/skills/md-slides/scripts/slide_splitter.py:245-250 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:333— engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:333-338 | engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:351-356 — 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 `engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:333` 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.
Duplicated block (6 lines × 2) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:534— engineering-team/skills/senior-backend/scripts/database_migration_tool.py:534-539 | engineering-team/skills/senior-backend/scripts/database_migration_tool.py:544-549 — 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 (6 lines × 2) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1674— engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1674-1679 | engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1681-1686 — 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 (6 lines × 2) engineering-team/skills/senior-fullstack/scripts/project_scaffolder.py:824— engineering-team/skills/senior-fullstack/scripts/project_scaffolder.py:824-829 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:459-464 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:489— engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:489-494 | engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:500-505 — 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 (6 lines × 2) engineering/agent-harness/skills/agent-harness/scripts/goal_compiler.py:137— engineering/agent-harness/skills/agent-harness/scripts/goal_compiler.py:137-142 | engineering/human-gate/skills/human-gate/scripts/review_page_builder.py:825-835 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (6 lines × 2) engineering/claude-coach/skills/claude-coach/scripts/cheat_code_filter.py:139— engineering/claude-coach/skills/claude-coach/scripts/cheat_code_filter.py:139-144 | productivity/weekly-review/skills/weekly-review/scripts/open_loop_scanner.py:175-182 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind `argv` to `list[str] | None = None` in one and `List[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 2) engineering/claude-coach/skills/claude-coach/scripts/coach_tip_classifier.py:188— engineering/claude-coach/skills/claude-coach/scripts/coach_tip_classifier.py:188-193 | productivity/meetings/skills/meetings/scripts/meeting_cost_calculator.py:148-155 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `productivity/meetings/skills/meetings/scripts/meeting_cost_calculator.py:148` 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `argv` to `list[str] | None = None` in one and `List[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 2) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:221— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:221-226 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:239-244 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `productivity/email/skills/inbox-setup/scripts/kb_validator.py:236` calls `add_argument` and `engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:219` 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.
Duplicated block (6 lines × 2) engineering/skills/changelog-generator/scripts/generate_changelog.py:62— engineering/skills/changelog-generator/scripts/generate_changelog.py:62-67 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_tester.py:42-47 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) REDACTED:734— REDACTED:734-739 | REDACTED:741-746 — 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 (6 lines × 2) engineering/skills/database-designer/schema_analyzer.py:841— engineering/skills/database-designer/schema_analyzer.py:841-848 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:153-158 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) engineering/skills/slo-architect/scripts/slo_designer.py:94— engineering/skills/slo-architect/scripts/slo_designer.py:94-99 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:94-99 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) engineering/skills/tc-tracker/scripts/tc_create.py:169— engineering/skills/tc-tracker/scripts/tc_create.py:169-174 | engineering/skills/tc-tracker/scripts/tc_update.py:167-172 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/tc-tracker/scripts/tc_update.py:173` calls `loads`, `read_text` and `engineering/skills/tc-tracker/scripts/tc_create.py:175` does not — after which the two agree again for 4 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.
Duplicated block (8 lines × 2) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:387— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:387-394 | business-growth/skills/customer-success-manager/scripts/expansion_opportunity_scorer.py:313-320 — 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.
Duplicated block (8 lines × 2) business-operations/skills/internal-comms/scripts/comms_template_filler.py:229— business-operations/skills/internal-comms/scripts/comms_template_filler.py:229-236 | business-operations/skills/internal-comms/scripts/comms_template_filler.py:239-246 — 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 `business-operations/skills/internal-comms/scripts/comms_template_filler.py:229` 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 (8 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:284— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:284-291 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:284-291 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:220— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:220-227 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:220-227 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:195— commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:195-202 | commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:215-222 — 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 `commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:195` 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.
Duplicated block (8 lines × 2) engineering-team/skills/azure-cloud-architect/scripts/cost_optimizer.py:142— engineering-team/skills/azure-cloud-architect/scripts/cost_optimizer.py:142-149 | engineering-team/skills/azure-cloud-architect/scripts/cost_optimizer.py:300-307 — 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) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:328— engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:328-335 | engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:402-410 — 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 `engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:328` 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.
Duplicated block (8 lines × 2) engineering-team/skills/senior-backend/scripts/api_scaffolder.py:367— engineering-team/skills/senior-backend/scripts/api_scaffolder.py:367-374 | engineering-team/skills/senior-backend/scripts/api_scaffolder.py:379-386 — 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) engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:570— engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:570-577 | engineering/book-to-skill/skills/book-to-skill/scripts/token_budget_estimator.py:332-339 — 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 `engineering/book-to-skill/skills/book-to-skill/scripts/token_budget_estimator.py:332` 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. 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.
Duplicated block (8 lines × 2) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:491— engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:491-498 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:530-537 — 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) engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:301— engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:301-308 | engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:600-607 — 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 `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.
Duplicated block (8 lines × 2) REDACTED:1085— REDACTED:1085-1092 | engineering/skills/migration-architect/scripts/rollback_generator.py:955-962 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) engineering/skills/dependency-auditor/scripts/dep_scanner.py:706— engineering/skills/dependency-auditor/scripts/dep_scanner.py:706-713 | ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:378-385 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) engineering/skills/interview-system-designer/hiring_calibrator.py:808— engineering/skills/interview-system-designer/hiring_calibrator.py:808-815 | engineering/skills/interview-system-designer/hiring_calibrator.py:822-829 — 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) engineering/skills/interview-system-designer/hiring_calibrator.py:1136— engineering/skills/interview-system-designer/hiring_calibrator.py:1136-1143 | engineering/skills/interview-system-designer/hiring_calibrator.py:1179-1186 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skills/interview-system-designer/hiring_calibrator.py:1135` calls `get` and `engineering/skills/interview-system-designer/hiring_calibrator.py:1178` 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.
Duplicated block (8 lines × 2) engineering/skills/interview-system-designer/loop_designer.py:841— engineering/skills/interview-system-designer/loop_designer.py:841-848 | engineering/skills/interview-system-designer/question_bank_generator.py:986-993 — 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, `engineering/skills/interview-system-designer/question_bank_generator.py:994` calls `get` and `engineering/skills/interview-system-designer/loop_designer.py:849` does not — after which the two agree again for 4 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.
Duplicated block (8 lines × 2) engineering/skills/migration-architect/scripts/compatibility_checker.py:319— engineering/skills/migration-architect/scripts/compatibility_checker.py:319-326 | engineering/skills/migration-architect/scripts/compatibility_checker.py:620-627 — 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 `engineering/skills/migration-architect/scripts/compatibility_checker.py:319` 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.
Duplicated block (8 lines × 2) engineering/skills/migration-architect/scripts/compatibility_checker.py:552— engineering/skills/migration-architect/scripts/compatibility_checker.py:552-559 | engineering/skills/migration-architect/scripts/compatibility_checker.py:568-575 — 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 `engineering/skills/migration-architect/scripts/compatibility_checker.py:552` 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.
Duplicated block (8 lines × 2) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:629— engineering/skills/ship-gate/scripts/ship_gate_scanner.py:629-636 | engineering/skills/ship-gate/scripts/ship_gate_scanner.py:823-830 — 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 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.
Duplicated block (8 lines × 2) engineering/skills/slo-architect/scripts/error_budget_calculator.py:106— engineering/skills/slo-architect/scripts/error_budget_calculator.py:106-113 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:106-113 — before extracting anything, compare `engineering/skills/slo-architect/scripts/error_budget_calculator.py` and `engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:127— engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:127-134 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:246-253 — 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 `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.
Duplicated block (8 lines × 2) markdown-html/skills/design-system/scripts/config_loader.py:109— markdown-html/skills/design-system/scripts/config_loader.py:109-116 | research-ops/skills/clinical-research/scripts/config_loader.py:89-96 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (8 lines × 2) markdown-html/skills/md-document/scripts/markdown_parser.py:346— markdown-html/skills/md-document/scripts/markdown_parser.py:346-353 | markdown-html/skills/md-slides/scripts/presenter_notes_parser.py:84-91 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) marketing-skill/skills/copy-editing/scripts/ai_content_detector.py:106— marketing-skill/skills/copy-editing/scripts/ai_content_detector.py:106-113 | marketing-skill/skills/copy-editing/scripts/ai_content_detector.py:139-146 — 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) productivity/email/skills/inbox-setup/scripts/kb_validator.py:223— productivity/email/skills/inbox-setup/scripts/kb_validator.py:223-230 | productivity/email/skills/inbox-triage/scripts/kb_reader.py:268-275 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:414— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:414-423 | business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:366-375 — 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 `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.
Duplicated block (10 lines × 2) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:409— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:409-418 | project-management/skills/jira-expert/scripts/workflow_validator.py:323-332 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) business-growth/skills/sales-engineer/scripts/poc_planner.py:658— business-growth/skills/sales-engineer/scripts/poc_planner.py:658-667 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:497-506 — 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, `business-growth/skills/sales-engineer/scripts/poc_planner.py:670` calls `items` and `business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:507` 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.
Duplicated block (10 lines × 2) business-operations/skills/vendor-management/scripts/sla_compliance_tracker.py:309— business-operations/skills/vendor-management/scripts/sla_compliance_tracker.py:309-318 | business-operations/skills/vendor-management/scripts/vendor_risk_classifier.py:338-348 — 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 `business-operations/skills/vendor-management/scripts/vendor_risk_classifier.py:338` 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 (10 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:140— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:140-149 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:140-149 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:284— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:284-293 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:284-293 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:195— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:195-204 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:195-204 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:294— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:294-303 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:294-303 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:304— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:304-313 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:304-313 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:206— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:206-215 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:206-215 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) commercial/skills/partnerships-architect/scripts/joint_gtm_planner.py:345— commercial/skills/partnerships-architect/scripts/joint_gtm_planner.py:345-354 | commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:494-503 — 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.
Duplicated block (10 lines × 2) commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:102— commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:102-111 | commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:121-130 — 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 (10 lines × 2) commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:194— commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:194-203 | engineering-team/skills/incident-commander/scripts/pir_generator.py:1322-1332 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:194` 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 (10 lines × 2) engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:235— engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:235-244 | engineering/agenthub/skills/agenthub/scripts/hub_init.py:185-194 — 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 `engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:235` 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. 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.
Duplicated block (10 lines × 2) engineering/agenthub/skills/agenthub/scripts/hub_init.py:185— engineering/agenthub/skills/agenthub/scripts/hub_init.py:185-194 | engineering/agenthub/skills/agenthub/scripts/result_ranker.py:203-212 — 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 `engineering/agenthub/skills/agenthub/scripts/hub_init.py:185` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/agenthub/skills/agenthub/scripts/result_ranker.py:202` calls `add_argument` and `engineering/agenthub/skills/agenthub/scripts/hub_init.py:184` 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.
Duplicated block (10 lines × 2) engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:321— engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:321-330 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:422-431 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:35— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:35-44 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:35-44 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (10 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:319— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:319-328 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:731-740 — 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 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.
Duplicated block (10 lines × 2) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:389— engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:389-398 | engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:474-485 — 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 `engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:389` 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.
Duplicated block (10 lines × 2) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:513— engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:513-522 | engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:562-572 — 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 `engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:513` 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.
Duplicated block (10 lines × 2) engineering/skills/slo-architect/scripts/slo_designer.py:107— engineering/skills/slo-architect/scripts/slo_designer.py:107-116 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:107-116 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (10 lines × 2) engineering/skills/tc-tracker/scripts/tc_status.py:176— engineering/skills/tc-tracker/scripts/tc_status.py:176-185 | engineering/skills/tc-tracker/scripts/tc_update.py:162-171 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/tc-tracker/scripts/tc_update.py:172` calls `loads`, `read_text` and `engineering/skills/tc-tracker/scripts/tc_status.py:186` 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.
Duplicated block (10 lines × 2) engineering/skills/tc-tracker/scripts/tc_validator.py:162— engineering/skills/tc-tracker/scripts/tc_validator.py:162-171 | engineering/skills/tc-tracker/scripts/tc_validator.py:197-206 — 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 `engineering/skills/tc-tracker/scripts/tc_validator.py:162` 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. 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.
Duplicated block (10 lines × 2) engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:789— engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:789-798 | engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:616-625 — 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 `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.
Duplicated block (10 lines × 2) finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:342— finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:342-351 | finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:353-362 — 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 `finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:342` 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 (11 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:40— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:40-50 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:40-50 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:128— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:128-138 | c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:128-138 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:107— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:107-117 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:107-117 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 251 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:207— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:207-217 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:207-217 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234-244 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234-244 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:359— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:359-369 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:359-369 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:247— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:247-257 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:247-257 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:348— c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:348-358 | c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:359-369 — 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) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:114— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:114-124 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:114-124 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:195— commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:195-205 | commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:235-245 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:234` calls `get`, `lower` and `commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:194` 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.
Duplicated block (11 lines × 2) engineering-team/skills/aws-solution-architect/scripts/architecture_designer.py:24— engineering-team/skills/aws-solution-architect/scripts/architecture_designer.py:24-34 | engineering-team/skills/gcp-cloud-architect/scripts/architecture_designer.py:27-37 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:490— engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:490-500 | engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:523-533 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:503` calls `get` and `engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:536` 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.
Duplicated block (11 lines × 2) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:222— engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:222-232 | engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:287-297 — 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 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.
Duplicated block (11 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:35— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:35-45 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:35-45 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py` and `engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:104— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:104-114 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:104-114 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) engineering/skills/agent-designer/tool_schema_generator.py:309— engineering/skills/agent-designer/tool_schema_generator.py:309-319 | engineering/skills/agent-designer/tool_schema_generator.py:323-333 — 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) REDACTED:664— REDACTED:664-674 | REDACTED:688-698 — 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 `REDACTED:664` 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 (11 lines × 2) engineering/skills/slo-architect/scripts/error_budget_calculator.py:91— engineering/skills/slo-architect/scripts/error_budget_calculator.py:91-101 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:91-101 — before extracting anything, compare `engineering/skills/slo-architect/scripts/error_budget_calculator.py` and `engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) engineering/skills/slo-architect/scripts/slo_review.py:140— engineering/skills/slo-architect/scripts/slo_review.py:140-150 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:140-150 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_review.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_review.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) engineering/skills/tc-tracker/scripts/tc_create.py:160— engineering/skills/tc-tracker/scripts/tc_create.py:160-170 | engineering/skills/tc-tracker/scripts/tc_update.py:152-162 — 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 `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.
Duplicated block (11 lines × 2) markdown-html/skills/design-system/scripts/config_loader.py:90— markdown-html/skills/design-system/scripts/config_loader.py:90-100 | research-ops/skills/clinical-research/scripts/config_loader.py:70-80 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (11 lines × 2) marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:121— marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:121-131 | marketing-skill/skills/pricing-strategy/scripts/pricing_modeler.py:147-157 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) engineering/skills/spec-driven-workflow/scripts/spec_validator.py:213— engineering/skills/spec-driven-workflow/scripts/spec_validator.py:213-223 | engineering/skills/spec-driven-workflow/scripts/spec_validator.py:267-277 — 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 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.
Duplicated block (12 lines × 2) business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:94— business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:94-105 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:108-119 — 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 (12 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:261— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:261-272 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:261-272 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:300— c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:300-311 | c-level-advisor/executive-mentor/skills/executive-mentor/scripts/stakeholder_mapper.py:373-384 — 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.
Duplicated block (12 lines × 2) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:412— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:412-423 | engineering-team/skills/tdd-guide/scripts/tdd_workflow.py:379-390 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:412` 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.
Duplicated block (12 lines × 2) engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:68— engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:68-79 | engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:136-147 — 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 (12 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:35— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:35-46 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:35-46 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` and `engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:119— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:119-130 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:119-130 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:61— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:61-72 | engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:61-72 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py` and `engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:102— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:102-113 | engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:102-113 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py` and `engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:162— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:162-173 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:162-173 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:361— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:361-372 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:698-709 — 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 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.
Duplicated block (12 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:510— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:510-521 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1091-1102 — 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 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.
Duplicated block (12 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:728— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:728-739 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1042-1053 — 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 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.
Duplicated block (12 lines × 2) REDACTED:796— REDACTED:796-807 | engineering/skills/database-designer/schema_analyzer.py:829-840 — 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.
Duplicated block (12 lines × 2) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:750— engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:750-761 | engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:762-773 — 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 (12 lines × 2) engineering/skills/skill-tester/scripts/skill_validator.py:655— engineering/skills/skill-tester/scripts/skill_validator.py:655-666 | ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:543-561 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/skill-tester/scripts/skill_validator.py:655` 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 (12 lines × 2) markdown-html/skills/md-review/scripts/diff_parser.py:279— markdown-html/skills/md-review/scripts/diff_parser.py:279-290 | markdown-html/skills/md-slides/scripts/slide_splitter.py:248-259 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `markdown-html/skills/md-review/scripts/diff_parser.py:279` 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. 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.
Duplicated block (12 lines × 2) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:368— project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:368-379 | project-management/skills/confluence-expert/scripts/content_audit_analyzer.py:356-367 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (12 lines × 2) scripts/check_frontmatter.py:183— scripts/check_frontmatter.py:183-194 | scripts/check_paths.py:180-191 — 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 `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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/check_frontmatter.py:181` calls `add_argument` and `scripts/check_paths.py:178` 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.
Duplicated block (12 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:125— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:125-136 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:125-136 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×18
Members sharing a duplicated core (4 members, 50+ identical tokens) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:141— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:141-171 | c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:157-186 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:141-171 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:157-186 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194— c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194-243 | c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:190-239 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194-243 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:190-239 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) commercial/skills/channel-economics/scripts/cost_to_serve_calculator.py:140— commercial/skills/channel-economics/scripts/cost_to_serve_calculator.py:140-178 | marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:180-240 | marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:183-226 | marketing-skill/skills/programmatic-seo/scripts/url_pattern_generator.py:112-155 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering-team/skills/senior-architect/scripts/project_architect.py:192— engineering-team/skills/senior-architect/scripts/project_architect.py:192-230 | engineering-team/skills/senior-architect/scripts/project_architect.py:233-268 | engineering-team/skills/senior-architect/scripts/project_architect.py:271-330 | engineering-team/skills/senior-architect/scripts/project_architect.py:392-439 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering-team/skills/senior-backend/scripts/api_load_tester.py:482— engineering-team/skills/senior-backend/scripts/api_load_tester.py:482-603 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:1038-1103 | engineering-team/skills/senior-secops/scripts/security_scanner.py:402-467 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:494-559 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering-team/skills/senior-secops/scripts/compliance_checker.py:221— engineering-team/skills/senior-secops/scripts/compliance_checker.py:221-264 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:348-381 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:625-662 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:847-883 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:359— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:359-386 | engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:379-406 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:504-538 | REDACTED:411-438 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27-31 | engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:27-31 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27-31 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:27-31 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:145— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:145-157 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:145-157 | engineering/skills/slo-architect/scripts/slo_review.py:138-150 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:138-150 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) engineering/skills/tc-tracker/scripts/tc_create.py:147— engineering/skills/tc-tracker/scripts/tc_create.py:147-273 | engineering/skills/tc-tracker/scripts/tc_init.py:107-192 | engineering/skills/tc-tracker/scripts/tc_status.py:141-196 | engineering/skills/tc-tracker/scripts/tc_update.py:129-357 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:370— finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:370-430 | finance/skills/financial-analyst/scripts/dcf_valuation.py:403-472 | finance/skills/financial-analyst/scripts/forecast_builder.py:467-524 | finance/skills/financial-analyst/scripts/ratio_calculator.py:390-457 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) marketing/landing/skills/landing/scripts/html_validator.py:267— marketing/landing/skills/landing/scripts/html_validator.py:267-291 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:235-259 | productivity/email/skills/inbox-triage/scripts/draft_safety_validator.py:169-193 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:217-243 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:180— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:180-207 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:176-202 | productivity/roast/skills/roast/scripts/cheapest_test_designer.py:168-190 | productivity/roast/skills/roast/scripts/verdict_synthesizer.py:217-245 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) productivity/handoff/hooks/session_end.py:43— productivity/handoff/hooks/session_end.py:43-54 | productivity/handoff/hooks/session_start.py:46-58 | productivity/handoff/skills/handoff/scripts/cleanup.py:28-38 | productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:68-80 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:427— project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:427-465 | project-management/skills/confluence-expert/scripts/content_audit_analyzer.py:415-453 | project-management/skills/confluence-expert/scripts/space_structure_generator.py:475-513 | project-management/skills/jira-expert/scripts/workflow_validator.py:382-420 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:473— ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:473-634 | ra-qm-team/skills/qms-audit-expert/scripts/audit_schedule_optimizer.py:356-416 | ra-qm-team/skills/quality-documentation-manager/scripts/document_validator.py:546-642 | ra-qm-team/skills/quality-manager-qmr/scripts/management_review_tracker.py:437-576 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) research-ops/skills/clinical-research/scripts/ar_evaluator.py:41— research-ops/skills/clinical-research/scripts/ar_evaluator.py:41-70 | research-ops/skills/market-research/scripts/ar_evaluator.py:37-73 | research-ops/skills/product-research/scripts/ar_evaluator.py:37-64 | research-ops/skills/research-finance/scripts/ar_evaluator.py:37-70 — 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.
Members sharing a duplicated core (4 members, 50+ identical tokens) research/grants/skills/grants/scripts/mechanism_matcher.py:189— research/grants/skills/grants/scripts/mechanism_matcher.py:189-212 | research/notebooklm/skills/notebooklm/scripts/action_router.py:226-268 | research/notebooklm/skills/notebooklm/scripts/async_action_classifier.py:238-258 | research/notebooklm/skills/notebooklm/scripts/custom_prompt_template_generator.py:243-266 — 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.
Duplicated block (15 lines × 2) business-operations/skills/knowledge-ops/scripts/kb_ingester.py:315— business-operations/skills/knowledge-ops/scripts/kb_ingester.py:315-329 | business-operations/skills/knowledge-ops/scripts/kb_ingester.py:351-365 — 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 `business-operations/skills/knowledge-ops/scripts/kb_ingester.py:315` 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.
Duplicated block (15 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:420— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:420-434 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:420-434 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:315— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:315-329 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:315-329 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15 lines × 2) c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:685— c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:685-699 | c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:523-537 — 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 `c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:685` 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 (15 lines × 2) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:173— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:173-187 | engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:258-272 — 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 (15 lines × 2) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:597— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:597-611 | engineering-team/skills/senior-architect/scripts/project_architect.py:731-745 — 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.
Duplicated block (15 lines × 2) engineering/agenthub/skills/agenthub/scripts/hub_init.py:145— engineering/agenthub/skills/agenthub/scripts/hub_init.py:145-159 | engineering/agenthub/skills/agenthub/scripts/session_manager.py:231-245 — 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.
Duplicated block (15 lines × 2) engineering/caveman/skills/caveman/scripts/caveman_compressor.py:215— engineering/caveman/skills/caveman/scripts/caveman_compressor.py:215-229 | engineering/caveman/skills/caveman/scripts/caveman_lint.py:160-174 — 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.
Duplicated block (15 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:122— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:122-136 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:122-136 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15 lines × 2) engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:131— engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:131-145 | engineering/grill-me/skills/grill-me/scripts/question_generator.py:124-138 — 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.
Duplicated block (15 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:115— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:115-129 | engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:115-129 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py` and `engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15 lines × 2) engineering/skills/dependency-auditor/scripts/dep_scanner.py:511— engineering/skills/dependency-auditor/scripts/dep_scanner.py:511-525 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:543-557 — 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 `engineering/skills/dependency-auditor/scripts/dep_scanner.py:543` 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. 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.
Duplicated block (15 lines × 2) engineering/universal-scraping-architect/skills/universal-scraping-architect/scripts/firecrawl_example.py:73— engineering/universal-scraping-architect/skills/universal-scraping-architect/scripts/firecrawl_example.py:73-87 | engineering/universal-scraping-architect/skills/universal-scraping-architect/scripts/local_bs4_example.py:72-86 — 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.
Duplicated block (15 lines × 2) marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:179— marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:179-194 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:280-294 — 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 (15 lines × 2) product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:273— product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:273-287 | product-team/research-summarizer/skills/research-summarizer/scripts/format_summary.py:214-228 — 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 `product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:273` 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 (15 lines × 2) research/dossier/skills/dossier/scripts/citation_tracker.py:233— research/dossier/skills/dossier/scripts/citation_tracker.py:233-247 | research/grants/skills/grants/scripts/citation_tracker.py:243-257 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `research/grants/skills/grants/scripts/citation_tracker.py:259` calls `add_argument` and `research/dossier/skills/dossier/scripts/citation_tracker.py:249` 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.
Duplicated block (15 lines × 2) scripts/sync-hermes-skills.py:206— scripts/sync-hermes-skills.py:206-220 | scripts/sync-vibe-skills.py:247-261 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/sync-hermes-skills.py:206` 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.
Duplicated block (13 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:304— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:304-316 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:304-316 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 251 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (13 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:293— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:293-305 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:293-305 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:195— c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:195-207 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:195-207 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:541— engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:541-553 | engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:753-765 — 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 (13 lines × 2) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:33— engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:33-45 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:113-125 — 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.
Duplicated block (13 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:134— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:134-146 | engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:134-146 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py` and `engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (13 lines × 2) engineering/skills/agent-designer/agent_evaluator.py:1116— engineering/skills/agent-designer/agent_evaluator.py:1116-1128 | engineering/skills/agent-designer/tool_schema_generator.py:854-866 — 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.
Duplicated block (13 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:285— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:285-297 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:339-351 — 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 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.
Duplicated block (13 lines × 2) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1299— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1299-1311 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1383-1395 — 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 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.
Duplicated block (13 lines × 2) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:108— engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:108-123 | engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:192-204 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:205` calls `select_node_install` and `engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:124` does not — after which the two agree again for 4 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.
Duplicated block (13 lines × 2) engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:59— engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:59-71 | engineering/skills/git-worktree-manager/scripts/worktree_manager.py:71-83 — 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.
Duplicated block (13 lines × 2) engineering/skills/migration-architect/scripts/compatibility_checker.py:212— engineering/skills/migration-architect/scripts/compatibility_checker.py:212-224 | engineering/skills/migration-architect/scripts/compatibility_checker.py:309-321 — 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 `engineering/skills/migration-architect/scripts/compatibility_checker.py:212` 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.
Duplicated block (13 lines × 2) marketing-skill/skills/page-cro/scripts/conversion_audit.py:358— marketing-skill/skills/page-cro/scripts/conversion_audit.py:358-370 | marketing-skill/skills/seo-audit/scripts/seo_checker.py:306-318 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing-skill/skills/seo-audit/scripts/seo_checker.py:305` calls `add_argument` and `marketing-skill/skills/page-cro/scripts/conversion_audit.py:357` does not — after which the two agree again for 4 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.
Duplicated block (13 lines × 2) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:146— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:146-158 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:154-166 — 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.
Duplicated block (13 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:215— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:215-227 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:215-227 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:186— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:186-198 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:186-198 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (13 lines × 2) scripts/sync-hermes-skills.py:230— scripts/sync-hermes-skills.py:230-242 | scripts/sync-vibe-skills.py:280-292 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/sync-vibe-skills.py:278` calls `assign_flat_names` and `scripts/sync-hermes-skills.py:228` 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.
Duplicated block (16 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:77— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:77-92 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:77-92 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (16 lines × 2) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:240— c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:240-255 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:258-273 — 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 (16 lines × 2) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:727— c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:727-742 | c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:798-813 — 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 `c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:727` 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 (16 lines × 2) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:153— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:153-169 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:177-192 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:173— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:173-188 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:195-210 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:405— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:405-420 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:524-539 — 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 `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:405` 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.
Duplicated block (16 lines × 2) engineering/agenthub/skills/agenthub/scripts/board_manager.py:222— engineering/agenthub/skills/agenthub/scripts/board_manager.py:222-237 | engineering/agenthub/skills/agenthub/scripts/session_manager.py:264-279 — 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 `engineering/agenthub/skills/agenthub/scripts/board_manager.py:222` 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. 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.
Duplicated block (16 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:53— engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:53-68 | engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:53-68 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` and `engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:125— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:125-140 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:125-140 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` and `engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (16 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:49— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:49-64 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:49-64 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py` and `engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (16 lines × 2) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:673— engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:673-688 | engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:699-714 — 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 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.
Duplicated block (16 lines × 2) finance/skills/stock-analysis/scripts/valuation.py:847— finance/skills/stock-analysis/scripts/valuation.py:847-862 | finance/skills/stock-analysis/scripts/verify_data.py:1615-1630 — 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 `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.
Duplicated block (16 lines × 2) productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:174— productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:174-189 | productivity/reflect/skills/reflect/scripts/conversation_depth_analyzer.py:173-188 — 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.
Duplicated block (16 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:144— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:144-159 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:144-159 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (16 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:205— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:205-220 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:205-220 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` and `ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (16 lines × 2) scripts/sync-hermes-skills.py:132— scripts/sync-hermes-skills.py:132-147 | scripts/sync-vibe-skills.py:145-160 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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.
Duplicated block (5 lines × 3) business-growth/skills/sales-engineer/scripts/poc_planner.py:594— business-growth/skills/sales-engineer/scripts/poc_planner.py:594-598 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:429-433 | finance/skills/saas-metrics-coach/scripts/quick_ratio_calculator.py:103-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 3) business-growth/skills/sales-engineer/scripts/poc_planner.py:593— business-growth/skills/sales-engineer/scripts/poc_planner.py:593-597 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:428-432 | engineering/skills/dependency-auditor/scripts/license_checker.py:881-885 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 3) business-growth/skills/sales-engineer/scripts/poc_planner.py:699— business-growth/skills/sales-engineer/scripts/poc_planner.py:699-704 | engineering/skills/slo-architect/scripts/slo_designer.py:94-98 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:94-98 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:171— c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:171-176 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:193-197 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:222-226 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) commercial/skills/commercial-forecaster/scripts/cohort_arr_projector.py:253— commercial/skills/commercial-forecaster/scripts/cohort_arr_projector.py:253-257 | commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:165-169 | commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:230-234 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 3) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:72— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:72-76 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:72-76 | research/pulse/skills/pulse/scripts/time_window_calculator.py:93-97 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:82— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:82-86 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:82-86 | research/pulse/skills/pulse/scripts/citation_tracker.py:418-422 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:119— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:119-123 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:119-123 | research/research/skills/research/scripts/routing_transparency_logger.py:131-136 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `research/research/skills/research/scripts/routing_transparency_logger.py:131` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `research/research/skills/research/scripts/routing_transparency_logger.py:137` calls `add_argument` and `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:124` 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.
Duplicated block (5 lines × 3) engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:73— engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:73-78 | markdown-html/skills/design-system/scripts/brand_palette_validator.py:304-308 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:240-244 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 3) markdown-html/skills/design-system/scripts/brand_palette_validator.py:303— markdown-html/skills/design-system/scripts/brand_palette_validator.py:303-307 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:239-243 | productivity/roast/skills/roast/scripts/brief_builder.py:120-124 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `productivity/roast/skills/roast/scripts/brief_builder.py:126` calls `add_argument` and `markdown-html/skills/design-system/scripts/brand_palette_validator.py:309` 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.
Duplicated block (5 lines × 3) marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:252— marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:252-256 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:206-210 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:206-210 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 3) research-ops/skills/market-research/scripts/onboard.py:54— research-ops/skills/market-research/scripts/onboard.py:54-58 | research-ops/skills/product-research/scripts/onboard.py:63-67 | research-ops/skills/research-finance/scripts/onboard.py:57-61 — before extracting anything, compare `research-ops/skills/market-research/scripts/onboard.py` and `research-ops/skills/product-research/scripts/onboard.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 3) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:22— engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:22-26 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:22-26 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/outlier_detector.py:30-34 — 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 all 3 call sites, so a change lands once. 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.
Duplicated block (5 lines × 3) research-ops/skills/market-research/scripts/config_loader.py:83— research-ops/skills/market-research/scripts/config_loader.py:83-87 | research-ops/skills/product-research/scripts/config_loader.py:83-87 | research-ops/skills/research-finance/scripts/config_loader.py:84-88 — before extracting anything, compare `research-ops/skills/market-research/scripts/config_loader.py` and `research-ops/skills/product-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:142— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:142-155 | c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:142-155 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:80— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:80-93 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:80-93 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 251 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) engineering-team/skills/senior-secops/scripts/security_scanner.py:155— engineering-team/skills/senior-secops/scripts/security_scanner.py:155-168 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:157-170 — 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.
Duplicated block (14 lines × 2) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:233— engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:233-246 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/outlier_detector.py:235-248 — 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.
Duplicated block (14 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:48— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:48-61 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:48-61 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:129— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:129-142 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:129-142 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py` and `engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:143— engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:143-156 | engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:159-172 — 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 (14 lines × 2) engineering/skills/dependency-auditor/scripts/dep_scanner.py:420— engineering/skills/dependency-auditor/scripts/dep_scanner.py:420-433 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:532-545 — 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 `engineering/skills/dependency-auditor/scripts/dep_scanner.py:420` 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.
Duplicated block (14 lines × 2) finance/skills/stock-analysis/scripts/score.py:1371— finance/skills/stock-analysis/scripts/score.py:1371-1384 | finance/skills/stock-analysis/scripts/score.py:1531-1544 — 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 (14 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:185— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:185-198 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:185-198 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:342— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:342-355 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:342-355 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:217— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:217-230 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:217-230 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (14 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go:85— engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go:85-98 | engineering/skills/kubernetes-operator/assets/reconcile_skeleton.go:85-98 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go` and `engineering/skills/kubernetes-operator/assets/reconcile_skeleton.go` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go:85` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, 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.
TodoComment engineering-team/skills/senior-data-engineer/scripts/pipeline_orchestrator.py:303— # TODO: Implement {task.operator} for {task.task_id} — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering-team/skills/tdd-guide/scripts/test_generator.py:222— # TODO: Set up test data and dependencies — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering-team/skills/tdd-guide/scripts/test_generator.py:225— # TODO: Execute the code under test — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering-team/skills/tdd-guide/scripts/test_generator.py:228— # TODO: Verify expected behavior — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering-team/skills/tdd-guide/scripts/test_generator.py:293— # TODO: Implement test — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:12— # TODO: Move this to configuration file — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:88— # TODO: Implement proper user ID generation — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:196— # TODO: Implement soft delete instead — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:21— # TODO: These should come from environment or config — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:231— # TODO: Implement actual email sending — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:236— # TODO: Implement refund for different providers — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment marketing-skill/skills/marketing-demand-acquisition/scripts/calculate_cac.py:77— # TODO: accept channel data via --file <json> or stdin so the tool can be — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×12
Members sharing a duplicated core (6 members, 50+ identical tokens) agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:49— agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:49-88 | agent-launcher/skills/run-without-you/scripts/deployment_builder.py:59-135 | agent-launcher/skills/run-without-you/scripts/next_directions_writer.py:79-106 | agent-launcher/skills/wrap-up/scripts/overview_page.py:84-114 | agent-launcher/skills/wrap-up/scripts/primitives_inventory.py:72-90 | agent-launcher/skills/wrap-up/scripts/upgrade_suggester.py:56-80 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:450— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:450-483 | business-growth/skills/customer-success-manager/scripts/expansion_opportunity_scorer.py:377-410 | business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:428-473 | marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:278-343 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:406-455 | marketing-skill/skills/campaign-analytics/scripts/funnel_analyzer.py:243-301 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:43— business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:43-76 | business-growth/skills/sales-engineer/scripts/poc_planner.py:130-155 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:49-74 | engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:59-103 | ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:35-58 | ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:125-145 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250-302 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:272-316 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:271-313 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250-302 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:272-316 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:271-313 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:42— engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:42-61 | engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py:42-61 | engineering-team/skills/senior-data-scientist/scripts/model_evaluation_suite.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/ml_monitoring_suite.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/model_deployment_pipeline.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/rag_system_builder.py:42-61 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:308— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:308-355 | engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:304-375 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:401-483 | REDACTED:332-407 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:370-424 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:486-532 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:180— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:180-189 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:218-227 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:208-217 | marketing/landing/skills/landing/scripts/html_validator.py:241-250 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:197-206 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:168-177 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:46— engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:46-60 | engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:46-60 | engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:42-54 | engineering/skills/git-worktree-manager/scripts/worktree_manager.py:53-66 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_tester.py:67-99 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_versioner.py:74-88 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) markdown-html/skills/design-system/scripts/config_loader.py:80— markdown-html/skills/design-system/scripts/config_loader.py:80-86 | productivity/handoff/skills/handoff/scripts/config_loader.py:59-65 | research-ops/skills/clinical-research/scripts/config_loader.py:60-66 | research-ops/skills/market-research/scripts/config_loader.py:55-61 | research-ops/skills/product-research/scripts/config_loader.py:55-61 | research-ops/skills/research-finance/scripts/config_loader.py:56-62 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:204— marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:204-237 | marketing/linkedin/skills/linkedin-content/scripts/post_linter.py:299-321 | marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:197-295 | ra-qm-team/skills/quality-documentation-manager/scripts/document_version_control.py:376-456 | ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:426-477 | research/pulse/skills/pulse/scripts/citation_tracker.py:472-569 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:200— productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:200-250 | research/dossier/skills/dossier/scripts/citation_tracker.py:233-290 | research/grants/skills/grants/scripts/citation_tracker.py:243-299 | research/litreview/skills/litreview/scripts/citation_tracker.py:201-255 | research/patent/skills/patent/scripts/citation_tracker.py:196-237 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:172-213 — These 6 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 6 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 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:768— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:768-848 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:616-678 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:438-514 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:636-732 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:647-755 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:517-610 — These 6 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 6 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 6 times.
Duplicated block (19 lines × 2) business-operations/skills/process-mapper/scripts/bottleneck_detector.py:131— business-operations/skills/process-mapper/scripts/bottleneck_detector.py:131-149 | business-operations/skills/process-mapper/scripts/bottleneck_detector.py:158-176 — 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 `business-operations/skills/process-mapper/scripts/bottleneck_detector.py:131` 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 (19 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:293— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:293-311 | c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:293-311 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:154— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:154-172 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:154-172 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:154` 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. 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.
Duplicated block (19 lines × 2) commercial/skills/commercial-policy/scripts/exception_router.py:236— commercial/skills/commercial-policy/scripts/exception_router.py:236-254 | commercial/skills/commercial-policy/scripts/policy_linter.py:331-349 — 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.
Duplicated block (19 lines × 2) engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:364— engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:364-382 | engineering-team/skills/red-team/scripts/engagement_planner.py:321-339 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:364` 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 (19 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:80— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:80-98 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:80-98 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (19 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:101— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:101-119 | engineering/skills/feature-flags-architect/scripts/rollout_planner.py:101-119 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py` and `engineering/skills/feature-flags-architect/scripts/rollout_planner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (19 lines × 2) engineering/skills/browser-automation/scripts/form_automation_builder.py:300— engineering/skills/browser-automation/scripts/form_automation_builder.py:300-318 | engineering/skills/browser-automation/scripts/scraping_toolkit.py:226-244 — 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. 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.
Duplicated block (19 lines × 2) project-management/skills/scrum-master/scripts/sprint_health_scorer.py:279— project-management/skills/scrum-master/scripts/sprint_health_scorer.py:279-297 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:409-427 — 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 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.
Duplicated block (19 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:163— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:163-181 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:163-181 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:214— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:214-232 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:214-232 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (10 lines × 3) engineering-team/skills/incident-commander/scripts/pir_generator.py:1323— engineering-team/skills/incident-commander/scripts/pir_generator.py:1323-1332 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:413-423 | engineering-team/skills/tdd-guide/scripts/tdd_workflow.py:380-390 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:413` 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.
Duplicated block (10 lines × 3) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:234— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:234-243 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:187-196 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:232-241 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 3) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:373— engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:373-382 | ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:556-566 | ra-qm-team/skills/fda-consultant-specialist/scripts/qsr_compliance_checker.py:601-611 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:373` 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 (10 lines × 3) engineering/agenthub/skills/agenthub/scripts/board_manager.py:226— engineering/agenthub/skills/agenthub/scripts/board_manager.py:226-235 | engineering/agenthub/skills/agenthub/scripts/result_ranker.py:203-212 | engineering/agenthub/skills/agenthub/scripts/session_manager.py:268-277 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/agenthub/skills/agenthub/scripts/board_manager.py:226` 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. 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.
Duplicated block (10 lines × 3) engineering/skills/migration-architect/scripts/compatibility_checker.py:841— engineering/skills/migration-architect/scripts/compatibility_checker.py:841-850 | engineering/skills/migration-architect/scripts/migration_planner.py:625-634 | engineering/skills/migration-architect/scripts/rollback_generator.py:1073-1082 — 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 all 3 call sites, so a change lands once.
Duplicated block (10 lines × 3) engineering/skills/migration-architect/scripts/compatibility_checker.py:852— engineering/skills/migration-architect/scripts/compatibility_checker.py:852-861 | engineering/skills/migration-architect/scripts/migration_planner.py:636-645 | engineering/skills/migration-architect/scripts/rollback_generator.py:1084-1093 — 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 all 3 call sites, so a change lands once.
Duplicated block (10 lines × 3) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:241— productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:241-250 | research/grants/skills/grants/scripts/citation_tracker.py:290-299 | research/litreview/skills/litreview/scripts/citation_tracker.py:246-255 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (10 lines × 3) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:366— project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:366-375 | project-management/skills/confluence-expert/scripts/content_audit_analyzer.py:354-363 | project-management/skills/jira-expert/scripts/jql_query_builder.py:366-375 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (10 lines × 3) research/dossier/skills/dossier/scripts/citation_tracker.py:281— research/dossier/skills/dossier/scripts/citation_tracker.py:281-290 | research/patent/skills/patent/scripts/citation_tracker.py:228-237 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:204-213 — before extracting anything, compare `research/dossier/skills/dossier/scripts/citation_tracker.py` and `research/syllabus/skills/syllabus/scripts/citation_tracker.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (10 lines × 3) markdown-html/skills/md-document/scripts/html_renderer.py:342— markdown-html/skills/md-document/scripts/html_renderer.py:342-352 | markdown-html/skills/md-review/scripts/review_html_renderer.py:97-106 | markdown-html/skills/md-slides/scripts/deck_html_renderer.py:69-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (10 lines × 3) research-ops/skills/market-research/scripts/config_loader.py:65— research-ops/skills/market-research/scripts/config_loader.py:65-74 | research-ops/skills/product-research/scripts/config_loader.py:65-74 | research-ops/skills/research-finance/scripts/config_loader.py:66-75 — before extracting anything, compare `research-ops/skills/market-research/scripts/config_loader.py` and `research-ops/skills/product-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9 lines × 3) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:408— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:408-417 | project-management/skills/confluence-expert/scripts/space_structure_generator.py:418-426 | project-management/skills/jira-expert/scripts/workflow_validator.py:322-331 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:508— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:508-516 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:630-638 | business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:501-509 — 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 all 3 call sites, so a change lands once.
Duplicated block (9 lines × 3) business-growth/skills/sales-engineer/scripts/poc_planner.py:657— business-growth/skills/sales-engineer/scripts/poc_planner.py:657-665 | business-growth/skills/sales-engineer/scripts/poc_planner.py:688-696 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:496-504 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9 lines × 3) business-operations/skills/vendor-management/scripts/sla_compliance_tracker.py:320— business-operations/skills/vendor-management/scripts/sla_compliance_tracker.py:320-328 | business-operations/skills/vendor-management/scripts/vendor_risk_classifier.py:350-358 | business-operations/skills/vendor-management/scripts/vendor_scorer.py:409-417 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `business-operations/skills/vendor-management/scripts/sla_compliance_tracker.py:320` 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. 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.
Duplicated block (9 lines × 3) compliance-os/skills/compliance-os/scripts/audit_simulator.py:349— compliance-os/skills/compliance-os/scripts/audit_simulator.py:349-357 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:260-269 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:260-269 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) engineering-team/skills/code-reviewer/scripts/pr_analyzer.py:522— engineering-team/skills/code-reviewer/scripts/pr_analyzer.py:522-530 | engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:674-682 | ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:426-434 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:330— engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:330-344 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:431-439 | REDACTED:355-363 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:106— engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:106-114 | engineering/grill-me/skills/grill-me/scripts/question_generator.py:97-105 | engineering/handoff/skills/handoff/scripts/artifact_deduplicator.py:168-176 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (9 lines × 3) engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:253— engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:253-261 | productivity/capture/skills/capture/scripts/complexity_estimator.py:166-174 | productivity/capture/skills/capture/scripts/dump_classifier.py:138-146 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:253` 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. 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.
Duplicated block (9 lines × 3) REDACTED:800— REDACTED:800-808 | REDACTED:1079-1087 | engineering/skills/database-designer/schema_analyzer.py:833-841 — 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 all 3 call sites, so a change lands once.
Duplicated block (9 lines × 3) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:149— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:149-157 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:157-165 | productivity/roast/skills/roast/scripts/verdict_synthesizer.py:193-201 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (8 lines × 3) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:230— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:230-238 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:230-238 | compliance-os/skills/compliance-os/scripts/audit_simulator.py:352-359 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (8 lines × 3) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/auth_setup_guide.py:377— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/auth_setup_guide.py:377-384 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:226-233 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/workspace_audit.py:280-287 — 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 all 3 call sites, so a change lands once.
Duplicated block (8 lines × 3) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:99— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:99-106 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:81-88 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:94-101 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (8 lines × 3) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:140— engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:140-147 | engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:226-233 | engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:291-298 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (8 lines × 3) engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:320— engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:320-327 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:421-428 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:473-480 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:485` calls `generate_report`, `scan_content` and `engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:330` 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.
Duplicated block (8 lines × 3) engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:59— engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:59-66 | ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:35-42 | ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:125-132 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (8 lines × 3) markdown-html/skills/design-system/scripts/brand_palette_validator.py:209— markdown-html/skills/design-system/scripts/brand_palette_validator.py:209-216 | markdown-html/skills/design-system/scripts/brand_palette_validator.py:218-225 | markdown-html/skills/design-system/scripts/brand_palette_validator.py:227-234 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (8 lines × 3) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:440— marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:440-447 | marketing-skill/skills/free-tool-strategy/scripts/tool_roi_estimator.py:353-360 | marketing-skill/skills/referral-program/scripts/referral_roi_calculator.py:376-383 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (8 lines × 3) product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:127— product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:127-134 | product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:140-147 | product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:166-173 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (8 lines × 3) engineering/skills/observability-designer/scripts/alert_optimizer.py:73— engineering/skills/observability-designer/scripts/alert_optimizer.py:73-80 | engineering/skills/observability-designer/scripts/dashboard_generator.py:122-129 | engineering/skills/observability-designer/scripts/slo_designer.py:80-87 — 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 all 3 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.
Duplicated block (8 lines × 3) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:103— marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:103-110 | product-team/skills/product-skills/scripts/product_goal_router.py:137-144 | project-management/skills/pm-skills/scripts/pm_goal_router.py:108-115 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Hotspot: engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py:195— engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in validate_examples.main at line 195. 1 of those changes was a fix/bug commit, and the other 15 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/agent-memory/skills/agent-memory/scripts/validate_examples.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: scripts/generate-docs.py scripts/generate-docs.py:458— scripts/generate-docs.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in generate-docs.main at line 458. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- scripts/generate-docs.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: scripts/derive_counters.py scripts/derive_counters.py:273— scripts/derive_counters.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in derive_counters.run_check at line 273. 6 of those changes were fix/bug commits, and the other 7 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- scripts/derive_counters.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: engineering/skillopt-sleep/skillopt_sleep/cycle.py engineering/skillopt-sleep/skillopt_sleep/cycle.py:93— engineering/skillopt-sleep/skillopt_sleep/cycle.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in cycle.run_sleep_cycle at line 93. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/skillopt-sleep/skillopt_sleep/cycle.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: engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.py engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.py:98— engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in model_arithmetic.step at line 98. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.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: engineering/human-gate/skills/human-gate/scripts/human_gate.py engineering/human-gate/skills/human-gate/scripts/human_gate.py:431— engineering/human-gate/skills/human-gate/scripts/human_gate.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in human_gate.cmd_close at line 431. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/human-gate/skills/human-gate/scripts/human_gate.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: engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:375— engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in skill_plugin_emitter.emit at line 375. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.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: engineering/human-gate/skills/human-gate/scripts/review_page_builder.py engineering/human-gate/skills/human-gate/scripts/review_page_builder.py:292— engineering/human-gate/skills/human-gate/scripts/review_page_builder.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in review_page_builder.sanitize_attrs at line 292. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/human-gate/skills/human-gate/scripts/review_page_builder.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: engineering-team/skills/incident-response/scripts/incident_triage.py engineering-team/skills/incident-response/scripts/incident_triage.py:600— engineering-team/skills/incident-response/scripts/incident_triage.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in incident_triage.main at line 600. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering-team/skills/incident-response/scripts/incident_triage.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: productivity/deep-work/skills/deep-work/scripts/time_block_planner.py productivity/deep-work/skills/deep-work/scripts/time_block_planner.py:86— productivity/deep-work/skills/deep-work/scripts/time_block_planner.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in time_block_planner.plan at line 86. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- productivity/deep-work/skills/deep-work/scripts/time_block_planner.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.
Duplicated block (21 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:46— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:46-66 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:46-66 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:221— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:221-241 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:221-241 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:388— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:388-408 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:388-408 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 323 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:44— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py:44-64 | engineering/skills/kubernetes-operator/scripts/crd_validator.py:44-64 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/crd_validator.py` and `engineering/skills/kubernetes-operator/scripts/crd_validator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) engineering/skills/dependency-auditor/scripts/dep_scanner.py:474— engineering/skills/dependency-auditor/scripts/dep_scanner.py:474-494 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:560-580 — 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 `engineering/skills/dependency-auditor/scripts/dep_scanner.py:474` 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 (21 lines × 2) engineering/skills/migration-architect/scripts/migration_planner.py:637— engineering/skills/migration-architect/scripts/migration_planner.py:637-657 | engineering/skills/migration-architect/scripts/rollback_generator.py:1085-1105 — 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.
Duplicated block (21 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:138— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:138-158 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:138-158 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` and `ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:75— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:75-95 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:75-95 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:199— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:199-219 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:199-219 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) ra-qm-team/skills/information-security-manager-iso27001/scripts/compliance_checker.py:353— ra-qm-team/skills/information-security-manager-iso27001/scripts/compliance_checker.py:353-373 | ra-qm-team/skills/isms-audit-expert/scripts/isms_audit_scheduler.py:236-256 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/skills/information-security-manager-iso27001/scripts/compliance_checker.py:353` 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 (8 lines × 4) business-growth/skills/sales-engineer/scripts/poc_planner.py:620— business-growth/skills/sales-engineer/scripts/poc_planner.py:620-627 | business-growth/skills/sales-engineer/scripts/poc_planner.py:659-666 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:436-443 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:498-505 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 4) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:153— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:153-160 | c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:168-175 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:153-160 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:168-175 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:151` calls `add_argument` and `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:166` 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.
Duplicated block (8 lines × 4) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194-201 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:260-267 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194-201 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:260-267 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (8 lines × 4) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:733— c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:733-740 | c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:804-811 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:574-581 | c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:518-525 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (8 lines × 4) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:146— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:146-153 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:146-153 | engineering/skills/slo-architect/scripts/slo_review.py:139-146 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:139-146 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (8 lines × 4) REDACTED:800— REDACTED:800-807 | REDACTED:1079-1086 | engineering/skills/database-designer/schema_analyzer.py:833-840 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:761-768 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (8 lines × 4) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:224— marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:224-231 | marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:239-247 | marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:242-251 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:261-268 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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.
Duplicated block (8 lines × 4) productivity/handoff/hooks/session_end.py:43— productivity/handoff/hooks/session_end.py:43-50 | productivity/handoff/hooks/session_start.py:46-53 | productivity/handoff/skills/handoff/scripts/cleanup.py:28-35 | productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:69-76 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (8 lines × 4) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:249— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:249-256 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:196-203 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:249-256 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:196-203 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
AC3 · Page structure· Page without a main landmark · ×8
Page without a main landmark .codex/skills/md-review/assets/md_review_template.html:11— 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 .codex/skills/md-slides/assets/md_slides_template.html:11— 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 .hermes/skills/claude-skills/markdown-html/md-review/assets/md_review_template.html:11— 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 .hermes/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:11— 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 .vibe/skills/claude-skills/markdown-html/md-review/assets/md_review_template.html:11— 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 .vibe/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:11— 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 markdown-html/skills/md-review/assets/md_review_template.html:11— 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 markdown-html/skills/md-slides/assets/md_slides_template.html:11— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Duplicated block (22 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:378— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:378-399 | c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:378-399 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (22 lines × 2) engineering-team/skills/senior-secops/scripts/compliance_checker.py:403— engineering-team/skills/senior-secops/scripts/compliance_checker.py:403-424 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:444-465 — 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 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.
Duplicated block (22 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:101— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:101-122 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:101-122 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (22 lines × 2) engineering/skills/agent-designer/agent_evaluator.py:556— engineering/skills/agent-designer/agent_evaluator.py:556-577 | engineering/skills/agent-designer/agent_evaluator.py:581-602 — 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 (22 lines × 2) engineering/skills/slo-architect/scripts/error_budget_calculator.py:130— engineering/skills/slo-architect/scripts/error_budget_calculator.py:130-151 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:130-151 — before extracting anything, compare `engineering/skills/slo-architect/scripts/error_budget_calculator.py` and `engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (22 lines × 2) marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:406— marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:406-427 | marketing-skill/skills/campaign-analytics/scripts/funnel_analyzer.py:243-264 — 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.
Duplicated block (22 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:163— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:163-184 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:163-184 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (22 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:121— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:121-142 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:121-142 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (17 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:72— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:72-88 | c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:72-88 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (17 lines × 2) c-level-advisor/skills/chro-advisor/scripts/comp_benchmarker.py:579— c-level-advisor/skills/chro-advisor/scripts/comp_benchmarker.py:579-595 | c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:538-554 — 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.
Duplicated block (17 lines × 2) engineering-team/skills/code-reviewer/scripts/review_report_generator.py:52— engineering-team/skills/code-reviewer/scripts/review_report_generator.py:52-68 | engineering-team/skills/code-reviewer/scripts/review_report_generator.py:72-88 — 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 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.
Duplicated block (17 lines × 2) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1616— engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1616-1632 | engineering-team/skills/senior-data-engineer/scripts/etl_performance_optimizer.py:1665-1681 — 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.
Duplicated block (17 lines × 2) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:209— engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:209-228 | engineering-team/skills/tdd-guide/scripts/coverage_analyzer.py:58-74 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) marketing-skill/skills/schema-markup/scripts/schema_validator.py:393— marketing-skill/skills/schema-markup/scripts/schema_validator.py:393-409 | marketing-skill/skills/site-architecture/scripts/sitemap_analyzer.py:331-347 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:275— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:275-291 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:275-291 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) engineering/skills/spec-driven-workflow/scripts/spec_validator.py:143— engineering/skills/spec-driven-workflow/scripts/spec_validator.py:143-159 | engineering/skills/spec-driven-workflow/scripts/spec_validator.py:173-189 — 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 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.
Duplicated block (12 lines × 3) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:372— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:372-383 | c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:372-383 | engineering/write-a-skill/skills/write-a-skill/scripts/skill_description_validator.py:231-242 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12 lines × 3) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:605— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:605-616 | engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:563-574 | engineering-team/skills/senior-architect/scripts/project_architect.py:689-700 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:605` 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 (12 lines × 3) engineering/caveman/skills/caveman/scripts/caveman_compressor.py:223— engineering/caveman/skills/caveman/scripts/caveman_compressor.py:223-234 | engineering/caveman/skills/caveman/scripts/caveman_lint.py:168-179 | engineering/caveman/skills/caveman/scripts/token_savings_estimator.py:114-125 — 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 all 3 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/caveman/skills/caveman/scripts/token_savings_estimator.py:113` calls `add_argument` and `engineering/caveman/skills/caveman/scripts/caveman_compressor.py:222` 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.
Duplicated block (12 lines × 3) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:229— engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:229-240 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:204-215 | engineering/data-quality-auditor/skills/data-quality-auditor/scripts/outlier_detector.py:231-242 — 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 all 3 call sites, so a change lands once.
Duplicated block (12 lines × 3) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:624— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:624-635 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:757-768 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1222-1233 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (12 lines × 3) engineering/skills/observability-designer/scripts/alert_optimizer.py:347— engineering/skills/observability-designer/scripts/alert_optimizer.py:347-358 | project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:341-352 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:591-602 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (12 lines × 3) engineering/skills/tc-tracker/scripts/tc_create.py:58— engineering/skills/tc-tracker/scripts/tc_create.py:58-69 | engineering/skills/tc-tracker/scripts/tc_update.py:103-114 | engineering/skills/tc-tracker/scripts/tc_validator.py:288-299 — 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 all 3 call sites, so a change lands once. 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.
Duplicated block (12 lines × 3) marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:328— marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:328-339 | marketing-skill/skills/launch-strategy/scripts/launch_readiness_scorer.py:264-275 | marketing-skill/skills/signup-flow-cro/scripts/funnel_drop_analyzer.py:284-295 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (6 lines × 4) business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:393— business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:393-399 | business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:410-417 | markdown-html/skills/markdown-html-orchestrator/scripts/route_explainer.py:123-128 | productivity/capture/skills/capture/scripts/complexity_estimator.py:146-151 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:393` 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.
Duplicated block (6 lines × 4) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:228— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:228-233 | c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:230-235 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:228-233 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:230-235 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (6 lines × 4) c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194— c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194-199 | c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:190-195 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:194-199 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:190-195 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (6 lines × 4) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-237 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-237 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:248-253 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:248-253 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 4) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:611— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:611-617 | engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:569-575 | engineering-team/skills/senior-architect/scripts/project_architect.py:695-701 | engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:1043-1048 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (6 lines × 4) markdown-html/skills/design-system/scripts/brand_palette_validator.py:307— markdown-html/skills/design-system/scripts/brand_palette_validator.py:307-312 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:243-248 | marketing/landing/skills/landing/scripts/kebab_slug_generator.py:99-104 | productivity/capture/skills/capture/scripts/workspace_inventory.py:182-187 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `argv` to `list[str]` in one and `List[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `markdown-html/skills/design-system/scripts/brand_palette_validator.py:304` calls `add_argument` and `marketing/landing/skills/landing/scripts/kebab_slug_generator.py:97` 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.
Duplicated block (6 lines × 4) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:186— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:186-191 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:181-186 | productivity/roast/skills/roast/scripts/cheapest_test_designer.py:171-176 | productivity/roast/skills/roast/scripts/verdict_synthesizer.py:222-227 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (6 lines × 4) research-ops/skills/clinical-research/scripts/endpoint_selector.py:160— research-ops/skills/clinical-research/scripts/endpoint_selector.py:160-165 | research-ops/skills/market-research/scripts/market_sizer.py:139-144 | research-ops/skills/market-research/scripts/segmentation_scorer.py:117-122 | research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:160-165 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `research-ops/skills/clinical-research/scripts/endpoint_selector.py:160` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:157` calls `add_argument` and `research-ops/skills/clinical-research/scripts/endpoint_selector.py:158` 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.
Duplicated block (5 lines × 4) business-growth/skills/sales-engineer/scripts/poc_planner.py:699— business-growth/skills/sales-engineer/scripts/poc_planner.py:699-704 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:208-212 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:208-212 | research/litreview/skills/litreview/scripts/framework_recommender.py:163-167 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `research/litreview/skills/litreview/scripts/framework_recommender.py:169` calls `sum`, `values`, `join` and `business-growth/skills/sales-engineer/scripts/poc_planner.py:706` 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.
Duplicated block (5 lines × 4) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:283— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:283-287 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:280-284 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:283-287 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:280-284 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (5 lines × 4) engineering-team/skills/azure-cloud-architect/scripts/architecture_designer.py:496— engineering-team/skills/azure-cloud-architect/scripts/architecture_designer.py:496-500 | engineering/skills/migration-architect/scripts/rollback_generator.py:955-961 | productivity/email/skills/inbox-triage/scripts/search_window_calculator.py:88-92 | research/pulse/skills/pulse/scripts/time_window_calculator.py:92-96 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/migration-architect/scripts/rollback_generator.py:963` calls `items` and `productivity/email/skills/inbox-triage/scripts/search_window_calculator.py:93` 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.
Duplicated block (5 lines × 4) marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213— marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213-218 | marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:207-212 | ra-qm-team/skills/quality-documentation-manager/scripts/document_version_control.py:388-392 | ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:430-434 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213` 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 × 4) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:221— marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:221-225 | marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:236-241 | marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:259-264 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:258-262 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:221` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:219` calls `add_argument` and `marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:259` 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.
Duplicated block (5 lines × 4) c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:410— c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:410-418 | marketing-skill/skills/ab-test-setup/scripts/sample_size_calculator.py:208-212 | marketing-skill/skills/launch-strategy/scripts/launch_readiness_scorer.py:205-209 | marketing-skill/skills/signup-flow-cro/scripts/funnel_drop_analyzer.py:200-204 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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.
Duplicated block (5 lines × 4) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:29— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:29-33 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:29-33 | engineering/skills/slo-architect/scripts/slo_review.py:31-35 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:31-35 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 4) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27-31 | engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:27-31 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:27-31 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:27-31 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py` and `engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
TooManyMethods: PIRGenerator engineering-team/skills/incident-commander/scripts/pir_generator.py:27— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× 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.
TooManyMethods: Analysis finance/skills/stock-analysis/scripts/ratios.py:736— TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× 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.
TooManyMethods: APIScoringEngine engineering/skills/api-design-reviewer/scripts/api_scorecard.py:117— TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× 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.
TooManyMethods: SchemaAnalyzer engineering/skills/database-designer/schema_analyzer.py:103— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× 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.
TooManyMethods: AlertOptimizer engineering/skills/observability-designer/scripts/alert_optimizer.py:28— TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× 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.
TooManyMethods: ComplianceChecker engineering-team/skills/senior-secops/scripts/compliance_checker.py:51— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× 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.
TooManyMethods: UpgradePlanner engineering/skills/dependency-auditor/scripts/upgrade_planner.py:89— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
Duplicated block (20 lines × 2) commercial/skills/channel-economics/scripts/channel_mix_optimizer.py:290— commercial/skills/channel-economics/scripts/channel_mix_optimizer.py:290-309 | commercial/skills/channel-economics/scripts/channel_roi_analyzer.py:238-257 — 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 `commercial/skills/channel-economics/scripts/channel_mix_optimizer.py:290` 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. 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.
Duplicated block (20 lines × 2) engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:662— engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:662-681 | ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:414-433 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:662` 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 (20 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:116— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:116-135 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:116-135 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (20 lines × 2) engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:358— engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:358-377 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:379-398 — 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 `engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:358` 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 (20 lines × 2) marketing-skill/skills/content-production/scripts/content_quality_gates.py:222— marketing-skill/skills/content-production/scripts/content_quality_gates.py:222-241 | marketing-skill/skills/copy-editing/scripts/ai_content_detector.py:240-259 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 2) project-management/skills/atlassian-templates/scripts/template_scaffolder.py:351— project-management/skills/atlassian-templates/scripts/template_scaffolder.py:351-370 | project-management/skills/jira-expert/scripts/jql_query_builder.py:440-459 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 2) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:281— engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:281-300 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:387-406 — 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.
Duplicated block (6 lines × 3) compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:364— compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:364-369 | research/pulse/skills/pulse/scripts/citation_tracker.py:419-424 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:151-156 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6 lines × 3) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:220— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:220-225 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:246-251 | productivity/capture/skills/capture/scripts/dump_classifier.py:131-136 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6 lines × 3) engineering/skills/agent-designer/agent_evaluator.py:1145— engineering/skills/agent-designer/agent_evaluator.py:1145-1150 | engineering/skills/agent-designer/agent_planner.py:881-886 | engineering/skills/agent-designer/tool_schema_generator.py:902-907 — 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 all 3 call sites, so a change lands once.
Duplicated block (6 lines × 3) engineering/skills/slo-architect/scripts/slo_review.py:155— engineering/skills/slo-architect/scripts/slo_review.py:155-160 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:155-160 | research/research/skills/research/scripts/classifier.py:168-173 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_review.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_review.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 3) markdown-html/skills/md-document/scripts/html_renderer.py:505— markdown-html/skills/md-document/scripts/html_renderer.py:505-510 | markdown-html/skills/md-review/scripts/review_html_renderer.py:402-407 | markdown-html/skills/md-slides/scripts/deck_html_renderer.py:461-466 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `markdown-html/skills/md-review/scripts/review_html_renderer.py:409` calls `_derive_danger_color` and `markdown-html/skills/md-slides/scripts/deck_html_renderer.py:468` 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.
Duplicated block (6 lines × 3) marketing-skill/skills/copy-editing/scripts/readability_scorer.py:205— marketing-skill/skills/copy-editing/scripts/readability_scorer.py:205-210 | marketing-skill/skills/page-cro/scripts/conversion_audit.py:358-363 | marketing-skill/skills/seo-audit/scripts/seo_checker.py:306-311 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing-skill/skills/page-cro/scripts/conversion_audit.py:356` calls `add_argument` and `marketing-skill/skills/copy-editing/scripts/readability_scorer.py:203` 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.
Duplicated block (6 lines × 3) research-ops/skills/market-research/scripts/onboard.py:42— research-ops/skills/market-research/scripts/onboard.py:42-47 | research-ops/skills/product-research/scripts/onboard.py:51-56 | research-ops/skills/research-finance/scripts/onboard.py:45-50 — before extracting anything, compare `research-ops/skills/market-research/scripts/onboard.py` and `research-ops/skills/product-research/scripts/onboard.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 2) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:553— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:553-575 | engineering-team/skills/senior-architect/scripts/project_architect.py:679-701 — 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 `engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:553` 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 (23 lines × 2) engineering-team/skills/senior-backend/scripts/api_scaffolder.py:585— engineering-team/skills/senior-backend/scripts/api_scaffolder.py:585-607 | engineering-team/skills/senior-frontend/scripts/component_generator.py:250-272 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-backend/scripts/api_scaffolder.py:585` 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. 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.
Duplicated block (23 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:101— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:101-123 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:101-123 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py` and `engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (23 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:76— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:76-98 | engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:76-98 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py` and `engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (23 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:37— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:37-59 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:37-59 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (23 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:112— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:112-134 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:112-134 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:112` 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.
Duplicated block (18 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:250— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:250-267 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:250-267 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:377— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:377-394 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:377-394 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (18 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:344— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:344-361 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:344-361 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 323 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) engineering/karpathy-coder/skills/karpathy-coder/scripts/assumption_linter.py:112— engineering/karpathy-coder/skills/karpathy-coder/scripts/assumption_linter.py:112-129 | engineering/karpathy-coder/skills/karpathy-coder/scripts/goal_verifier.py:167-184 — 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.
Duplicated block (18 lines × 2) engineering/skills/slo-architect/scripts/slo_review.py:155— engineering/skills/slo-architect/scripts/slo_review.py:155-172 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:155-172 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_review.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_review.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (18 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:164— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:164-181 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:164-181 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` and `ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10–11 lines × 2) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:367— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:367-376 | business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:326-336 — 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.
Duplicated block (10–11 lines × 2) business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:634— business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:634-644 | business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:505-514 — 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 `business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:634` 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.
Duplicated block (10–11 lines × 2) engineering/llm-wiki/skills/llm-wiki/scripts/graph_analyzer.py:50— engineering/llm-wiki/skills/llm-wiki/scripts/graph_analyzer.py:50-59 | engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py:68-78 — 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.
Duplicated block (10–11 lines × 2) engineering/skills/changelog-generator/scripts/commit_linter.py:68— engineering/skills/changelog-generator/scripts/commit_linter.py:68-77 | engineering/skills/changelog-generator/scripts/generate_changelog.py:104-114 — 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 `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.
Duplicated block (10–11 lines × 2) engineering/write-a-skill/skills/write-a-skill/scripts/skill_review_checklist_runner.py:248— engineering/write-a-skill/skills/write-a-skill/scripts/skill_review_checklist_runner.py:248-257 | engineering/write-a-skill/skills/write-a-skill/scripts/skill_structure_validator.py:256-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. 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.
Duplicated block (10–11 lines × 2) marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:209— marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:209-218 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:300-310 — 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.
Duplicated block (5 lines × 5) business-growth/skills/sales-engineer/scripts/poc_planner.py:594— business-growth/skills/sales-engineer/scripts/poc_planner.py:594-598 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:429-433 | REDACTED:804-808 | REDACTED:1083-1087 | engineering/skills/database-designer/schema_analyzer.py:837-841 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (5 lines × 5) compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:364— compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:364-368 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:244-248 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:244-248 | research/pulse/skills/pulse/scripts/citation_tracker.py:419-423 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:151-155 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (5 lines × 5) engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:234— engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:234-240 | engineering/agenthub/skills/agenthub/scripts/hub_init.py:184-190 | ra-qm-team/skills/capa-officer/scripts/root_cause_analyzer.py:439-443 | ra-qm-team/skills/regulatory-affairs-head/scripts/regulatory_pathway_analyzer.py:498-502 | ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py:363-367 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (5 lines × 5) engineering/skills/changelog-generator/scripts/generate_changelog.py:64— engineering/skills/changelog-generator/scripts/generate_changelog.py:64-68 | engineering/skills/slo-architect/scripts/slo_designer.py:127-131 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:127-131 | marketing-skill/skills/aeo/scripts/citation_tracker.py:285-289 | productivity/roast/skills/roast/scripts/brief_builder.py:121-125 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 5) markdown-html/skills/design-system/scripts/brand_palette_validator.py:306— markdown-html/skills/design-system/scripts/brand_palette_validator.py:306-310 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:242-246 | marketing/landing/skills/landing/scripts/kebab_slug_generator.py:98-102 | productivity/capture/skills/capture/scripts/workspace_inventory.py:181-185 | research/dossier/skills/dossier/scripts/source_tier_classifier.py:210-214 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `argv` to `list[str]` in one and `List[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `markdown-html/skills/design-system/scripts/brand_palette_validator.py:304` calls `add_argument` and `marketing/landing/skills/landing/scripts/kebab_slug_generator.py:97` 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.
Duplicated block (5 lines × 5) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:554— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:554-558 | c-level-advisor/skills/cmo-advisor/scripts/growth_model_simulator.py:249-253 | c-level-advisor/skills/cmo-advisor/scripts/marketing_budget_modeler.py:248-252 | c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:398-402 | c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:272-276 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `c-level-advisor/skills/cmo-advisor/scripts/marketing_budget_modeler.py:255` calls `fmt_ratio` and `c-level-advisor/skills/cmo-advisor/scripts/growth_model_simulator.py:256` 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· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×5
Members sharing a duplicated core (5 members, 50+ identical tokens) commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:406— commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:406-451 | commercial/skills/commercial-forecaster/scripts/cohort_arr_projector.py:251-291 | commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:163-200 | commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:260-293 | commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:228-261 — These 5 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 5 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 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:82— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:82-118 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:82-118 | marketing-skill/skills/aeo/scripts/aeo_audit.py:292-323 | ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:161-199 | research/grants/skills/grants/scripts/citation_tracker.py:194-221 — These 5 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 5 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 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:184— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:184-221 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:562-597 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:822-856 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:998-1032 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1262-1296 — These 5 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 5 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 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) markdown-html/skills/design-system/scripts/onboard.py:174— markdown-html/skills/design-system/scripts/onboard.py:174-252 | research-ops/skills/clinical-research/scripts/onboard.py:89-140 | research-ops/skills/market-research/scripts/onboard.py:66-113 | research-ops/skills/product-research/scripts/onboard.py:75-120 | research-ops/skills/research-finance/scripts/onboard.py:69-116 — These 5 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 5 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 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:164— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:164-173 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:133-142 | productivity/roast/skills/roast/scripts/brief_builder.py:83-92 | productivity/roast/skills/roast/scripts/cheapest_test_designer.py:129-138 | productivity/roast/skills/roast/scripts/verdict_synthesizer.py:167-176 — These 5 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 5 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 5 times.
Duplicated block (35 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:368— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:368-402 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:368-402 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (35 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:51— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:51-85 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:51-85 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (35 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:15— engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:15-49 | engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:15-49 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` and `engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (35 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:63— engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:63-97 | engineering/skills/kubernetes-operator/scripts/reconcile_lint.py:63-97 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py` and `engineering/skills/kubernetes-operator/scripts/reconcile_lint.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (35 lines × 2) engineering/skills/slo-architect/scripts/slo_review.py:77— engineering/skills/slo-architect/scripts/slo_review.py:77-111 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:77-111 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_review.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_review.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (28 lines × 2) business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:486— business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:486-513 | business-growth/skills/sales-engineer/scripts/poc_planner.py:726-753 — 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.
Duplicated block (28 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:159— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:159-186 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:159-186 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (28 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:221— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:221-248 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:221-248 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (28 lines × 2) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:207— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:207-234 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:298-325 — 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 `c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:207` 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 (28 lines × 2) engineering/skills/slo-architect/scripts/error_budget_calculator.py:52— engineering/skills/slo-architect/scripts/error_budget_calculator.py:52-79 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:52-79 — before extracting anything, compare `engineering/skills/slo-architect/scripts/error_budget_calculator.py` and `engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (26 lines × 2) business-operations/skills/process-mapper/scripts/bottleneck_detector.py:236— business-operations/skills/process-mapper/scripts/bottleneck_detector.py:236-261 | business-operations/skills/process-mapper/scripts/cycle_time_analyzer.py:182-207 — 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.
Duplicated block (26 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:112— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:112-137 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:112-137 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (26 lines × 2) engineering/skills/slo-architect/scripts/slo_designer.py:129— engineering/skills/slo-architect/scripts/slo_designer.py:129-154 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:129-154 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (26 lines × 2) markdown-html/skills/design-system/scripts/onboard.py:180— markdown-html/skills/design-system/scripts/onboard.py:180-205 | research-ops/skills/clinical-research/scripts/onboard.py:93-118 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `markdown-html/skills/design-system/scripts/onboard.py:180` 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. 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.
Duplicated block (26 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:137— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:137-162 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:137-162 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 2) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:300— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:300-308 | engineering/deep-learning-book/skills/deep-learning-book/scripts/capacity_planner.py:200-207 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:300` 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.
Duplicated block (8–9 lines × 2) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:576— engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:576-584 | engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:569-576 — 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 `engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:576` 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 (8–9 lines × 2) project-management/skills/atlassian-templates/scripts/template_scaffolder.py:187— project-management/skills/atlassian-templates/scripts/template_scaffolder.py:187-195 | project-management/skills/atlassian-templates/scripts/template_scaffolder.py:211-218 — 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–9 lines × 2) ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:39— ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:39-47 | ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:129-136 — 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.
Duplicated block (8–9 lines × 2) scripts/smoke_json_output.py:78— scripts/smoke_json_output.py:78-85 | scripts/smoke_scripts.py:63-71 — before extracting anything, compare `scripts/smoke_json_output.py` and `scripts/smoke_scripts.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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.
AC3 · Page structure· Data table has no header cells · ×4
Data table has no header cells .codex/skills/a11y-audit/assets/sample-component.tsx:34— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
Data table has no header cells .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:34— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
Data table has no header cells .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:34— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
Data table has no header cells engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:34— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
AC3 · Page structure· Heading level jumps from h1 to h3 · ×4
Heading level jumps from h1 to h3 .codex/skills/md-slides/assets/md_slides_template.html:72— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 .hermes/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:72— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 .vibe/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:72— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 markdown-html/skills/md-slides/assets/md_slides_template.html:72— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Positive tabindex (5) .codex/skills/a11y-audit/assets/sample-component.tsx:25— A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM).
Positive tabindex (5) .hermes/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:25— A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM).
Positive tabindex (5) .vibe/skills/claude-skills/engineering-team/a11y-audit/assets/sample-component.tsx:25— A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM).
Positive tabindex (5) engineering-team/a11y-audit/skills/a11y-audit/assets/sample-component.tsx:25— A positive tabindex forces a manual tab order that fights the DOM and is fragile. Use tabindex="0" (or restructure the DOM).
AC4 · Keyboard semantics· Link used as a button (placeholder href) · ×4
Link used as a button (placeholder href) .codex/skills/md-slides/assets/md_slides_template.html:84— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) .hermes/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:84— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) .vibe/skills/claude-skills/markdown-html/md-slides/assets/md_slides_template.html:84— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) markdown-html/skills/md-slides/assets/md_slides_template.html:84— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Repeated repair: engineering/skillopt-sleep/skillopt_sleep/staging.py engineering/skillopt-sleep/skillopt_sleep/staging.py:56— engineering/skillopt-sleep/skillopt_sleep/staging.py changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is staging.redact_secrets at line 56), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(engineering): require --yes for schedule + close mkdir/chmod race (round-10)”; “fix(engineering): relabel misleading redaction placeholder (round-5 review)”; “fix(engineering): close round-4 review findings on vendored skillopt-sleep”; “fix(engineering): close round-3 review findings on vendored skillopt-sleep”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/skillopt-sleep/skillopt_sleep/staging.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.
Repeated repair: productivity/meetings/skills/meetings/scripts/action_item_extractor.py productivity/meetings/skills/meetings/scripts/action_item_extractor.py:105— productivity/meetings/skills/meetings/scripts/action_item_extractor.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is action_item_extractor.extract at line 105), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(meetings): stop crediting capitalized non-names in 'Name will ...' prose”; “fix(meetings): only a leading @mention confers action-item ownership”; “fix(deep-work): enforce the 10-min buffer before the end-of-day shallow batch”; “fix(meetings): action_item_extractor no longer reassigns owner to a mid-text @mention”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- productivity/meetings/skills/meetings/scripts/action_item_extractor.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.
Repeated repair: engineering/skillopt-sleep/skillopt_sleep/scheduler.py engineering/skillopt-sleep/skillopt_sleep/scheduler.py:154— engineering/skillopt-sleep/skillopt_sleep/scheduler.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is scheduler.unschedule at line 154), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(engineering): anchor scheduler.py's project marker match (round-9 bug)”; “fix(engineering): close CLI-output redaction gap (round-8 HIGH finding)”; “fix(engineering): address round-2 review findings on vendored skillopt-sleep”; “fix(engineering): close 3 safety gaps found by PR review in vendored skillopt-sleep”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/skillopt-sleep/skillopt_sleep/scheduler.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.
Repeated repair: engineering/book-to-skill/skills/book-to-skill/scripts/extract_document.py engineering/book-to-skill/skills/book-to-skill/scripts/extract_document.py:99— engineering/book-to-skill/skills/book-to-skill/scripts/extract_document.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is extract_document.resolve_workdir at line 99), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(book-to-skill): close the workdir race with fd pinning”; “fix(book-to-skill): skill-quality audit — runnable docs, honest gates”; “fix(book-to-skill): private per-invocation workdir; share budget constants”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-05-28..2026-08-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-05-28 15:53:02 +02:00' --until='2026-08-26 15:53:02 +02:00' --full-history --no-merges -- engineering/book-to-skill/skills/book-to-skill/scripts/extract_document.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.
Duplicated block (34 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:92— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:92-125 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:92-125 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (34 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:280— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:280-313 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:280-313 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (34 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:210— c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:210-243 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:210-243 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (34 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:73— engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:73-106 | engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py:73-106 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` and `engineering/skills/chaos-engineering/scripts/blast_radius_calculator.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (27 lines × 2) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:355— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:355-381 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:425-451 — 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 `c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:355` 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 (27 lines × 2) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1365— engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1365-1391 | engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1465-1491 — 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 (27 lines × 2) scripts/sync-hermes-skills.py:154— scripts/sync-hermes-skills.py:154-180 | scripts/sync-vibe-skills.py:191-217 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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.
Duplicated block (27 lines × 2) engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:29— engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:29-55 | engineering-team/skills/tech-stack-evaluator/scripts/migration_analyzer.py:38-66 — 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 `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.
Duplicated block (9–10 lines × 3) finance/skills/stock-analysis/scripts/ratios.py:1375— finance/skills/stock-analysis/scripts/ratios.py:1375-1383 | finance/skills/stock-analysis/scripts/ratios.py:1393-1401 | finance/skills/stock-analysis/scripts/ratios.py:1438-1447 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `finance/skills/stock-analysis/scripts/ratios.py:1375` 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 (9–10 lines × 3) marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:187— marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:187-196 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:240-248 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:287-295 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–10 lines × 3) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:156— marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:156-165 | product-team/skills/product-skills/scripts/product_goal_router.py:180-188 | project-management/skills/pm-skills/scripts/pm_goal_router.py:152-160 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:156` 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 (9–10 lines × 3) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:165— marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:165-174 | product-team/skills/product-skills/scripts/product_goal_router.py:189-197 | project-management/skills/pm-skills/scripts/pm_goal_router.py:161-169 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:165` 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 (7 lines × 4) business-operations/skills/internal-comms/scripts/change_announcement_builder.py:314— business-operations/skills/internal-comms/scripts/change_announcement_builder.py:314-320 | business-operations/skills/internal-comms/scripts/comms_calendar_builder.py:272-278 | business-operations/skills/internal-comms/scripts/comms_template_filler.py:325-331 | business-operations/skills/process-mapper/scripts/cycle_time_analyzer.py:207-213 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `business-operations/skills/internal-comms/scripts/change_announcement_builder.py:314` 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 (7 lines × 4) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-238 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-238 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:211-218 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:211-218 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 4) engineering/skills/agent-designer/agent_evaluator.py:1117— engineering/skills/agent-designer/agent_evaluator.py:1117-1123 | engineering/skills/agent-designer/tool_schema_generator.py:855-861 | engineering/skills/dependency-auditor/scripts/license_checker.py:961-969 | engineering/skills/observability-designer/scripts/alert_optimizer.py:1015-1023 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/dependency-auditor/scripts/license_checker.py:961` 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 (7 lines × 4) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:233— marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:233-239 | marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:249-255 | marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:253-259 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:270-276 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:233` 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. 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.
Duplicated block (6 lines × 5) engineering/skills/skill-tester/assets/sample-skill/scripts/text_processor.py:275— engineering/skills/skill-tester/assets/sample-skill/scripts/text_processor.py:275-280 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:207-212 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:207-212 | research/litreview/skills/litreview/scripts/citation_tracker.py:167-172 | research/litreview/skills/litreview/scripts/framework_recommender.py:162-167 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 5) marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:228— marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:228-233 | marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:223-228 | marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:238-244 | marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:241-248 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:260-265 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:220` calls `add_argument` and `marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:227` 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.
Duplicated block (6 lines × 5) research-ops/skills/clinical-research/scripts/endpoint_selector.py:161— research-ops/skills/clinical-research/scripts/endpoint_selector.py:161-166 | research-ops/skills/clinical-research/scripts/phase_gate_scorer.py:210-215 | research-ops/skills/market-research/scripts/segmentation_scorer.py:118-123 | research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:161-166 | research-ops/skills/research-finance/scripts/program_budget_planner.py:140-145 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `research-ops/skills/clinical-research/scripts/phase_gate_scorer.py:209` calls `add_argument` and `research-ops/skills/clinical-research/scripts/endpoint_selector.py:160` does not — after which the two agree again for 4 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.
Duplicated block (6 lines × 5) markdown-html/skills/design-system/scripts/config_loader.py:71— markdown-html/skills/design-system/scripts/config_loader.py:71-76 | research-ops/skills/clinical-research/scripts/config_loader.py:51-56 | research-ops/skills/market-research/scripts/config_loader.py:46-51 | research-ops/skills/product-research/scripts/config_loader.py:46-51 | research-ops/skills/research-finance/scripts/config_loader.py:47-52 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Low cohesion: UserService (LCOM4 5) engineering-team/skills/code-reviewer/assets/sample_csharp_clean.cs:25— UserService's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: LaunchChecklistGenerator (LCOM4 5) marketing-skill/skills/app-store-optimization/scripts/launch_checklist.py:10— LaunchChecklistGenerator's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: LocalizationHelper (LCOM4 4) marketing-skill/skills/app-store-optimization/scripts/localization_helper.py:9— LocalizationHelper's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ReviewAnalyzer (LCOM4 4) marketing-skill/skills/app-store-optimization/scripts/review_analyzer.py:11— ReviewAnalyzer's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
X2 · Cancellation propagation· Async method without CancellationToken · ×4
Async method without CancellationToken: HandleClickAsync engineering-team/skills/code-reviewer/assets/sample_csharp_clean.cs:43— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: FetchAsync engineering-team/skills/code-reviewer/assets/sample_csharp_clean.cs:50— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: HandleClick REDACTED:25— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: FetchAsync REDACTED:33— No CancellationToken parameter — this work can't be stopped early once started.
renderUserDashboard (cyclomatic 23) .codex/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body's own statements and 5 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.
renderUserDashboard (cyclomatic 23) .vibe/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body's own statements and 5 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.
renderUserDashboard (cyclomatic 23) .hermes/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body's own statements and 5 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.
FixmeComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:14— # FIXME: This should be in environment variables — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:74— # FIXME: This should query a discount service — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:248— # FIXME: Implement actual transaction lookup — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
renderUserDashboard (cognitive 38) .codex/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 12). Of this number, 27 points are the body's own statements and 11 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.
renderUserDashboard (cognitive 38) .vibe/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 12). Of this number, 27 points are the body's own statements and 11 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.
renderUserDashboard (cognitive 38) .hermes/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 12). Of this number, 27 points are the body's own statements and 11 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.
onboard.main (cognitive 23) research-ops/skills/clinical-research/scripts/onboard.py:88— onboard.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), loops 1 (2 pts), ternaries 1 (2 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.
onboard.main (cognitive 23) research-ops/skills/market-research/scripts/onboard.py:65— onboard.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), loops 1 (2 pts), ternaries 1 (2 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.
onboard.main (cognitive 23) research-ops/skills/research-finance/scripts/onboard.py:68— onboard.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), loops 1 (2 pts), ternaries 1 (2 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.
init (cognitive 23) .codex/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:29— init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). 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.
init (cognitive 23) .vibe/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:29— init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). 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.
init (cognitive 23) .hermes/skills/claude-skills/engineering/tech-debt-tracker/assets/sample_codebase/src/frontend.js:29— init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). 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.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (7 members, 50+ identical tokens) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:491— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:491-527 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:613-654 | business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:472-523 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:709-768 | c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:784-822 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:544-607 | c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:498-543 — These 7 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 7 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 7 times.
Members sharing a duplicated core (7 members, 50+ identical tokens) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:193— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:193-203 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:231-241 | markdown-html/skills/design-system/scripts/brand_palette_validator.py:285-299 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:221-235 | marketing/landing/skills/landing/scripts/html_validator.py:254-263 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:210-219 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:204-213 — These 7 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 7 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 7 times.
Members sharing a duplicated core (7 members, 50+ identical tokens) markdown-html/skills/design-system/scripts/config_loader.py:120— markdown-html/skills/design-system/scripts/config_loader.py:120-141 | productivity/handoff/skills/handoff/scripts/cleanup.py:125-161 | productivity/handoff/skills/handoff/scripts/config_loader.py:128-159 | research-ops/skills/clinical-research/scripts/config_loader.py:100-119 | research-ops/skills/market-research/scripts/config_loader.py:91-110 | research-ops/skills/product-research/scripts/config_loader.py:91-110 | research-ops/skills/research-finance/scripts/config_loader.py:92-111 — These 7 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 7 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 7 times.
Duplicated block (37 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:141— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:141-177 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:141-177 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (37 lines × 2) engineering-team/skills/senior-secops/scripts/compliance_checker.py:1038— engineering-team/skills/senior-secops/scripts/compliance_checker.py:1038-1074 | engineering-team/skills/senior-secops/scripts/security_scanner.py:402-438 — 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.
Duplicated block (37 lines × 2) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:140— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:140-176 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:140-176 — before extracting anything, compare `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` and `ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:140` 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. 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.
Duplicated block (33 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:79— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:79-111 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:79-111 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (33 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:181— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:181-213 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:181-213 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 171 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (33 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:240— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:240-272 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:240-272 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 3) engineering-team/skills/senior-secops/scripts/compliance_checker.py:1058— engineering-team/skills/senior-secops/scripts/compliance_checker.py:1058-1076 | engineering-team/skills/senior-secops/scripts/security_scanner.py:422-440 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:514-532 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-secops/scripts/compliance_checker.py:1058` 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 (19 lines × 3) marketing-skill/skills/analytics-tracking/scripts/tracking_plan_generator.py:355— marketing-skill/skills/analytics-tracking/scripts/tracking_plan_generator.py:355-373 | marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:167-185 | marketing-skill/skills/pricing-strategy/scripts/pricing_modeler.py:210-228 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (19 lines × 3) ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:447— ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:447-465 | ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:548-566 | ra-qm-team/skills/fda-consultant-specialist/scripts/qsr_compliance_checker.py:593-611 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:447` 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 (15–16 lines × 3) business-operations/skills/internal-comms/scripts/change_announcement_builder.py:304— business-operations/skills/internal-comms/scripts/change_announcement_builder.py:304-319 | business-operations/skills/internal-comms/scripts/comms_calendar_builder.py:263-277 | business-operations/skills/internal-comms/scripts/comms_template_filler.py:316-330 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `business-operations/skills/internal-comms/scripts/change_announcement_builder.py:304` 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 (15–16 lines × 3) business-operations/skills/procurement-optimizer/scripts/purchasing_cycle_analyzer.py:261— business-operations/skills/procurement-optimizer/scripts/purchasing_cycle_analyzer.py:261-275 | business-operations/skills/procurement-optimizer/scripts/spend_categorizer.py:368-383 | business-operations/skills/procurement-optimizer/scripts/supplier_consolidation.py:368-383 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `business-operations/skills/procurement-optimizer/scripts/spend_categorizer.py:368` 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. 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.
Duplicated block (15–16 lines × 3) research/grants/skills/grants/scripts/citation_tracker.py:176— research/grants/skills/grants/scripts/citation_tracker.py:176-190 | research/litreview/skills/litreview/scripts/citation_tracker.py:140-155 | research/pulse/skills/pulse/scripts/citation_tracker.py:395-409 — before extracting anything, compare `research/grants/skills/grants/scripts/citation_tracker.py` and `research/litreview/skills/litreview/scripts/citation_tracker.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (12–14 lines × 2) commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:406— commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:406-417 | commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:260-273 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12–14 lines × 2) engineering/skills/interview-system-designer/hiring_calibrator.py:284— engineering/skills/interview-system-designer/hiring_calibrator.py:284-295 | engineering/skills/interview-system-designer/hiring_calibrator.py:345-358 — 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 (12–14 lines × 2) scripts/smoke_json_output.py:153— scripts/smoke_json_output.py:153-164 | scripts/smoke_scripts.py:105-118 — before extracting anything, compare `scripts/smoke_json_output.py` and `scripts/smoke_scripts.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/smoke_scripts.py:105` 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. 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.
Duplicated block (13 lines × 3) engineering-team/skills/tdd-guide/scripts/framework_adapter.py:260— engineering-team/skills/tdd-guide/scripts/framework_adapter.py:260-272 | engineering-team/skills/tdd-guide/scripts/framework_adapter.py:290-302 | engineering-team/skills/tdd-guide/scripts/framework_adapter.py:305-317 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (13 lines × 3) engineering/skills/interview-system-designer/hiring_calibrator.py:1269— engineering/skills/interview-system-designer/hiring_calibrator.py:1269-1281 | engineering/skills/interview-system-designer/loop_designer.py:881-893 | engineering/skills/interview-system-designer/question_bank_generator.py:1033-1045 — 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 all 3 call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skills/interview-system-designer/loop_designer.py:879` calls `join`, `lower`, `isalnum` and `engineering/skills/interview-system-designer/hiring_calibrator.py:1267` 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.
Duplicated block (13 lines × 3) engineering/skills/skill-tester/scripts/quality_scorer.py:1166— engineering/skills/skill-tester/scripts/quality_scorer.py:1166-1178 | engineering/skills/skill-tester/scripts/script_tester.py:715-727 | engineering/skills/skill-tester/scripts/skill_validator.py:681-693 — 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 all 3 call sites, so a change lands once.
Duplicated block (12 lines × 4) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:141— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:141-152 | c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:157-168 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:141-152 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:157-168 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:153` calls `add_argument` and `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:169` does not — after which the two agree again for 4 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.
Duplicated block (12 lines × 4) engineering-team/skills/senior-backend/scripts/api_load_tester.py:585— engineering-team/skills/senior-backend/scripts/api_load_tester.py:585-596 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:1086-1097 | engineering-team/skills/senior-secops/scripts/security_scanner.py:450-461 | engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:542-553 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (12 lines × 4) research-ops/skills/clinical-research/scripts/onboard.py:129— research-ops/skills/clinical-research/scripts/onboard.py:129-140 | research-ops/skills/market-research/scripts/onboard.py:102-113 | research-ops/skills/product-research/scripts/onboard.py:109-120 | research-ops/skills/research-finance/scripts/onboard.py:105-116 — before extracting anything, compare `research-ops/skills/market-research/scripts/onboard.py` and `research-ops/skills/product-research/scripts/onboard.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `research-ops/skills/clinical-research/scripts/onboard.py:129` 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. 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.
Duplicated block (11 lines × 4) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:411— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:411-422 | engineering-team/skills/tdd-guide/scripts/tdd_workflow.py:378-389 | engineering/skillopt-sleep/skillopt_sleep/experiments/report.py:98-108 | marketing-skill/skills/local-seo-manager/scripts/service_area_generator.py:132-142 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:411` 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.
Duplicated block (11 lines × 4) engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:127— engineering/grill-me/skills/grill-me/scripts/decision_tree_extractor.py:127-137 | engineering/grill-me/skills/grill-me/scripts/question_generator.py:120-130 | engineering/handoff/skills/handoff/scripts/artifact_deduplicator.py:222-232 | engineering/handoff/skills/handoff/scripts/skill_recommender.py:163-173 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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.
Duplicated block (11 lines × 4) c-level-advisor/skills/ceo-advisor/scripts/strategy_analyzer.py:138— c-level-advisor/skills/ceo-advisor/scripts/strategy_analyzer.py:138-148 | engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:823-833 | engineering-team/skills/tech-stack-evaluator/scripts/security_assessor.py:230-248 | product-team/skills/competitive-teardown/scripts/competitive_matrix_builder.py:78-88 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `score` to `float` in one and `int` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (9–10 lines × 2) markdown-html/skills/design-system/scripts/brand_palette_validator.py:204— markdown-html/skills/design-system/scripts/brand_palette_validator.py:204-212 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:135-144 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9–10 lines × 2) markdown-html/skills/design-system/scripts/brand_palette_validator.py:233— markdown-html/skills/design-system/scripts/brand_palette_validator.py:233-241 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:165-174 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (9–10 lines × 2) productivity/email/skills/inbox-setup/scripts/kb_validator.py:239— productivity/email/skills/inbox-setup/scripts/kb_validator.py:239-248 | productivity/email/skills/inbox-triage/scripts/kb_reader.py:282-290 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `productivity/email/skills/inbox-setup/scripts/kb_validator.py:237` calls `add_argument` and `productivity/email/skills/inbox-triage/scripts/kb_reader.py:281` 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.
Duplicated block (9 lines × 6) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:463— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:463-471 | business-growth/skills/customer-success-manager/scripts/expansion_opportunity_scorer.py:390-398 | business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:453-461 | marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:310-318 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:426-434 | marketing-skill/skills/campaign-analytics/scripts/funnel_analyzer.py:263-271 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (9 lines × 6) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:180— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:180-188 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:218-226 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:208-216 | marketing/landing/skills/landing/scripts/html_validator.py:241-249 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:197-205 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:168-176 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. Note first that the copies are not typed on the same thing: the declarations holding them bind `findings` to `List[Dict[str, Any]]` in one and `List[Dict[str, str]]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (9 lines × 6) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:946— engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:946-954 | engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:958-966 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:833-841 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:845-853 | engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:660-668 | engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:672-680 — there are 6 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (9 lines × 4) engineering-team/skills/senior-architect/scripts/project_architect.py:198— engineering-team/skills/senior-architect/scripts/project_architect.py:198-206 | engineering-team/skills/senior-architect/scripts/project_architect.py:237-245 | engineering-team/skills/senior-architect/scripts/project_architect.py:275-283 | engineering-team/skills/senior-architect/scripts/project_architect.py:394-402 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (9 lines × 4) engineering/skills/database-designer/schema_analyzer.py:844— engineering/skills/database-designer/schema_analyzer.py:844-852 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:734-742 | engineering/skills/dependency-auditor/scripts/license_checker.py:930-938 | engineering/skills/dependency-auditor/scripts/upgrade_planner.py:950-958 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (9 lines × 4) finance/skills/stock-analysis/scripts/ratios.py:1375— finance/skills/stock-analysis/scripts/ratios.py:1375-1383 | finance/skills/stock-analysis/scripts/ratios.py:1393-1401 | finance/skills/stock-analysis/scripts/ratios.py:1438-1447 | finance/skills/stock-analysis/scripts/ratios.py:1575-1583 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `finance/skills/stock-analysis/scripts/ratios.py:1375` 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 (7–8 lines × 2) business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:392— business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:392-399 | productivity/capture/skills/capture/scripts/complexity_estimator.py:145-151 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:392` 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.
Duplicated block (7–8 lines × 2) c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:84— c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:84-91 | c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:98-104 — 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 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.
Duplicated block (7–8 lines × 2) marketing-skill/skills/copy-editing/scripts/readability_scorer.py:203— marketing-skill/skills/copy-editing/scripts/readability_scorer.py:203-210 | marketing-skill/skills/page-cro/scripts/conversion_audit.py:357-363 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `marketing-skill/skills/copy-editing/scripts/readability_scorer.py:203` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing-skill/skills/page-cro/scripts/conversion_audit.py:356` calls `add_argument` and `marketing-skill/skills/copy-editing/scripts/readability_scorer.py:203` does not — after which the two agree again for 4 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.
Duplicated block (7 lines × 6) business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:56— business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:56-62 | business-growth/skills/sales-engineer/scripts/poc_planner.py:143-149 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:62-68 | engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:62-68 | ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:38-44 | ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:128-134 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (7 lines × 6) markdown-html/skills/design-system/scripts/config_loader.py:80— markdown-html/skills/design-system/scripts/config_loader.py:80-86 | productivity/handoff/skills/handoff/scripts/config_loader.py:59-65 | research-ops/skills/clinical-research/scripts/config_loader.py:60-66 | research-ops/skills/market-research/scripts/config_loader.py:55-61 | research-ops/skills/product-research/scripts/config_loader.py:55-61 | research-ops/skills/research-finance/scripts/config_loader.py:56-62 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (7 lines × 6) markdown-html/skills/design-system/scripts/config_loader.py:121— markdown-html/skills/design-system/scripts/config_loader.py:121-127 | productivity/handoff/skills/handoff/scripts/config_loader.py:129-135 | research-ops/skills/clinical-research/scripts/config_loader.py:101-107 | research-ops/skills/market-research/scripts/config_loader.py:92-98 | research-ops/skills/product-research/scripts/config_loader.py:92-98 | research-ops/skills/research-finance/scripts/config_loader.py:93-99 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) compliance-os/skills/compliance-os/scripts/evidence_pool_generator.py:298— compliance-os/skills/compliance-os/scripts/evidence_pool_generator.py:298-304 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:197-203 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:197-203 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:325— engineering-team/skills/senior-backend/scripts/database_migration_tool.py:325-331 | engineering-team/skills/senior-backend/scripts/database_migration_tool.py:340-346 | engineering-team/skills/senior-backend/scripts/database_migration_tool.py:359-365 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) research/grants/skills/grants/scripts/citation_tracker.py:289— research/grants/skills/grants/scripts/citation_tracker.py:289-295 | research/litreview/skills/litreview/scripts/citation_tracker.py:245-251 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:203-209 — before extracting anything, compare `research/grants/skills/grants/scripts/citation_tracker.py` and `research/litreview/skills/litreview/scripts/citation_tracker.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 6) business-growth/skills/sales-engineer/scripts/poc_planner.py:601— business-growth/skills/sales-engineer/scripts/poc_planner.py:601-607 | c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-236 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:232-236 | marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:248-253 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:248-252 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:248-252 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5 lines × 6) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:68— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:68-72 | engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:82-86 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:68-72 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:82-86 | engineering/skills/slo-architect/scripts/slo_designer.py:90-94 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:90-94 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 6) engineering/skills/slo-architect/scripts/error_budget_calculator.py:130— engineering/skills/slo-architect/scripts/error_budget_calculator.py:130-134 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:130-134 | marketing/linkedin/skills/linkedin-engagement/scripts/outreach_volume_guard.py:169-173 | marketing/linkedin/skills/linkedin-strategy/scripts/cadence_planner.py:232-237 | marketing/linkedin/skills/linkedin-strategy/scripts/newsletter_planner.py:216-220 | research/research/skills/research/scripts/fallback_decomposer.py:88-92 — before extracting anything, compare `engineering/skills/slo-architect/scripts/error_budget_calculator.py` and `engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-strategy/scripts/cadence_planner.py:232` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing/linkedin/skills/linkedin-engagement/scripts/outreach_volume_guard.py:168` calls `add_argument` and `marketing/linkedin/skills/linkedin-strategy/scripts/cadence_planner.py:232` 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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×2
Animation without a prefers-reduced-motion guard docs/stylesheets/extra.css:216— `.md-typeset .md-button--primary` moves (`transition: transform 0.12s ease, box-shadow 0.18s ease, filter 0.18s ease`) 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.
Animation without a prefers-reduced-motion guard docs/stylesheets/extra.css:245— `.md-typeset .md-button:not(.md-button--primary)` moves (`transition: background-color 0.15s ease, border-color 0.15s ease, transform 0.12s ease`) 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.
term_sheet_analyzer.score (cyclomatic 48) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:80— term_sheet_analyzer.score has cyclomatic complexity 48 (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.
term_sheet_analyzer.score (cyclomatic 48) c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:80— term_sheet_analyzer.score has cyclomatic complexity 48 (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.
okf_linter.lint (cyclomatic 22) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:55— okf_linter.lint 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.
okf_linter.lint (cyclomatic 22) c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:55— okf_linter.lint 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.
ai_training_data_audit._decide (cyclomatic 21) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:123— ai_training_data_audit._decide 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.
ai_training_data_audit._decide (cyclomatic 21) c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:123— ai_training_data_audit._decide 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.
HackComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:21— # HACK: Using dict for now, should be proper database connection — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:226— # HACK: Using print instead of actual email service — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
XxxComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:89— # XXX: This is terrible for production — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:243— # XXX: This doesn't actually process the refund — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
okf_linter.lint (cognitive 41) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:55— okf_linter.lint has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 5 (7 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 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.
okf_linter.lint (cognitive 41) c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:55— okf_linter.lint has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 5 (7 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 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.
term_sheet_analyzer.score (cognitive 40) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:80— term_sheet_analyzer.score has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (27 pts), boolean chains 12, 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.
term_sheet_analyzer.score (cognitive 40) c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:80— term_sheet_analyzer.score has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (27 pts), boolean chains 12, 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.
ai_training_data_audit._decide (cognitive 35) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:123— ai_training_data_audit._decide has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 1 (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.
ai_training_data_audit._decide (cognitive 35) c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:123— ai_training_data_audit._decide has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 1 (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.
scaffold_bundle.main (cognitive 22) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:141— scaffold_bundle.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (6 pts), boolean chains 5, loops 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.
scaffold_bundle.main (cognitive 22) c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:141— scaffold_bundle.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (6 pts), boolean chains 5, loops 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.
ai_risk_classifier.render_text (cognitive 20) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:358— ai_risk_classifier.render_text has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 5, ternaries 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ai_risk_classifier.render_text (cognitive 20) c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:358— ai_risk_classifier.render_text has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 5, ternaries 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ai_risk_classifier.classify_eu (cognitive 17) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:78— ai_risk_classifier.classify_eu has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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.
ai_risk_classifier.classify_eu (cognitive 17) c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:78— ai_risk_classifier.classify_eu has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, 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.
operator_capability_audit.render_text (cognitive 17) engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:101— operator_capability_audit.render_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (6 pts), ternaries 1 (2 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.
operator_capability_audit.render_text (cognitive 17) engineering/skills/kubernetes-operator/scripts/operator_capability_audit.py:101— operator_capability_audit.render_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (6 pts), ternaries 1 (2 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.
aims_audit_scheduler.render_text (cognitive 16) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:179— aims_audit_scheduler.render_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 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.
aims_audit_scheduler.render_text (cognitive 16) ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:179— aims_audit_scheduler.render_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 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.
FunctionTooLong: full-page-screenshot.captureFullPage engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:221— FunctionTooLong — captureFullPage runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77× 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: full-page-screenshot.captureViaProxy engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:646— FunctionTooLong — captureViaProxy runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67× 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.
Near-duplicate member pair (51 shared lines) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:274— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:274-329 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:274-329 — These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (51 shared lines) scripts/sync-hermes-skills.py:206— scripts/sync-hermes-skills.py:206-276 | scripts/sync-vibe-skills.py:247-332 — These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (44 shared lines) business-growth/skills/sales-engineer/scripts/poc_planner.py:582— business-growth/skills/sales-engineer/scripts/poc_planner.py:582-722 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:418-511 — These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (44 shared lines) finance/skills/stock-analysis/scripts/score.py:1264— finance/skills/stock-analysis/scripts/score.py:1264-1385 | finance/skills/stock-analysis/scripts/score.py:1398-1555 — These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (43 shared lines) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194-241 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:194-241 — These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (43 shared lines) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:180— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:180-225 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:180-225 — These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (34 shared lines) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234-273 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:234-273 — These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (34 shared lines) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:199— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:199-243 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/workspace_audit.py:256-306 — These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×2
Edited copy of a member (19 corresponding lines) engineering/skills/slo-architect/scripts/error_budget_calculator.py:105— engineering/skills/slo-architect/scripts/error_budget_calculator.py:105-123 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:105-123 — These two members are one piece of code written twice and then edited apart: 19 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 (19 corresponding lines) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:122— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:122-140 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:122-140 — These two members are one piece of code written twice and then edited apart: 19 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· Members sharing a duplicated core (12 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (12 members, 50+ identical tokens) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:219— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:219-237 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:245-268 | productivity/capture/skills/capture/scripts/dump_classifier.py:130-153 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:235-259 | productivity/email/skills/inbox-setup/scripts/voice_sample_analyzer.py:266-295 | productivity/email/skills/inbox-triage/scripts/kb_reader.py:280-300 | productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:173-196 | productivity/reflect/skills/reflect/scripts/conversation_depth_analyzer.py:172-195 | research/dossier/skills/dossier/scripts/disconfirming_evidence_balance.py:182-209 | research/litreview/skills/litreview/scripts/cross_search_aggregator.py:211-235 | research/litreview/skills/litreview/scripts/framework_recommender.py:183-200 | research/patent/skills/patent/scripts/family_resolver.py:232-256 — These 12 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 12 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 12 times.
Members sharing a duplicated core (12 members, 50+ identical tokens) research-ops/skills/clinical-research/scripts/endpoint_selector.py:157— research-ops/skills/clinical-research/scripts/endpoint_selector.py:157-179 | research-ops/skills/clinical-research/scripts/phase_gate_scorer.py:205-230 | research-ops/skills/clinical-research/scripts/sample_size_estimator.py:158-201 | research-ops/skills/market-research/scripts/market_sizer.py:134-158 | research-ops/skills/market-research/scripts/sample_size_planner.py:147-179 | research-ops/skills/market-research/scripts/segmentation_scorer.py:114-135 | research-ops/skills/product-research/scripts/insight_synthesizer.py:93-109 | research-ops/skills/product-research/scripts/saturation_planner.py:107-140 | research-ops/skills/product-research/scripts/study_designer.py:112-135 | research-ops/skills/research-finance/scripts/burn_runway_tracker.py:128-149 | research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:155-185 | research-ops/skills/research-finance/scripts/program_budget_planner.py:134-161 — These 12 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 12 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 12 times.
Duplicated block (44 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:196— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:196-239 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:196-239 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (44 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:139— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:139-182 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:139-182 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (43 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:120— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:120-162 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:120-162 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (43 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:315— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:315-357 | c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py:315-357 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/contract_risk_scanner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (41 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:129— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:129-169 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:129-169 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (41 lines × 2) marketing-skill/skills/free-tool-strategy/scripts/tool_roi_estimator.py:333— marketing-skill/skills/free-tool-strategy/scripts/tool_roi_estimator.py:333-373 | marketing-skill/skills/referral-program/scripts/referral_roi_calculator.py:356-396 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (31 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:187— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:187-217 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:187-217 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (31 lines × 2) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:27— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:27-57 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:27-57 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (30 lines × 2) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:521— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:521-551 | engineering-team/skills/senior-architect/scripts/project_architect.py:648-677 — 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 `engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:521` 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.
Duplicated block (30 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:52— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:52-81 | engineering/skills/feature-flags-architect/scripts/rollout_planner.py:52-81 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py` and `engineering/skills/feature-flags-architect/scripts/rollout_planner.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:52` 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. 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.
Duplicated block (29 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:143— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py:143-171 | c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py:143-171 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/index_generator.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/index_generator.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (29 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:89— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:89-117 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:89-117 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (15–28 lines × 2) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:463— engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:463-490 | engineering-team/skills/senior-prompt-engineer/scripts/prompt_optimizer.py:418-432 — 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.
Duplicated block (15–28 lines × 2) scripts/sync-codex-skills.py:185— scripts/sync-codex-skills.py:185-212 | scripts/sync-gemini-skills.py:164-178 — 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.
Duplicated block (25 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:419— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:419-443 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:419-443 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (25 lines × 2) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:73— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py:73-97 | engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py:73-97 — before extracting anything, compare `engineering/feature-flags-architect/skills/feature-flags-architect/scripts/kill_switch_audit.py` and `engineering/skills/feature-flags-architect/scripts/kill_switch_audit.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (24 lines × 3) business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:43— business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:43-66 | business-growth/skills/sales-engineer/scripts/poc_planner.py:130-153 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:49-72 — 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 all 3 call sites, so a change lands once.
Duplicated block (24 lines × 3) research-ops/skills/market-research/scripts/onboard.py:69— research-ops/skills/market-research/scripts/onboard.py:69-92 | research-ops/skills/product-research/scripts/onboard.py:78-101 | research-ops/skills/research-finance/scripts/onboard.py:72-95 — before extracting anything, compare `research-ops/skills/market-research/scripts/onboard.py` and `research-ops/skills/product-research/scripts/onboard.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (24 lines × 2) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:491— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:491-514 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:613-636 — 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.
Duplicated block (24 lines × 2) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:585— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:585-608 | engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:786-809 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:585` 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 (20–23 lines × 2) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:199— engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_doctor.py:199-221 | engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/workspace_audit.py:256-275 — 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.
Duplicated block (20–23 lines × 2) engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:268— engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:268-290 | engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:337-356 — 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 `engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:268` 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. 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.
Duplicated block (21 lines × 3) business-operations/skills/process-mapper/scripts/bottleneck_detector.py:245— business-operations/skills/process-mapper/scripts/bottleneck_detector.py:245-265 | business-operations/skills/process-mapper/scripts/cycle_time_analyzer.py:191-211 | business-operations/skills/process-mapper/scripts/process_documenter.py:247-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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `business-operations/skills/process-mapper/scripts/bottleneck_detector.py:245` 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 (21 lines × 3) engineering/skills/api-design-reviewer/scripts/api_linter.py:937— engineering/skills/api-design-reviewer/scripts/api_linter.py:937-957 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1634-1654 | engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:1081-1101 — 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 all 3 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.
Duplicated block (17–19 lines × 2) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:110— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:110-126 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:106-124 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:106` 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.
Duplicated block (17–19 lines × 2) finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:145— finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:145-163 | finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:182-198 — 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 (17–18 lines × 2) business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:320— business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:320-337 | business-operations/skills/capacity-planner/scripts/utilization_analyzer.py:273-289 — 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 `business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:320` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `business-operations/skills/capacity-planner/scripts/utilization_analyzer.py:272` calls `add_argument` and `business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:320` 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.
Duplicated block (17–18 lines × 2) marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:218— marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:218-235 | marketing-skill/skills/programmatic-seo/scripts/url_pattern_generator.py:132-148 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15–17 lines × 2) engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:304— engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:304-320 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:402-416 — 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 `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:402` 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.
Duplicated block (15–17 lines × 2) engineering/skills/skill-tester/scripts/script_tester.py:636— engineering/skills/skill-tester/scripts/script_tester.py:636-652 | engineering/skills/skill-tester/scripts/skill_validator.py:611-625 — 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.
Duplicated block (15–16 lines × 2) business-operations/skills/capacity-planner/scripts/capacity_modeler.py:404— business-operations/skills/capacity-planner/scripts/capacity_modeler.py:404-419 | business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:327-341 — 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 `business-operations/skills/capacity-planner/scripts/capacity_modeler.py:404` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:325` calls `add_argument`, `parse_args` and `business-operations/skills/capacity-planner/scripts/capacity_modeler.py:404` 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.
Duplicated block (15–16 lines × 2) commercial/skills/rfp-responder/scripts/response_drafter.py:263— commercial/skills/rfp-responder/scripts/response_drafter.py:263-277 | commercial/skills/rfp-responder/scripts/winrate_predictor.py:230-245 — 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 `commercial/skills/rfp-responder/scripts/winrate_predictor.py:230` 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. 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.
Duplicated block (15 lines × 4) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:262— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:262-276 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:284-298 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:262-276 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:284-298 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (15 lines × 4) engineering-team/skills/senior-secops/scripts/compliance_checker.py:250— engineering-team/skills/senior-secops/scripts/compliance_checker.py:250-264 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:367-381 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:648-662 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:869-883 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (14–15 lines × 3) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:558— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:558-571 | engineering-team/skills/senior-architect/scripts/project_architect.py:684-697 | ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:408-422 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:558` 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 (14–15 lines × 3) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:337— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:337-350 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:272-285 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:338-352 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:337` 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. 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.
Duplicated block (14–15 lines × 2) marketing-skill/skills/app-store-optimization/scripts/launch_checklist.py:447— marketing-skill/skills/app-store-optimization/scripts/launch_checklist.py:447-461 | marketing-skill/skills/app-store-optimization/scripts/launch_checklist.py:476-489 — 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 (14–15 lines × 2) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:389— ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:389-403 | ra-qm-team/skills/qms-audit-expert/scripts/audit_schedule_optimizer.py:305-318 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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.
Duplicated block (12–13 lines × 5) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:46— engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:46-58 | engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:46-58 | engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:42-53 | engineering/skills/git-worktree-manager/scripts/worktree_manager.py:53-65 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_versioner.py:74-86 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. 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.
Duplicated block (12–13 lines × 5) markdown-html/skills/design-system/scripts/onboard.py:196— markdown-html/skills/design-system/scripts/onboard.py:196-208 | research-ops/skills/clinical-research/scripts/onboard.py:109-121 | research-ops/skills/market-research/scripts/onboard.py:84-95 | research-ops/skills/product-research/scripts/onboard.py:93-104 | research-ops/skills/research-finance/scripts/onboard.py:87-98 — before extracting anything, compare `research-ops/skills/market-research/scripts/onboard.py` and `research-ops/skills/product-research/scripts/onboard.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `research-ops/skills/market-research/scripts/onboard.py:84` 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. 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.
Duplicated block (11–13 lines × 3) marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:218— marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:218-230 | marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:206-216 | marketing-skill/skills/programmatic-seo/scripts/url_pattern_generator.py:132-143 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (11–13 lines × 3) marketing/landing/skills/landing/scripts/html_validator.py:121— marketing/landing/skills/landing/scripts/html_validator.py:121-133 | marketing/landing/skills/landing/scripts/html_validator.py:143-153 | marketing/landing/skills/landing/scripts/html_validator.py:172-182 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/landing/skills/landing/scripts/html_validator.py:121` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marketing/landing/skills/landing/scripts/html_validator.py:133` calls `add`, `search` and `marketing/landing/skills/landing/scripts/html_validator.py:182` 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.
Duplicated block (12–13 lines × 2) finance/skills/stock-analysis/scripts/score.py:1324— finance/skills/stock-analysis/scripts/score.py:1324-1336 | finance/skills/stock-analysis/scripts/score.py:1462-1473 — 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 (12–13 lines × 2) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:437— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:437-448 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:130-142 — 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.
Duplicated block (11–12 lines × 4) commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:411— commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:411-422 | commercial/skills/commercial-forecaster/scripts/cohort_arr_projector.py:253-263 | commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:165-175 | commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:267-278 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:411` 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. 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.
Duplicated block (11–12 lines × 4) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:622— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:622-633 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:693-704 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:726-737 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1221-1231 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (11 lines × 3) engineering/skills/skill-tester/scripts/quality_scorer.py:517— engineering/skills/skill-tester/scripts/quality_scorer.py:517-527 | engineering/skills/skill-tester/scripts/quality_scorer.py:803-813 | engineering/skills/skill-tester/scripts/quality_scorer.py:962-972 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:119— marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:119-129 | product-team/skills/product-skills/scripts/product_goal_router.py:152-162 | project-management/skills/pm-skills/scripts/pm_goal_router.py:124-134 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 5) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:467— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:467-476 | business-growth/skills/customer-success-manager/scripts/expansion_opportunity_scorer.py:394-403 | business-growth/skills/customer-success-manager/scripts/health_score_calculator.py:457-466 | marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:314-323 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:430-439 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (10 lines × 5) productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:164— productivity/andreessen/skills/andreessen/scripts/market_first_evaluator.py:164-173 | productivity/andreessen/skills/andreessen/scripts/pmf_signal_scorer.py:133-142 | productivity/roast/skills/roast/scripts/brief_builder.py:83-92 | productivity/roast/skills/roast/scripts/cheapest_test_designer.py:129-138 | productivity/roast/skills/roast/scripts/verdict_synthesizer.py:167-176 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. 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.
Duplicated block (7–9 lines × 2) engineering/llm-wiki/skills/llm-wiki/scripts/update_index.py:69— engineering/llm-wiki/skills/llm-wiki/scripts/update_index.py:69-77 | engineering/llm-wiki/skills/llm-wiki/scripts/wiki_search.py:47-53 — 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.
Duplicated block (7–9 lines × 2) ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:126— ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:126-134 | ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:216-222 — 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 (7–8 lines × 3) marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213— marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213-220 | marketing/linkedin/skills/linkedin-content/scripts/post_linter.py:304-310 | marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:207-214 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:213` 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 (7–8 lines × 3) marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:255— marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:255-261 | product-team/skills/product-skills/scripts/product_goal_router.py:148-154 | project-management/skills/pm-skills/scripts/pm_goal_router.py:119-126 — before extracting anything, compare `product-team/skills/product-skills/scripts/product_goal_router.py` and `project-management/skills/pm-skills/scripts/pm_goal_router.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:255` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:263` calls `add_argument` and `product-team/skills/product-skills/scripts/product_goal_router.py:156` 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.
Duplicated block (7 lines × 8) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250-256 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:359-365 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:272-278 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:274-280 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:250-256 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:359-365 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:272-278 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:274-280 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 8 times.
Duplicated block (7 lines × 8) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:238— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:238-244 | engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:245-251 | engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:252-258 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:191-197 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:198-204 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:236-242 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:243-249 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:250-256 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 5) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:508— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:508-514 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:630-636 | business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:501-507 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:731-737 | c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:802-808 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times.
Duplicated block (7 lines × 5) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:233— c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:233-240 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:247-253 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:325-331 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:338-344 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:351-357 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (4–6 lines × 3) engineering-team/skills/senior-backend/scripts/api_load_tester.py:537— engineering-team/skills/senior-backend/scripts/api_load_tester.py:537-557 | engineering-team/skills/senior-devops/scripts/pipeline_generator.py:183-186 | engineering-team/skills/senior-devops/scripts/terraform_scaffolder.py:462-467 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-backend/scripts/api_load_tester.py:537` 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. 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.
Duplicated block (4–6 lines × 3) project-management/skills/jira-expert/scripts/jql_query_builder.py:421— project-management/skills/jira-expert/scripts/jql_query_builder.py:421-424 | research/patent/skills/patent/scripts/sub_use_case_router.py:202-207 | research/patent/skills/patent/scripts/sub_use_case_router.py:210-215 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 7) REDACTED:1085— REDACTED:1085-1091 | engineering/skills/migration-architect/scripts/rollback_generator.py:955-961 | engineering/skills/slo-architect/scripts/slo_designer.py:94-98 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:94-98 | productivity/email/skills/inbox-triage/scripts/search_window_calculator.py:88-92 | research/litreview/skills/litreview/scripts/citation_tracker.py:168-173 | research/pulse/skills/pulse/scripts/time_window_calculator.py:92-96 — before extracting anything, compare `engineering/skills/slo-architect/scripts/slo_designer.py` and `engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `research/litreview/skills/litreview/scripts/citation_tracker.py:168` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:1093` calls `enumerate` and `engineering/skills/slo-architect/scripts/slo_designer.py:99` 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.
Duplicated block (5 lines × 7) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:134— productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:134-138 | research/dossier/skills/dossier/scripts/citation_tracker.py:157-161 | research/grants/skills/grants/scripts/citation_tracker.py:168-172 | research/litreview/skills/litreview/scripts/citation_tracker.py:132-136 | research/patent/skills/patent/scripts/citation_tracker.py:153-157 | research/pulse/skills/pulse/scripts/citation_tracker.py:387-391 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:135-139 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 7 times. 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.
Duplicated block (6 lines × 2 locations) engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:203— engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:203 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:226 — 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.
Duplicated block (6 lines × 2 locations) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:397— engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:397 · engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:418 — 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.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 21 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
generate-docs.main (cyclomatic 74) scripts/generate-docs.py:458— generate-docs.main has cyclomatic complexity 74 (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.
collect_sessions.parse_claude_session (cyclomatic 55) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:252— collect_sessions.parse_claude_session has cyclomatic complexity 55 (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.
pricing_model_picker.score_models (cyclomatic 50) commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:85— pricing_model_picker.score_models has cyclomatic complexity 50 (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.
tc_update.main (cyclomatic 48) engineering/skills/tc-tracker/scripts/tc_update.py:128— tc_update.main has cyclomatic complexity 48 (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.
tc_validator.validate_tc_record (cyclomatic 48) engineering/skills/tc-tracker/scripts/tc_validator.py:123— tc_validator.validate_tc_record has cyclomatic complexity 48 (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.
profile_completeness_auditor.evaluate_check (cyclomatic 47) marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:104— profile_completeness_auditor.evaluate_check has cyclomatic complexity 47 (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.
comp_benchmarker.print_report (cyclomatic 46) c-level-advisor/skills/chro-advisor/scripts/comp_benchmarker.py:275— comp_benchmarker.print_report 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.
okr_tracker.format_report (cyclomatic 43) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:406— okr_tracker.format_report 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.
policy_linter.lint (cyclomatic 42) commercial/skills/commercial-policy/scripts/policy_linter.py:114— policy_linter.lint has cyclomatic complexity 42 (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.
score.run_scorecard (cyclomatic 42) finance/skills/stock-analysis/scripts/score.py:637— score.run_scorecard has cyclomatic complexity 42 (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.
threat_signal_analyzer.main (cyclomatic 41) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:408— threat_signal_analyzer.main has cyclomatic complexity 41 (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.
score.render_segmented_text (cyclomatic 40) finance/skills/stock-analysis/scripts/score.py:1396— score.render_segmented_text has cyclomatic complexity 40 (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.
codebase_analyzer.analyze_project (cyclomatic 40) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:463— codebase_analyzer.analyze_project has cyclomatic complexity 40 (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.
mechanism_matcher.match (cyclomatic 40) research/grants/skills/grants/scripts/mechanism_matcher.py:54— mechanism_matcher.match has cyclomatic complexity 40 (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.
utils.extract_single_file (cyclomatic 39) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/utils.py:400— utils.extract_single_file 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.
model_arithmetic.step (cyclomatic 38) engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.py:98— model_arithmetic.step 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.
score.render_text (cyclomatic 38) finance/skills/stock-analysis/scripts/score.py:1263— score.render_text 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.
primitives_validator.validate (cyclomatic 37) agent-launcher/skills/interview/scripts/primitives_validator.py:31— primitives_validator.validate has cyclomatic complexity 37 (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.
ai_threat_scanner.main (cyclomatic 37) engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:322— ai_threat_scanner.main 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.
payload_validator.validate (cyclomatic 36) agent-launcher/skills/stage-launch/scripts/payload_validator.py:38— payload_validator.validate has cyclomatic complexity 36 (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.
compose_validator.validate_compose (cyclomatic 36) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:156— compose_validator.validate_compose has cyclomatic complexity 36 (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.
collect_sessions.parse_codex_session (cyclomatic 36) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:391— collect_sessions.parse_codex_session has cyclomatic complexity 36 (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.
PaymentProcessor.process_payment (cyclomatic 36) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:27— PaymentProcessor.process_payment has cyclomatic complexity 36 (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.
seo_checker.analyze_html (cyclomatic 36) marketing-skill/skills/seo-audit/scripts/seo_checker.py:120— seo_checker.analyze_html 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.
html_validator.validate (cyclomatic 36) marketing/landing/skills/landing/scripts/html_validator.py:113— html_validator.validate 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.
result_ranker.main (cyclomatic 35) engineering/agenthub/skills/agenthub/scripts/result_ranker.py:187— result_ranker.main has cyclomatic complexity 35 (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.
feedback_parser.parse (cyclomatic 35) engineering/human-gate/skills/human-gate/scripts/feedback_parser.py:173— feedback_parser.parse has cyclomatic complexity 35 (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.
collect_sessions.main (cyclomatic 35) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:627— collect_sessions.main has cyclomatic complexity 35 (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.
schema_validator.score_schema (cyclomatic 35) marketing-skill/skills/schema-markup/scripts/schema_validator.py:126— schema_validator.score_schema has cyclomatic complexity 35 (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.
campaign_roi_calculator.calculate_campaign_metrics (cyclomatic 34) marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:117— campaign_roi_calculator.calculate_campaign_metrics has cyclomatic complexity 34 (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.
post_linter.lint (cyclomatic 34) marketing/linkedin/skills/linkedin-content/scripts/post_linter.py:117— post_linter.lint has cyclomatic complexity 34 (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.
compose_validator.parse_yaml_simple (cyclomatic 33) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:59— compose_validator.parse_yaml_simple has cyclomatic complexity 33 (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.
score_aggregator.validate (cyclomatic 33) engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:114— score_aggregator.validate has cyclomatic complexity 33 (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.
positioning_brief.validate (cyclomatic 33) marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:117— positioning_brief.validate has cyclomatic complexity 33 (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.
cloud_posture_check.check_s3_policy (cyclomatic 32) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:518— cloud_posture_check.check_s3_policy 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.
validate_examples.main (cyclomatic 32) engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py:195— validate_examples.main 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.
score.run_segmented_scorecard (cyclomatic 32) finance/skills/stock-analysis/scripts/score.py:1110— score.run_segmented_scorecard has cyclomatic complexity 32 (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.
ship_gate_scanner.detect_stack (cyclomatic 31) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:227— ship_gate_scanner.detect_stack 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.
dataset_pipeline_builder.main (cyclomatic 30) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1506— dataset_pipeline_builder.main 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.
threat_signal_analyzer.anomaly_mode (cyclomatic 30) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:262— threat_signal_analyzer.anomaly_mode 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.
chart_analyzer.check_security (cyclomatic 30) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:331— chart_analyzer.check_security 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.
valuation.render_text (cyclomatic 30) finance/skills/stock-analysis/scripts/valuation.py:648— valuation.render_text 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.
health_scorer.print_dashboard (cyclomatic 28) c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:337— health_scorer.print_dashboard 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.
cloud_posture_check.main (cyclomatic 28) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:967— cloud_posture_check.main 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.
version_bumper.main (cyclomatic 28) engineering/skills/changelog-generator/scripts/version_bumper.py:467— version_bumper.main 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.
repurpose_splitter.main (cyclomatic 28) marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:196— repurpose_splitter.main 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.
time_block_planner.plan (cyclomatic 28) productivity/deep-work/skills/deep-work/scripts/time_block_planner.py:86— time_block_planner.plan 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.
ops_efficiency_analyzer.format_report (cyclomatic 27) c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:607— ops_efficiency_analyzer.format_report 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.
churn_analyzer.print_full_report (cyclomatic 27) c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:441— churn_analyzer.print_full_report 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.
revenue_forecast_model.print_report (cyclomatic 27) c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:295— revenue_forecast_model.print_report 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.
contrast_checker.main (cyclomatic 27) engineering-team/a11y-audit/skills/a11y-audit/scripts/contrast_checker.py:364— contrast_checker.main 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.
auth_setup_guide.main (cyclomatic 27) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/auth_setup_guide.py:281— auth_setup_guide.main 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.
SchemaValidator._validate_column (cyclomatic 27) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:279— SchemaValidator._validate_column 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.
citation_tracker.main (cyclomatic 27) research/pulse/skills/pulse/scripts/citation_tracker.py:471— citation_tracker.main 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.
revshare_modeler.model (cyclomatic 26) commercial/skills/partnerships-architect/scripts/revshare_modeler.py:139— revshare_modeler.model 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.
tc_status.render_single (cyclomatic 26) engineering/skills/tc-tracker/scripts/tc_status.py:39— tc_status.render_single 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.
UserService.create_user (cyclomatic 26) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:24— UserService.create_user 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.
Period._derive (cyclomatic 26) finance/skills/stock-analysis/scripts/ratios.py:507— Period._derive has cyclomatic complexity 26 (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.
score.main (cyclomatic 26) finance/skills/stock-analysis/scripts/score.py:1983— score.main 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.
sitemap_analyzer.print_report (cyclomatic 26) marketing-skill/skills/site-architecture/scripts/sitemap_analyzer.py:236— sitemap_analyzer.print_report 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.
headline_scorer.score_headline (cyclomatic 26) marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:103— headline_scorer.score_headline has cyclomatic complexity 26 (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.
kb_validator.validate (cyclomatic 26) productivity/email/skills/inbox-setup/scripts/kb_validator.py:114— kb_validator.validate has cyclomatic complexity 26 (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.
sync-gemini-skills.find_skills (cyclomatic 26) scripts/sync-gemini-skills.py:44— sync-gemini-skills.find_skills 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.
decision_tracker.parse_decisions (cyclomatic 25) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:141— decision_tracker.parse_decisions 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.
bookings_forecaster.compute_forecast (cyclomatic 25) commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:197— bookings_forecaster.compute_forecast 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.
AgentEvaluator.calculate_performance_metrics (cyclomatic 25) engineering/skills/agent-designer/agent_evaluator.py:259— AgentEvaluator.calculate_performance_metrics 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.
ship_gate_scanner.print_report (cyclomatic 25) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:1031— ship_gate_scanner.print_report 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.
html_renderer._render_block (cyclomatic 25) markdown-html/skills/md-document/scripts/html_renderer.py:404— html_renderer._render_block 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.
deck_html_renderer._render_block (cyclomatic 25) markdown-html/skills/md-slides/scripts/deck_html_renderer.py:94— deck_html_renderer._render_block 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.
handoff_self_check.check (cyclomatic 25) productivity/handoff/skills/handoff/scripts/handoff_self_check.py:165— handoff_self_check.check 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.
source_tier_classifier.classify (cyclomatic 25) research/dossier/skills/dossier/scripts/source_tier_classifier.py:125— source_tier_classifier.classify 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.
adr_scanner.scan_directory (cyclomatic 24) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:87— adr_scanner.scan_directory 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.
lint_wiki.scan (cyclomatic 24) engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py:44— lint_wiki.scan 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.
valuation.scenario_value (cyclomatic 24) finance/skills/stock-analysis/scripts/valuation.py:491— valuation.scenario_value 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.
form_field_analyzer.analyze_form (cyclomatic 24) marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:108— form_field_analyzer.analyze_form 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.
seo_health_scorer.score_checks (cyclomatic 24) marketing-skill/skills/seo-audit/scripts/seo_health_scorer.py:109— seo_health_scorer.score_checks 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.
gtm_efficiency_calculator.rate_metric (cyclomatic 23) business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:75— gtm_efficiency_calculator.rate_metric has cyclomatic complexity 23 (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.
comms_calendar_builder.build_calendar (cyclomatic 23) business-operations/skills/internal-comms/scripts/comms_calendar_builder.py:78— comms_calendar_builder.build_calendar has cyclomatic complexity 23 (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.
vendor_risk_classifier.classify_regulatory_exposure (cyclomatic 23) business-operations/skills/vendor-management/scripts/vendor_risk_classifier.py:127— vendor_risk_classifier.classify_regulatory_exposure 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.
cloud_posture_check.check_security_group (cyclomatic 23) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:724— cloud_posture_check.check_security_group 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.
book_skill_validator.check_frontmatter (cyclomatic 23) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:288— book_skill_validator.check_frontmatter 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.
dependencies.run_dependency_check (cyclomatic 23) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/dependencies.py:236— dependencies.run_dependency_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.
values_validator.parse_values (cyclomatic 23) REDACTED:78— values_validator.parse_values 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.
score_aggregator.main (cyclomatic 23) engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:289— score_aggregator.main 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.
ship_gate_scanner.main (cyclomatic 23) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:1147— ship_gate_scanner.main 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.
review_html_renderer.render (cyclomatic 23) markdown-html/skills/md-review/scripts/review_html_renderer.py:395— review_html_renderer.render 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.
outreach_message_builder.validate (cyclomatic 23) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:92— outreach_message_builder.validate has cyclomatic complexity 23 (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.
codebase_analyzer.format_markdown (cyclomatic 23) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:622— codebase_analyzer.format_markdown 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.
sync-codex-skills.main (cyclomatic 23) scripts/sync-codex-skills.py:357— sync-codex-skills.main 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.
UserInterface.renderUserDashboard (cyclomatic 23) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— UserInterface.renderUserDashboard has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body's own statements and 5 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.
deployment_builder.main (cyclomatic 22) agent-launcher/skills/run-without-you/scripts/deployment_builder.py:58— deployment_builder.main 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.
incident_triage.main (cyclomatic 22) engineering-team/skills/incident-response/scripts/incident_triage.py:600— incident_triage.main 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.
engagement_planner.build_engagement_plan (cyclomatic 22) engineering-team/skills/red-team/scripts/engagement_planner.py:137— engagement_planner.build_engagement_plan 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.
backend_decision_engine.render_markdown (cyclomatic 22) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:191— backend_decision_engine.render_markdown has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
code_quality_analyzer.analyze_project (cyclomatic 22) engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:334— code_quality_analyzer.analyze_project 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.
rag_evaluator.evaluate_rag_system (cyclomatic 22) engineering-team/skills/senior-prompt-engineer/scripts/rag_evaluator.py:343— rag_evaluator.evaluate_rag_system 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.
memory_inspect.main (cyclomatic 22) engineering/agent-memory/skills/agent-memory/scripts/memory_inspect.py:170— memory_inspect.main 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.
log_results.main (cyclomatic 22) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:316— log_results.main 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.
data_profiler.print_report (cyclomatic 22) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:151— data_profiler.print_report 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.
openapi_to_mcp.extract_tools (cyclomatic 22) engineering/skills/mcp-server-builder/scripts/openapi_to_mcp.py:103— openapi_to_mcp.extract_tools 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.
audit_log_analyzer.analyze (cyclomatic 22) engineering/skills/secrets-vault-manager/scripts/audit_log_analyzer.py:101— audit_log_analyzer.analyze 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.
tc_create.main (cyclomatic 22) engineering/skills/tc-tracker/scripts/tc_create.py:146— tc_create.main 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.
metrics_calculator.calculate (cyclomatic 22) finance/skills/saas-metrics-coach/scripts/metrics_calculator.py:19— metrics_calculator.calculate 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.
lint_report.check_blank_cells (cyclomatic 22) finance/skills/stock-analysis/scripts/lint_report.py:629— lint_report.check_blank_cells 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.
score.apply_gates (cyclomatic 22) finance/skills/stock-analysis/scripts/score.py:556— score.apply_gates 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.
campaign_roi_calculator.format_text (cyclomatic 22) marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:299— campaign_roi_calculator.format_text 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.
jql_query_builder.build_jql_from_description (cyclomatic 22) project-management/skills/jira-expert/scripts/jql_query_builder.py:209— jql_query_builder.build_jql_from_description 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.
resource_capacity_planner.optimize_resource_allocation (cyclomatic 22) project-management/skills/senior-pm/scripts/resource_capacity_planner.py:370— resource_capacity_planner.optimize_resource_allocation 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.
qsr_compliance_checker.search_documentation (cyclomatic 22) ra-qm-team/skills/fda-consultant-specialist/scripts/qsr_compliance_checker.py:348— qsr_compliance_checker.search_documentation 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.
framework_selector.select_frameworks (cyclomatic 21) compliance-os/skills/compliance-os/scripts/framework_selector.py:105— framework_selector.select_frameworks 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.
output_analyzer.main (cyclomatic 21) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:228— output_analyzer.main 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.
cloud_posture_check.analyze_statement (cyclomatic 21) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:288— cloud_posture_check.analyze_statement 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.
frontend_decision_engine.render_markdown (cyclomatic 21) engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:145— frontend_decision_engine.render_markdown has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
fullstack_decision_engine.render_markdown (cyclomatic 21) engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:187— fullstack_decision_engine.render_markdown has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CoverageParser._parse_lcov (cyclomatic 21) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:200— CoverageParser._parse_lcov 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.
prompt_rater.rate (cyclomatic 21) engineering/claude-coach/skills/claude-coach/scripts/prompt_rater.py:57— prompt_rater.rate 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.
review_page_builder.markdown_blocks (cyclomatic 21) engineering/human-gate/skills/human-gate/scripts/review_page_builder.py:164— review_page_builder.markdown_blocks has cyclomatic complexity 21 (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.
AgentPlanner.select_architecture_pattern (cyclomatic 21) engineering/skills/agent-designer/agent_planner.py:207— AgentPlanner.select_architecture_pattern 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.
stack_detector.detect (cyclomatic 21) engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:75— stack_detector.detect 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.
skill_security_auditor.scan_dependencies (cyclomatic 21) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:682— skill_security_auditor.scan_dependencies 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.
verify_data.render_text (cyclomatic 21) finance/skills/stock-analysis/scripts/verify_data.py:1452— verify_data.render_text has cyclomatic complexity 21 (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.
codebase_analyzer.detect_framework (cyclomatic 21) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:163— codebase_analyzer.detect_framework 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.
jira_snapshot_bridge.flow_report (cyclomatic 21) project-management/skills/pm-skills/scripts/jira_snapshot_bridge.py:116— jira_snapshot_bridge.flow_report 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.
interview_planner.plan (cyclomatic 20) agent-launcher/skills/interview/scripts/interview_planner.py:38— interview_planner.plan 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.
stakeholder_mapper.print_report (cyclomatic 20) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/stakeholder_mapper.py:232— stakeholder_mapper.print_report 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.
packaging_designer.detect_anti_patterns (cyclomatic 20) commercial/skills/pricing-strategist/scripts/packaging_designer.py:107— packaging_designer.detect_anti_patterns 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.
engagement_planner.main (cyclomatic 20) engineering-team/skills/red-team/scripts/engagement_planner.py:283— engagement_planner.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.
epub.extract_with_zipfile (cyclomatic 20) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/epub.py:67— epub.extract_with_zipfile 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.
context_md_linter.lint (cyclomatic 20) engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:110— context_md_linter.lint 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.
IndexOptimizer.analyze_missing_indexes (cyclomatic 20) REDACTED:227— IndexOptimizer.analyze_missing_indexes 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.
ReportFormatter.format_human_readable (cyclomatic 20) engineering/skills/skill-tester/scripts/skill_validator.py:578— ReportFormatter.format_human_readable 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.
Analysis.build_ev_bridge (cyclomatic 20) finance/skills/stock-analysis/scripts/ratios.py:1673— Analysis.build_ev_bridge 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.
score.score_metric (cyclomatic 20) finance/skills/stock-analysis/scripts/score.py:364— score.score_metric 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.
slide_splitter.split_slides (cyclomatic 20) markdown-html/skills/md-slides/scripts/slide_splitter.py:76— slide_splitter.split_slides 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.
prompt_versioner.main (cyclomatic 20) marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_versioner.py:126— prompt_versioner.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.
OKRGenerator.generate_okr_dashboard (cyclomatic 20) product-team/skills/product-strategist/scripts/okr_cascade_generator.py:247— OKRGenerator.generate_okr_dashboard has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
section_progress_tracker.main (cyclomatic 20) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:199— section_progress_tracker.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.
directional_recommendation_validator.validate (cyclomatic 20) productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:91— directional_recommendation_validator.validate 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.
verdict_synthesizer.synthesize (cyclomatic 20) productivity/roast/skills/roast/scripts/verdict_synthesizer.py:60— verdict_synthesizer.synthesize 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.
pipeline_analyzer.assess_pipeline_risk (cyclomatic 19) business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:203— pipeline_analyzer.assess_pipeline_risk 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.
portfolio_analyzer._product_findings (cyclomatic 19) c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:222— portfolio_analyzer._product_findings 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.
TimelineReconstructor._calculate_metrics (cyclomatic 19) engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:423— TimelineReconstructor._calculate_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.
MigrationGenerator._compare_tables (cyclomatic 19) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:503— MigrationGenerator._compare_tables 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.
DataContractValidator.validate_contract (cyclomatic 19) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:990— DataContractValidator.validate_contract 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.
training_diagnostics.diagnose (cyclomatic 19) engineering/deep-learning-book/skills/deep-learning-book/scripts/training_diagnostics.py:70— training_diagnostics.diagnose 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.
ToolSchemaGenerator._generate_example_value (cyclomatic 19) engineering/skills/agent-designer/tool_schema_generator.py:699— ToolSchemaGenerator._generate_example_value 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.
SelectivityEstimator.estimate_selectivity (cyclomatic 19) REDACTED:113— SelectivityEstimator.estimate_selectivity 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.
hiring_calibrator.format_human_readable (cyclomatic 19) engineering/skills/interview-system-designer/hiring_calibrator.py:1112— hiring_calibrator.format_human_readable 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.
SchemaCompatibilityChecker._build_compatibility_report (cyclomatic 19) engineering/skills/migration-architect/scripts/compatibility_checker.py:667— SchemaCompatibilityChecker._build_compatibility_report 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.
RollbackGenerator.generate_human_readable_runbook (cyclomatic 19) engineering/skills/migration-architect/scripts/rollback_generator.py:940— RollbackGenerator.generate_human_readable_runbook has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ratios.render_text (cyclomatic 19) finance/skills/stock-analysis/scripts/ratios.py:2368— ratios.render_text 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.
score.aggregate (cyclomatic 19) finance/skills/stock-analysis/scripts/score.py:479— score.aggregate 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.
score.explain (cyclomatic 19) finance/skills/stock-analysis/scripts/score.py:1632— score.explain 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.
verify_data._check_magnitude (cyclomatic 19) finance/skills/stock-analysis/scripts/verify_data.py:1043— verify_data._check_magnitude 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.
humanizer_scorer.print_report (cyclomatic 19) marketing-skill/skills/content-humanizer/scripts/humanizer_scorer.py:360— humanizer_scorer.print_report 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.
CROParser.handle_starttag (cyclomatic 19) marketing-skill/skills/page-cro/scripts/conversion_audit.py:62— CROParser.handle_starttag 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.
pattern_miner.mine (cyclomatic 19) marketing/linkedin/skills/linkedin-analytics/scripts/pattern_miner.py:146— pattern_miner.mine 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.
comment_target_planner.build (cyclomatic 19) marketing/linkedin/skills/linkedin-engagement/scripts/comment_target_planner.py:89— comment_target_planner.build 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.
OKRGenerator.calculate_alignment_score (cyclomatic 19) product-team/skills/product-strategist/scripts/okr_cascade_generator.py:304— OKRGenerator.calculate_alignment_score 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.
retrospective_analyzer.analyze_action_item_completion (cyclomatic 19) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:236— retrospective_analyzer.analyze_action_item_completion 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.
project_health_dashboard.format_text_output (cyclomatic 19) project-management/skills/senior-pm/scripts/project_health_dashboard.py:635— project_health_dashboard.format_text_output 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.
resource_capacity_planner.format_text_output (cyclomatic 19) project-management/skills/senior-pm/scripts/resource_capacity_planner.py:646— resource_capacity_planner.format_text_output has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CAPATracker.calculate_metrics (cyclomatic 19) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:114— CAPATracker.calculate_metrics 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.
gdpr_compliance_checker.analyze_project (cyclomatic 19) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:201— gdpr_compliance_checker.analyze_project 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.
citation_tracker.main (cyclomatic 19) research/litreview/skills/litreview/scripts/citation_tracker.py:200— citation_tracker.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.
check_frontmatter.check_file (cyclomatic 19) scripts/check_frontmatter.py:109— check_frontmatter.check_file 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.
sync-hermes-skills.discover_skills (cyclomatic 19) scripts/sync-hermes-skills.py:58— sync-hermes-skills.discover_skills 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.
sync-vibe-skills.discover_skills (cyclomatic 19) scripts/sync-vibe-skills.py:71— sync-vibe-skills.discover_skills 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.
decision_tracker.report_conflicts (cyclomatic 18) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:394— decision_tracker.report_conflicts 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.
IncidentClassifier._classify_severity (cyclomatic 18) engineering-team/skills/incident-commander/scripts/incident_classifier.py:420— IncidentClassifier._classify_severity 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.
SQLParser._parse_table_body (cyclomatic 18) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:127— SQLParser._parse_table_body 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.
DataContractValidator._parse_simple_yaml (cyclomatic 18) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:937— DataContractValidator._parse_simple_yaml 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.
ReportGenerator.generate_text_report (cyclomatic 18) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1111— ReportGenerator.generate_text_report 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.
pipeline_orchestrator.main (cyclomatic 18) engineering-team/skills/senior-data-engineer/scripts/pipeline_orchestrator.py:717— pipeline_orchestrator.main 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.
EcosystemAnalyzer._score_npm_health (cyclomatic 18) engineering-team/skills/tech-stack-evaluator/scripts/ecosystem_analyzer.py:122— EcosystemAnalyzer._score_npm_health 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.
skill_plugin_emitter.emit (cyclomatic 18) engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:375— skill_plugin_emitter.emit 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.
reading_path_planner.main (cyclomatic 18) engineering/deep-learning-book/skills/deep-learning-book/scripts/reading_path_planner.py:373— reading_path_planner.main 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.
memory_cost_profiler.profile (cyclomatic 18) engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:99— memory_cost_profiler.profile 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.
AgentEvaluator.analyze_errors (cyclomatic 18) engineering/skills/agent-designer/agent_evaluator.py:355— AgentEvaluator.analyze_errors 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.
loop_designer.main (cyclomatic 18) engineering/skills/interview-system-designer/loop_designer.py:826— loop_designer.main 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.
question_bank_generator.main (cyclomatic 18) engineering/skills/interview-system-designer/question_bank_generator.py:970— question_bank_generator.main 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.
ship_gate_scanner.run_manual_checks (cyclomatic 18) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:977— ship_gate_scanner.run_manual_checks 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.
tc_init.main (cyclomatic 18) engineering/skills/tc-tracker/scripts/tc_init.py:106— tc_init.main 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.
validate_workflow._strip_comments (cyclomatic 18) engineering/workflow-builder/skills/workflow-builder/scripts/validate_workflow.py:22— validate_workflow._strip_comments 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.
verify_data.check_period_alignment (cyclomatic 18) finance/skills/stock-analysis/scripts/verify_data.py:1108— verify_data.check_period_alignment 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.
context_validator.validate_context (cyclomatic 18) marketing-skill/skills/marketing-context/scripts/context_validator.py:27— context_validator.validate_context 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.
campaign_tracker.analyze_campaign (cyclomatic 18) marketing-skill/skills/marketing-ops/scripts/campaign_tracker.py:29— campaign_tracker.analyze_campaign 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.
ad_health_scorer.score_platform (cyclomatic 18) marketing-skill/skills/paid-ads/scripts/ad_health_scorer.py:99— ad_health_scorer.score_platform 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.
roas_calculator.calculate (cyclomatic 18) marketing-skill/skills/paid-ads/scripts/roas_calculator.py:20— roas_calculator.calculate 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.
tweet_composer.main (cyclomatic 18) marketing-skill/skills/x-twitter-growth/scripts/tweet_composer.py:222— tweet_composer.main 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.
anti_todo_card.main (cyclomatic 18) productivity/andreessen/skills/andreessen/scripts/anti_todo_card.py:146— anti_todo_card.main 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.
setup.run_setup (cyclomatic 18) productivity/handoff/skills/handoff/scripts/setup.py:152— setup.run_setup 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.
dpia_generator.generate_dpia_report (cyclomatic 18) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/dpia_generator.py:390— dpia_generator.generate_dpia_report has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
document_version_control.main (cyclomatic 18) ra-qm-team/skills/quality-documentation-manager/scripts/document_version_control.py:375— document_version_control.main 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.
phase_gate_scorer.score_plan (cyclomatic 18) research-ops/skills/clinical-research/scripts/phase_gate_scorer.py:88— phase_gate_scorer.score_plan 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.
framework_recommender.recommend (cyclomatic 18) research/litreview/skills/litreview/scripts/framework_recommender.py:70— framework_recommender.recommend 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.
routing_transparency_logger.main (cyclomatic 18) research/research/skills/research/scripts/routing_transparency_logger.py:127— routing_transparency_logger.main 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.
derive_counters.run_check (cyclomatic 18) scripts/derive_counters.py:273— derive_counters.run_check 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.
smoke_json_output.main (cyclomatic 18) scripts/smoke_json_output.py:148— smoke_json_output.main 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.
full-page-screenshot.captureFullPage (cyclomatic 18) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:221— full-page-screenshot.captureFullPage 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.
marketing_budget_modeler.print_recommendations (cyclomatic 17) c-level-advisor/skills/cmo-advisor/scripts/marketing_budget_modeler.py:355— marketing_budget_modeler.print_recommendations has cyclomatic complexity 17 (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.
decision_tracker.main (cyclomatic 17) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:546— decision_tracker.main 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.
scenario_modeler.print_report (cyclomatic 17) c-level-advisor/skills/scenario-war-room/scripts/scenario_modeler.py:212— scenario_modeler.print_report 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.
code_quality_checker.check_c_specific_smells (cyclomatic 17) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:610— code_quality_checker.check_c_specific_smells 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.
inspect-assets.analyse_image (cyclomatic 17) engineering-team/skills/epic-design/scripts/inspect-assets.py:24— inspect-assets.analyse_image has cyclomatic complexity 17 (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.
PIRGenerator._identify_category_factors (cyclomatic 17) engineering-team/skills/incident-commander/scripts/pir_generator.py:664— PIRGenerator._identify_category_factors 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.
api_scaffolder.load_yaml_as_json (cyclomatic 17) engineering-team/skills/senior-backend/scripts/api_scaffolder.py:24— api_scaffolder.load_yaml_as_json 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.
bundle_analyzer.print_report (cyclomatic 17) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:293— bundle_analyzer.print_report has cyclomatic complexity 17 (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.
FrameworkAdapter.detect_framework (cyclomatic 17) engineering-team/skills/tdd-guide/scripts/framework_adapter.py:390— FrameworkAdapter.detect_framework 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.
threat_signal_analyzer.ioc_mode (cyclomatic 17) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:161— threat_signal_analyzer.ioc_mode 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.
setup_experiment.main (cyclomatic 17) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/setup_experiment.py:251— setup_experiment.main 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.
chart_analyzer.check_templates (cyclomatic 17) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:257— chart_analyzer.check_templates 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.
diff_surgeon.main (cyclomatic 17) engineering/karpathy-coder/skills/karpathy-coder/scripts/diff_surgeon.py:141— diff_surgeon.main 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.
memory_density_auditor.audit (cyclomatic 17) engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:365— memory_density_auditor.audit 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.
APIScoringEngine._check_parameter_consistency (cyclomatic 17) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:353— APIScoringEngine._check_parameter_consistency 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.
BreakingChangeDetector.generate_text_report (cyclomatic 17) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:875— BreakingChangeDetector.generate_text_report 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.
HiringCalibrator._analyze_trends_over_time (cyclomatic 17) engineering/skills/interview-system-designer/hiring_calibrator.py:604— HiringCalibrator._analyze_trends_over_time has cyclomatic complexity 17 (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.
SemanticChunker._chunk_section (cyclomatic 17) engineering/skills/rag-architect/chunking_optimizer.py:364— SemanticChunker._chunk_section 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.
ship_gate_scanner.grep_files (cyclomatic 17) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:150— ship_gate_scanner.grep_files 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.
skill_security_auditor.scan_filesystem (cyclomatic 17) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:776— skill_security_auditor.scan_filesystem 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.
score.resolve_sector (cyclomatic 17) finance/skills/stock-analysis/scripts/score.py:157— score.resolve_sector 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.
email_sequence_analyzer.analyze_body (cyclomatic 17) marketing-skill/skills/cold-email/scripts/email_sequence_analyzer.py:224— email_sequence_analyzer.analyze_body has cyclomatic complexity 17 (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.
comparison_matrix_builder.build_matrix (cyclomatic 17) marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:77— comparison_matrix_builder.build_matrix 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.
content_scorer.score_structure (cyclomatic 17) marketing-skill/skills/content-production/scripts/content_scorer.py:199— content_scorer.score_structure has cyclomatic complexity 17 (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.
sitemap_analyzer.parse_sitemap (cyclomatic 17) marketing-skill/skills/site-architecture/scripts/sitemap_analyzer.py:147— sitemap_analyzer.parse_sitemap has cyclomatic complexity 17 (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.
ost_linter.lint (cyclomatic 17) product-team/skills/product-skills/scripts/ost_linter.py:75— ost_linter.lint 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.
kb_reader.read_kb (cyclomatic 17) productivity/email/skills/inbox-triage/scripts/kb_reader.py:179— kb_reader.read_kb 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.
sprint_health_scorer._generate_detailed_metrics (cyclomatic 17) project-management/skills/scrum-master/scripts/sprint_health_scorer.py:518— sprint_health_scorer._generate_detailed_metrics 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.
fda_submission_tracker.print_text_report (cyclomatic 17) ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:305— fda_submission_tracker.print_text_report 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.
data_subject_rights_tracker.main (cyclomatic 17) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/data_subject_rights_tracker.py:449— data_subject_rights_tracker.main 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.
check_frontmatter.main (cyclomatic 17) scripts/check_frontmatter.py:174— check_frontmatter.main has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
sync-codex-skills.find_skills (cyclomatic 17) scripts/sync-codex-skills.py:98— sync-codex-skills.find_skills 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.
sync-vibe-skills.main (cyclomatic 17) scripts/sync-vibe-skills.py:246— sync-vibe-skills.main has cyclomatic complexity 17 (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.
full-page-screenshot.modeUrl (cyclomatic 17) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:524— full-page-screenshot.modeUrl 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.
cron_validator._valid_field (cyclomatic 16) agent-launcher/skills/run-without-you/scripts/cron_validator.py:25— cron_validator._valid_field 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.
poc_planner.format_text (cyclomatic 16) business-growth/skills/sales-engineer/scripts/poc_planner.py:581— poc_planner.format_text has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
rfp_response_analyzer.determine_bid_recommendation (cyclomatic 16) business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:207— rfp_response_analyzer.determine_bid_recommendation 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.
capacity_modeler.model_capacity (cyclomatic 16) business-operations/skills/capacity-planner/scripts/capacity_modeler.py:159— capacity_modeler.model_capacity 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.
utilization_analyzer.assess_team (cyclomatic 16) business-operations/skills/capacity-planner/scripts/utilization_analyzer.py:110— utilization_analyzer.assess_team 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.
kb_ingester.generate_report (cyclomatic 16) business-operations/skills/knowledge-ops/scripts/kb_ingester.py:264— kb_ingester.generate_report 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.
cycle_time_analyzer.analyze (cyclomatic 16) business-operations/skills/process-mapper/scripts/cycle_time_analyzer.py:51— cycle_time_analyzer.analyze 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.
supplier_consolidation.render_markdown (cyclomatic 16) business-operations/skills/procurement-optimizer/scripts/supplier_consolidation.py:223— supplier_consolidation.render_markdown 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.
decision_matrix_scorer.print_report (cyclomatic 16) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:164— decision_matrix_scorer.print_report 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.
unit_economics_analyzer.analyze_cohort (cyclomatic 16) c-level-advisor/skills/cfo-advisor/scripts/unit_economics_analyzer.py:98— unit_economics_analyzer.analyze_cohort 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.
hiring_plan_modeler.assess_risks (cyclomatic 16) c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:175— hiring_plan_modeler.assess_risks 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.
portfolio_analyzer.investment_posture (cyclomatic 16) c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:132— portfolio_analyzer.investment_posture 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.
alignment_checker.print_report (cyclomatic 16) c-level-advisor/skills/strategic-alignment/scripts/alignment_checker.py:317— alignment_checker.print_report 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.
channel_mix_optimizer.render_markdown (cyclomatic 16) commercial/skills/channel-economics/scripts/channel_mix_optimizer.py:185— channel_mix_optimizer.render_markdown 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.
a11y_scanner.check_media_captions_block (cyclomatic 16) engineering-team/a11y-audit/skills/a11y-audit/scripts/a11y_scanner.py:407— a11y_scanner.check_media_captions_block 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.
review_report_generator.format_markdown_report (cyclomatic 16) engineering-team/skills/code-reviewer/scripts/review_report_generator.py:224— review_report_generator.format_markdown_report 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.
pir_generator.main (cyclomatic 16) engineering-team/skills/incident-commander/scripts/pir_generator.py:1501— pir_generator.main 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.
DatasetAnalyzer._detect_format (cyclomatic 16) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:204— DatasetAnalyzer._detect_format 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.
GreatExpectationsGenerator._generate_column_expectations (cyclomatic 16) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:753— GreatExpectationsGenerator._generate_column_expectations 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.
loop_controller.cmd_verify (cyclomatic 16) engineering/agent-harness/skills/agent-harness/scripts/loop_controller.py:204— loop_controller.cmd_verify 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.
book_skill_validator._collect_skill_files (cyclomatic 16) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:166— book_skill_validator._collect_skill_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.
rtf._strip_destination_groups (cyclomatic 16) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/rtf.py:44— rtf._strip_destination_groups 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.
chart_analyzer.analyze_chart (cyclomatic 16) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:400— chart_analyzer.analyze_chart 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.
forgetting_policy_linter.lint (cyclomatic 16) engineering/memory-engineering/skills/memory-engineering/scripts/forgetting_policy_linter.py:221— forgetting_policy_linter.lint 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.
AgentPlanner.design_communication_topology (cyclomatic 16) engineering/skills/agent-designer/agent_planner.py:544— AgentPlanner.design_communication_topology 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.
APILinter._validate_path_structure (cyclomatic 16) engineering/skills/api-design-reviewer/scripts/api_linter.py:279— APILinter._validate_path_structure 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.
APIScoringEngine._check_url_structure_consistency (cyclomatic 16) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:401— APIScoringEngine._check_url_structure_consistency 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.
question_bank_generator.format_human_readable (cyclomatic 16) engineering/skills/interview-system-designer/question_bank_generator.py:880— question_bank_generator.format_human_readable 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.
ScriptTester._test_argparse_implementation (cyclomatic 16) engineering/skills/skill-tester/scripts/script_tester.py:316— ScriptTester._test_argparse_implementation 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.
DebtDashboard._generate_executive_summary (cyclomatic 16) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:606— DebtDashboard._generate_executive_summary 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.
Analysis._warn_tax_rate_anomalies (cyclomatic 16) finance/skills/stock-analysis/scripts/ratios.py:2158— Analysis._warn_tax_rate_anomalies 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.
verify_data.classify_period (cyclomatic 16) finance/skills/stock-analysis/scripts/verify_data.py:530— verify_data.classify_period 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.
verify_data.check_cross_source (cyclomatic 16) finance/skills/stock-analysis/scripts/verify_data.py:858— verify_data.check_cross_source 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.
verify_data.check_recency (cyclomatic 16) finance/skills/stock-analysis/scripts/verify_data.py:1173— verify_data.check_recency 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.
onboard.main (cyclomatic 16) markdown-html/skills/design-system/scripts/onboard.py:173— onboard.main 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.
tracking_plan_generator.generate_tracking_plan (cyclomatic 16) marketing-skill/skills/analytics-tracking/scripts/tracking_plan_generator.py:192— tracking_plan_generator.generate_tracking_plan 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.
email_sequence_analyzer.analyze_subject_line (cyclomatic 16) marketing-skill/skills/cold-email/scripts/email_sequence_analyzer.py:170— email_sequence_analyzer.analyze_subject_line 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.
FormAnalyzer.handle_starttag (cyclomatic 16) marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:31— FormAnalyzer.handle_starttag 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.
nap_checker.compare_nap (cyclomatic 16) marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:107— nap_checker.compare_nap 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.
roas_calculator._recommendations (cyclomatic 16) marketing-skill/skills/paid-ads/scripts/roas_calculator.py:147— roas_calculator._recommendations 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.
competitor_analyzer.analyze_competitors (cyclomatic 16) marketing-skill/skills/x-twitter-growth/scripts/competitor_analyzer.py:53— competitor_analyzer.analyze_competitors 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.
brand_palette_validator.validate (cyclomatic 16) marketing/landing/skills/landing/scripts/brand_palette_validator.py:127— brand_palette_validator.validate has cyclomatic complexity 16 (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.
post_performance_analyzer.analyse (cyclomatic 16) marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:111— post_performance_analyzer.analyse 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.
codebase_analyzer.extract_backend_routes (cyclomatic 16) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:367— codebase_analyzer.extract_backend_routes 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.
discovery_cadence_tracker.analyze (cyclomatic 16) product-team/skills/product-skills/scripts/discovery_cadence_tracker.py:64— discovery_cadence_tracker.analyze 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.
weekly_review_gate.evaluate (cyclomatic 16) productivity/weekly-review/skills/weekly-review/scripts/weekly_review_gate.py:86— weekly_review_gate.evaluate 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.
delivery_loop_gate.check_plan (cyclomatic 16) project-management/skills/pm-skills/scripts/delivery_loop_gate.py:57— delivery_loop_gate.check_plan 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.
jira_snapshot_bridge.sprint_export (cyclomatic 16) project-management/skills/pm-skills/scripts/jira_snapshot_bridge.py:186— jira_snapshot_bridge.sprint_export 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.
regulatory_pathway_analyzer.format_analysis_text (cyclomatic 16) ra-qm-team/skills/regulatory-affairs-head/scripts/regulatory_pathway_analyzer.py:385— regulatory_pathway_analyzer.format_analysis_text has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
FMEAAnalyzer.analyze_entries (cyclomatic 16) ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py:130— FMEAAnalyzer.analyze_entries 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.
check_model_freshness.main (cyclomatic 16) scripts/check_model_freshness.py:171— check_model_freshness.main 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.
derive_counters.derive (cyclomatic 16) scripts/derive_counters.py:79— derive_counters.derive 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.
generate_reading_list.buildAuditLogSection (cyclomatic 16) research/syllabus/skills/syllabus/scripts/generate_reading_list.js:263— generate_reading_list.buildAuditLogSection has cyclomatic complexity 16 (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.
generate-docs.main (cognitive 176) scripts/generate-docs.py:458— generate-docs.main has cognitive complexity 176 (threshold 15). Drivers by points: if/else 44 (121 pts), loops 22 (42 pts), boolean chains 10, ternaries 1 (3 pts) (nesting depth added 99). 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.
collect_sessions.parse_claude_session (cognitive 101) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:252— collect_sessions.parse_claude_session has cognitive complexity 101 (threshold 15). Drivers by points: if/else 20 (60 pts), boolean chains 17, ternaries 5 (14 pts), loops 3 (7 pts), error handling 2 (3 pts) (nesting depth added 54). 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.
threat_signal_analyzer.main (cognitive 93) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:408— threat_signal_analyzer.main has cognitive complexity 93 (threshold 15). Drivers by points: if/else 27 (62 pts), ternaries 4 (13 pts), loops 3 (11 pts), boolean chains 7 (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.
okr_tracker.format_report (cognitive 90) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:406— okr_tracker.format_report has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 15 (32 pts), ternaries 4 (14 pts) (nesting depth added 49). 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.
compose_validator.parse_yaml_simple (cognitive 89) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:59— compose_validator.parse_yaml_simple has cognitive complexity 89 (threshold 15). Drivers by points: if/else 22 (74 pts), boolean chains 10, ternaries 1 (4 pts), loops 1 (nesting depth added 55). 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.
tc_validator.validate_tc_record (cognitive 83) engineering/skills/tc-tracker/scripts/tc_validator.py:123— tc_validator.validate_tc_record has cognitive complexity 83 (threshold 15). Drivers by points: if/else 37 (76 pts), loops 4 (7 pts) (nesting depth added 42). 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.
dataset_pipeline_builder.main (cognitive 82) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1506— dataset_pipeline_builder.main has cognitive complexity 82 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 6 (27 pts), ternaries 2 (5 pts), error handling 1 (nesting depth added 54). 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.
openapi_to_mcp.extract_tools (cognitive 80) engineering/skills/mcp-server-builder/scripts/openapi_to_mcp.py:103— openapi_to_mcp.extract_tools has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (63 pts), loops 4 (14 pts), boolean chains 3 (nesting depth added 58). 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.
comp_benchmarker.print_report (cognitive 75) c-level-advisor/skills/chro-advisor/scripts/comp_benchmarker.py:275— comp_benchmarker.print_report has cognitive complexity 75 (threshold 15). Drivers by points: if/else 22 (35 pts), ternaries 8 (18 pts), loops 9 (16 pts), boolean chains 6 (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.
compose_validator.validate_compose (cognitive 75) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:156— compose_validator.validate_compose has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (51 pts), loops 6 (14 pts), boolean chains 7, ternaries 1 (3 pts) (nesting depth added 42). 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.
collect_sessions.main (cognitive 72) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:627— collect_sessions.main has cognitive complexity 72 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 5 (12 pts), boolean chains 8, error handling 1 (4 pts), ternaries 1 (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.
auth_setup_guide.main (cognitive 70) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/auth_setup_guide.py:281— auth_setup_guide.main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (46 pts), loops 6 (20 pts), ternaries 1 (4 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.
policy_linter.lint (cognitive 69) commercial/skills/commercial-policy/scripts/policy_linter.py:114— policy_linter.lint has cognitive complexity 69 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 14 (16 pts), ternaries 5 (11 pts), boolean chains 7 (nesting depth added 27). 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.
score.render_text (cognitive 69) finance/skills/stock-analysis/scripts/score.py:1263— score.render_text has cognitive complexity 69 (threshold 15). Drivers by points: if/else 24 (46 pts), loops 7 (13 pts), boolean chains 7, ternaries 1 (3 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.
feedback_parser.parse (cognitive 68) engineering/human-gate/skills/human-gate/scripts/feedback_parser.py:173— feedback_parser.parse has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (47 pts), boolean chains 7, loops 4 (6 pts), error handling 1 (5 pts), ternaries 1 (3 pts) (nesting depth added 34). 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.
profile_completeness_auditor.evaluate_check (cognitive 68) marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:104— profile_completeness_auditor.evaluate_check has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (38 pts), ternaries 10 (20 pts), boolean chains 10 (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.
tc_update.main (cognitive 67) engineering/skills/tc-tracker/scripts/tc_update.py:128— tc_update.main has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 11 (24 pts), if/else 14 (19 pts), boolean chains 13, loops 6, error handling 4 (5 pts) (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.
ai_threat_scanner.main (cognitive 64) engineering-team/skills/ai-security/scripts/ai_threat_scanner.py:322— ai_threat_scanner.main has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (37 pts), loops 6 (13 pts), boolean chains 5, ternaries 4 (5 pts), error handling 2 (4 pts) (nesting depth added 27). 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.
payload_validator.validate (cognitive 63) agent-launcher/skills/stage-launch/scripts/payload_validator.py:38— payload_validator.validate has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (42 pts), error handling 3 (7 pts), loops 5 (7 pts), ternaries 4, boolean chains 3 (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.
utils.extract_single_file (cognitive 62) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/utils.py:400— utils.extract_single_file has cognitive complexity 62 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 9, error handling 1 (3 pts), ternaries 1 (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.
model_arithmetic.step (cognitive 62) engineering/deep-learning-book/skills/deep-learning-book/scripts/model_arithmetic.py:98— model_arithmetic.step has cognitive complexity 62 (threshold 15). Drivers by points: if/else 24 (38 pts), ternaries 7 (15 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 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.
score.render_segmented_text (cognitive 62) finance/skills/stock-analysis/scripts/score.py:1396— score.render_segmented_text has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 8 (12 pts), ternaries 2 (6 pts), boolean chains 5 (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.
resource_capacity_planner.optimize_resource_allocation (cognitive 62) project-management/skills/senior-pm/scripts/resource_capacity_planner.py:370— resource_capacity_planner.optimize_resource_allocation has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 6 (18 pts), boolean chains 3 (nesting depth added 41). 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.
collect_sessions.parse_codex_session (cognitive 61) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:391— collect_sessions.parse_codex_session has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (46 pts), boolean chains 11, error handling 2 (3 pts), loops 1 (nesting depth added 32). 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.
schema_validator.score_schema (cognitive 60) marketing-skill/skills/schema-markup/scripts/schema_validator.py:126— schema_validator.score_schema has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (41 pts), ternaries 5 (9 pts), boolean chains 7, loops 1 (3 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.
mechanism_matcher.match (cognitive 60) research/grants/skills/grants/scripts/mechanism_matcher.py:54— mechanism_matcher.match has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (51 pts), boolean chains 8, loops 1 (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.
OKRGenerator.generate_okr_dashboard (cognitive 59) product-team/skills/product-strategist/scripts/okr_cascade_generator.py:247— OKRGenerator.generate_okr_dashboard has cognitive complexity 59 (threshold 15). Drivers by points: loops 11 (37 pts), if/else 7 (21 pts), boolean chains 1 (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
qsr_compliance_checker.search_documentation (cognitive 59) ra-qm-team/skills/fda-consultant-specialist/scripts/qsr_compliance_checker.py:348— qsr_compliance_checker.search_documentation has cognitive complexity 59 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 8 (20 pts), error handling 3 (11 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 38). 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.
result_ranker.main (cognitive 58) engineering/agenthub/skills/agenthub/scripts/result_ranker.py:187— result_ranker.main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (30 pts), ternaries 5 (14 pts), boolean chains 8, loops 4 (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.
version_bumper.main (cognitive 58) engineering/skills/changelog-generator/scripts/version_bumper.py:467— version_bumper.main has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (30 pts), loops 6 (18 pts), error handling 4 (5 pts), ternaries 1 (5 pts) (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.
score_aggregator.validate (cognitive 55) engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:114— score_aggregator.validate has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 9, loops 6 (9 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.
contrast_checker.main (cognitive 54) engineering-team/a11y-audit/skills/a11y-audit/scripts/contrast_checker.py:364— contrast_checker.main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (32 pts), error handling 6 (11 pts), loops 2 (5 pts), boolean chains 3, ternaries 2 (3 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.
ops_efficiency_analyzer.format_report (cognitive 53) c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:607— ops_efficiency_analyzer.format_report has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 10 (27 pts), if/else 10 (14 pts), loops 7 (12 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.
html_validator.validate (cognitive 53) marketing/landing/skills/landing/scripts/html_validator.py:113— html_validator.validate has cognitive complexity 53 (threshold 15). Drivers by points: if/else 38 (39 pts), boolean chains 8, ternaries 3 (6 pts) (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, 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.
validate_examples.main (cognitive 52) engineering/agent-memory/skills/agent-memory/scripts/validate_examples.py:195— validate_examples.main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 14 (20 pts), ternaries 3 (5 pts), boolean chains 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.
score.run_scorecard (cognitive 52) finance/skills/stock-analysis/scripts/score.py:637— score.run_scorecard has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 17, loops 5 (6 pts), error handling 1 (2 pts), ternaries 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.
sync-codex-skills.find_skills (cognitive 52) scripts/sync-codex-skills.py:98— sync-codex-skills.find_skills has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 36). 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.
threat_signal_analyzer.anomaly_mode (cognitive 50) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:262— threat_signal_analyzer.anomaly_mode has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (22 pts), error handling 5 (13 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 3 (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.
primitives_validator.validate (cognitive 49) agent-launcher/skills/interview/scripts/primitives_validator.py:31— primitives_validator.validate has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 7, loops 3 (4 pts), error handling 1 (2 pts), ternaries 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.
lint_report.check_blank_cells (cognitive 49) finance/skills/stock-analysis/scripts/lint_report.py:629— lint_report.check_blank_cells has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 6 (13 pts), boolean chains 5, ternaries 1 (3 pts) (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.
codebase_analyzer.analyze_project (cognitive 49) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:463— codebase_analyzer.analyze_project has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 9 (12 pts), boolean chains 9, ternaries 5 (6 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.
sync-gemini-skills.find_skills (cognitive 49) scripts/sync-gemini-skills.py:44— sync-gemini-skills.find_skills has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (10 pts), boolean chains 6 (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.
pricing_model_picker.score_models (cognitive 48) commercial/skills/pricing-strategist/scripts/pricing_model_picker.py:85— pricing_model_picker.score_models has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 21, loops 2 (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.
PaymentProcessor.process_payment (cognitive 48) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:27— PaymentProcessor.process_payment has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (37 pts), error handling 3 (8 pts), boolean chains 3 (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.
cloud_posture_check.main (cognitive 47) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:967— cloud_posture_check.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (35 pts), loops 3 (8 pts), boolean chains 2, error handling 2 (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.
dependencies.run_dependency_check (cognitive 47) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/dependencies.py:236— dependencies.run_dependency_check has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 3 (10 pts), loops 4 (6 pts), boolean chains 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.
IndexOptimizer.analyze_missing_indexes (cognitive 47) REDACTED:227— IndexOptimizer.analyze_missing_indexes has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 3 (5 pts), boolean chains 4 (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.
decision_tracker.parse_decisions (cognitive 46) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:141— decision_tracker.parse_decisions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 3, loops 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.
UserService.create_user (cognitive 46) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:24— UserService.create_user has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (46 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.
cloud_posture_check.check_security_group (cognitive 45) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:724— cloud_posture_check.check_security_group has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (12 pts), boolean chains 4, ternaries 1 (4 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.
score_aggregator.main (cognitive 45) engineering/skill-doctor/skills/skill-doctor/scripts/score_aggregator.py:289— score_aggregator.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 4 (10 pts), ternaries 4 (7 pts), error handling 1 (2 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.
adr_scanner.scan_directory (cognitive 44) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:87— adr_scanner.scan_directory has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 4, ternaries 2 (4 pts), boolean chains 1 (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.
SQLParser._parse_table_body (cognitive 43) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:127— SQLParser._parse_table_body has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (37 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (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.
chart_analyzer.check_security (cognitive 43) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:331— chart_analyzer.check_security has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (33 pts), boolean chains 6, loops 3 (4 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.
lint_wiki.scan (cognitive 43) engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py:44— lint_wiki.scan has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 6 (8 pts), error handling 1 (3 pts), boolean chains 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.
valuation.render_text (cognitive 43) finance/skills/stock-analysis/scripts/valuation.py:648— valuation.render_text has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 5 (10 pts), ternaries 4 (10 pts), boolean chains 6 (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.
repurpose_splitter.main (cognitive 43) marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:196— repurpose_splitter.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 6 (11 pts), loops 4 (8 pts), boolean chains 5, error handling 1 (2 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.
sync-hermes-skills.discover_skills (cognitive 43) scripts/sync-hermes-skills.py:58— sync-hermes-skills.discover_skills has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (9 pts), boolean chains 5 (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.
sync-vibe-skills.discover_skills (cognitive 43) scripts/sync-vibe-skills.py:71— sync-vibe-skills.discover_skills has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (9 pts), boolean chains 5 (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.
discount_matrix_builder.build_matrix (cognitive 42) commercial/skills/commercial-policy/scripts/discount_matrix_builder.py:148— discount_matrix_builder.build_matrix has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 4 (20 pts), loops 5 (11 pts), if/else 2 (10 pts), boolean chains 1 (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.
skill_security_auditor.scan_dependencies (cognitive 42) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:682— skill_security_auditor.scan_dependencies has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (10 pts), boolean chains 4, error handling 2 (4 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.
churn_analyzer.print_full_report (cognitive 41) c-level-advisor/skills/cro-advisor/scripts/churn_analyzer.py:441— churn_analyzer.print_full_report has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 14 (15 pts), loops 5 (8 pts), boolean chains 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.
cloud_posture_check.analyze_statement (cognitive 41) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:288— cloud_posture_check.analyze_statement has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (35 pts), ternaries 2 (4 pts), loops 1 (2 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.
DataContractValidator._parse_simple_yaml (cognitive 41) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:937— DataContractValidator._parse_simple_yaml has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 2 (10 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 25). 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.
ship_gate_scanner.main (cognitive 41) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:1147— ship_gate_scanner.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 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.
positioning_brief.validate (cognitive 41) marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:117— positioning_brief.validate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 11, ternaries 4 (6 pts), loops 1 (2 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.
codebase_analyzer.detect_framework (cognitive 41) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:163— codebase_analyzer.detect_framework has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (7 pts), error handling 2 (6 pts), boolean chains 4 (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.
codebase_analyzer.format_markdown (cognitive 41) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:622— codebase_analyzer.format_markdown has cognitive complexity 41 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 10 (14 pts), ternaries 4 (8 pts), boolean chains 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.
health_scorer.print_dashboard (cognitive 40) c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:337— health_scorer.print_dashboard has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 4 (8 pts), loops 4 (7 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.
DataContractValidator.validate_contract (cognitive 40) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:990— DataContractValidator.validate_contract has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 5, loops 1 (2 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.
score.main (cognitive 40) finance/skills/stock-analysis/scripts/score.py:1983— score.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (16 pts), error handling 6 (9 pts), ternaries 3 (7 pts), loops 2 (5 pts), boolean chains 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.
slide_splitter.split_slides (cognitive 40) markdown-html/skills/md-slides/scripts/slide_splitter.py:76— slide_splitter.split_slides has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 5 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 20). 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.
MigrationGenerator._compare_tables (cognitive 39) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:503— MigrationGenerator._compare_tables has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 5 (10 pts), loops 5 (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.
tf_security_scanner.check_security_groups (cognitive 39) engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:273— tf_security_scanner.check_security_groups has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (33 pts), boolean chains 3, loops 2 (3 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.
campaign_roi_calculator.format_text (cognitive 39) marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:299— campaign_roi_calculator.format_text has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 5 (12 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.
revenue_forecast_model.print_report (cognitive 38) c-level-advisor/skills/cro-advisor/scripts/revenue_forecast_model.py:295— revenue_forecast_model.print_report has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5 (10 pts), loops 7 (9 pts), boolean chains 4 (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.
cloud_posture_check.check_s3_policy (cognitive 38) engineering-team/skills/cloud-security/scripts/cloud_posture_check.py:518— cloud_posture_check.check_s3_policy has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 12, loops 2 (4 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.
engagement_planner.main (cognitive 38) engineering-team/skills/red-team/scripts/engagement_planner.py:283— engagement_planner.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 6 (15 pts), ternaries 1 (2 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.
DatasetValidator._validate_voc (cognitive 38) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1408— DatasetValidator._validate_voc has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (10 pts), error handling 2 (4 pts), boolean chains 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.
log_results.main (cognitive 38) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:316— log_results.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (2 pts) (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.
APIScoringEngine._check_error_handling (cognitive 38) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1085— APIScoringEngine._check_error_handling has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (13 pts), boolean chains 3, ternaries 1 (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.
ship_gate_scanner.grep_files (cognitive 38) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:150— ship_gate_scanner.grep_files has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (25 pts), error handling 3 (6 pts), loops 3 (5 pts), boolean chains 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.
sitemap_analyzer.print_report (cognitive 38) marketing-skill/skills/site-architecture/scripts/sitemap_analyzer.py:236— sitemap_analyzer.print_report has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 7 (12 pts), ternaries 6 (11 pts) (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.
gap_analyzer.analyze_coverage (cognitive 38) ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:168— gap_analyzer.analyze_coverage has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (8 pts), ternaries 1 (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.
UserInterface.renderUserDashboard (cognitive 38) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— UserInterface.renderUserDashboard has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 3 (7 pts), boolean chains 5 (nesting depth added 12). Of this number, 27 points are the body's own statements and 11 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.
stakeholder_mapper.print_report (cognitive 37) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/stakeholder_mapper.py:232— stakeholder_mapper.print_report has cognitive complexity 37 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 6 (12 pts), ternaries 3 (8 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.
memory_inspect.main (cognitive 37) engineering/agent-memory/skills/agent-memory/scripts/memory_inspect.py:170— memory_inspect.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (8 pts), ternaries 3 (5 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.
review_page_builder.markdown_blocks (cognitive 37) engineering/human-gate/skills/human-gate/scripts/review_page_builder.py:164— review_page_builder.markdown_blocks has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (15 pts), boolean chains 6 (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.
score.run_segmented_scorecard (cognitive 37) finance/skills/stock-analysis/scripts/score.py:1110— score.run_segmented_scorecard has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 4 (5 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). 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.
time_block_planner.plan (cognitive 37) productivity/deep-work/skills/deep-work/scripts/time_block_planner.py:86— time_block_planner.plan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 5, loops 4 (5 pts), ternaries 2 (3 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.
sync-codex-skills.main (cognitive 37) scripts/sync-codex-skills.py:357— sync-codex-skills.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 3 (8 pts), boolean chains 4, ternaries 2 (4 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.
output_analyzer.main (cognitive 36) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:228— output_analyzer.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 12). 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.
CodeAnalyzer._detect_god_classes (cognitive 36) engineering-team/skills/senior-architect/scripts/project_architect.py:270— CodeAnalyzer._detect_god_classes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (25 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2 (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.
utils.resolve_input_files (cognitive 36) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/utils.py:352— utils.resolve_input_files has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (14 pts), ternaries 1 (2 pts), boolean chains 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.
skill_security_auditor.scan_filesystem (cognitive 36) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:776— skill_security_auditor.scan_filesystem has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 3 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (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.
verify_data.check_cross_source (cognitive 36) finance/skills/stock-analysis/scripts/verify_data.py:858— verify_data.check_cross_source has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 3 (10 pts), boolean chains 3, loops 2 (3 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.
verify_data._check_magnitude (cognitive 36) finance/skills/stock-analysis/scripts/verify_data.py:1043— verify_data._check_magnitude has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (10 pts), boolean chains 3 (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.
review_html_renderer.render (cognitive 36) markdown-html/skills/md-review/scripts/review_html_renderer.py:395— review_html_renderer.render has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 8 (13 pts), boolean chains 5, ternaries 3 (5 pts) (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.
campaign_roi_calculator.calculate_campaign_metrics (cognitive 36) marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:117— campaign_roi_calculator.calculate_campaign_metrics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 16, boolean chains 4 (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.
seo_checker.analyze_html (cognitive 36) marketing-skill/skills/seo-audit/scripts/seo_checker.py:120— seo_checker.analyze_html has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 26, if/else 4 (5 pts), boolean chains 4, loops 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.
DatasetSplitter._create_split_directories (cognitive 35) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:991— DatasetSplitter._create_split_directories has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (22 pts), error handling 2 (10 pts), loops 2 (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.
SchemaValidator._validate_column (cognitive 35) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:279— SchemaValidator._validate_column has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 8 (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.
agent_orchestrator.parse_yaml_simple (cognitive 35) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:73— agent_orchestrator.parse_yaml_simple has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 19). 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.
rag_evaluator.evaluate_rag_system (cognitive 35) engineering-team/skills/senior-prompt-engineer/scripts/rag_evaluator.py:343— rag_evaluator.evaluate_rag_system has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 7 (9 pts), loops 3 (5 pts), boolean chains 2 (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.
log_results.print_dashboard (cognitive 35) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:135— log_results.print_dashboard has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 5 (13 pts), loops 3 (4 pts), boolean chains 2 (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.
book_skill_validator.check_frontmatter (cognitive 35) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:288— book_skill_validator.check_frontmatter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 3, 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.
pdf.clean_pdftotext (cognitive 35) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/pdf.py:14— pdf.clean_pdftotext has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), ternaries 2 (6 pts), boolean chains 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.
tc_status.render_single (cognitive 35) engineering/skills/tc-tracker/scripts/tc_status.py:39— tc_status.render_single has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4 (10 pts), boolean chains 9 (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.
html_renderer._render_block (cognitive 35) markdown-html/skills/md-document/scripts/html_renderer.py:404— html_renderer._render_block has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 10 (12 pts), boolean chains 5 (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.
deck_html_renderer._render_block (cognitive 35) markdown-html/skills/md-slides/scripts/deck_html_renderer.py:94— deck_html_renderer._render_block has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 10 (12 pts), boolean chains 5 (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.
OKRGenerator.calculate_alignment_score (cognitive 35) product-team/skills/product-strategist/scripts/okr_cascade_generator.py:304— OKRGenerator.calculate_alignment_score has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 5 (12 pts), boolean chains 2 (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.
kb_validator.validate (cognitive 35) productivity/email/skills/inbox-setup/scripts/kb_validator.py:114— kb_validator.validate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 6, loops 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.
handoff_self_check.check (cognitive 35) productivity/handoff/skills/handoff/scripts/handoff_self_check.py:165— handoff_self_check.check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), ternaries 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.
sync-codex-skills.create_symlinks (cognitive 35) scripts/sync-codex-skills.py:226— sync-codex-skills.create_symlinks has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (32 pts), error handling 1 (2 pts), 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.
decision_tracker.report_conflicts (cognitive 34) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:394— decision_tracker.report_conflicts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 6 (9 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.
revshare_modeler.model (cognitive 34) commercial/skills/partnerships-architect/scripts/revshare_modeler.py:139— revshare_modeler.model has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 4 (7 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.
context_md_linter.lint (cognitive 34) engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:110— context_md_linter.lint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 3 (5 pts), boolean chains 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.
AgentEvaluator.calculate_performance_metrics (cognitive 34) engineering/skills/agent-designer/agent_evaluator.py:259— AgentEvaluator.calculate_performance_metrics has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 8 (10 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 7). 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.
BreakingChangeDetector.generate_text_report (cognitive 34) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:875— BreakingChangeDetector.generate_text_report has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (12 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.
hiring_calibrator.format_human_readable (cognitive 34) engineering/skills/interview-system-designer/hiring_calibrator.py:1112— hiring_calibrator.format_human_readable has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (11 pts), boolean chains 1 (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.
RollbackGenerator.generate_human_readable_runbook (cognitive 34) engineering/skills/migration-architect/scripts/rollback_generator.py:940— RollbackGenerator.generate_human_readable_runbook has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (20 pts), if/else 4 (11 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
audit_log_analyzer.analyze (cognitive 34) engineering/skills/secrets-vault-manager/scripts/audit_log_analyzer.py:101— audit_log_analyzer.analyze has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 7 (10 pts), boolean chains 4 (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.
pattern_miner.mine (cognitive 34) marketing/linkedin/skills/linkedin-analytics/scripts/pattern_miner.py:146— pattern_miner.mine has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 4 (6 pts), loops 2 (3 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.
data_subject_rights_tracker.main (cognitive 34) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/data_subject_rights_tracker.py:449— data_subject_rights_tracker.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 2 (5 pts), ternaries 1 (4 pts) (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.
ReportGenerator.generate_text_report (cognitive 33) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1111— ReportGenerator.generate_text_report has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 3 (9 pts), loops 2 (3 pts), boolean chains 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.
CoverageParser._parse_lcov (cognitive 33) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:200— CoverageParser._parse_lcov has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (5 pts), boolean chains 4 (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.
SemanticChunker._identify_sections (cognitive 33) engineering/skills/rag-architect/chunking_optimizer.py:310— SemanticChunker._identify_sections has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 1 (6 pts), boolean chains 2, loops 1 (nesting depth added 20). 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.
context_validator.validate_context (cognitive 33) marketing-skill/skills/marketing-context/scripts/context_validator.py:27— context_validator.validate_context has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (5 pts), boolean chains 4, error handling 1 (3 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.
tweet_composer.main (cognitive 33) marketing-skill/skills/x-twitter-growth/scripts/tweet_composer.py:222— tweet_composer.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (9 pts), ternaries 1 (3 pts), boolean chains 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.
a11y_scanner.check_media_captions_block (cognitive 32) engineering-team/a11y-audit/skills/a11y-audit/scripts/a11y_scanner.py:407— a11y_scanner.check_media_captions_block has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), boolean chains 4, loops 2 (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.
LayerViolationDetector._analyze_imports (cognitive 32) engineering-team/skills/senior-architect/scripts/project_architect.py:391— LayerViolationDetector._analyze_imports has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (6 pts), error handling 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.
epub.extract_with_zipfile (cognitive 32) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/epub.py:67— epub.extract_with_zipfile has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), ternaries 3 (6 pts), boolean chains 4, error handling 2 (3 pts) (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.
question_bank_generator.main (cognitive 32) engineering/skills/interview-system-designer/question_bank_generator.py:970— question_bank_generator.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 4 (10 pts), boolean chains 3, error handling 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.
ratios.render_text (cognitive 32) finance/skills/stock-analysis/scripts/ratios.py:2368— ratios.render_text has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 6 (10 pts), ternaries 3 (7 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.
verify_data.check_period_alignment (cognitive 32) finance/skills/stock-analysis/scripts/verify_data.py:1108— verify_data.check_period_alignment has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (12 pts), boolean chains 4, loops 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.
annotation_extractor.extract_annotations (cognitive 32) markdown-html/skills/md-review/scripts/annotation_extractor.py:57— annotation_extractor.extract_annotations has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (7 pts) (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.
project_health_dashboard.format_text_output (cognitive 32) project-management/skills/senior-pm/scripts/project_health_dashboard.py:635— project_health_dashboard.format_text_output has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5 (12 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.
kb_ingester.generate_report (cognitive 31) business-operations/skills/knowledge-ops/scripts/kb_ingester.py:264— kb_ingester.generate_report has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 6 (13 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). 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.
pipeline_orchestrator.main (cognitive 31) engineering-team/skills/senior-data-engineer/scripts/pipeline_orchestrator.py:717— pipeline_orchestrator.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 2 (5 pts), boolean chains 2, error handling 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.
log_results.export_dashboard_markdown (cognitive 31) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:280— log_results.export_dashboard_markdown has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 4 (10 pts), boolean chains 4, loops 2 (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.
data_profiler.print_report (cognitive 31) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/data_profiler.py:151— data_profiler.print_report has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (8 pts), boolean chains 3, ternaries 2 (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.
reading_path_planner.main (cognitive 31) engineering/deep-learning-book/skills/deep-learning-book/scripts/reading_path_planner.py:373— reading_path_planner.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 4 (12 pts), boolean chains 2, ternaries 2 (nesting depth added 11). 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.
feedback_parser._strip_comments (cognitive 31) engineering/human-gate/skills/human-gate/scripts/feedback_parser.py:111— feedback_parser._strip_comments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 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.
diff_surgeon.main (cognitive 31) engineering/karpathy-coder/skills/karpathy-coder/scripts/diff_surgeon.py:141— diff_surgeon.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (13 pts), ternaries 4 (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.
loop_designer.main (cognitive 31) engineering/skills/interview-system-designer/loop_designer.py:826— loop_designer.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 3 (8 pts), boolean chains 4, error handling 2 (3 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.
ReportFormatter.format_human_readable (cognitive 31) engineering/skills/skill-tester/scripts/skill_validator.py:578— ReportFormatter.format_human_readable has cognitive complexity 31 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 9, ternaries 3 (9 pts), boolean chains 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.
prompt_versioner.main (cognitive 31) marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_versioner.py:126— prompt_versioner.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 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.
content_planner.generate_plan (cognitive 31) marketing-skill/skills/x-twitter-growth/scripts/content_planner.py:78— content_planner.generate_plan has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 4 (13 pts), if/else 3 (9 pts), loops 3 (6 pts), boolean chains 3 (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.
post_linter.lint (cognitive 31) marketing/linkedin/skills/linkedin-content/scripts/post_linter.py:117— post_linter.lint has cognitive complexity 31 (threshold 15). Drivers by points: if/else 26 (27 pts), boolean chains 4 (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.
action_item_extractor.extract (cognitive 31) productivity/meetings/skills/meetings/scripts/action_item_extractor.py:105— action_item_extractor.extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 16). 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.
open_loop_scanner.scan (cognitive 31) productivity/weekly-review/skills/weekly-review/scripts/open_loop_scanner.py:50— open_loop_scanner.scan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 1 (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.
resource_capacity_planner.format_text_output (cognitive 31) project-management/skills/senior-pm/scripts/resource_capacity_planner.py:646— resource_capacity_planner.format_text_output has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 10 (15 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
full-page-screenshot.captureFullPage (cognitive 31) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:221— full-page-screenshot.captureFullPage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 5 (9 pts), loops 3 (7 pts), boolean chains 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.
cron_validator._valid_field (cognitive 30) agent-launcher/skills/run-without-you/scripts/cron_validator.py:25— cron_validator._valid_field has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 5, 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.
gtm_efficiency_calculator.rate_metric (cognitive 30) business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:75— gtm_efficiency_calculator.rate_metric has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 5 (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.
vendor_risk_classifier.classify_regulatory_exposure (cognitive 30) business-operations/skills/vendor-management/scripts/vendor_risk_classifier.py:127— vendor_risk_classifier.classify_regulatory_exposure has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9 (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.
engagement_planner.build_engagement_plan (cognitive 30) engineering-team/skills/red-team/scripts/engagement_planner.py:137— engagement_planner.build_engagement_plan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, loops 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.
api_scaffolder.load_yaml_as_json (cognitive 30) engineering-team/skills/senior-backend/scripts/api_scaffolder.py:24— api_scaffolder.load_yaml_as_json has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 3, loops 2 (3 pts) (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.
CoverageAnalyzer._parse_json (cognitive 30) engineering-team/skills/tdd-guide/scripts/coverage_analyzer.py:102— CoverageAnalyzer._parse_json has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (14 pts), error handling 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.
AgentEvaluator.analyze_errors (cognitive 30) engineering/skills/agent-designer/agent_evaluator.py:355— AgentEvaluator.analyze_errors has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (8 pts), ternaries 2 (4 pts), boolean chains 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.
ship_gate_scanner.print_report (cognitive 30) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:1031— ship_gate_scanner.print_report has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 6). 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.
tc_create.main (cognitive 30) engineering/skills/tc-tracker/scripts/tc_create.py:146— tc_create.main has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 7, boolean chains 4, error handling 3 (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.
tc_init.main (cognitive 30) engineering/skills/tc-tracker/scripts/tc_init.py:106— tc_init.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (7 pts), error handling 3 (6 pts), boolean chains 4 (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.
nap_checker.build_report (cognitive 30) marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:169— nap_checker.build_report has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (8 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.
comment_target_planner.build (cognitive 30) marketing/linkedin/skills/linkedin-engagement/scripts/comment_target_planner.py:89— comment_target_planner.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, 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.
citation_tracker.main (cognitive 30) research/pulse/skills/pulse/scripts/citation_tracker.py:471— citation_tracker.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, error handling 1, ternaries 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.
full-page-screenshot.modeUrl (cognitive 30) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:524— full-page-screenshot.modeUrl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 5 (11 pts), boolean chains 2, loops 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.
backend_decision_engine.render_markdown (cognitive 29) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:191— backend_decision_engine.render_markdown has cognitive complexity 29 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 10 (11 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DatasetAnalyzer._detect_format (cognitive 29) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:204— DatasetAnalyzer._detect_format has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 3 (7 pts), loops 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.
APIScoringEngine._check_parameter_documentation (cognitive 29) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:691— APIScoringEngine._check_parameter_documentation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (6 pts), boolean chains 1, ternaries 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.
HiringCalibrator._analyze_competency_bias (cognitive 29) engineering/skills/interview-system-designer/hiring_calibrator.py:398— HiringCalibrator._analyze_competency_bias has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (9 pts), 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.
AlertOptimizer.analyze_thresholds (cognitive 29) engineering/skills/observability-designer/scripts/alert_optimizer.py:509— AlertOptimizer.analyze_thresholds has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 3, loops 1 (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.
ship_gate_scanner.detect_stack (cognitive 29) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:227— ship_gate_scanner.detect_stack has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 2 (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.
score.apply_gates (cognitive 29) finance/skills/stock-analysis/scripts/score.py:556— score.apply_gates has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 2 (5 pts), loops 2 (3 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.
score.explain (cognitive 29) finance/skills/stock-analysis/scripts/score.py:1632— score.explain has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 5 (9 pts), ternaries 1 (3 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.
campaign_tracker.analyze_campaign (cognitive 29) marketing-skill/skills/marketing-ops/scripts/campaign_tracker.py:29— campaign_tracker.analyze_campaign has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, loops 2, ternaries 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.
codebase_analyzer.extract_backend_routes (cognitive 29) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:367— codebase_analyzer.extract_backend_routes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 3, 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.
anti_todo_card.main (cognitive 29) productivity/andreessen/skills/andreessen/scripts/anti_todo_card.py:146— anti_todo_card.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 3 (6 pts), boolean chains 2, error handling 1 (2 pts), 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.
gdpr_compliance_checker.analyze_project (cognitive 29) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:201— gdpr_compliance_checker.analyze_project has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), error handling 1 (4 pts), loops 3 (4 pts), boolean chains 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.
check_frontmatter.main (cognitive 29) scripts/check_frontmatter.py:174— check_frontmatter.main has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 8 (11 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
derive_counters.run_check (cognitive 29) scripts/derive_counters.py:273— derive_counters.run_check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (8 pts), error handling 2 (4 pts), boolean chains 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.
decision_matrix_scorer.interactive_mode (cognitive 28) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:288— decision_matrix_scorer.interactive_mode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), error handling 2 (6 pts) (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.
alignment_checker.print_report (cognitive 28) c-level-advisor/skills/strategic-alignment/scripts/alignment_checker.py:317— alignment_checker.print_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (9 pts), ternaries 2 (5 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.
bookings_forecaster.compute_forecast (cognitive 28) commercial/skills/commercial-forecaster/scripts/bookings_forecaster.py:197— bookings_forecaster.compute_forecast has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (10 pts), ternaries 3 (5 pts), loops 2 (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.
code_quality_analyzer.analyze_project (cognitive 28) engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:334— code_quality_analyzer.analyze_project has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 7 (11 pts), error handling 1 (2 pts), loops 2, 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.
CoverageParser._parse_istanbul_json (cognitive 28) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:103— CoverageParser._parse_istanbul_json has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), boolean chains 1 (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.
dry_run.check_markdown (cognitive 28) engineering/agenthub/skills/agenthub/scripts/dry_run.py:150— dry_run.check_markdown has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (6 pts), boolean chains 1 (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.
rtf._strip_destination_groups (cognitive 28) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/rtf.py:44— rtf._strip_destination_groups has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, loops 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.
APIScoringEngine._check_error_format_consistency (cognitive 28) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:314— APIScoringEngine._check_error_format_consistency has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (10 pts), error handling 1 (4 pts), ternaries 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.
APIScoringEngine._check_parameter_consistency (cognitive 28) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:353— APIScoringEngine._check_parameter_consistency has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 2, 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.
APIScoringEngine._check_status_code_consistency (cognitive 28) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:505— APIScoringEngine._check_status_code_consistency has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (8 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.
APIScoringEngine._check_example_coverage (cognitive 28) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:751— APIScoringEngine._check_example_coverage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (7 pts), boolean chains 2, ternaries 2 (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.
APIScoringEngine._check_discoverability (cognitive 28) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1034— APIScoringEngine._check_discoverability has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (10 pts), boolean chains 2, ternaries 1 (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.
SchemaAnalyzer.generate_mermaid_erd (cognitive 28) engineering/skills/database-designer/schema_analyzer.py:709— SchemaAnalyzer.generate_mermaid_erd has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (6 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.
UpgradePlanner.generate_report (cognitive 28) engineering/skills/dependency-auditor/scripts/upgrade_planner.py:884— UpgradePlanner.generate_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 3 (9 pts), loops 4 (8 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.
validate_workflow._strip_comments (cognitive 28) engineering/workflow-builder/skills/workflow-builder/scripts/validate_workflow.py:22— validate_workflow._strip_comments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 2 (6 pts), boolean chains 3, 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.
metrics_calculator.calculate (cognitive 28) finance/skills/saas-metrics-coach/scripts/metrics_calculator.py:19— metrics_calculator.calculate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, boolean chains 10. 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.
Period._derive (cognitive 28) finance/skills/stock-analysis/scripts/ratios.py:507— Period._derive has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 13 (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.
Analysis.build_ev_bridge (cognitive 28) finance/skills/stock-analysis/scripts/ratios.py:1673— Analysis.build_ev_bridge has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 5 (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.
valuation.scenario_value (cognitive 28) finance/skills/stock-analysis/scripts/valuation.py:491— valuation.scenario_value has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (12 pts), ternaries 1 (2 pts) (nesting depth added 5). 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.
seo_health_scorer.score_checks (cognitive 28) marketing-skill/skills/seo-audit/scripts/seo_health_scorer.py:109— seo_health_scorer.score_checks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). 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.
social_calendar_generator.build_markdown (cognitive 28) marketing-skill/skills/social-media-manager/scripts/social_calendar_generator.py:220— social_calendar_generator.build_markdown has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 3 (8 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
jira_snapshot_bridge.flow_report (cognitive 28) project-management/skills/pm-skills/scripts/jira_snapshot_bridge.py:116— jira_snapshot_bridge.flow_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 3 (9 pts), boolean chains 6, ternaries 3 (nesting depth added 7). 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.
retrospective_analyzer.analyze_action_item_completion (cognitive 28) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:236— retrospective_analyzer.analyze_action_item_completion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5, ternaries 2, boolean chains 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.
fda_submission_tracker.print_text_report (cognitive 28) ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:305— fda_submission_tracker.print_text_report has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 6, loops 3 (5 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.
hipaa_risk_assessment.scan_code_patterns (cognitive 28) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:253— hipaa_risk_assessment.scan_code_patterns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), error handling 2 (7 pts) (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.
source_tier_classifier.classify (cognitive 28) research/dossier/skills/dossier/scripts/source_tier_classifier.py:125— source_tier_classifier.classify has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 8, loops 3, error handling 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, 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.
check_model_freshness.main (cognitive 28) scripts/check_model_freshness.py:171— check_model_freshness.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (8 pts), ternaries 2 (5 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.
smoke_json_output.main (cognitive 28) scripts/smoke_json_output.py:148— smoke_json_output.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (8 pts), boolean chains 2, error handling 1, 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.
full-page-screenshot.captureViaProxy (cognitive 28) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:646— full-page-screenshot.captureViaProxy has cognitive complexity 28 (threshold 15). Drivers by points: error handling 3 (10 pts), boolean chains 5, if/else 4 (5 pts), loops 2 (5 pts), ternaries 2 (3 pts) (nesting depth added 12). Of this number, 26 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.
code_quality_checker.check_c_specific_smells (cognitive 27) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:610— code_quality_checker.check_c_specific_smells has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 9 (12 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.
incident_triage.main (cognitive 27) engineering-team/skills/incident-response/scripts/incident_triage.py:600— incident_triage.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20 (24 pts), error handling 2, boolean chains 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, 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.
FormatConverter._coco_to_yolo (cognitive 27) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:549— FormatConverter._coco_to_yolo has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 3 (9 pts), error handling 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DatasetValidator._validate_coco (cognitive 27) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1303— DatasetValidator._validate_coco has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 1 (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.
frontend_decision_engine.render_markdown (cognitive 27) engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:145— frontend_decision_engine.render_markdown has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 10, boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
fullstack_decision_engine.render_markdown (cognitive 27) engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:187— fullstack_decision_engine.render_markdown has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 10, boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
chart_analyzer.check_templates (cognitive 27) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:257— chart_analyzer.check_templates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (8 pts), boolean chains 4 (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.
values_validator.parse_values (cognitive 27) REDACTED:78— values_validator.parse_values has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, loops 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.
memory_density_auditor.load_records (cognitive 27) engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:321— memory_density_auditor.load_records has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 3 (8 pts), loops 3 (5 pts), boolean chains 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.
AgentPlanner.design_communication_topology (cognitive 27) engineering/skills/agent-designer/agent_planner.py:544— AgentPlanner.design_communication_topology has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 5 (12 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
tc_init.detect_project_name (cognitive 27) engineering/skills/tc-tracker/scripts/tc_init.py:35— tc_init.detect_project_name has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (6 pts), loops 2 (4 pts), boolean chains 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.
onboard.main (cognitive 27) markdown-html/skills/design-system/scripts/onboard.py:173— onboard.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 1 (4 pts), loops 1 (2 pts), ternaries 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.
cross_search_aggregator.aggregate (cognitive 27) research/litreview/skills/litreview/scripts/cross_search_aggregator.py:88— cross_search_aggregator.aggregate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 6 (9 pts), boolean chains 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.
family_resolver.resolve_families (cognitive 27) research/patent/skills/patent/scripts/family_resolver.py:138— family_resolver.resolve_families has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (11 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.
check_dual_publish.discover_pairs (cognitive 27) scripts/check_dual_publish.py:53— check_dual_publish.discover_pairs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (9 pts), boolean chains 1 (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.
check_plugin_json.main (cognitive 27) scripts/check_plugin_json.py:204— check_plugin_json.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (13 pts), ternaries 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.
cron_validator.main (cognitive 26) agent-launcher/skills/run-without-you/scripts/cron_validator.py:86— cron_validator.main has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 5 (6 pts), loops 2 (4 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.
deployment_builder.main (cognitive 26) agent-launcher/skills/run-without-you/scripts/deployment_builder.py:58— deployment_builder.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, ternaries 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.
supplier_consolidation.render_markdown (cognitive 26) business-operations/skills/procurement-optimizer/scripts/supplier_consolidation.py:223— supplier_consolidation.render_markdown has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (4 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.
decision_tracker.report_search (cognitive 26) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:367— decision_tracker.report_search has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (5 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.
complexity_checker.extract_functions (cognitive 26) engineering/karpathy-coder/skills/karpathy-coder/scripts/complexity_checker.py:99— complexity_checker.extract_functions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 6, loops 2 (3 pts), ternaries 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.
question_bank_generator.format_human_readable (cognitive 26) engineering/skills/interview-system-designer/question_bank_generator.py:880— question_bank_generator.format_human_readable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 8 (13 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.
SchemaCompatibilityChecker._analyze_endpoint_changes (cognitive 26) engineering/skills/migration-architect/scripts/compatibility_checker.py:534— SchemaCompatibilityChecker._analyze_endpoint_changes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 4 (7 pts) (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.
ship_gate_scanner.run_manual_checks (cognitive 26) engineering/skills/ship-gate/scripts/ship_gate_scanner.py:977— ship_gate_scanner.run_manual_checks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 5, error handling 1 (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.
markdown_parser.parse_markdown (cognitive 26) markdown-html/skills/md-document/scripts/markdown_parser.py:208— markdown_parser.parse_markdown has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, 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.
hig_checker.main (cognitive 26) product-team/apple-hig-expert/skills/apple-hig-expert/scripts/hig_checker.py:36— hig_checker.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (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.
jql_query_builder.build_jql_from_description (cognitive 26) project-management/skills/jira-expert/scripts/jql_query_builder.py:209— jql_query_builder.build_jql_from_description has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 5, 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, 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.
CAPATracker.calculate_metrics (cognitive 26) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:114— CAPATracker.calculate_metrics has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4, boolean chains 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.
root_cause_analyzer.format_rca_text (cognitive 26) ra-qm-team/skills/capa-officer/scripts/root_cause_analyzer.py:363— root_cause_analyzer.format_rca_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (12 pts), ternaries 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.
generate-docs.find_skill_files (cognitive 26) scripts/generate-docs.py:41— generate-docs.find_skill_files has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 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.
full-page-screenshot.modeTarget (cognitive 26) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:871— full-page-screenshot.modeTarget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 5 (12 pts), boolean chains 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.
comms_calendar_builder.build_calendar (cognitive 25) business-operations/skills/internal-comms/scripts/comms_calendar_builder.py:78— comms_calendar_builder.build_calendar has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, ternaries 1 (2 pts), 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.
hiring_plan_modeler.print_report (cognitive 25) c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:275— hiring_plan_modeler.print_report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (8 pts), ternaries 1 (3 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.
ops_efficiency_analyzer.analyze_team_structure (cognitive 25) c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:320— ops_efficiency_analyzer.analyze_team_structure has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 4 (7 pts), loops 3 (4 pts), boolean chains 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.
portfolio_analyzer._product_findings (cognitive 25) c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:222— portfolio_analyzer._product_findings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 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.
decision_tracker.main (cognitive 25) c-level-advisor/skills/decision-logger/scripts/decision_tracker.py:546— decision_tracker.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (6 pts), loops 1 (2 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.
review_report_generator.format_markdown_report (cognitive 25) engineering-team/skills/code-reviewer/scripts/review_report_generator.py:224— review_report_generator.format_markdown_report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (9 pts), ternaries 2 (6 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.
project_architect.main (cognitive 25) engineering-team/skills/senior-architect/scripts/project_architect.py:647— project_architect.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (6 pts), ternaries 1 (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.
bundle_analyzer.analyze_imports (cognitive 25) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:220— bundle_analyzer.analyze_imports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), error handling 1 (4 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.
bundle_analyzer.print_report (cognitive 25) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:293— bundle_analyzer.print_report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (11 pts) (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.
setup_experiment.list_experiments (cognitive 25) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/setup_experiment.py:178— setup_experiment.list_experiments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 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.
APIScoringEngine._check_naming_consistency (cognitive 25) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:223— APIScoringEngine._check_naming_consistency has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (8 pts), boolean chains 3, ternaries 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.
score.resolve_sector (cognitive 25) finance/skills/stock-analysis/scripts/score.py:157— score.resolve_sector has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (8 pts), boolean chains 4 (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.
score.score_metric (cognitive 25) finance/skills/stock-analysis/scripts/score.py:364— score.score_metric has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, ternaries 2 (3 pts), 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.
score.aggregate (cognitive 25) finance/skills/stock-analysis/scripts/score.py:479— score.aggregate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (7 pts), loops 5, 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.
comparison_matrix_builder.build_matrix (cognitive 25) marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:77— comparison_matrix_builder.build_matrix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 4 (7 pts), loops 4 (5 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.
form_field_analyzer.analyze_form (cognitive 25) marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:108— form_field_analyzer.analyze_form has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 5, 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, 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.
headline_scorer.score_headline (cognitive 25) marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:103— headline_scorer.score_headline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, ternaries 11, boolean chains 2. 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.
session_start._find_latest (cognitive 25) productivity/handoff/hooks/session_start.py:66— session_start._find_latest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2, ternaries 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.
citation_tracker.normalize_export (cognitive 25) research/pulse/skills/pulse/scripts/citation_tracker.py:227— citation_tracker.normalize_export has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, error handling 1 (3 pts), loops 1, ternaries 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.
check_paths.extract_candidates (cognitive 25) scripts/check_paths.py:72— check_paths.extract_candidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 4, loops 2 (3 pts) (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.
scenario_modeler.print_report (cognitive 24) c-level-advisor/skills/scenario-war-room/scripts/scenario_modeler.py:212— scenario_modeler.print_report has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (8 pts), ternaries 2 (4 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.
packaging_designer.detect_anti_patterns (cognitive 24) commercial/skills/pricing-strategist/scripts/packaging_designer.py:107— packaging_designer.detect_anti_patterns has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, 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.
DatasetValidator._validate_yolo (cognitive 24) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1354— DatasetValidator._validate_yolo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 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.
prompt_rater.rate (cognitive 24) engineering/claude-coach/skills/claude-coach/scripts/prompt_rater.py:57— prompt_rater.rate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 7, boolean chains 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.
outlier_detector.print_report (cognitive 24) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/outlier_detector.py:174— outlier_detector.print_report has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (3 pts), loops 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.
feedback_parser.render_human (cognitive 24) engineering/human-gate/skills/human-gate/scripts/feedback_parser.py:391— feedback_parser.render_human has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3 (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.
APILinter._validate_path_structure (cognitive 24) engineering/skills/api-design-reviewer/scripts/api_linter.py:279— APILinter._validate_path_structure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, 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.
APIScoringEngine._check_response_consistency (cognitive 24) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:255— APIScoringEngine._check_response_consistency has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (10 pts), ternaries 2, boolean chains 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.
HiringCalibrator._analyze_interviewer_bias (cognitive 24) engineering/skills/interview-system-designer/hiring_calibrator.py:335— HiringCalibrator._analyze_interviewer_bias has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 3 (5 pts), loops 3 (4 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.
QuestionBankGenerator._generate_questions (cognitive 24) engineering/skills/interview-system-designer/question_bank_generator.py:617— QuestionBankGenerator._generate_questions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 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.
SemanticChunker._chunk_section (cognitive 24) engineering/skills/rag-architect/chunking_optimizer.py:364— SemanticChunker._chunk_section has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 4 (8 pts), boolean chains 3, 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.
TestReportFormatter.format_human_readable (cognitive 24) engineering/skills/skill-tester/scripts/script_tester.py:598— TestReportFormatter.format_human_readable has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 5 (8 pts), ternaries 1 (4 pts) (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.
Analysis.not_computed (cognitive 24) finance/skills/stock-analysis/scripts/ratios.py:2277— Analysis.not_computed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 pts), ternaries 1 (4 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.
tracking_plan_generator.print_report (cognitive 24) marketing-skill/skills/analytics-tracking/scripts/tracking_plan_generator.py:299— tracking_plan_generator.print_report has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (14 pts), loops 5 (7 pts), if/else 2 (3 pts) (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.
sequence_analyzer.main (cognitive 24) marketing-skill/skills/email-sequence/scripts/sequence_analyzer.py:270— sequence_analyzer.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (6 pts), ternaries 3 (6 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.
directional_recommendation_validator.validate (cognitive 24) productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:91— directional_recommendation_validator.validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 4 (5 pts) (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, 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.
a11y_scanner.check_table_headers (cognitive 23) engineering-team/a11y-audit/skills/a11y-audit/scripts/a11y_scanner.py:365— a11y_scanner.check_table_headers has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 1, 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.
code_quality_checker.check_code_smells (cognitive 23) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:336— code_quality_checker.check_code_smells has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (8 pts), ternaries 1 (3 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.
CostOptimizer._analyze_compute (cognitive 23) engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:61— CostOptimizer._analyze_compute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2, boolean chains 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.
PIRGenerator._create_rca_section (cognitive 23) engineering-team/skills/incident-commander/scripts/pir_generator.py:1163— PIRGenerator._create_rca_section has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (10 pts), boolean chains 2 (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.
DependencyAnalyzer._parse_poetry (cognitive 23) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:140— DependencyAnalyzer._parse_poetry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 11). 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.
DatasetAnalyzer._analyze_coco (cognitive 23) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:293— DatasetAnalyzer._analyze_coco has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), error handling 1 (2 pts) (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.
threat_signal_analyzer.ioc_mode (cognitive 23) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:161— threat_signal_analyzer.ioc_mode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (4 pts), loops 3 (4 pts), boolean chains 1, ternaries 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.
memory_promote.promote_l2_to_l3 (cognitive 23) engineering/agent-memory/skills/agent-memory/scripts/memory_promote.py:78— memory_promote.promote_l2_to_l3 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 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.
setup_experiment.main (cognitive 23) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/setup_experiment.py:251— setup_experiment.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 1 (2 pts), boolean chains 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.
APIScoringEngine._check_developer_experience (cognitive 23) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1212— APIScoringEngine._check_developer_experience has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), ternaries 2, boolean chains 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.
AlertOptimizer.analyze_alert_noise (cognitive 23) engineering/skills/observability-designer/scripts/alert_optimizer.py:82— AlertOptimizer.analyze_alert_noise has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 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.
verify_data.render_text (cognitive 23) finance/skills/stock-analysis/scripts/verify_data.py:1452— verify_data.render_text has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (8 pts), loops 2 (3 pts), ternaries 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.
ad_copy_validator.validate_google_rsa (cognitive 23) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:160— ad_copy_validator.validate_google_rsa has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts), loops 2 (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.
activation_funnel_analyzer.analyze_funnel (cognitive 23) marketing-skill/skills/onboarding-cro/scripts/activation_funnel_analyzer.py:31— activation_funnel_analyzer.analyze_funnel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 4 (7 pts), loops 2 (3 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.
ad_health_scorer.score_platform (cognitive 23) marketing-skill/skills/paid-ads/scripts/ad_health_scorer.py:99— ad_health_scorer.score_platform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 pts), ternaries 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.
ost_linter.lint (cognitive 23) product-team/skills/product-skills/scripts/ost_linter.py:75— ost_linter.lint has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, 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.
setup.run_setup (cognitive 23) productivity/handoff/skills/handoff/scripts/setup.py:152— setup.run_setup has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 7 (10 pts), loops 1 (2 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.
sprint_health_scorer._generate_detailed_metrics (cognitive 23) project-management/skills/scrum-master/scripts/sprint_health_scorer.py:518— sprint_health_scorer._generate_detailed_metrics has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (8 pts), loops 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.
dpia_generator.generate_dpia_report (cognitive 23) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/dpia_generator.py:390— dpia_generator.generate_dpia_report has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 5, ternaries 3 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
action_router.main (cognitive 23) research/notebooklm/skills/notebooklm/scripts/action_router.py:225— action_router.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), error handling 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.
routing_transparency_logger.main (cognitive 23) research/research/skills/research/scripts/routing_transparency_logger.py:127— routing_transparency_logger.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, ternaries 1 (2 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.
discussion_question_validator.main (cognitive 23) research/syllabus/skills/syllabus/scripts/discussion_question_validator.py:149— discussion_question_validator.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (10 pts), boolean chains 1, error handling 1, 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.
check_dual_publish.main (cognitive 23) scripts/check_dual_publish.py:121— check_dual_publish.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (9 pts), ternaries 2 (4 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.
UserInterface.init (cognitive 23) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:29— UserInterface.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). 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.
churn_risk_analyzer.format_text (cognitive 22) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:366— churn_risk_analyzer.format_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (9 pts), ternaries 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.
pipeline_analyzer.assess_pipeline_risk (cognitive 22) business-growth/skills/revenue-operations/scripts/pipeline_analyzer.py:203— pipeline_analyzer.assess_pipeline_risk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4, 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.
decision_matrix_scorer.print_report (cognitive 22) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:164— decision_matrix_scorer.print_report has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (11 pts), if/else 6 (7 pts), ternaries 2 (4 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.
alignment_checker.detect_conflicts (cognitive 22) c-level-advisor/skills/strategic-alignment/scripts/alignment_checker.py:244— alignment_checker.detect_conflicts has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 2 (9 pts), boolean chains 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
channel_mix_optimizer.render_markdown (cognitive 22) commercial/skills/channel-economics/scripts/channel_mix_optimizer.py:185— channel_mix_optimizer.render_markdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 3 (5 pts), ternaries 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.
framework_selector.select_frameworks (cognitive 22) compliance-os/skills/compliance-os/scripts/framework_selector.py:105— framework_selector.select_frameworks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9 (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.
IncidentClassifier._classify_severity (cognitive 22) engineering-team/skills/incident-commander/scripts/incident_classifier.py:420— IncidentClassifier._classify_severity has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), error handling 1 (2 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.
PatternDetector._detect_pattern (cognitive 22) engineering-team/skills/senior-architect/scripts/project_architect.py:115— PatternDetector._detect_pattern has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (10 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.
DatabaseMigrationTool._analyze (cognitive 22) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:591— DatabaseMigrationTool._analyze has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (6 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.
inference_optimizer.main (cognitive 22) engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:474— inference_optimizer.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (3 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.
prompt_optimizer.main (cognitive 22) engineering-team/skills/senior-prompt-engineer/scripts/prompt_optimizer.py:417— prompt_optimizer.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (22 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.
memory_extract.extract (cognitive 22) engineering/agent-memory/skills/agent-memory/scripts/memory_extract.py:86— memory_extract.extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 pts), boolean chains 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.
book_skill_validator.check_safety (cognitive 22) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:369— book_skill_validator.check_safety has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 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.
book_skill_validator.check_indexes (cognitive 22) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:439— book_skill_validator.check_indexes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (10 pts), boolean chains 2 (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.
utils._structural_chapter_count (cognitive 22) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/utils.py:177— utils._structural_chapter_count has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, ternaries 1 (3 pts), loops 2 (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.
assumption_linter.main (cognitive 22) engineering/karpathy-coder/skills/karpathy-coder/scripts/assumption_linter.py:111— assumption_linter.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), ternaries 3 (6 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.
tool_schema_generator.main (cognitive 22) engineering/skills/agent-designer/tool_schema_generator.py:852— tool_schema_generator.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 1, error handling 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.
APIScoringEngine._check_endpoint_documentation (cognitive 22) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:620— APIScoringEngine._check_endpoint_documentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1, ternaries 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.
APIScoringEngine._check_schema_documentation (cognitive 22) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:651— APIScoringEngine._check_schema_documentation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1, 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.
APIScoringEngine._check_batch_operations (cognitive 22) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1411— APIScoringEngine._check_batch_operations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 pts), boolean chains 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.
stack_detector.detect (cognitive 22) engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:75— stack_detector.detect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 5, ternaries 1 (2 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.
SchemaAnalyzer._parse_table_definition (cognitive 22) engineering/skills/database-designer/schema_analyzer.py:145— SchemaAnalyzer._parse_table_definition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 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.
LicenseChecker._scan_package_directory (cognitive 22) engineering/skills/dependency-auditor/scripts/license_checker.py:561— LicenseChecker._scan_package_directory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (7 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.
LicenseChecker._detect_license_conflicts (cognitive 22) engineering/skills/dependency-auditor/scripts/license_checker.py:624— LicenseChecker._detect_license_conflicts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 3 (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.
MigrationPlanner.generate_human_readable_plan (cognitive 22) engineering/skills/migration-architect/scripts/migration_planner.py:509— MigrationPlanner.generate_human_readable_plan has cognitive complexity 22 (threshold 15). Drivers by points: loops 11 (16 pts), if/else 3 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
performance_profiler.count_dependencies (cognitive 22) engineering/skills/performance-profiler/scripts/performance_profiler.py:40— performance_profiler.count_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, error handling 1 (2 pts), 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.
hypothesis_tester._regularized_incomplete_beta (cognitive 22) engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py:62— hypothesis_tester._regularized_incomplete_beta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 2 (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.
verify_data.check_source_tier (cognitive 22) finance/skills/stock-analysis/scripts/verify_data.py:1285— verify_data.check_source_tier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, ternaries 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.
tracking_plan_generator.generate_tracking_plan (cognitive 22) marketing-skill/skills/analytics-tracking/scripts/tracking_plan_generator.py:192— tracking_plan_generator.generate_tracking_plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (10 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.
form_field_analyzer.format_report (cognitive 22) marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:182— form_field_analyzer.format_report has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (6 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ad_health_scorer.main (cognitive 22) marketing-skill/skills/paid-ads/scripts/ad_health_scorer.py:212— ad_health_scorer.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (10 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.
roas_calculator.calculate (cognitive 22) marketing-skill/skills/paid-ads/scripts/roas_calculator.py:20— roas_calculator.calculate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 1 (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.
sitemap_analyzer.parse_sitemap (cognitive 22) marketing-skill/skills/site-architecture/scripts/sitemap_analyzer.py:147— sitemap_analyzer.parse_sitemap has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, ternaries 2 (6 pts), if/else 2 (3 pts), loops 2 (3 pts), 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.
positioning_brief.main (cognitive 22) marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:249— positioning_brief.main has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (6 pts), error handling 2 (5 pts), if/else 4 (5 pts), loops 2 (5 pts), boolean chains 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.
section_progress_tracker.main (cognitive 22) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:199— section_progress_tracker.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, 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.
delivery_loop_gate.main (cognitive 22) project-management/skills/pm-skills/scripts/delivery_loop_gate.py:106— delivery_loop_gate.main has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6, loops 2 (4 pts), 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.
jira_snapshot_bridge.sprint_export (cognitive 22) project-management/skills/pm-skills/scripts/jira_snapshot_bridge.py:186— jira_snapshot_bridge.sprint_export has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 pts), boolean chains 5, loops 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.
retrospective_analyzer.analyze_recurring_themes (cognitive 22) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:306— retrospective_analyzer.analyze_recurring_themes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (8 pts), ternaries 2 (4 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.
framework_recommender.recommend (cognitive 22) research/litreview/skills/litreview/scripts/framework_recommender.py:70— framework_recommender.recommend has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (8 pts), boolean chains 4 (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.
check_frontmatter.check_file (cognitive 22) scripts/check_frontmatter.py:109— check_frontmatter.check_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, error handling 1, loops 1, ternaries 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.
poc_planner.format_text (cognitive 21) business-growth/skills/sales-engineer/scripts/poc_planner.py:581— poc_planner.format_text has cognitive complexity 21 (threshold 15). Drivers by points: loops 11 (14 pts), ternaries 3 (6 pts), if/else 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
kb_ingester.walk_vault (cognitive 21) business-operations/skills/knowledge-ops/scripts/kb_ingester.py:126— kb_ingester.walk_vault has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (4 pts), loops 3 (4 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.
growth_model_simulator.print_channel_mix_impact (cognitive 21) c-level-advisor/skills/cmo-advisor/scripts/growth_model_simulator.py:335— growth_model_simulator.print_channel_mix_impact has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 4 (6 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.
okr_tracker.calculate_kr_score (cognitive 21) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:51— okr_tracker.calculate_kr_score has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (7 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.
gws_recipe_runner.run_recipe (cognitive 21) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/gws_recipe_runner.py:313— gws_recipe_runner.run_recipe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (6 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.
workspace_audit.main (cognitive 21) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/workspace_audit.py:255— workspace_audit.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (2 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.
PIRGenerator._identify_category_factors (cognitive 21) engineering-team/skills/incident-commander/scripts/pir_generator.py:664— PIRGenerator._identify_category_factors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4 (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.
DatabaseMigrationTool._suggest_indexes (cognitive 21) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:697— DatabaseMigrationTool._suggest_indexes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (10 pts), boolean chains 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.
InferenceOptimizer._benchmark_pytorch (cognitive 21) engineering-team/skills/senior-computer-vision/scripts/inference_optimizer.py:292— InferenceOptimizer._benchmark_pytorch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), ternaries 2 (3 pts), error handling 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.
VisionModelTrainer.analyze_dataset (cognitive 21) engineering-team/skills/senior-computer-vision/scripts/vision_model_trainer.py:75— VisionModelTrainer.analyze_dataset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (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.
agent_orchestrator.validate_agent (cognitive 21) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:184— agent_orchestrator.validate_agent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1, ternaries 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.
FrameworkAdapter.generate_setup_teardown (cognitive 21) engineering-team/skills/tdd-guide/scripts/framework_adapter.py:319— FrameworkAdapter.generate_setup_teardown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 2 (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.
OutputFormatter._format_recommendations_markdown (cognitive 21) engineering-team/skills/tdd-guide/scripts/output_formatter.py:137— OutputFormatter._format_recommendations_markdown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 3 (6 pts), ternaries 3 (6 pts), boolean chains 3 (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.
init_vault.init_vault (cognitive 21) engineering/llm-wiki/skills/llm-wiki/scripts/init_vault.py:84— init_vault.init_vault has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (5 pts), loops 4 (5 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.
memory_density_auditor.audit (cognitive 21) engineering/memory-engineering/skills/memory-engineering/scripts/memory_density_auditor.py:365— memory_density_auditor.audit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 3 (5 pts), loops 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.
ToolSchemaGenerator._generate_example_value (cognitive 21) engineering/skills/agent-designer/tool_schema_generator.py:699— ToolSchemaGenerator._generate_example_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2 (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.
IndexOptimizer._find_unused_indexes (cognitive 21) REDACTED:663— IndexOptimizer._find_unused_indexes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (8 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.
SchemaCompatibilityChecker.generate_human_readable_report (cognitive 21) engineering/skills/migration-architect/scripts/compatibility_checker.py:744— SchemaCompatibilityChecker.generate_human_readable_report has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 4 (9 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
AlertOptimizer._analyze_service_coverage (cognitive 21) engineering/skills/observability-designer/scripts/alert_optimizer.py:302— AlertOptimizer._analyze_service_coverage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 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.
ScriptTester._test_argparse_implementation (cognitive 21) engineering/skills/skill-tester/scripts/script_tester.py:316— ScriptTester._test_argparse_implementation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 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.
deck_html_renderer.main (cognitive 21) markdown-html/skills/md-slides/scripts/deck_html_renderer.py:530— deck_html_renderer.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (6 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.
topic_cluster_mapper.build_clusters (cognitive 21) marketing-skill/skills/content-strategy/scripts/topic_cluster_mapper.py:68— topic_cluster_mapper.build_clusters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (6 pts), boolean chains 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.
tool_roi_estimator.print_report (cognitive 21) marketing-skill/skills/free-tool-strategy/scripts/tool_roi_estimator.py:218— tool_roi_estimator.print_report has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 4 (8 pts), boolean chains 1, 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.
social_calendar_generator.build_calendar (cognitive 21) marketing-skill/skills/social-media-manager/scripts/social_calendar_generator.py:124— social_calendar_generator.build_calendar has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (10 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
pattern_miner.prepare (cognitive 21) marketing/linkedin/skills/linkedin-analytics/scripts/pattern_miner.py:107— pattern_miner.prepare has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 3 (5 pts), boolean chains 3, error handling 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.
outreach_message_builder.validate (cognitive 21) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:92— outreach_message_builder.validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2 (3 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.
codebase_analyzer.extract_apis_from_file (cognitive 21) product-team/code-to-prd/skills/code-to-prd/scripts/codebase_analyzer.py:294— codebase_analyzer.extract_apis_from_file has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), ternaries 1 (3 pts), boolean chains 2, error handling 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.
workspace_inventory.main (cognitive 21) productivity/capture/skills/capture/scripts/workspace_inventory.py:178— workspace_inventory.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 2 (5 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.
delivery_loop_gate.check_plan (cognitive 21) project-management/skills/pm-skills/scripts/delivery_loop_gate.py:57— delivery_loop_gate.check_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 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.
retrospective_analyzer.analyze_improvement_trends (cognitive 21) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:371— retrospective_analyzer.analyze_improvement_trends has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (5 pts), loops 2, boolean chains 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.
hipaa_risk_assessment.scan_documentation (cognitive 21) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:224— hipaa_risk_assessment.scan_documentation has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), error handling 1 (4 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
hipaa_risk_assessment.generate_recommendations (cognitive 21) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:453— hipaa_risk_assessment.generate_recommendations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (9 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.
document_version_control.main (cognitive 21) ra-qm-team/skills/quality-documentation-manager/scripts/document_version_control.py:375— document_version_control.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, loops 2 (5 pts), ternaries 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.
QMSEffectivenessMonitor.predict_failures (cognitive 21) ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:196— QMSEffectivenessMonitor.predict_failures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (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.
qms_audit_checklist.main (cognitive 21) ra-qm-team/skills/quality-manager-qms-iso13485/scripts/qms_audit_checklist.py:785— qms_audit_checklist.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (6 pts) (nesting depth added 7). 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.
phase_gate_scorer.score_plan (cognitive 21) research-ops/skills/clinical-research/scripts/phase_gate_scorer.py:88— phase_gate_scorer.score_plan has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 6 (7 pts), boolean chains 4 (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.
classifier.classify (cognitive 21) research/research/skills/research/scripts/classifier.py:66— classifier.classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 2 (3 pts), boolean chains 1, 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.
sync-vibe-skills.main (cognitive 21) scripts/sync-vibe-skills.py:246— sync-vibe-skills.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 7 (8 pts), loops 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.
full-page-screenshot.waitForLoad (cognitive 21) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:168— full-page-screenshot.waitForLoad has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (5 pts), loops 2 (3 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.
interview_planner.plan (cognitive 20) agent-launcher/skills/interview/scripts/interview_planner.py:38— interview_planner.plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4, boolean chains 3, 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.
unit_economics_analyzer.print_cohort_analysis (cognitive 20) c-level-advisor/skills/cfo-advisor/scripts/unit_economics_analyzer.py:253— unit_economics_analyzer.print_cohort_analysis has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 4 (6 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.
pmf_scorer.score_engagement (cognitive 20) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:215— pmf_scorer.score_engagement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 pts) (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, 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.
output_analyzer.read_input (cognitive 20) engineering-team/google-workspace-cli/skills/google-workspace-cli/scripts/output_analyzer.py:52— output_analyzer.read_input has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 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.
TimelineReconstructor._calculate_metrics (cognitive 20) engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:423— TimelineReconstructor._calculate_metrics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 5, boolean chains 4, loops 3 (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.
TimelineReconstructor._analyze_gaps (cognitive 20) engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:492— TimelineReconstructor._analyze_gaps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (6 pts), loops 4 (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.
AnomalyDetector._detect_numeric_anomalies (cognitive 20) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:532— AnomalyDetector._detect_numeric_anomalies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 1 (3 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.
bundle_analyzer.analyze_dependencies (cognitive 20) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:114— bundle_analyzer.analyze_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 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.
code_quality_analyzer.analyze_dependencies (cognitive 20) engineering-team/skills/senior-fullstack/scripts/code_quality_analyzer.py:197— code_quality_analyzer.analyze_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (4 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.
agent_orchestrator.main (cognitive 20) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:462— agent_orchestrator.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), 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.
ReportGenerator.generate_text_report (cognitive 20) engineering-team/skills/senior-qa/scripts/coverage_analyzer.py:454— ReportGenerator.generate_text_report has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (7 pts), ternaries 2 (4 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.
secret_scanner.scan_file (cognitive 20) engineering-team/skills/senior-security/scripts/secret_scanner.py:249— secret_scanner.scan_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 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.
log_results.export_dashboard_csv (cognitive 20) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/log_results.py:219— log_results.export_dashboard_csv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), loops 3 (4 pts), boolean chains 3 (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.
book_skill_validator._collect_skill_files (cognitive 20) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:166— book_skill_validator._collect_skill_files has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, error handling 1, 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.
skill_plugin_emitter.emit (cognitive 20) engineering/book-to-skill/skills/book-to-skill/scripts/skill_plugin_emitter.py:375— skill_plugin_emitter.emit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, error handling 1 (2 pts), 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.
cheat_code_filter.parse_glossary (cognitive 20) engineering/claude-coach/skills/claude-coach/scripts/cheat_code_filter.py:49— cheat_code_filter.parse_glossary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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.
glossary_code_consistency.main (cognitive 20) engineering/grill-with-docs/skills/grill-with-docs/scripts/glossary_code_consistency.py:248— glossary_code_consistency.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 1 (3 pts), ternaries 1 (3 pts), loops 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.
chart_analyzer.analyze_chart (cognitive 20) engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:400— chart_analyzer.analyze_chart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2, boolean chains 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, 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.
review_page_builder.sanitize_attrs (cognitive 20) engineering/human-gate/skills/human-gate/scripts/review_page_builder.py:292— review_page_builder.sanitize_attrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 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.
complexity_checker.main (cognitive 20) engineering/karpathy-coder/skills/karpathy-coder/scripts/complexity_checker.py:245— complexity_checker.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (6 pts), 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.
AgentPlanner.select_architecture_pattern (cognitive 20) engineering/skills/agent-designer/agent_planner.py:207— AgentPlanner.select_architecture_pattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, 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.
APIScoringEngine._check_response_documentation (cognitive 20) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:724— APIScoringEngine._check_response_documentation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), ternaries 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.
APIScoringEngine._check_authentication_patterns (cognitive 20) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:927— APIScoringEngine._check_authentication_patterns has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1, ternaries 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.
pipeline_generator.gitlab_yaml (cognitive 20) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:189— pipeline_generator.gitlab_yaml has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4, boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SelectivityEstimator.estimate_selectivity (cognitive 20) REDACTED:113— SelectivityEstimator.estimate_selectivity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4, boolean chains 2 (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.
DependencyScanner.scan_project (cognitive 20) engineering/skills/dependency-auditor/scripts/dep_scanner.py:196— DependencyScanner.scan_project has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
tc_validator.validate_registry (cognitive 20) engineering/skills/tc-tracker/scripts/tc_validator.py:251— tc_validator.validate_registry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 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.
hypothesis_tester._regularized_gamma (cognitive 20) engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py:291— hypothesis_tester._regularized_gamma has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (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.
tf_security_scanner.check_encryption (cognitive 20) engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:340— tf_security_scanner.check_encryption has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 3 (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.
verify_data.check_basis_mixing (cognitive 20) finance/skills/stock-analysis/scripts/verify_data.py:919— verify_data.check_basis_mixing has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 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.
verify_data.check_recency (cognitive 20) finance/skills/stock-analysis/scripts/verify_data.py:1173— verify_data.check_recency has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (5 pts), boolean chains 3, 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.
extract_citations.run_extraction (cognitive 20) product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:219— extract_citations.run_extraction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (9 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.
competitive_matrix_builder.format_text (cognitive 20) product-team/skills/competitive-teardown/scripts/competitive_matrix_builder.py:152— competitive_matrix_builder.format_text has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (8 pts), ternaries 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.
handoff_template_generator._find_latest_handoff (cognitive 20) productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:83— handoff_template_generator._find_latest_handoff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2, 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.
action_item_extractor.render_markdown (cognitive 20) productivity/meetings/skills/meetings/scripts/action_item_extractor.py:160— action_item_extractor.render_markdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (7 pts), loops 3 (5 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.
permission_audit_tool.check_compliance_gaps (cognitive 20) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:222— permission_audit_tool.check_compliance_gaps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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.
jira_snapshot_bridge.normalize (cognitive 20) project-management/skills/pm-skills/scripts/jira_snapshot_bridge.py:75— jira_snapshot_bridge.normalize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (3 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.
resource_capacity_planner.analyze_project_capacity_requirements (cognitive 20) project-management/skills/senior-pm/scripts/resource_capacity_planner.py:313— resource_capacity_planner.analyze_project_capacity_requirements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 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.
RootCauseAnalyzer.full_analysis (cognitive 20) ra-qm-team/skills/capa-officer/scripts/root_cause_analyzer.py:305— RootCauseAnalyzer.full_analysis has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (4 pts), boolean chains 3, 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.
fda_submission_tracker.calculate_submission_readiness (cognitive 20) ra-qm-team/skills/fda-consultant-specialist/scripts/fda_submission_tracker.py:201— fda_submission_tracker.calculate_submission_readiness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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.
citation_tracker.main (cognitive 20) research/litreview/skills/litreview/scripts/citation_tracker.py:200— citation_tracker.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, 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.
discussion_question_validator.classify_question (cognitive 20) research/syllabus/skills/syllabus/scripts/discussion_question_validator.py:54— discussion_question_validator.classify_question has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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.
smoke_scripts.main (cognitive 20) scripts/smoke_scripts.py:97— smoke_scripts.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts), boolean chains 1, 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.
sync-gemini-skills.create_symlinks (cognitive 20) scripts/sync-gemini-skills.py:187— sync-gemini-skills.create_symlinks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (2 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.
bottleneck_detector.detect (cognitive 19) business-operations/skills/process-mapper/scripts/bottleneck_detector.py:81— bottleneck_detector.detect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), boolean chains 1, ternaries 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.
decision_matrix_scorer.sensitivity_analysis (cognitive 19) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:70— decision_matrix_scorer.sensitivity_analysis has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 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.
unit_economics_analyzer.analyze_cohort (cognitive 19) c-level-advisor/skills/cfo-advisor/scripts/unit_economics_analyzer.py:98— unit_economics_analyzer.analyze_cohort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 6, boolean chains 4 (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.
marketing_budget_modeler.print_recommendations (cognitive 19) c-level-advisor/skills/cmo-advisor/scripts/marketing_budget_modeler.py:355— marketing_budget_modeler.print_recommendations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, loops 3 (6 pts), boolean chains 5 (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.
okr_tracker._generate_recommendations (cognitive 19) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:594— okr_tracker._generate_recommendations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts), boolean chains 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.
portfolio_analyzer.render_report (cognitive 19) c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:416— portfolio_analyzer.render_report has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 3 (5 pts), loops 4 (5 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.
inspect-assets.analyse_image (cognitive 19) engineering-team/skills/epic-design/scripts/inspect-assets.py:24— inspect-assets.analyse_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 3 (4 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, 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.
project_architect.print_human_report (cognitive 19) engineering-team/skills/senior-architect/scripts/project_architect.py:591— project_architect.print_human_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 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.
TypeDetector.detect_type (cognitive 19) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:156— TypeDetector.detect_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (5 pts), loops 2, boolean chains 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.
threat_signal_analyzer.hunt_mode (cognitive 19) engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:84— threat_signal_analyzer.hunt_mode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 6 (8 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.
loop_controller.cmd_record (cognitive 19) engineering/agent-harness/skills/agent-harness/scripts/loop_controller.py:140— loop_controller.cmd_record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), 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.
token_budget_estimator.audit_skill_dir (cognitive 19) engineering/book-to-skill/skills/book-to-skill/scripts/token_budget_estimator.py:111— token_budget_estimator.audit_skill_dir has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (6 pts), loops 2, boolean chains 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.
collect_sessions.sample_and_write (cognitive 19) engineering/skill-doctor/skills/skill-doctor/scripts/collect_sessions.py:589— collect_sessions.sample_and_write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (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.
AgentEvaluator.identify_bottlenecks (cognitive 19) engineering/skills/agent-designer/agent_evaluator.py:473— AgentEvaluator.identify_bottlenecks has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 5 (8 pts), loops 2 (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.
api_linter.main (cognitive 19) engineering/skills/api-design-reviewer/scripts/api_linter.py:867— api_linter.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 4 (7 pts), ternaries 1 (nesting depth added 4). 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.
pipeline_generator.main (cognitive 19) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:288— pipeline_generator.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (6 pts), boolean chains 2 (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.
HiringCalibrator._analyze_trends_over_time (cognitive 19) engineering/skills/interview-system-designer/hiring_calibrator.py:604— HiringCalibrator._analyze_trends_over_time has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 6 (8 pts), loops 2 (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, 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.
audit_log_analyzer.print_human (cognitive 19) engineering/skills/secrets-vault-manager/scripts/audit_log_analyzer.py:235— audit_log_analyzer.print_human has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (8 pts), loops 3 (6 pts), if/else 4, 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.
QualityScorer._score_usage_clarity (cognitive 19) engineering/skills/skill-tester/scripts/quality_scorer.py:875— QualityScorer._score_usage_clarity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (5 pts), boolean chains 2, loops 1 (2 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.
Analysis._warn_tax_rate_anomalies (cognitive 19) finance/skills/stock-analysis/scripts/ratios.py:2158— Analysis._warn_tax_rate_anomalies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, 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.
verify_data.classify_period (cognitive 19) finance/skills/stock-analysis/scripts/verify_data.py:530— verify_data.classify_period has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 2 (4 pts) (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.
review_html_renderer.main (cognitive 19) markdown-html/skills/md-review/scripts/review_html_renderer.py:538— review_html_renderer.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, ternaries 2 (4 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, 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.
ad_copy_validator.validate_meta_feed (cognitive 19) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:212— ad_copy_validator.validate_meta_feed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (8 pts), loops 1 (2 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. This shape REPEATS in the file: one other method here (ad_copy_validator.validate_linkedin) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ad_copy_validator.validate_linkedin (cognitive 19) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:248— ad_copy_validator.validate_linkedin has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (8 pts), loops 1 (2 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. This shape REPEATS in the file: one other method here (ad_copy_validator.validate_meta_feed) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ad_copy_validator.main (cognitive 19) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:418— ad_copy_validator.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 3 (6 pts), error handling 2 (5 pts), loops 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.
citation_tracker.render_human (cognitive 19) marketing-skill/skills/aeo/scripts/citation_tracker.py:175— citation_tracker.render_human has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 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.
email_sequence_analyzer.print_report (cognitive 19) marketing-skill/skills/cold-email/scripts/email_sequence_analyzer.py:316— email_sequence_analyzer.print_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts), ternaries 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.
humanizer_scorer.print_report (cognitive 19) marketing-skill/skills/content-humanizer/scripts/humanizer_scorer.py:360— humanizer_scorer.print_report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, loops 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.
competitor_analyzer.analyze_competitors (cognitive 19) marketing-skill/skills/x-twitter-growth/scripts/competitor_analyzer.py:53— competitor_analyzer.analyze_competitors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, boolean chains 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.
growth_tracker.main (cognitive 19) marketing-skill/skills/x-twitter-growth/scripts/growth_tracker.py:185— growth_tracker.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 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.
user_story_generator.main (cognitive 19) product-team/agile-product-owner/skills/agile-product-owner/scripts/user_story_generator.py:328— user_story_generator.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (9 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.
setup._prompt_choice (cognitive 19) productivity/handoff/skills/handoff/scripts/setup.py:66— setup._prompt_choice has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 2, ternaries 1 (2 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.
permission_audit_tool.check_over_permissioned_groups (cognitive 19) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:62— permission_audit_tool.check_over_permissioned_groups has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (5 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.
ManagementReviewTracker.assess_metrics (cognitive 19) ra-qm-team/skills/quality-manager-qmr/scripts/management_review_tracker.py:201— ManagementReviewTracker.assess_metrics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (6 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.
regulatory_pathway_analyzer.format_analysis_text (cognitive 19) ra-qm-team/skills/regulatory-affairs-head/scripts/regulatory_pathway_analyzer.py:385— regulatory_pathway_analyzer.format_analysis_text has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (11 pts), ternaries 6, boolean chains 1, if/else 1 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
risk_matrix_calculator.main (cognitive 19) ra-qm-team/skills/risk-management-specialist/scripts/risk_matrix_calculator.py:340— risk_matrix_calculator.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (19 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.
onboard.main (cognitive 19) research-ops/skills/product-research/scripts/onboard.py:74— onboard.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 1 (3 pts), loops 1 (2 pts), ternaries 1 (2 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.
audit_skills.main (cognitive 19) scripts/audit_skills.py:41— audit_skills.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (8 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.
sync-vibe-skills.sync_skill (cognitive 19) scripts/sync-vibe-skills.py:184— sync-vibe-skills.sync_skill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 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.
rfp_response_analyzer.determine_bid_recommendation (cognitive 18) business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:207— rfp_response_analyzer.determine_bid_recommendation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 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.
capacity_modeler.model_capacity (cognitive 18) business-operations/skills/capacity-planner/scripts/capacity_modeler.py:159— capacity_modeler.model_capacity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (5 pts), loops 2, boolean chains 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.
runbook_validator._parse_markdown (cognitive 18) business-operations/skills/knowledge-ops/scripts/runbook_validator.py:262— runbook_validator._parse_markdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1, 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.
process_documenter.render_markdown (cognitive 18) business-operations/skills/process-mapper/scripts/process_documenter.py:112— process_documenter.render_markdown has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (6 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.
unit_economics_analyzer.export_csv_results (cognitive 18) c-level-advisor/skills/cfo-advisor/scripts/unit_economics_analyzer.py:337— unit_economics_analyzer.export_csv_results has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (16 pts), loops 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.
ops_efficiency_analyzer.analyze_bottlenecks (cognitive 18) c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:207— ops_efficiency_analyzer.analyze_bottlenecks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), loops 3 (4 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.
discount_approval_router.route_discount (cognitive 18) commercial/skills/deal-desk/scripts/discount_approval_router.py:131— discount_approval_router.route_discount has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 3 (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.
a11y_scanner.scan_file (cognitive 18) engineering-team/a11y-audit/skills/a11y-audit/scripts/a11y_scanner.py:476— a11y_scanner.scan_file has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (8 pts), error handling 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
code_quality_checker.check_csharp_specific_smells (cognitive 18) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:417— code_quality_checker.check_csharp_specific_smells has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 7, boolean chains 2 (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.
incident_classifier.main (cognitive 18) engineering-team/skills/incident-commander/scripts/incident_classifier.py:804— incident_classifier.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 4 (5 pts), boolean chains 2 (nesting depth added 2). 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.
incident_triage.classify_incident (cognitive 18) engineering-team/skills/incident-response/scripts/incident_triage.py:349— incident_triage.classify_incident has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 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.
DependencyAnalyzer._detect_circular_dependencies (cognitive 18) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:331— DependencyAnalyzer._detect_circular_dependencies has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
dependency_analyzer.main (cognitive 18) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:520— dependency_analyzer.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (3 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.
DatasetSplitter._stratified_split (cognitive 18) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:943— DatasetSplitter._stratified_split has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (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.
DataProfiler._profile_column (cognitive 18) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:645— DataProfiler._profile_column has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (3 pts), loops 1 (2 pts), ternaries 2, boolean chains 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.
etl_performance_optimizer.cmd_optimize_partition (cognitive 18) engineering-team/skills/senior-data-engineer/scripts/etl_performance_optimizer.py:1445— etl_performance_optimizer.cmd_optimize_partition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (7 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.
ComplianceChecker._search_files (cognitive 18) engineering-team/skills/senior-secops/scripts/compliance_checker.py:948— ComplianceChecker._search_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts), 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.
harness_manifest_builder.main (cognitive 18) engineering/agent-harness/skills/agent-harness/scripts/harness_manifest_builder.py:199— harness_manifest_builder.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 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.
memory_core.mark_contradictions (cognitive 18) engineering/agent-memory/skills/agent-memory/scripts/memory_core.py:340— memory_core.mark_contradictions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (7 pts), boolean chains 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.
memory_extract._iter_messages (cognitive 18) engineering/agent-memory/skills/agent-memory/scripts/memory_extract.py:59— memory_extract._iter_messages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, error handling 2 (3 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.
missing_value_analyzer.classify_mechanism (cognitive 18) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:43— missing_value_analyzer.classify_mechanism has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 1 (2 pts), 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.
missing_value_analyzer.print_report (cognitive 18) engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:144— missing_value_analyzer.print_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 2 (6 pts), loops 3 (5 pts), boolean chains 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.
training_diagnostics.diagnose (cognitive 18) engineering/deep-learning-book/skills/deep-learning-book/scripts/training_diagnostics.py:70— training_diagnostics.diagnose has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (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.
dockerfile_analyzer.run_pattern_checks (cognitive 18) engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:254— dockerfile_analyzer.run_pattern_checks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 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.
graph_analyzer.build_graph (cognitive 18) engineering/llm-wiki/skills/llm-wiki/scripts/graph_analyzer.py:24— graph_analyzer.build_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 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.
APILinter._validate_parameters (cognitive 18) engineering/skills/api-design-reviewer/scripts/api_linter.py:544— APILinter._validate_parameters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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.
APILinter.generate_text_report (cognitive 18) engineering/skills/api-design-reviewer/scripts/api_linter.py:758— APILinter.generate_text_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 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.
APIScoringEngine._check_caching_headers (cognitive 18) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1298— APIScoringEngine._check_caching_headers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 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.
SchemaComparator._detect_renamed_tables (cognitive 18) REDACTED:192— SchemaComparator._detect_renamed_tables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 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.
hiring_calibrator.main (cognitive 18) engineering/skills/interview-system-designer/hiring_calibrator.py:1216— hiring_calibrator.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), error handling 4 (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.
monorepo_analyzer.main (cognitive 18) engineering/skills/monorepo-navigator/scripts/monorepo_analyzer.py:122— monorepo_analyzer.main has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5 (6 pts), loops 2 (4 pts), boolean chains 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.
skill_security_auditor.scan_file_code (cognitive 18) engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:609— skill_security_auditor.scan_file_code has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts), 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.
migration_generator.main (cognitive 18) engineering/skills/sql-database-assistant/scripts/migration_generator.py:362— migration_generator.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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.
tc_status.main (cognitive 18) engineering/skills/tc-tracker/scripts/tc_status.py:140— tc_status.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (8 pts), error handling 2 (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.
DebtDashboard._generate_strategic_recommendations (cognitive 18) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:665— DebtDashboard._generate_strategic_recommendations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (5 pts), boolean chains 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.
debt_dashboard.main (cognitive 18) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:907— debt_dashboard.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (6 pts), 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.
DebtScanner._detect_duplicates (cognitive 18) engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:278— DebtScanner._detect_duplicates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 pts), error handling 1 (2 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.
debt_scanner.main (cognitive 18) engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:628— debt_scanner.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), error handling 2 (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.
hypothesis_tester.main (cognitive 18) engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py:409— hypothesis_tester.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 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.
sample_size_calculator.main (cognitive 18) engineering/statistical-analyst/skills/statistical-analyst/scripts/sample_size_calculator.py:185— sample_size_calculator.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, ternaries 1 (2 pts), 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.
lint_report.check_template_sections (cognitive 18) finance/skills/stock-analysis/scripts/lint_report.py:751— lint_report.check_template_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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.
score.build_anchor_points (cognitive 18) finance/skills/stock-analysis/scripts/score.py:245— score.build_anchor_points has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), 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.
score.resolve_segment_weights (cognitive 18) finance/skills/stock-analysis/scripts/score.py:829— score.resolve_segment_weights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 1 (3 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.
valuation.compute_scenarios (cognitive 18) finance/skills/stock-analysis/scripts/valuation.py:545— valuation.compute_scenarios has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, ternaries 3 (4 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.
brand_palette_validator.validate (cognitive 18) marketing/landing/skills/landing/scripts/brand_palette_validator.py:127— brand_palette_validator.validate has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (7 pts), ternaries 5, boolean chains 3, if/else 3 (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.
positioning_brief.render_human (cognitive 18) marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:219— positioning_brief.render_human has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 6, ternaries 1 (3 pts), boolean chains 1 (nesting depth added 6). 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.
verdict_synthesizer.synthesize (cognitive 18) productivity/roast/skills/roast/scripts/verdict_synthesizer.py:60— verdict_synthesizer.synthesize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 4. 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.
weekly_review_gate.evaluate (cognitive 18) productivity/weekly-review/skills/weekly-review/scripts/weekly_review_gate.py:86— weekly_review_gate.evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 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.
retrospective_analyzer._calculate_improvement_velocity (cognitive 18) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:594— retrospective_analyzer._calculate_improvement_velocity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 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.
sprint_health_scorer.format_text_output (cognitive 18) project-management/skills/scrum-master/scripts/sprint_health_scorer.py:615— sprint_health_scorer.format_text_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, 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.
hipaa_risk_assessment.detect_phi_handling (cognitive 18) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:294— hipaa_risk_assessment.detect_phi_handling has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), error handling 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. This shape REPEATS in the file: one other method here (hipaa_risk_assessment.detect_security_vulnerabilities) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
hipaa_risk_assessment.detect_security_vulnerabilities (cognitive 18) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:328— hipaa_risk_assessment.detect_security_vulnerabilities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), error handling 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. This shape REPEATS in the file: one other method here (hipaa_risk_assessment.detect_phi_handling) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
hipaa_risk_assessment.print_text_report (cognitive 18) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:480— hipaa_risk_assessment.print_text_report has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5 (7 pts), ternaries 2 (3 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.
FMEAAnalyzer.analyze_entries (cognitive 18) ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py:130— FMEAAnalyzer.analyze_entries has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 6, loops 2 (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.
fmea_analyzer.format_fmea_text (cognitive 18) ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py:274— fmea_analyzer.format_fmea_text has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
citation_tracker.extract_rows (cognitive 18) research/pulse/skills/pulse/scripts/citation_tracker.py:140— citation_tracker.extract_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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.
derive_counters.derive (cognitive 18) scripts/derive_counters.py:79— derive_counters.derive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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.
generate-docs.extract_subtitle (cognitive 18) scripts/generate-docs.py:125— generate-docs.extract_subtitle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 3, 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.
competitive_matrix_builder.format_text (cognitive 17) business-growth/skills/sales-engineer/scripts/competitive_matrix_builder.py:369— competitive_matrix_builder.format_text has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), ternaries 3 (6 pts), if/else 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.
rfp_response_analyzer.generate_gap_analysis (cognitive 17) business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:114— rfp_response_analyzer.generate_gap_analysis has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (6 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.
RunwayCalculator.run (cognitive 17) c-level-advisor/skills/cfo-advisor/scripts/burn_rate_calculator.py:91— RunwayCalculator.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (6 pts), ternaries 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.
ops_efficiency_analyzer.generate_improvement_plan (cognitive 17) c-level-advisor/skills/coo-advisor/scripts/ops_efficiency_analyzer.py:476— ops_efficiency_analyzer.generate_improvement_plan has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (7 pts), if/else 5 (6 pts), boolean chains 2, ternaries 1 (2 pts) (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.
pmf_scorer.score_satisfaction (cognitive 17) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:273— pmf_scorer.score_satisfaction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 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.
framework_selector.render_text (cognitive 17) compliance-os/skills/compliance-os/scripts/framework_selector.py:230— framework_selector.render_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 1 (2 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.
pir_generator.main (cognitive 17) engineering-team/skills/incident-commander/scripts/pir_generator.py:1501— pir_generator.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, error handling 3 (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.
DependencyAnalyzer._parse_cargo (cognitive 17) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:228— DependencyAnalyzer._parse_cargo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, error handling 1, 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.
APIScaffolder.generate_types (cognitive 17) engineering-team/skills/senior-backend/scripts/api_scaffolder.py:342— APIScaffolder.generate_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 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.
SchemaAnalyzer._check_data_types (cognitive 17) engineering-team/skills/senior-backend/scripts/database_migration_tool.py:390— SchemaAnalyzer._check_data_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, 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.
DatasetAnalyzer._analyze_voc (cognitive 17) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:422— DatasetAnalyzer._analyze_voc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), error handling 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.
vision_model_trainer.main (cognitive 17) engineering-team/skills/senior-computer-vision/scripts/vision_model_trainer.py:492— vision_model_trainer.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (4 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.
deployment_manager.cmd_deploy (cognitive 17) engineering-team/skills/senior-devops/scripts/deployment_manager.py:91— deployment_manager.cmd_deploy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), boolean chains 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.
agent_orchestrator.generate_ascii_diagram (cognitive 17) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:245— agent_orchestrator.generate_ascii_diagram has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 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.
prompt_optimizer.extract_sections (cognitive 17) engineering-team/skills/senior-prompt-engineer/scripts/prompt_optimizer.py:163— prompt_optimizer.extract_sections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 1 (4 pts), loops 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.
prompt_optimizer.format_report (cognitive 17) engineering-team/skills/senior-prompt-engineer/scripts/prompt_optimizer.py:362— prompt_optimizer.format_report has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 3 (6 pts), ternaries 4 (nesting depth added 4). 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.
rag_evaluator.evaluate_answer_faithfulness (cognitive 17) engineering-team/skills/senior-prompt-engineer/scripts/rag_evaluator.py:206— rag_evaluator.evaluate_answer_faithfulness has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (4 pts), 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.
FormatDetector._parse_yaml (cognitive 17) engineering-team/skills/tech-stack-evaluator/scripts/format_detector.py:129— FormatDetector._parse_yaml has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 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.
loop_controller.cmd_verify (cognitive 17) engineering/agent-harness/skills/agent-harness/scripts/loop_controller.py:204— loop_controller.cmd_verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 1, ternaries 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, 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.
dry_run.check_frontmatter (cognitive 17) engineering/agenthub/skills/agenthub/scripts/dry_run.py:118— dry_run.check_frontmatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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.
session_manager.cleanup_session (cognitive 17) engineering/agenthub/skills/agenthub/scripts/session_manager.py:183— session_manager.cleanup_session has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). 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.
setup_experiment.list_evaluators (cognitive 17) engineering/autoresearch-agent/skills/autoresearch-agent/scripts/setup_experiment.py:225— setup_experiment.list_evaluators has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 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.
book_skill_validator.scalar_value (cognitive 17) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:241— book_skill_validator.scalar_value 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.
values_validator.generate_report (cognitive 17) REDACTED:331— values_validator.generate_report has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), 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.
human_gate.cmd_close (cognitive 17) engineering/human-gate/skills/human-gate/scripts/human_gate.py:431— human_gate.cmd_close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 4). 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.
assumption_linter.lint_text (cognitive 17) engineering/karpathy-coder/skills/karpathy-coder/scripts/assumption_linter.py:65— assumption_linter.lint_text has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
update_index.render_index (cognitive 17) engineering/llm-wiki/skills/llm-wiki/scripts/update_index.py:104— update_index.render_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (6 pts), loops 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.
render_report.main (cognitive 17) engineering/skill-doctor/skills/skill-doctor/scripts/render_report.py:214— render_report.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), error handling 2 (3 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.
APILinter._validate_paths_section (cognitive 17) engineering/skills/api-design-reviewer/scripts/api_linter.py:236— APILinter._validate_paths_section has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (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.
APIScoringEngine._check_url_structure_consistency (cognitive 17) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:401— APIScoringEngine._check_url_structure_consistency has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, boolean chains 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.
APIScoringEngine._check_http_method_consistency (cognitive 17) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:453— APIScoringEngine._check_http_method_consistency has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 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.
SchemaComparator._compare_constraints (cognitive 17) REDACTED:312— SchemaComparator._compare_constraints has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (8 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
LicenseChecker.generate_report (cognitive 17) engineering/skills/dependency-auditor/scripts/license_checker.py:859— LicenseChecker.generate_report has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
HiringCalibrator._generate_recommendations (cognitive 17) engineering/skills/interview-system-designer/hiring_calibrator.py:870— HiringCalibrator._generate_recommendations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, ternaries 1 (2 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.
loop_designer.format_human_readable (cognitive 17) engineering/skills/interview-system-designer/loop_designer.py:737— loop_designer.format_human_readable has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 3 (5 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SchemaCompatibilityChecker._build_compatibility_report (cognitive 17) engineering/skills/migration-architect/scripts/compatibility_checker.py:667— SchemaCompatibilityChecker._build_compatibility_report has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 8. 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.
compatibility_checker.main (cognitive 17) engineering/skills/migration-architect/scripts/compatibility_checker.py:813— compatibility_checker.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 3, ternaries 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, 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.
migration_planner.main (cognitive 17) engineering/skills/migration-architect/scripts/migration_planner.py:593— migration_planner.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3, ternaries 1 (2 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.
rotation_planner.print_human (cognitive 17) engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:181— rotation_planner.print_human has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4 (6 pts), ternaries 1 (2 pts), boolean chains 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.
QualityReportFormatter.format_human_readable (cognitive 17) engineering/skills/skill-tester/scripts/quality_scorer.py:1055— QualityReportFormatter.format_human_readable has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), ternaries 2 (6 pts), if/else 3 (4 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.
tc_validator.main (cognitive 17) engineering/skills/tc-tracker/scripts/tc_validator.py:302— tc_validator.main has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 3, loops 1 (2 pts), 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.
hypothesis_tester.verdict (cognitive 17) engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py:339— hypothesis_tester.verdict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (6 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, 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.
validate_workflow.check_meta (cognitive 17) engineering/workflow-builder/skills/workflow-builder/scripts/validate_workflow.py:87— validate_workflow.check_meta has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 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.
workflow_intake.classify (cognitive 17) engineering/workflow-builder/skills/workflow-builder/scripts/workflow_intake.py:40— workflow_intake.classify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (4 pts), boolean chains 2 (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.
skill_review_checklist_runner.extract_frontmatter_description (cognitive 17) engineering/write-a-skill/skills/write-a-skill/scripts/skill_review_checklist_runner.py:46— skill_review_checklist_runner.extract_frontmatter_description has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 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.
lint_report.render_text (cognitive 17) finance/skills/stock-analysis/scripts/lint_report.py:988— lint_report.render_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), ternaries 1 (3 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.
Analysis.section_incremental (cognitive 17) finance/skills/stock-analysis/scripts/ratios.py:1222— Analysis.section_incremental has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (4 pts) (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.
brand_palette_validator.derive_palette (cognitive 17) markdown-html/skills/design-system/scripts/brand_palette_validator.py:121— brand_palette_validator.derive_palette has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 7 (8 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, 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.
roas_calculator.main (cognitive 17) marketing-skill/skills/paid-ads/scripts/roas_calculator.py:208— roas_calculator.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 1 (3 pts), loops 2 (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, 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.
prompt_tester.load_payload (cognitive 17) marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_tester.py:66— prompt_tester.load_payload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 5). 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.
prompt_tester.main (cognitive 17) marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_tester.py:171— prompt_tester.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 4 (6 pts), loops 2 (3 pts), boolean chains 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.
social_calendar_generator.pretty_print (cognitive 17) marketing-skill/skills/social-media-manager/scripts/social_calendar_generator.py:290— social_calendar_generator.pretty_print has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 2 (5 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
repurpose_splitter.split_units (cognitive 17) marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:83— repurpose_splitter.split_units has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 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.
outreach_volume_guard.guard (cognitive 17) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_volume_guard.py:40— outreach_volume_guard.guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 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.
linkedin_goal_router.main (cognitive 17) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:113— linkedin_goal_router.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 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.
metrics_calculator.cohort (cognitive 17) product-team/skills/product-analytics/scripts/metrics_calculator.py:56— metrics_calculator.cohort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (7 pts), ternaries 1 (3 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.
discovery_cadence_tracker.main (cognitive 17) product-team/skills/product-skills/scripts/discovery_cadence_tracker.py:135— discovery_cadence_tracker.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 3 (4 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). 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.
kb_reader.read_kb (cognitive 17) productivity/email/skills/inbox-triage/scripts/kb_reader.py:179— kb_reader.read_kb has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, 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.
session_end._latest_mtime (cognitive 17) productivity/handoff/hooks/session_end.py:62— session_end._latest_mtime has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (5 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.
handoff_self_check.main (cognitive 17) productivity/handoff/skills/handoff/scripts/handoff_self_check.py:290— handoff_self_check.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (5 pts), boolean chains 1, error handling 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, 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.
CAPATracker._generate_recommendations (cognitive 17) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:190— CAPATracker._generate_recommendations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 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.
capa_tracker.main (cognitive 17) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:472— capa_tracker.main has cognitive complexity 17 (threshold 15). Drivers by points: error handling 3 (9 pts), if/else 6, loops 1 (2 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.
gdpr_compliance_checker.generate_recommendations (cognitive 17) ra-qm-team/skills/gdpr-dsgvo-expert/scripts/gdpr_compliance_checker.py:296— gdpr_compliance_checker.generate_recommendations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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.
sync-hermes-skills.sync_skill (cognitive 17) scripts/sync-hermes-skills.py:150— sync-hermes-skills.sync_skill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 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.
generate_reading_list.buildAuditLogSection (cognitive 17) research/syllabus/skills/syllabus/scripts/generate_reading_list.js:263— generate_reading_list.buildAuditLogSection has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4, loops 2 (4 pts) (nesting depth added 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.
change_announcement_builder.validate_tone (cognitive 16) business-operations/skills/internal-comms/scripts/change_announcement_builder.py:120— change_announcement_builder.validate_tone has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 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.
hiring_plan_modeler.assess_risks (cognitive 16) c-level-advisor/skills/chro-advisor/scripts/hiring_plan_modeler.py:175— hiring_plan_modeler.assess_risks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (3 pts), boolean chains 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.
portfolio_analyzer.investment_posture (cognitive 16) c-level-advisor/skills/cpo-advisor/scripts/portfolio_analyzer.py:132— portfolio_analyzer.investment_posture has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 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.
partner_tier_classifier.classify (cognitive 16) commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:346— partner_tier_classifier.classify has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4, boolean chains 3, 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.
partner_tier_classifier._render_human (cognitive 16) commercial/skills/partnerships-architect/scripts/partner_tier_classifier.py:453— partner_tier_classifier._render_human has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
code_quality_checker.analyze_directory (cognitive 16) engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:877— code_quality_checker.analyze_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), boolean chains 1, ternaries 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.
dependency_analyzer.print_human_report (cognitive 16) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:470— dependency_analyzer.print_human_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 4 (8 pts) (nesting depth added 5). 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.
backend_decision_engine.score_profile (cognitive 16) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:109— backend_decision_engine.score_profile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 2). 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.
DatasetAnalyzer._analyze_yolo (cognitive 16) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:362— DatasetAnalyzer._analyze_yolo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), error handling 1 (2 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.
GreatExpectationsGenerator._generate_column_expectations (cognitive 16) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:753— GreatExpectationsGenerator._generate_column_expectations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 1 (2 pts), boolean chains 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.
pipeline_generator.main (cognitive 16) engineering-team/skills/senior-devops/scripts/pipeline_generator.py:174— pipeline_generator.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (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.
bundle_analyzer.check_nextjs_config (cognitive 16) engineering-team/skills/senior-frontend/scripts/bundle_analyzer.py:180— bundle_analyzer.check_nextjs_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 1 (3 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.
frontend_scaffolder.main (cognitive 16) engineering-team/skills/senior-frontend/scripts/frontend_scaffolder.py:919— frontend_scaffolder.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 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.
VulnerabilityAssessor.scan_go (cognitive 16) engineering-team/skills/senior-secops/scripts/vulnerability_assessor.py:343— VulnerabilityAssessor.scan_go has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, error handling 1, loops 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.
threat_modeler.format_threat_report (cognitive 16) engineering-team/skills/senior-security/scripts/threat_modeler.py:419— threat_modeler.format_threat_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (8 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.
CoverageAnalyzer._parse_xml (cognitive 16) engineering-team/skills/tdd-guide/scripts/coverage_analyzer.py:153— CoverageAnalyzer._parse_xml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), error handling 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.
CoverageAnalyzer.calculate_summary (cognitive 16) engineering-team/skills/tdd-guide/scripts/coverage_analyzer.py:194— CoverageAnalyzer.calculate_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 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.
FrameworkAdapter.detect_framework (cognitive 16) engineering-team/skills/tdd-guide/scripts/framework_adapter.py:390— FrameworkAdapter.detect_framework has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. 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.
book_skill_validator.check_budgets (cognitive 16) engineering/book-to-skill/skills/book-to-skill/scripts/book_skill_validator.py:408— book_skill_validator.check_budgets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (6 pts), loops 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.
dependencies.offer_dependency_install (cognitive 16) engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/dependencies.py:136— dependencies.offer_dependency_install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), 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, 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.
forgetting_policy_linter.lint (cognitive 16) engineering/memory-engineering/skills/memory-engineering/scripts/forgetting_policy_linter.py:221— forgetting_policy_linter.lint has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 1 (2 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.
APIScoringEngine._check_sensitive_data_handling (cognitive 16) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:968— APIScoringEngine._check_sensitive_data_handling has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 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.
anti_detection_checker.format_text_report (cognitive 16) engineering/skills/browser-automation/scripts/anti_detection_checker.py:392— anti_detection_checker.format_text_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), ternaries 1 (3 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.
form_automation_builder.build_form_script (cognitive 16) engineering/skills/browser-automation/scripts/form_automation_builder.py:95— form_automation_builder.build_form_script has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3, boolean chains 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.
worktree_cleanup.main (cognitive 16) engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:127— worktree_cleanup.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (5 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.
InterviewLoopDesigner._design_rounds (cognitive 16) engineering/skills/interview-system-designer/loop_designer.py:336— InterviewLoopDesigner._design_rounds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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.
QualityScorer._score_help_accessibility (cognitive 16) engineering/skills/skill-tester/scripts/quality_scorer.py:912— QualityScorer._score_help_accessibility has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (2 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.
ScriptTester._find_external_imports (cognitive 16) engineering/skills/skill-tester/scripts/script_tester.py:272— ScriptTester._find_external_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 3 (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.
SkillValidator._validate_frontmatter (cognitive 16) engineering/skills/skill-tester/scripts/skill_validator.py:263— SkillValidator._validate_frontmatter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 pts), loops 1 (2 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.
SkillValidator._validate_script_features (cognitive 16) engineering/skills/skill-tester/scripts/skill_validator.py:462— SkillValidator._validate_script_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (8 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.
schema_explorer.generate_md (cognitive 16) engineering/skills/sql-database-assistant/scripts/schema_explorer.py:197— schema_explorer.generate_md has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), ternaries 2 (3 pts), boolean chains 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.
PaymentProcessor.validate_credit_card (cognitive 16) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:251— PaymentProcessor.validate_credit_card has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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.
debt_prioritizer.main (cognitive 16) engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:801— debt_prioritizer.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (6 pts), 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.
html_renderer.main (cognitive 16) markdown-html/skills/md-document/scripts/html_renderer.py:569— html_renderer.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (6 pts), boolean chains 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.
interactivity_injector.main (cognitive 16) markdown-html/skills/md-document/scripts/interactivity_injector.py:231— interactivity_injector.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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.
ReviewAnalyzer.identify_issues (cognitive 16) marketing-skill/skills/app-store-optimization/scripts/review_analyzer.py:175— ReviewAnalyzer.identify_issues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 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.
email_sequence_analyzer.analyze_subject_line (cognitive 16) marketing-skill/skills/cold-email/scripts/email_sequence_analyzer.py:170— email_sequence_analyzer.analyze_subject_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (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.
email_sequence_analyzer.analyze_body (cognitive 16) marketing-skill/skills/cold-email/scripts/email_sequence_analyzer.py:224— email_sequence_analyzer.analyze_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3, ternaries 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.
content_scorer.score_structure (cognitive 16) marketing-skill/skills/content-production/scripts/content_scorer.py:199— content_scorer.score_structure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, ternaries 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.
readability_scorer.main (cognitive 16) marketing-skill/skills/copy-editing/scripts/readability_scorer.py:200— readability_scorer.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (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.
FormAnalyzer.handle_starttag (cognitive 16) marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:31— FormAnalyzer.handle_starttag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 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.
nap_checker.compare_nap (cognitive 16) marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:107— nap_checker.compare_nap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 1 (2 pts) (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.
CROParser.handle_starttag (cognitive 16) marketing-skill/skills/page-cro/scripts/conversion_audit.py:62— CROParser.handle_starttag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 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.
roas_calculator._recommendations (cognitive 16) marketing-skill/skills/paid-ads/scripts/roas_calculator.py:147— roas_calculator._recommendations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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.
post_performance_analyzer.analyse (cognitive 16) marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:111— post_performance_analyzer.analyse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (4 pts), boolean chains 2, loops 2 (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.
format_picker.pick (cognitive 16) marketing/linkedin/skills/linkedin-content/scripts/format_picker.py:133— format_picker.pick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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.
metrics_calculator.funnel (cognitive 16) product-team/skills/product-analytics/scripts/metrics_calculator.py:99— metrics_calculator.funnel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (4 pts), ternaries 2 (4 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.
InterviewAnalyzer._extract_key_quotes (cognitive 16) product-team/skills/product-manager-toolkit/scripts/customer_interview_analyzer.py:191— InterviewAnalyzer._extract_key_quotes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, 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.
okr_cascade_generator.main (cognitive 16) product-team/skills/product-strategist/scripts/okr_cascade_generator.py:470— okr_cascade_generator.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 2 (6 pts), loops 1 (2 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.
skill_recommender._collect_skills (cognitive 16) productivity/handoff/skills/handoff/scripts/skill_recommender.py:98— skill_recommender._collect_skills has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 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.
weekly_review_gate.render_human (cognitive 16) productivity/weekly-review/skills/weekly-review/scripts/weekly_review_gate.py:159— weekly_review_gate.render_human has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (5 pts), loops 3 (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.
risk_matrix_analyzer.build_risk_matrix (cognitive 16) project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:228— risk_matrix_analyzer.build_risk_matrix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 2). 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.
compliance_checker.check_compliance (cognitive 16) ra-qm-team/skills/information-security-manager-iso27001/scripts/compliance_checker.py:145— compliance_checker.check_compliance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 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.
QMSEffectivenessMonitor.detect_alerts (cognitive 16) ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:158— QMSEffectivenessMonitor.detect_alerts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 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.
QMSEffectivenessMonitor.analyze (cognitive 16) ra-qm-team/skills/quality-manager-qmr/scripts/quality_effectiveness_monitor.py:318— QMSEffectivenessMonitor.analyze has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2, 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.
derive_counters.canonical_walk (cognitive 16) scripts/derive_counters.py:59— derive_counters.canonical_walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), error handling 1 (2 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.
D20 · ADR Quality· No context/problem and no consequences/trade-offs sections for living documentation (updates in same PR, remove outdated info), despite informative title · ×1
No context/problem and no consequences/trade-offs sections for living documentation (updates in same PR, remove outdated info), despite informative title standards/documentation/documentation-standards.md— Add a Context section explaining why living docs are needed (code changes outpace documentation) and a Consequences section on risks like stale links or inconsistent examples
D4 · Code Duplication· Near-duplicate member family (42 members, 23 shared lines) · ×1
Near-duplicate member family (42 members, 23 shared lines) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:315— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:315-346 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:443-474 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:329-360 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:245-276 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:315-346 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:277-308 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:403-443 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:338-369 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:322-353 | c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:372-408 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:315-346 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:443-474 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:329-360 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:245-276 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:315-346 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:277-308 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:403-443 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:338-369 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:322-353 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:372-408 | c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:242-273 | c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:247-278 | c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:243-274 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:242-273 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:247-278 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:243-274 | compliance-os/skills/compliance-os/scripts/audit_simulator.py:363-392 | compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:397-426 | compliance-os/skills/compliance-os/scripts/evidence_pool_generator.py:321-350 | compliance-os/skills/compliance-os/scripts/framework_selector.py:281-310 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:240-269 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:305-334 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:276-305 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:224-253 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:229-258 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:218-247 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:240-269 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:305-334 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:276-305 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:224-253 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:229-258 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:218-247 — These 42 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 42 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 42 times.
D4 · Code Duplication· Near-duplicate member family (6 members, 39 shared lines) · ×1
Near-duplicate member family (6 members, 39 shared lines) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:867— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:867-910 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:697-740 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:533-576 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:767-810 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:799-842 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:651-694 — These 6 members are variants of one another: a block of 39 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 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 6 times.
D4 · Code Duplication· Near-duplicate member family (4 members, 16 shared lines) · ×1
Near-duplicate member family (4 members, 16 shared lines) marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:212— marketing/linkedin/skills/linkedin-engagement/scripts/outreach_message_builder.py:212-254 | marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:226-264 | marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:236-265 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:250-298 — These 4 members are variants of one another: a block of 16 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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· Near-duplicate member family (4 members, 15 shared lines) · ×1
Near-duplicate member family (4 members, 15 shared lines) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:236— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:236-272 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:185-220 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:236-272 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:185-220 — These 4 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them 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.
Near-duplicate member pair (68 shared lines) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:521— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:521-611 | engineering-team/skills/senior-architect/scripts/project_architect.py:648-745 — These two members are variants of one another: 68 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (64 shared lines) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:359— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:359-434 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:359-434 — These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (52 shared lines) engineering/skills/agent-designer/agent_evaluator.py:1115— engineering/skills/agent-designer/agent_evaluator.py:1115-1214 | engineering/skills/agent-designer/tool_schema_generator.py:853-974 — These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (48 shared lines) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:260— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:260-311 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:260-311 — These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (33 shared lines) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:908— engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:908-966 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:802-853 — These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (26 shared lines) engineering/skills/interview-system-designer/loop_designer.py:827— engineering/skills/interview-system-designer/loop_designer.py:827-904 | engineering/skills/interview-system-designer/question_bank_generator.py:971-1056 — These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (23 shared lines) ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:188— ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:188-214 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:188-214 — These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202-238 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202-238 — These two members are one piece of code written twice and then edited apart: 37 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 (35 corresponding lines) · ×1
Edited copy of a member (35 corresponding lines) engineering/skills/slo-architect/scripts/slo_designer.py:120— engineering/skills/slo-architect/scripts/slo_designer.py:120-154 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:120-154 — These two members are one piece of code written twice and then edited apart: 35 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 (27 corresponding lines) · ×1
Edited copy of a member (27 corresponding lines) engineering/skills/slo-architect/scripts/slo_designer.py:90— engineering/skills/slo-architect/scripts/slo_designer.py:90-116 | engineering/slo-architect/skills/slo-architect/scripts/slo_designer.py:90-116 — These two members are one piece of code written twice and then edited apart: 27 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 (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:112— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:112-135 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:112-135 — These two members are one piece of code written twice and then edited apart: 24 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) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:119— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:119-136 | engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.py:119-136 — 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 (14 corresponding lines) · ×1
Edited copy of a member (14 corresponding lines) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:140— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:140-153 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:140-153 — These two members are one piece of code written twice and then edited apart: 14 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 (8 corresponding lines) · ×1
Edited copy of a member (8 corresponding lines) engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:85— engineering/feature-flags-architect/skills/feature-flags-architect/scripts/rollout_planner.py:85-92 | engineering/skills/feature-flags-architect/scripts/rollout_planner.py:85-92 — These two members are one piece of code written twice and then edited apart: 8 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) marketing/landing/skills/landing/scripts/kebab_slug_generator.py:84— marketing/landing/skills/landing/scripts/kebab_slug_generator.py:84-93 | research/pulse/skills/pulse/scripts/topic_slug_generator.py:99-110 — 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 (49 corresponding lines) · ×1
Edited copy of a member (49 corresponding lines) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:243— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:243-299 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:271-342 — These two members are one piece of code written twice and then edited apart: 49 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· Members sharing a duplicated core (14 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (14 members, 50+ identical tokens) engineering-team/skills/senior-secops/scripts/compliance_checker.py:468— engineering-team/skills/senior-secops/scripts/compliance_checker.py:468-498 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:501-530 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:533-564 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:567-596 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:599-622 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:665-688 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:691-713 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:716-738 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:741-763 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:766-788 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:791-819 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:822-844 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:886-915 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:918-946 — These 14 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 14 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 14 times.
D4 · Code Duplication· Members sharing a duplicated core (9 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (9 members, 50+ identical tokens) engineering/skills/slo-architect/scripts/error_budget_calculator.py:127— engineering/skills/slo-architect/scripts/error_budget_calculator.py:127-151 | engineering/skills/slo-architect/scripts/slo_review.py:154-172 | engineering/slo-architect/skills/slo-architect/scripts/error_budget_calculator.py:127-151 | engineering/slo-architect/skills/slo-architect/scripts/slo_review.py:154-172 | marketing/linkedin/skills/linkedin-engagement/scripts/outreach_volume_guard.py:159-185 | marketing/linkedin/skills/linkedin-strategy/scripts/cadence_planner.py:222-249 | marketing/linkedin/skills/linkedin-strategy/scripts/newsletter_planner.py:205-236 | research/research/skills/research/scripts/classifier.py:167-184 | research/research/skills/research/scripts/fallback_decomposer.py:85-103 — These 9 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 9 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 9 times.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:69— engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:69-97 | engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py:69-97 | engineering-team/skills/senior-data-scientist/scripts/model_evaluation_suite.py:69-97 | engineering-team/skills/senior-ml-engineer/scripts/ml_monitoring_suite.py:69-97 | engineering-team/skills/senior-ml-engineer/scripts/model_deployment_pipeline.py:69-97 | engineering-team/skills/senior-ml-engineer/scripts/rag_system_builder.py:69-97 | REDACTED:867-922 | REDACTED:1118-1195 — These 8 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 8 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 8 times.
Duplicated block (250 lines × 2) c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:81— c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:81-330 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:81-330 — before extracting anything, compare `c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` and `c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 323 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (179 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:126— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:126-304 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:126-304 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (113 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:79— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:79-191 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:79-191 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (99 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:125— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:125-223 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:125-223 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 251 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (95 lines × 2) c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:96— c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:96-190 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:96-190 — before extracting anything, compare `c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` and `c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 188 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (86 lines × 2) ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:161— ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:161-246 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:161-246 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (80 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:116— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:116-195 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:116-195 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (78 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:166— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:166-243 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:166-243 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (74 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:173— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:173-246 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:173-246 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (70 lines × 2) scripts/sync-hermes-skills.py:59— scripts/sync-hermes-skills.py:59-128 | scripts/sync-vibe-skills.py:72-141 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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.
Duplicated block (66 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:56— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py:56-121 | c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py:56-121 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/okf_linter.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/okf_linter.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 147 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (65 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:126— c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:126-190 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:126-190 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (64 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:195— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:195-258 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:195-258 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (49–64 lines × 2) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:251— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:251-299 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:279-342 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (63 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:54— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:54-116 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:54-116 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (62 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:51— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:51-112 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:51-112 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (56 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:199— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:199-254 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:199-254 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (52–53 lines × 2) markdown-html/skills/md-document/scripts/html_renderer.py:413— markdown-html/skills/md-document/scripts/html_renderer.py:413-465 | markdown-html/skills/md-slides/scripts/deck_html_renderer.py:105-156 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (31–52 lines × 3) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:475— ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:475-505 | ra-qm-team/skills/quality-documentation-manager/scripts/document_validator.py:548-599 | ra-qm-team/skills/quality-manager-qmr/scripts/management_review_tracker.py:439-469 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:475` 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. 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. 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.
Duplicated block (46–51 lines × 3) engineering/skills/skill-tester/scripts/security_scorer.py:308— engineering/skills/skill-tester/scripts/security_scorer.py:308-358 | engineering/skills/skill-tester/scripts/security_scorer.py:369-414 | engineering/skills/skill-tester/scripts/security_scorer.py:425-472 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/skill-tester/scripts/security_scorer.py:308` 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. 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.
Duplicated block (50 lines × 2) product-team/skills/product-skills/scripts/product_goal_router.py:154— product-team/skills/product-skills/scripts/product_goal_router.py:154-203 | project-management/skills/pm-skills/scripts/pm_goal_router.py:126-175 — before extracting anything, compare `product-team/skills/product-skills/scripts/product_goal_router.py` and `project-management/skills/pm-skills/scripts/pm_goal_router.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (48 lines × 2) c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:308— c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:308-355 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:308-355 — before extracting anything, compare `c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` and `c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 314 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (46 lines × 2) c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:442— c-level-advisor/executive-mentor/skills/executive-mentor/scripts/decision_matrix_scorer.py:442-487 | c-level-advisor/executive-mentor/skills/executive-mentor/scripts/stakeholder_mapper.py:498-543 — 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.
Duplicated block (45 lines × 2) c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:158— c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:158-202 | c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py:158-202 — before extracting anything, compare `c-level-advisor/arquiteto-de-empresa/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` and `c-level-advisor/skills/arquiteto-de-empresa/scripts/scaffold_bundle.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (42 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:227— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:227-268 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:227-268 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 251 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (35–40 lines × 3) engineering/memory-engineering/skills/memory-engineering/scripts/forgetting_policy_linter.py:348— engineering/memory-engineering/skills/memory-engineering/scripts/forgetting_policy_linter.py:348-387 | engineering/memory-engineering/skills/memory-engineering/scripts/memory_architecture_picker.py:343-377 | engineering/memory-engineering/skills/memory-engineering/scripts/memory_cost_profiler.py:314-348 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/memory-engineering/skills/memory-engineering/scripts/forgetting_policy_linter.py:348` 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 (39 lines × 2) c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:148— c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:148-186 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:148-186 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (4–39 lines × 3) business-growth/skills/sales-engineer/scripts/poc_planner.py:629— business-growth/skills/sales-engineer/scripts/poc_planner.py:629-632 | engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:70-108 | engineering/skills/chaos-engineering/scripts/experiment_designer.py:70-108 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py` and `engineering/skills/chaos-engineering/scripts/experiment_designer.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (38 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:301— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:301-338 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:301-338 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (36–37 lines × 3) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:192— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:192-227 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:146-181 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:188-224 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:188` 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. 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. 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.
Duplicated block (32–37 lines × 2) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:25— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:25-61 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:28-59 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (33–36 lines × 5) engineering/skills/api-design-reviewer/scripts/api_scorecard.py:186— engineering/skills/api-design-reviewer/scripts/api_scorecard.py:186-221 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:564-597 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:824-856 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1000-1032 | engineering/skills/api-design-reviewer/scripts/api_scorecard.py:1264-1296 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (35–36 lines × 2) engineering-team/skills/senior-secops/scripts/compliance_checker.py:625— engineering-team/skills/senior-secops/scripts/compliance_checker.py:625-660 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:847-881 — 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 `engineering-team/skills/senior-secops/scripts/compliance_checker.py:625` 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. 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. 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.
Duplicated block (32–34 lines × 3) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:117— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:117-150 | engineering-team/skills/azure-cloud-architect/scripts/cost_optimizer.py:192-225 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:143-174 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (33 lines × 3) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:274— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:274-306 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:343-375 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:389-421 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:274` 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 (30–33 lines × 2) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1553— engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1553-1582 | engineering-team/skills/senior-data-engineer/scripts/etl_performance_optimizer.py:1593-1625 — 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. 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.
Duplicated block (31–32 lines × 2) engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:64— engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py:64-95 | engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py:62-92 — before extracting anything, compare `engineering-team/skills/aws-solution-architect/scripts/cost_optimizer.py` and `engineering-team/skills/gcp-cloud-architect/scripts/cost_optimizer.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 200 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (25–31 lines × 3) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:314— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:314-339 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:374-404 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:490-514 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (18–31 lines × 2) engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:1013— engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:1013-1043 | engineering/skills/dependency-auditor/scripts/license_checker.py:944-961 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:1013` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skills/dependency-auditor/scripts/license_checker.py:941` calls `join` and `engineering/skills/api-design-reviewer/scripts/breaking_change_detector.py:1009` 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.
Duplicated block (3–30 lines × 5) engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:89— engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:89-118 | engineering/skills/chaos-engineering/scripts/experiment_postmortem.py:89-118 | marketing-skill/skills/aeo/scripts/aeo_audit.py:299-301 | ra-qm-team/skills/soc2-compliance/scripts/evidence_tracker.py:165-170 | research/grants/skills/grants/scripts/citation_tracker.py:207-210 — before extracting anything, compare `engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` and `engineering/skills/chaos-engineering/scripts/experiment_postmortem.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. 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.
Duplicated block (26–29 lines × 3) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:109— engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:109-137 | engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:152-177 | engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:194-219 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/tech-debt-tracker/assets/sample_codebase/src/payment_processor.py:109` 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. 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.
Duplicated block (25–28 lines × 2) engineering/skills/observability-designer/scripts/dashboard_generator.py:1132— engineering/skills/observability-designer/scripts/dashboard_generator.py:1132-1159 | engineering/skills/observability-designer/scripts/slo_designer.py:600-624 — 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 `engineering/skills/observability-designer/scripts/dashboard_generator.py:1132` 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.
Duplicated block (21–28 lines × 2) finance/skills/stock-analysis/scripts/valuation.py:114— finance/skills/stock-analysis/scripts/valuation.py:114-134 | finance/skills/stock-analysis/scripts/verify_data.py:326-353 — 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 `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.
Duplicated block (27 lines × 4) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:196— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:196-222 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:263-289 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:332-358 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:378-404 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:196` 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 (26–27 lines × 2) engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1085— engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1085-1110 | engineering-team/skills/senior-computer-vision/scripts/dataset_pipeline_builder.py:1195-1221 — 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 (25–27 lines × 2) engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:229— engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:229-255 | engineering/skills/secrets-vault-manager/scripts/vault_config_generator.py:262-286 — 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 `engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:229` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/secrets-vault-manager/scripts/vault_config_generator.py:287` calls `add_argument` and `engineering/skills/secrets-vault-manager/scripts/rotation_planner.py:256` 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.
Duplicated block (16–27 lines × 2) scripts/sync-codex-skills.py:305— scripts/sync-codex-skills.py:305-331 | scripts/sync-gemini-skills.py:244-259 — 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 `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.
Duplicated block (23–26 lines × 6) engineering-team/skills/senior-secops/scripts/compliance_checker.py:501— engineering-team/skills/senior-secops/scripts/compliance_checker.py:501-524 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:533-558 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:567-590 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:791-813 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:886-909 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:918-940 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-secops/scripts/compliance_checker.py:501` 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. 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. 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.
Duplicated block (23–25 lines × 2) marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:218— marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:218-242 | marketing-skill/skills/ad-creative/scripts/ad_copy_validator.py:254-276 — 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 (20–24 lines × 2) engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:919— engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:919-942 | engineering-team/skills/senior-frontend/scripts/component_generator.py:258-277 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-frontend/scripts/component_generator.py:258` 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. 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.
Duplicated block (19–24 lines × 2) engineering/skills/agent-designer/agent_planner.py:868— engineering/skills/agent-designer/agent_planner.py:868-886 | engineering/skills/agent-designer/tool_schema_generator.py:884-907 — 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.
Duplicated block (9–24 lines × 2) ra-qm-team/skills/quality-manager-qms-iso13485/scripts/qms_audit_checklist.py:816— ra-qm-team/skills/quality-manager-qms-iso13485/scripts/qms_audit_checklist.py:816-839 | ra-qm-team/skills/risk-management-specialist/scripts/risk_matrix_calculator.py:372-380 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/skills/quality-manager-qms-iso13485/scripts/qms_audit_checklist.py:816` 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. 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.
Duplicated block (23–24 lines × 2) scripts/sync-hermes-skills.py:252— scripts/sync-hermes-skills.py:252-274 | scripts/sync-vibe-skills.py:302-325 — before extracting anything, compare `scripts/sync-hermes-skills.py` and `scripts/sync-vibe-skills.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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.
Duplicated block (6–23 lines × 3) engineering-team/skills/senior-frontend/scripts/component_generator.py:265— engineering-team/skills/senior-frontend/scripts/component_generator.py:265-287 | productivity/meetings/skills/meetings/scripts/meeting_cost_calculator.py:145-151 | scripts/check_model_freshness.py:176-181 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-frontend/scripts/component_generator.py:265` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/check_model_freshness.py:175` calls `add_argument` and `engineering-team/skills/senior-frontend/scripts/component_generator.py:265` 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.
Duplicated block (16–22 lines × 6) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:324— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:324-340 | engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:333-354 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:445-462 | REDACTED:370-388 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:384-405 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:500-515 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:443` calls `parse_yaml_simple`, `read_text`, `exists` and `engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:382` 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.
Duplicated block (15–22 lines × 3) engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:254— engineering-team/skills/senior-backend/scripts/backend_decision_engine.py:254-268 | engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:200-221 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:252-268 — before extracting anything, compare `engineering-team/skills/senior-backend/scripts/backend_decision_engine.py` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:252` 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.
Duplicated block (19–22 lines × 2) engineering/skills/agent-designer/agent_evaluator.py:1163— engineering/skills/agent-designer/agent_evaluator.py:1163-1184 | engineering/skills/agent-designer/tool_schema_generator.py:913-931 — 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. 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.
Duplicated block (21–22 lines × 2) productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:193— productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:193-213 | productivity/handoff/skills/handoff/scripts/setup.py:266-287 — 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 `productivity/handoff/skills/handoff/scripts/setup.py:266` 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 (21 lines × 10) c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:148— c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:148-168 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:170-190 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:192-212 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:215-235 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:237-257 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:259-279 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:306-326 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:328-348 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:374-394 | c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:444-464 — all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/ciso-advisor/scripts/compliance_tracker.py:148` 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 (21 lines × 6) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:867— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:867-887 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:697-717 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:533-553 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:767-787 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:799-819 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:651-671 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (5–21 lines × 5) engineering-team/skills/senior-frontend/scripts/component_generator.py:264— engineering-team/skills/senior-frontend/scripts/component_generator.py:264-284 | engineering-team/skills/senior-frontend/scripts/frontend_scaffolder.py:940-960 | markdown-html/skills/md-slides/scripts/deck_html_renderer.py:535-542 | productivity/meetings/skills/meetings/scripts/meeting_cost_calculator.py:146-151 | scripts/check_model_freshness.py:176-180 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-frontend/scripts/component_generator.py:264` 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. 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.
Duplicated block (19–21 lines × 5) markdown-html/skills/design-system/scripts/config_loader.py:121— markdown-html/skills/design-system/scripts/config_loader.py:121-141 | research-ops/skills/clinical-research/scripts/config_loader.py:101-119 | research-ops/skills/market-research/scripts/config_loader.py:92-110 | research-ops/skills/product-research/scripts/config_loader.py:92-110 | research-ops/skills/research-finance/scripts/config_loader.py:93-111 — before extracting anything, compare `markdown-html/skills/design-system/scripts/config_loader.py` and `research-ops/skills/clinical-research/scripts/config_loader.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (21 lines × 4) ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:473— ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:473-493 | ra-qm-team/skills/qms-audit-expert/scripts/audit_schedule_optimizer.py:356-376 | ra-qm-team/skills/quality-documentation-manager/scripts/document_validator.py:546-566 | ra-qm-team/skills/quality-manager-qmr/scripts/management_review_tracker.py:437-457 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `ra-qm-team/skills/capa-officer/scripts/capa_tracker.py:473` 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.
Duplicated block (16–21 lines × 3) c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:158— c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:158-178 | c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:183-203 | c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:243-258 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (20–21 lines × 2) engineering-team/skills/red-team/scripts/engagement_planner.py:320— engineering-team/skills/red-team/scripts/engagement_planner.py:320-339 | engineering/skills/skill-security-auditor/scripts/skill_security_auditor.py:1014-1034 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/red-team/scripts/engagement_planner.py:320` 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 (13–21 lines × 2) marketing/landing/skills/landing/scripts/kebab_slug_generator.py:36— marketing/landing/skills/landing/scripts/kebab_slug_generator.py:36-48 | research/pulse/skills/pulse/scripts/topic_slug_generator.py:36-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 6) engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:42— engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:42-61 | engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py:42-61 | engineering-team/skills/senior-data-scientist/scripts/model_evaluation_suite.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/ml_monitoring_suite.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/model_deployment_pipeline.py:42-61 | engineering-team/skills/senior-ml-engineer/scripts/rag_system_builder.py:42-61 — before extracting anything, compare `engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py` and `engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py` as WHOLE FILES: 90% 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. 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.
Duplicated block (20 lines × 3) engineering-team/skills/incident-commander/scripts/incident_classifier.py:889— engineering-team/skills/incident-commander/scripts/incident_classifier.py:889-908 | engineering-team/skills/incident-commander/scripts/pir_generator.py:1613-1632 | engineering-team/skills/incident-commander/scripts/timeline_reconstructor.py:982-1001 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/incident-commander/scripts/pir_generator.py:1613` 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 (4–19 lines × 8) engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:69— engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py:69-87 | engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py:69-87 | engineering-team/skills/senior-data-scientist/scripts/model_evaluation_suite.py:69-87 | engineering-team/skills/senior-ml-engineer/scripts/ml_monitoring_suite.py:69-87 | engineering-team/skills/senior-ml-engineer/scripts/model_deployment_pipeline.py:69-87 | engineering-team/skills/senior-ml-engineer/scripts/rag_system_builder.py:69-87 | REDACTED:867-870 | REDACTED:1118-1121 — before extracting anything, compare `engineering-team/skills/senior-data-scientist/scripts/experiment_designer.py` and `engineering-team/skills/senior-data-scientist/scripts/feature_engineering_pipeline.py` as WHOLE FILES: 90% 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. 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.
Duplicated block (16–19 lines × 5) business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:454— business-growth/skills/customer-success-manager/scripts/churn_risk_analyzer.py:454-469 | business-growth/skills/customer-success-manager/scripts/expansion_opportunity_scorer.py:381-396 | marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:298-316 | marketing-skill/skills/campaign-analytics/scripts/campaign_roi_calculator.py:414-432 | marketing-skill/skills/campaign-analytics/scripts/funnel_analyzer.py:251-269 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at `marketing-skill/skills/campaign-analytics/scripts/attribution_analyzer.py:298` 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 (15–19 lines × 3) engineering/skills/tc-tracker/scripts/tc_create.py:249— engineering/skills/tc-tracker/scripts/tc_create.py:249-264 | engineering/skills/tc-tracker/scripts/tc_init.py:164-182 | engineering/skills/tc-tracker/scripts/tc_update.py:338-352 — 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 all 3 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.
Duplicated block (15–19 lines × 2) business-operations/skills/capacity-planner/scripts/capacity_modeler.py:384— business-operations/skills/capacity-planner/scripts/capacity_modeler.py:384-402 | business-operations/skills/capacity-planner/scripts/hiring_sequencer.py:311-325 — 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 `business-operations/skills/capacity-planner/scripts/capacity_modeler.py:384` 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.
Duplicated block (18 lines × 6) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:893— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:893-910 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:723-740 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:559-576 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:793-810 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:825-842 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:677-694 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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.
Duplicated block (18 lines × 3) engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:939— engineering/skills/tech-debt-tracker/scripts/debt_dashboard.py:939-956 | engineering/skills/tech-debt-tracker/scripts/debt_prioritizer.py:826-843 | engineering/skills/tech-debt-tracker/scripts/debt_scanner.py:653-670 — 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 all 3 call sites, so a change lands once.
Duplicated block (16–18 lines × 3) marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:240— marketing/linkedin/skills/linkedin-profile/scripts/about_section_builder.py:240-256 | marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:243-260 | marketing/linkedin/skills/linkedin-strategy/scripts/positioning_brief.py:262-277 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-profile/scripts/profile_completeness_auditor.py:243` 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. 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.
Duplicated block (15–18 lines × 3) marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:131— marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:131-148 | product-team/skills/product-skills/scripts/product_goal_router.py:165-179 | project-management/skills/pm-skills/scripts/pm_goal_router.py:137-151 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:131` 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 (17 lines × 42) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:321— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:321-337 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:449-465 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:335-351 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:251-267 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:321-337 | c-level-advisor/chief-customer-officer-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:283-299 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:409-425 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:344-360 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:328-344 | c-level-advisor/general-counsel-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:378-394 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:321-337 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:449-465 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:335-351 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/cs_coverage_calculator.py:251-267 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/customer_segmentation_designer.py:321-337 | c-level-advisor/skills/chief-customer-officer-advisor/scripts/retention_decomposition_analyzer.py:283-299 | c-level-advisor/skills/chief-data-officer-advisor/scripts/ai_training_data_audit.py:409-425 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_asset_valuator.py:344-360 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:328-344 | c-level-advisor/skills/general-counsel-advisor/scripts/term_sheet_analyzer.py:378-394 | c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:248-264 | c-level-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:253-269 | c-level-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:249-265 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:248-264 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_hiring_funnel_calculator.py:253-269 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/eng_team_structure_designer.py:249-265 | compliance-os/skills/compliance-os/scripts/audit_simulator.py:369-385 | compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:403-419 | compliance-os/skills/compliance-os/scripts/evidence_pool_generator.py:327-343 | compliance-os/skills/compliance-os/scripts/framework_selector.py:287-303 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:246-262 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:311-327 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:282-298 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:230-246 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:235-251 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:224-240 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:246-262 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:311-327 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:282-298 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:230-246 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:235-251 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:224-240 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 42 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 42 times. 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.
Duplicated block (15–17 lines × 13) engineering-team/skills/senior-secops/scripts/compliance_checker.py:511— engineering-team/skills/senior-secops/scripts/compliance_checker.py:511-527 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:545-561 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:577-593 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:605-619 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:671-685 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:696-710 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:721-735 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:746-760 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:771-785 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:800-816 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:827-841 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:896-912 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:927-943 — all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-secops/scripts/compliance_checker.py:511` 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. 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.
Duplicated block (16–17 lines × 2) business-growth/skills/sales-engineer/scripts/poc_planner.py:582— business-growth/skills/sales-engineer/scripts/poc_planner.py:582-598 | business-growth/skills/sales-engineer/scripts/rfp_response_analyzer.py:418-433 — 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.
Duplicated block (11–17 lines × 2) finance/skills/stock-analysis/scripts/score.py:1264— finance/skills/stock-analysis/scripts/score.py:1264-1274 | finance/skills/stock-analysis/scripts/score.py:1398-1414 — 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 (16 lines × 14) engineering-team/skills/senior-secops/scripts/compliance_checker.py:483— engineering-team/skills/senior-secops/scripts/compliance_checker.py:483-498 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:515-530 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:549-564 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:581-596 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:607-622 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:673-688 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:698-713 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:723-738 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:748-763 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:773-788 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:804-819 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:829-844 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:900-915 | engineering-team/skills/senior-secops/scripts/compliance_checker.py:931-946 — all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (16 lines × 4) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:359— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:359-374 | engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:379-394 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:504-519 | REDACTED:411-426 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (14–16 lines × 2) engineering/skills/browser-automation/scripts/anti_detection_checker.py:247— engineering/skills/browser-automation/scripts/anti_detection_checker.py:247-262 | engineering/skills/browser-automation/scripts/anti_detection_checker.py:282-295 — 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 `engineering/skills/browser-automation/scripts/anti_detection_checker.py:247` 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 (15 lines × 5) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:768— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:768-782 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:438-452 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:636-650 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:647-661 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:517-531 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `result` to `RetroAnalysisResult` in one and `PortfolioHealthResult` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `project-management/skills/scrum-master/scripts/velocity_analyzer.py:455` calls `get` and `project-management/skills/scrum-master/scripts/retrospective_analyzer.py:784` 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.
Duplicated block (15 lines × 3) engineering/skills/dependency-auditor/scripts/dep_scanner.py:482— engineering/skills/dependency-auditor/scripts/dep_scanner.py:482-496 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:568-582 | engineering/skills/dependency-auditor/scripts/dep_scanner.py:624-638 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/dependency-auditor/scripts/dep_scanner.py:482` 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. 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.
Duplicated block (13–15 lines × 2) engineering/skills/agent-designer/agent_evaluator.py:1147— engineering/skills/agent-designer/agent_evaluator.py:1147-1161 | engineering/skills/agent-designer/tool_schema_generator.py:904-916 — 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.
Duplicated block (4–15 lines × 4) marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:210— marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:210-224 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:249-252 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:259-262 | marketing-skill/skills/app-store-optimization/scripts/aso_scorer.py:296-309 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (14 lines × 4) finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:394— finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:394-407 | finance/skills/financial-analyst/scripts/dcf_valuation.py:421-434 | finance/skills/financial-analyst/scripts/forecast_builder.py:485-498 | finance/skills/financial-analyst/scripts/ratio_calculator.py:414-427 — 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 all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:394` 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 (11–14 lines × 3) commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:193— commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:193-203 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:409-421 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:528-541 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:409` 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.
Duplicated block (14 lines × 3) engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1373— engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1373-1386 | engineering-team/skills/senior-data-engineer/scripts/data_quality_validator.py:1473-1486 | engineering-team/skills/senior-data-engineer/scripts/etl_performance_optimizer.py:1362-1375 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (13–14 lines × 2) engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:158— engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:158-171 | engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:245-257 — 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 `engineering-team/skills/senior-architect/scripts/dependency_analyzer.py:158` 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. 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.
Duplicated block (12–13 lines × 4) research-ops/skills/clinical-research/scripts/ar_evaluator.py:52— research-ops/skills/clinical-research/scripts/ar_evaluator.py:52-64 | research-ops/skills/market-research/scripts/ar_evaluator.py:47-58 | research-ops/skills/product-research/scripts/ar_evaluator.py:48-59 | research-ops/skills/research-finance/scripts/ar_evaluator.py:49-60 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `research-ops/skills/clinical-research/scripts/ar_evaluator.py:52` 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. 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.
Duplicated block (9–13 lines × 2) business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:475— business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:475-487 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:601-609 — 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 `business-growth/skills/revenue-operations/scripts/forecast_accuracy_tracker.py:475` 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. 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.
Duplicated block (11–13 lines × 2) engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:183— engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:183-193 | engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:226-238 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:226` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering-team/skills/senior-fullstack/scripts/fullstack_decision_engine.py:223` calls `abs` and `engineering-team/skills/senior-frontend/scripts/frontend_decision_engine.py:183` 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.
Duplicated block (10–12 lines × 4) commercial/skills/channel-economics/scripts/cost_to_serve_calculator.py:168— commercial/skills/channel-economics/scripts/cost_to_serve_calculator.py:168-177 | marketing-skill/skills/competitor-alternatives/scripts/comparison_matrix_builder.py:221-232 | marketing-skill/skills/form-cro/scripts/form_field_analyzer.py:208-218 | marketing-skill/skills/programmatic-seo/scripts/url_pattern_generator.py:135-145 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times.
Duplicated block (11–12 lines × 3) productivity/handoff/hooks/session_end.py:44— productivity/handoff/hooks/session_end.py:44-54 | productivity/handoff/hooks/session_start.py:47-58 | productivity/handoff/skills/handoff/scripts/handoff_template_generator.py:70-80 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Duplicated block (11 lines × 6) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:265— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:265-275 | c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:287-297 | c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:285-295 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_cost_economics.py:265-275 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:287-297 | c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:285-295 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (9–11 lines × 3) engineering/skills/agent-designer/agent_evaluator.py:1117— engineering/skills/agent-designer/agent_evaluator.py:1117-1125 | engineering/skills/agent-designer/tool_schema_generator.py:855-863 | engineering/skills/dependency-auditor/scripts/license_checker.py:961-971 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/dependency-auditor/scripts/license_checker.py:961` 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 (8–11 lines × 2) engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:174— engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:174-184 | engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:188-195 — 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 `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:174` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:186` calls `add_argument` and `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:174` 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.
Duplicated block (9–11 lines × 2) productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:157— productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:157-167 | research/grants/skills/grants/scripts/mechanism_matcher.py:175-183 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9–10 lines × 6) engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:49— engineering/skills/ci-cd-pipeline-builder/scripts/pipeline_generator.py:49-58 | engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:49-58 | engineering/skills/git-worktree-manager/scripts/worktree_cleanup.py:45-53 | engineering/skills/git-worktree-manager/scripts/worktree_manager.py:56-65 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_tester.py:70-79 | marketing-skill/skills/prompt-engineer-toolkit/scripts/prompt_versioner.py:77-86 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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.
Duplicated block (10 lines × 6) project-management/skills/scrum-master/scripts/retrospective_analyzer.py:839— project-management/skills/scrum-master/scripts/retrospective_analyzer.py:839-848 | project-management/skills/scrum-master/scripts/sprint_health_scorer.py:669-678 | project-management/skills/scrum-master/scripts/velocity_analyzer.py:505-514 | project-management/skills/senior-pm/scripts/project_health_dashboard.py:723-732 | project-management/skills/senior-pm/scripts/resource_capacity_planner.py:746-755 | project-management/skills/senior-pm/scripts/risk_matrix_analyzer.py:601-610 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `result` to `RetroAnalysisResult` in one and `HealthScoreResult` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `project-management/skills/senior-pm/scripts/resource_capacity_planner.py:761` calls `serialize_resource`, `hasattr` and `project-management/skills/scrum-master/scripts/retrospective_analyzer.py:853` 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.
Duplicated block (10 lines × 4) c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:228— c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:228-238 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:242-251 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:333-342 | c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:346-355 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/cpo-advisor/scripts/pmf_scorer.py:228` 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 (9–10 lines × 4) research/grants/skills/grants/scripts/mechanism_matcher.py:203— research/grants/skills/grants/scripts/mechanism_matcher.py:203-212 | research/notebooklm/skills/notebooklm/scripts/action_router.py:259-267 | research/notebooklm/skills/notebooklm/scripts/async_action_classifier.py:249-258 | research/notebooklm/skills/notebooklm/scripts/custom_prompt_template_generator.py:257-266 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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. 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.
Duplicated block (8–10 lines × 3) engineering/skills/dependency-auditor/scripts/dep_scanner.py:696— engineering/skills/dependency-auditor/scripts/dep_scanner.py:696-705 | engineering/skills/dependency-auditor/scripts/license_checker.py:877-884 | engineering/skills/dependency-auditor/scripts/upgrade_planner.py:891-898 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `engineering/skills/dependency-auditor/scripts/dep_scanner.py:696` 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. 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.
Duplicated block (4–10 lines × 6) engineering-team/skills/code-reviewer/scripts/review_report_generator.py:268— engineering-team/skills/code-reviewer/scripts/review_report_generator.py:268-271 | engineering-team/skills/incident-commander/scripts/pir_generator.py:1290-1293 | marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:189-192 | project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:393-401 | project-management/skills/confluence-expert/scripts/content_audit_analyzer.py:390-399 | project-management/skills/jira-expert/scripts/workflow_validator.py:354-363 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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.
Duplicated block (7–10 lines × 2) scripts/smoke_json_output.py:127— scripts/smoke_json_output.py:127-133 | scripts/smoke_scripts.py:80-89 — before extracting anything, compare `scripts/smoke_json_output.py` and `scripts/smoke_scripts.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/smoke_json_output.py:127` 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. 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.
Duplicated block (9 lines × 7) commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:129— commercial/skills/commercial-forecaster/scripts/funnel_confidence_scorer.py:129-137 | commercial/skills/pricing-strategist/scripts/wtp_analyzer.py:196-204 | engineering-team/skills/incident-commander/scripts/pir_generator.py:1324-1334 | engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:415-424 | engineering-team/skills/tdd-guide/scripts/tdd_workflow.py:381-392 | engineering/handoff/skills/handoff/scripts/handoff_template_generator.py:149-157 | engineering/skillopt-sleep/skillopt_sleep/experiments/report.py:102-110 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-architect/scripts/architecture_diagram_generator.py:415` 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. 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.
Duplicated block (8–9 lines × 3) ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:269— ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:269-277 | ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:299-306 | ra-qm-team/skills/fda-consultant-specialist/scripts/hipaa_risk_assessment.py:333-340 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. 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.
Duplicated block (4–9 lines × 3) engineering/write-a-skill/skills/write-a-skill/scripts/skill_description_validator.py:205— engineering/write-a-skill/skills/write-a-skill/scripts/skill_description_validator.py:205-213 | engineering/write-a-skill/skills/write-a-skill/scripts/skill_review_checklist_runner.py:226-229 | engineering/write-a-skill/skills/write-a-skill/scripts/skill_structure_validator.py:233-241 — 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 all 3 call sites, so a change lands once.
Duplicated block (6–9 lines × 2) scripts/derive_counters.py:291— scripts/derive_counters.py:291-296 | scripts/derive_counters.py:311-319 — 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. 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.
Duplicated block (7–8 lines × 7) marketing-skill/skills/aeo/scripts/citation_tracker.py:291— marketing-skill/skills/aeo/scripts/citation_tracker.py:291-298 | marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:118-125 | marketing/linkedin/skills/linkedin-skills/scripts/linkedin_policy_gate.py:291-298 | product-team/skills/product-skills/scripts/discovery_cadence_tracker.py:138-145 | product-team/skills/product-skills/scripts/product_goal_router.py:151-158 | project-management/skills/pm-skills/scripts/pm_goal_router.py:123-130 | research/research/skills/research/scripts/routing_transparency_logger.py:140-146 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `research/research/skills/research/scripts/routing_transparency_logger.py:139` calls `add_argument` and `marketing-skill/skills/aeo/scripts/citation_tracker.py:290` does not — after which the two agree again for 4 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.
Duplicated block (6–8 lines × 4) business-growth/skills/sales-engineer/scripts/poc_planner.py:600— business-growth/skills/sales-engineer/scripts/poc_planner.py:600-607 | marketing-skill/skills/local-seo-manager/scripts/nap_checker.py:247-253 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:247-252 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:247-252 — before extracting anything, compare `ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` and `ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py` as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (5–8 lines × 3) engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:168— engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:168-172 | engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:178-185 | engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:191-198 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:168` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:172` calls `add_argument` and `engineering-team/snowflake-development/skills/snowflake-development/scripts/snowflake_query_helper.py:185` 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.
Duplicated block (3–8 lines × 3) scripts/check_frontmatter.py:175— scripts/check_frontmatter.py:175-182 | scripts/check_model_freshness.py:172-179 | scripts/check_paths.py:177-179 — 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 all 3 call sites, so a change lands once. 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.
Duplicated block (7 lines × 18) c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202— c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202-208 | c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py:202-208 | compliance-os/skills/compliance-os/scripts/audit_simulator.py:318-324 | compliance-os/skills/compliance-os/scripts/cross_framework_mapper.py:356-362 | compliance-os/skills/compliance-os/scripts/evidence_pool_generator.py:282-288 | compliance-os/skills/compliance-os/scripts/framework_selector.py:231-237 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:202-208 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:273-279 | ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:236-242 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:185-191 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:180-186 | ra-qm-team/compliance-team-iso42001/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:188-194 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_act_obligation_tracker.py:202-208 | ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:273-279 | ra-qm-team/skills/eu-ai-act-specialist/scripts/conformity_assessment_planner.py:236-242 | ra-qm-team/skills/iso42001-specialist/scripts/ai_risk_register_builder.py:185-191 | ra-qm-team/skills/iso42001-specialist/scripts/aims_audit_scheduler.py:180-186 | ra-qm-team/skills/iso42001-specialist/scripts/aims_gap_analyzer.py:188-194 — before extracting anything, compare `c-level-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` and `c-level-advisor/vpe-advisor/skills/vpe-advisor/scripts/delivery_throughput_analyzer.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (3–7 lines × 6) business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:546— business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:546-552 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:558-564 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:567-573 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:576-582 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:585-591 | business-growth/skills/revenue-operations/scripts/gtm_efficiency_calculator.py:595-597 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6–7 lines × 5) marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:257— marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:257-262 | marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:116-122 | marketing/linkedin/skills/linkedin-skills/scripts/linkedin_policy_gate.py:289-295 | product-team/skills/product-skills/scripts/product_goal_router.py:150-155 | project-management/skills/pm-skills/scripts/pm_goal_router.py:121-127 — before extracting anything, compare `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py` and `product-team/skills/product-skills/scripts/product_goal_router.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:116` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `marketing/linkedin/skills/linkedin-profile/scripts/headline_scorer.py:263` calls `add_argument` and `marketing/linkedin/skills/linkedin-skills/scripts/linkedin_goal_router.py:123` 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.
Duplicated block (6–7 lines × 2) business-growth/skills/sales-engineer/scripts/poc_planner.py:699— business-growth/skills/sales-engineer/scripts/poc_planner.py:699-705 | research/litreview/skills/litreview/scripts/framework_recommender.py:163-168 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `research/litreview/skills/litreview/scripts/framework_recommender.py:169` calls `sum`, `values`, `join` and `business-growth/skills/sales-engineer/scripts/poc_planner.py:706` 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.
Duplicated block (2–7 lines × 3) c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:460— c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:460-461 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:492-497 | c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:511-517 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:511` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:492` calls `get` and `c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:460` 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.
Duplicated block (5–7 lines × 2) engineering-team/skills/incident-commander/scripts/pir_generator.py:654— engineering-team/skills/incident-commander/scripts/pir_generator.py:654-658 | product-team/skills/product-manager-toolkit/scripts/customer_interview_analyzer.py:284-290 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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. 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.
Duplicated block (3–7 lines × 5) engineering/skills/tc-tracker/scripts/tc_create.py:175— engineering/skills/tc-tracker/scripts/tc_create.py:175-178 | engineering/skills/tc-tracker/scripts/tc_init.py:125-128 | engineering/skills/tc-tracker/scripts/tc_status.py:155-161 | engineering/skills/tc-tracker/scripts/tc_status.py:181-187 | engineering/skills/tc-tracker/scripts/tc_update.py:173-175 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `engineering/skills/tc-tracker/scripts/tc_create.py:175` calls `except` and `engineering/skills/tc-tracker/scripts/tc_update.py:173` 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.
Duplicated block (6 lines × 8) productivity/email/skills/inbox-setup/scripts/voice_sample_analyzer.py:267— productivity/email/skills/inbox-setup/scripts/voice_sample_analyzer.py:267-272 | productivity/email/skills/inbox-triage/scripts/kb_reader.py:281-286 | productivity/reflect/skills/reflect/scripts/bias_pattern_detector.py:174-179 | productivity/reflect/skills/reflect/scripts/conversation_depth_analyzer.py:173-178 | research/dossier/skills/dossier/scripts/disconfirming_evidence_balance.py:183-188 | research/litreview/skills/litreview/scripts/cross_search_aggregator.py:212-217 | research/litreview/skills/litreview/scripts/framework_recommender.py:184-189 | research/patent/skills/patent/scripts/family_resolver.py:233-238 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 8 times.
Duplicated block (6 lines × 6) agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:54— agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:54-59 | agent-launcher/skills/run-without-you/scripts/deployment_builder.py:70-75 | agent-launcher/skills/run-without-you/scripts/next_directions_writer.py:84-89 | agent-launcher/skills/wrap-up/scripts/overview_page.py:91-96 | agent-launcher/skills/wrap-up/scripts/primitives_inventory.py:75-80 | agent-launcher/skills/wrap-up/scripts/upgrade_suggester.py:59-64 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:51` calls `add_argument` and `agent-launcher/skills/wrap-up/scripts/primitives_inventory.py:73` 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.
Duplicated block (4–6 lines × 7) engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:195— engineering/grill-with-docs/skills/grill-with-docs/scripts/adr_scanner.py:195-200 | engineering/grill-with-docs/skills/grill-with-docs/scripts/context_md_linter.py:235-238 | markdown-html/skills/design-system/scripts/brand_palette_validator.py:286-291 | marketing/landing/skills/landing/scripts/brand_palette_validator.py:222-227 | marketing/landing/skills/landing/scripts/html_validator.py:255-260 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:211-216 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:205-210 — before extracting anything, compare `markdown-html/skills/design-system/scripts/brand_palette_validator.py` and `marketing/landing/skills/landing/scripts/brand_palette_validator.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `result` to `Dict[str, Any]` in one and `dict[str, Any]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (4–6 lines × 5) ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:379— ra-qm-team/skills/soc2-compliance/scripts/gap_analyzer.py:379-386 | research/dossier/skills/dossier/scripts/citation_tracker.py:199-204 | research/dossier/skills/dossier/scripts/citation_tracker.py:210-213 | research/grants/skills/grants/scripts/citation_tracker.py:200-205 | research/litreview/skills/litreview/scripts/citation_tracker.py:165-170 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (4–6 lines × 4) marketing/landing/skills/landing/scripts/html_validator.py:269— marketing/landing/skills/landing/scripts/html_validator.py:269-274 | productivity/email/skills/inbox-setup/scripts/kb_validator.py:235-238 | productivity/email/skills/inbox-triage/scripts/draft_safety_validator.py:171-176 | productivity/reflect/skills/reflect/scripts/directional_recommendation_validator.py:219-224 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `marketing/landing/skills/landing/scripts/html_validator.py:268` calls `add_argument` and `productivity/email/skills/inbox-setup/scripts/kb_validator.py:235` 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.
Duplicated block (5–6 lines × 3) marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:134— marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:134-139 | marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:140-145 | marketing-skill/skills/churn-prevention/scripts/churn_impact_calculator.py:146-150 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (3–6 lines × 4) engineering/skills/interview-system-designer/hiring_calibrator.py:1130— engineering/skills/interview-system-designer/hiring_calibrator.py:1130-1132 | project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:383-388 | project-management/skills/jira-expert/scripts/workflow_validator.py:339-342 | project-management/skills/jira-expert/scripts/workflow_validator.py:345-351 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering/skills/interview-system-designer/hiring_calibrator.py:1135` calls `get` and `project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:390` 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.
Duplicated block (5 lines × 11) research-ops/skills/clinical-research/scripts/endpoint_selector.py:160— research-ops/skills/clinical-research/scripts/endpoint_selector.py:160-165 | research-ops/skills/clinical-research/scripts/sample_size_estimator.py:172-176 | research-ops/skills/market-research/scripts/market_sizer.py:139-144 | research-ops/skills/market-research/scripts/sample_size_planner.py:153-157 | research-ops/skills/market-research/scripts/segmentation_scorer.py:117-122 | research-ops/skills/product-research/scripts/insight_synthesizer.py:96-101 | research-ops/skills/product-research/scripts/saturation_planner.py:114-118 | research-ops/skills/product-research/scripts/study_designer.py:116-121 | research-ops/skills/research-finance/scripts/burn_runway_tracker.py:131-135 | research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:160-165 | research-ops/skills/research-finance/scripts/program_budget_planner.py:140-144 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 11 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 11 times. Read the line range as the matched WINDOW rather than a finished unit: at `research-ops/skills/clinical-research/scripts/endpoint_selector.py:160` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `research-ops/skills/research-finance/scripts/capex_vs_opex_router.py:157` calls `add_argument` and `research-ops/skills/clinical-research/scripts/endpoint_selector.py:158` 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.
Duplicated block (4–5 lines × 6) engineering/docker-development/skills/docker-development/scripts/compose_validator.py:342— engineering/docker-development/skills/docker-development/scripts/compose_validator.py:342-346 | engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:361-364 | engineering/helm-chart-builder/skills/helm-chart-builder/scripts/chart_analyzer.py:465-469 | REDACTED:391-395 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:411-415 | engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:516-520 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times.
Duplicated block (3–5 lines × 7) engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:255— engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:255-259 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:266-268 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:270-275 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:289-291 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:295-299 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:311-315 | engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:322-324 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:255` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:300` calls `join` and `engineering-team/skills/senior-prompt-engineer/scripts/agent_orchestrator.py:259` 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.
Duplicated block (4–5 lines × 3) agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:81— agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:81-84 | agent-launcher/skills/interview/scripts/interview_planner.py:190-194 | agent-launcher/skills/run-without-you/scripts/deployment_builder.py:127-131 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `agent-launcher/skills/grade-iterate/scripts/eval_scaffold.py:84` calls `Path`, `write_text` and `agent-launcher/skills/interview/scripts/interview_planner.py:194` does not — after which the two agree again for 5 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.
Duplicated block (2–5 lines × 3) finance/skills/saas-metrics-coach/scripts/quick_ratio_calculator.py:112— finance/skills/saas-metrics-coach/scripts/quick_ratio_calculator.py:112-116 | finance/skills/saas-metrics-coach/scripts/unit_economics_simulator.py:130-134 | finance/skills/saas-metrics-coach/scripts/unit_economics_simulator.py:137-138 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (39 lines × 4) project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:427— project-management/skills/atlassian-admin/scripts/permission_audit_tool.py:427-465 | project-management/skills/confluence-expert/scripts/content_audit_analyzer.py:415-453 | project-management/skills/confluence-expert/scripts/space_structure_generator.py:475-513 | project-management/skills/jira-expert/scripts/workflow_validator.py:382-420 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. 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.
Duplicated block (36 lines × 2) c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:262— c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:262-297 | c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:262-297 — before extracting anything, compare `c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` and `c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 356 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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.
Duplicated block (13 lines × 4) finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:31— finance/skills/financial-analyst/scripts/budget_variance_analyzer.py:31-43 | finance/skills/financial-analyst/scripts/dcf_valuation.py:34-46 | finance/skills/financial-analyst/scripts/forecast_builder.py:33-45 | finance/skills/financial-analyst/scripts/ratio_calculator.py:30-42 — 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 all 4 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.
Duplicated block (14 lines × 6) productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:63— productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:63-76 | research/dossier/skills/dossier/scripts/citation_tracker.py:69-99 | research/grants/skills/grants/scripts/citation_tracker.py:69-95 | research/litreview/skills/litreview/scripts/citation_tracker.py:73-87 | research/pulse/skills/pulse/scripts/citation_tracker.py:299-314 | research/syllabus/skills/syllabus/scripts/citation_tracker.py:61-82 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 6 times. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `research/grants/skills/grants/scripts/citation_tracker.py:64` calls `now_ts`, `now`, `timestamp` and `productivity/email/skills/inbox-setup/scripts/section_progress_tracker.py:59` 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.
Duplicated block (51 lines × 2) engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go:30— engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go:30-80 | engineering/skills/kubernetes-operator/assets/reconcile_skeleton.go:30-80 — before extracting anything, compare `engineering/kubernetes-operator/skills/kubernetes-operator/assets/reconcile_skeleton.go` and `engineering/skills/kubernetes-operator/assets/reconcile_skeleton.go` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (20–22 lines × 2) marketing-skill/skills/app-store-optimization/scripts/ab_test_planner.py:225— marketing-skill/skills/app-store-optimization/scripts/ab_test_planner.py:225-246 | marketing-skill/skills/app-store-optimization/scripts/ab_test_planner.py:282-301 — 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 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.
Fake-async — async method never awaits REDACTED:25— `HandleClick` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
Duplication concentrated across 2 sibling directories (5 clone groups) engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147— 5 duplicated blocks under engineering-team/playwright-pro/integrations/ have copies in at least two of the sibling directories browserstack-mcp, testrail-mcp — 3 of them are reported below, and 2 are 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 5 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 5 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 5 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.
Duplicated block (34 lines × 2 locations) engineering/workflow-builder/skills/workflow-builder/assets/templates/pipeline.js:3— engineering/workflow-builder/skills/workflow-builder/assets/templates/pipeline.js:3 · engineering/workflow-builder/skills/workflow-builder/expected_outputs/scaffold_pipeline.js:3 — the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
R10 · Code Duplication· Duplicated block with local edits (31 matched lines × 2 locations) · ×1
Duplicated block with local edits (31 matched lines × 2 locations) engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147— engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:147 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:182 — the two spans are one implementation copied and then locally edited — 325 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.
Duplicated block (25 lines × 2 locations) engineering-team/playwright-pro/integrations/browserstack-mcp/src/client.ts:22— engineering-team/playwright-pro/integrations/browserstack-mcp/src/client.ts:22 · engineering-team/playwright-pro/integrations/testrail-mcp/src/client.ts:26 — 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 with local edits (18 matched lines × 2 locations) · ×1
Duplicated block with local edits (18 matched lines × 2 locations) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:439— engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:439 · engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:830 — the two spans are one implementation copied and then locally edited — 142 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 (13 lines × 2 locations) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59 · engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:189 — 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.
Duplicated block (11 lines × 2 locations) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:250— engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:250 · engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:267 — 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 (7 lines × 2 locations) engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:136— engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:136 · engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:144 — 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.
Duplicated block (7 lines × 3 locations) research/syllabus/skills/syllabus/scripts/generate_reading_list.js:270— research/syllabus/skills/syllabus/scripts/generate_reading_list.js:270 · research/syllabus/skills/syllabus/scripts/generate_reading_list.js:277 · research/syllabus/skills/syllabus/scripts/generate_reading_list.js:284 — all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct — the members of a type, or the entries of an object or array literal — with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal's entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or — where the copies are a literal's entries rather than a type's members — one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared — a decorator and its options, an annotation, a registration table's keys — the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases.
Duplicated block (5 lines × 4 locations) engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:160— engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:160 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:205 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:216 · engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:228 — the 4 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.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 19, cognitive 19) · ×1
Complex function main (cyclomatic 19, cognitive 19) engineering/hivemind/scripts/oc-worker.mjs:109— main 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.
Complex function captureFullPage (cyclomatic 18, cognitive 31) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:221— captureFullPage has cyclomatic complexity 18 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.
Complex function renderUserDashboard (cyclomatic 18, cognitive 27) engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:59— renderUserDashboard has cyclomatic complexity 18 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.
Complex function modeUrl (cyclomatic 17, cognitive 30) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:524— modeUrl 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.
Complex function parseNdjson (cyclomatic 16, cognitive 22) engineering/hivemind/scripts/oc-worker.mjs:168— parseNdjson has cyclomatic complexity 16 and cognitive complexity 22; 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.
Complex function buildAuditLogSection (cyclomatic 16, cognitive 15) research/syllabus/skills/syllabus/scripts/generate_reading_list.js:263— buildAuditLogSection has cyclomatic complexity 16 and cognitive complexity 15; 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.
Complex function modeTarget (cyclomatic 15, cognitive 26) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:871— modeTarget has cyclomatic complexity 15 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.
Complex function (anonymous) (cyclomatic 15, cognitive 13) engineering-team/playwright-pro/integrations/browserstack-mcp/src/index.ts:112— (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; 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.
Complex function (anonymous) (cyclomatic 15, cognitive 11) engineering-team/playwright-pro/integrations/testrail-mcp/src/index.ts:170— (anonymous) has cyclomatic complexity 15 and cognitive complexity 11; 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.
Complex function captureViaProxy (cyclomatic 14, cognitive 26) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:646— captureViaProxy has cyclomatic complexity 14 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.
Complex function parseArgs (cyclomatic 14, cognitive 15) engineering/hivemind/scripts/oc-worker.mjs:39— parseArgs has cyclomatic complexity 14 and cognitive complexity 15; 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 main (cyclomatic 13, cognitive 16) · ×1
Complex function main (cyclomatic 13, cognitive 16) engineering/hivemind/scripts/oc-aggregate.mjs:30— main has cyclomatic complexity 13 and cognitive complexity 16; 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.
Complex function loadRun (cyclomatic 13, cognitive 16) engineering/hivemind/scripts/oc-status.mjs:7— loadRun has cyclomatic complexity 13 and cognitive complexity 16; 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.
Complex function waitForLoad (cyclomatic 11, cognitive 21) engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:168— waitForLoad has cyclomatic complexity 11 and cognitive complexity 21; 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.
Complex function validateInput (cyclomatic 11, cognitive 15) research/syllabus/skills/syllabus/scripts/generate_reading_list.js:85— validateInput has cyclomatic complexity 11 and cognitive complexity 15; 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.
Dead file (~197 LoC) engineering/hivemind/scripts/oc-worker.mjs— no import path from any entry point (10 application, 5 tooling, 0 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
Dead file (~79 LoC) engineering/hivemind/scripts/oc-aggregate.mjs— no import path from any entry point (10 application, 5 tooling, 0 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
Dead file (~46 LoC) engineering/hivemind/scripts/oc-status.mjs— no import path from any entry point (10 application, 5 tooling, 0 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
Dead file (~45 LoC) engineering/workflow-builder/skills/workflow-builder/expected_outputs/scaffold_pipeline.js— no import path from any entry point (10 application, 5 tooling, 0 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
Third-party script without Subresource Integrity .codex/skills/md-document/assets/md_document_template.html:97— `https://cdn.jsdelivr.net/npm/prismjs@1.29.0/components/prism-core.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 8 such include(s) across the repository's markup.
SC1 · Supply-chain hygiene· JavaScript dependencies are not locked · ×1
JavaScript dependencies are not locked — No package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock — JS installs aren't reproducible (SSDF PW.4.4). Commit your package manager's lockfile and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
async void method: HandleClick REDACTED:25— `async void` can't be awaited and its exceptions crash the process instead of propagating. Return `Task` — or, where the delegate contract requires void (timer/event/callback registrations), make this a thin void shim that awaits a Task-returning inner method inside try/catch so exceptions are contained.
Sync-over-async (deadlock risk) through `.Result` REDACTED:28— Reading `.Result` of a task that has not completed blocks this thread until it does — the same block as `.Wait()`: under a synchronization context (Blazor, a UI thread, classic ASP.NET) it deadlocks, and on the thread pool it parks a thread for as long as the work runs. `await` the task instead (make the caller `async`); where a synchronous entry point must stay, keep the block in ONE documented bridge with a timeout.
Swallowed exception (empty catch) REDACTED:49— 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.
README/code drift INSTALLATION.md:193— INSTALLATION.md names `.github/skills/`, but no file or folder `.github/skills` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:9— README.md links to `Hermes`, but `Hermes` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:10— README.md links to `Mistral`, but `Mistral` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:280— README.md names `engineering/git-worktree-manager`, but no file or folder `engineering/git-worktree-manager` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:281— README.md names `engineering/mcp-server-builder`, but no file or folder `engineering/mcp-server-builder` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:282— README.md names `engineering/changelog-generator`, but no file or folder `engineering/changelog-generator` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:283— README.md names `engineering/ci-cd-pipeline-builder`, but no file or folder `engineering/ci-cd-pipeline-builder` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift README.md:284— README.md names `marketing-skill/prompt-engineer-toolkit`, but no file or folder `marketing-skill/prompt-engineer-toolkit` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift business-operations/README.md:32— business-operations/README.md names `c-level-advisor/coo-advisor`, but no file or folder `c-level-advisor/coo-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift business-operations/README.md:36— business-operations/README.md names `engineering-team/runbook-generator`, but no file or folder `engineering-team/runbook-generator` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:32— commercial/README.md names `business-growth/sales-engineer`, but no file or folder `business-growth/sales-engineer` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:33— commercial/README.md names `business-growth/revenue-operations`, but no file or folder `business-growth/revenue-operations` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:34— commercial/README.md names `business-growth/contract-and-proposal-writer`, but no file or folder `business-growth/contract-and-proposal-writer` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:35— commercial/README.md names `c-level-advisor/cro-advisor`, but no file or folder `c-level-advisor/cro-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:36— commercial/README.md names `c-level-advisor/cfo-advisor`, but no file or folder `c-level-advisor/cfo-advisor` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift commercial/README.md:37— commercial/README.md names `finance/financial-analysis`, but no file or folder `finance/financial-analysis` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/integrations.md:434— docs/integrations.md documents the environment variable `OPENCODE_DISABLE_CLAUDE_CODE_SKILLS`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/integrations.md:595— docs/integrations.md documents the environment variable `NOUS_API_KEY`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift docs/integrations.md:799— docs/integrations.md documents the environment variable `MISTRAL_API_KEY`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:310— engineering-team/README.md names `code_review_checklist.md`, but no file or folder `code_review_checklist.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:311— engineering-team/README.md names `coding_standards.md`, but no file or folder `coding_standards.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:312— engineering-team/README.md names `common_antipatterns.md`, but no file or folder `common_antipatterns.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:336— engineering-team/README.md names `security_auditor.py`, but no file or folder `security_auditor.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:337— engineering-team/README.md names `pentest_automator.py`, but no file or folder `pentest_automator.py` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift engineering-team/README.md:340— engineering-team/README.md names `security_architecture_patterns.md`, but no file or folder `security_architecture_patterns.md` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Orphaned file engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file ra-qm-team/skills/capa-officer/scripts/root_cause_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tc-tracker/scripts/tc_validator.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tc-tracker/scripts/tc_update.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/docker-development/skills/docker-development/scripts/dockerfile_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/skill-tester/assets/sample-skill/scripts/text_processor.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/docker-development/skills/docker-development/scripts/compose_validator.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file marketing-skill/skills/x-twitter-growth/scripts/profile_auditor.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file product-team/research-summarizer/skills/research-summarizer/scripts/format_summary.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file marketing-skill/skills/x-twitter-growth/scripts/tweet_composer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tc-tracker/scripts/tc_create.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file marketing-skill/skills/x-twitter-growth/scripts/growth_tracker.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file finance/skills/saas-metrics-coach/scripts/metrics_calculator.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file product-team/research-summarizer/skills/research-summarizer/scripts/extract_citations.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tech-debt-tracker/assets/sample_codebase/src/user_service.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/data-quality-auditor/skills/data-quality-auditor/scripts/missing_value_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file marketing-skill/skills/x-twitter-growth/scripts/competitor_analyzer.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file marketing-skill/skills/x-twitter-growth/scripts/content_planner.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tc-tracker/scripts/tc_status.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/statistical-analyst/skills/statistical-analyst/scripts/confidence_interval.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file engineering/skills/tc-tracker/scripts/tc_init.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Duplicated predicate c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py:554— `"--interactive" in sys.argv or "-i" in sys.argv` appears character-identically in 2 files — c-level-advisor/skills/org-health-diagnostic/scripts/health_scorer.py, c-level-advisor/skills/scenario-war-room/scripts/scenario_modeler.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 engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py:38— `":" in line and not line.lstrip().startswith("#")` appears character-identically in 2 files — engineering/llm-wiki/skills/llm-wiki/scripts/lint_wiki.py, engineering/llm-wiki/skills/llm-wiki/scripts/update_index.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 engineering/agenthub/skills/agenthub/scripts/result_ranker.py:47— `":" in line and not line.startswith("#")` appears character-identically in 2 files — engineering/agenthub/skills/agenthub/scripts/result_ranker.py, engineering/agenthub/skills/agenthub/scripts/session_manager.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 scripts/sync-hermes-skills.py:142— `":" in line and not line.strip().startswith("#")` appears character-identically in 2 files — scripts/sync-hermes-skills.py, scripts/sync-vibe-skills.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 c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:226— `"IL" in states and domain == "employment"` appears character-identically in 2 files — c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py, c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.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 c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:247— `"IL" in states and profile.get("biometric_data_processed", False)` appears character-identically in 2 files — c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py, c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.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 engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:30— `"LeaderElection" in c or "leader-elect" in c` appears character-identically in 2 files — engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py, engineering/skills/kubernetes-operator/scripts/operator_capability_audit.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 c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:202— `"NY" in states and domain == "employment"` appears character-identically in 2 files — c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py, c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.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 scripts/check_frontmatter.py:167— `"agents" in parts or "commands" in parts` appears character-identically in 2 files — scripts/check_frontmatter.py, scripts/check_paths.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 c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py:164— `"chatbot" in use_case or "deepfake" in use_case or "image generation" in use_case or "video generation" in use_case` appears character-identically in 2 files — c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.py, c-level-advisor/skills/chief-ai-officer-advisor/scripts/ai_risk_classifier.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 engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py:109— `"controllerutil.AddFinalizer" in src or re.search(r"finalizers\s*=", src)` appears character-identically in 2 files — engineering/kubernetes-operator/skills/kubernetes-operator/scripts/reconcile_lint.py, engineering/skills/kubernetes-operator/scripts/reconcile_lint.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 engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:29— `"conversion" in c.lower() and "webhook" in c.lower()` appears character-identically in 2 files — engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py, engineering/skills/kubernetes-operator/scripts/operator_capability_audit.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 c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py:206— `"improve-pipeline-reliability" in priorities or "reliability" in str(priorities)` appears character-identically in 2 files — c-level-advisor/chief-data-officer-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.py, c-level-advisor/skills/chief-data-officer-advisor/scripts/data_product_strategy_picker.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 engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py:35— `"metav1.Condition" in c or "SetStatusCondition" in c` appears character-identically in 2 files — engineering/kubernetes-operator/skills/kubernetes-operator/scripts/operator_capability_audit.py, engineering/skills/kubernetes-operator/scripts/operator_capability_audit.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 engineering-team/skills/tdd-guide/scripts/format_detector.py:137— `'@Test' in code and 'import org.junit' in code` appears character-identically in 2 files — engineering-team/skills/tdd-guide/scripts/format_detector.py, engineering-team/skills/tdd-guide/scripts/framework_adapter.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 engineering-team/skills/tdd-guide/scripts/format_detector.py:117— `'from \'@jest/globals\'' in code or '@jest/' in code` appears character-identically in 2 files — engineering-team/skills/tdd-guide/scripts/format_detector.py, engineering-team/skills/tdd-guide/scripts/framework_adapter.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 engineering-team/skills/tdd-guide/scripts/format_detector.py:122— `'from \'vitest\'' in code or 'import { vi }' in code` appears character-identically in 2 files — engineering-team/skills/tdd-guide/scripts/format_detector.py, engineering-team/skills/tdd-guide/scripts/framework_adapter.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 engineering-team/skills/tdd-guide/scripts/format_detector.py:132— `'import unittest' in code and 'unittest.TestCase' in code` appears character-identically in 2 files — engineering-team/skills/tdd-guide/scripts/format_detector.py, engineering-team/skills/tdd-guide/scripts/framework_adapter.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 markdown-html/skills/design-system/scripts/config_loader.py:104— `_read_json(GLOBAL_CONFIG_PATH) or _read_json(project_config_path())` appears character-identically in 5 files — markdown-html/skills/design-system/scripts/config_loader.py, research-ops/skills/clinical-research/scripts/config_loader.py, research-ops/skills/market-research/scripts/config_loader.py, research-ops/skills/product-research/scripts/config_loader.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 c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py:152— `accuracy == "frontier" and monthly_q > 1_000_000_000 and ml_capacity >= 20` appears character-identically in 2 files — c-level-advisor/chief-ai-officer-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.py, c-level-advisor/skills/chief-ai-officer-advisor/scripts/model_buildvsbuy_calculator.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 engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py:86— `age is not None and age > max_age_days and len(paths) <= min_uses` appears character-identically in 2 files — engineering/feature-flags-architect/skills/feature-flags-architect/scripts/flag_debt_scanner.py, engineering/skills/feature-flags-architect/scripts/flag_debt_scanner.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 ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py:195— `annex_iii and annex_iii in ANNEX_III_CATEGORIES` appears character-identically in 2 files — ra-qm-team/compliance-team-eu-ai-act/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.py, ra-qm-team/skills/eu-ai-act-specialist/scripts/ai_system_risk_classifier.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 engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py:48— `args.abort_if or "<must define abort criteria>"` appears character-identically in 2 files — engineering/chaos-engineering/skills/chaos-engineering/scripts/experiment_designer.py, engineering/skills/chaos-engineering/scripts/experiment_designer.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 engineering/skills/tc-tracker/scripts/tc_create.py:181— `args.author or config.get("default_author", "Claude")` appears character-identically in 2 files — engineering/skills/tc-tracker/scripts/tc_create.py, engineering/skills/tc-tracker/scripts/tc_update.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 engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py:520— `args.baseline_mean is None or args.baseline_std is None` appears character-identically in 2 files — engineering-team/skills/threat-detection/scripts/threat_signal_analyzer.py, engineering/statistical-analyst/skills/statistical-analyst/scripts/sample_size_calculator.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.
Silent fallback default in catch agent-launcher/hooks/session_end.py:51— `main` 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 agent-launcher/hooks/session_start.py:76— `main` 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 engineering-team/skills/code-reviewer/scripts/code_quality_checker.py:71— `read_file_content` 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 engineering/agent-memory/hooks/session_end.py:42— `main` 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 engineering/agent-memory/hooks/session_start.py:129— `main` 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 engineering/agent-memory/hooks/user_prompt_submit.py:132— `main` 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 engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/epub.py:142— `count_epub_chapters` 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 engineering/book-to-skill/skills/book-to-skill/scripts/book_to_skill/parsers/pdf.py:141— `count_pages` 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 engineering/skillopt-sleep/skillopt_sleep/__main__.py:46— `_read_text` 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:642— `_call` 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:1031— `_call` 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 engineering/skillopt-sleep/skillopt_sleep/config.py:145— `_load_file` 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 engineering/skillopt-sleep/skillopt_sleep/cycle.py:52— `_read` 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 engineering/skillopt-sleep/skillopt_sleep/scheduler.py:39— `_read_crontab` 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 engineering/skills/ci-cd-pipeline-builder/scripts/stack_detector.py:69— `read_package_scripts` 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 engineering/skills/dependency-auditor/scripts/dep_scanner.py:303— `_compare_versions` 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 engineering/skills/monorepo-navigator/scripts/monorepo_analyzer.py:17— `load_json` 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 engineering/skills/ship-gate/scripts/ship_gate_scanner.py:219— `read_json_file` 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 markdown-html/skills/md-review/scripts/review_html_renderer.py:83— `_derive_danger_color` swallows every exception into `return '#D04646'` — 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 productivity/handoff/hooks/session_end.py:98— `main` 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 productivity/handoff/hooks/session_start.py:107— `main` 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 scripts/sync-hermes-skills.py:146— `read_frontmatter` 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 scripts/sync-vibe-skills.py:159— `read_frontmatter` 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 engineering/skills/tech-debt-tracker/assets/sample_codebase/src/frontend.js:261— `fetchRecentActivity` 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 on parse failure agent-launcher/skills/agent-launcher-orchestrator/scripts/goal_state.py:43— `_load` returns `{}` when `(json.JSONDecodeError, OSError)` 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 business-operations/skills/internal-comms/scripts/comms_calendar_builder.py:73— `_compute_iso` 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 c-level-advisor/skills/coo-advisor/scripts/okr_tracker.py:788— `_calculate_quarter_progress` returns `0.5` when `(ValueError, 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 engineering/agent-memory/skills/agent-memory/scripts/memory_core.py:213— `read` returns `[]` when `json.JSONDecodeError` 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 engineering/agenthub/skills/agenthub/scripts/dag_analyzer.py:58— `get_branch_commit_count` returns `0` 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 engineering/security-guidance/hooks/security_reminder_hook.py:193— `load_state` returns `set()` when `(json.JSONDecodeError, IOError)` 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 marketing/linkedin/skills/linkedin-analytics/scripts/post_performance_analyzer.py:107— `_num` returns `0` 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 marketing/linkedin/skills/linkedin-content/scripts/repurpose_splitter.py:191— `load_ledger` returns `{}` when `(json.JSONDecodeError, OSError)` 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 project-management/skills/senior-pm/scripts/project_health_dashboard.py:191— `_calculate_timeline_variance` returns `0.0` when `(ValueError, ZeroDivisionError)` 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 research/pulse/skills/pulse/scripts/citation_tracker.py:127— `integer_value` returns `0` when `(TypeError, 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.
D34 · Knowledge Freshness· Further orphaned files (smaller) · ×1
Further orphaned files (smaller) — 35 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_security_scanner.py, ra-qm-team/skills/capa-officer/scripts/root_cause_analyzer.py, engineering/statistical-analyst/skills/statistical-analyst/scripts/hypothesis_tester.py, ra-qm-team/skills/risk-management-specialist/scripts/fmea_analyzer.py, REDACTED, engineering/skills/tc-tracker/scripts/tc_validator.py, engineering/skills/tc-tracker/scripts/tc_update.py, engineering/terraform-patterns/skills/terraform-patterns/scripts/tf_module_analyzer.py (and 27 more) (76 orphaned of 728 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 728 of the 752 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
M2 · Architecture documentation· ADRs not easily discoverable · ×1
ADRs not easily discoverable — 35 ADR-shaped document(s) detected by content — `.codex/skills/cdo-review/SKILL.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_cost_economics.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_risk_governance.md`, `.codex/skills/chief-ai-officer-advisor/references/ai_team_org_evolution.md`, `.codex/skills/chief-ai-officer-advisor/references/model_buildvsbuy_strategy.md`, `.codex/skills/chief-customer-officer-advisor/references/cs_coverage_model.md`, `.codex/skills/chief-customer-officer-advisor/references/cs_team_org_evolution.md`, `.codex/skills/chief-customer-officer-advisor/references/customer_segmentation_strategy.md`, `.codex/skills/chief-customer-officer-advisor/references/retention_decomposition.md`, `.codex/skills/chief-data-officer-advisor/references/ai_training_data_rights.md`, `.codex/skills/chief-data-officer-advisor/references/customer_data_as_asset.md`, `.codex/skills/chief-data-officer-advisor/references/data_product_strategy.md`, `.codex/skills/chief-data-officer-advisor/references/data_team_org_evolution.md`, `.codex/skills/chief-of-staff/SKILL.md`, `.codex/skills/collab-proof/references/session-documentation-patterns.md`, `.codex/skills/confluence-expert/references/templates.md`, `.codex/skills/cto-advisor/references/architecture_decision_records.md`, `.codex/skills/decide/SKILL.md`, `.codex/skills/freeze/SKILL.md`, `.codex/skills/tech-debt-tracker/references/stakeholder-communication-templates.md`, `.codex/skills/vpe-advisor/references/delivery_throughput.md`, `.codex/skills/vpe-advisor/references/eng_team_structure.md`, `.codex/skills/vpe-advisor/references/engineering_hiring_funnel.md`, `.codex/skills/vpe-advisor/references/production_discipline.md`, `compliance-os/agents/cs-fda-qsr-auditor.md`, `docs/agents/cs-fda-qsr-auditor.md`, `docs/agents/cs-handoff-author.md`, `docs/agents/hub-coordinator.md`, `docs/skills/c-level-advisor/c-level-agents-cdo-review.md`, `docs/skills/c-level-advisor/c-level-agents-decide.md`, `docs/skills/c-level-advisor/c-level-agents-freeze.md`, `docs/skills/c-level-advisor/chief-of-staff.md`, `engineering/agenthub/agents/hub-coordinator.md`, `engineering/handoff/agents/cs-handoff-author.md`, `standards/documentation/documentation-standards.md`. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live — so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No SAST — 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 72277 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.
R7 · Dead Code· Unused export 'TestRailSection' · ×1
Unused export 'TestRailSection' engineering-team/playwright-pro/integrations/testrail-mcp/src/types.ts:24— Nothing imports this binding — it is safe to review for removal.
R7 · Dead Code· Unused module-local declaration 'proxyScroll' · ×1
Unused module-local declaration 'proxyScroll' engineering/skills/full-page-screenshot/scripts/full-page-screenshot.mjs:639— 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 methods take a CancellationToken · ×1
Not all async methods take a CancellationToken — Only 0/4 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
Nullable reference types not enabled everywhere — 0/2 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 4 shipped distribution(s) across 2 manifest(s) (1 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
D8 · Code Coverage· Coverage read from a report in the working tree · ×1
Coverage read from a report in the working tree — Line coverage 100.0% — read from a lcov report present in the working tree (.codex/skills/tdd-guide/assets/sample_coverage_report.lcov), which git does not track, so it was produced by a run outside this scan (a CI coverage step is the usual source). The in-image collector has no runner for this repository's ecosystem, so this is your own measurement rather than a fresh in-image one.
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.
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.
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.
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.
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.
Run 01a15aa5-221c-78f0-8a8a-e50b7cf8b290 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 153 · Warnings: 2055 · Recommendations: 151 · Info: 2 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 20-10-2026 @ 18:48 UTC.
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.