Public report of mvanhorn/last30days-skill, published 25 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, 25 October 2026, 03:28 UTC · Survey ID cd_63dd33d887de4fc0a71e6a4e59895799
mvanhorn/last30days-skill
Measured 25 October 2026, 03:20 UTC, at code version f3cd06a
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Up 1 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 medium codebase: 62,785 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 1.3 person-years · Weakest lens: Production Readiness, 62
Findings by how serious they are
0 critical606 serious76 minor
16 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
25 October 2026, 03:20 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.
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 ▸
55of 58 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
669of 682 findings point to an exact file and line, so you can open each one in the code. The other 13 concern the repository as a whole, such as missing documentation.
58dimensions across 5 lenses, read from 62,785 lines of product code in 2 projects.
mvanhorn/last30days-skill scores 68 out of 100 and is rated Adequate, while three of its five lenses score higher still: Security and Compliance at 96, rated Exemplary, and Architecture at 90 and Code Health at 77, both rated Adequate.
The score is lower than those three because the weakest lens counts most, and here that is Production Readiness, which scores 62 and is rated Adequate. Its Observability dimension scores 0 out of 10, and until that reaches 4, Production Readiness can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag, and if Production Readiness rose to 70, the score would rise from 68 to about 70.
No finding in this survey is critical.
Watchdog couldn't measure 15 dimensions in this code, among them Code Coverage, Internal API Consistency and Navigability, so they are left out of the score. The product code is 62,785 lines, which would take an estimated 1.3 person-years, around €180,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.
Exception handling · Swallowed exception (caught, then discarded) mcp/internal/engine/python.go
Exception handling · Swallowed exception (caught, then discarded) mcp/internal/engine/python.go
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: 24 findings
These 24 critical or serious findings were in the previous survey, on 11 October 2026, and are gone from this one.
€61,000 to €300,000, for 1,011 to 3,208 hours of work, about 1.3 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
×1.0 at a score of 68. 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
Medium: 62,785 lines of product code
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. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 6 points · Low effort · ADR Quality
2
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 5 points · Medium effort · Observability
3
Record your significant design decisions.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
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 €180,000 to build again, about 1.3 person-years of work. Its weakest lens is Production Readiness, at 62 (Adequate). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 6 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 91,858 lines over the last 90 days, which is about 372,535 lines a year. At that pace, the extra work comes to an estimated 50.5 to 302.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 — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
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.
43 modules, with 32 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; 3 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.
1 pair of types, where a type in github.com/mvanhorn/last30days-skill/mcp/internal/tools uses a type in github.com/mvanhorn/last30days-skill/mcp/internal/engine.
github.com/mvanhorn/last30days-skill/mcp/internal/tools uses github.com/mvanhorn/last30days-skill/mcp/internal/engine, so a change to github.com/mvanhorn/last30days-skill/mcp/internal/engine can break github.com/mvanhorn/last30days-skill/mcp/internal/tools, while a change to github.com/mvanhorn/last30days-skill/mcp/internal/tools can't break github.com/mvanhorn/last30days-skill/mcp/internal/engine.
Position
Below the diagonal: github.com/mvanhorn/last30days-skill/mcp/internal/tools uses a module listed above it, which is the healthy direction.
skills.last30days.scripts uses skills.last30days.scripts.lib.env, so a change to skills.last30days.scripts.lib.env can break skills.last30days.scripts, while a change to skills.last30days.scripts can't break skills.last30days.scripts.lib.env.
Position
Below the diagonal: skills.last30days.scripts uses a module listed above it, which is the healthy direction.
skills.last30days.scripts uses skills.last30days.scripts.lib.registers, so a change to skills.last30days.scripts.lib.registers can break skills.last30days.scripts, while a change to skills.last30days.scripts can't break skills.last30days.scripts.lib.registers.
Position
Below the diagonal: skills.last30days.scripts uses a module listed above it, which is the healthy direction.
skills.last30days.scripts uses skills.last30days.scripts.lib.schema, so a change to skills.last30days.scripts.lib.schema can break skills.last30days.scripts, while a change to skills.last30days.scripts can't break skills.last30days.scripts.lib.schema.
Position
Below the diagonal: skills.last30days.scripts uses a module listed above it, which is the healthy direction.
skills.last30days.scripts uses skills.last30days.scripts.lib.ui, so a change to skills.last30days.scripts.lib.ui can break skills.last30days.scripts, while a change to skills.last30days.scripts can't break skills.last30days.scripts.lib.ui.
Position
Below the diagonal: skills.last30days.scripts uses a module listed above it, which is the healthy direction.
skills.last30days.scripts uses skills.last30days.scripts.lib.x_envelope, so a change to skills.last30days.scripts.lib.x_envelope can break skills.last30days.scripts, while a change to skills.last30days.scripts can't break skills.last30days.scripts.lib.x_envelope.
Position
Below the diagonal: skills.last30days.scripts uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib.grounding uses skills.last30days.scripts.lib.schema, so a change to skills.last30days.scripts.lib.schema can break skills.last30days.scripts.lib.grounding, while a change to skills.last30days.scripts.lib.grounding can't break skills.last30days.scripts.lib.schema.
Position
Below the diagonal: skills.last30days.scripts.lib.grounding uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib.pipeline uses skills.last30days.scripts.lib.schema, so a change to skills.last30days.scripts.lib.schema can break skills.last30days.scripts.lib.pipeline, while a change to skills.last30days.scripts.lib.pipeline can't break skills.last30days.scripts.lib.schema.
Position
Below the diagonal: skills.last30days.scripts.lib.pipeline uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib.discovery_handoff uses skills.last30days.scripts.lib.pipeline, so a change to skills.last30days.scripts.lib.pipeline can break skills.last30days.scripts.lib.discovery_handoff, while a change to skills.last30days.scripts.lib.discovery_handoff can't break skills.last30days.scripts.lib.pipeline.
Position
Below the diagonal: skills.last30days.scripts.lib.discovery_handoff uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.backends, so a change to skills.last30days.scripts.lib.backends can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.backends.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.corpus, so a change to skills.last30days.scripts.lib.corpus can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.corpus.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.dedupe, so a change to skills.last30days.scripts.lib.dedupe can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.dedupe.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.env, so a change to skills.last30days.scripts.lib.env can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.env.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.freshness, so a change to skills.last30days.scripts.lib.freshness can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.freshness.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.health, so a change to skills.last30days.scripts.lib.health can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.health.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.html_publish, so a change to skills.last30days.scripts.lib.html_publish can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.html_publish.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.http, so a change to skills.last30days.scripts.lib.http can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.http.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.library, so a change to skills.last30days.scripts.lib.library can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.library.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.library_index, so a change to skills.last30days.scripts.lib.library_index can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.library_index.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.meta_ads, so a change to skills.last30days.scripts.lib.meta_ads can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.meta_ads.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.prescriptions, so a change to skills.last30days.scripts.lib.prescriptions can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.prescriptions.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.registers, so a change to skills.last30days.scripts.lib.registers can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.registers.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.relevance, so a change to skills.last30days.scripts.lib.relevance can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.relevance.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
49 pairs of types, where a type in skills.last30days.scripts.lib uses a type in skills.last30days.scripts.lib.schema. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.schema, so a change to skills.last30days.scripts.lib.schema can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.schema.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.subproc, so a change to skills.last30days.scripts.lib.subproc can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.subproc.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.transcribe, so a change to skills.last30days.scripts.lib.transcribe can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.transcribe.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.web_fetch_keyless, so a change to skills.last30days.scripts.lib.web_fetch_keyless can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.web_fetch_keyless.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.x_api, so a change to skills.last30days.scripts.lib.x_api can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.x_api.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.x_envelope, so a change to skills.last30days.scripts.lib.x_envelope can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.x_envelope.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.grounding, so a change to skills.last30days.scripts.lib.grounding can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.grounding.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.pipeline, so a change to skills.last30days.scripts.lib.pipeline can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.pipeline.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
skills.last30days.scripts.lib uses skills.last30days.scripts.lib.discovery_handoff, so a change to skills.last30days.scripts.lib.discovery_handoff can break skills.last30days.scripts.lib, while a change to skills.last30days.scripts.lib can't break skills.last30days.scripts.lib.discovery_handoff.
Position
Below the diagonal: skills.last30days.scripts.lib uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 77% · Adequate · gated by D1, D2 ·
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
A03:2025 — Software Supply Chain Failures
5
Medium
A05:2025 — Injection
1
Medium
Roadmap
First, address the lack of architectural decision records by documenting key design choices and resolving the identified code complexity hotspots in the most frequently changed files. Second, implement a diagnostic logging trail with a debug flag to capture error details, ensuring that unhandled errors are visible for reproduction. Finally, introduce a manual approval gate or draft release mechanism to prevent bad builds from reaching users, while simultaneously establishing health checks and rollback capabilities to ensure safe deployments.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
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 — 0
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 — 606
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 — 76
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 16
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. 55 of 58 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 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 — 58 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, 669 of 682 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.
D8 Code Coverage — 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. Coverage NOT READ here — but this repository measures it: a coverage step in CI (`pytest --cov --cov`) shows that coverage is collected and tracked in your own CI. The built-in collector has no runner for this ecosystem (.py), so the analyzer could not read the number — a gap in the analyzer's language coverage, not an unmeasured repo. Not scored. To have the real number read, produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D14 License Compliance — 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. This repository declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its Go module dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
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. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (pyproject.toml), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
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.
AX6 Interface segregation — 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 check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — 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. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C3 Audit Trail — 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. 'sqlite3' is imported (skills/last30days/scripts/store.py:17), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — 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. 'sqlite3' is imported (skills/last30days/scripts/store.py:17), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — 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. 'sqlite3' is imported (skills/last30days/scripts/store.py:17), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
GD1 Unfinished & placeholder code — 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 check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Go, Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — 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 check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Go, Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — 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. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
S1 Web-Security Posture — 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. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — 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 check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — 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 check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — 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 check reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — 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 check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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.
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.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality 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.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
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.
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 (REDACTED, 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.
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".
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 (3): D19, D21, 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.
+ 156 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 7 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with last30days._main (cyclomatic 261), pipeline.run (cyclomatic 187), pipeline._retrieve_stream_impl (cyclomatic 151). — 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 7 together lifts Cyclomatic Complexity from 2.0 to about 3.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
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.
+ 255 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 19 bodies over 60 down to 60 or less in Cognitive Complexity — start with last30days._main (cognitive 366), pipeline._retrieve_stream_impl (cognitive 310), pipeline.run (cognitive 303). — 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 19 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.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.1 / 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 25 FileTooLong finding(s) in God Classes — start with pipeline.py, last30days.py, render.py. — One of this dimension's main actionable groups (25 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.
87 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 50 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with normalize.py (3), arxiv.py, doctor.py. — One of this dimension's main actionable groups (10 warning-level).
Resolve the 7 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with reddit.py (2), last30days.py, bird_x.py. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 7 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with normalize.py (2), bird_x.py, brightdata.py. — One of this dimension's main actionable groups (7 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.
2 production modules (Go+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.
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.
5886 test methods: 5866 unit, 9 integration, 0 BDD, 11 e2e. The Python suite contributes 5809 test function(s) across 282 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. The Go suite contributes 77 test case(s) across 9 `_test.go` file(s) declaring at least one — every `func Test…(t *testing.T)` that `go test` would collect, plus the suite methods a testify-style runner reaches; a table-driven case list counts once, so this is a floor. Its tier split is INFERRED from file names, paths and build constraints, not declared: 0 of those file(s) use Go's external test package (`package x_test`), which is a visibility boundary rather than a pyramid tier and was not read as one.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
1 outdated, 0 author-deprecated direct Go module(s), 0 pinning or checksum defect(s). Whether any of these modules is UNMAINTAINED is not graded — proxy.golang.org publishes no maintenance status, and release age does not stand in for one. Whether any is UNUSED is not graded either: that is a source question, not a registry one. Known CVEs in this module graph are D30's question, read from REDACTED and go.sum there.
Outdated: github.com/mark3labs/mcp-go
✓ On the Gold path — maintain.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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 8 required Go module(s) use a banned license. Licences were read per module version from the licence files pkg.go.dev detects (via api.deps.dev), over every module this repository's REDACTED requires, direct and indirect, at the version the build uses. Go records no test-only scope at module level, so modules only this repository's own tests import are included. ★ COVERAGE OF THIS VERDICT: it grades this repository's Go module dependencies and nothing else. The repository also declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
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: skills/last30days/scripts/last30days.py (34×261=8874); skills/last30days/scripts/lib/pipeline.py (45×187=8415); skills/last30days/scripts/lib/env.py (25×45=1125) Repeated repair below the complexity floor: skills/last30days/scripts/lib/xurl_x.py (4 of 5 changes were fixes); skills/last30days/scripts/store.py (4 of 4 changes were fixes); skills/last30days/scripts/lib/hackernews.py (4 of 4 changes were fixes)
Resolve the 27 Hotspot finding(s) in Churn × Complexity Hotspots — start with last30days.py, pipeline.py, env.py. — One of this dimension's main actionable groups (27 warning-level).
Resolve the 6 Repeated repair finding(s) in Churn × Complexity Hotspots — start with xurl_x.py, store.py, hackernews.py. — One of this dimension's main actionable groups (6 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor8.9 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
12 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is skills/last30days/scripts/lib/schema.py. Counted over 111 of the 128 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
Further sole-owners (lower concentration)
What to do
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Resolve the 1 Further sole-owners (lower concentration) finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
0 deducted task-comment markers across 62785 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.
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 documentation is comprehensive and well-structured: READMEs for each directory describe what it contains; architecture/design docs cover a detailed plan for retrieving-judge-retry, fixing Amazon review budget by starting at search time, and fixing Grok auth honesty; the research-quality eval harness and agent JSON export are reference-complete. The documents are all present (34 total) and well ordered with headings; each one is written for an audience who can decode its own jargon rather than being a wall of internal ticket ids. The repository's documentation is comprehensive and well-structured: READMEs for each directory describe what that directory contains (e.g. the fix/github-qualifier-wrapper-strip residual review findings), architecture/design docs on host-side LLM judgment (checkpointed discovery protocol conventions) and persistent topic queues, a dedicated search-quality-eval manual-by-default doc, and a detailed optional-value argparse flag dispatch convention. The visible content is clipped by the scanner at a fixed byte budget; no section in any document appears missing from its outline. (9 of 25 sampled documents could not be assessed: 1 of 3 evaluation groups failed.)
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
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.
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.
1 of 2 build units (Go, Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
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).
1 finding(s): 0 critical, 0 high, 0 medium, 1 low. semgrep hit a parse error in 3 file(s) — `fixtures/reddit_search_last_page.html` (line 116), `fixtures/reddit_search_no_results.html` (line 59), `fixtures/reddit_search_page1.html` (line 424) — 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 1 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
✓ On the Gold path — maintain.
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 2 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 warning-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.
1 of 111 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is skills/last30days/scripts/lib/xiaohongshu_api.py. Counted over 111 of the 128 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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.
Resolve the 2 Change coupling finding(s) in Change Coupling — start with instagram.py, dedupe.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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 2 platform declaration(s) and 0 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.
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.
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.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
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.
README advertises Docker containerisation, but no Dockerfile/compose file exists — searched for: `dockerfile`, `docker-compose`, `compose.yaml`, `compose.yml`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, Dockerfile); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong. — README.md:274
docs/search-quality-eval.md documents the environment variable `GEMINI_MODEL`, 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/search-quality-eval.md:39
docs/solutions/architecture-patterns/discovery-checkpoint-protocol-design-conventions.md names `discovery_judge.py`, but no file or folder `discovery_judge.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. — docs/solutions/architecture-patterns/discovery-checkpoint-protocol-design-conventions.md:156
docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md links to `url`, but `docs/solutions/integration-issues/url` 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. — docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md:25
docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md documents the environment variable `FORCE_HYPERLINK`, 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/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md:45
docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md names `skills/last30days/scripts/sync.sh`, but no file or folder `skills/last30days/scripts/sync.sh` 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. — docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:36
docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md names `sync.sh`, but no file or folder `sync.sh` 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. — docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:43
docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md documents the environment variable `SKILL_VERSION`, 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/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:74
What to do
Reconcile the README with reality: README advertises Docker containerisation, but no Dockerfile/compose file exists; docs/search-quality-eval.md documents the environment variable `GEMINI_MODEL`, but no code, script or configuration file names it; docs/solutions/architecture-patterns/discovery-checkpoint-protocol-design-conventions.md names `discovery_judge.py`, but no file or folder `discovery_judge.py` exists; docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md links to `url`, but `docs/solutions/integration-issues/url` does not exist; docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md documents the environment variable `FORCE_HYPERLINK`, but no code, script or configuration file names it.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
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.
What to do
Dependabot is configured but does not watch `pip` — add that `package-ecosystem` entry to .github/dependabot.yml so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
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.
The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
What to do
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
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.
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.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document2.2 / 10Critical✓ Tool-verified
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.
`to_dict` is public, takes a document from its caller (line 462) and hands it to `_drop_none`, which calls itself at line 19 (`_drop_none`) with a piece of `value` (and at line 24) — and nowhere in `_drop_none` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_drop_none` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/last30days/scripts/lib/schema.py:19
`request` is public, takes a document from its caller (line 771) and hands it to `_scrub_fixture_value`, which calls itself at line 203 (`_scrub_fixture_value`) with a piece of `value` (and at line 211) — and nowhere in `_scrub_fixture_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_scrub_fixture_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/last30days/scripts/lib/http.py:203
`request` is public, takes a document from its caller (line 771) and hands it to `_collect_secret_values`, which calls itself at line 237 (`_collect_secret_values`) with a piece of `value` (and at line 240) — and nowhere in `_collect_secret_values` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_collect_secret_values` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/last30days/scripts/lib/http.py:237
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
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 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?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
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.
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.
`if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×3) — mcp/internal/engine/python.go:56, mcp/internal/engine/python.go:101, mcp/internal/engine/extract.go:122
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. (×8) — skills/last30days/scripts/last30days.py:4637, skills/last30days/scripts/lib/subproc.py:280, skills/last30days/scripts/lib/setup_wizard.py:1257, …
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×16) — skills/last30days/scripts/lib/setup_wizard.py:1154, skills/last30days/scripts/lib/setup_wizard.py:1410, skills/last30days/scripts/lib/reddit_keyless.py:248, …
What to do
Swallowed exception (caught, then discarded)
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.
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.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 4 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 9 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 20 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'sqlite3' (skills/last30days/scripts/store.py:17) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'sqlite3' (skills/last30days/scripts/store.py:17) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'sqlite3' (skills/last30days/scripts/store.py:17) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 54 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.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's Go imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No Go request handler (a net/http, Gin, Echo, Fiber or fasthttp handler, or a gRPC service method) is declared as a method or function, and no handler function literal writes a value captured from outside it, so no state is shared between request goroutines. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
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 — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
D10 Test Quality — ~83850 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.
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, nor 2+ projects each declaring an entity of their own. 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.
D25 ADR Conformance — no ADRs to check
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.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
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.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — applicable but not scored (1 of 2 signals for this style — below the bar we score at): 50 value object(s)
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Go, Python source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Go code has 1,199 production line(s), 1 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
PF3 Async & latency hygiene — Not applicable: Go has no async/await function colour, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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.
Hotspot: skills/last30days/scripts/last30days.py skills/last30days/scripts/last30days.py:3418— skills/last30days/scripts/last30days.py changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 261 in last30days._main at line 3418. 22 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/last30days.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: skills/last30days/scripts/lib/pipeline.py skills/last30days/scripts/lib/pipeline.py:2217— skills/last30days/scripts/lib/pipeline.py changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in pipeline.run at line 2217. 34 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/pipeline.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: skills/last30days/scripts/lib/env.py skills/last30days/scripts/lib/env.py:547— skills/last30days/scripts/lib/env.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in env.get_config at line 547. 15 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/env.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: skills/last30days/scripts/lib/render.py skills/last30days/scripts/lib/render.py:1810— skills/last30days/scripts/lib/render.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in render.render_full at line 1810. 16 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/render.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: skills/last30days/scripts/lib/http.py skills/last30days/scripts/lib/http.py:771— skills/last30days/scripts/lib/http.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in http.request at line 771. 11 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/http.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: skills/last30days/scripts/lib/doctor.py skills/last30days/scripts/lib/doctor.py:461— skills/last30days/scripts/lib/doctor.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in doctor._x_record at line 461. 8 of those changes were fix/bug commits, and the other 9 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/doctor.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: skills/last30days/scripts/lib/setup_wizard.py skills/last30days/scripts/lib/setup_wizard.py:773— skills/last30days/scripts/lib/setup_wizard.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in setup_wizard.get_setup_status_text at line 773. 11 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/setup_wizard.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: skills/last30days/scripts/lib/github.py skills/last30days/scripts/lib/github.py:735— skills/last30days/scripts/lib/github.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in github.search_github_person at line 735. 11 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/github.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: skills/last30days/scripts/lib/youtube_yt.py skills/last30days/scripts/lib/youtube_yt.py:1720— skills/last30days/scripts/lib/youtube_yt.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in youtube_yt.search_youtube_sc at line 1720. 9 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/youtube_yt.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: skills/last30days/scripts/lib/grok_x.py skills/last30days/scripts/lib/grok_x.py:1013— skills/last30days/scripts/lib/grok_x.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in grok_x.search_x at line 1013. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/grok_x.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: skills/last30days/scripts/lib/quality_nudge.py skills/last30days/scripts/lib/quality_nudge.py:325— skills/last30days/scripts/lib/quality_nudge.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in quality_nudge._build_nudge_text at line 325. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/quality_nudge.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: skills/last30days/scripts/lib/planner.py skills/last30days/scripts/lib/planner.py:610— skills/last30days/scripts/lib/planner.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in planner._trim_subqueries_for_depth at line 610. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/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.
Hotspot: skills/last30days/scripts/lib/subproc.py skills/last30days/scripts/lib/subproc.py:165— skills/last30days/scripts/lib/subproc.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in subproc.run_with_timeout at line 165. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/subproc.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: skills/last30days/scripts/lib/normalize.py skills/last30days/scripts/lib/normalize.py:35— skills/last30days/scripts/lib/normalize.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in normalize.normalize_source_items at line 35. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/normalize.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: skills/last30days/scripts/lib/bird_x.py skills/last30days/scripts/lib/bird_x.py:519— skills/last30days/scripts/lib/bird_x.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in bird_x.search_x at line 519. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/bird_x.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: skills/last30days/scripts/lib/reddit.py skills/last30days/scripts/lib/reddit.py:508— skills/last30days/scripts/lib/reddit.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in reddit.search_reddit at line 508. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/reddit.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: skills/last30days/scripts/lib/backends.py skills/last30days/scripts/lib/backends.py:660— skills/last30days/scripts/lib/backends.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in backends._resolve_alternative at line 660. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/backends.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: skills/last30days/scripts/lib/fusion.py skills/last30days/scripts/lib/fusion.py:368— skills/last30days/scripts/lib/fusion.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fusion.weighted_rrf at line 368. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/fusion.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: skills/last30days/scripts/lib/permission_preflight.py skills/last30days/scripts/lib/permission_preflight.py:61— skills/last30days/scripts/lib/permission_preflight.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in permission_preflight.build at line 61. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/permission_preflight.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: skills/last30days/scripts/lib/reddit_arctic.py skills/last30days/scripts/lib/reddit_arctic.py:160— skills/last30days/scripts/lib/reddit_arctic.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in reddit_arctic.fetch_listings at line 160. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/reddit_arctic.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: skills/last30days/scripts/lib/cookie_extract.py skills/last30days/scripts/lib/cookie_extract.py:138— skills/last30days/scripts/lib/cookie_extract.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cookie_extract._find_default_profile at line 138. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/cookie_extract.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: skills/last30days/scripts/lib/reddit_listing.py skills/last30days/scripts/lib/reddit_listing.py:281— skills/last30days/scripts/lib/reddit_listing.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in reddit_listing.fetch_discovery_listings at line 281. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/reddit_listing.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: skills/last30days/scripts/lib/perplexity.py skills/last30days/scripts/lib/perplexity.py:1229— skills/last30days/scripts/lib/perplexity.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perplexity.search at line 1229. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/perplexity.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: skills/last30days/scripts/lib/reddit_keyless.py skills/last30days/scripts/lib/reddit_keyless.py:116— skills/last30days/scripts/lib/reddit_keyless.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in reddit_keyless._discover at line 116. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/reddit_keyless.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: mcp/internal/engine/run.go mcp/internal/engine/run.go:75— mcp/internal/engine/run.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in engine.Run at line 75. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- mcp/internal/engine/run.go`: 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.
FileTooLong: lib/pipeline.py skills/last30days/scripts/lib/pipeline.py— FileTooLong — 4670 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4170 over it, 9.34× 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/last30days.py skills/last30days/scripts/last30days.py— FileTooLong — 3335 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2835 over it, 6.67× 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: lib/render.py skills/last30days/scripts/lib/render.py— FileTooLong — 2682 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2182 over it, 5.36× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lib/doctor.py skills/last30days/scripts/lib/doctor.py— FileTooLong — 1376 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 876 over it, 2.75× 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: lib/youtube_yt.py skills/last30days/scripts/lib/youtube_yt.py— FileTooLong — 1158 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 658 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: lib/perplexity.py skills/last30days/scripts/lib/perplexity.py— FileTooLong — 1097 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 597 over it, 2.19× 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: lib/env.py skills/last30days/scripts/lib/env.py— FileTooLong — 1020 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 520 over it, 2.04× 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: lib/http.py skills/last30days/scripts/lib/http.py— FileTooLong — 994 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 494 over it, 1.99× 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: lib/github.py skills/last30days/scripts/lib/github.py— FileTooLong — 964 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 464 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/store.py skills/last30days/scripts/store.py— FileTooLong — 901 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 401 over it, 1.80× 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: lib/setup_wizard.py skills/last30days/scripts/lib/setup_wizard.py— FileTooLong — 885 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 385 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: lib/normalize.py skills/last30days/scripts/lib/normalize.py— FileTooLong — 867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 367 over it, 1.73× 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: lib/grok_x.py skills/last30days/scripts/lib/grok_x.py— FileTooLong — 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 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: lib/schema.py skills/last30days/scripts/lib/schema.py— FileTooLong — 774 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 274 over it, 1.55× 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: lib/rerank.py skills/last30days/scripts/lib/rerank.py— FileTooLong — 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34× 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: lib/polymarket.py skills/last30days/scripts/lib/polymarket.py— FileTooLong — 644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 144 over it, 1.29× 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: lib/instagram.py skills/last30days/scripts/lib/instagram.py— FileTooLong — 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28× 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: lib/discovery_handoff.py skills/last30days/scripts/lib/discovery_handoff.py— FileTooLong — 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28× 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: lib/html_render.py skills/last30days/scripts/lib/html_render.py— FileTooLong — 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lib/meta_ads.py skills/last30days/scripts/lib/meta_ads.py— FileTooLong — 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13× 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: lib/jobs.py skills/last30days/scripts/lib/jobs.py— FileTooLong — 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06× 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: lib/x_envelope.py skills/last30days/scripts/lib/x_envelope.py— FileTooLong — 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06× 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: lib/bird_x.py skills/last30days/scripts/lib/bird_x.py— FileTooLong — 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04× 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: lib/reddit.py skills/last30days/scripts/lib/reddit.py— FileTooLong — 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: lib/x_api.py skills/last30days/scripts/lib/x_api.py— FileTooLong — 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.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.
Swallowed exception (caught, then discarded) mcp/internal/engine/python.go:56— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) mcp/internal/engine/python.go:101— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) mcp/internal/engine/extract.go:122— `if err != nil` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/setup_wizard.py:1154— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/setup_wizard.py:1410— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/reddit_keyless.py:248— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/reddit_keyless.py:255— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/reddit_keyless.py:315— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/reddit.py:719— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/quality_nudge.py:106— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/jobs.py:171— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/env.py:1193— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/env.py:1195— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/doctor.py:1067— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/doctor.py:1194— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/doctor.py:1274— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/doctor.py:1787— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/doctor.py:2160— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) skills/last30days/scripts/lib/cjk.py:65— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Duplicated block (5 lines × 2) skills/last30days/scripts/lib/arxiv.py:278— skills/last30days/scripts/lib/arxiv.py:278-282 | skills/last30days/scripts/lib/techmeme.py:233-237 — 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 (5 lines × 2) skills/last30days/scripts/lib/doctor.py:707— skills/last30days/scripts/lib/doctor.py:707-711 | skills/last30days/scripts/lib/doctor.py:727-731 — 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 (5 lines × 2) skills/last30days/scripts/lib/github.py:949— skills/last30days/scripts/lib/github.py:949-953 | skills/last30days/scripts/lib/github.py:1255-1259 — 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) skills/last30days/scripts/lib/normalize.py:259— skills/last30days/scripts/lib/normalize.py:259-263 | skills/last30days/scripts/lib/normalize.py:292-296 — 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 `skills/last30days/scripts/lib/normalize.py:259` 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 (5 lines × 2) skills/last30days/scripts/lib/quality_nudge.py:417— skills/last30days/scripts/lib/quality_nudge.py:417-423 | skills/last30days/scripts/lib/quality_nudge.py:437-441 — 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 `skills/last30days/scripts/lib/quality_nudge.py:417` 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) skills/last30days/scripts/lib/dripstack.py:44— skills/last30days/scripts/lib/dripstack.py:44-48 | skills/last30days/scripts/lib/stocktwits.py:72-76 — 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 × 2) skills/last30days/scripts/last30days.py:338— skills/last30days/scripts/last30days.py:338-342 | skills/last30days/scripts/last30days.py:590-594 — 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) skills/last30days/scripts/lib/normalize.py:265— skills/last30days/scripts/lib/normalize.py:265-269 | skills/last30days/scripts/lib/normalize.py:300-304 — 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) skills/last30days/scripts/lib/normalize.py:743— skills/last30days/scripts/lib/normalize.py:743-747 | skills/last30days/scripts/lib/normalize.py:1058-1062 — 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 `skills/last30days/scripts/lib/normalize.py:743` 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 (5 lines × 2) skills/last30days/scripts/lib/ui.py:552— skills/last30days/scripts/lib/ui.py:552-556 | skills/last30days/scripts/lib/ui.py:559-563 — 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.
Swallowed exception (empty catch) skills/last30days/scripts/last30days.py:4637— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/subproc.py:280— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/setup_wizard.py:1257— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/setup_wizard.py:1432— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/github.py:1370— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/chrome_cookies.py:199— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/chrome_cookies.py:251— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) skills/last30days/scripts/lib/chrome_cookies.py:328— 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.
Duplicated block (8 lines × 2) skills/last30days/scripts/last30days.py:977— skills/last30days/scripts/last30days.py:977-984 | skills/last30days/scripts/last30days.py:4086-4093 — 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) skills/last30days/scripts/lib/bird_x.py:583— skills/last30days/scripts/lib/bird_x.py:583-590 | skills/last30days/scripts/lib/bird_x.py:611-618 — 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) skills/last30days/scripts/lib/pipeline.py:607— skills/last30days/scripts/lib/pipeline.py:607-614 | skills/last30days/scripts/lib/reddit_listing.py:74-81 — 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 (8 lines × 2) skills/last30days/scripts/lib/reddit.py:552— skills/last30days/scripts/lib/reddit.py:552-559 | skills/last30days/scripts/lib/reddit.py:598-605 — 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) skills/last30days/scripts/lib/reddit.py:728— skills/last30days/scripts/lib/reddit.py:728-735 | skills/last30days/scripts/lib/reddit_enrich.py:290-297 — 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 (8 lines × 2) skills/last30days/scripts/lib/render.py:2979— skills/last30days/scripts/lib/render.py:2979-2986 | skills/last30days/scripts/lib/render.py:3000-3007 — 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) skills/last30days/scripts/lib/corpus.py:432— skills/last30days/scripts/lib/corpus.py:432-439 | skills/last30days/scripts/lib/library_index.py:412-419 — 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) skills/last30days/scripts/lib/bird_x.py:697— skills/last30days/scripts/lib/bird_x.py:697-702 | skills/last30days/scripts/lib/bird_x.py:791-796 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/last30days/scripts/lib/bird_x.py:797` calls `strip` and `skills/last30days/scripts/lib/bird_x.py:706` 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 × 2) skills/last30days/scripts/lib/brightdata.py:258— skills/last30days/scripts/lib/brightdata.py:258-263 | skills/last30days/scripts/lib/techmeme.py:127-132 — 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, `skills/last30days/scripts/lib/techmeme.py:135` calls `strip`, `startswith` and `skills/last30days/scripts/lib/brightdata.py:264` 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 × 2) skills/last30days/scripts/lib/freshness.py:513— skills/last30days/scripts/lib/freshness.py:513-519 | skills/last30days/scripts/lib/freshness.py:569-574 — 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 `skills/last30days/scripts/lib/freshness.py:513` 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 (6 lines × 2) skills/last30days/scripts/lib/normalize.py:557— skills/last30days/scripts/lib/normalize.py:557-562 | skills/last30days/scripts/lib/normalize.py:599-604 — 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) skills/last30days/scripts/lib/normalize.py:872— skills/last30days/scripts/lib/normalize.py:872-877 | skills/last30days/scripts/lib/normalize.py:937-942 — 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) skills/last30days/scripts/lib/rerank.py:1177— skills/last30days/scripts/lib/rerank.py:1177-1183 | skills/last30days/scripts/lib/rerank.py:1207-1212 — 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 `skills/last30days/scripts/lib/rerank.py:1177` 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 × 2) skills/last30days/scripts/lib/reddit_listing.py:90— skills/last30days/scripts/lib/reddit_listing.py:90-95 | skills/last30days/scripts/lib/reddit_shreddit.py:109-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 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 `value` to `Optional[str]` in one and `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.
Repeated repair: skills/last30days/scripts/lib/xurl_x.py skills/last30days/scripts/lib/xurl_x.py:164— skills/last30days/scripts/lib/xurl_x.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 11 (its worst body is xurl_x.stored_auth_status at line 164), 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(x): sanitize the xurl search query and name invalid-request failures (#1179)”; “fix(pipeline): bound X-chain and stream waits with deadlines (#1165)”; “fix: account for watchlist spending before scheduling more topics (#1214)”; “fix(xurl): recognize the ~/.xurl/auth.yml directory layout (#1027)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/xurl_x.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: skills/last30days/scripts/store.py skills/last30days/scripts/store.py:1293— skills/last30days/scripts/store.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 14 (its worst body is store.findings_from_report at line 1293), 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: resolve 20 repository review findings (#1326)”; “fix: account for watchlist spending before scheduling more topics (#1214)”; “fix: preserve shared research when removing watchlist topics (#1207)”; “fix: preserve watchlist settings when saving research (#1206)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/store.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: skills/last30days/scripts/lib/hackernews.py skills/last30days/scripts/lib/hackernews.py:247— skills/last30days/scripts/lib/hackernews.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 10 (its worst body is hackernews.parse_hackernews_response at line 247), 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(hackernews): order top comments by HN kids, not Algolia id order (#1288)”; “fix(hackernews): link HN comment quotes to the comment, not the article (#1259)”; “fix(hackernews): attach top comments by calling enrich_top_stories (#1170)”; “fix(hackernews): stop dropping every HN comment on an unmeetable score floor (#890)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/hackernews.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: mcp/internal/tools/research.go mcp/internal/tools/research.go:57— mcp/internal/tools/research.go changed 4 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 tools.makeResearchHandler at line 57), 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: resolve 20 repository review findings (#1326)”; “fix(planner): enforce host plan gate before live diagnostics (#1244)”; “fix(mcp): separate topic from engine flags (#1162)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- mcp/internal/tools/research.go`: 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: skills/last30days/scripts/lib/xquik.py skills/last30days/scripts/lib/xquik.py:136— skills/last30days/scripts/lib/xquik.py changed 4 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 13 (its worst body is xquik._execute_search at line 136), 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: resolve 20 repository review findings (#1326)”; “fix(pipeline): bound X-chain and stream waits with deadlines (#1165)”; “fix(x): report handle-lane failures instead of silent no-results (#1116)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/xquik.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: skills/last30days/scripts/lib/transcribe.py skills/last30days/scripts/lib/transcribe.py:59— skills/last30days/scripts/lib/transcribe.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 10 (its worst body is transcribe.transcribe_media at line 59), 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(http): strip credentials from direct request redirects (#1154)”; “fix: account for watchlist spending before scheduling more topics (#1214)”; “fix(transcribe): send the skill User-Agent in _post_audio so Groq's Cloudflare edge stops returning 403 (#983) (#1036)”. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 21:28:07 -04:00' --until='2026-10-22 21:28:07 -04:00' --full-history --no-merges -- skills/last30days/scripts/lib/transcribe.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 (7 lines × 2) skills/last30days/scripts/lib/bird_x.py:572— skills/last30days/scripts/lib/bird_x.py:572-578 | skills/last30days/scripts/lib/bird_x.py:585-591 — 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) skills/last30days/scripts/lib/instagram.py:483— skills/last30days/scripts/lib/instagram.py:483-489 | skills/last30days/scripts/lib/instagram.py:879-885 — 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) skills/last30days/scripts/lib/jobs.py:293— skills/last30days/scripts/lib/jobs.py:293-299 | skills/last30days/scripts/lib/jobs.py:372-378 — 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) skills/last30days/scripts/lib/youtube_yt.py:800— skills/last30days/scripts/lib/youtube_yt.py:800-806 | skills/last30days/scripts/lib/youtube_yt.py:864-870 — 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 (10 lines × 2) skills/last30days/scripts/lib/reddit.py:350— skills/last30days/scripts/lib/reddit.py:350-359 | skills/last30days/scripts/lib/reddit.py:431-440 — 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 `skills/last30days/scripts/lib/reddit.py:350` 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) skills/last30days/scripts/lib/tiktok.py:511— skills/last30days/scripts/lib/tiktok.py:511-520 | skills/last30days/scripts/lib/youtube_yt.py:1538-1547 — 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) skills/last30days/scripts/store.py:526— skills/last30days/scripts/store.py:526-535 | skills/last30days/scripts/store.py:893-902 — 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 × 3) skills/last30days/scripts/lib/normalize.py:342— skills/last30days/scripts/lib/normalize.py:342-346 | skills/last30days/scripts/lib/normalize.py:371-375 | skills/last30days/scripts/lib/normalize.py:1068-1072 — 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) skills/last30days/scripts/lib/normalize.py:526— skills/last30days/scripts/lib/normalize.py:526-530 | skills/last30days/scripts/lib/normalize.py:672-676 | skills/last30days/scripts/lib/normalize.py:877-881 — 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) skills/last30days/scripts/lib/normalize.py:551— skills/last30days/scripts/lib/normalize.py:551-555 | skills/last30days/scripts/lib/normalize.py:591-597 | skills/last30days/scripts/lib/normalize.py:933-937 — 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 `skills/last30days/scripts/lib/normalize.py:551` 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.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×3
Recursive walk over a caller-supplied document has no depth cap skills/last30days/scripts/lib/schema.py:19— `to_dict` is public, takes a document from its caller (line 462) and hands it to `_drop_none`, which calls itself at line 19 (`_drop_none`) with a piece of `value` (and at line 24) — and nowhere in `_drop_none` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_drop_none` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/last30days/scripts/lib/http.py:203— `request` is public, takes a document from its caller (line 771) and hands it to `_scrub_fixture_value`, which calls itself at line 203 (`_scrub_fixture_value`) with a piece of `value` (and at line 211) — and nowhere in `_scrub_fixture_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_scrub_fixture_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/last30days/scripts/lib/http.py:237— `request` is public, takes a document from its caller (line 771) and hands it to `_collect_secret_values`, which calls itself at line 237 (`_collect_secret_values`) with a piece of `value` (and at line 240) — and nowhere in `_collect_secret_values` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_collect_secret_values` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Change coupling: instagram.py ↔ tiktok.py skills/last30days/scripts/lib/instagram.py:1— `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `cb44afeb` fix: guard all .get(key, 0) patterns that can return None (7 files, 1…; `5c4fe1ed` fix: isolate ScrapeCreators transcript HTTP errors from pipeline fail…; `9fff90b6` refactor(query): extract SOCIAL_NOISE and VIRAL_NOISE shared sets (#437) — run `git show` on any of them.
Change coupling: dedupe.py ↔ normalize.py skills/last30days/scripts/lib/dedupe.py:1— `skills/last30days/scripts/lib/dedupe.py` and `skills/last30days/scripts/lib/normalize.py` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `b1b9b8a7` fix: refine hiring signals job-source behavior; `b38703e5` feat(truthsocial): Add Truth Social as opt-in source (at that commit the files were still `scripts/lib/dedupe.py` and `scripts/lib/normalize.py`); `9a1059ee` feat(bluesky): add Bluesky/AT Protocol as social source (at that commit the files were still `scripts/lib/dedupe.py` and `scripts/lib/normalize.py`) — run `git show` on any of them.
Duplicated block (18–19 lines × 2) skills/last30days/scripts/lib/normalize.py:649— skills/last30days/scripts/lib/normalize.py:649-667 | skills/last30days/scripts/lib/normalize.py:696-713 — 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 `skills/last30days/scripts/lib/normalize.py:649` 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 (18–19 lines × 2) skills/last30days/scripts/lib/render.py:801— skills/last30days/scripts/lib/render.py:801-819 | skills/last30days/scripts/lib/render.py:2148-2165 — 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) skills/last30days/scripts/lib/cookie_extract.py:404— skills/last30days/scripts/lib/cookie_extract.py:404-419 | skills/last30days/scripts/lib/cookie_extract.py:595-610 — 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) skills/last30days/scripts/lib/tiktok.py:522— skills/last30days/scripts/lib/tiktok.py:522-537 | skills/last30days/scripts/lib/youtube_yt.py:1549-1564 — 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) skills/last30days/scripts/lib/instagram.py:689— skills/last30days/scripts/lib/instagram.py:689-701 | skills/last30days/scripts/lib/tiktok.py:353-365 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 `skills/last30days/scripts/lib/instagram.py:689` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/last30days/scripts/lib/instagram.py:687` calls `_budget_expired` and `skills/last30days/scripts/lib/tiktok.py:352` 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 × 2) skills/last30days/scripts/lib/rerank.py:453— skills/last30days/scripts/lib/rerank.py:453-465 | skills/last30days/scripts/lib/rerank.py:1216-1228 — 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–12 lines × 2) skills/last30days/scripts/lib/bird_x.py:718— skills/last30days/scripts/lib/bird_x.py:718-729 | skills/last30days/scripts/lib/bird_x.py:816-826 — 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–12 lines × 2) skills/last30days/scripts/lib/instagram.py:710— skills/last30days/scripts/lib/instagram.py:710-721 | skills/last30days/scripts/lib/tiktok.py:374-384 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 `skills/last30days/scripts/lib/instagram.py:710` 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 (9–11 lines × 2) skills/last30days/scripts/last30days.py:1800— skills/last30days/scripts/last30days.py:1800-1808 | skills/last30days/scripts/lib/hosted.py:229-239 — 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 `skills/last30days/scripts/lib/hosted.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. 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 (9–11 lines × 2) skills/last30days/scripts/lib/reddit.py:747— skills/last30days/scripts/lib/reddit.py:747-755 | skills/last30days/scripts/lib/reddit_enrich.py:180-190 — 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 (10–11 lines × 2) skills/last30days/scripts/lib/normalize.py:717— skills/last30days/scripts/lib/normalize.py:717-727 | skills/last30days/scripts/lib/normalize.py:753-762 — 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 `skills/last30days/scripts/lib/normalize.py:717` 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–11 lines × 2) skills/last30days/scripts/lib/tiktok.py:194— skills/last30days/scripts/lib/tiktok.py:194-204 | skills/last30days/scripts/lib/tiktok.py:228-237 — 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 `skills/last30days/scripts/lib/tiktok.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. 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 (10 lines × 3) skills/last30days/scripts/lib/github.py:632— skills/last30days/scripts/lib/github.py:632-641 | skills/last30days/scripts/lib/github.py:645-654 | skills/last30days/scripts/lib/github.py:658-667 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/last30days/scripts/lib/github.py:642` calls `get` and `skills/last30days/scripts/lib/github.py:657` 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 (10 lines × 3) skills/last30days/scripts/lib/instagram.py:618— skills/last30days/scripts/lib/instagram.py:618-627 | skills/last30days/scripts/lib/threads.py:188-197 | skills/last30days/scripts/lib/tiktok.py:298-307 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 after the matched lines, `skills/last30days/scripts/lib/instagram.py:628` calls `_budget_expired` and `skills/last30days/scripts/lib/tiktok.py:308` 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) skills/last30days/scripts/lib/pipeline.py:5018— skills/last30days/scripts/lib/pipeline.py:5018-5026 | skills/last30days/scripts/lib/pipeline.py:5044-5052 — 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) skills/last30days/scripts/lib/planner.py:730— skills/last30days/scripts/lib/planner.py:730-738 | skills/last30days/scripts/lib/planner.py:740-748 — 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 `skills/last30days/scripts/lib/planner.py:730` 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.
last30days._main (cyclomatic 261) skills/last30days/scripts/last30days.py:3418— last30days._main has cyclomatic complexity 261 (threshold 15). To reduce it, separate the cases: extract each independent 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.run (cyclomatic 187) skills/last30days/scripts/lib/pipeline.py:2217— pipeline.run has cyclomatic complexity 187 (threshold 15). To reduce it, separate the cases: extract each independent 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._retrieve_stream_impl (cyclomatic 151) skills/last30days/scripts/lib/pipeline.py:5653— pipeline._retrieve_stream_impl has cyclomatic complexity 151 (threshold 15). To reduce it, separate the cases: extract each independent 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._run_supplemental_searches (cyclomatic 76) skills/last30days/scripts/lib/pipeline.py:4350— pipeline._run_supplemental_searches has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent 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.available_sources (cyclomatic 70) skills/last30days/scripts/lib/pipeline.py:345— pipeline.available_sources has cyclomatic complexity 70 (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.
x_envelope.read (cyclomatic 70) skills/last30days/scripts/lib/x_envelope.py:416— x_envelope.read has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
subproc.run_with_timeout (cyclomatic 65) skills/last30days/scripts/lib/subproc.py:165— subproc.run_with_timeout has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
polymarket.parse_polymarket_response (cyclomatic 58) skills/last30days/scripts/lib/polymarket.py:685— polymarket.parse_polymarket_response has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
http.request (cyclomatic 55) skills/last30days/scripts/lib/http.py:771— http.request 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.
render.render_full (cyclomatic 48) skills/last30days/scripts/lib/render.py:1810— render.render_full 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.
env.get_config (cyclomatic 45) skills/last30days/scripts/lib/env.py:547— env.get_config has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pipeline._fetch_youtube_stream_live (cyclomatic 45) skills/last30days/scripts/lib/pipeline.py:5512— pipeline._fetch_youtube_stream_live has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
quality_nudge._build_nudge_text (cyclomatic 45) skills/last30days/scripts/lib/quality_nudge.py:325— quality_nudge._build_nudge_text has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
render._render_hiring_signals (cyclomatic 44) skills/last30days/scripts/lib/render.py:2304— render._render_hiring_signals has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
planner._sanitize_plan (cyclomatic 42) skills/last30days/scripts/lib/planner.py:481— planner._sanitize_plan 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.
render._meta_ads_footer_line (cyclomatic 41) skills/last30days/scripts/lib/render.py:3143— render._meta_ads_footer_line 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.
last30days._run_drill (cyclomatic 40) skills/last30days/scripts/last30days.py:1630— last30days._run_drill has cyclomatic complexity 40 (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.
github.search_github_person (cyclomatic 40) skills/last30days/scripts/lib/github.py:735— github.search_github_person 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.
reddit_arctic.fetch_listings (cyclomatic 37) skills/last30days/scripts/lib/reddit_arctic.py:160— reddit_arctic.fetch_listings 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.
instagram._google_reel_fallback (cyclomatic 36) skills/last30days/scripts/lib/instagram.py:358— instagram._google_reel_fallback 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.
render.render_brief (cyclomatic 36) skills/last30days/scripts/lib/render.py:2140— render.render_brief 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.
x_api.parse_v2_response (cyclomatic 36) skills/last30days/scripts/lib/x_api.py:201— x_api.parse_v2_response 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.
youtube_yt.search_youtube_sc (cyclomatic 36) skills/last30days/scripts/lib/youtube_yt.py:1720— youtube_yt.search_youtube_sc 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.
pipeline._fetch_discovery_source (cyclomatic 35) skills/last30days/scripts/lib/pipeline.py:617— pipeline._fetch_discovery_source 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.
setup_wizard.get_setup_status_text (cyclomatic 35) skills/last30days/scripts/lib/setup_wizard.py:773— setup_wizard.get_setup_status_text has cyclomatic complexity 35 (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.
xai_x.parse_x_response (cyclomatic 35) skills/last30days/scripts/lib/xai_x.py:151— xai_x.parse_x_response 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.
polymarket.refetch_datum (cyclomatic 34) skills/last30days/scripts/lib/polymarket.py:926— polymarket.refetch_datum 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.
render._render_best_takes (cyclomatic 34) skills/last30days/scripts/lib/render.py:3775— render._render_best_takes has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
doctor._x_record (cyclomatic 32) skills/last30days/scripts/lib/doctor.py:461— doctor._x_record 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.
permission_preflight.render_text (cyclomatic 32) skills/last30days/scripts/lib/permission_preflight.py:193— permission_preflight.render_text 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.
linkedin.search_linkedin (cyclomatic 31) skills/last30days/scripts/lib/linkedin.py:161— linkedin.search_linkedin 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.
pipeline._retrieve_stream (cyclomatic 31) skills/last30days/scripts/lib/pipeline.py:5189— pipeline._retrieve_stream 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.
last30days._render_save_and_print (cyclomatic 30) skills/last30days/scripts/last30days.py:2537— last30days._render_save_and_print 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.
doctor.render_text (cyclomatic 30) skills/last30days/scripts/lib/doctor.py:1434— doctor.render_text has cyclomatic complexity 30 (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.
grok_x.search_x (cyclomatic 30) skills/last30days/scripts/lib/grok_x.py:1013— grok_x.search_x 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.
reddit.search_reddit (cyclomatic 30) skills/last30days/scripts/lib/reddit.py:508— reddit.search_reddit has cyclomatic complexity 30 (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.
last30days._load_last_report_cache (cyclomatic 29) skills/last30days/scripts/last30days.py:1397— last30days._load_last_report_cache has cyclomatic complexity 29 (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.
github._person_recent_pushes (cyclomatic 29) skills/last30days/scripts/lib/github.py:986— github._person_recent_pushes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
permission_preflight.build (cyclomatic 29) skills/last30days/scripts/lib/permission_preflight.py:61— permission_preflight.build has cyclomatic complexity 29 (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.
freshness.verify_report (cyclomatic 28) skills/last30days/scripts/lib/freshness.py:430— freshness.verify_report 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.
chrome_cookies._extract_chromium_cookies_macos (cyclomatic 27) skills/last30days/scripts/lib/chrome_cookies.py:204— chrome_cookies._extract_chromium_cookies_macos 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.
normalize._normalize_amazon (cyclomatic 27) skills/last30days/scripts/lib/normalize.py:891— normalize._normalize_amazon has cyclomatic complexity 27 (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.
parallel_mcp.search (cyclomatic 27) skills/last30days/scripts/lib/parallel_mcp.py:127— parallel_mcp.search 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.
pipeline.merge_drill_report (cyclomatic 27) skills/last30days/scripts/lib/pipeline.py:3235— pipeline.merge_drill_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.
trustpilot.parse_trustpilot_response (cyclomatic 27) skills/last30days/scripts/lib/trustpilot.py:465— trustpilot.parse_trustpilot_response has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bird_x.search_x (cyclomatic 26) skills/last30days/scripts/lib/bird_x.py:519— bird_x.search_x 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.
bird_x.parse_bird_response (cyclomatic 26) skills/last30days/scripts/lib/bird_x.py:829— bird_x.parse_bird_response 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.
cluster._merge_entity_clusters (cyclomatic 26) skills/last30days/scripts/lib/cluster.py:135— cluster._merge_entity_clusters 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.
discovery_handoff._parse_bundle_file (cyclomatic 26) skills/last30days/scripts/lib/discovery_handoff.py:446— discovery_handoff._parse_bundle_file has cyclomatic complexity 26 (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.
freshness.extract_claims (cyclomatic 26) skills/last30days/scripts/lib/freshness.py:97— freshness.extract_claims 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.
normalize._normalize_meta_ads (cyclomatic 26) skills/last30days/scripts/lib/normalize.py:765— normalize._normalize_meta_ads has cyclomatic complexity 26 (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.
planner.validate_external_plan (cyclomatic 26) skills/last30days/scripts/lib/planner.py:166— planner.validate_external_plan 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.
render._render_top_comments (cyclomatic 26) skills/last30days/scripts/lib/render.py:3873— render._render_top_comments 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.
ui.show_diagnostic_banner (cyclomatic 26) skills/last30days/scripts/lib/ui.py:505— ui.show_diagnostic_banner 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.
last30days._cache_research_options (cyclomatic 25) skills/last30days/scripts/last30days.py:1461— last30days._cache_research_options 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.
cookie_extract._find_default_profile (cyclomatic 25) skills/last30days/scripts/lib/cookie_extract.py:138— cookie_extract._find_default_profile 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.
render._render_candidate (cyclomatic 25) skills/last30days/scripts/lib/render.py:2410— render._render_candidate 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.
render._build_source_footer_lines (cyclomatic 25) skills/last30days/scripts/lib/render.py:2930— render._build_source_footer_lines 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.
setup_wizard.run_auto_setup (cyclomatic 25) skills/last30days/scripts/lib/setup_wizard.py:72— setup_wizard.run_auto_setup 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.
x_envelope._ingest_row (cyclomatic 25) skills/last30days/scripts/lib/x_envelope.py:647— x_envelope._ingest_row 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.
pipeline.run_discover_resume (cyclomatic 24) skills/last30days/scripts/lib/pipeline.py:1837— pipeline.run_discover_resume 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.
pipeline._load_library_context (cyclomatic 24) skills/last30days/scripts/lib/pipeline.py:2133— pipeline._load_library_context 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.
pipeline._finalize_items_by_source (cyclomatic 24) skills/last30days/scripts/lib/pipeline.py:3629— pipeline._finalize_items_by_source 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.
schema.without_sources (cyclomatic 24) skills/last30days/scripts/lib/schema.py:698— schema.without_sources 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.
backends._resolve_alternative (cyclomatic 23) skills/last30days/scripts/lib/backends.py:660— backends._resolve_alternative 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.
grok_x.parse_x_response (cyclomatic 23) skills/last30days/scripts/lib/grok_x.py:664— grok_x.parse_x_response 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.
html_render._markdown_to_html (cyclomatic 23) skills/last30days/scripts/lib/html_render.py:587— html_render._markdown_to_html 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.
instagram.search_instagram (cyclomatic 23) skills/last30days/scripts/lib/instagram.py:504— instagram.search_instagram 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.
pipeline.nominate_topic_pool (cyclomatic 23) skills/last30days/scripts/lib/pipeline.py:973— pipeline.nominate_topic_pool 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.
pipeline._retry_thin_sources (cyclomatic 23) skills/last30days/scripts/lib/pipeline.py:4878— pipeline._retry_thin_sources 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.
youtube_yt.search_youtube (cyclomatic 23) skills/last30days/scripts/lib/youtube_yt.py:598— youtube_yt.search_youtube 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.
amazon.enrich_source_items (cyclomatic 22) skills/last30days/scripts/lib/amazon.py:645— amazon.enrich_source_items 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.
arxiv.parse_arxiv_response (cyclomatic 22) skills/last30days/scripts/lib/arxiv.py:255— arxiv.parse_arxiv_response 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.
doctor.render_postmortem_text (cyclomatic 22) skills/last30days/scripts/lib/doctor.py:1575— doctor.render_postmortem_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.
github.parse_github_response (cyclomatic 22) skills/last30days/scripts/lib/github.py:394— github.parse_github_response 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.
pipeline._fetch_x_backend (cyclomatic 22) skills/last30days/scripts/lib/pipeline.py:5055— pipeline._fetch_x_backend 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.
pipeline._serve_envelope_lanes (cyclomatic 22) skills/last30days/scripts/lib/pipeline.py:5314— pipeline._serve_envelope_lanes 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.
planner._trim_subqueries_for_depth (cyclomatic 22) skills/last30days/scripts/lib/planner.py:610— planner._trim_subqueries_for_depth 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.
reddit.enrich_with_comments (cyclomatic 22) skills/last30days/scripts/lib/reddit.py:654— reddit.enrich_with_comments 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.
render.render_compact (cyclomatic 22) skills/last30days/scripts/lib/render.py:793— render.render_compact 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.
x_api._search_pages (cyclomatic 22) skills/last30days/scripts/lib/x_api.py:511— x_api._search_pages 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.
xiaohongshu_api.search_feeds (cyclomatic 22) skills/last30days/scripts/lib/xiaohongshu_api.py:67— xiaohongshu_api.search_feeds 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.
corpus.search (cyclomatic 21) skills/last30days/scripts/lib/corpus.py:81— corpus.search 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.
env.extract_browser_credentials (cyclomatic 21) skills/last30days/scripts/lib/env.py:1154— env.extract_browser_credentials 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.
fusion.weighted_rrf (cyclomatic 21) skills/last30days/scripts/lib/fusion.py:368— fusion.weighted_rrf 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.
grok_x._fields_from_json_obj (cyclomatic 21) skills/last30days/scripts/lib/grok_x.py:503— grok_x._fields_from_json_obj 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.
instagram.search_and_enrich (cyclomatic 21) skills/last30days/scripts/lib/instagram.py:724— instagram.search_and_enrich 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.
linkedin.parse_linkedin_response (cyclomatic 21) skills/last30days/scripts/lib/linkedin.py:376— linkedin.parse_linkedin_response 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.
meta_ads.search_meta_ads (cyclomatic 21) skills/last30days/scripts/lib/meta_ads.py:876— meta_ads.search_meta_ads 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.
planner._fallback_plan (cyclomatic 21) skills/last30days/scripts/lib/planner.py:690— planner._fallback_plan 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.
quality_nudge.compute_quality_score (cyclomatic 21) skills/last30days/scripts/lib/quality_nudge.py:204— quality_nudge.compute_quality_score 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.
stocktwits.parse_stocktwits_response (cyclomatic 21) skills/last30days/scripts/lib/stocktwits.py:239— stocktwits.parse_stocktwits_response 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.
threads._parse_items (cyclomatic 21) skills/last30days/scripts/lib/threads.py:62— threads._parse_items 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.
tiktok.search_and_enrich (cyclomatic 21) skills/last30days/scripts/lib/tiktok.py:387— tiktok.search_and_enrich 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.
last30days.save_output (cyclomatic 20) skills/last30days/scripts/last30days.py:322— last30days.save_output 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.
devto.search_devto (cyclomatic 20) skills/last30days/scripts/lib/devto.py:215— devto.search_devto 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.
doctor._chained_record (cyclomatic 20) skills/last30days/scripts/lib/doctor.py:308— doctor._chained_record 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.
fusion.merge_source_items (cyclomatic 20) skills/last30days/scripts/lib/fusion.py:78— fusion.merge_source_items 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.
instagram._normalize_google_post (cyclomatic 20) skills/last30days/scripts/lib/instagram.py:321— instagram._normalize_google_post has cyclomatic complexity 20 (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.
normalize._normalize_jobs (cyclomatic 20) skills/last30days/scripts/lib/normalize.py:380— normalize._normalize_jobs has cyclomatic complexity 20 (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.
perplexity.search (cyclomatic 20) skills/last30days/scripts/lib/perplexity.py:1229— perplexity.search 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.
planner.build_drill_plan (cyclomatic 20) skills/last30days/scripts/lib/planner.py:269— planner.build_drill_plan 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.
reddit_listing.fetch_discovery_listings (cyclomatic 20) skills/last30days/scripts/lib/reddit_listing.py:281— reddit_listing.fetch_discovery_listings 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.
render._amazon_footer_line (cyclomatic 20) skills/last30days/scripts/lib/render.py:3018— render._amazon_footer_line 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.
topic_shape._entity_phrase (cyclomatic 20) skills/last30days/scripts/lib/topic_shape.py:271— topic_shape._entity_phrase 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.
youtube_yt._fetch_transcript_ytdlp (cyclomatic 20) skills/last30days/scripts/lib/youtube_yt.py:1016— youtube_yt._fetch_transcript_ytdlp 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.
last30days.subrun_kwargs_for (cyclomatic 19) skills/last30days/scripts/last30days.py:1021— last30days.subrun_kwargs_for 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.
dripstack.parse_dripstack_response (cyclomatic 19) skills/last30days/scripts/lib/dripstack.py:108— dripstack.parse_dripstack_response has cyclomatic complexity 19 (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.
github.search_github (cyclomatic 19) skills/last30days/scripts/lib/github.py:247— github.search_github 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.
jobs.parse_workable_response (cyclomatic 19) skills/last30days/scripts/lib/jobs.py:341— jobs.parse_workable_response has cyclomatic complexity 19 (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.
jobs._greenhouse_job_to_item (cyclomatic 19) skills/last30days/scripts/lib/jobs.py:581— jobs._greenhouse_job_to_item has cyclomatic complexity 19 (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.
perplexity._poll_agent_background (cyclomatic 19) skills/last30days/scripts/lib/perplexity.py:679— perplexity._poll_agent_background 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.
reddit_keyless._discover (cyclomatic 19) skills/last30days/scripts/lib/reddit_keyless.py:116— reddit_keyless._discover 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.
rerank._candidate_haystack (cyclomatic 19) skills/last30days/scripts/lib/rerank.py:800— rerank._candidate_haystack has cyclomatic complexity 19 (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.
trustpilot.search_trustpilot (cyclomatic 19) skills/last30days/scripts/lib/trustpilot.py:380— trustpilot.search_trustpilot 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.
cookie_extract._try_firefox_dir (cyclomatic 18) skills/last30days/scripts/lib/cookie_extract.py:315— cookie_extract._try_firefox_dir 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.
digg.parse_digg_response (cyclomatic 18) skills/last30days/scripts/lib/digg.py:336— digg.parse_digg_response 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.
env.get_x_source_status (cyclomatic 18) skills/last30days/scripts/lib/env.py:1907— env.get_x_source_status 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.
instagram.fetch_captions (cyclomatic 18) skills/last30days/scripts/lib/instagram.py:633— instagram.fetch_captions 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._apply_reddit_stream_keepers (cyclomatic 18) skills/last30days/scripts/lib/pipeline.py:3438— pipeline._apply_reddit_stream_keepers 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.
providers.resolve_runtime (cyclomatic 18) skills/last30days/scripts/lib/providers.py:456— providers.resolve_runtime 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.
providers.extract_openai_text (cyclomatic 18) skills/last30days/scripts/lib/providers.py:579— providers.extract_openai_text 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.
reddit_arctic.fetch_scores (cyclomatic 18) skills/last30days/scripts/lib/reddit_arctic.py:56— reddit_arctic.fetch_scores 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.
render.render_context (cyclomatic 18) skills/last30days/scripts/lib/render.py:2057— render.render_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.
schema.report_from_dict (cyclomatic 18) skills/last30days/scripts/lib/schema.py:581— schema.report_from_dict has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
x_api._run_handle_lanes (cyclomatic 18) skills/last30days/scripts/lib/x_api.py:700— x_api._run_handle_lanes has cyclomatic complexity 18 (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.
youtube_yt._fetch_transcript_direct (cyclomatic 18) skills/last30days/scripts/lib/youtube_yt.py:773— youtube_yt._fetch_transcript_direct 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.
last30days._run_library_feed (cyclomatic 17) skills/last30days/scripts/last30days.py:3110— last30days._run_library_feed 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.
amazon.parse_search_response (cyclomatic 17) skills/last30days/scripts/lib/amazon.py:289— amazon.parse_search_response 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.
amazon.select_enrichment_targets (cyclomatic 17) skills/last30days/scripts/lib/amazon.py:408— amazon.select_enrichment_targets 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.
bird_x._run_bird_search (cyclomatic 17) skills/last30days/scripts/lib/bird_x.py:378— bird_x._run_bird_search 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.
bluesky.parse_bluesky_response (cyclomatic 17) skills/last30days/scripts/lib/bluesky.py:366— bluesky.parse_bluesky_response 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.
_WSConn.recv_message (cyclomatic 17) skills/last30days/scripts/lib/chrome_cdp.py:237— _WSConn.recv_message 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.
doctor.load_run_evidence (cyclomatic 17) skills/last30days/scripts/lib/doctor.py:1046— doctor.load_run_evidence 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.
doctor._probe_source (cyclomatic 17) skills/last30days/scripts/lib/doctor.py:1991— doctor._probe_source 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.
grounding.web_search (cyclomatic 17) skills/last30days/scripts/lib/grounding.py:310— grounding.web_search 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.
library._briefing_public_headline (cyclomatic 17) skills/last30days/scripts/lib/library.py:238— library._briefing_public_headline 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.
normalize.normalize_source_items (cyclomatic 17) skills/last30days/scripts/lib/normalize.py:35— normalize.normalize_source_items 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.
pipeline._floor_survivor_records (cyclomatic 17) skills/last30days/scripts/lib/pipeline.py:1507— pipeline._floor_survivor_records 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.
relevance.token_overlap_relevance (cyclomatic 17) skills/last30days/scripts/lib/relevance.py:134— relevance.token_overlap_relevance 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.
render._render_stats (cyclomatic 17) skills/last30days/scripts/lib/render.py:3340— render._render_stats 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_wizard.write_setup_config (cyclomatic 17) skills/last30days/scripts/lib/setup_wizard.py:624— setup_wizard.write_setup_config 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.
stocktwits.detect_symbols (cyclomatic 17) skills/last30days/scripts/lib/stocktwits.py:94— stocktwits.detect_symbols 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.
stocktwits.refetch_datum (cyclomatic 17) skills/last30days/scripts/lib/stocktwits.py:302— stocktwits.refetch_datum 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.
tiktok._parse_items (cyclomatic 17) skills/last30days/scripts/lib/tiktok.py:116— tiktok._parse_items 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.
trustpilot._select_search_hit (cyclomatic 17) skills/last30days/scripts/lib/trustpilot.py:194— trustpilot._select_search_hit 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.
youtube_yt._fetch_video_comments (cyclomatic 17) skills/last30days/scripts/lib/youtube_yt.py:1639— youtube_yt._fetch_video_comments 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.
chrome_cdp._pair_from_cookies (cyclomatic 16) skills/last30days/scripts/lib/chrome_cdp.py:337— chrome_cdp._pair_from_cookies 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.
devto.parse_devto_response (cyclomatic 16) skills/last30days/scripts/lib/devto.py:298— devto.parse_devto_response 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.
freshness._newer_status_contradiction (cyclomatic 16) skills/last30days/scripts/lib/freshness.py:307— freshness._newer_status_contradiction 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.
grok_x._posts_from_json_value (cyclomatic 16) skills/last30days/scripts/lib/grok_x.py:580— grok_x._posts_from_json_value 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.
jobs.parse_smartrecruiters_response (cyclomatic 16) skills/last30days/scripts/lib/jobs.py:371— jobs.parse_smartrecruiters_response 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.
perplexity._openrouter_sonar_search (cyclomatic 16) skills/last30days/scripts/lib/perplexity.py:1054— perplexity._openrouter_sonar_search 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.
pinterest._parse_items (cyclomatic 16) skills/last30days/scripts/lib/pinterest.py:38— pinterest._parse_items 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.
pipeline.diagnose (cyclomatic 16) skills/last30days/scripts/lib/pipeline.py:2015— pipeline.diagnose 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.
pipeline._legacy_artifact_outcome (cyclomatic 16) skills/last30days/scripts/lib/pipeline.py:4089— pipeline._legacy_artifact_outcome 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.
planner.build_discovery_plan (cyclomatic 16) skills/last30days/scripts/lib/planner.py:23— planner.build_discovery_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.
planner._default_source_weights (cyclomatic 16) skills/last30days/scripts/lib/planner.py:840— planner._default_source_weights 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.
render.render_discovery (cyclomatic 16) skills/last30days/scripts/lib/render.py:107— render.render_discovery 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.
render._render_resolved_entities_block (cyclomatic 16) skills/last30days/scripts/lib/render.py:1546— render._render_resolved_entities_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.
engine.resolvePythonWithCandidates (cyclomatic 16) mcp/internal/engine/python.go:27— engine.resolvePythonWithCandidates 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.
last30days._main (cognitive 366) skills/last30days/scripts/last30days.py:3418— last30days._main has cognitive complexity 366 (threshold 15). Drivers by points: if/else 154 (237 pts), boolean chains 72, ternaries 25 (34 pts), error handling 10 (18 pts), loops 3 (5 pts) (nesting depth added 102). To reduce it, split the body into named stages: move each independent 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._retrieve_stream_impl (cognitive 310) skills/last30days/scripts/lib/pipeline.py:5653— pipeline._retrieve_stream_impl has cognitive complexity 310 (threshold 15). Drivers by points: if/else 80 (193 pts), boolean chains 53, ternaries 12 (45 pts), error handling 4 (10 pts), loops 3 (9 pts) (nesting depth added 158). 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.
pipeline.run (cognitive 303) skills/last30days/scripts/lib/pipeline.py:2217— pipeline.run has cognitive complexity 303 (threshold 15). Drivers by points: if/else 103 (189 pts), boolean chains 61, ternaries 12 (22 pts), loops 14 (21 pts), error handling 4 (10 pts) (nesting depth added 109). To reduce it, split the body into named stages: move each independent 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._run_supplemental_searches (cognitive 134) skills/last30days/scripts/lib/pipeline.py:4350— pipeline._run_supplemental_searches has cognitive complexity 134 (threshold 15). Drivers by points: if/else 47 (94 pts), boolean chains 14, error handling 5 (13 pts), loops 3 (8 pts), ternaries 4 (5 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
polymarket.parse_polymarket_response (cognitive 122) skills/last30days/scripts/lib/polymarket.py:685— polymarket.parse_polymarket_response has cognitive complexity 122 (threshold 15). Drivers by points: if/else 29 (76 pts), boolean chains 17, loops 6 (14 pts), error handling 3 (9 pts), ternaries 3 (6 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
http.request (cognitive 119) skills/last30days/scripts/lib/http.py:771— http.request has cognitive complexity 119 (threshold 15). Drivers by points: if/else 35 (83 pts), error handling 6 (13 pts), boolean chains 11, ternaries 4 (11 pts), loops 1 (nesting depth added 62). To reduce it, split the body into named stages: move each independent 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.render_full (cognitive 108) skills/last30days/scripts/lib/render.py:1810— render.render_full has cognitive complexity 108 (threshold 15). Drivers by points: if/else 25 (62 pts), loops 7 (22 pts), boolean chains 12, ternaries 3 (12 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
subproc.run_with_timeout (cognitive 107) skills/last30days/scripts/lib/subproc.py:165— subproc.run_with_timeout has cognitive complexity 107 (threshold 15). Drivers by points: if/else 27 (50 pts), error handling 14 (30 pts), boolean chains 12, ternaries 8 (10 pts), loops 3 (5 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
x_envelope.read (cognitive 92) skills/last30days/scripts/lib/x_envelope.py:416— x_envelope.read has cognitive complexity 92 (threshold 15). Drivers by points: if/else 36 (58 pts), boolean chains 22, error handling 5, loops 4 (5 pts), ternaries 1 (2 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.
instagram._google_reel_fallback (cognitive 77) skills/last30days/scripts/lib/instagram.py:358— instagram._google_reel_fallback has cognitive complexity 77 (threshold 15). Drivers by points: if/else 16 (43 pts), ternaries 5 (13 pts), loops 5 (9 pts), boolean chains 7, error handling 2 (5 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.
linkedin.search_linkedin (cognitive 77) skills/last30days/scripts/lib/linkedin.py:161— linkedin.search_linkedin has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (50 pts), ternaries 4 (12 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
xai_x.parse_x_response (cognitive 75) skills/last30days/scripts/lib/xai_x.py:151— xai_x.parse_x_response has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (43 pts), ternaries 6 (16 pts), loops 4 (12 pts), boolean chains 3, error handling 1 (nesting depth added 44). 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.
pipeline.available_sources (cognitive 73) skills/last30days/scripts/lib/pipeline.py:345— pipeline.available_sources has cognitive complexity 73 (threshold 15). Drivers by points: boolean chains 38, if/else 31 (35 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
quality_nudge._build_nudge_text (cognitive 73) skills/last30days/scripts/lib/quality_nudge.py:325— quality_nudge._build_nudge_text has cognitive complexity 73 (threshold 15). Drivers by points: if/else 29 (44 pts), ternaries 5 (13 pts), boolean chains 11, loops 3 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
render._render_hiring_signals (cognitive 72) skills/last30days/scripts/lib/render.py:2304— render._render_hiring_signals has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 19, ternaries 5 (15 pts), loops 5 (10 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent 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._fetch_youtube_stream_live (cognitive 68) skills/last30days/scripts/lib/pipeline.py:5512— pipeline._fetch_youtube_stream_live has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 19, ternaries 4 (8 pts), error handling 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
github.search_github_person (cognitive 67) skills/last30days/scripts/lib/github.py:735— github.search_github_person has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 9 (19 pts), loops 8 (13 pts), boolean chains 6, error handling 2 (4 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.
cookie_extract._find_default_profile (cognitive 64) skills/last30days/scripts/lib/cookie_extract.py:138— cookie_extract._find_default_profile has cognitive complexity 64 (threshold 15). Drivers by points: if/else 11 (38 pts), error handling 6 (17 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 41). 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.
reddit_arctic.fetch_listings (cognitive 61) skills/last30days/scripts/lib/reddit_arctic.py:160— reddit_arctic.fetch_listings has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 6 (12 pts), boolean chains 9, loops 6 (9 pts), error handling 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
render.render_brief (cognitive 60) skills/last30days/scripts/lib/render.py:2140— render.render_brief has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 7 (20 pts), loops 6 (10 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.
render._render_best_takes (cognitive 59) skills/last30days/scripts/lib/render.py:3775— render._render_best_takes has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 11 (27 pts), if/else 7 (15 pts), boolean chains 11, loops 3 (6 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.
pipeline._fetch_discovery_source (cognitive 58) skills/last30days/scripts/lib/pipeline.py:617— pipeline._fetch_discovery_source has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 14, loops 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
env.get_config (cognitive 55) skills/last30days/scripts/lib/env.py:547— env.get_config has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 11, ternaries 6 (9 pts), loops 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.
github._person_recent_pushes (cognitive 54) skills/last30days/scripts/lib/github.py:986— github._person_recent_pushes has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 3 (9 pts), loops 6 (8 pts), boolean chains 6, error handling 2 (4 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.
x_api.parse_v2_response (cognitive 54) skills/last30days/scripts/lib/x_api.py:201— x_api.parse_v2_response has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 15, ternaries 2 (3 pts), 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.
planner._sanitize_plan (cognitive 53) skills/last30days/scripts/lib/planner.py:481— planner._sanitize_plan has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 18, 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.
chrome_cookies._extract_chromium_cookies_macos (cognitive 52) skills/last30days/scripts/lib/chrome_cookies.py:204— chrome_cookies._extract_chromium_cookies_macos has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (34 pts), error handling 7 (9 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (nesting depth added 24). 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.
fusion.weighted_rrf (cognitive 52) skills/last30days/scripts/lib/fusion.py:368— fusion.weighted_rrf has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (30 pts), ternaries 6 (17 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
freshness.extract_claims (cognitive 50) skills/last30days/scripts/lib/freshness.py:97— freshness.extract_claims has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 9, ternaries 2 (7 pts), loops 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.
freshness.verify_report (cognitive 50) skills/last30days/scripts/lib/freshness.py:430— freshness.verify_report has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 6, error handling 2 (5 pts), loops 3 (4 pts), ternaries 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.
ui.show_diagnostic_banner (cognitive 50) skills/last30days/scripts/lib/ui.py:505— ui.show_diagnostic_banner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 8, ternaries 1 (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.
youtube_yt.search_youtube_sc (cognitive 50) skills/last30days/scripts/lib/youtube_yt.py:1720— youtube_yt.search_youtube_sc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 18, loops 3 (5 pts), ternaries 2 (4 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.
doctor._x_record (cognitive 49) skills/last30days/scripts/lib/doctor.py:461— doctor._x_record has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 12, 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.
render._meta_ads_footer_line (cognitive 48) skills/last30days/scripts/lib/render.py:3143— render._meta_ads_footer_line has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 20, ternaries 3 (5 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.
cluster._merge_entity_clusters (cognitive 47) skills/last30days/scripts/lib/cluster.py:135— cluster._merge_entity_clusters has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 7 (11 pts), boolean chains 4, ternaries 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.
pipeline._finalize_items_by_source (cognitive 47) skills/last30days/scripts/lib/pipeline.py:3629— pipeline._finalize_items_by_source has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 10, ternaries 2 (7 pts), 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.
corpus.search (cognitive 46) skills/last30days/scripts/lib/corpus.py:81— corpus.search has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), error handling 2 (7 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (3 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.
reddit.enrich_with_comments (cognitive 46) skills/last30days/scripts/lib/reddit.py:654— reddit.enrich_with_comments has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (10 pts), ternaries 2 (6 pts), boolean chains 5, error handling 1 (2 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.
grok_x.search_x (cognitive 45) skills/last30days/scripts/lib/grok_x.py:1013— grok_x.search_x has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 11, loops 3 (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.
html_render._markdown_to_html (cognitive 45) skills/last30days/scripts/lib/html_render.py:587— html_render._markdown_to_html has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (7 pts), ternaries 2 (6 pts), boolean chains 4 (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.
render._build_source_footer_lines (cognitive 45) skills/last30days/scripts/lib/render.py:2930— render._build_source_footer_lines has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 7 (16 pts), boolean chains 4, loops 2 (3 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.
bird_x.parse_bird_response (cognitive 44) skills/last30days/scripts/lib/bird_x.py:829— bird_x.parse_bird_response has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 9, error handling 2 (7 pts), ternaries 3 (5 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.
env.extract_browser_credentials (cognitive 44) skills/last30days/scripts/lib/env.py:1154— env.extract_browser_credentials has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (25 pts), error handling 4 (11 pts), loops 3 (5 pts), 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.
last30days._run_drill (cognitive 43) skills/last30days/scripts/last30days.py:1630— last30days._run_drill has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 12, ternaries 11, error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
last30days._render_save_and_print (cognitive 43) skills/last30days/scripts/last30days.py:2537— last30days._render_save_and_print has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 10, loops 2 (5 pts), ternaries 2 (4 pts), 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.
reddit.search_reddit (cognitive 43) skills/last30days/scripts/lib/reddit.py:508— reddit.search_reddit has cognitive complexity 43 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 12 (15 pts), ternaries 3 (5 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.
planner._trim_subqueries_for_depth (cognitive 42) skills/last30days/scripts/lib/planner.py:610— planner._trim_subqueries_for_depth has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (8 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.
render._render_top_comments (cognitive 42) skills/last30days/scripts/lib/render.py:3873— render._render_top_comments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (10 pts), boolean chains 7, 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.
polymarket.refetch_datum (cognitive 41) skills/last30days/scripts/lib/polymarket.py:926— polymarket.refetch_datum has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 14, ternaries 4 (6 pts), loops 2 (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.
last30days._cache_research_options (cognitive 40) skills/last30days/scripts/last30days.py:1461— last30days._cache_research_options has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 9, error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bird_x.search_x (cognitive 40) skills/last30days/scripts/lib/bird_x.py:519— bird_x.search_x has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), ternaries 5 (7 pts), boolean chains 5 (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.
permission_preflight.render_text (cognitive 40) skills/last30days/scripts/lib/permission_preflight.py:193— permission_preflight.render_text has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 16, loops 3 (5 pts) (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.
pipeline._retrieve_stream (cognitive 40) skills/last30days/scripts/lib/pipeline.py:5189— pipeline._retrieve_stream has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 16, ternaries 1 (3 pts), error handling 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.
parallel_mcp.search (cognitive 39) skills/last30days/scripts/lib/parallel_mcp.py:127— parallel_mcp.search has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, error handling 3 (6 pts), ternaries 3 (6 pts), loops 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.
pipeline.nominate_topic_pool (cognitive 39) skills/last30days/scripts/lib/pipeline.py:973— pipeline.nominate_topic_pool has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 7 (14 pts), loops 5 (6 pts), boolean chains 4 (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.
pipeline.merge_drill_report (cognitive 39) skills/last30days/scripts/lib/pipeline.py:3235— pipeline.merge_drill_report has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 6 (7 pts), boolean chains 5, 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.
setup_wizard.run_auto_setup (cognitive 39) skills/last30days/scripts/lib/setup_wizard.py:72— setup_wizard.run_auto_setup has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (10 pts), boolean chains 5, loops 2 (5 pts), ternaries 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.
grok_x.parse_x_response (cognitive 37) skills/last30days/scripts/lib/grok_x.py:664— grok_x.parse_x_response has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (4 pts), 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.
tiktok.search_and_enrich (cognitive 37) skills/last30days/scripts/lib/tiktok.py:387— tiktok.search_and_enrich has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (14 pts), boolean chains 5 (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.
bird_x._run_bird_search (cognitive 36) skills/last30days/scripts/lib/bird_x.py:378— bird_x._run_bird_search has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 3, error handling 1 (2 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.
instagram.search_and_enrich (cognitive 36) skills/last30days/scripts/lib/instagram.py:724— instagram.search_and_enrich has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (9 pts), ternaries 2 (4 pts), boolean chains 3 (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.
providers.extract_openai_text (cognitive 36) skills/last30days/scripts/lib/providers.py:579— providers.extract_openai_text has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 6, loops 2 (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.
x_api._search_pages (cognitive 36) skills/last30days/scripts/lib/x_api.py:511— x_api._search_pages has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (2 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.
planner.build_drill_plan (cognitive 35) skills/last30days/scripts/lib/planner.py:269— planner.build_drill_plan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 7 (12 pts), boolean chains 4, 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.
pipeline._retry_thin_sources (cognitive 34) skills/last30days/scripts/lib/pipeline.py:4878— pipeline._retry_thin_sources has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (5 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (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.
planner.validate_external_plan (cognitive 34) skills/last30days/scripts/lib/planner.py:166— planner.validate_external_plan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 10, loops 5 (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.
render._render_stats (cognitive 34) skills/last30days/scripts/lib/render.py:3340— render._render_stats has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 6 (14 pts), loops 1 (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.
schema.without_sources (cognitive 34) skills/last30days/scripts/lib/schema.py:698— schema.without_sources has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 4, 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.
youtube_yt._fetch_transcript_ytdlp (cognitive 34) skills/last30days/scripts/lib/youtube_yt.py:1016— youtube_yt._fetch_transcript_ytdlp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 2 (4 pts), ternaries 3 (4 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.
cookie_extract._try_firefox_dir (cognitive 33) skills/last30days/scripts/lib/cookie_extract.py:315— cookie_extract._try_firefox_dir has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 4 (6 pts), boolean chains 1, loops 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.
doctor.render_text (cognitive 33) skills/last30days/scripts/lib/doctor.py:1434— doctor.render_text has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 13, ternaries 3 (4 pts), 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, 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.
instagram.search_instagram (cognitive 33) skills/last30days/scripts/lib/instagram.py:504— instagram.search_instagram has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, error handling 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.
last30days.save_output (cognitive 32) skills/last30days/scripts/last30days.py:322— last30days.save_output has cognitive complexity 32 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 6 (10 pts), ternaries 6 (8 pts), boolean chains 2, loops 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.
permission_preflight.build (cognitive 32) skills/last30days/scripts/lib/permission_preflight.py:61— permission_preflight.build has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 12 (14 pts), loops 1, ternaries 1 (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.
arxiv.parse_arxiv_response (cognitive 31) skills/last30days/scripts/lib/arxiv.py:255— arxiv.parse_arxiv_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, ternaries 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.
devto.search_devto (cognitive 31) skills/last30days/scripts/lib/devto.py:215— devto.search_devto has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 pts), boolean chains 5, error handling 2 (4 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.
instagram.fetch_captions (cognitive 31) skills/last30days/scripts/lib/instagram.py:633— instagram.fetch_captions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, error handling 1 (2 pts), loops 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.
parallel_mcp._read_response (cognitive 31) skills/last30days/scripts/lib/parallel_mcp.py:36— parallel_mcp._read_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
perplexity.search (cognitive 31) skills/last30days/scripts/lib/perplexity.py:1229— perplexity.search has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), error handling 5 (7 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.
pipeline._legacy_artifact_outcome (cognitive 31) skills/last30days/scripts/lib/pipeline.py:4089— pipeline._legacy_artifact_outcome has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (5 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.
render._render_candidate (cognitive 31) skills/last30days/scripts/lib/render.py:2410— render._render_candidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 6 (11 pts), boolean chains 5, 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.
x_api._run_handle_lanes (cognitive 31) skills/last30days/scripts/lib/x_api.py:700— x_api._run_handle_lanes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (11 pts), boolean chains 7 (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.
youtube_yt.search_youtube (cognitive 31) skills/last30days/scripts/lib/youtube_yt.py:598— youtube_yt.search_youtube has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (8 pts), error handling 4 (5 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine.pythonCandidates (cognitive 31) mcp/internal/engine/python.go:93— engine.pythonCandidates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 17). Of this number, 27 points are the body's own statements and 4 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.
last30days._load_last_report_cache (cognitive 30) skills/last30days/scripts/last30days.py:1397— last30days._load_last_report_cache has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 12, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
amazon.enrich_source_items (cognitive 30) skills/last30days/scripts/lib/amazon.py:645— amazon.enrich_source_items has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, loops 3 (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.
doctor._probe_source (cognitive 30) skills/last30days/scripts/lib/doctor.py:1991— doctor._probe_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, error handling 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.
github.search_github (cognitive 30) skills/last30days/scripts/lib/github.py:247— github.search_github has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), ternaries 2 (5 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.
reddit_arctic.fetch_scores (cognitive 30) skills/last30days/scripts/lib/reddit_arctic.py:56— reddit_arctic.fetch_scores has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 2 (5 pts), boolean chains 4, loops 3 (4 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.
discovery_handoff._parse_bundle_file (cognitive 29) skills/last30days/scripts/lib/discovery_handoff.py:446— discovery_handoff._parse_bundle_file has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, if/else 5 (7 pts), error handling 3 (4 pts), 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.
doctor._chained_record (cognitive 29) skills/last30days/scripts/lib/doctor.py:308— doctor._chained_record has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 8 (11 pts), boolean chains 2, 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.
doctor.render_postmortem_text (cognitive 29) skills/last30days/scripts/lib/doctor.py:1575— doctor.render_postmortem_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 3 (5 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.
library._briefing_public_headline (cognitive 29) skills/last30days/scripts/lib/library.py:238— library._briefing_public_headline has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), ternaries 3 (5 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.
pipeline._floor_survivor_records (cognitive 29) skills/last30days/scripts/lib/pipeline.py:1507— pipeline._floor_survivor_records has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 5 (10 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.
pipeline.run_discover_resume (cognitive 29) skills/last30days/scripts/lib/pipeline.py:1837— pipeline.run_discover_resume has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), ternaries 6 (8 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.
reddit_keyless._discover (cognitive 29) skills/last30days/scripts/lib/reddit_keyless.py:116— reddit_keyless._discover has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (7 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.
reddit_listing.fetch_discovery_listings (cognitive 29) skills/last30days/scripts/lib/reddit_listing.py:281— reddit_listing.fetch_discovery_listings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 3 (4 pts), error handling 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.
topic_shape._entity_phrase (cognitive 29) skills/last30days/scripts/lib/topic_shape.py:271— topic_shape._entity_phrase has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 4 (6 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.
backends._resolve_alternative (cognitive 28) skills/last30days/scripts/lib/backends.py:660— backends._resolve_alternative has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, loops 2, 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.
_WSConn.recv_message (cognitive 28) skills/last30days/scripts/lib/chrome_cdp.py:237— _WSConn.recv_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 2 (4 pts), boolean chains 3, 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.
linkedin.parse_linkedin_response (cognitive 28) skills/last30days/scripts/lib/linkedin.py:376— linkedin.parse_linkedin_response has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 10, 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.
pipeline._serve_envelope_lanes (cognitive 28) skills/last30days/scripts/lib/pipeline.py:5314— pipeline._serve_envelope_lanes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, ternaries 3, 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.
render.render_compact (cognitive 28) skills/last30days/scripts/lib/render.py:793— render.render_compact has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), ternaries 3, boolean chains 2 (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.
x_envelope._ingest_row (cognitive 28) skills/last30days/scripts/lib/x_envelope.py:647— x_envelope._ingest_row has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, ternaries 3 (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.
engine.resolvePythonWithCandidates (cognitive 28) mcp/internal/engine/python.go:27— engine.resolvePythonWithCandidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 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.
cookie_extract.extract_firefox_cookies (cognitive 27) skills/last30days/scripts/lib/cookie_extract.py:370— cookie_extract.extract_firefox_cookies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 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.
github.parse_github_response (cognitive 27) skills/last30days/scripts/lib/github.py:394— github.parse_github_response has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, ternaries 4 (8 pts), if/else 5 (7 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.
grok_x._posts_from_json_value (cognitive 27) skills/last30days/scripts/lib/grok_x.py:580— grok_x._posts_from_json_value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (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.
normalize._normalize_amazon (cognitive 27) skills/last30days/scripts/lib/normalize.py:891— normalize._normalize_amazon has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 19, if/else 5, ternaries 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.
perplexity._extract_agent_citations (cognitive 27) skills/last30days/scripts/lib/perplexity.py:521— perplexity._extract_agent_citations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 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.
perplexity._poll_agent_background (cognitive 27) skills/last30days/scripts/lib/perplexity.py:679— perplexity._poll_agent_background has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, error handling 1 (2 pts), 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.
pipeline._load_library_context (cognitive 27) skills/last30days/scripts/lib/pipeline.py:2133— pipeline._load_library_context has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), ternaries 4 (6 pts), loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
planner._fallback_plan (cognitive 27) skills/last30days/scripts/lib/planner.py:690— planner._fallback_plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, 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.
render.render_discovery (cognitive 27) skills/last30days/scripts/lib/render.py:107— render.render_discovery has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (5 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.
rerank._candidate_haystack (cognitive 27) skills/last30days/scripts/lib/rerank.py:800— rerank._candidate_haystack has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 9, loops 4 (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.
rerank._extract_comment_text_scored (cognitive 27) skills/last30days/scripts/lib/rerank.py:1186— rerank._extract_comment_text_scored has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 pts), ternaries 2 (5 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.
setup_wizard.get_setup_status_text (cognitive 27) skills/last30days/scripts/lib/setup_wizard.py:773— setup_wizard.get_setup_status_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (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.
tiktok._parse_items (cognitive 27) skills/last30days/scripts/lib/tiktok.py:116— tiktok._parse_items has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 4 (7 pts), boolean chains 3, 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.
xiaohongshu_api.search_feeds (cognitive 27) skills/last30days/scripts/lib/xiaohongshu_api.py:67— xiaohongshu_api.search_feeds has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (8 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.
cookie_extract._extract_firefox_with_source (cognitive 26) skills/last30days/scripts/lib/cookie_extract.py:572— cookie_extract._extract_firefox_with_source has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 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.
digg.parse_digg_response (cognitive 26) skills/last30days/scripts/lib/digg.py:336— digg.parse_digg_response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 5 (9 pts), boolean chains 6, 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.
env._load_keychain (cognitive 26) skills/last30days/scripts/lib/env.py:368— env._load_keychain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 2 (5 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.
freshness._newer_status_contradiction (cognitive 26) skills/last30days/scripts/lib/freshness.py:307— freshness._newer_status_contradiction has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, 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.
normalize.normalize_source_items (cognitive 26) skills/last30days/scripts/lib/normalize.py:35— normalize.normalize_source_items has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4 (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.
pipeline._apply_reddit_stream_keepers (cognitive 26) skills/last30days/scripts/lib/pipeline.py:3438— pipeline._apply_reddit_stream_keepers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 2 (3 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.
planner._default_source_weights (cognitive 26) skills/last30days/scripts/lib/planner.py:840— planner._default_source_weights has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (10 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.
relevance.token_overlap_relevance (cognitive 26) skills/last30days/scripts/lib/relevance.py:134— relevance.token_overlap_relevance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (5 pts), boolean chains 4, 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.
render._amazon_footer_line (cognitive 26) skills/last30days/scripts/lib/render.py:3018— render._amazon_footer_line has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tiktok.fetch_captions (cognitive 26) skills/last30days/scripts/lib/tiktok.py:311— tiktok.fetch_captions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 1 (2 pts), loops 2, 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.
trustpilot.parse_trustpilot_response (cognitive 26) skills/last30days/scripts/lib/trustpilot.py:465— trustpilot.parse_trustpilot_response has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 8, ternaries 4 (5 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.
chrome_cdp._pair_from_cookies (cognitive 25) skills/last30days/scripts/lib/chrome_cdp.py:337— chrome_cdp._pair_from_cookies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (7 pts), boolean chains 4 (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.
fusion.merge_source_items (cognitive 25) skills/last30days/scripts/lib/fusion.py:78— fusion.merge_source_items has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 10, loops 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.
github.apply_star_map (cognitive 25) skills/last30days/scripts/lib/github.py:1381— github.apply_star_map 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.
meta_ads.search_meta_ads (cognitive 25) skills/last30days/scripts/lib/meta_ads.py:876— meta_ads.search_meta_ads has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalize._normalize_meta_ads (cognitive 25) skills/last30days/scripts/lib/normalize.py:765— normalize._normalize_meta_ads has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 19, if/else 4, ternaries 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.
resolve._extract_official_domain (cognitive 25) skills/last30days/scripts/lib/resolve.py:147— resolve._extract_official_domain has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), ternaries 1 (4 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.
stocktwits.parse_stocktwits_response (cognitive 25) skills/last30days/scripts/lib/stocktwits.py:239— stocktwits.parse_stocktwits_response has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, ternaries 5 (10 pts), loops 1 (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.
grok_x._run_query (cognitive 24) skills/last30days/scripts/lib/grok_x.py:946— grok_x._run_query has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, ternaries 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.
youtube_yt.fetch_transcript (cognitive 24) skills/last30days/scripts/lib/youtube_yt.py:1147— youtube_yt.fetch_transcript has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, 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.
last30days._run_library_feed (cognitive 23) skills/last30days/scripts/last30days.py:3110— last30days._run_library_feed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), loops 3, boolean chains 2, ternaries 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.
arxiv._extract_entries (cognitive 23) skills/last30days/scripts/lib/arxiv.py:144— arxiv._extract_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (23 pts) (nesting depth added 13). 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.
dripstack.parse_dripstack_response (cognitive 23) skills/last30days/scripts/lib/dripstack.py:108— dripstack.parse_dripstack_response has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (5 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
env.get_x_source_status (cognitive 23) skills/last30days/scripts/lib/env.py:1907— env.get_x_source_status has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 2 (3 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.
github.search_github_project (cognitive 23) skills/last30days/scripts/lib/github.py:1189— github.search_github_project has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), ternaries 1 (4 pts), error handling 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.
reddit_search.parse_page (cognitive 23) skills/last30days/scripts/lib/reddit_search.py:129— reddit_search.parse_page has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, if/else 3 (5 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.
render._render_resolved_entities_block (cognitive 23) skills/last30days/scripts/lib/render.py:1546— render._render_resolved_entities_block has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 6, if/else 2 (3 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.
telegram._fetch_channel_posts (cognitive 23) skills/last30days/scripts/lib/telegram.py:175— telegram._fetch_channel_posts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 2 (3 pts), error handling 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.
threads._parse_items (cognitive 23) skills/last30days/scripts/lib/threads.py:62— threads._parse_items has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
trustpilot.search_trustpilot (cognitive 23) skills/last30days/scripts/lib/trustpilot.py:380— trustpilot.search_trustpilot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 9 (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.
last30days.subrun_kwargs_for (cognitive 22) skills/last30days/scripts/last30days.py:1021— last30days.subrun_kwargs_for has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9 (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.
fetch_memo.fetch_once (cognitive 22) skills/last30days/scripts/lib/fetch_memo.py:73— fetch_memo.fetch_once has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, error handling 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
perplexity._output_text (cognitive 22) skills/last30days/scripts/lib/perplexity.py:604— perplexity._output_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 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.
planner._how_to_sources (cognitive 22) skills/last30days/scripts/lib/planner.py:1080— planner._how_to_sources has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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.
polymarket._compute_text_similarity (cognitive 22) skills/last30days/scripts/lib/polymarket.py:613— polymarket._compute_text_similarity has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (8 pts), loops 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.
quality_nudge.compute_quality_score (cognitive 22) skills/last30days/scripts/lib/quality_nudge.py:204— quality_nudge.compute_quality_score has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, ternaries 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.
render.render_context (cognitive 22) skills/last30days/scripts/lib/render.py:2057— render.render_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 2 (3 pts), ternaries 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.
setup_wizard.write_setup_config (cognitive 22) skills/last30days/scripts/lib/setup_wizard.py:624— setup_wizard.write_setup_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 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.
setup_wizard.poll_device_auth (cognitive 22) skills/last30days/scripts/lib/setup_wizard.py:1062— setup_wizard.poll_device_auth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 1, 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.
youtube_yt._fetch_transcript_direct (cognitive 22) skills/last30days/scripts/lib/youtube_yt.py:773— youtube_yt._fetch_transcript_direct has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 3, loops 2 (3 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.
youtube_yt._fetch_video_comments (cognitive 22) skills/last30days/scripts/lib/youtube_yt.py:1639— youtube_yt._fetch_video_comments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 1 (3 pts), 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.
amazon.parse_search_response (cognitive 21) skills/last30days/scripts/lib/amazon.py:289— amazon.parse_search_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chrome_cdp.read_x_cookies (cognitive 21) skills/last30days/scripts/lib/chrome_cdp.py:407— chrome_cdp.read_x_cookies has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 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.
corpus._iter_files (cognitive 21) skills/last30days/scripts/lib/corpus.py:238— corpus._iter_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 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.
doctor.load_run_evidence (cognitive 21) skills/last30days/scripts/lib/doctor.py:1046— doctor.load_run_evidence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 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.
fusion._diversify_pool (cognitive 21) skills/last30days/scripts/lib/fusion.py:288— fusion._diversify_pool has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 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.
jobs.parse_workable_response (cognitive 21) skills/last30days/scripts/lib/jobs.py:341— jobs.parse_workable_response has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (6 pts), ternaries 1 (2 pts), loops 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.
jobs.extract_jsonld_jobs (cognitive 21) skills/last30days/scripts/lib/jobs.py:418— jobs.extract_jsonld_jobs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 2 (3 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.
pipeline._fetch_x_backend (cognitive 21) skills/last30days/scripts/lib/pipeline.py:5055— pipeline._fetch_x_backend has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, ternaries 4 (6 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.
setup_wizard.write_api_key (cognitive 21) skills/last30days/scripts/lib/setup_wizard.py:702— setup_wizard.write_api_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (2 pts), error handling 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.
trustpilot._select_search_hit (cognitive 21) skills/last30days/scripts/lib/trustpilot.py:194— trustpilot._select_search_hit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, error handling 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.
x_judge.judge_x_corpus (cognitive 21) skills/last30days/scripts/lib/x_judge.py:84— x_judge.judge_x_corpus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 2, 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.
youtube_yt.search_and_transcribe (cognitive 21) skills/last30days/scripts/lib/youtube_yt.py:1384— youtube_yt.search_and_transcribe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3 (4 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.
youtube_yt._sc_fetch_transcript (cognitive 21) skills/last30days/scripts/lib/youtube_yt.py:1901— youtube_yt._sc_fetch_transcript has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (2 pts), boolean chains 1, 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.
briefing.generate_daily (cognitive 20) skills/last30days/scripts/briefing.py:32— briefing.generate_daily has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 2 (3 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.
amazon.select_enrichment_targets (cognitive 20) skills/last30days/scripts/lib/amazon.py:408— amazon.select_enrichment_targets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, 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.
dedupe.dedupe_items (cognitive 20) skills/last30days/scripts/lib/dedupe.py:112— dedupe.dedupe_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 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.
doctor._http_ok (cognitive 20) skills/last30days/scripts/lib/doctor.py:1922— doctor._http_ok has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, error handling 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.
grok_x._fields_from_json_obj (cognitive 20) skills/last30days/scripts/lib/grok_x.py:503— grok_x._fields_from_json_obj has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 5, ternaries 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.
instagram._normalize_google_post (cognitive 20) skills/last30days/scripts/lib/instagram.py:321— instagram._normalize_google_post has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (7 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.
jobs.parse_smartrecruiters_response (cognitive 20) skills/last30days/scripts/lib/jobs.py:371— jobs.parse_smartrecruiters_response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pinterest._parse_items (cognitive 20) skills/last30days/scripts/lib/pinterest.py:38— pinterest._parse_items has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), ternaries 2 (4 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.
pipeline._best_community_comment (cognitive 20) skills/last30days/scripts/lib/pipeline.py:1268— pipeline._best_community_comment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts), ternaries 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.
planner.build_discovery_plan (cognitive 20) skills/last30days/scripts/lib/planner.py:23— planner.build_discovery_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 2 (3 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.
providers.resolve_runtime (cognitive 20) skills/last30days/scripts/lib/providers.py:456— providers.resolve_runtime has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), 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.
reddit_public._fetch_json (cognitive 20) skills/last30days/scripts/lib/reddit_public.py:61— reddit_public._fetch_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (6 pts), boolean chains 1, 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.
reddit_public._parse_posts (cognitive 20) skills/last30days/scripts/lib/reddit_public.py:125— reddit_public._parse_posts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 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.
render._render_registered_sections (cognitive 20) skills/last30days/scripts/lib/render.py:704— render._render_registered_sections has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (4 pts), boolean chains 3, 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.
stocktwits.detect_symbols (cognitive 20) skills/last30days/scripts/lib/stocktwits.py:94— stocktwits.detect_symbols has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 3, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stocktwits.refetch_datum (cognitive 20) skills/last30days/scripts/lib/stocktwits.py:302— stocktwits.refetch_datum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, 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.
x_judge.promotable_handles (cognitive 20) skills/last30days/scripts/lib/x_judge.py:169— x_judge.promotable_handles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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.
xquik._execute_search (cognitive 20) skills/last30days/scripts/lib/xquik.py:136— xquik._execute_search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 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.
xquik.search_mentions (cognitive 20) skills/last30days/scripts/lib/xquik.py:281— xquik.search_mentions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
engine.reclaimCacheStages (cognitive 20) mcp/internal/engine/cache_staging.go:45— engine.reclaimCacheStages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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.
bluesky.parse_bluesky_response (cognitive 19) skills/last30days/scripts/lib/bluesky.py:366— bluesky.parse_bluesky_response has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, ternaries 3 (6 pts), loops 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.
cookie_extract.extract_cookies_with_source (cognitive 19) skills/last30days/scripts/lib/cookie_extract.py:618— cookie_extract.extract_cookies_with_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), 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.
devto.parse_devto_response (cognitive 19) skills/last30days/scripts/lib/devto.py:298— devto.parse_devto_response has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
digg.enrich_source_items (cognitive 19) skills/last30days/scripts/lib/digg.py:516— digg.enrich_source_items has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, 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.
env._parse_keychain_aliases (cognitive 19) skills/last30days/scripts/lib/env.py:320— env._parse_keychain_aliases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), ternaries 1 (2 pts), 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.
hosted.run_hosted (cognitive 19) skills/last30days/scripts/lib/hosted.py:268— hosted.run_hosted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 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.
normalize._normalize_jobs (cognitive 19) skills/last30days/scripts/lib/normalize.py:380— normalize._normalize_jobs has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, if/else 1, ternaries 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.
parallel_mcp._search_rows (cognitive 19) skills/last30days/scripts/lib/parallel_mcp.py:108— parallel_mcp._search_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, error handling 1 (2 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.
reddit_enrich.parse_thread_data (cognitive 19) skills/last30days/scripts/lib/reddit_enrich.py:71— reddit_enrich.parse_thread_data has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (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.
render.render_library_search (cognitive 19) skills/last30days/scripts/lib/render.py:325— render.render_library_search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), ternaries 1 (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.
schema.to_agent_export (cognitive 19) skills/last30days/scripts/lib/schema.py:863— schema.to_agent_export has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), loops 3 (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.
store.findings_from_report (cognitive 19) skills/last30days/scripts/store.py:1293— store.findings_from_report has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 5, if/else 2 (5 pts), ternaries 3 (5 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.
last30days.resolve_competitors_args (cognitive 18) skills/last30days/scripts/last30days.py:1166— last30days.resolve_competitors_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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.
amazon.enrich_with_reviews (cognitive 18) skills/last30days/scripts/lib/amazon.py:548— amazon.enrich_with_reviews has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cookie_extract._get_wsl_firefox_profiles_dir (cognitive 18) skills/last30days/scripts/lib/cookie_extract.py:63— cookie_extract._get_wsl_firefox_profiles_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (4 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.
discovery_handoff.build_host_digest (cognitive 18) skills/last30days/scripts/lib/discovery_handoff.py:927— discovery_handoff.build_host_digest has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (5 pts), boolean chains 3, 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.
env.load_env_file (cognitive 18) skills/last30days/scripts/lib/env.py:285— env.load_env_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, 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.
freshness._candidate_star_claims (cognitive 18) skills/last30days/scripts/lib/freshness.py:198— freshness._candidate_star_claims has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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.
github._fetch_top_issues (cognitive 18) skills/last30days/scripts/lib/github.py:626— github._fetch_top_issues has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (7 pts), if/else 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.
github.extract_repo_refs (cognitive 18) skills/last30days/scripts/lib/github.py:1308— github.extract_repo_refs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
instagram._parse_items (cognitive 18) skills/last30days/scripts/lib/instagram.py:205— instagram._parse_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, 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.
jobs._greenhouse_job_to_item (cognitive 18) skills/last30days/scripts/lib/jobs.py:581— jobs._greenhouse_job_to_item has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 13, if/else 3, ternaries 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.
linkedin.parse_profile_articles (cognitive 18) skills/last30days/scripts/lib/linkedin.py:549— linkedin.parse_profile_articles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, 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.
normalize._remap_comments (cognitive 18) skills/last30days/scripts/lib/normalize.py:133— normalize._remap_comments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (2 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.
perplexity._append_citation (cognitive 18) skills/last30days/scripts/lib/perplexity.py:476— perplexity._append_citation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 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.
planner._comparison_entities (cognitive 18) skills/last30days/scripts/lib/planner.py:922— planner._comparison_entities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 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.
reddit_enrich.extract_comment_insights (cognitive 18) skills/last30days/scripts/lib/reddit_enrich.py:147— reddit_enrich.extract_comment_insights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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.
reddit_listing.parse_cards (cognitive 18) skills/last30days/scripts/lib/reddit_listing.py:130— reddit_listing.parse_cards has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, error handling 2 (4 pts), ternaries 2 (4 pts), if/else 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.
reddit_search.search (cognitive 18) skills/last30days/scripts/lib/reddit_search.py:240— reddit_search.search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (5 pts), loops 4, boolean chains 3, error handling 2 (3 pts), 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.
render._polymarket_top_markets (cognitive 18) skills/last30days/scripts/lib/render.py:2556— render._polymarket_top_markets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 2 (4 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.
safari_cookies.extract_safari_cookies_macos (cognitive 18) skills/last30days/scripts/lib/safari_cookies.py:96— safari_cookies.extract_safari_cookies_macos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
safari_cookies._parse_binary_cookies (cognitive 18) skills/last30days/scripts/lib/safari_cookies.py:169— safari_cookies._parse_binary_cookies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), error handling 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.
xquik.search_handles (cognitive 18) skills/last30days/scripts/lib/xquik.py:225— xquik.search_handles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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.
youtube_yt.extract_transcript_highlights (cognitive 18) skills/last30days/scripts/lib/youtube_yt.py:111— youtube_yt.extract_transcript_highlights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, 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.
evaluate_search_quality.build_ranked_items (cognitive 17) skills/last30days/scripts/evaluate_search_quality.py:93— evaluate_search_quality.build_ranked_items has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, loops 3 (5 pts), if/else 2 (4 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
cluster.cluster_candidates (cognitive 17) skills/last30days/scripts/lib/cluster.py:61— cluster.cluster_candidates has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (6 pts), ternaries 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.
dripstack.search_dripstack (cognitive 17) skills/last30days/scripts/lib/dripstack.py:57— dripstack.search_dripstack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 1 (2 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.
env.cookie_extraction_browsers (cognitive 17) skills/last30days/scripts/lib/env.py:1090— env.cookie_extraction_browsers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 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.
github.refetch_datum (cognitive 17) skills/last30days/scripts/lib/github.py:696— github.refetch_datum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 3 (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.
grounding.parallel_search (cognitive 17) skills/last30days/scripts/lib/grounding.py:175— grounding.parallel_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 2 (4 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.
instagram._fetch_post_comments (cognitive 17) skills/last30days/scripts/lib/instagram.py:897— instagram._fetch_post_comments has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
perplexity._agent_result (cognitive 17) skills/last30days/scripts/lib/perplexity.py:875— perplexity._agent_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pipeline.nominate_candidates (cognitive 17) skills/last30days/scripts/lib/pipeline.py:749— pipeline.nominate_candidates has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (4 pts), loops 3 (4 pts), boolean chains 3, if/else 2 (3 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.
polymarket._extract_domain_queries (cognitive 17) skills/last30days/scripts/lib/polymarket.py:380— polymarket._extract_domain_queries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (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.
query.extract_core_subject (cognitive 17) skills/last30days/scripts/lib/query.py:80— query.extract_core_subject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), ternaries 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.
render._render_entity_evidence_block (cognitive 17) skills/last30days/scripts/lib/render.py:1597— render._render_entity_evidence_block has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), ternaries 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.
schema.report_from_dict (cognitive 17) skills/last30days/scripts/lib/schema.py:581— schema.report_from_dict has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, if/else 2, ternaries 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.
techmeme.search_techmeme (cognitive 17) skills/last30days/scripts/lib/techmeme.py:146— techmeme.search_techmeme has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 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.
x_api._run_search (cognitive 17) skills/last30days/scripts/lib/x_api.py:572— x_api._run_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 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.
youtube_yt.fetch_transcripts_parallel (cognitive 17) skills/last30days/scripts/lib/youtube_yt.py:1233— youtube_yt.fetch_transcripts_parallel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 2 (4 pts), loops 2 (3 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.
youtube_yt.backfill_transcripts (cognitive 17) skills/last30days/scripts/lib/youtube_yt.py:1304— youtube_yt.backfill_transcripts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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.
last30days._validate_extra_argv (cognitive 16) skills/last30days/scripts/last30days.py:3034— last30days._validate_extra_argv has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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.
bluesky.search_bluesky (cognitive 16) skills/last30days/scripts/lib/bluesky.py:253— bluesky.search_bluesky has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 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.
doctor.build_report (cognitive 16) skills/last30days/scripts/lib/doctor.py:1231— doctor.build_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), error handling 2 (3 pts), loops 3, ternaries 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.
grok_x._extract_json_values (cognitive 16) skills/last30days/scripts/lib/grok_x.py:546— grok_x._extract_json_values has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (5 pts), boolean chains 2, 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.
grok_x.search_handles (cognitive 16) skills/last30days/scripts/lib/grok_x.py:1103— grok_x.search_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, 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.
grounding.web_search (cognitive 16) skills/last30days/scripts/lib/grounding.py:310— grounding.web_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, 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.
grounding._enrich_reddit_items (cognitive 16) skills/last30days/scripts/lib/grounding.py:375— grounding._enrich_reddit_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (4 pts), boolean chains 3, 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.
jobs.search_jobs (cognitive 16) skills/last30days/scripts/lib/jobs.py:54— jobs.search_jobs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 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.
pipeline._disambiguated_topic_name (cognitive 16) skills/last30days/scripts/lib/pipeline.py:908— pipeline._disambiguated_topic_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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.
polymarket._run_queries_parallel (cognitive 16) skills/last30days/scripts/lib/polymarket.py:450— polymarket._run_queries_parallel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), error handling 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.
reddit_keyless.search_and_enrich (cognitive 16) skills/last30days/scripts/lib/reddit_keyless.py:319— reddit_keyless.search_and_enrich has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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.
render._top_voices_footer_line (cognitive 16) skills/last30days/scripts/lib/render.py:3250— render._top_voices_footer_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 3 (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.
rerank._spelled_from_word_prefixes (cognitive 16) skills/last30days/scripts/lib/rerank.py:545— rerank._spelled_from_word_prefixes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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.
rerank._extract_comment_text (cognitive 16) skills/last30days/scripts/lib/rerank.py:1170— rerank._extract_comment_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (5 pts), ternaries 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.
techmeme.parse_techmeme_response (cognitive 16) skills/last30days/scripts/lib/techmeme.py:217— techmeme.parse_techmeme_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 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.
tiktok._fetch_post_comments (cognitive 16) skills/last30days/scripts/lib/tiktok.py:540— tiktok._fetch_post_comments has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, error handling 2 (4 pts), if/else 2 (4 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.
Near-duplicate member pair (50 shared lines) skills/last30days/scripts/lib/threads.py:136— skills/last30days/scripts/lib/threads.py:136-198 | skills/last30days/scripts/lib/tiktok.py:248-308 — These two members are variants of one another: 50 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 (46 shared lines) skills/last30days/scripts/lib/bird_x.py:639— skills/last30days/scripts/lib/bird_x.py:639-729 | skills/last30days/scripts/lib/bird_x.py:742-826 — These two members are variants of one another: 46 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 (32 corresponding lines) · ×1
Edited copy of a member (32 corresponding lines) skills/last30days/scripts/lib/render.py:401— skills/last30days/scripts/lib/render.py:401-437 | skills/last30days/scripts/lib/render.py:1604-1678 — These two members are one piece of code written twice and then edited apart: 32 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 (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) skills/last30days/scripts/lib/instagram.py:102— skills/last30days/scripts/lib/instagram.py:102-143 | skills/last30days/scripts/lib/reddit.py:101-138 | skills/last30days/scripts/lib/tiktok.py:39-78 | skills/last30days/scripts/lib/youtube_yt.py:521-561 — 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 (36–40 lines × 2) skills/last30days/scripts/lib/xquik.py:237— skills/last30days/scripts/lib/xquik.py:237-276 | skills/last30days/scripts/lib/xquik.py:293-328 — 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 `skills/last30days/scripts/lib/xquik.py:237` 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–32 lines × 2) skills/last30days/scripts/lib/bird_x.py:661— skills/last30days/scripts/lib/bird_x.py:661-692 | skills/last30days/scripts/lib/bird_x.py:761-789 — 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, `skills/last30days/scripts/lib/bird_x.py:660` calls `_extract_core_subject` and `skills/last30days/scripts/lib/bird_x.py:759` 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–28 lines × 3) skills/last30days/scripts/lib/arxiv.py:101— skills/last30days/scripts/lib/arxiv.py:101-128 | skills/last30days/scripts/lib/techmeme.py:108-131 | skills/last30days/scripts/lib/trustpilot.py:363-366 — 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. 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) skills/last30days/scripts/lib/polymarket.py:228— skills/last30days/scripts/lib/polymarket.py:228-251 | skills/last30days/scripts/lib/polymarket.py:283-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. Read the line range as the matched WINDOW rather than a finished unit: at `skills/last30days/scripts/lib/polymarket.py:283` 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 (23 lines × 3) skills/last30days/scripts/lib/pinterest.py:109— skills/last30days/scripts/lib/pinterest.py:109-131 | skills/last30days/scripts/lib/threads.py:136-158 | skills/last30days/scripts/lib/tiktok.py:248-270 — before extracting anything, compare `skills/last30days/scripts/lib/threads.py` and `skills/last30days/scripts/lib/tiktok.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. 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 `skills/last30days/scripts/lib/pinterest.py:109` 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 (23 lines × 2) skills/last30days/scripts/lib/perplexity.py:249— skills/last30days/scripts/lib/perplexity.py:249-271 | skills/last30days/scripts/lib/perplexity.py:311-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 (17–23 lines × 2) skills/last30days/scripts/lib/pipeline.py:2717— skills/last30days/scripts/lib/pipeline.py:2717-2739 | skills/last30days/scripts/lib/pipeline.py:2789-2805 — 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 `skills/last30days/scripts/lib/pipeline.py:2789` 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–23 lines × 2) skills/last30days/scripts/lib/threads.py:176— skills/last30days/scripts/lib/threads.py:176-198 | skills/last30days/scripts/lib/tiktok.py:289-308 — before extracting anything, compare `skills/last30days/scripts/lib/threads.py` and `skills/last30days/scripts/lib/tiktok.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. 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 `skills/last30days/scripts/lib/threads.py:176` 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–22 lines × 2) skills/last30days/scripts/lib/perplexity.py:281— skills/last30days/scripts/lib/perplexity.py:281-302 | skills/last30days/scripts/lib/perplexity.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.
Duplicated block (19–21 lines × 2) skills/last30days/scripts/last30days.py:2564— skills/last30days/scripts/last30days.py:2564-2584 | skills/last30days/scripts/last30days.py:2608-2626 — 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 `skills/last30days/scripts/last30days.py:2564` 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) skills/last30days/scripts/lib/grok_x.py:1114— skills/last30days/scripts/lib/grok_x.py:1114-1134 | skills/last30days/scripts/lib/grok_x.py:1166-1178 — 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 (18–20 lines × 3) skills/last30days/scripts/lib/instagram.py:124— skills/last30days/scripts/lib/instagram.py:124-143 | skills/last30days/scripts/lib/tiktok.py:61-78 | skills/last30days/scripts/lib/youtube_yt.py:543-561 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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.
Duplicated block (20 lines × 2) skills/last30days/scripts/lib/instagram.py:667— skills/last30days/scripts/lib/instagram.py:667-686 | skills/last30days/scripts/lib/tiktok.py:333-352 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 (19 lines × 4) skills/last30days/scripts/lib/instagram.py:102— skills/last30days/scripts/lib/instagram.py:102-120 | skills/last30days/scripts/lib/reddit.py:101-119 | skills/last30days/scripts/lib/tiktok.py:39-57 | skills/last30days/scripts/lib/youtube_yt.py:521-539 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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.
Duplicated block (19 lines × 2) skills/last30days/scripts/last30days.py:191— skills/last30days/scripts/last30days.py:191-210 | skills/last30days/scripts/last30days.py:233-251 — 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 (17–19 lines × 2) skills/last30days/scripts/lib/render.py:420— skills/last30days/scripts/lib/render.py:420-436 | skills/last30days/scripts/lib/render.py:1638-1656 — 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 `skills/last30days/scripts/lib/render.py:420` 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 (17–18 lines × 2) skills/last30days/scripts/lib/grounding.py:95— skills/last30days/scripts/lib/grounding.py:95-112 | skills/last30days/scripts/lib/grounding.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. Read the line range as the matched WINDOW rather than a finished unit: at `skills/last30days/scripts/lib/grounding.py:95` 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) skills/last30days/scripts/lib/digg.py:340— skills/last30days/scripts/lib/digg.py:340-356 | skills/last30days/scripts/lib/techmeme.py:221-236 — 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 (11–17 lines × 2) skills/last30days/scripts/lib/normalize.py:486— skills/last30days/scripts/lib/normalize.py:486-502 | skills/last30days/scripts/lib/normalize.py:602-612 — 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 `skills/last30days/scripts/lib/normalize.py:486` 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–17 lines × 2) skills/last30days/scripts/lib/pipeline.py:4852— skills/last30days/scripts/lib/pipeline.py:4852-4868 | skills/last30days/scripts/lib/pipeline.py:5387-5399 — 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 `skills/last30days/scripts/lib/pipeline.py:4852` 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–16 lines × 5) skills/last30days/scripts/lib/pipeline.py:4711— skills/last30days/scripts/lib/pipeline.py:4711-4723 | skills/last30days/scripts/lib/pipeline.py:4730-4742 | skills/last30days/scripts/lib/pipeline.py:4748-4763 | skills/last30days/scripts/lib/pipeline.py:4768-4780 | skills/last30days/scripts/lib/pipeline.py:4834-4849 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/last30days/scripts/lib/pipeline.py:4710` calls `extend` and `skills/last30days/scripts/lib/pipeline.py:4833` 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 (14 lines × 2) skills/last30days/scripts/lib/instagram.py:924— skills/last30days/scripts/lib/instagram.py:924-937 | skills/last30days/scripts/lib/tiktok.py:566-579 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 `skills/last30days/scripts/lib/instagram.py:924` 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, `skills/last30days/scripts/lib/instagram.py:938` calls `isinstance` and `skills/last30days/scripts/lib/tiktok.py:580` 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–14 lines × 2) skills/last30days/scripts/lib/render.py:406— skills/last30days/scripts/lib/render.py:406-419 | skills/last30days/scripts/lib/render.py:1625-1637 — 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 `skills/last30days/scripts/lib/render.py:406` 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 (12 lines × 3) skills/last30days/scripts/lib/instagram.py:605— skills/last30days/scripts/lib/instagram.py:605-616 | skills/last30days/scripts/lib/threads.py:179-190 | skills/last30days/scripts/lib/tiktok.py:289-300 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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.
Duplicated block (9–12 lines × 2) skills/last30days/scripts/lib/bird_x.py:871— skills/last30days/scripts/lib/bird_x.py:871-882 | skills/last30days/scripts/lib/xquik.py:426-434 — 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–11 lines × 3) skills/last30days/scripts/last30days.py:165— skills/last30days/scripts/last30days.py:165-168 | skills/last30days/scripts/last30days.py:214-224 | skills/last30days/scripts/last30days.py:257-267 — 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 `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 (11 lines × 2) skills/last30days/scripts/lib/normalize.py:673— skills/last30days/scripts/lib/normalize.py:673-686 | skills/last30days/scripts/lib/normalize.py:878-888 — 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 `skills/last30days/scripts/lib/normalize.py:673` 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–10 lines × 3) skills/last30days/scripts/lib/signals.py:224— skills/last30days/scripts/lib/signals.py:224-233 | skills/last30days/scripts/lib/signals.py:237-243 | skills/last30days/scripts/lib/signals.py:250-256 — 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 (9 lines × 3) skills/last30days/scripts/lib/arxiv.py:111— skills/last30days/scripts/lib/arxiv.py:111-119 | skills/last30days/scripts/lib/brightdata.py:240-248 | skills/last30days/scripts/lib/techmeme.py:114-122 — 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) skills/last30days/scripts/lib/instagram.py:792— skills/last30days/scripts/lib/instagram.py:792-799 | skills/last30days/scripts/lib/tiktok.py:446-453 | skills/last30days/scripts/lib/youtube_yt.py:1421-1428 — before extracting anything, compare `skills/last30days/scripts/lib/instagram.py` and `skills/last30days/scripts/lib/tiktok.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 128 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 after the matched lines, `skills/last30days/scripts/lib/instagram.py:801` calls `_budget_expired` and `skills/last30days/scripts/lib/tiktok.py:455` 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 × 3) skills/last30days/scripts/lib/pinterest.py:133— skills/last30days/scripts/lib/pinterest.py:133-139 | skills/last30days/scripts/lib/threads.py:160-166 | skills/last30days/scripts/lib/tiktok.py:272-278 — before extracting anything, compare `skills/last30days/scripts/lib/threads.py` and `skills/last30days/scripts/lib/tiktok.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. 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 `skills/last30days/scripts/lib/pinterest.py:133` 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 (3–7 lines × 3) skills/last30days/scripts/lib/github.py:892— skills/last30days/scripts/lib/github.py:892-894 | skills/last30days/scripts/lib/github.py:941-947 | skills/last30days/scripts/lib/github.py:1247-1253 — 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 (6–7 lines × 2) skills/last30days/scripts/lib/resolve.py:99— skills/last30days/scripts/lib/resolve.py:99-105 | skills/last30days/scripts/lib/resolve.py:121-126 — 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 × 4) skills/last30days/scripts/lib/normalize.py:395— skills/last30days/scripts/lib/normalize.py:395-400 | skills/last30days/scripts/lib/normalize.py:551-556 | skills/last30days/scripts/lib/normalize.py:933-938 | skills/last30days/scripts/lib/normalize.py:1026-1031 — 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 `skills/last30days/scripts/lib/normalize.py:395` 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 (5 lines × 4) skills/last30days/scripts/lib/normalize.py:558— skills/last30days/scripts/lib/normalize.py:558-562 | skills/last30days/scripts/lib/normalize.py:600-604 | skills/last30days/scripts/lib/normalize.py:670-674 | skills/last30days/scripts/lib/normalize.py:875-879 — 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.
Duplicated block (4–5 lines × 5) skills/last30days/scripts/lib/normalize.py:457— skills/last30days/scripts/lib/normalize.py:457-461 | skills/last30days/scripts/lib/normalize.py:486-490 | skills/last30days/scripts/lib/normalize.py:602-606 | skills/last30days/scripts/lib/normalize.py:633-636 | skills/last30days/scripts/lib/normalize.py:1034-1037 — 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. 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, `skills/last30days/scripts/lib/normalize.py:457` calls `_date_confidence` and `skills/last30days/scripts/lib/normalize.py:1034` 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 × 2) mcp/internal/tools/preflight.go:33— mcp/internal/tools/preflight.go:33-47 | mcp/internal/tools/research.go:71-85 — 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.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Duplicated predicate skills/last30days/scripts/lib/bird_x.py:842— `"error" in response and response["error"]` appears character-identically in 2 files — skills/last30days/scripts/lib/bird_x.py, skills/last30days/scripts/lib/xai_x.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 skills/last30days/scripts/lib/health.py:353— `candidate.is_file() and os.access(candidate, os.X_OK)` appears character-identically in 2 files — skills/last30days/scripts/lib/health.py, skills/last30days/scripts/lib/setup_wizard.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 skills/last30days/scripts/lib/backends.py:228— `config.get("AUTH_TOKEN") and config.get("CT0")` appears character-identically in 4 files — skills/last30days/scripts/lib/backends.py, skills/last30days/scripts/lib/doctor.py, skills/last30days/scripts/lib/env.py, skills/last30days/scripts/lib/setup_wizard.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 skills/last30days/scripts/lib/pipeline.py:6441— `config.get("GOOGLE_API_KEY") or config.get("GEMINI_API_KEY") or config.get("GOOGLE_GENAI_API_KEY")` appears character-identically in 2 files — skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/providers.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 skills/last30days/scripts/lib/doctor.py:973— `config.get("LAST30DAYS_MEMORY_DIR") or library.DEFAULT_MEMORY_DIR` appears character-identically in 2 files — skills/last30days/scripts/lib/doctor.py, skills/last30days/scripts/lib/pipeline.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 skills/last30days/scripts/lib/pipeline.py:2081— `config.get("LAST30DAYS_REASONING_PROVIDER") or "auto"` appears character-identically in 2 files — skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/providers.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 skills/last30days/scripts/last30days.py:3767— `config.get("PERPLEXITY_API_KEY") or config.get("OPENROUTER_API_KEY")` appears character-identically in 2 files — skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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 skills/last30days/scripts/lib/instagram.py:117— `core.lower() != original_clean.lower() and len(original_clean.split()) <= 8` appears character-identically in 4 files — skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/tiktok.py, skills/last30days/scripts/lib/youtube_yt.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 skills/last30days/scripts/lib/instagram.py:929— `data.get("comments") or data.get("data") or []` appears character-identically in 2 files — skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/tiktok.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 skills/last30days/scripts/lib/grok_x.py:1052— `deadline is not None and time.monotonic() >= deadline` appears character-identically in 5 files — skills/last30days/scripts/lib/grok_x.py, skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/x_api.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 skills/last30days/scripts/lib/http.py:995— `deadline_monotonic is not None and time.monotonic() >= deadline_monotonic` appears character-identically in 2 files — skills/last30days/scripts/lib/http.py, skills/last30days/scripts/lib/subproc.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 skills/last30days/scripts/lib/instagram.py:611— `i["date"] and from_date <= i["date"] <= to_date` appears character-identically in 4 files — skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/linkedin.py, skills/last30days/scripts/lib/threads.py, skills/last30days/scripts/lib/tiktok.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 skills/last30days/scripts/lib/rerank.py:980— `isinstance(item.metadata, dict) and item.metadata.get("grounding_exempt")` appears character-identically in 2 files — skills/last30days/scripts/lib/rerank.py, skills/last30days/scripts/lib/signals.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 skills/last30days/scripts/last30days.py:3403— `it.metadata.get("transcript_highlights") or it.metadata.get("transcript_snippet")` appears character-identically in 3 files — skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/render.py, skills/last30days/scripts/lib/youtube_yt.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 skills/last30days/scripts/lib/freshness.py:104— `item.metadata.get("outcome_prices") or []` appears character-identically in 2 files — skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/render.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 skills/last30days/scripts/lib/freshness.py:165— `item.metadata.get("symbol") or item.container or ""` appears character-identically in 2 files — skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/stocktwits.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 skills/last30days/scripts/lib/reddit.py:617— `item["date"] and from_date <= item["date"] <= to_date` appears character-identically in 2 files — skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/telegram.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 skills/last30days/scripts/lib/bird_x.py:875— `len(created_at) > 10 and created_at[10] == "T"` appears character-identically in 2 files — skills/last30days/scripts/lib/bird_x.py, skills/last30days/scripts/lib/xquik.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 skills/last30days/scripts/lib/pipeline.py:608— `len(word) > 4 and word.endswith("s") and not word.endswith("ss")` appears character-identically in 2 files — skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/reddit_listing.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 skills/last30days/scripts/lib/reddit.py:729— `not body or body in ("[deleted]", "[removed]")` appears character-identically in 3 files — skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/reddit_enrich.py, skills/last30days/scripts/lib/reddit_shreddit.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 skills/last30days/scripts/lib/render.py:3689— `not comments or not isinstance(comments[0], dict)` appears character-identically in 2 files — skills/last30days/scripts/lib/render.py, skills/last30days/scripts/lib/signals.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 skills/last30days/scripts/lib/freshness.py:115— `not isinstance(value, (int, float)) or isinstance(value, bool)` appears character-identically in 2 files — skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/pipeline.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 skills/last30days/scripts/lib/health.py:308— `os.environ.get("LOCALAPPDATA") or os.environ.get("LocalAppData")` appears character-identically in 2 files — skills/last30days/scripts/lib/health.py, skills/last30days/scripts/lib/setup_wizard.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 skills/last30days/scripts/last30days.py:4260— `requested_sources and "amazon" in requested_sources` appears character-identically in 2 files — skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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 skills/last30days/scripts/last30days.py:4284— `requested_sources and "meta_ads" in requested_sources` appears character-identically in 2 files — skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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 on parse failure skills/last30days/scripts/lib/amazon.py:200— `_as_int` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/dates.py:134— `get_date_confidence` returns `'low'` 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 skills/last30days/scripts/lib/devto.py:105— `_window_days` returns `30` 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 skills/last30days/scripts/lib/digg.py:329— `_rank_score` returns `0.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.
Silent fallback default on parse failure skills/last30days/scripts/lib/doctor.py:1533— `_age_label` returns `''` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/env.py:1389— `reddit_sc_min_items` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/env.py:1400— `youtube_sc_min_items` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/hosted.py:117— `_parse_error_body` returns `{}` when `(json.JSONDecodeError, 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 skills/last30days/scripts/lib/jobs.py:457— `_walk_jsonld` returns `[]` when `(json.JSONDecodeError, 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 skills/last30days/scripts/lib/jobs.py:670— `_domain` 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 skills/last30days/scripts/lib/meta_ads.py:434— `_envelope_total` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/polymarket.py:579— `_parse_outcome_prices` returns `[]` when `(json.JSONDecodeError, 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 skills/last30days/scripts/lib/polymarket.py:753— `market_volume` (in `parse_polymarket_response`) returns `0` 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 skills/last30days/scripts/lib/reddit.py:500— `_window_to_time_filter` returns `'month'` 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 skills/last30days/scripts/lib/setup_wizard.py:1022— `_clamp_device_interval` returns `5` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/signals.py:114— `log1p_safe` returns `0.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.
Silent fallback default on parse failure skills/last30days/scripts/lib/web_search_keyless.py:76— `_domain` returns `''` when `(ValueError, AttributeError)` 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 skills/last30days/scripts/lib/x_envelope.py:353— `_int` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/xiaohongshu_api.py:34— `_to_int` 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.
Silent fallback default on parse failure skills/last30days/scripts/lib/youtube_yt.py:967— `_transcript_fast_attempts` returns `1` 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.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/youtube_yt.py:811— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/web_search_keyless.py:47— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/web_search_keyless.py:51— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/web_search_keyless.py:61— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/web_search_keyless.py:64— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/web_search_keyless.py:66— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/reddit_shreddit.py:71— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/reddit_search.py:56— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex skills/last30days/scripts/lib/jobs.py:413— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
README/code drift README.md:274— README advertises Docker containerisation, but no Dockerfile/compose file exists — searched for: `dockerfile`, `docker-compose`, `compose.yaml`, `compose.yml`. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest and configuration files (package.json and other *.json, *.csproj, *.props, *.sln/*.slnx, *.yml, *.toml, *.config, tool configs such as eslint.config.js, Dockerfile); the README's own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read — a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong.
README/code drift docs/search-quality-eval.md:39— docs/search-quality-eval.md documents the environment variable `GEMINI_MODEL`, 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/solutions/architecture-patterns/discovery-checkpoint-protocol-design-conventions.md:156— docs/solutions/architecture-patterns/discovery-checkpoint-protocol-design-conventions.md names `discovery_judge.py`, but no file or folder `discovery_judge.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 docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md:25— docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md links to `url`, but `docs/solutions/integration-issues/url` 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 docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md:45— docs/solutions/integration-issues/claude-code-reattach-preview-flattens-links.md documents the environment variable `FORCE_HYPERLINK`, 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/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:36— docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md names `skills/last30days/scripts/sync.sh`, but no file or folder `skills/last30days/scripts/sync.sh` 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/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:43— docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md names `sync.sh`, but no file or folder `sync.sh` 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/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md:74— docs/solutions/workflow-issues/release-consistency-test-cascade-2026-05-16.md documents the environment variable `SKILL_VERSION`, 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.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 10 significant file(s) lose their only recent owner: skills/last30days/scripts/lib/schema.py, skills/last30days/scripts/lib/amazon.py, skills/last30days/scripts/lib/backends.py, skills/last30days/scripts/lib/x_envelope.py, skills/last30days/scripts/lib/library_index.py, skills/last30days/scripts/lib/techmeme.py, skills/last30days/scripts/lib/reddit_enrich.py, skills/last30days/scripts/box_chrome_login.py (+2 more). Pair on, review, or document these before any departure.
D16 · Bus Factor· Further sole-owners (lower concentration) · ×1
Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (12 single-owned of 111 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; 111 of the 128 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: skills/last30days/scripts/lib/hiring_signals.py, skills/last30days/scripts/lib/cjk.py.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (61699 LoC, 210 module-visible types across 3 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 1 of 111 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 111 of the 128 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: skills/last30days/scripts/lib/xiaohongshu_api.py. 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.
Orphaned file skills/last30days/scripts/lib/xiaohongshu_api.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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
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 release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
Subsumed condition operand skills/last30days/scripts/lib/polymarket.py:161— `word.endswith("s")` can never decide this `&&` — every value satisfying `word.endswith("es")` also satisfies `word.endswith("s")`, so the `&&` chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Outdated: github.com/mark3labs/mcp-go — `github.com/mark3labs/mcp-go` is required at v1.2.1 in REDACTED, but v1.3.0 is the module's current release — so this build is missing every fix published since, including any security fix. Run `go get github.com/mark3labs/mcp-go@v1.3.0 && go mod tidy` and commit the updated REDACTED and go.sum.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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 01a17112-fffa-7ef8-b5ec-59850120bdcc · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Warnings: 606 · Recommendations: 75 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 03:20 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.